{"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/reshape-by-heads","entry":"reshape_by_heads","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":18,"n_papers_ran":18,"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":5,"n_samples_ran":5,"n_samples_fingerprinted":5,"n_places":18,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":1,"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":"2604.16581","paper":"/paper/arxiv-2604-16581","title":"NCO4CVRP: Neural Combinatorial Optimization for the Capacitated Vehicle Routing Problem","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"CIAM-Group/NCO_code","path":"single_objective/DPN-minmaxVRP-master/nets/ha_hpa_encoder.py","file_url":"https://github.com/CIAM-Group/NCO_code/blob/HEAD/single_objective/DPN-minmaxVRP-master/nets/ha_hpa_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2603.07020","paper":"/paper/arxiv-2603-07020","title":"RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified States","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"XiangjieXiao/ReSched","path":"PPO/SchedulingModel.py","file_url":"https://github.com/XiangjieXiao/ReSched/blob/HEAD/PPO/SchedulingModel.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36380487b1505ac6","mcp_get_code":{"code_sha256":"36380487b1505ac6"}},{"arxiv_id":"2603.03388","paper":"/paper/arxiv-2603-03388","title":"RADAR: Learning to Route with Asymmetry-aware DistAnce Representations","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"yihang0410/RADAR","path":"acvrp/ACVRPModel.py","file_url":"https://github.com/yihang0410/RADAR/blob/HEAD/acvrp/ACVRPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2602.16012","paper":"/paper/arxiv-2602-16012","title":"Towards Efficient Constraint Handling in Neural Solvers for Routing Problems","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jieyibi/CaR-constraint","path":"models/SINGLEModel.py","file_url":"https://github.com/jieyibi/CaR-constraint/blob/HEAD/models/SINGLEModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2503.07580","paper":"/paper/neural-combinatorial-optimization-via","title":"Neural Combinatorial Optimization via Preference Optimization","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"L-Z-7/BOPO","path":"TSP/TSPModel.py","file_url":"https://github.com/L-Z-7/BOPO/blob/HEAD/TSP/TSPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2410.09693","paper":"/paper/neural-solver-selection-for-combinatorial","title":"Neural Solver Selection for Combinatorial Optimization","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/neural-solver-selection","path":"model.py","file_url":"https://github.com/lamda-bbo/neural-solver-selection/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2410.04968","paper":"/paper/collaboration-towards-robust-neural-methods","title":"Collaboration! Towards Robust Neural Methods for Routing Problems","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RoyalSkye/Routing-CNF","path":"MatNet/ATSP-HAC/ATSPModel.py","file_url":"https://github.com/RoyalSkye/Routing-CNF/blob/HEAD/MatNet/ATSP-HAC/ATSPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2406.09899","paper":"/paper/learning-solution-aware-transformers-for","title":"Learning Solution-Aware Transformers for Efficiently Solving Quadratic Assignment Problem","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKUTAN/SAWT","path":"transformer/Layers.py","file_url":"https://github.com/PKUTAN/SAWT/blob/HEAD/transformer/Layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2405.01029","paper":"/paper/mvmoe-multi-task-vehicle-routing-solver-with","title":"MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts","date":"2024-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RoyalSkye/Routing-MVMoE","path":"models/MOEModel.py","file_url":"https://github.com/RoyalSkye/Routing-MVMoE/blob/HEAD/models/MOEModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee2537dbc9f6594b","mcp_get_code":{"code_sha256":"ee2537dbc9f6594b"}},{"arxiv_id":"2402.16891","paper":"/paper/multi-task-learning-for-routing-problem-with","title":"Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalization","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feiliu36/mtnco","path":"MTPOMO/POMO/VRPModel.py","file_url":"https://github.com/feiliu36/mtnco/blob/HEAD/MTPOMO/POMO/VRPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2402.01145","paper":"/paper/reevo-large-language-models-as-hyper","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4co/llm-as-hh","path":"problems/cvrp_lehd/VRPModel.py","file_url":"https://github.com/ai4co/llm-as-hh/blob/HEAD/problems/cvrp_lehd/VRPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2312.08224","paper":"/paper/glop-learning-global-partition-and-local","title":"GLOP: Learning Global Partition and Local Construction for Solving Large-scale Routing Problems in Real-time","date":"2023-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henry-yeh/glop","path":"eval_atsp/ASHPPModel.py","file_url":"https://github.com/henry-yeh/glop/blob/HEAD/eval_atsp/ASHPPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"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/models.py","file_url":"https://github.com/gaocrr/elg/blob/HEAD/CVRP/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20d42bc12bb9a14d","mcp_get_code":{"code_sha256":"20d42bc12bb9a14d"}},{"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/CVRPModel.py","file_url":"https://github.com/RoyalSkye/Omni-VRP/blob/HEAD/POMO/CVRP/CVRPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"arxiv_id":"2202.07241","paper":"/paper/learning-to-solve-routing-problems-via","title":"Learning to Solve Routing Problems via Distributionally Robust Optimization","date":"2022-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yd-kwon/POMO","path":"OLD_ipynb_ver/POMO_CVRP/source/MODEL__Actor/grouped_actors.py","file_url":"https://github.com/yd-kwon/POMO/blob/HEAD/OLD_ipynb_ver/POMO_CVRP/source/MODEL__Actor/grouped_actors.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"996db674de3ed7a6","mcp_get_code":{"code_sha256":"996db674de3ed7a6"}},{"arxiv_id":"openreview_vJsJPNRFIJ","paper":null,"title":"arXiv:openreview_vJsJPNRFIJ","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Regina921/PoMtVRS","path":"VRP100/models/CaDAmodel.py","file_url":"https://github.com/Regina921/PoMtVRS/blob/HEAD/VRP100/models/CaDAmodel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}},{"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/models.py","file_url":"https://github.com/lamda-bbo/ELG/blob/HEAD/CVRP/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"20d42bc12bb9a14d","mcp_get_code":{"code_sha256":"20d42bc12bb9a14d"}},{"arxiv_id":"aaai_30009","paper":null,"title":"arXiv:aaai_30009","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"henry-yeh/GLOP","path":"eval_atsp/ASHPPModel.py","file_url":"https://github.com/henry-yeh/GLOP/blob/HEAD/eval_atsp/ASHPPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459fe521069329c6","mcp_get_code":{"code_sha256":"459fe521069329c6"}}]}