{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6YCE5E2JMFDXUUNGBSZL2PXQR3","short_pith_number":"pith:6YCE5E2J","schema_version":"1.0","canonical_sha256":"f6044e934961477a51a60cb2bd3ef08eceab7f8cfa710d8fb2f33fe7db3610a7","source":{"kind":"arxiv","id":"1512.03547","version":2},"attestation_state":"computed","paper":{"title":"Graph Isomorphism in Quasipolynomial Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO","math.GR"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Babai","submitted_at":"2015-12-11T08:04:26Z","abstract_excerpt":"We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and Coset Intersection (CI) can be solved in quasipolynomial ($\\exp((\\log n)^{O(1)})$) time. The best previous bound for GI was $\\exp(O(\\sqrt{n\\log n}))$, where $n$ is the number of vertices (Luks, 1983); for the other two problems, the bound was similar, $\\exp(\\tilde{O}(\\sqrt{n}))$, where $n$ is the size of the permutation domain (Babai, 1983).\n  The algorithm builds on Luks's SI framework and attacks the barrier configurations for Luks's algorithm by group theoretic \"local"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.03547","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-12-11T08:04:26Z","cross_cats_sorted":["cs.CC","math.CO","math.GR"],"title_canon_sha256":"cac427c9f8c5bd6c18f3d954851498db931521f845ca843d852413d3288ee683","abstract_canon_sha256":"7c08d3600fa9ad003978e7ef810ae18fd6dd812ba98206314e6e0f259e05d220"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:32.425352Z","signature_b64":"6g8iTcrcRTz/IifGcq/B6WK79QQa2d6Xj4rEJSZhEy9ERZtbABEyZiEyzMBCoEa0WEmDeMvT3Mwxak7DEUqPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6044e934961477a51a60cb2bd3ef08eceab7f8cfa710d8fb2f33fe7db3610a7","last_reissued_at":"2026-05-18T01:22:32.424875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:32.424875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Isomorphism in Quasipolynomial Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO","math.GR"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o Babai","submitted_at":"2015-12-11T08:04:26Z","abstract_excerpt":"We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and Coset Intersection (CI) can be solved in quasipolynomial ($\\exp((\\log n)^{O(1)})$) time. The best previous bound for GI was $\\exp(O(\\sqrt{n\\log n}))$, where $n$ is the number of vertices (Luks, 1983); for the other two problems, the bound was similar, $\\exp(\\tilde{O}(\\sqrt{n}))$, where $n$ is the size of the permutation domain (Babai, 1983).\n  The algorithm builds on Luks's SI framework and attacks the barrier configurations for Luks's algorithm by group theoretic \"local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03547","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.03547","created_at":"2026-05-18T01:22:32.424961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03547v2","created_at":"2026-05-18T01:22:32.424961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03547","created_at":"2026-05-18T01:22:32.424961+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YCE5E2JMFDX","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YCE5E2JMFDXUUNG","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YCE5E2J","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17687","citing_title":"On circulant ternary coherent configurations of prime degree","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3","json":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3.json","graph_json":"https://pith.science/api/pith-number/6YCE5E2JMFDXUUNGBSZL2PXQR3/graph.json","events_json":"https://pith.science/api/pith-number/6YCE5E2JMFDXUUNGBSZL2PXQR3/events.json","paper":"https://pith.science/paper/6YCE5E2J"},"agent_actions":{"view_html":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3","download_json":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3.json","view_paper":"https://pith.science/paper/6YCE5E2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03547&json=true","fetch_graph":"https://pith.science/api/pith-number/6YCE5E2JMFDXUUNGBSZL2PXQR3/graph.json","fetch_events":"https://pith.science/api/pith-number/6YCE5E2JMFDXUUNGBSZL2PXQR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/action/storage_attestation","attest_author":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/action/author_attestation","sign_citation":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/action/citation_signature","submit_replication":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/action/replication_record"}},"created_at":"2026-05-18T01:22:32.424961+00:00","updated_at":"2026-05-18T01:22:32.424961+00:00"}