{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SJRYFTXSYX37ZM6H4HD2O7WQNI","short_pith_number":"pith:SJRYFTXS","schema_version":"1.0","canonical_sha256":"926382cef2c5f7fcb3c7e1c7a77ed06a265bdfe8450013ad246e5ff9547261d0","source":{"kind":"arxiv","id":"1206.2999","version":2},"attestation_state":"computed","paper":{"title":"Non-interacting multi-particle quantum random walks applied to the graph isomorphism problem for strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric Bach, John King Gamble, Kenneth Rudinger, Mark Friesen, Mark Wellons, Robert Joynt, S. N. Coppersmith","submitted_at":"2012-06-14T04:45:03Z","abstract_excerpt":"We investigate the quantum dynamics of particles on graphs (\"quantum random walks\"), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on quantum random walks of multiple non-interacting particles on strongly regular graphs (SRGs), a class of graphs with high symmetry that is known to have pairs of graphs that are hard to distinguish. Previous work has already demonstrated analytically that two-particle non-interacting quantum walks cannot distinguish non-isomorphic SRGs of the same family. H"},"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":"1206.2999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-14T04:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"57194836dc7ebeb7354bb3efab99196ee77c00bc31f51295d7543bfaeda97fe4","abstract_canon_sha256":"13fd29b8c4185b130d0ca58d72238e9fdb061bed98212b2770c45cbd8e8fc0c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.548087Z","signature_b64":"IbPV/PVRDjSPURIZmyIe4928RJl0uANIfo2oOQgkflnvMn5Gm+TENdzpArhGSsq1X71nsc+b9yoUhVgVTioJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926382cef2c5f7fcb3c7e1c7a77ed06a265bdfe8450013ad246e5ff9547261d0","last_reissued_at":"2026-05-18T03:15:06.547386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.547386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-interacting multi-particle quantum random walks applied to the graph isomorphism problem for strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric Bach, John King Gamble, Kenneth Rudinger, Mark Friesen, Mark Wellons, Robert Joynt, S. N. Coppersmith","submitted_at":"2012-06-14T04:45:03Z","abstract_excerpt":"We investigate the quantum dynamics of particles on graphs (\"quantum random walks\"), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on quantum random walks of multiple non-interacting particles on strongly regular graphs (SRGs), a class of graphs with high symmetry that is known to have pairs of graphs that are hard to distinguish. Previous work has already demonstrated analytically that two-particle non-interacting quantum walks cannot distinguish non-isomorphic SRGs of the same family. H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2999","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":"1206.2999","created_at":"2026-05-18T03:15:06.547490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.2999v2","created_at":"2026-05-18T03:15:06.547490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2999","created_at":"2026-05-18T03:15:06.547490+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJRYFTXSYX37","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJRYFTXSYX37ZM6H","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJRYFTXS","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI","json":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI.json","graph_json":"https://pith.science/api/pith-number/SJRYFTXSYX37ZM6H4HD2O7WQNI/graph.json","events_json":"https://pith.science/api/pith-number/SJRYFTXSYX37ZM6H4HD2O7WQNI/events.json","paper":"https://pith.science/paper/SJRYFTXS"},"agent_actions":{"view_html":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI","download_json":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI.json","view_paper":"https://pith.science/paper/SJRYFTXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.2999&json=true","fetch_graph":"https://pith.science/api/pith-number/SJRYFTXSYX37ZM6H4HD2O7WQNI/graph.json","fetch_events":"https://pith.science/api/pith-number/SJRYFTXSYX37ZM6H4HD2O7WQNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI/action/storage_attestation","attest_author":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI/action/author_attestation","sign_citation":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI/action/citation_signature","submit_replication":"https://pith.science/pith/SJRYFTXSYX37ZM6H4HD2O7WQNI/action/replication_record"}},"created_at":"2026-05-18T03:15:06.547490+00:00","updated_at":"2026-05-18T03:15:06.547490+00:00"}