{"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/check-extension","entry":"check_extension","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":8,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"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":"2606.30680","paper":"/paper/arxiv-2606-30680","title":"Locker-based Truck-Drone Routing with Integrated Considerations of Pickups, Deliveries, and No-Fly Zones","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wouterkool/attention-learn-to-route","path":"utils/data_utils.py","file_url":"https://github.com/wouterkool/attention-learn-to-route/blob/HEAD/utils/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}},{"arxiv_id":"2410.21066","paper":"/paper/learning-to-handle-complex-constraints-for","title":"Learning to Handle Complex Constraints for Vehicle Routing Problems","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jieyibi/PIP-constraint","path":"GFACS+PIP/lkh.py","file_url":"https://github.com/jieyibi/PIP-constraint/blob/HEAD/GFACS%2BPIP/lkh.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}},{"arxiv_id":"2403.07041","paper":"/paper/ant-colony-sampling-with-gflownets-for","title":"Ant Colony Sampling with GFlowNets for Combinatorial Optimization","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4co/gfacs","path":"cvrp_nls/lkh.py","file_url":"https://github.com/ai4co/gfacs/blob/HEAD/cvrp_nls/lkh.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}},{"arxiv_id":"2308.14104","paper":"/paper/towards-generalizable-neural-solvers-for","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaocrr/elg","path":"CVRP/generate_data.py","file_url":"https://github.com/gaocrr/elg/blob/HEAD/CVRP/generate_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}},{"arxiv_id":"2205.13225","paper":"/paper/collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/devformer","path":"src/utils/data_utils.py","file_url":"https://github.com/kaist-silab/devformer/blob/HEAD/src/utils/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}},{"arxiv_id":"1803.08475","paper":"/paper/attention-learn-to-solve-routing-problems","title":"Attention, Learn to Solve Routing Problems!","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theresearchai/vehicle_routing_rl_2","path":"utils/data_utils.py","file_url":"https://github.com/theresearchai/vehicle_routing_rl_2/blob/HEAD/utils/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}},{"arxiv_id":"ijcai2024_0764","paper":null,"title":"arXiv:ijcai2024_0764","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lamda-bbo/ELG","path":"CVRP/generate_data.py","file_url":"https://github.com/lamda-bbo/ELG/blob/HEAD/CVRP/generate_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"01df1926cf07ac89","mcp_get_code":{"code_sha256":"01df1926cf07ac89"}}]}