{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZXJBLXSP7IO6SHS5JG2GNDKGJV","short_pith_number":"pith:ZXJBLXSP","schema_version":"1.0","canonical_sha256":"cdd215de4ffa1de91e5d49b4668d464d5faf1836f2cfe755c44a02abeaa48aad","source":{"kind":"arxiv","id":"2403.13084","version":1},"attestation_state":"computed","paper":{"title":"The status of the quantum PCP conjecture (games version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Anand Natarajan, Chinmay Nirkhe","submitted_at":"2024-03-19T18:30:32Z","abstract_excerpt":"In classical complexity theory, the two definitions of probabilistically checkable proofs -- the constraint satisfaction and the nonlocal games version -- are computationally equal in power. In the quantum setting, the situation is far less clear. The result MIP* = RE of Ji et. al. (arXiv:2001.04383) and refinements by Natarajan and Zhang (arXiv:2302.04322) show that multiprover interactive proof systems with polylogarithmically long messages can solve any decision problem in RE, including undecidable problems like the halting problem. These results show that any connection between the \"constr"},"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":"2403.13084","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-19T18:30:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"886c679d301e09c8329d749604d36b3701b4d9352f319455cfe0c2eb4299e084","abstract_canon_sha256":"a401b0cf75ba5741313f1bcaa0647a098b3851a894b0726f3878c14ef9c54f5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:31.036571Z","signature_b64":"uFRi3npLNKrmC6t04X9NnPYWzZsWXlPcTbZtDOxkrmkAHHz4IPkO8SjSbvM0waEohZtBvWV2HSKDGNNAK4xwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdd215de4ffa1de91e5d49b4668d464d5faf1836f2cfe755c44a02abeaa48aad","last_reissued_at":"2026-07-05T07:58:31.036079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:31.036079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The status of the quantum PCP conjecture (games version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Anand Natarajan, Chinmay Nirkhe","submitted_at":"2024-03-19T18:30:32Z","abstract_excerpt":"In classical complexity theory, the two definitions of probabilistically checkable proofs -- the constraint satisfaction and the nonlocal games version -- are computationally equal in power. In the quantum setting, the situation is far less clear. The result MIP* = RE of Ji et. al. (arXiv:2001.04383) and refinements by Natarajan and Zhang (arXiv:2302.04322) show that multiprover interactive proof systems with polylogarithmically long messages can solve any decision problem in RE, including undecidable problems like the halting problem. These results show that any connection between the \"constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13084","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/2403.13084/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":"2403.13084","created_at":"2026-07-05T07:58:31.036138+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13084v1","created_at":"2026-07-05T07:58:31.036138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13084","created_at":"2026-07-05T07:58:31.036138+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXJBLXSP7IO6","created_at":"2026-07-05T07:58:31.036138+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXJBLXSP7IO6SHS5","created_at":"2026-07-05T07:58:31.036138+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXJBLXSP","created_at":"2026-07-05T07:58:31.036138+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09588","citing_title":"Probabilistically Checking Quantum Proofs, with Interaction","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV","json":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV.json","graph_json":"https://pith.science/api/pith-number/ZXJBLXSP7IO6SHS5JG2GNDKGJV/graph.json","events_json":"https://pith.science/api/pith-number/ZXJBLXSP7IO6SHS5JG2GNDKGJV/events.json","paper":"https://pith.science/paper/ZXJBLXSP"},"agent_actions":{"view_html":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV","download_json":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV.json","view_paper":"https://pith.science/paper/ZXJBLXSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13084&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXJBLXSP7IO6SHS5JG2GNDKGJV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXJBLXSP7IO6SHS5JG2GNDKGJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV/action/storage_attestation","attest_author":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV/action/author_attestation","sign_citation":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV/action/citation_signature","submit_replication":"https://pith.science/pith/ZXJBLXSP7IO6SHS5JG2GNDKGJV/action/replication_record"}},"created_at":"2026-07-05T07:58:31.036138+00:00","updated_at":"2026-07-05T07:58:31.036138+00:00"}