{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5I3I4EU7CAVC6FG7DGGYRYFX7X","short_pith_number":"pith:5I3I4EU7","schema_version":"1.0","canonical_sha256":"ea368e129f102a2f14df198d88e0b7fdff67ce0f094e1aeca181d65a1fc92c79","source":{"kind":"arxiv","id":"1609.01652","version":1},"attestation_state":"computed","paper":{"title":"Entanglement of approximate quantum strategies in XOR games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dimiter Ostrev, Thomas Vidick","submitted_at":"2016-09-06T16:48:40Z","abstract_excerpt":"We show that for any $\\varepsilon>0$ there is an XOR game $G=G(\\varepsilon)$ with $\\Theta(\\varepsilon^{-1/5})$ inputs for one player and $\\Theta(\\varepsilon^{-2/5})$ inputs for the other player such that $\\Omega(\\varepsilon^{-1/5})$ ebits are required for any strategy achieving bias that is at least a multiplicative factor $(1-\\varepsilon)$ from optimal. This gives an exponential improvement in both the number of inputs or outputs and the noise tolerance of any previously-known self-test for highly entangled states. Up to the exponent $-1/5$ the scaling of our bound with $\\varepsilon$ is tight"},"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":"1609.01652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-06T16:48:40Z","cross_cats_sorted":[],"title_canon_sha256":"41c0d67d58e4ab6723d1926e75412d9175a223c84c36265c6477e35f47f03845","abstract_canon_sha256":"ddc357879faa0edc03e507fe87dc424fd25ffc2da7b75dd9387bb3756790c9f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:39.037507Z","signature_b64":"4FcQ800jFUC1oLZQzonHoonVpI/hHQGCjDaHU5+8YQ0PGJWHued9g93P01fStTKB76sdtTBTAnHhbsCd0KnvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea368e129f102a2f14df198d88e0b7fdff67ce0f094e1aeca181d65a1fc92c79","last_reissued_at":"2026-05-18T01:05:39.037142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:39.037142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement of approximate quantum strategies in XOR games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dimiter Ostrev, Thomas Vidick","submitted_at":"2016-09-06T16:48:40Z","abstract_excerpt":"We show that for any $\\varepsilon>0$ there is an XOR game $G=G(\\varepsilon)$ with $\\Theta(\\varepsilon^{-1/5})$ inputs for one player and $\\Theta(\\varepsilon^{-2/5})$ inputs for the other player such that $\\Omega(\\varepsilon^{-1/5})$ ebits are required for any strategy achieving bias that is at least a multiplicative factor $(1-\\varepsilon)$ from optimal. This gives an exponential improvement in both the number of inputs or outputs and the noise tolerance of any previously-known self-test for highly entangled states. Up to the exponent $-1/5$ the scaling of our bound with $\\varepsilon$ is tight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01652","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":"1609.01652","created_at":"2026-05-18T01:05:39.037193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01652v1","created_at":"2026-05-18T01:05:39.037193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01652","created_at":"2026-05-18T01:05:39.037193+00:00"},{"alias_kind":"pith_short_12","alias_value":"5I3I4EU7CAVC","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5I3I4EU7CAVC6FG7","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5I3I4EU7","created_at":"2026-05-18T12:30:01.593930+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":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X","json":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X.json","graph_json":"https://pith.science/api/pith-number/5I3I4EU7CAVC6FG7DGGYRYFX7X/graph.json","events_json":"https://pith.science/api/pith-number/5I3I4EU7CAVC6FG7DGGYRYFX7X/events.json","paper":"https://pith.science/paper/5I3I4EU7"},"agent_actions":{"view_html":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X","download_json":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X.json","view_paper":"https://pith.science/paper/5I3I4EU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01652&json=true","fetch_graph":"https://pith.science/api/pith-number/5I3I4EU7CAVC6FG7DGGYRYFX7X/graph.json","fetch_events":"https://pith.science/api/pith-number/5I3I4EU7CAVC6FG7DGGYRYFX7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X/action/storage_attestation","attest_author":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X/action/author_attestation","sign_citation":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X/action/citation_signature","submit_replication":"https://pith.science/pith/5I3I4EU7CAVC6FG7DGGYRYFX7X/action/replication_record"}},"created_at":"2026-05-18T01:05:39.037193+00:00","updated_at":"2026-05-18T01:05:39.037193+00:00"}