{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:7BDKLEVDFXF43RBFUPJORF7SS2","short_pith_number":"pith:7BDKLEVD","schema_version":"1.0","canonical_sha256":"f846a592a32dcbcdc425a3d2e897f2969914e04bac2b0b924da12891f68b5d3f","source":{"kind":"arxiv","id":"quant-ph/9901029","version":1},"attestation_state":"computed","paper":{"title":"A Quantum Observable for the Graph Isomorphism Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mark Ettinger (LANL), Peter Hoyer (BRICS)","submitted_at":"1999-01-13T20:35:53Z","abstract_excerpt":"Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\\Co[(S_n \\wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least $1-n!/2^m$ if the graphs are not isomorphic. We do not know if this observable is efficiently implementable."},"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":"quant-ph/9901029","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-01-13T20:35:53Z","cross_cats_sorted":[],"title_canon_sha256":"cf8ce68aeb64500f5444befbce92235f82b5c8db8b87fe8e0a61f3384c3d2876","abstract_canon_sha256":"0f77fb684f81a1fb92fb8878f263a0935cfb7bb6acaf64ee97b4ca75116cf201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:23.339499Z","signature_b64":"O28c7o1kcs4aKkWERHkgmCmi9bWIjYuBtarsewUKkoXkfp1jBubebH0Jpc4uoGWJvjWOGGMqJbWeM02JAkzeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f846a592a32dcbcdc425a3d2e897f2969914e04bac2b0b924da12891f68b5d3f","last_reissued_at":"2026-07-04T14:47:23.339090Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:23.339090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Observable for the Graph Isomorphism Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mark Ettinger (LANL), Peter Hoyer (BRICS)","submitted_at":"1999-01-13T20:35:53Z","abstract_excerpt":"Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\\Co[(S_n \\wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least $1-n!/2^m$ if the graphs are not isomorphic. We do not know if this observable is efficiently implementable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9901029","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9901029/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"quant-ph/9901029","created_at":"2026-07-04T14:47:23.339151+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9901029v1","created_at":"2026-07-04T14:47:23.339151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9901029","created_at":"2026-07-04T14:47:23.339151+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BDKLEVDFXF4","created_at":"2026-07-04T14:47:23.339151+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BDKLEVDFXF43RBF","created_at":"2026-07-04T14:47:23.339151+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BDKLEVD","created_at":"2026-07-04T14:47:23.339151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.00945","citing_title":"The Dynamical Lie Algebra of QAOA-MaxCut on the Complete Graph","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2","json":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2.json","graph_json":"https://pith.science/api/pith-number/7BDKLEVDFXF43RBFUPJORF7SS2/graph.json","events_json":"https://pith.science/api/pith-number/7BDKLEVDFXF43RBFUPJORF7SS2/events.json","paper":"https://pith.science/paper/7BDKLEVD"},"agent_actions":{"view_html":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2","download_json":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2.json","view_paper":"https://pith.science/paper/7BDKLEVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9901029&json=true","fetch_graph":"https://pith.science/api/pith-number/7BDKLEVDFXF43RBFUPJORF7SS2/graph.json","fetch_events":"https://pith.science/api/pith-number/7BDKLEVDFXF43RBFUPJORF7SS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2/action/storage_attestation","attest_author":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2/action/author_attestation","sign_citation":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2/action/citation_signature","submit_replication":"https://pith.science/pith/7BDKLEVDFXF43RBFUPJORF7SS2/action/replication_record"}},"created_at":"2026-07-04T14:47:23.339151+00:00","updated_at":"2026-07-04T14:47:23.339151+00:00"}