{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5C47ROZKFYZW2RUSI6BOQ5VHO4","short_pith_number":"pith:5C47ROZK","schema_version":"1.0","canonical_sha256":"e8b9f8bb2a2e336d46924782e876a777283d34b105fe7ed8c877744791b63dab","source":{"kind":"arxiv","id":"2312.16765","version":2},"attestation_state":"computed","paper":{"title":"Approximation algorithms for noncommutative CSPs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Eric Culf, Hamoon Mousavi, Taro Spirig","submitted_at":"2023-12-28T01:22:27Z","abstract_excerpt":"Noncommutative constraint satisfaction problems (NC-CSPs) are higher-dimensional operator extensions of classical CSPs. Despite their significance in quantum information, their approximability remains largely unexplored. A notable example of a noncommutative CSP that is not solvable in polynomial time is NC-Max-$3$-Cut. We present a $0.864$-approximation algorithm for this problem. Our approach extends to a broader class of both classical and noncommutative CSPs. We introduce three key concepts: approximate isometry, relative distribution, and $\\ast$-anticommutation, which may be of independen"},"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":"2312.16765","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-28T01:22:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"46db5b64fe0e84f39fa052bb0173cc4eaf8ac4fa61f2052f8947e5abab92efee","abstract_canon_sha256":"e82066c9e1d425224e506fb376f1e17c9a6529ae560bc5d9ae158e618f1538aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:57.932152Z","signature_b64":"JYTTsH2phplvE8et5P8x3RwHJ7UrmWll0vJsKplcv9yW3tTGfdBtPLjWIljPBFrV/etaH9mXdg5xf2sE/XdJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8b9f8bb2a2e336d46924782e876a777283d34b105fe7ed8c877744791b63dab","last_reissued_at":"2026-07-05T09:12:57.931632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:57.931632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for noncommutative CSPs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Eric Culf, Hamoon Mousavi, Taro Spirig","submitted_at":"2023-12-28T01:22:27Z","abstract_excerpt":"Noncommutative constraint satisfaction problems (NC-CSPs) are higher-dimensional operator extensions of classical CSPs. Despite their significance in quantum information, their approximability remains largely unexplored. A notable example of a noncommutative CSP that is not solvable in polynomial time is NC-Max-$3$-Cut. We present a $0.864$-approximation algorithm for this problem. Our approach extends to a broader class of both classical and noncommutative CSPs. We introduce three key concepts: approximate isometry, relative distribution, and $\\ast$-anticommutation, which may be of independen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16765","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/2312.16765/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":"2312.16765","created_at":"2026-07-05T09:12:57.931691+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.16765v2","created_at":"2026-07-05T09:12:57.931691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16765","created_at":"2026-07-05T09:12:57.931691+00:00"},{"alias_kind":"pith_short_12","alias_value":"5C47ROZKFYZW","created_at":"2026-07-05T09:12:57.931691+00:00"},{"alias_kind":"pith_short_16","alias_value":"5C47ROZKFYZW2RUS","created_at":"2026-07-05T09:12:57.931691+00:00"},{"alias_kind":"pith_short_8","alias_value":"5C47ROZK","created_at":"2026-07-05T09:12:57.931691+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":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4","json":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4.json","graph_json":"https://pith.science/api/pith-number/5C47ROZKFYZW2RUSI6BOQ5VHO4/graph.json","events_json":"https://pith.science/api/pith-number/5C47ROZKFYZW2RUSI6BOQ5VHO4/events.json","paper":"https://pith.science/paper/5C47ROZK"},"agent_actions":{"view_html":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4","download_json":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4.json","view_paper":"https://pith.science/paper/5C47ROZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.16765&json=true","fetch_graph":"https://pith.science/api/pith-number/5C47ROZKFYZW2RUSI6BOQ5VHO4/graph.json","fetch_events":"https://pith.science/api/pith-number/5C47ROZKFYZW2RUSI6BOQ5VHO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/action/storage_attestation","attest_author":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/action/author_attestation","sign_citation":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/action/citation_signature","submit_replication":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/action/replication_record"}},"created_at":"2026-07-05T09:12:57.931691+00:00","updated_at":"2026-07-05T09:12:57.931691+00:00"}