{"payload":{"header_redesign_enabled":false,"results":[{"id":"286537213","archived":false,"color":"#f34b7d","followers":12,"has_funding_file":false,"hl_name":"mit-acl/separator","hl_trunc_description":"Linear separability (via planes) of two sets of 3D points","language":"C++","mirror":false,"owned_by_organization":true,"public":true,"repo":{"repository":{"id":286537213,"name":"separator","owner_id":48329234,"owner_login":"mit-acl","updated_at":"2022-01-21T20:41:40.513Z","has_issues":true}},"sponsorable":false,"topics":["linear-programming","convex-hull","glpk","polyhedra","feasibility","linear-separability","planes","3d-points"],"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":70,"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%253Amit-acl%252Fseparator%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/mit-acl/separator/star":{"post":"WIBif1Cq8qssLNGiokuniv52w-UyygOrwOW7bl4IJN_wCMgjM1rclepOw-5vNNOOW9FpKX5dgd00hujf-VJD5Q"},"/mit-acl/separator/unstar":{"post":"fYVqdf4BAFI0ngsveRiBFaRa72z70x49zC_yOwtDCVryzr4AQ-nxZ2uFri4b2xMNXiByi_HaM3OrdK11q87ajg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"eeHvsiyR8Ur3r0R2ZggFuKSauE1qUWLM5qOtf0_1fynHZgFOOJXdkJOrfTZDFcy1DnEJ-JE75VCFnNbkSNZFLg"}}},"title":"Repository search results"}