{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5C47ROZKFYZW2RUSI6BOQ5VHO4","short_pith_number":"pith:5C47ROZK","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"},"canonical_sha256":"e8b9f8bb2a2e336d46924782e876a777283d34b105fe7ed8c877744791b63dab","source":{"kind":"arxiv","id":"2312.16765","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16765","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16765v2","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16765","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"5C47ROZKFYZW","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"5C47ROZKFYZW2RUS","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"5C47ROZK","created_at":"2026-07-05T09:12:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5C47ROZKFYZW2RUSI6BOQ5VHO4","target":"record","payload":{"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"},"canonical_sha256":"e8b9f8bb2a2e336d46924782e876a777283d34b105fe7ed8c877744791b63dab","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"},"source_kind":"arxiv","source_id":"2312.16765","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwf1S9+quf3qpZNJJoJKIHa/zOOcT9LKs2rPgYg1Flo4spe4J2ZJ/dQ+Wj9M4wias/qb6dxTgsOnHxLWHAHWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:35:08.342871Z"},"content_sha256":"bbc632ad8b39b224d942d840d62291631eb46bb4ef895a56f0192684c099de6e","schema_version":"1.0","event_id":"sha256:bbc632ad8b39b224d942d840d62291631eb46bb4ef895a56f0192684c099de6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5C47ROZKFYZW2RUSI6BOQ5VHO4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:12:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Tt4f2AWEm4hqK3xndlLgfTvZRIpdBTK/xwfwzVCQuHghdORTCp9gyHWWvzu/ZpTfpDK77/8urOg8vtZh34zDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:35:08.343802Z"},"content_sha256":"234be7a77296b5d7d91fc4ff70db58f5af5da8c003c05ecb0c95acf68abab424","schema_version":"1.0","event_id":"sha256:234be7a77296b5d7d91fc4ff70db58f5af5da8c003c05ecb0c95acf68abab424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/bundle.json","state_url":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T15:35:08Z","links":{"resolver":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4","bundle":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/bundle.json","state":"https://pith.science/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5C47ROZKFYZW2RUSI6BOQ5VHO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5C47ROZKFYZW2RUSI6BOQ5VHO4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e82066c9e1d425224e506fb376f1e17c9a6529ae560bc5d9ae158e618f1538aa","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-28T01:22:27Z","title_canon_sha256":"46db5b64fe0e84f39fa052bb0173cc4eaf8ac4fa61f2052f8947e5abab92efee"},"schema_version":"1.0","source":{"id":"2312.16765","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16765","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16765v2","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16765","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"pith_short_12","alias_value":"5C47ROZKFYZW","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"pith_short_16","alias_value":"5C47ROZKFYZW2RUS","created_at":"2026-07-05T09:12:57Z"},{"alias_kind":"pith_short_8","alias_value":"5C47ROZK","created_at":"2026-07-05T09:12:57Z"}],"graph_snapshots":[{"event_id":"sha256:234be7a77296b5d7d91fc4ff70db58f5af5da8c003c05ecb0c95acf68abab424","target":"graph","created_at":"2026-07-05T09:12:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.16765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eric Culf, Hamoon Mousavi, Taro Spirig","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-28T01:22:27Z","title":"Approximation algorithms for noncommutative CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16765","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bbc632ad8b39b224d942d840d62291631eb46bb4ef895a56f0192684c099de6e","target":"record","created_at":"2026-07-05T09:12:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e82066c9e1d425224e506fb376f1e17c9a6529ae560bc5d9ae158e618f1538aa","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-28T01:22:27Z","title_canon_sha256":"46db5b64fe0e84f39fa052bb0173cc4eaf8ac4fa61f2052f8947e5abab92efee"},"schema_version":"1.0","source":{"id":"2312.16765","kind":"arxiv","version":2}},"canonical_sha256":"e8b9f8bb2a2e336d46924782e876a777283d34b105fe7ed8c877744791b63dab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8b9f8bb2a2e336d46924782e876a777283d34b105fe7ed8c877744791b63dab","first_computed_at":"2026-07-05T09:12:57.931632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:12:57.931632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JYTTsH2phplvE8et5P8x3RwHJ7UrmWll0vJsKplcv9yW3tTGfdBtPLjWIljPBFrV/etaH9mXdg5xf2sE/XdJAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:12:57.932152Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.16765","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbc632ad8b39b224d942d840d62291631eb46bb4ef895a56f0192684c099de6e","sha256:234be7a77296b5d7d91fc4ff70db58f5af5da8c003c05ecb0c95acf68abab424"],"state_sha256":"5e4deba5f5f9a887b6b0ef787675c51cc0bd632248a2f7566befdb3c30a0547b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C3bEFFGAHJZzk5X0C+j2rPPSk7duKCt37xEKeMKH7Iax6FE7Jw1w/Zyf4HJa93EzPY+ngQ+ADNqYKs0KRranBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T15:35:08.350954Z","bundle_sha256":"d760b56299f68d713751e0270663351e3dbcd3892266990e02535820e0ab3513"}}