{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EFX7NJB6UTY2LBQ5KT732FXDT4","short_pith_number":"pith:EFX7NJB6","schema_version":"1.0","canonical_sha256":"216ff6a43ea4f1a5861d54ffbd16e39f0636dafbb0e458fbfa4025b7390c164c","source":{"kind":"arxiv","id":"1304.5773","version":2},"attestation_state":"computed","paper":{"title":"Graph isomorphism and adiabatic quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math-ph","math.CO","math.MP"],"primary_cat":"quant-ph","authors_text":"Frank Gaitan, Lane Clark","submitted_at":"2013-04-21T18:09:17Z","abstract_excerpt":"In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said to be isomorphic; otherwise they are non-isomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. In this paper we present a quantum algorithm that solves arbitrary instances of GI and can also determine all automorphisms of a given graph. We show how the GI problem can be c"},"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.5773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-21T18:09:17Z","cross_cats_sorted":["cs.DS","math-ph","math.CO","math.MP"],"title_canon_sha256":"278ea0ae7eb7bd79542a45f605e59b5c47054b0d7b5ceef7cf613ca92e22ada2","abstract_canon_sha256":"cf0b022619c47d70b4885605eca1fad62bc6b5261b094f7701c990762c44f1ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:35.940952Z","signature_b64":"ppty8ukNFlfN8fed5T7LwCXoCOAov0Rvhd2E1WYrHOmDad1fZ2pshGNXoyTSgL2CHhglYyV9jxgSpw5qJX2QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"216ff6a43ea4f1a5861d54ffbd16e39f0636dafbb0e458fbfa4025b7390c164c","last_reissued_at":"2026-05-18T02:57:35.940247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:35.940247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph isomorphism and adiabatic quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math-ph","math.CO","math.MP"],"primary_cat":"quant-ph","authors_text":"Frank Gaitan, Lane Clark","submitted_at":"2013-04-21T18:09:17Z","abstract_excerpt":"In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said to be isomorphic; otherwise they are non-isomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. In this paper we present a quantum algorithm that solves arbitrary instances of GI and can also determine all automorphisms of a given graph. We show how the GI problem can be c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5773","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.5773","created_at":"2026-05-18T02:57:35.940365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5773v2","created_at":"2026-05-18T02:57:35.940365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5773","created_at":"2026-05-18T02:57:35.940365+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFX7NJB6UTY2","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFX7NJB6UTY2LBQ5","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFX7NJB6","created_at":"2026-05-18T12:27:43.054852+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/EFX7NJB6UTY2LBQ5KT732FXDT4","json":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4.json","graph_json":"https://pith.science/api/pith-number/EFX7NJB6UTY2LBQ5KT732FXDT4/graph.json","events_json":"https://pith.science/api/pith-number/EFX7NJB6UTY2LBQ5KT732FXDT4/events.json","paper":"https://pith.science/paper/EFX7NJB6"},"agent_actions":{"view_html":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4","download_json":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4.json","view_paper":"https://pith.science/paper/EFX7NJB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5773&json=true","fetch_graph":"https://pith.science/api/pith-number/EFX7NJB6UTY2LBQ5KT732FXDT4/graph.json","fetch_events":"https://pith.science/api/pith-number/EFX7NJB6UTY2LBQ5KT732FXDT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4/action/storage_attestation","attest_author":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4/action/author_attestation","sign_citation":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4/action/citation_signature","submit_replication":"https://pith.science/pith/EFX7NJB6UTY2LBQ5KT732FXDT4/action/replication_record"}},"created_at":"2026-05-18T02:57:35.940365+00:00","updated_at":"2026-05-18T02:57:35.940365+00:00"}