{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WFTTX7RULHBZXGZRMNLSVYM5MD","short_pith_number":"pith:WFTTX7RU","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"},"canonical_sha256":"b1673bfe3459c39b9b3163572ae19d60f8827bce5ef9c106688c8140d5abedc4","source":{"kind":"arxiv","id":"1402.4145","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4145","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4145v3","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4145","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"WFTTX7RULHBZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WFTTX7RULHBZXGZR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WFTTX7RU","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WFTTX7RULHBZXGZRMNLSVYM5MD","target":"record","payload":{"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"},"canonical_sha256":"b1673bfe3459c39b9b3163572ae19d60f8827bce5ef9c106688c8140d5abedc4","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"},"source_kind":"arxiv","source_id":"1402.4145","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt2uaR7JWY/RkFCcZI/inw0iWrWwISdS91Ni0pm3ccEIpo3o896yYqirviWyfPmrsPApbpHdOJI8bX/hE88iAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:45:12.848269Z"},"content_sha256":"8379b2bbe9f5f5a0f13438e2a48a7b610aa4b8684be940ede8558049f8627251","schema_version":"1.0","event_id":"sha256:8379b2bbe9f5f5a0f13438e2a48a7b610aa4b8684be940ede8558049f8627251"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WFTTX7RULHBZXGZRMNLSVYM5MD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xe8vfkx3lvznLcpmX2FiEXFt/CB31+f1boUiLrGjfWqGJX6gwFbNefUMaX4FsnKRABFRdZvoVi/VfGPPbYhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:45:12.848879Z"},"content_sha256":"c3d75bbea4bd80ee9cad3b3c00edb1be22d84f76e54f634d6befd122af0f41d1","schema_version":"1.0","event_id":"sha256:c3d75bbea4bd80ee9cad3b3c00edb1be22d84f76e54f634d6befd122af0f41d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/bundle.json","state_url":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T08:45:12Z","links":{"resolver":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD","bundle":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/bundle.json","state":"https://pith.science/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFTTX7RULHBZXGZRMNLSVYM5MD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WFTTX7RULHBZXGZRMNLSVYM5MD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"af8166425ca82f40b17ef08938863999f05ff6d886a24b24d41bee5ccf38929a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-17T21:09:06Z","title_canon_sha256":"c1f2464db2a462b1059d2a65bfa8c28172227df9bce02992187d7113dd5e4e05"},"schema_version":"1.0","source":{"id":"1402.4145","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4145","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4145v3","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4145","created_at":"2026-05-18T01:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"WFTTX7RULHBZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WFTTX7RULHBZXGZR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WFTTX7RU","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:c3d75bbea4bd80ee9cad3b3c00edb1be22d84f76e54f634d6befd122af0f41d1","target":"graph","created_at":"2026-05-18T01:34:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Laura Man\\v{c}inska, Thomas Vidick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-17T21:09:06Z","title":"Unbounded entanglement in nonlocal games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4145","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8379b2bbe9f5f5a0f13438e2a48a7b610aa4b8684be940ede8558049f8627251","target":"record","created_at":"2026-05-18T01:34:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"af8166425ca82f40b17ef08938863999f05ff6d886a24b24d41bee5ccf38929a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-02-17T21:09:06Z","title_canon_sha256":"c1f2464db2a462b1059d2a65bfa8c28172227df9bce02992187d7113dd5e4e05"},"schema_version":"1.0","source":{"id":"1402.4145","kind":"arxiv","version":3}},"canonical_sha256":"b1673bfe3459c39b9b3163572ae19d60f8827bce5ef9c106688c8140d5abedc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1673bfe3459c39b9b3163572ae19d60f8827bce5ef9c106688c8140d5abedc4","first_computed_at":"2026-05-18T01:34:55.617231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:55.617231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y6ZGaz5QD0Yji/QFCKRS0gvIvYbBuA/neOhXEHt2Mm+oL0HnuVe4HNC57YUNHxm0p7oey5EfftVHehKlhlK/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:55.617846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4145","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8379b2bbe9f5f5a0f13438e2a48a7b610aa4b8684be940ede8558049f8627251","sha256:c3d75bbea4bd80ee9cad3b3c00edb1be22d84f76e54f634d6befd122af0f41d1"],"state_sha256":"1f84a8c25c1378b679c582828f3641094821cdbc7365899f462a821161d314c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRZgz7IqHUT9YkisYVzHRY0xJOqHOwrUxHYsXo8BOgqW1bKCzYGdL/zWZU3GIa3eOGWpsr5YZ9+9KpbXPm0jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:45:12.852719Z","bundle_sha256":"8771371291ca2920efaf81c3bddded1b7b82b158c4808deff9f1c3b23886c031"}}