{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DTHDVBXTVWVDMQBBKKBWRJWP77","short_pith_number":"pith:DTHDVBXT","schema_version":"1.0","canonical_sha256":"1cce3a86f3adaa364021528368a6cfffe7b68a38f63e6a18dfe42b8f65c375a2","source":{"kind":"arxiv","id":"2403.00026","version":1},"attestation_state":"computed","paper":{"title":"Learning to Deliver: a Foundation Model for the Montreal Capacitated Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Akash Srivastava, Matthias Winkenbach, Samuel J. K. Chin","submitted_at":"2024-02-28T16:02:29Z","abstract_excerpt":"In this paper, we present the Foundation Model for the Montreal Capacitated Vehicle Routing Problem (FM-MCVRP), a novel Deep Learning (DL) model that approximates high-quality solutions to a variant of the Capacitated Vehicle Routing Problem (CVRP) that characterizes many real-world applications. The so-called Montreal Capacitated Vehicle Routing Problem (MCVRP), first formally described by Bengio et al. (2021), is defined on a fixed and finite graph, which is analogous to a city. Each MCVRP instance is essentially the sub-graph connecting a randomly sampled subset of the nodes in the fixed gr"},"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":"2403.00026","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-28T16:02:29Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"51a8bc3d4596c2c4ed77bb9b12ad1b3698e98300da673c18350e50650e16e0bb","abstract_canon_sha256":"0f098b2c52a40acc8ac592067652db051d3b7cf5406c3e8e0ce259b38cf552aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:57.692380Z","signature_b64":"5V0cER55cUu891il9EuPfiplYtDWoDZozG/Ae7cB0iU57JcxvkWVxtlF8ASgoprDelSMmY/wUKf8z6gnsIEKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cce3a86f3adaa364021528368a6cfffe7b68a38f63e6a18dfe42b8f65c375a2","last_reissued_at":"2026-07-05T07:50:57.692002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:57.692002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Deliver: a Foundation Model for the Montreal Capacitated Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Akash Srivastava, Matthias Winkenbach, Samuel J. K. Chin","submitted_at":"2024-02-28T16:02:29Z","abstract_excerpt":"In this paper, we present the Foundation Model for the Montreal Capacitated Vehicle Routing Problem (FM-MCVRP), a novel Deep Learning (DL) model that approximates high-quality solutions to a variant of the Capacitated Vehicle Routing Problem (CVRP) that characterizes many real-world applications. The so-called Montreal Capacitated Vehicle Routing Problem (MCVRP), first formally described by Bengio et al. (2021), is defined on a fixed and finite graph, which is analogous to a city. Each MCVRP instance is essentially the sub-graph connecting a randomly sampled subset of the nodes in the fixed gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00026","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/2403.00026/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":"2403.00026","created_at":"2026-07-05T07:50:57.692059+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.00026v1","created_at":"2026-07-05T07:50:57.692059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00026","created_at":"2026-07-05T07:50:57.692059+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTHDVBXTVWVD","created_at":"2026-07-05T07:50:57.692059+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTHDVBXTVWVDMQBB","created_at":"2026-07-05T07:50:57.692059+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTHDVBXT","created_at":"2026-07-05T07:50:57.692059+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/DTHDVBXTVWVDMQBBKKBWRJWP77","json":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77.json","graph_json":"https://pith.science/api/pith-number/DTHDVBXTVWVDMQBBKKBWRJWP77/graph.json","events_json":"https://pith.science/api/pith-number/DTHDVBXTVWVDMQBBKKBWRJWP77/events.json","paper":"https://pith.science/paper/DTHDVBXT"},"agent_actions":{"view_html":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77","download_json":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77.json","view_paper":"https://pith.science/paper/DTHDVBXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.00026&json=true","fetch_graph":"https://pith.science/api/pith-number/DTHDVBXTVWVDMQBBKKBWRJWP77/graph.json","fetch_events":"https://pith.science/api/pith-number/DTHDVBXTVWVDMQBBKKBWRJWP77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77/action/storage_attestation","attest_author":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77/action/author_attestation","sign_citation":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77/action/citation_signature","submit_replication":"https://pith.science/pith/DTHDVBXTVWVDMQBBKKBWRJWP77/action/replication_record"}},"created_at":"2026-07-05T07:50:57.692059+00:00","updated_at":"2026-07-05T07:50:57.692059+00:00"}