{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:EV3H6G576DCDWJ55EVUFR7AGPD","short_pith_number":"pith:EV3H6G57","schema_version":"1.0","canonical_sha256":"25767f1bbff0c43b27bd256858fc0678e48e2392f898302f31f8ddbb756ef202","source":{"kind":"arxiv","id":"cs/0506068","version":1},"attestation_state":"computed","paper":{"title":"Quantum Arthur-Merlin Games","license":"","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Chris Marriott, John Watrous","submitted_at":"2005-06-15T22:13:52Z","abstract_excerpt":"This paper studies quantum Arthur-Merlin games, which are Arthur-Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum information. As in the classical case, messages from Arthur to Merlin are restricted to be strings of uniformly generated random bits. It is proved that for one-message quantum Arthur-Merlin games, which correspond to the complexity class QMA, completeness and soundness errors can be reduced exponentially without increasing the length of Merlin's message. Previous constructions for reducing error required a polynomial incre"},"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":"cs/0506068","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2005-06-15T22:13:52Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"acd3f7da235ef7e06b9b7e220caec5c95c2ee43d2cbf653b468fcf35c5bee95f","abstract_canon_sha256":"0f743e553717412bf554d1a22ce2d92bba79e849e3e944017c28bbecde689c26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:03.353360Z","signature_b64":"1L8EBmh25XY8fvg+q0jD/z3rtj2o0QEaJgHi5Ig5x0DdVkxelcsqSlPD1FYQn54X6oDN0VfeH9JKmHs13LbHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25767f1bbff0c43b27bd256858fc0678e48e2392f898302f31f8ddbb756ef202","last_reissued_at":"2026-07-04T14:25:03.352910Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:03.352910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Arthur-Merlin Games","license":"","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Chris Marriott, John Watrous","submitted_at":"2005-06-15T22:13:52Z","abstract_excerpt":"This paper studies quantum Arthur-Merlin games, which are Arthur-Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum information. As in the classical case, messages from Arthur to Merlin are restricted to be strings of uniformly generated random bits. It is proved that for one-message quantum Arthur-Merlin games, which correspond to the complexity class QMA, completeness and soundness errors can be reduced exponentially without increasing the length of Merlin's message. Previous constructions for reducing error required a polynomial incre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0506068","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/cs/0506068/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":"cs/0506068","created_at":"2026-07-04T14:25:03.352982+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0506068v1","created_at":"2026-07-04T14:25:03.352982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0506068","created_at":"2026-07-04T14:25:03.352982+00:00"},{"alias_kind":"pith_short_12","alias_value":"EV3H6G576DCD","created_at":"2026-07-04T14:25:03.352982+00:00"},{"alias_kind":"pith_short_16","alias_value":"EV3H6G576DCDWJ55","created_at":"2026-07-04T14:25:03.352982+00:00"},{"alias_kind":"pith_short_8","alias_value":"EV3H6G57","created_at":"2026-07-04T14:25:03.352982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16249","citing_title":"The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD","json":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD.json","graph_json":"https://pith.science/api/pith-number/EV3H6G576DCDWJ55EVUFR7AGPD/graph.json","events_json":"https://pith.science/api/pith-number/EV3H6G576DCDWJ55EVUFR7AGPD/events.json","paper":"https://pith.science/paper/EV3H6G57"},"agent_actions":{"view_html":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD","download_json":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD.json","view_paper":"https://pith.science/paper/EV3H6G57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0506068&json=true","fetch_graph":"https://pith.science/api/pith-number/EV3H6G576DCDWJ55EVUFR7AGPD/graph.json","fetch_events":"https://pith.science/api/pith-number/EV3H6G576DCDWJ55EVUFR7AGPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD/action/storage_attestation","attest_author":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD/action/author_attestation","sign_citation":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD/action/citation_signature","submit_replication":"https://pith.science/pith/EV3H6G576DCDWJ55EVUFR7AGPD/action/replication_record"}},"created_at":"2026-07-04T14:25:03.352982+00:00","updated_at":"2026-07-04T14:25:03.352982+00:00"}