{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AXVDE3JU6I64YZDVBRX4KCIAGT","short_pith_number":"pith:AXVDE3JU","canonical_record":{"source":{"id":"1304.3935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-14T19:21:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e2771672ca8a41db98d749326e71187ad8e24aa34ada375c118b7632dec8918b","abstract_canon_sha256":"a0a7e7feeefa4063c3dd6842bf939fcbba65d0c9aa394d5d89b93d9c0b17dba4"},"schema_version":"1.0"},"canonical_sha256":"05ea326d34f23dcc64750c6fc5090034d75fd1862da81b45dcac0d5e3d87279a","source":{"kind":"arxiv","id":"1304.3935","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3935","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3935v2","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3935","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"AXVDE3JU6I64","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AXVDE3JU6I64YZDV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AXVDE3JU","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AXVDE3JU6I64YZDVBRX4KCIAGT","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-14T19:21:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e2771672ca8a41db98d749326e71187ad8e24aa34ada375c118b7632dec8918b","abstract_canon_sha256":"a0a7e7feeefa4063c3dd6842bf939fcbba65d0c9aa394d5d89b93d9c0b17dba4"},"schema_version":"1.0"},"canonical_sha256":"05ea326d34f23dcc64750c6fc5090034d75fd1862da81b45dcac0d5e3d87279a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:34.495198Z","signature_b64":"wt7k7mOTU+bVFVKuilmQxc2VxfgjutKTErX7CgFKs/0wRdDxmhilJ6DoE8a3N2w2qTGpg5gRiaqL5Vr3WgwzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05ea326d34f23dcc64750c6fc5090034d75fd1862da81b45dcac0d5e3d87279a","last_reissued_at":"2026-05-18T03:25:34.494661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:34.494661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3935","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-18T03:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUTP28av/A8Zd+i+rUre7mfrEGO+8tapsAfIkkm6Hks/hEquQap9G4nvTirTs9xJD+4M0ygJy4Hsq781USBfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:27:48.968136Z"},"content_sha256":"3a2732efc49d25fb823b2af7cc0c6c66dc9b791574871599f17ef9eaea67eae0","schema_version":"1.0","event_id":"sha256:3a2732efc49d25fb823b2af7cc0c6c66dc9b791574871599f17ef9eaea67eae0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AXVDE3JU6I64YZDVBRX4KCIAGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"David J. Rosenbaum","submitted_at":"2013-04-14T19:21:14Z","abstract_excerpt":"In this work, we introduce bidirectional collision detection --- a new algorithmic tool that applies to the collision problems that arise in many isomorphism problems. For the group isomorphism problem, we show that bidirectional collision detection yields a deterministic n^((1 / 2) log n + O(1)) time algorithm whereas previously the n^(log n + O(1)) generator-enumeration algorithm was the best result for several decades. For the hard special case of solvable groups, we combine bidirectional collision detection with methods from the author's previous work to obtain a deterministic square-root "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3935","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-18T03:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEGXJs8pnmd+c/dt5ttkfNOSiK9/utOYcLBfMsZedcUL4lZb50tH5Tg9lWga9otfQH9l2tfBeO9CEKC2l8CWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T05:27:48.968677Z"},"content_sha256":"08eb3507460f5b7bfc2698bcc10f967be7ace31fbe59ad7c22f704957ea7a586","schema_version":"1.0","event_id":"sha256:08eb3507460f5b7bfc2698bcc10f967be7ace31fbe59ad7c22f704957ea7a586"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/bundle.json","state_url":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/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-23T05:27:48Z","links":{"resolver":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT","bundle":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/bundle.json","state":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AXVDE3JU6I64YZDVBRX4KCIAGT","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":"a0a7e7feeefa4063c3dd6842bf939fcbba65d0c9aa394d5d89b93d9c0b17dba4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-14T19:21:14Z","title_canon_sha256":"e2771672ca8a41db98d749326e71187ad8e24aa34ada375c118b7632dec8918b"},"schema_version":"1.0","source":{"id":"1304.3935","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3935","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3935v2","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3935","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"AXVDE3JU6I64","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AXVDE3JU6I64YZDV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AXVDE3JU","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:08eb3507460f5b7bfc2698bcc10f967be7ace31fbe59ad7c22f704957ea7a586","target":"graph","created_at":"2026-05-18T03:25:34Z","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":"In this work, we introduce bidirectional collision detection --- a new algorithmic tool that applies to the collision problems that arise in many isomorphism problems. For the group isomorphism problem, we show that bidirectional collision detection yields a deterministic n^((1 / 2) log n + O(1)) time algorithm whereas previously the n^(log n + O(1)) generator-enumeration algorithm was the best result for several decades. For the hard special case of solvable groups, we combine bidirectional collision detection with methods from the author's previous work to obtain a deterministic square-root ","authors_text":"David J. Rosenbaum","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-14T19:21:14Z","title":"Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3935","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:3a2732efc49d25fb823b2af7cc0c6c66dc9b791574871599f17ef9eaea67eae0","target":"record","created_at":"2026-05-18T03:25:34Z","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":"a0a7e7feeefa4063c3dd6842bf939fcbba65d0c9aa394d5d89b93d9c0b17dba4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-14T19:21:14Z","title_canon_sha256":"e2771672ca8a41db98d749326e71187ad8e24aa34ada375c118b7632dec8918b"},"schema_version":"1.0","source":{"id":"1304.3935","kind":"arxiv","version":2}},"canonical_sha256":"05ea326d34f23dcc64750c6fc5090034d75fd1862da81b45dcac0d5e3d87279a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05ea326d34f23dcc64750c6fc5090034d75fd1862da81b45dcac0d5e3d87279a","first_computed_at":"2026-05-18T03:25:34.494661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:34.494661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wt7k7mOTU+bVFVKuilmQxc2VxfgjutKTErX7CgFKs/0wRdDxmhilJ6DoE8a3N2w2qTGpg5gRiaqL5Vr3WgwzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:34.495198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3935","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a2732efc49d25fb823b2af7cc0c6c66dc9b791574871599f17ef9eaea67eae0","sha256:08eb3507460f5b7bfc2698bcc10f967be7ace31fbe59ad7c22f704957ea7a586"],"state_sha256":"675903b0fba87f8eed0d32c8b7a5cd21d78eeb3f158d92fabe93b87cc727865d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQcZ9xT1skEZSGYKGR34RojCuzcaj8jshiHhNI5OzwktUKUPrLm1OgRaeFMY6XfUQ5sYmKIFwwGYfOfmYterDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T05:27:48.973016Z","bundle_sha256":"3fae9be9ae3866c4977585350d60b669c9e961a6930fdabb5c213d28fc5eed87"}}