{"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/cvrpmodel","entry":"CVRPModel","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":5,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"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":0,"ran":0,"unverified":5},"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":"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":"d4d4b5a5c19abb2f","code_sha256_prefix":"d4d4b5a5c19abb2f","mcp_get_code":{"code_sha256":"d4d4b5a5c19abb2f"}},{"arxiv_id":"2207.06190","arxiv_id_is_arxiv":true,"paper":"/paper/simulation-guided-beam-search-for-neural","title":"Simulation-guided Beam Search for Neural Combinatorial Optimization","date":"2022-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yd-kwon/sgbs","path":"CVRP/2_SGBS/CVRPModel.py","file_url":"https://github.com/yd-kwon/sgbs/blob/HEAD/CVRP/2_SGBS/CVRPModel.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":"8f53dbf4d4654d32","code_sha256_prefix":"8f53dbf4d4654d32","mcp_get_code":{"code_sha256":"8f53dbf4d4654d32"}},{"arxiv_id":"2205.13209","arxiv_id_is_arxiv":true,"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":"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, alstn12088/sym-nco when it was checked","code_sha256":"d0b0edc8aec44b45","code_sha256_prefix":"d0b0edc8aec44b45","mcp_get_code":{"code_sha256":"d0b0edc8aec44b45"}},{"arxiv_id":"2203.15386","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4fe8b662378920b0","code_sha256_prefix":"4fe8b662378920b0","mcp_get_code":{"code_sha256":"4fe8b662378920b0"}},{"arxiv_id":"2010.16011","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaist-silab/symmetric_replay when it was checked","code_sha256":"25808ce4b5d5bf84","code_sha256_prefix":"25808ce4b5d5bf84","mcp_get_code":{"code_sha256":"25808ce4b5d5bf84"}}],"record_sha256":"559861e9e43ab2247a57c6762b10eb993b1df23a50e382549aaabc60805b43e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}