{"payload":{"header_redesign_enabled":false,"results":[{"id":"261431548","archived":false,"color":"#DA5B0B","followers":2,"has_funding_file":false,"hl_name":"aru71727/Quantum-Factoring21","hl_trunc_description":"Shor’s algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space,","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":261431548,"name":"Quantum-Factoring21","owner_id":42546323,"owner_login":"aru71727","updated_at":"2020-05-07T06:51:46.952Z","has_issues":true}},"sponsorable":false,"topics":["quantum","factor","python3","quantum-computing","factorization","factor-analysis","quantum-algorithms","factorization-algorithm"],"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":131,"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%253Aaru71727%252FQuantum-Factoring21%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/aru71727/Quantum-Factoring21/star":{"post":"5D9aUAKu_8apWPryAXuiL5sFpBxfHFL_GGKOrh6BfNXndtfSoN-61N-IKR5b95P47PHYlKYUP7b2kYpT-mQ3rg"},"/aru71727/Quantum-Factoring21/unstar":{"post":"4UCY9i1XTTMwEYTMqacsdZltobKYFVdB_dYChxNdhDuJGkvgDFgJI4Ke4C8Bexh5RMmfyozwQqdgT0jTaZbAGA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"2WfxhwZmPy1yrmcASEopBubjah-l0Mk9Bdm9MpUreQnNgtmet5DAJIDqqGffCawK-OAtX4Gt6iMo9JuQuswOCQ"}}},"title":"Repository search results"}