{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JJLGLWOIBQYL3JQXDP6JAWIQ4F","short_pith_number":"pith:JJLGLWOI","schema_version":"1.0","canonical_sha256":"4a5665d9c80c30bda6171bfc905910e1708c4647e754f77f7ca5e20f5996c1f3","source":{"kind":"arxiv","id":"2602.05956","version":3},"attestation_state":"computed","paper":{"title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.OC"],"primary_cat":"quant-ph","authors_text":"Anuj Apte, Michael A. Perlin, Ruslan Shaydulin, Sami Boulebnane, Sivaprasad Omanakuttan, Yuwei Jin","submitted_at":"2026-02-05T18:11:18Z","abstract_excerpt":"Quantum algorithms for binary optimization problems have been the subject of extensive study. However, the application of quantum algorithms to integer optimization problems remains comparatively unexplored. In this paper, we study the Quantum Approximate Optimization Algorithm (QAOA) applied to integer problems on graphs, with each integer variable encoded in a qudit. We derive a general iterative formula for depth-$p$ QAOA expectation on high-girth $d$-regular graphs of arbitrary size. The cost of evaluating the formula is exponential in the QAOA depth $p$ but does not depend on the graph si"},"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":"2602.05956","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-02-05T18:11:18Z","cross_cats_sorted":["math-ph","math.MP","math.OC"],"title_canon_sha256":"72617aeefad051aec4eb448179420f4e8a888880969a46caee70c0cb35b59239","abstract_canon_sha256":"51dd32bf856191983d40dd183cec5dcda756f97675e3953d384f63630fb8e4b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:39.584340Z","signature_b64":"TeOtlTDuGk4KUknzah/1uDaG9RYF6/ttAzxnuYYSOV17A16JhGb5dMO8HcVD+I2rQfSHiC6+hqnAfuuBUwHUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5665d9c80c30bda6171bfc905910e1708c4647e754f77f7ca5e20f5996c1f3","last_reissued_at":"2026-05-22T02:04:39.583286Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:39.583286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.OC"],"primary_cat":"quant-ph","authors_text":"Anuj Apte, Michael A. Perlin, Ruslan Shaydulin, Sami Boulebnane, Sivaprasad Omanakuttan, Yuwei Jin","submitted_at":"2026-02-05T18:11:18Z","abstract_excerpt":"Quantum algorithms for binary optimization problems have been the subject of extensive study. However, the application of quantum algorithms to integer optimization problems remains comparatively unexplored. In this paper, we study the Quantum Approximate Optimization Algorithm (QAOA) applied to integer problems on graphs, with each integer variable encoded in a qudit. We derive a general iterative formula for depth-$p$ QAOA expectation on high-girth $d$-regular graphs of arbitrary size. The cost of evaluating the formula is exponential in the QAOA depth $p$ but does not depend on the graph si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.05956","kind":"arxiv","version":3},"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/2602.05956/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":"2602.05956","created_at":"2026-05-22T02:04:39.583434+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.05956v3","created_at":"2026-05-22T02:04:39.583434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.05956","created_at":"2026-05-22T02:04:39.583434+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJLGLWOIBQYL","created_at":"2026-05-22T02:04:39.583434+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJLGLWOIBQYL3JQX","created_at":"2026-05-22T02:04:39.583434+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJLGLWOI","created_at":"2026-05-22T02:04:39.583434+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/JJLGLWOIBQYL3JQXDP6JAWIQ4F","json":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F.json","graph_json":"https://pith.science/api/pith-number/JJLGLWOIBQYL3JQXDP6JAWIQ4F/graph.json","events_json":"https://pith.science/api/pith-number/JJLGLWOIBQYL3JQXDP6JAWIQ4F/events.json","paper":"https://pith.science/paper/JJLGLWOI"},"agent_actions":{"view_html":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F","download_json":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F.json","view_paper":"https://pith.science/paper/JJLGLWOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.05956&json=true","fetch_graph":"https://pith.science/api/pith-number/JJLGLWOIBQYL3JQXDP6JAWIQ4F/graph.json","fetch_events":"https://pith.science/api/pith-number/JJLGLWOIBQYL3JQXDP6JAWIQ4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F/action/storage_attestation","attest_author":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F/action/author_attestation","sign_citation":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F/action/citation_signature","submit_replication":"https://pith.science/pith/JJLGLWOIBQYL3JQXDP6JAWIQ4F/action/replication_record"}},"created_at":"2026-05-22T02:04:39.583434+00:00","updated_at":"2026-05-22T02:04:39.583434+00:00"}