{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AXVDE3JU6I64YZDVBRX4KCIAGT","short_pith_number":"pith:AXVDE3JU","schema_version":"1.0","canonical_sha256":"05ea326d34f23dcc64750c6fc5090034d75fd1862da81b45dcac0d5e3d87279a","source":{"kind":"arxiv","id":"1304.3935","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.3935","created_at":"2026-05-18T03:25:34.494749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3935v2","created_at":"2026-05-18T03:25:34.494749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3935","created_at":"2026-05-18T03:25:34.494749+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXVDE3JU6I64","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXVDE3JU6I64YZDV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXVDE3JU","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13953","citing_title":"Parallel Algorithms for Group Isomorphism via Code Equivalence","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT","json":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT.json","graph_json":"https://pith.science/api/pith-number/AXVDE3JU6I64YZDVBRX4KCIAGT/graph.json","events_json":"https://pith.science/api/pith-number/AXVDE3JU6I64YZDVBRX4KCIAGT/events.json","paper":"https://pith.science/paper/AXVDE3JU"},"agent_actions":{"view_html":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT","download_json":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT.json","view_paper":"https://pith.science/paper/AXVDE3JU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3935&json=true","fetch_graph":"https://pith.science/api/pith-number/AXVDE3JU6I64YZDVBRX4KCIAGT/graph.json","fetch_events":"https://pith.science/api/pith-number/AXVDE3JU6I64YZDVBRX4KCIAGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/action/storage_attestation","attest_author":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/action/author_attestation","sign_citation":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/action/citation_signature","submit_replication":"https://pith.science/pith/AXVDE3JU6I64YZDVBRX4KCIAGT/action/replication_record"}},"created_at":"2026-05-18T03:25:34.494749+00:00","updated_at":"2026-05-18T03:25:34.494749+00:00"}