{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FWCVMLG5B4NN3STZGFXOFNRDMZ","short_pith_number":"pith:FWCVMLG5","schema_version":"1.0","canonical_sha256":"2d85562cdd0f1addca79316ee2b623667aca0e43a4761c1812217d73e624df9e","source":{"kind":"arxiv","id":"1709.09267","version":2},"attestation_state":"computed","paper":{"title":"Robust self-testing for linear constraint system games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrea Coladangelo, Jalex Stark","submitted_at":"2017-09-26T21:52:41Z","abstract_excerpt":"We study linear constraint system (LCS) games over the ring of arithmetic modulo $d$. We give a new proof that certain LCS games (the Mermin--Peres Magic Square and Magic Pentagram over binary alphabets, together with parallel repetitions of these) have unique winning strategies, where the uniqueness is robust to small perturbations. In order to prove our result, we extend the representation-theoretic framework of Cleve, Liu, and Slofstra (Journal of Mathematical Physics 58.1 (2017): 012202.) to apply to linear constraint games over $\\mathbb{Z}_d$ for $d\\geq 2$. We package our main argument in"},"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":"1709.09267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-26T21:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"60b4b98b0599569d32ef4b1dacb3d06c97350ec17d3f527ca62cf689c1d74058","abstract_canon_sha256":"fd7b4a1c4415251e88027ac679eee91b790da8db8dad5640d22296eb52328e44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.155435Z","signature_b64":"A0Mo2KduE9SNx+e8aAwNPKcifjS5ZY/5mcI3ko7XBkJBjCzhpB23hjiTmLDrO60o/x60HAGQ8I+thv7tJqn6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d85562cdd0f1addca79316ee2b623667aca0e43a4761c1812217d73e624df9e","last_reissued_at":"2026-05-17T23:49:53.155017Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.155017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust self-testing for linear constraint system games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrea Coladangelo, Jalex Stark","submitted_at":"2017-09-26T21:52:41Z","abstract_excerpt":"We study linear constraint system (LCS) games over the ring of arithmetic modulo $d$. We give a new proof that certain LCS games (the Mermin--Peres Magic Square and Magic Pentagram over binary alphabets, together with parallel repetitions of these) have unique winning strategies, where the uniqueness is robust to small perturbations. In order to prove our result, we extend the representation-theoretic framework of Cleve, Liu, and Slofstra (Journal of Mathematical Physics 58.1 (2017): 012202.) to apply to linear constraint games over $\\mathbb{Z}_d$ for $d\\geq 2$. We package our main argument in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09267","kind":"arxiv","version":2},"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":"1709.09267","created_at":"2026-05-17T23:49:53.155085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09267v2","created_at":"2026-05-17T23:49:53.155085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09267","created_at":"2026-05-17T23:49:53.155085+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWCVMLG5B4NN","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWCVMLG5B4NN3STZ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWCVMLG5","created_at":"2026-05-18T12:31:15.632608+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/FWCVMLG5B4NN3STZGFXOFNRDMZ","json":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ.json","graph_json":"https://pith.science/api/pith-number/FWCVMLG5B4NN3STZGFXOFNRDMZ/graph.json","events_json":"https://pith.science/api/pith-number/FWCVMLG5B4NN3STZGFXOFNRDMZ/events.json","paper":"https://pith.science/paper/FWCVMLG5"},"agent_actions":{"view_html":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ","download_json":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ.json","view_paper":"https://pith.science/paper/FWCVMLG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09267&json=true","fetch_graph":"https://pith.science/api/pith-number/FWCVMLG5B4NN3STZGFXOFNRDMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FWCVMLG5B4NN3STZGFXOFNRDMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ/action/storage_attestation","attest_author":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ/action/author_attestation","sign_citation":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ/action/citation_signature","submit_replication":"https://pith.science/pith/FWCVMLG5B4NN3STZGFXOFNRDMZ/action/replication_record"}},"created_at":"2026-05-17T23:49:53.155085+00:00","updated_at":"2026-05-17T23:49:53.155085+00:00"}