{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SCALLUKVRZKZSKWOF54JBOAKFI","short_pith_number":"pith:SCALLUKV","schema_version":"1.0","canonical_sha256":"9080b5d1558e55992ace2f7890b80a2a3cf53cec331bce18498aebb54eccba67","source":{"kind":"arxiv","id":"2309.10957","version":2},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Quantum Max-$d$-Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexandra Kolla, Charlie Carlson, Steven Kordonowy, Stuart Wayland, Zackary Jorquera","submitted_at":"2023-09-19T22:53:17Z","abstract_excerpt":"We initiate the algorithmic study of the Quantum Max-$d$-Cut problem, a quantum generalization of the well-known Max-$d$-Cut problem. The Quantum Max-$d$-Cut problem involves finding a quantum state that maximizes the expected energy associated with the projector onto the antisymmetric subspace of two, $d$-dimensional qudits over all local interactions. Equivalently, this problem is physically motivated by the $SU(d)$-Heisenberg model, a spin glass model that generalized the well-known Heisenberg model over qudits. We develop a polynomial-time randomized approximation algorithm that finds prod"},"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":"2309.10957","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-19T22:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"c2c0ad27c58a811813f594a2e1083b2ea1b1f0ee8fd137b9ece1915e47e70b77","abstract_canon_sha256":"40de33bd5f7c33f66c6eefaacd1233f4c15aa5847f5d11149bf37251e7d717cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:26.402953Z","signature_b64":"Rb0FTHO8PjDT+X0RATlrGbMqr9oz6P/wQ6FyIn5AjqNZviRim9dqCeefxXOLXsjbH80rY61CgATdYAlXom+6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9080b5d1558e55992ace2f7890b80a2a3cf53cec331bce18498aebb54eccba67","last_reissued_at":"2026-07-05T07:47:26.402445Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:26.402445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Quantum Max-$d$-Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexandra Kolla, Charlie Carlson, Steven Kordonowy, Stuart Wayland, Zackary Jorquera","submitted_at":"2023-09-19T22:53:17Z","abstract_excerpt":"We initiate the algorithmic study of the Quantum Max-$d$-Cut problem, a quantum generalization of the well-known Max-$d$-Cut problem. The Quantum Max-$d$-Cut problem involves finding a quantum state that maximizes the expected energy associated with the projector onto the antisymmetric subspace of two, $d$-dimensional qudits over all local interactions. Equivalently, this problem is physically motivated by the $SU(d)$-Heisenberg model, a spin glass model that generalized the well-known Heisenberg model over qudits. We develop a polynomial-time randomized approximation algorithm that finds prod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10957","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/2309.10957/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":"2309.10957","created_at":"2026-07-05T07:47:26.402508+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.10957v2","created_at":"2026-07-05T07:47:26.402508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10957","created_at":"2026-07-05T07:47:26.402508+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCALLUKVRZKZ","created_at":"2026-07-05T07:47:26.402508+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCALLUKVRZKZSKWO","created_at":"2026-07-05T07:47:26.402508+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCALLUKV","created_at":"2026-07-05T07:47:26.402508+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI","json":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI.json","graph_json":"https://pith.science/api/pith-number/SCALLUKVRZKZSKWOF54JBOAKFI/graph.json","events_json":"https://pith.science/api/pith-number/SCALLUKVRZKZSKWOF54JBOAKFI/events.json","paper":"https://pith.science/paper/SCALLUKV"},"agent_actions":{"view_html":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI","download_json":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI.json","view_paper":"https://pith.science/paper/SCALLUKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.10957&json=true","fetch_graph":"https://pith.science/api/pith-number/SCALLUKVRZKZSKWOF54JBOAKFI/graph.json","fetch_events":"https://pith.science/api/pith-number/SCALLUKVRZKZSKWOF54JBOAKFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI/action/storage_attestation","attest_author":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI/action/author_attestation","sign_citation":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI/action/citation_signature","submit_replication":"https://pith.science/pith/SCALLUKVRZKZSKWOF54JBOAKFI/action/replication_record"}},"created_at":"2026-07-05T07:47:26.402508+00:00","updated_at":"2026-07-05T07:47:26.402508+00:00"}