{"payload":{"header_redesign_enabled":false,"results":[{"id":"153701564","archived":false,"color":"#DA5B0B","followers":3,"has_funding_file":false,"hl_name":"bernovie/QAOA-MaxClique","hl_trunc_description":"This repository holds the code to a Quantum Approximate Optimization Algorithm for the Max Clique problem in Graph Theory.","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":153701564,"name":"QAOA-MaxClique","owner_id":14140088,"owner_login":"bernovie","updated_at":"2020-04-15T00:20:16.307Z","has_issues":true}},"sponsorable":false,"topics":[],"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":66,"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%253Abernovie%252FQAOA-MaxClique%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/bernovie/QAOA-MaxClique/star":{"post":"ZHQdsvYcxh6FTHAVi2xpyXdHS1U2zB9ByTbB2PBquUn8EUVOC1MNQwmlXFS1vvdSsVcJxZlDkPIWqG1p2G3ctg"},"/bernovie/QAOA-MaxClique/unstar":{"post":"YNQ0x8CuUz8IDiqHVFt1DCsOdYZwDjwMmPywTveoMYWbU-Vp5WYjvHKUWqPGlOls478jObDplylF_7PSLpAErA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"347hdgxkkdFdntcPweEmpz2MJYI7111cq2F82-t83YGKKPUTXkeT9nICP_iSzsp0V_M2T4tZUU2Pipw5FyBddA"}}},"title":"Repository search results"}