{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RPHRZCPIYPKKBV6BZZKHU2GZK4","short_pith_number":"pith:RPHRZCPI","schema_version":"1.0","canonical_sha256":"8bcf1c89e8c3d4a0d7c1ce547a68d95705a8d6c7baa1f33427ea487e3df34d48","source":{"kind":"arxiv","id":"2507.05373","version":1},"attestation_state":"computed","paper":{"title":"Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Maciejunes, Dan Gunlycke, John Stenger, Nikos Chrisochoides","submitted_at":"2025-07-07T18:02:13Z","abstract_excerpt":"We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm. A Problem-Level Decomposition partitions a 13-node (156-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further cut via Circuit-Level Decomposition, enabling execution on near-term quantum devices. Our approach achieves up to 95\\% reductions in the circuit depth, 96\\% reduction in the number of qubits and a 99.5\\% reduction in the number of 2-qubit gates. We demonstrate this hybrid algorithm on the standard edge e"},"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":"2507.05373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-07T18:02:13Z","cross_cats_sorted":[],"title_canon_sha256":"bcc2aa65de91ff37aacde477731507bf40120caac784939f9fa6e17529f962de","abstract_canon_sha256":"db540f65f76580cdc397dba8c0ce816611e1a00ab0f54b2875ef63e81fe7f4c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:29.379096Z","signature_b64":"GMR71xne/awVBLLxLVeuSx4ZcCzjT2/UIGPYBy6mlg2YFHdwQXGdViF0DlAP/mC2WB8HIqp1lqIPMofnf2ofBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bcf1c89e8c3d4a0d7c1ce547a68d95705a8d6c7baa1f33427ea487e3df34d48","last_reissued_at":"2026-07-05T11:33:29.378640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:29.378640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Maciejunes, Dan Gunlycke, John Stenger, Nikos Chrisochoides","submitted_at":"2025-07-07T18:02:13Z","abstract_excerpt":"We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm. A Problem-Level Decomposition partitions a 13-node (156-qubit) VRP into smaller Traveling Salesman Problem (TSP) instances. Each TSP is then further cut via Circuit-Level Decomposition, enabling execution on near-term quantum devices. Our approach achieves up to 95\\% reductions in the circuit depth, 96\\% reduction in the number of qubits and a 99.5\\% reduction in the number of 2-qubit gates. We demonstrate this hybrid algorithm on the standard edge e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05373","kind":"arxiv","version":1},"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/2507.05373/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":"2507.05373","created_at":"2026-07-05T11:33:29.378694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05373v1","created_at":"2026-07-05T11:33:29.378694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05373","created_at":"2026-07-05T11:33:29.378694+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPHRZCPIYPKK","created_at":"2026-07-05T11:33:29.378694+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPHRZCPIYPKKBV6B","created_at":"2026-07-05T11:33:29.378694+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPHRZCPI","created_at":"2026-07-05T11:33:29.378694+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19035","citing_title":"Scalable quantum circuit knitting using a weak-coupling approximation","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24806","citing_title":"Versioned Late Materialization for Ultra-Long Sequence Training in Recommendation Systems at Scale","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2511.00506","citing_title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24807","citing_title":"From Prototype to Classroom: An Intelligent Tutoring System for Quantum Education","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20639","citing_title":"Distributed Quantum-Enhanced Optimization: A Topographical Preconditioning Approach for High-Dimensional Search","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4","json":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4.json","graph_json":"https://pith.science/api/pith-number/RPHRZCPIYPKKBV6BZZKHU2GZK4/graph.json","events_json":"https://pith.science/api/pith-number/RPHRZCPIYPKKBV6BZZKHU2GZK4/events.json","paper":"https://pith.science/paper/RPHRZCPI"},"agent_actions":{"view_html":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4","download_json":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4.json","view_paper":"https://pith.science/paper/RPHRZCPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05373&json=true","fetch_graph":"https://pith.science/api/pith-number/RPHRZCPIYPKKBV6BZZKHU2GZK4/graph.json","fetch_events":"https://pith.science/api/pith-number/RPHRZCPIYPKKBV6BZZKHU2GZK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/action/storage_attestation","attest_author":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/action/author_attestation","sign_citation":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/action/citation_signature","submit_replication":"https://pith.science/pith/RPHRZCPIYPKKBV6BZZKHU2GZK4/action/replication_record"}},"created_at":"2026-07-05T11:33:29.378694+00:00","updated_at":"2026-07-05T11:33:29.378694+00:00"}