{"payload":{"header_redesign_enabled":false,"results":[{"id":"238407443","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"haruncetin/outsourcable_tasks_sequenced","hl_trunc_description":"Determining maximum outsourcable tasks maintaining sequence order.","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":238407443,"name":"outsourcable_tasks_sequenced","owner_id":4430553,"owner_login":"haruncetin","updated_at":"2020-02-05T09:45:44.141Z","has_issues":true}},"sponsorable":false,"topics":["algorithms","dynamic-programming","task-sequence","task-scheduling"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":47,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Aharuncetin%252Foutsourcable_tasks_sequenced%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/haruncetin/outsourcable_tasks_sequenced/star":{"post":"Uiir_3ymLbrSd-NnxVJUw9mlZUqUlsDj_QLTZVrDrBD2bbbGnHe8J5ECIUC9Z6hFecMHsosOtLQXb-qD5JprBQ"},"/haruncetin/outsourcable_tasks_sequenced/unstar":{"post":"tWzyqZ_kd_sc1gKiP9gol6-31FBH4nUTHAXhVjGNiuaJH95LSSCW2PhBBhVdTDmxoBe2HmOpWoET7vxKwlGhNg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"wQqibvb1U-kK54O0qU5Ey8J40ppteEzxjluQwQ4xNS6zq7lUH8GKFlN79M18Jriyii-g_c7ynGy933xOvRUizw"}}},"title":"Repository search results"}