{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E7KXDLNDS367LDXMNBRLTA24YD","short_pith_number":"pith:E7KXDLND","schema_version":"1.0","canonical_sha256":"27d571ada396fdf58eec6862b9835cc0ea455c350ff7127f361a4a394f7a432e","source":{"kind":"arxiv","id":"1609.06306","version":1},"attestation_state":"computed","paper":{"title":"The Parallel-Repeated Magic Square Game is Rigid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anand Natarajan, Matthew Coudron","submitted_at":"2016-09-20T19:58:38Z","abstract_excerpt":"We show that the $n$-round parallel repetition of the Magic Square game of Mermin and Peres is rigid, in the sense that for any entangled strategy succeeding with probability $1 -\\varepsilon$, the players' shared state is $O(\\mathrm{poly}(n\\varepsilon))$-close to $2n$ EPR pairs under a local isometry. Furthermore, we show that, under local isometry, the players' measurements in said entangled strategy must be $O(\\mathrm{poly}(n\\varepsilon))$ close to the \"ideal\" strategy when acting on the shared state."},"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.06306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-20T19:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"4e804cd293e00651f4a6bbc52262fdeb027441904d299553a80bf3c42632f7b2","abstract_canon_sha256":"d6fd7499cee33578bfedb0c0a9db6d1cd0d4f68b7effd6fc2a79dcd43afe3163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:16.231407Z","signature_b64":"fs60AYPsIuMxKbtONGuajSUrsE2dJ6jDZyMPpL7PoiT1WEHlVAx1drosr0xDdVXa5SkR00Ko2aE0qGCgJm92DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d571ada396fdf58eec6862b9835cc0ea455c350ff7127f361a4a394f7a432e","last_reissued_at":"2026-05-18T01:04:16.231058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:16.231058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parallel-Repeated Magic Square Game is Rigid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anand Natarajan, Matthew Coudron","submitted_at":"2016-09-20T19:58:38Z","abstract_excerpt":"We show that the $n$-round parallel repetition of the Magic Square game of Mermin and Peres is rigid, in the sense that for any entangled strategy succeeding with probability $1 -\\varepsilon$, the players' shared state is $O(\\mathrm{poly}(n\\varepsilon))$-close to $2n$ EPR pairs under a local isometry. Furthermore, we show that, under local isometry, the players' measurements in said entangled strategy must be $O(\\mathrm{poly}(n\\varepsilon))$ close to the \"ideal\" strategy when acting on the shared state."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06306","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.06306","created_at":"2026-05-18T01:04:16.231112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06306v1","created_at":"2026-05-18T01:04:16.231112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06306","created_at":"2026-05-18T01:04:16.231112+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7KXDLNDS367","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7KXDLNDS367LDXM","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7KXDLND","created_at":"2026-05-18T12:30:12.583610+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":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD","json":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD.json","graph_json":"https://pith.science/api/pith-number/E7KXDLNDS367LDXMNBRLTA24YD/graph.json","events_json":"https://pith.science/api/pith-number/E7KXDLNDS367LDXMNBRLTA24YD/events.json","paper":"https://pith.science/paper/E7KXDLND"},"agent_actions":{"view_html":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD","download_json":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD.json","view_paper":"https://pith.science/paper/E7KXDLND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06306&json=true","fetch_graph":"https://pith.science/api/pith-number/E7KXDLNDS367LDXMNBRLTA24YD/graph.json","fetch_events":"https://pith.science/api/pith-number/E7KXDLNDS367LDXMNBRLTA24YD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD/action/storage_attestation","attest_author":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD/action/author_attestation","sign_citation":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD/action/citation_signature","submit_replication":"https://pith.science/pith/E7KXDLNDS367LDXMNBRLTA24YD/action/replication_record"}},"created_at":"2026-05-18T01:04:16.231112+00:00","updated_at":"2026-05-18T01:04:16.231112+00:00"}