{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CGD5J57SHK5L6BEC77E7LLM6AD","short_pith_number":"pith:CGD5J57S","schema_version":"1.0","canonical_sha256":"1187d4f7f23ababf0482ffc9f5ad9e00e01ba1a611620e0839bd5393e328ba62","source":{"kind":"arxiv","id":"1310.3794","version":2},"attestation_state":"computed","paper":{"title":"Binary Constraint System Games and Locally Commutative Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Zhengfeng Ji","submitted_at":"2013-10-14T19:08:50Z","abstract_excerpt":"A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve and R. Mittal, arXiv:1209.2729]. We show that several concepts including the quantum chromatic number and the Kochen-Specker sets that arose from different contexts fit naturally in the binary constraint system framework. The structure and complexity of the quantum satisfiability problems for these constraint systems are investigated. Combined with a new con"},"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":"1310.3794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-14T19:08:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d189c29de8d96bbedd8284b71cf9aaaaedbd95403b8994e9a7d804f3207f2693","abstract_canon_sha256":"9010dc534efc6fedf197a8b6d4cc1724c63a9cc10b6f18184dfbc1d62e0b67e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:06.499683Z","signature_b64":"EyAaZFo2PjrkokYdrKqUQYAVPeTfzxGcZpkbUzEHPYh2j8ADxDCFyym8cTzC3EowjgrjHMa19kX7GI1SLqUSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1187d4f7f23ababf0482ffc9f5ad9e00e01ba1a611620e0839bd5393e328ba62","last_reissued_at":"2026-05-18T03:08:06.498929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:06.498929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Constraint System Games and Locally Commutative Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Zhengfeng Ji","submitted_at":"2013-10-14T19:08:50Z","abstract_excerpt":"A binary constraint system game is a two-player one-round non-local game defined by a system of Boolean constraints. The game has a perfect quantum strategy if and only if the constraint system has a quantum satisfying assignment [R. Cleve and R. Mittal, arXiv:1209.2729]. We show that several concepts including the quantum chromatic number and the Kochen-Specker sets that arose from different contexts fit naturally in the binary constraint system framework. The structure and complexity of the quantum satisfiability problems for these constraint systems are investigated. Combined with a new con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3794","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":"1310.3794","created_at":"2026-05-18T03:08:06.499042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3794v2","created_at":"2026-05-18T03:08:06.499042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3794","created_at":"2026-05-18T03:08:06.499042+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGD5J57SHK5L","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGD5J57SHK5L6BEC","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGD5J57S","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19405","citing_title":"Approximate quantum 3-colorings of graphs and the quantum Max 3-Cut problem","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD","json":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD.json","graph_json":"https://pith.science/api/pith-number/CGD5J57SHK5L6BEC77E7LLM6AD/graph.json","events_json":"https://pith.science/api/pith-number/CGD5J57SHK5L6BEC77E7LLM6AD/events.json","paper":"https://pith.science/paper/CGD5J57S"},"agent_actions":{"view_html":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD","download_json":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD.json","view_paper":"https://pith.science/paper/CGD5J57S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3794&json=true","fetch_graph":"https://pith.science/api/pith-number/CGD5J57SHK5L6BEC77E7LLM6AD/graph.json","fetch_events":"https://pith.science/api/pith-number/CGD5J57SHK5L6BEC77E7LLM6AD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD/action/storage_attestation","attest_author":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD/action/author_attestation","sign_citation":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD/action/citation_signature","submit_replication":"https://pith.science/pith/CGD5J57SHK5L6BEC77E7LLM6AD/action/replication_record"}},"created_at":"2026-05-18T03:08:06.499042+00:00","updated_at":"2026-05-18T03:08:06.499042+00:00"}