{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TANPRPY2HZ5R7ZL6IGOGWAL2SN","short_pith_number":"pith:TANPRPY2","schema_version":"1.0","canonical_sha256":"981af8bf1a3e7b1fe57e419c6b017a937a24fc61483a24caa4a1ffd72d15901c","source":{"kind":"arxiv","id":"2605.13072","version":1},"attestation_state":"computed","paper":{"title":"Neural QAOA$^{2}$: Differentiable Joint Graph Partitioning and Parameter Initialization for Quantum Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A neural generator learns graph partitions and QAOA starting parameters together by back-propagating through a differentiable quantum evaluator.","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Jiahao Wu, Shengcai Liu, Zubin Zheng","submitted_at":"2026-05-13T06:43:10Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) holds promise for combinatorial optimization but is constrained by limited qubits. While divide-and-conquer frameworks like QAOA$^{2}$ address scalability by partitioning graphs into subgraphs, existing methods suffer from two fundamental limitations: i) misalignment between heuristic partitioning metrics and quantum optimization goals, and ii) topology-blind parameter initialization that leads to optimization cold starts. To bridge these gaps, we propose Neural QAOA$^{2}$, an end-to-end differentiable framework that jointly generates graph"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T06:43:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4c40e405ade12da2fc9d1803dc0db31df2c6c37a513d5bcbd44f261989db1b24","abstract_canon_sha256":"7ff84f3392eed9410c5ded34b1c292cd947e77a119313044b5706f2ec61ba1ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:58.844921Z","signature_b64":"5eD5jXKSBwFu7+IB/BG0vCDUy0RNo/tIRssynui9zqEhFOE2YeBaq0MoqtaJbdx+Is4TgLSkLnYVSD0CAx8bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"981af8bf1a3e7b1fe57e419c6b017a937a24fc61483a24caa4a1ffd72d15901c","last_reissued_at":"2026-05-18T03:08:58.844246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:58.844246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural QAOA$^{2}$: Differentiable Joint Graph Partitioning and Parameter Initialization for Quantum Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A neural generator learns graph partitions and QAOA starting parameters together by back-propagating through a differentiable quantum evaluator.","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Jiahao Wu, Shengcai Liu, Zubin Zheng","submitted_at":"2026-05-13T06:43:10Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) holds promise for combinatorial optimization but is constrained by limited qubits. While divide-and-conquer frameworks like QAOA$^{2}$ address scalability by partitioning graphs into subgraphs, existing methods suffer from two fundamental limitations: i) misalignment between heuristic partitioning metrics and quantum optimization goals, and ii) topology-blind parameter initialization that leads to optimization cold starts. To bridge these gaps, we propose Neural QAOA$^{2}$, an end-to-end differentiable framework that jointly generates graph"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"our gradient-driven approach broadly outperforms heuristic baselines, ranking first on 101 instances. It exhibits zero-shot generalization across out-of-distribution graph topologies and scales.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The differentiable quantum evaluator acts as a high-fidelity performance surrogate that supplies accurate gradient guidance for the joint generator.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A differentiable generative evaluative network jointly learns graph partitions and QAOA parameter initializations, outperforming heuristic baselines on 101 of 183 tested QUBO, Ising, and MaxCut instances with zero-shot generalization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A neural generator learns graph partitions and QAOA starting parameters together by back-propagating through a differentiable quantum evaluator.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"070918e6bfe9c44be266967f6f9526e24190f10f404a0e5bb62efa21f0685ebf"},"source":{"id":"2605.13072","kind":"arxiv","version":1},"verdict":{"id":"5f25995d-9dd4-4ecc-a0ed-b454f6c98a41","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:07:48.107641Z","strongest_claim":"our gradient-driven approach broadly outperforms heuristic baselines, ranking first on 101 instances. It exhibits zero-shot generalization across out-of-distribution graph topologies and scales.","one_line_summary":"A differentiable generative evaluative network jointly learns graph partitions and QAOA parameter initializations, outperforming heuristic baselines on 101 of 183 tested QUBO, Ising, and MaxCut instances with zero-shot generalization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The differentiable quantum evaluator acts as a high-fidelity performance surrogate that supplies accurate gradient guidance for the joint generator.","pith_extraction_headline":"A neural generator learns graph partitions and QAOA starting parameters together by back-propagating through a differentiable quantum evaluator."},"references":{"count":17,"sample":[{"doi":"","year":null,"title":"We collect all applicants for partitionjinto a candidate setU j","work_id":"d61c6981-f3bc-4f51-b3ae-10fb785aa32f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"• If|U j| ≤C (j) remain, all candidates are accepted","work_id":"326d9711-342a-4561-8a4f-143781d3b266","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"weakly-coupled","work_id":"a24ebc77-03ce-4f15-aac5-0d3e611f5133","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"These features are standardized (zero mean, unit variance) within each graph instance to handle variations in graph scale","work_id":"991ce594-5d46-4cfd-ae9f-e3f510ff4cb5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Edge weight normalization: Edge weights are normalized by the maximum absolute weight in the graph, ensuring wij ∈[−1,1]. Construction of the Offline Dataset (Doffline).To pre-train the quantum evalua","work_id":"fd5b4e8e-2caf-459f-bdd2-a5c869819e1f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"0b1edc318022d2de88369e80a3d946820751f2ef49d049b425c7e066f2712ec8","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":"2605.13072","created_at":"2026-05-18T03:08:58.844373+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13072v1","created_at":"2026-05-18T03:08:58.844373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13072","created_at":"2026-05-18T03:08:58.844373+00:00"},{"alias_kind":"pith_short_12","alias_value":"TANPRPY2HZ5R","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"TANPRPY2HZ5R7ZL6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"TANPRPY2","created_at":"2026-05-18T12:33:37.589309+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/TANPRPY2HZ5R7ZL6IGOGWAL2SN","json":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN.json","graph_json":"https://pith.science/api/pith-number/TANPRPY2HZ5R7ZL6IGOGWAL2SN/graph.json","events_json":"https://pith.science/api/pith-number/TANPRPY2HZ5R7ZL6IGOGWAL2SN/events.json","paper":"https://pith.science/paper/TANPRPY2"},"agent_actions":{"view_html":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN","download_json":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN.json","view_paper":"https://pith.science/paper/TANPRPY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13072&json=true","fetch_graph":"https://pith.science/api/pith-number/TANPRPY2HZ5R7ZL6IGOGWAL2SN/graph.json","fetch_events":"https://pith.science/api/pith-number/TANPRPY2HZ5R7ZL6IGOGWAL2SN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN/action/storage_attestation","attest_author":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN/action/author_attestation","sign_citation":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN/action/citation_signature","submit_replication":"https://pith.science/pith/TANPRPY2HZ5R7ZL6IGOGWAL2SN/action/replication_record"}},"created_at":"2026-05-18T03:08:58.844373+00:00","updated_at":"2026-05-18T03:08:58.844373+00:00"}