{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M4C4FCP5XKMSENAIEGWYZAJ3FR","short_pith_number":"pith:M4C4FCP5","canonical_record":{"source":{"id":"1309.1776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T20:52:49Z","cross_cats_sorted":["cs.CC","math.GR"],"title_canon_sha256":"1c9d8de805e7ddf64906f6e8f776ae060c56f1b07fbe1b533fba77881569694c","abstract_canon_sha256":"b789fd9a793342587e70f80827850581c73a77a2db44394bccf720086677e3f4"},"schema_version":"1.0"},"canonical_sha256":"6705c289fdba9922340821ad8c813b2c631b76deeab83eae147d5bcb579a1318","source":{"kind":"arxiv","id":"1309.1776","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1776","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1776v2","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1776","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"M4C4FCP5XKMS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M4C4FCP5XKMSENAI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M4C4FCP5","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M4C4FCP5XKMSENAIEGWYZAJ3FR","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T20:52:49Z","cross_cats_sorted":["cs.CC","math.GR"],"title_canon_sha256":"1c9d8de805e7ddf64906f6e8f776ae060c56f1b07fbe1b533fba77881569694c","abstract_canon_sha256":"b789fd9a793342587e70f80827850581c73a77a2db44394bccf720086677e3f4"},"schema_version":"1.0"},"canonical_sha256":"6705c289fdba9922340821ad8c813b2c631b76deeab83eae147d5bcb579a1318","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:43.444807Z","signature_b64":"KSwWbrZBw0hBC9AoNREHH1vQD2Dg/0qVGeEkqcGT17ITuFx7wx54o6HfaUIqpHVmi87qjgu2BAHuEdTm3JgbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6705c289fdba9922340821ad8c813b2c631b76deeab83eae147d5bcb579a1318","last_reissued_at":"2026-05-18T00:46:43.444244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:43.444244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1776","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-18T00:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kRuWkklLoEWtsGXs7MVnmOPybjIoBEKZaMPKN1dnLMXnFcXXCB6MafmqCuqvgPxDFeu+FHyBYzMczvuyAU8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:08:30.144272Z"},"content_sha256":"022f994bae8b1db4bb4358a58ea0b60a7f78e4e2497c635dc202740c2829042f","schema_version":"1.0","event_id":"sha256:022f994bae8b1db4bb4358a58ea0b60a7f78e4e2497c635dc202740c2829042f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M4C4FCP5XKMSENAIEGWYZAJ3FR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for group isomorphism via group extensions and cohomology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.GR"],"primary_cat":"cs.DS","authors_text":"Joshua A. Grochow, Youming Qiao","submitted_at":"2013-09-06T20:52:49Z","abstract_excerpt":"The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent progress, we revisit the strategy for GpI via the extension theory of groups.\n  The extension theory describes how a normal subgroup N is related to G/N via G, and this naturally leads to a divide-and-conquer strategy that splits GpI into two subproblems: one regarding group actions on other groups, and one regarding group cohomology. When the normal subgroup "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1776","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-18T00:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIhF8/i+8uoEoNU5tJfq37d+HaefybJbiHC94LAPdPjcqxl+TRjXGYOsWSXA24ECaSQHQL/g2phR3hMkbKE7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:08:30.144632Z"},"content_sha256":"beac1b8cb0b341df8b9c263f3cb3741f44e7f297a9fb1f690abe117b5f17d77a","schema_version":"1.0","event_id":"sha256:beac1b8cb0b341df8b9c263f3cb3741f44e7f297a9fb1f690abe117b5f17d77a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4C4FCP5XKMSENAIEGWYZAJ3FR/bundle.json","state_url":"https://pith.science/pith/M4C4FCP5XKMSENAIEGWYZAJ3FR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4C4FCP5XKMSENAIEGWYZAJ3FR/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-28T11:08:30Z","links":{"resolver":"https://pith.science/pith/M4C4FCP5XKMSENAIEGWYZAJ3FR","bundle":"https://pith.science/pith/M4C4FCP5XKMSENAIEGWYZAJ3FR/bundle.json","state":"https://pith.science/pith/M4C4FCP5XKMSENAIEGWYZAJ3FR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4C4FCP5XKMSENAIEGWYZAJ3FR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M4C4FCP5XKMSENAIEGWYZAJ3FR","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":"b789fd9a793342587e70f80827850581c73a77a2db44394bccf720086677e3f4","cross_cats_sorted":["cs.CC","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T20:52:49Z","title_canon_sha256":"1c9d8de805e7ddf64906f6e8f776ae060c56f1b07fbe1b533fba77881569694c"},"schema_version":"1.0","source":{"id":"1309.1776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1776","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1776v2","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1776","created_at":"2026-05-18T00:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"M4C4FCP5XKMS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M4C4FCP5XKMSENAI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M4C4FCP5","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:beac1b8cb0b341df8b9c263f3cb3741f44e7f297a9fb1f690abe117b5f17d77a","target":"graph","created_at":"2026-05-18T00:46:43Z","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":"The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent progress, we revisit the strategy for GpI via the extension theory of groups.\n  The extension theory describes how a normal subgroup N is related to G/N via G, and this naturally leads to a divide-and-conquer strategy that splits GpI into two subproblems: one regarding group actions on other groups, and one regarding group cohomology. When the normal subgroup ","authors_text":"Joshua A. Grochow, Youming Qiao","cross_cats":["cs.CC","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T20:52:49Z","title":"Algorithms for group isomorphism via group extensions and cohomology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1776","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:022f994bae8b1db4bb4358a58ea0b60a7f78e4e2497c635dc202740c2829042f","target":"record","created_at":"2026-05-18T00:46:43Z","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":"b789fd9a793342587e70f80827850581c73a77a2db44394bccf720086677e3f4","cross_cats_sorted":["cs.CC","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T20:52:49Z","title_canon_sha256":"1c9d8de805e7ddf64906f6e8f776ae060c56f1b07fbe1b533fba77881569694c"},"schema_version":"1.0","source":{"id":"1309.1776","kind":"arxiv","version":2}},"canonical_sha256":"6705c289fdba9922340821ad8c813b2c631b76deeab83eae147d5bcb579a1318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6705c289fdba9922340821ad8c813b2c631b76deeab83eae147d5bcb579a1318","first_computed_at":"2026-05-18T00:46:43.444244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:43.444244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSwWbrZBw0hBC9AoNREHH1vQD2Dg/0qVGeEkqcGT17ITuFx7wx54o6HfaUIqpHVmi87qjgu2BAHuEdTm3JgbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:43.444807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:022f994bae8b1db4bb4358a58ea0b60a7f78e4e2497c635dc202740c2829042f","sha256:beac1b8cb0b341df8b9c263f3cb3741f44e7f297a9fb1f690abe117b5f17d77a"],"state_sha256":"d607fb2053e1e1291a367aceca2afaa97c7bbe93a0546aa3b03ecf1010e4271b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lUuuVmfXzL/2EjlC5Zhn7vJLUv1SnSPH2IHgl0lEM2zRtJruvxe1kT8u0ZDQtZON2e1m2pjA1IJqbK117nPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:08:30.146615Z","bundle_sha256":"a7a22aef769608cb33987822e5b062c6546a4f70b2b490a3e91063fb7e0a9fb3"}}