{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3O4KL6X7ZMM4A5DGIEP53K5KLU","short_pith_number":"pith:3O4KL6X7","schema_version":"1.0","canonical_sha256":"dbb8a5faffcb19c07466411fddabaa5d14fd4d8da12bd23db8cd7602441cf934","source":{"kind":"arxiv","id":"1209.2729","version":3},"attestation_state":"computed","paper":{"title":"Characterization of Binary Constraint System Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rajat Mittal, Richard Cleve","submitted_at":"2012-09-12T20:59:24Z","abstract_excerpt":"We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, \"Simple unified form for the major no-hidden-variables theorems,\" Phys. Rev. Lett., 65(27):3373-3376, 1990], but generalized to n binary variables and m constraints. We show that, whenever there is a perfect entangled protocol for such a game, there exists a set of binary observables with commutations and products similar to those exhibited by Mermin. We also show how to derive upper bounds strictly below 1 for the the maximum "},"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":"1209.2729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-12T20:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"c390f3bd563a75ff2cb9f4d5ed4e1840e6d49a13e60a9b483c00ccdf58e91a3a","abstract_canon_sha256":"11a972316ce4842e683a9c4fb0a48b4599cc87a5b6658e88907cc5851eb2e571"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:24.404327Z","signature_b64":"9Y9cnmwxn/bcjIJKfBzVemNnDpDqYkmCrW6oHdJx7qWFATxVvKlvyqHpBl/kXcN92axTiMU8Fpt6PTBkMkO/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb8a5faffcb19c07466411fddabaa5d14fd4d8da12bd23db8cd7602441cf934","last_reissued_at":"2026-05-18T03:10:24.403590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:24.403590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterization of Binary Constraint System Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rajat Mittal, Richard Cleve","submitted_at":"2012-09-12T20:59:24Z","abstract_excerpt":"We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, \"Simple unified form for the major no-hidden-variables theorems,\" Phys. Rev. Lett., 65(27):3373-3376, 1990], but generalized to n binary variables and m constraints. We show that, whenever there is a perfect entangled protocol for such a game, there exists a set of binary observables with commutations and products similar to those exhibited by Mermin. We also show how to derive upper bounds strictly below 1 for the the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2729","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":"1209.2729","created_at":"2026-05-18T03:10:24.403702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2729v3","created_at":"2026-05-18T03:10:24.403702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2729","created_at":"2026-05-18T03:10:24.403702+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O4KL6X7ZMM4","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O4KL6X7ZMM4A5DG","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O4KL6X7","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10305","citing_title":"Operator solutions of linear systems and small cancellation","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU","json":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU.json","graph_json":"https://pith.science/api/pith-number/3O4KL6X7ZMM4A5DGIEP53K5KLU/graph.json","events_json":"https://pith.science/api/pith-number/3O4KL6X7ZMM4A5DGIEP53K5KLU/events.json","paper":"https://pith.science/paper/3O4KL6X7"},"agent_actions":{"view_html":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU","download_json":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU.json","view_paper":"https://pith.science/paper/3O4KL6X7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2729&json=true","fetch_graph":"https://pith.science/api/pith-number/3O4KL6X7ZMM4A5DGIEP53K5KLU/graph.json","fetch_events":"https://pith.science/api/pith-number/3O4KL6X7ZMM4A5DGIEP53K5KLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU/action/storage_attestation","attest_author":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU/action/author_attestation","sign_citation":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU/action/citation_signature","submit_replication":"https://pith.science/pith/3O4KL6X7ZMM4A5DGIEP53K5KLU/action/replication_record"}},"created_at":"2026-05-18T03:10:24.403702+00:00","updated_at":"2026-05-18T03:10:24.403702+00:00"}