{"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/augment-xy-data-by-8-fold","entry":"augment_xy_data_by_8_fold","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":5,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":0,"ran_fixture":2,"ran":1,"unverified":0},"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/CVRProblemDef.py","file_url":"https://github.com/wjalal/pomo_beam/blob/HEAD/NEW_py_ver/CVRP/POMO/CVRProblemDef.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"445c20b7977e2393","code_sha256_prefix":"445c20b7977e2393","mcp_get_code":{"code_sha256":"445c20b7977e2393"}},{"arxiv_id":"2509.23413","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-23413","title":"URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"CIAM-Group/URS","path":"problem/ProblemDef.py","file_url":"https://github.com/CIAM-Group/URS/blob/HEAD/problem/ProblemDef.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, CIAM-Group/URS, is not in the permissive set Syntology serves inline","code_sha256":"ae7acd105c3e55ab","code_sha256_prefix":"ae7acd105c3e55ab","mcp_get_code":{"code_sha256":"ae7acd105c3e55ab"}},{"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/VRProblemDef.py","file_url":"https://github.com/feiliu36/mtnco/blob/HEAD/MTPOMO/VRProblemDef.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"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 wjalal/pomo_beam, and GitHub detected no licence in that repository when it was checked","code_sha256":"445c20b7977e2393","code_sha256_prefix":"445c20b7977e2393","mcp_get_code":{"code_sha256":"445c20b7977e2393"}},{"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/utils.py","file_url":"https://github.com/gaocrr/elg/blob/HEAD/CVRP/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae7acd105c3e55ab","code_sha256_prefix":"ae7acd105c3e55ab","mcp_get_code":{"code_sha256":"ae7acd105c3e55ab"}},{"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/CVRPTrainer_meta.py","file_url":"https://github.com/royalskye/omni-vrp/blob/HEAD/POMO/CVRP/CVRPTrainer_meta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae7acd105c3e55ab","code_sha256_prefix":"ae7acd105c3e55ab","mcp_get_code":{"code_sha256":"ae7acd105c3e55ab"}},{"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":"EAS/source/utilities.py","file_url":"https://github.com/RoyalSkye/Omni-VRP/blob/HEAD/EAS/source/utilities.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a36b58e1d6f73f99","code_sha256_prefix":"a36b58e1d6f73f99","mcp_get_code":{"code_sha256":"a36b58e1d6f73f99"}},{"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/utils.py","file_url":"https://github.com/lamda-bbo/ELG/blob/HEAD/CVRP/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae7acd105c3e55ab","code_sha256_prefix":"ae7acd105c3e55ab","mcp_get_code":{"code_sha256":"ae7acd105c3e55ab"}}],"record_sha256":"d5a9367e95e31493de24ee38448750c2a85f0ece3f64493e09d6faa7e1f3168b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}