{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X7BZLW2ZP64TY53MC5TDXUEXKQ","short_pith_number":"pith:X7BZLW2Z","schema_version":"1.0","canonical_sha256":"bfc395db597fb93c776c17663bd097542a9f93c87689da55ad558f098e65de1f","source":{"kind":"arxiv","id":"1610.01664","version":1},"attestation_state":"computed","paper":{"title":"Quantum Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Watrous, Thomas Vidick","submitted_at":"2016-10-05T21:42:31Z","abstract_excerpt":"Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class \\class{NP}, known as QMA, in which a quantum state plays the role of a proof (also called a certificate or witness), and is checked by a polynomial-time quantum computation. For some problems, the fact that a quantum proof state could be a superposition over exponentially many classical states appears to offer computational advantages over classical proof strings. In the interactive pr"},"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":"1610.01664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-05T21:42:31Z","cross_cats_sorted":[],"title_canon_sha256":"00b4f1142394f9b6bf8f20c029bae61a564b4a4812f778d49b8030cfcbddb764","abstract_canon_sha256":"f38e7042cdef9d113f152be4980057d80f080a2c17d1966c61d5f3e7dc668c72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:05.279896Z","signature_b64":"SzRDRlV01Il2AdGjRtwJvc6q0wPzKeuJR2dYsC4novm/5qv58iezEvMAEA94lqiRYKWeDUMaEAL5uRuxy3USAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfc395db597fb93c776c17663bd097542a9f93c87689da55ad558f098e65de1f","last_reissued_at":"2026-05-18T01:03:05.279055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:05.279055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Watrous, Thomas Vidick","submitted_at":"2016-10-05T21:42:31Z","abstract_excerpt":"Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class \\class{NP}, known as QMA, in which a quantum state plays the role of a proof (also called a certificate or witness), and is checked by a polynomial-time quantum computation. For some problems, the fact that a quantum proof state could be a superposition over exponentially many classical states appears to offer computational advantages over classical proof strings. In the interactive pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01664","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":""},"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":"1610.01664","created_at":"2026-05-18T01:03:05.279222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01664v1","created_at":"2026-05-18T01:03:05.279222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01664","created_at":"2026-05-18T01:03:05.279222+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7BZLW2ZP64T","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7BZLW2ZP64TY53M","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7BZLW2Z","created_at":"2026-05-18T12:30:51.357362+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/X7BZLW2ZP64TY53MC5TDXUEXKQ","json":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ.json","graph_json":"https://pith.science/api/pith-number/X7BZLW2ZP64TY53MC5TDXUEXKQ/graph.json","events_json":"https://pith.science/api/pith-number/X7BZLW2ZP64TY53MC5TDXUEXKQ/events.json","paper":"https://pith.science/paper/X7BZLW2Z"},"agent_actions":{"view_html":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ","download_json":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ.json","view_paper":"https://pith.science/paper/X7BZLW2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01664&json=true","fetch_graph":"https://pith.science/api/pith-number/X7BZLW2ZP64TY53MC5TDXUEXKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/X7BZLW2ZP64TY53MC5TDXUEXKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ/action/storage_attestation","attest_author":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ/action/author_attestation","sign_citation":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ/action/citation_signature","submit_replication":"https://pith.science/pith/X7BZLW2ZP64TY53MC5TDXUEXKQ/action/replication_record"}},"created_at":"2026-05-18T01:03:05.279222+00:00","updated_at":"2026-05-18T01:03:05.279222+00:00"}