{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IT5HY6FGVCMZEWOL67H52UFQUY","short_pith_number":"pith:IT5HY6FG","canonical_record":{"source":{"id":"1710.04574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-12T15:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"02b026686ea257524ba394a633cd240c8d880ef662df457fc3556375c19872d8","abstract_canon_sha256":"2c879a3321830af430269002f9662cb055ba80aa45bacf3fd9f08aaefa8334ed"},"schema_version":"1.0"},"canonical_sha256":"44fa7c78a6a8999259cbf7cfdd50b0a60148cf8b8864c51e720ecef14bcbc046","source":{"kind":"arxiv","id":"1710.04574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04574","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04574v1","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04574","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"IT5HY6FGVCMZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IT5HY6FGVCMZEWOL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IT5HY6FG","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IT5HY6FGVCMZEWOL67H52UFQUY","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-12T15:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"02b026686ea257524ba394a633cd240c8d880ef662df457fc3556375c19872d8","abstract_canon_sha256":"2c879a3321830af430269002f9662cb055ba80aa45bacf3fd9f08aaefa8334ed"},"schema_version":"1.0"},"canonical_sha256":"44fa7c78a6a8999259cbf7cfdd50b0a60148cf8b8864c51e720ecef14bcbc046","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.631686Z","signature_b64":"xLA9WLBcMrlp/RY1eycO/D3YqUSMhCqOESppoWE3F5eKXBOtCuxX6a63yH/MdfZnFsn3EMjWqFoidEy8KjVNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44fa7c78a6a8999259cbf7cfdd50b0a60148cf8b8864c51e720ecef14bcbc046","last_reissued_at":"2026-05-18T00:33:00.631043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.631043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04574","source_version":1,"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-18T00:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPzCur826ib8pn2OSLcDEleuT1itgfJIMskBvMKxOMWwbVFRdPF3b/3qxhSigfHwbKUTh/K+cBl50ge/6832CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:11:56.625416Z"},"content_sha256":"24f997f91f7f701bcb3c63505c82e66fd40c466eb6b1762c6a130775a70563ca","schema_version":"1.0","event_id":"sha256:24f997f91f7f701bcb3c63505c82e66fd40c466eb6b1762c6a130775a70563ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IT5HY6FGVCMZEWOL67H52UFQUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph isomorphisms in quasi-polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Daniele Dona, Harald Andr\\'es Helfgott, Jitendra Bajpai","submitted_at":"2017-10-12T15:44:49Z","abstract_excerpt":"Let us be given two graphs $\\Gamma_1$, $\\Gamma_2$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $\\Gamma_1$ to $\\Gamma_2$ can be identified with a coset $H\\cdot\\pi$ inside the symmetric group on $n$ elements. How do we find $\\pi$ and a set of generators of $H$?\n  The challenge of giving an always efficient algorithm answering these questions remained open for a long time. Babai has recently shown how to solve these problems -- and others linked to them -- in quasi-polynomial time, i.e. in time $\\exp\\left(O(\\log n)^{O(1)}\\right)$. His strategy is based in part o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04574","kind":"arxiv","version":1},"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-18T00:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhSOPajlV9UKJfWJdo25dd1kKFFE+h/cgKNseLtltw2OsJBQiTCJkBeKoDF6DIKLMzZLxhqonKlwv6lAOzmVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:11:56.626062Z"},"content_sha256":"3f5f994c14a52a11504828a4f26c7867282dad9432de93190977e549c5aec11e","schema_version":"1.0","event_id":"sha256:3f5f994c14a52a11504828a4f26c7867282dad9432de93190977e549c5aec11e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT5HY6FGVCMZEWOL67H52UFQUY/bundle.json","state_url":"https://pith.science/pith/IT5HY6FGVCMZEWOL67H52UFQUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT5HY6FGVCMZEWOL67H52UFQUY/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-27T13:11:56Z","links":{"resolver":"https://pith.science/pith/IT5HY6FGVCMZEWOL67H52UFQUY","bundle":"https://pith.science/pith/IT5HY6FGVCMZEWOL67H52UFQUY/bundle.json","state":"https://pith.science/pith/IT5HY6FGVCMZEWOL67H52UFQUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT5HY6FGVCMZEWOL67H52UFQUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IT5HY6FGVCMZEWOL67H52UFQUY","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":"2c879a3321830af430269002f9662cb055ba80aa45bacf3fd9f08aaefa8334ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-12T15:44:49Z","title_canon_sha256":"02b026686ea257524ba394a633cd240c8d880ef662df457fc3556375c19872d8"},"schema_version":"1.0","source":{"id":"1710.04574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04574","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04574v1","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04574","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"IT5HY6FGVCMZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IT5HY6FGVCMZEWOL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IT5HY6FG","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:3f5f994c14a52a11504828a4f26c7867282dad9432de93190977e549c5aec11e","target":"graph","created_at":"2026-05-18T00:33:00Z","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":"Let us be given two graphs $\\Gamma_1$, $\\Gamma_2$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $\\Gamma_1$ to $\\Gamma_2$ can be identified with a coset $H\\cdot\\pi$ inside the symmetric group on $n$ elements. How do we find $\\pi$ and a set of generators of $H$?\n  The challenge of giving an always efficient algorithm answering these questions remained open for a long time. Babai has recently shown how to solve these problems -- and others linked to them -- in quasi-polynomial time, i.e. in time $\\exp\\left(O(\\log n)^{O(1)}\\right)$. His strategy is based in part o","authors_text":"Daniele Dona, Harald Andr\\'es Helfgott, Jitendra Bajpai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-12T15:44:49Z","title":"Graph isomorphisms in quasi-polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04574","kind":"arxiv","version":1},"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:24f997f91f7f701bcb3c63505c82e66fd40c466eb6b1762c6a130775a70563ca","target":"record","created_at":"2026-05-18T00:33:00Z","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":"2c879a3321830af430269002f9662cb055ba80aa45bacf3fd9f08aaefa8334ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-12T15:44:49Z","title_canon_sha256":"02b026686ea257524ba394a633cd240c8d880ef662df457fc3556375c19872d8"},"schema_version":"1.0","source":{"id":"1710.04574","kind":"arxiv","version":1}},"canonical_sha256":"44fa7c78a6a8999259cbf7cfdd50b0a60148cf8b8864c51e720ecef14bcbc046","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44fa7c78a6a8999259cbf7cfdd50b0a60148cf8b8864c51e720ecef14bcbc046","first_computed_at":"2026-05-18T00:33:00.631043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:00.631043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xLA9WLBcMrlp/RY1eycO/D3YqUSMhCqOESppoWE3F5eKXBOtCuxX6a63yH/MdfZnFsn3EMjWqFoidEy8KjVNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:00.631686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24f997f91f7f701bcb3c63505c82e66fd40c466eb6b1762c6a130775a70563ca","sha256:3f5f994c14a52a11504828a4f26c7867282dad9432de93190977e549c5aec11e"],"state_sha256":"f6f018904038e2d96c2a457bb09f990d9c60a6e082d6c1a88ae83e54329b6fb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzK287FhDI8fudSkjya5lBYiqfr865WDg0iujE9UjpeJG97yfIWZ8Ao018nRVIMEo+tpu2Bj3pf4Po0pfV7bCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:11:56.630154Z","bundle_sha256":"595e3071c986bc0a168a903fa027318574d6a2a54f63d76f1196375909b937fb"}}