{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/cvrp-decoder","entry":"CVRP_Decoder","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":8,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":7},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2506.02935","paper":null,"title":"arXiv:2506.02935","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"CIAM-Group/MTLKD","path":"student_model/model/model.py","file_url":"https://github.com/CIAM-Group/MTLKD/blob/HEAD/student_model/model/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5dce1dd3a5daad05","mcp_get_code":{"code_sha256":"5dce1dd3a5daad05"}},{"arxiv_id":"2505.13904","paper":"/paper/learning-to-insert-for-constructive-neural","title":"Learning to Insert for Constructive Neural Vehicle Routing Solver","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CIAM-Group/L2C_Insert","path":"L2C_Insert/CVRP/Train/VRPModel.py","file_url":"https://github.com/CIAM-Group/L2C_Insert/blob/HEAD/L2C_Insert/CVRP/Train/VRPModel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"83d53d14d54d9b9c","mcp_get_code":{"code_sha256":"83d53d14d54d9b9c"}},{"arxiv_id":"2310.07985","paper":"/paper/neural-combinatorial-optimization-with-heavy","title":"Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ciam-group/nco_code","path":"single_objective/LEHD/CVRP/VRPModel.py","file_url":"https://github.com/ciam-group/nco_code/blob/HEAD/single_objective/LEHD/CVRP/VRPModel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d8afc21ac6216353","mcp_get_code":{"code_sha256":"d8afc21ac6216353"}},{"arxiv_id":"2306.02688","paper":"/paper/meta-sage-scale-meta-learning-scheduled","title":"Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/meta-sage","path":"Meta-SAGE/train/POMO/CVRP/2_Meta/SML_Model.py","file_url":"https://github.com/kaist-silab/meta-sage/blob/HEAD/Meta-SAGE/train/POMO/CVRP/2_Meta/SML_Model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f062140aa1bdbb2a","mcp_get_code":{"code_sha256":"f062140aa1bdbb2a"}},{"arxiv_id":"2305.19587","paper":"/paper/towards-omni-generalizable-neural-methods-for","title":"Towards Omni-generalizable Neural Methods for Vehicle Routing Problems","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royalskye/omni-vrp","path":"POMO/CVRP/CVRPTrainer_meta.py","file_url":"https://github.com/royalskye/omni-vrp/blob/HEAD/POMO/CVRP/CVRPTrainer_meta.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4bd04c65381e358c","mcp_get_code":{"code_sha256":"4bd04c65381e358c"}},{"arxiv_id":"2205.13209","paper":"/paper/sym-nco-leveraging-symmetricity-for-neural","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alstn12088/sym-nco","path":"Sym-NCO-POMO/CVRP/CVRPModel_ours.py","file_url":"https://github.com/alstn12088/sym-nco/blob/HEAD/Sym-NCO-POMO/CVRP/CVRPModel_ours.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"14f0ce32959697b5","mcp_get_code":{"code_sha256":"14f0ce32959697b5"}},{"arxiv_id":"2203.15386","paper":"/paper/pareto-set-learning-for-neural-multi","title":"Pareto Set Learning for Neural Multi-objective Combinatorial Optimization","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xi-l/pmoco","path":"MOCVRP/POMO/MOCVRPModel.py","file_url":"https://github.com/xi-l/pmoco/blob/HEAD/MOCVRP/POMO/MOCVRPModel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6b3c1e9c0cfa1272","mcp_get_code":{"code_sha256":"6b3c1e9c0cfa1272"}},{"arxiv_id":"2010.16011","paper":"/paper/pomo-policy-optimization-with-multiple-optima","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","date":"2020-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/symmetric_replay","path":"euclidean_co/pomo/CVRP/POMO/CVRPModel.py","file_url":"https://github.com/kaist-silab/symmetric_replay/blob/HEAD/euclidean_co/pomo/CVRP/POMO/CVRPModel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c116514452b41b5d","mcp_get_code":{"code_sha256":"c116514452b41b5d"}}]}