{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WFTTX7RULHBZXGZRMNLSVYM5MD","short_pith_number":"pith:WFTTX7RU","schema_version":"1.0","canonical_sha256":"b1673bfe3459c39b9b3163572ae19d60f8827bce5ef9c106688c8140d5abedc4","source":{"kind":"arxiv","id":"1402.4145","version":3},"attestation_state":"computed","paper":{"title":"Unbounded entanglement in nonlocal games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Laura Man\\v{c}inska, Thomas Vidick","submitted_at":"2014-02-17T21:09:06Z","abstract_excerpt":"Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a purely classical scenario for which no finite amount of entanglement suffices. To this end we introduce a simple two-party nonlocal game $H$, inspired by Lucien Hardy's paradox. In our game each player has only two possible questions and can provide bit strings of any finite length as answer. We exhibit a sequence of strategies which use entangled states in inc"},"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":"1402.4145","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-17T21:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"c1f2464db2a462b1059d2a65bfa8c28172227df9bce02992187d7113dd5e4e05","abstract_canon_sha256":"af8166425ca82f40b17ef08938863999f05ff6d886a24b24d41bee5ccf38929a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:55.617846Z","signature_b64":"y6ZGaz5QD0Yji/QFCKRS0gvIvYbBuA/neOhXEHt2Mm+oL0HnuVe4HNC57YUNHxm0p7oey5EfftVHehKlhlK/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1673bfe3459c39b9b3163572ae19d60f8827bce5ef9c106688c8140d5abedc4","last_reissued_at":"2026-05-18T01:34:55.617231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:55.617231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbounded entanglement in nonlocal games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Laura Man\\v{c}inska, Thomas Vidick","submitted_at":"2014-02-17T21:09:06Z","abstract_excerpt":"Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a purely classical scenario for which no finite amount of entanglement suffices. To this end we introduce a simple two-party nonlocal game $H$, inspired by Lucien Hardy's paradox. In our game each player has only two possible questions and can provide bit strings of any finite length as answer. We exhibit a sequence of strategies which use entangled states in inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4145","kind":"arxiv","version":3},"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":"1402.4145","created_at":"2026-05-18T01:34:55.617323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4145v3","created_at":"2026-05-18T01:34:55.617323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4145","created_at":"2026-05-18T01:34:55.617323+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFTTX7RULHBZ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFTTX7RULHBZXGZR","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFTTX7RU","created_at":"2026-05-18T12:28:54.890064+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/WFTTX7RULHBZXGZRMNLSVYM5MD","json":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD.json","graph_json":"https://pith.science/api/pith-number/WFTTX7RULHBZXGZRMNLSVYM5MD/graph.json","events_json":"https://pith.science/api/pith-number/WFTTX7RULHBZXGZRMNLSVYM5MD/events.json","paper":"https://pith.science/paper/WFTTX7RU"},"agent_actions":{"view_html":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD","download_json":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD.json","view_paper":"https://pith.science/paper/WFTTX7RU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4145&json=true","fetch_graph":"https://pith.science/api/pith-number/WFTTX7RULHBZXGZRMNLSVYM5MD/graph.json","fetch_events":"https://pith.science/api/pith-number/WFTTX7RULHBZXGZRMNLSVYM5MD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/action/storage_attestation","attest_author":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/action/author_attestation","sign_citation":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/action/citation_signature","submit_replication":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/action/replication_record"}},"created_at":"2026-05-18T01:34:55.617323+00:00","updated_at":"2026-05-18T01:34:55.617323+00:00"}