{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DQDXSLUBUC5NIVYD7LZWTWUOBO","short_pith_number":"pith:DQDXSLUB","schema_version":"1.0","canonical_sha256":"1c07792e81a0bad45703faf369da8e0ba602eba9dcd6f8bd49d01a76b572bcf4","source":{"kind":"arxiv","id":"2005.12478","version":2},"attestation_state":"computed","paper":{"title":"A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","quant-ph"],"primary_cat":"math.OC","authors_text":"Elizabeth C. Behrman, James E. Steck, Nam H. Nguyen, Ramkumar Harikrishnakumar, Saideep Nannapaneni","submitted_at":"2020-05-26T01:47:39Z","abstract_excerpt":"Quantum annealing (QA) is a quantum computing algorithm that works on the principle of Adiabatic Quantum Computation (AQC), and it has shown significant computational advantages in solving combinatorial optimization problems such as vehicle routing problems (VRP) when compared to classical algorithms. This paper presents a QA approach for solving a variant VRP known as multi-depot capacitated vehicle routing problem (MDCVRP). This is an NP-hard optimization problem with real-world applications in the fields of transportation, logistics, and supply chain management. We consider heterogeneous de"},"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":"2005.12478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-26T01:47:39Z","cross_cats_sorted":["cs.ET","quant-ph"],"title_canon_sha256":"52c4c1308d628eb638d8b92aa226b170f13e1bbf33b784cfa9ad877fe627c3c2","abstract_canon_sha256":"ee0dc568547e684912b90bb3383c6b8350cb6f03ba08a13c3ec191e24ff98f1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:11.669642Z","signature_b64":"Ry3tnFLGUy3TZiRSbzjM3tkH46/FpjzOJxsCHF0lCBNGw2R/tOHoPrhCOjJ3iDDQQcaa6NhG4lBPG9QcWEcoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c07792e81a0bad45703faf369da8e0ba602eba9dcd6f8bd49d01a76b572bcf4","last_reissued_at":"2026-07-05T01:06:11.669221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:11.669221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","quant-ph"],"primary_cat":"math.OC","authors_text":"Elizabeth C. Behrman, James E. Steck, Nam H. Nguyen, Ramkumar Harikrishnakumar, Saideep Nannapaneni","submitted_at":"2020-05-26T01:47:39Z","abstract_excerpt":"Quantum annealing (QA) is a quantum computing algorithm that works on the principle of Adiabatic Quantum Computation (AQC), and it has shown significant computational advantages in solving combinatorial optimization problems such as vehicle routing problems (VRP) when compared to classical algorithms. This paper presents a QA approach for solving a variant VRP known as multi-depot capacitated vehicle routing problem (MDCVRP). This is an NP-hard optimization problem with real-world applications in the fields of transportation, logistics, and supply chain management. We consider heterogeneous de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.12478","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/2005.12478/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":"2005.12478","created_at":"2026-07-05T01:06:11.669279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.12478v2","created_at":"2026-07-05T01:06:11.669279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.12478","created_at":"2026-07-05T01:06:11.669279+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQDXSLUBUC5N","created_at":"2026-07-05T01:06:11.669279+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQDXSLUBUC5NIVYD","created_at":"2026-07-05T01:06:11.669279+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQDXSLUB","created_at":"2026-07-05T01:06:11.669279+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12856","citing_title":"Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01291","citing_title":"Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework","ref_index":135,"is_internal_anchor":false},{"citing_arxiv_id":"2412.15665","citing_title":"Quantum Subroutines in Branch-Price-and-Cut for Vehicle Routing","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11758","citing_title":"Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO","json":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO.json","graph_json":"https://pith.science/api/pith-number/DQDXSLUBUC5NIVYD7LZWTWUOBO/graph.json","events_json":"https://pith.science/api/pith-number/DQDXSLUBUC5NIVYD7LZWTWUOBO/events.json","paper":"https://pith.science/paper/DQDXSLUB"},"agent_actions":{"view_html":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO","download_json":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO.json","view_paper":"https://pith.science/paper/DQDXSLUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.12478&json=true","fetch_graph":"https://pith.science/api/pith-number/DQDXSLUBUC5NIVYD7LZWTWUOBO/graph.json","fetch_events":"https://pith.science/api/pith-number/DQDXSLUBUC5NIVYD7LZWTWUOBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO/action/storage_attestation","attest_author":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO/action/author_attestation","sign_citation":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO/action/citation_signature","submit_replication":"https://pith.science/pith/DQDXSLUBUC5NIVYD7LZWTWUOBO/action/replication_record"}},"created_at":"2026-07-05T01:06:11.669279+00:00","updated_at":"2026-07-05T01:06:11.669279+00:00"}