{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6YCE5E2JMFDXUUNGBSZL2PXQR3","short_pith_number":"pith:6YCE5E2J","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"},"canonical_sha256":"f6044e934961477a51a60cb2bd3ef08eceab7f8cfa710d8fb2f33fe7db3610a7","source":{"kind":"arxiv","id":"1512.03547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03547","created_at":"2026-05-18T01:22:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03547v2","created_at":"2026-05-18T01:22:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03547","created_at":"2026-05-18T01:22:32Z"},{"alias_kind":"pith_short_12","alias_value":"6YCE5E2JMFDX","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6YCE5E2JMFDXUUNG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6YCE5E2J","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6YCE5E2JMFDXUUNGBSZL2PXQR3","target":"record","payload":{"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"},"canonical_sha256":"f6044e934961477a51a60cb2bd3ef08eceab7f8cfa710d8fb2f33fe7db3610a7","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"},"source_kind":"arxiv","source_id":"1512.03547","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UDKaNPWQoGFId66bheeHnnjUDxYQ089/stsezbcgO0I1D/tucotDGu6XcXl9ps/wxaSHdKrQyM/CUXufMVOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:28:46.996794Z"},"content_sha256":"82943aa68f1f1ab89c600ccf5cf8fa1c4061d3b3fea630e0049bf8f2babac97d","schema_version":"1.0","event_id":"sha256:82943aa68f1f1ab89c600ccf5cf8fa1c4061d3b3fea630e0049bf8f2babac97d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6YCE5E2JMFDXUUNGBSZL2PXQR3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OTrfToSazmtqeges89XMqCYjV4hkLGhIOOJP9nEfVk4Q1B7aS8/Rzym/rWJtn/ey6mWLmNoPZ0F4GWCH0S84Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:28:46.997267Z"},"content_sha256":"7df1a24ff137a9ca1fa78a28a78b4e9c0222f23f3684b341b2aff25865d07bbd","schema_version":"1.0","event_id":"sha256:7df1a24ff137a9ca1fa78a28a78b4e9c0222f23f3684b341b2aff25865d07bbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/bundle.json","state_url":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T19:28:46Z","links":{"resolver":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3","bundle":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/bundle.json","state":"https://pith.science/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YCE5E2JMFDXUUNGBSZL2PXQR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6YCE5E2JMFDXUUNGBSZL2PXQR3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7c08d3600fa9ad003978e7ef810ae18fd6dd812ba98206314e6e0f259e05d220","cross_cats_sorted":["cs.CC","math.CO","math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-12-11T08:04:26Z","title_canon_sha256":"cac427c9f8c5bd6c18f3d954851498db931521f845ca843d852413d3288ee683"},"schema_version":"1.0","source":{"id":"1512.03547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03547","created_at":"2026-05-18T01:22:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03547v2","created_at":"2026-05-18T01:22:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03547","created_at":"2026-05-18T01:22:32Z"},{"alias_kind":"pith_short_12","alias_value":"6YCE5E2JMFDX","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6YCE5E2JMFDXUUNG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6YCE5E2J","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:7df1a24ff137a9ca1fa78a28a78b4e9c0222f23f3684b341b2aff25865d07bbd","target":"graph","created_at":"2026-05-18T01:22:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"L\\'aszl\\'o Babai","cross_cats":["cs.CC","math.CO","math.GR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-12-11T08:04:26Z","title":"Graph Isomorphism in Quasipolynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03547","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:82943aa68f1f1ab89c600ccf5cf8fa1c4061d3b3fea630e0049bf8f2babac97d","target":"record","created_at":"2026-05-18T01:22:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7c08d3600fa9ad003978e7ef810ae18fd6dd812ba98206314e6e0f259e05d220","cross_cats_sorted":["cs.CC","math.CO","math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2015-12-11T08:04:26Z","title_canon_sha256":"cac427c9f8c5bd6c18f3d954851498db931521f845ca843d852413d3288ee683"},"schema_version":"1.0","source":{"id":"1512.03547","kind":"arxiv","version":2}},"canonical_sha256":"f6044e934961477a51a60cb2bd3ef08eceab7f8cfa710d8fb2f33fe7db3610a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6044e934961477a51a60cb2bd3ef08eceab7f8cfa710d8fb2f33fe7db3610a7","first_computed_at":"2026-05-18T01:22:32.424875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:32.424875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6g8iTcrcRTz/IifGcq/B6WK79QQa2d6Xj4rEJSZhEy9ERZtbABEyZiEyzMBCoEa0WEmDeMvT3Mwxak7DEUqPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:32.425352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82943aa68f1f1ab89c600ccf5cf8fa1c4061d3b3fea630e0049bf8f2babac97d","sha256:7df1a24ff137a9ca1fa78a28a78b4e9c0222f23f3684b341b2aff25865d07bbd"],"state_sha256":"b56802418c7a2f5080d8b13d63dd2436d053a886b3e346b15154efbd98650637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adEd45WnKmjKAkPJJy5bT5w0tVk3TBh9BKZ7nu6EEc498CTIhJbQu3J6PIUTkvTxmBtkL7wcSCEVcHw9tH8oAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T19:28:47.000971Z","bundle_sha256":"5d52352a21a3077c9db8c8dcdc5df421e51f287020c8bde03337e99d1c1ef128"}}