{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/multi-head-attention","entry":"multi_head_attention","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":24,"n_papers_ran":20,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":14,"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":19,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":10,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":27,"n_places_pointer_only":11,"n_places_pointer_only_link_open":5,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":4,"ran":5,"unverified":4},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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":"wjalal/pomo_beam","path":"NEW_py_ver/CVRP/POMO/CVRPModel.py","file_url":"https://github.com/wjalal/pomo_beam/blob/HEAD/NEW_py_ver/CVRP/POMO/CVRPModel.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wjalal/pomo_beam when it was checked","code_sha256":"6dc103e776ff9eed","code_sha256_prefix":"6dc103e776ff9eed","mcp_get_code":{"code_sha256":"6dc103e776ff9eed"}},{"arxiv_id":"2604.16581","arxiv_id_is_arxiv":true,"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/attention_model.py","file_url":"https://github.com/CIAM-Group/NCO_code/blob/HEAD/single_objective/DPN-minmaxVRP-master/nets/attention_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e5f092766104b78","code_sha256_prefix":"1e5f092766104b78","mcp_get_code":{"code_sha256":"1e5f092766104b78"}},{"arxiv_id":"2603.07020","arxiv_id_is_arxiv":true,"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":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b7e5c1a003881c3","code_sha256_prefix":"4b7e5c1a003881c3","mcp_get_code":{"code_sha256":"4b7e5c1a003881c3"}},{"arxiv_id":"2603.06260","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-06260","title":"Learning to Solve Orienteering Problem with Time Windows and Variable Profits","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"SwonGao/DeCoST","path":"DeCoST/models/SINGLEModel.py","file_url":"https://github.com/SwonGao/DeCoST/blob/HEAD/DeCoST/models/SINGLEModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"144218ff791ec47b","code_sha256_prefix":"144218ff791ec47b","mcp_get_code":{"code_sha256":"144218ff791ec47b"}},{"arxiv_id":"2602.16012","arxiv_id_is_arxiv":true,"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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"657ae188fd7e1f14","code_sha256_prefix":"657ae188fd7e1f14","mcp_get_code":{"code_sha256":"657ae188fd7e1f14"}},{"arxiv_id":"2506.03672","arxiv_id_is_arxiv":true,"paper":"/paper/latent-guided-sampling-for-combinatorial","title":"Latent Guided Sampling for Combinatorial Optimization","date":"2025-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SobihanSurendran/LGS","path":"CVRP/model.py","file_url":"https://github.com/SobihanSurendran/LGS/blob/HEAD/CVRP/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SobihanSurendran/LGS when it was checked","code_sha256":"6dc103e776ff9eed","code_sha256_prefix":"6dc103e776ff9eed","mcp_get_code":{"code_sha256":"6dc103e776ff9eed"}},{"arxiv_id":"2506.02935","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1f7e3986000e37af","code_sha256_prefix":"1f7e3986000e37af","mcp_get_code":{"code_sha256":"1f7e3986000e37af"}},{"arxiv_id":"2505.13904","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"036b0dc86d34e889","code_sha256_prefix":"036b0dc86d34e889","mcp_get_code":{"code_sha256":"036b0dc86d34e889"}},{"arxiv_id":"2503.07580","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from SobihanSurendran/LGS, and GitHub detected no licence in that repository when it was checked","code_sha256":"6dc103e776ff9eed","code_sha256_prefix":"6dc103e776ff9eed","mcp_get_code":{"code_sha256":"6dc103e776ff9eed"}},{"arxiv_id":"2502.16170","arxiv_id_is_arxiv":true,"paper":"/paper/destroy-and-repair-using-hyper-graphs-for","title":"Destroy and Repair Using Hyper Graphs for Routing","date":"2025-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ciam-group/drhg","path":"TSP/TSPModel_DRHG.py","file_url":"https://github.com/ciam-group/drhg/blob/HEAD/TSP/TSPModel_DRHG.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ciam-group/drhg when it was checked","code_sha256":"ad3bd27f42d432bc","code_sha256_prefix":"ad3bd27f42d432bc","mcp_get_code":{"code_sha256":"ad3bd27f42d432bc"}},{"arxiv_id":"2410.09693","arxiv_id_is_arxiv":true,"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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13f7aec0cb34d440","code_sha256_prefix":"13f7aec0cb34d440","mcp_get_code":{"code_sha256":"13f7aec0cb34d440"}},{"arxiv_id":"2405.01029","arxiv_id_is_arxiv":true,"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":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"18442950d6cb3a1b","code_sha256_prefix":"18442950d6cb3a1b","mcp_get_code":{"code_sha256":"18442950d6cb3a1b"}},{"arxiv_id":"2402.16891","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from SobihanSurendran/LGS, and GitHub detected no licence in that repository when it was checked","code_sha256":"6dc103e776ff9eed","code_sha256_prefix":"6dc103e776ff9eed","mcp_get_code":{"code_sha256":"6dc103e776ff9eed"}},{"arxiv_id":"2402.01145","arxiv_id_is_arxiv":true,"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_pomo/CVRPModel.py","file_url":"https://github.com/ai4co/llm-as-hh/blob/HEAD/problems/cvrp_pomo/CVRPModel.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from SobihanSurendran/LGS, and GitHub detected no licence in that repository when it was checked","code_sha256":"6dc103e776ff9eed","code_sha256_prefix":"6dc103e776ff9eed","mcp_get_code":{"code_sha256":"6dc103e776ff9eed"}},{"arxiv_id":"2402.01145","arxiv_id_is_arxiv":true,"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":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"388642e538834053","code_sha256_prefix":"388642e538834053","mcp_get_code":{"code_sha256":"388642e538834053"}},{"arxiv_id":"2402.01145","arxiv_id_is_arxiv":true,"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/tsp_lehd/TSPModel.py","file_url":"https://github.com/ai4co/llm-as-hh/blob/HEAD/problems/tsp_lehd/TSPModel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ce72bef872610ae","code_sha256_prefix":"3ce72bef872610ae","mcp_get_code":{"code_sha256":"3ce72bef872610ae"}},{"arxiv_id":"2310.15195","arxiv_id_is_arxiv":true,"paper":"/paper/neural-multi-objective-combinatorial","title":"Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement","date":"2023-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bill-cjb/nhde","path":"NHDE-M/TSP/source/MODEL__Actor/grouped_actors.py","file_url":"https://github.com/bill-cjb/nhde/blob/HEAD/NHDE-M/TSP/source/MODEL__Actor/grouped_actors.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63b6c1a824b8f874","code_sha256_prefix":"63b6c1a824b8f874","mcp_get_code":{"code_sha256":"63b6c1a824b8f874"}},{"arxiv_id":"2308.14104","arxiv_id_is_arxiv":true,"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":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c64b244e2120dadc","code_sha256_prefix":"c64b244e2120dadc","mcp_get_code":{"code_sha256":"c64b244e2120dadc"}},{"arxiv_id":"2306.13643","arxiv_id_is_arxiv":true,"paper":"/paper/lightglue-local-feature-matching-at-light","title":"LightGlue: Local Feature Matching at Light Speed","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabio-sim/LightGlue-ONNX","path":"lightglue_dynamo/models/lightglue.py","file_url":"https://github.com/fabio-sim/LightGlue-ONNX/blob/HEAD/lightglue_dynamo/models/lightglue.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7350588d723a13e5","code_sha256_prefix":"7350588d723a13e5","mcp_get_code":{"code_sha256":"7350588d723a13e5"}},{"arxiv_id":"2306.02688","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaist-silab/meta-sage when it was checked","code_sha256":"c10e17f8940e2635","code_sha256_prefix":"c10e17f8940e2635","mcp_get_code":{"code_sha256":"c10e17f8940e2635"}},{"arxiv_id":"2305.19587","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from SobihanSurendran/LGS, and GitHub detected no licence in that repository when it was checked","code_sha256":"6dc103e776ff9eed","code_sha256_prefix":"6dc103e776ff9eed","mcp_get_code":{"code_sha256":"6dc103e776ff9eed"}},{"arxiv_id":"2304.09407","arxiv_id_is_arxiv":true,"paper":"/paper/pointerformer-deep-reinforced-multi-pointer","title":"Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem","date":"2023-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pointerformer/pointerformer","path":"models.py","file_url":"https://github.com/pointerformer/pointerformer/blob/HEAD/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pointerformer/pointerformer when it was checked","code_sha256":"c984330c9499b5d2","code_sha256_prefix":"c984330c9499b5d2","mcp_get_code":{"code_sha256":"c984330c9499b5d2"}},{"arxiv_id":"2205.13225","arxiv_id_is_arxiv":true,"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":"ai4co/reevo","path":"problems/cvrp_lehd/VRPModel.py","file_url":"https://github.com/ai4co/reevo/blob/HEAD/problems/cvrp_lehd/VRPModel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"388642e538834053","code_sha256_prefix":"388642e538834053","mcp_get_code":{"code_sha256":"388642e538834053"}},{"arxiv_id":"2202.07241","arxiv_id_is_arxiv":true,"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":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yd-kwon/POMO when it was checked","code_sha256":"0ccee30ad1e75edd","code_sha256_prefix":"0ccee30ad1e75edd","mcp_get_code":{"code_sha256":"0ccee30ad1e75edd"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maple728/transformer","path":"models/transformer.py","file_url":"https://github.com/Maple728/transformer/blob/HEAD/models/transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37c2f89ed7499010","code_sha256_prefix":"37c2f89ed7499010","mcp_get_code":{"code_sha256":"37c2f89ed7499010"}},{"arxiv_id":"openreview_vJsJPNRFIJ","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_vJsJPNRFIJ","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Regina921/PoMtVRS","path":"VRP100/models/MVMoEmodel.py","file_url":"https://github.com/Regina921/PoMtVRS/blob/HEAD/VRP100/models/MVMoEmodel.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from SobihanSurendran/LGS, and GitHub detected no licence in that repository when it was checked","code_sha256":"6dc103e776ff9eed","code_sha256_prefix":"6dc103e776ff9eed","mcp_get_code":{"code_sha256":"6dc103e776ff9eed"}},{"arxiv_id":"ijcai2024_0764","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id 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":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c64b244e2120dadc","code_sha256_prefix":"c64b244e2120dadc","mcp_get_code":{"code_sha256":"c64b244e2120dadc"}}],"record_sha256":"659c31c9f55b28df418e6529863ceaf673120937cc385aacedfb9451cd77021f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}