{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UIKDTBBQWSJJSQCJRR3FN6YLWX","short_pith_number":"pith:UIKDTBBQ","schema_version":"1.0","canonical_sha256":"a214398430b4929940498c7656fb0bb5e64e9ec4962822680a4fb2d2c1d11e32","source":{"kind":"arxiv","id":"2308.08785","version":3},"attestation_state":"computed","paper":{"title":"A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Dongsheng Cai, Hoong Chuin LAU, Ningyi Xie, Nobuyoshi Asai, Xinwei Lee, Yoshiyuki Saito","submitted_at":"2023-08-17T05:14:43Z","abstract_excerpt":"The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a set of customers, subject to the limited carrying capacity of each vehicle. As the number of possible solutions skyrockets when the number of customers increases, finding the optimal solution remains a significant challenge. Recently, the Quantum Approximate Optimization Algorithm (QAOA), a quantum-"},"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":"2308.08785","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-17T05:14:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"54d8f7ccc08472af0b6584f186377fb52ebec8223d599d9ba81fd581b6ea601d","abstract_canon_sha256":"cd03db414d1340370cc59bcaa8619a593e026f547d59ecbb67bafd85cee090a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:16.300046Z","signature_b64":"ONen1Yqmqf6P1GKTFLgjfeam1f2cEYqtaoSxlw0mvucAcBABrZh+wx0jW++jMckbTZMgNdbbmL0UwhD+o1KuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a214398430b4929940498c7656fb0bb5e64e9ec4962822680a4fb2d2c1d11e32","last_reissued_at":"2026-07-05T08:10:16.299578Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:16.299578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Dongsheng Cai, Hoong Chuin LAU, Ningyi Xie, Nobuyoshi Asai, Xinwei Lee, Yoshiyuki Saito","submitted_at":"2023-08-17T05:14:43Z","abstract_excerpt":"The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a set of customers, subject to the limited carrying capacity of each vehicle. As the number of possible solutions skyrockets when the number of customers increases, finding the optimal solution remains a significant challenge. Recently, the Quantum Approximate Optimization Algorithm (QAOA), a quantum-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08785","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/2308.08785/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":"2308.08785","created_at":"2026-07-05T08:10:16.299633+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.08785v3","created_at":"2026-07-05T08:10:16.299633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08785","created_at":"2026-07-05T08:10:16.299633+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIKDTBBQWSJJ","created_at":"2026-07-05T08:10:16.299633+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIKDTBBQWSJJSQCJ","created_at":"2026-07-05T08:10:16.299633+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIKDTBBQ","created_at":"2026-07-05T08:10:16.299633+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.00506","citing_title":"Hierarchical QAOA for the Vehicle Routing Problem via Clustered Decomposition and Local Feasibility Repair","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2511.17259","citing_title":"Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2603.01809","citing_title":"Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\\'er Filtering","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX","json":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX.json","graph_json":"https://pith.science/api/pith-number/UIKDTBBQWSJJSQCJRR3FN6YLWX/graph.json","events_json":"https://pith.science/api/pith-number/UIKDTBBQWSJJSQCJRR3FN6YLWX/events.json","paper":"https://pith.science/paper/UIKDTBBQ"},"agent_actions":{"view_html":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX","download_json":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX.json","view_paper":"https://pith.science/paper/UIKDTBBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.08785&json=true","fetch_graph":"https://pith.science/api/pith-number/UIKDTBBQWSJJSQCJRR3FN6YLWX/graph.json","fetch_events":"https://pith.science/api/pith-number/UIKDTBBQWSJJSQCJRR3FN6YLWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX/action/storage_attestation","attest_author":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX/action/author_attestation","sign_citation":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX/action/citation_signature","submit_replication":"https://pith.science/pith/UIKDTBBQWSJJSQCJRR3FN6YLWX/action/replication_record"}},"created_at":"2026-07-05T08:10:16.299633+00:00","updated_at":"2026-07-05T08:10:16.299633+00:00"}