{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MWWKLTFP7GR7FO6R4ZJKMI52HE","short_pith_number":"pith:MWWKLTFP","schema_version":"1.0","canonical_sha256":"65aca5ccaff9a3f2bbd1e652a623ba390aec61140a6cde3fff2cff94f1ae5134","source":{"kind":"arxiv","id":"2411.17080","version":3},"attestation_state":"computed","paper":{"title":"DeepMDV: Global Spatial Matching for Multi-depot Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DB","authors_text":"Egemen Tanin, Farhana Choudhury, Majid Sarvi, Saeed Nasehi","submitted_at":"2024-11-26T03:41:01Z","abstract_excerpt":"The rapid growth of online retail and e-commerce has made effective and efficient Vehicle Routing Problem (VRP) solutions essential. To meet rising demand, companies are adding more depots, which changes the VRP problem to a complex optimization task of Multi-Depot VRP (MDVRP) where the routing decisions of vehicles from multiple depots are highly interdependent. The complexities render traditional VRP methods suboptimal and non-scalable for the MDVRP. In this paper, we propose a novel approach to solve MDVRP addressing these interdependencies, hence achieving more effective results. The key i"},"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":"2411.17080","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-11-26T03:41:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"f26a699beeb3db26cbf1e0f302203272bdc403df35c9e520cfd8ecf2203c9c8a","abstract_canon_sha256":"a8fda06a7fda6ab1b14822b1738058c0af3be83abc31792a4c63dd78d91a423c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:29.169837Z","signature_b64":"AfF17rAA130qnDZYBlcnds43NJ7HpldcmHzIB0dtbaT3lKfG2VNl0Q3XS5Zck7BykjzSCSkFLPcBd09Pc/46Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65aca5ccaff9a3f2bbd1e652a623ba390aec61140a6cde3fff2cff94f1ae5134","last_reissued_at":"2026-07-05T11:50:29.169399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:29.169399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepMDV: Global Spatial Matching for Multi-depot Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DB","authors_text":"Egemen Tanin, Farhana Choudhury, Majid Sarvi, Saeed Nasehi","submitted_at":"2024-11-26T03:41:01Z","abstract_excerpt":"The rapid growth of online retail and e-commerce has made effective and efficient Vehicle Routing Problem (VRP) solutions essential. To meet rising demand, companies are adding more depots, which changes the VRP problem to a complex optimization task of Multi-Depot VRP (MDVRP) where the routing decisions of vehicles from multiple depots are highly interdependent. The complexities render traditional VRP methods suboptimal and non-scalable for the MDVRP. In this paper, we propose a novel approach to solve MDVRP addressing these interdependencies, hence achieving more effective results. The key i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17080","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/2411.17080/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":"2411.17080","created_at":"2026-07-05T11:50:29.169459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17080v3","created_at":"2026-07-05T11:50:29.169459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17080","created_at":"2026-07-05T11:50:29.169459+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWWKLTFP7GR7","created_at":"2026-07-05T11:50:29.169459+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWWKLTFP7GR7FO6R","created_at":"2026-07-05T11:50:29.169459+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWWKLTFP","created_at":"2026-07-05T11:50:29.169459+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/MWWKLTFP7GR7FO6R4ZJKMI52HE","json":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE.json","graph_json":"https://pith.science/api/pith-number/MWWKLTFP7GR7FO6R4ZJKMI52HE/graph.json","events_json":"https://pith.science/api/pith-number/MWWKLTFP7GR7FO6R4ZJKMI52HE/events.json","paper":"https://pith.science/paper/MWWKLTFP"},"agent_actions":{"view_html":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE","download_json":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE.json","view_paper":"https://pith.science/paper/MWWKLTFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17080&json=true","fetch_graph":"https://pith.science/api/pith-number/MWWKLTFP7GR7FO6R4ZJKMI52HE/graph.json","fetch_events":"https://pith.science/api/pith-number/MWWKLTFP7GR7FO6R4ZJKMI52HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE/action/storage_attestation","attest_author":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE/action/author_attestation","sign_citation":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE/action/citation_signature","submit_replication":"https://pith.science/pith/MWWKLTFP7GR7FO6R4ZJKMI52HE/action/replication_record"}},"created_at":"2026-07-05T11:50:29.169459+00:00","updated_at":"2026-07-05T11:50:29.169459+00:00"}