{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2GHWSAXX6CL2R3KHGD7UNIC6AG","short_pith_number":"pith:2GHWSAXX","schema_version":"1.0","canonical_sha256":"d18f6902f7f097a8ed4730ff46a05e01b07ad10ed9140e2f0c6378ba22208929","source":{"kind":"arxiv","id":"2410.21223","version":2},"attestation_state":"computed","paper":{"title":"RE-completeness of entangled constraint satisfaction problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric Culf, Kieran Mastel","submitted_at":"2024-10-28T17:05:58Z","abstract_excerpt":"Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem, and its extension to all alphabets due to Bulatov and Zhuk, shows that CSP languages are either efficiently decidable, or NP-complete. It is possible to extend CSP languages to quantum assignments using the formalism of nonlocal games. Due to the equality of complexity classes MIP$^\\ast=$ RE, general succinctly-presented entangled CSPs are RE-complete. In this work, we show that a wide ra"},"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":"2410.21223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-28T17:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"a19ae18734b61186ed1716c3541d5c696de60abd0d139b683733d7a0bd4e7e7d","abstract_canon_sha256":"e96436d9e94eddfe32ec2fb71caa7884a05624e8e785f921233c14976eaef0ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:56.344268Z","signature_b64":"XuG3hUjV7TU04CGb8rl+dCsHN7AFGB122wOL3Z/j3zuX4JetSxzuobUaVy1yZivyJBculgXK8uSFSpjFWcJ9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18f6902f7f097a8ed4730ff46a05e01b07ad10ed9140e2f0c6378ba22208929","last_reissued_at":"2026-07-05T10:19:56.343557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:56.343557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RE-completeness of entangled constraint satisfaction problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eric Culf, Kieran Mastel","submitted_at":"2024-10-28T17:05:58Z","abstract_excerpt":"Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem, and its extension to all alphabets due to Bulatov and Zhuk, shows that CSP languages are either efficiently decidable, or NP-complete. It is possible to extend CSP languages to quantum assignments using the formalism of nonlocal games. Due to the equality of complexity classes MIP$^\\ast=$ RE, general succinctly-presented entangled CSPs are RE-complete. In this work, we show that a wide ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21223","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.21223/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.21223","created_at":"2026-07-05T10:19:56.343637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.21223v2","created_at":"2026-07-05T10:19:56.343637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.21223","created_at":"2026-07-05T10:19:56.343637+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GHWSAXX6CL2","created_at":"2026-07-05T10:19:56.343637+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GHWSAXX6CL2R3KH","created_at":"2026-07-05T10:19:56.343637+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GHWSAXX","created_at":"2026-07-05T10:19:56.343637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07835","citing_title":"Existence and nonexistence of commutativity gadgets for entangled CSPs","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG","json":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG.json","graph_json":"https://pith.science/api/pith-number/2GHWSAXX6CL2R3KHGD7UNIC6AG/graph.json","events_json":"https://pith.science/api/pith-number/2GHWSAXX6CL2R3KHGD7UNIC6AG/events.json","paper":"https://pith.science/paper/2GHWSAXX"},"agent_actions":{"view_html":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG","download_json":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG.json","view_paper":"https://pith.science/paper/2GHWSAXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.21223&json=true","fetch_graph":"https://pith.science/api/pith-number/2GHWSAXX6CL2R3KHGD7UNIC6AG/graph.json","fetch_events":"https://pith.science/api/pith-number/2GHWSAXX6CL2R3KHGD7UNIC6AG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG/action/storage_attestation","attest_author":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG/action/author_attestation","sign_citation":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG/action/citation_signature","submit_replication":"https://pith.science/pith/2GHWSAXX6CL2R3KHGD7UNIC6AG/action/replication_record"}},"created_at":"2026-07-05T10:19:56.343637+00:00","updated_at":"2026-07-05T10:19:56.343637+00:00"}