{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MOQO63PNXBLFAACH2TPHSNIDOH","short_pith_number":"pith:MOQO63PN","schema_version":"1.0","canonical_sha256":"63a0ef6dedb856500047d4de79350371ef70bc2eace4a968d99484eb9bd4c362","source":{"kind":"arxiv","id":"1207.0550","version":2},"attestation_state":"computed","paper":{"title":"A multi-prover interactive proof for NEXP sound against entangled provers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Thomas Vidick, Tsuyoshi Ito","submitted_at":"2012-07-03T00:02:11Z","abstract_excerpt":"We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with entangled provers; namely MIP* contains NEXP, the class of languages decidable in non-deterministic exponential time. While Babai, Fortnow, and Lund (Computational Complexity 1991) proved the celebrated equality MIP = NEXP in the absence of entanglement, ever since the introduction of the class MIP* it was open whether shared entanglement between the provers could weaken "},"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":"1207.0550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-03T00:02:11Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5756d3f7604a8305131240cc57a13e86ffe560182f15f123ecb985216d5814ff","abstract_canon_sha256":"aecf9e0056b40d62001ece3bea20d5e758e9207149948f2d93ff4af691ff100e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:46.845231Z","signature_b64":"vvytD7svhBOKUZD3cqj5czIt+YN2EGAVmDyUloc1D1DjYGgBxPkKqSQqNvq5RNnYi1GoIwXbk3RzxyreUv+FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63a0ef6dedb856500047d4de79350371ef70bc2eace4a968d99484eb9bd4c362","last_reissued_at":"2026-05-18T03:44:46.844659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:46.844659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A multi-prover interactive proof for NEXP sound against entangled provers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Thomas Vidick, Tsuyoshi Ito","submitted_at":"2012-07-03T00:02:11Z","abstract_excerpt":"We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with entangled provers; namely MIP* contains NEXP, the class of languages decidable in non-deterministic exponential time. While Babai, Fortnow, and Lund (Computational Complexity 1991) proved the celebrated equality MIP = NEXP in the absence of entanglement, ever since the introduction of the class MIP* it was open whether shared entanglement between the provers could weaken "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0550","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":"1207.0550","created_at":"2026-05-18T03:44:46.844764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0550v2","created_at":"2026-05-18T03:44:46.844764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0550","created_at":"2026-05-18T03:44:46.844764+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOQO63PNXBLF","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOQO63PNXBLFAACH","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOQO63PN","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":86,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH","json":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH.json","graph_json":"https://pith.science/api/pith-number/MOQO63PNXBLFAACH2TPHSNIDOH/graph.json","events_json":"https://pith.science/api/pith-number/MOQO63PNXBLFAACH2TPHSNIDOH/events.json","paper":"https://pith.science/paper/MOQO63PN"},"agent_actions":{"view_html":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH","download_json":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH.json","view_paper":"https://pith.science/paper/MOQO63PN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0550&json=true","fetch_graph":"https://pith.science/api/pith-number/MOQO63PNXBLFAACH2TPHSNIDOH/graph.json","fetch_events":"https://pith.science/api/pith-number/MOQO63PNXBLFAACH2TPHSNIDOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH/action/storage_attestation","attest_author":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH/action/author_attestation","sign_citation":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH/action/citation_signature","submit_replication":"https://pith.science/pith/MOQO63PNXBLFAACH2TPHSNIDOH/action/replication_record"}},"created_at":"2026-05-18T03:44:46.844764+00:00","updated_at":"2026-05-18T03:44:46.844764+00:00"}