{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QNE6M7I34RDIGWSDAJ4RA26EUA","short_pith_number":"pith:QNE6M7I3","schema_version":"1.0","canonical_sha256":"8349e67d1be446835a430279106bc4a00e55747bd9d161c83f34c204a91946be","source":{"kind":"arxiv","id":"2605.14416","version":1},"attestation_state":"computed","paper":{"title":"A Unified Knowledge Embedded Reinforcement Learning-based Framework for Generalized Capacitated Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A framework embedding classical routing knowledge into RL achieves better solutions for diverse CVRP variants.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hao Hu, Liang Wang, Wen Wang, Xiangchen Wu, Xianping Tao","submitted_at":"2026-05-14T06:05:22Z","abstract_excerpt":"The Capacitated Vehicle Routing Problem (CVRP) is a fundamental NP-hard problem with broad applications in logistics and transportation. Real-world CVRPs often involve diverse objectives and complex constraints, such as time windows or backhaul requirements, motivating the development of a unified solution framework. Recent reinforcement learning (RL) approaches have shown promise in combinatorial optimization, yet they rely on end-to-end learning and lack explicit problem-solving knowledge, limiting solution quality. In this paper, we propose a knowledge-embedded framework inspired by the Rou"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14416","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T06:05:22Z","cross_cats_sorted":[],"title_canon_sha256":"6d597269492c269738a83d7a698cb3dc078be69e23ea18195e50a3a9e7de21a8","abstract_canon_sha256":"f88afeb8bc5a0cdb2dba1101c43bc30c320a2c1924230ad1581bd593fb419220"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.301581Z","signature_b64":"yRahM4enr5OoJa6EznHW4zkF7D907Tjjt9SeWpIp0jCanOQqnQAQpYna7pgbixNIUIZi76CKuDGntdwFAXXXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8349e67d1be446835a430279106bc4a00e55747bd9d161c83f34c204a91946be","last_reissued_at":"2026-05-17T23:39:07.300744Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.300744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Knowledge Embedded Reinforcement Learning-based Framework for Generalized Capacitated Vehicle Routing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A framework embedding classical routing knowledge into RL achieves better solutions for diverse CVRP variants.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hao Hu, Liang Wang, Wen Wang, Xiangchen Wu, Xianping Tao","submitted_at":"2026-05-14T06:05:22Z","abstract_excerpt":"The Capacitated Vehicle Routing Problem (CVRP) is a fundamental NP-hard problem with broad applications in logistics and transportation. Real-world CVRPs often involve diverse objectives and complex constraints, such as time windows or backhaul requirements, motivating the development of a unified solution framework. Recent reinforcement learning (RL) approaches have shown promise in combinatorial optimization, yet they rely on end-to-end learning and lack explicit problem-solving knowledge, limiting solution quality. In this paper, we propose a knowledge-embedded framework inspired by the Rou"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Extensive experiments show that this framework achieves superior solution quality compared with state-of-the-art learning-based methods, with a smaller gap to classical heuristics, demonstrating strong generalization across diverse CVRP variants.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the Route-First Cluster-Second decomposition plus dynamic programming guidance will reliably mitigate partial observability and produce generalizable improvements without introducing new biases or overfitting to the tested CVRP variants.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A knowledge-embedded RL framework decomposes generalized CVRPs into route-first and cluster-second subproblems, using dynamic programming to guide the RL solver and a history-enhanced context module to handle partial observability, yielding better solutions than prior learning methods.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A framework embedding classical routing knowledge into RL achieves better solutions for diverse CVRP variants.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a5a7cbe3e560807b7369002c3a1c2b30d7bb080094d48e4791871fcccf748068"},"source":{"id":"2605.14416","kind":"arxiv","version":1},"verdict":{"id":"def30479-0570-414b-a712-e49a8c6ca532","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:06:16.113961Z","strongest_claim":"Extensive experiments show that this framework achieves superior solution quality compared with state-of-the-art learning-based methods, with a smaller gap to classical heuristics, demonstrating strong generalization across diverse CVRP variants.","one_line_summary":"A knowledge-embedded RL framework decomposes generalized CVRPs into route-first and cluster-second subproblems, using dynamic programming to guide the RL solver and a history-enhanced context module to handle partial observability, yielding better solutions than prior learning methods.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the Route-First Cluster-Second decomposition plus dynamic programming guidance will reliably mitigate partial observability and produce generalizable improvements without introducing new biases or overfitting to the tested CVRP variants.","pith_extraction_headline":"A framework embedding classical routing knowledge into RL achieves better solutions for diverse CVRP variants."},"references":{"count":42,"sample":[{"doi":"","year":2024,"title":"Routefinder: Towards foundation models for vehicle routing problems","work_id":"65b94abc-7a2f-4393-bd62-6da2c721cfea","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Learn- ing to handle complex constraints for vehicle routing prob- lems.Advances in Neural Information Processing Sys- tems, 37:93479–93509,","work_id":"78783065-615f-42d4-8053-c9b54afe3327","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Learning to perform local rewriting for combinatorial opti- mization.Advances in neural information processing sys- tems, 32,","work_id":"6d943f93-f5a7-4c4c-bbd4-57d3c98f04b5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Select and optimize: Learning to solve large-scale tsp instances","work_id":"87d25f8c-0301-493d-a781-843da427f284","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Learning 2-opt heuristics for the traveling salesman problem via deep re- inforcement learning","work_id":"f079835f-7cd1-4c98-8ea8-dc44846d6b10","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":42,"snapshot_sha256":"8db56c4f55f4230dde80621239975e5ce37b6a865226bbef87ac9b758da6e7ac","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":"2605.14416","created_at":"2026-05-17T23:39:07.300862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14416v1","created_at":"2026-05-17T23:39:07.300862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14416","created_at":"2026-05-17T23:39:07.300862+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNE6M7I34RDI","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNE6M7I34RDIGWSD","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNE6M7I3","created_at":"2026-05-18T12:33:37.589309+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/QNE6M7I34RDIGWSDAJ4RA26EUA","json":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA.json","graph_json":"https://pith.science/api/pith-number/QNE6M7I34RDIGWSDAJ4RA26EUA/graph.json","events_json":"https://pith.science/api/pith-number/QNE6M7I34RDIGWSDAJ4RA26EUA/events.json","paper":"https://pith.science/paper/QNE6M7I3"},"agent_actions":{"view_html":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA","download_json":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA.json","view_paper":"https://pith.science/paper/QNE6M7I3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14416&json=true","fetch_graph":"https://pith.science/api/pith-number/QNE6M7I34RDIGWSDAJ4RA26EUA/graph.json","fetch_events":"https://pith.science/api/pith-number/QNE6M7I34RDIGWSDAJ4RA26EUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA/action/storage_attestation","attest_author":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA/action/author_attestation","sign_citation":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA/action/citation_signature","submit_replication":"https://pith.science/pith/QNE6M7I34RDIGWSDAJ4RA26EUA/action/replication_record"}},"created_at":"2026-05-17T23:39:07.300862+00:00","updated_at":"2026-05-17T23:39:07.300862+00:00"}