{"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":"/task/combinatorial-optimization","name":"Combinatorial Optimization","slug":"combinatorial-optimization","description_markdown":"**Combinatorial Optimization** is a category of problems which requires optimizing a function over a combination of discrete objects and the solutions are constrained. Examples include finding shortest paths in a graph, maximizing value in the Knapsack problem and finding boolean settings that satisfy a set of constraints. Many of these problems are NP-Hard, which means that no polynomial time solution can be developed for them. Instead, we can only produce approximations in polynomial time that are guaranteed to be some factor worse than the true optimal solution.\n\n\n<span class=\"description-source\">Source: [Recent Advances in Neural Program Synthesis ](https://arxiv.org/abs/1802.02353)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1277,"papers_with_code":401,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/memetracker","name":"MemeTracker","full_name":"MemeTracker","num_papers_in_archive":39},{"url":"/dataset/cvrptw","name":"CVRPTW","full_name":"","num_papers_in_archive":7},{"url":"/dataset/distributional-miplib","name":"Distributional MIPLIB","full_name":"","num_papers_in_archive":3}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":13,"rows_per_page":100,"shown":100,"of":1277,"of_with_code":401,"tagged_in_all":1277,"counts":{"archive_papers_tagged":1277,"with_a_code_link":401,"where_syntology_ran_a_sample":122,"not_listed_spam_title":0,"listed":1277,"listed_where_code_ran":122,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":104,"every_run_a_failure_of_syntologys_instrument":18,"listed_with_a_run_with_no_instrument_failure":104,"listed_every_run_a_failure_of_syntologys_instrument":18,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/pointer-networks","slug":"pointer-networks","title":"Pointer Networks","date":"2015-06-09","arxiv_id":"1506.03134","repositories_listed":21,"syntology":{"n":23,"n_ran":18,"n_constructed":0,"n_ran_checked":13,"n_instrument":5,"n_unverified":5,"n_honours":3,"n_violates":1,"n_no_contract":9,"n_pointer_only":9,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 1 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/pointer-networks#ran","syntology_url":"https://syntology.ai/paper/1506.03134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.03134"}},"official":null}},{"url":"/paper/attention-learn-to-solve-routing-problems","slug":"attention-learn-to-solve-routing-problems","title":"Attention, Learn to Solve Routing Problems!","date":"2018-03-22","arxiv_id":"1803.08475","repositories_listed":15,"syntology":{"n":40,"n_ran":27,"n_constructed":0,"n_ran_checked":16,"n_instrument":11,"n_unverified":13,"n_honours":3,"n_violates":0,"n_no_contract":13,"n_pointer_only":5,"phrase":"27 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 3 honoured, 0 violated, 13 with no contract checked; 11 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/attention-learn-to-solve-routing-problems#ran","syntology_url":"https://syntology.ai/paper/1803.08475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08475"}},"official":{"repos":["wouterkool/attention-tsp","wouterkool/attention-learn-to-route"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-combinatorial-optimization-with","slug":"neural-combinatorial-optimization-with","title":"Neural Combinatorial Optimization with Reinforcement Learning","date":"2016-11-29","arxiv_id":"1611.09940","repositories_listed":10,"syntology":{"n":20,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":7,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/neural-combinatorial-optimization-with#ran","syntology_url":"https://syntology.ai/paper/1611.09940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.09940"}},"official":null}},{"url":"/paper/solving-the-rubiks-cube-without-human","slug":"solving-the-rubiks-cube-without-human","title":"Solving the Rubik's Cube Without Human Knowledge","date":"2018-05-18","arxiv_id":"1805.07470","repositories_listed":9,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-the-rubiks-cube-without-human#ran","syntology_url":"https://syntology.ai/paper/1805.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07470"}},"official":null}},{"url":"/paper/learning-combinatorial-optimization","slug":"learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","date":"2017-04-05","arxiv_id":"1704.01665","repositories_listed":8,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/1704.01665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01665"}},"official":{"repos":["Hanjun-Dai/graph_comb_opt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/an-example-of-evolutionary-computation-large","slug":"an-example-of-evolutionary-computation-large","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","date":"2024-01-04","arxiv_id":"2401.02051","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-example-of-evolutionary-computation-large#ran","syntology_url":"https://syntology.ai/paper/2401.02051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.02051"}},"official":{"repos":["feiliu36/eoh"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exact-combinatorial-optimization-with-graph","slug":"exact-combinatorial-optimization-with-graph","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks","date":"2019-06-04","arxiv_id":"1906.01629","repositories_listed":6,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/exact-combinatorial-optimization-with-graph#ran","syntology_url":"https://syntology.ai/paper/1906.01629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01629"}},"official":{"repos":["ds4dm/learn2branch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-with-combinatorial-optimization","slug":"learning-with-combinatorial-optimization","title":"Learning with Combinatorial Optimization Layers: a Probabilistic Approach","date":"2022-07-27","arxiv_id":"2207.13513","repositories_listed":5,"syntology":null},{"url":"/paper/collaborative-distillation-meta-learning-for","slug":"collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","arxiv_id":"2205.13225","repositories_listed":5,"syntology":{"n":23,"n_ran":16,"n_constructed":4,"n_ran_checked":9,"n_instrument":7,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"16 ran (of which 4 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/collaborative-distillation-meta-learning-for#ran","syntology_url":"https://syntology.ai/paper/2205.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13225"}},"official":{"repos":["kaist-silab/devformer","kaist-silab/dppbench"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":4,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-graph-matching-via-blackbox","slug":"deep-graph-matching-via-blackbox","title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","date":"2020-03-25","arxiv_id":"2003.11657","repositories_listed":5,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-graph-matching-via-blackbox#ran","syntology_url":"https://syntology.ai/paper/2003.11657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11657"}},"official":{"repos":["martius-lab/blackbox-deep-graph-matching"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/efficient-active-search-for-combinatorial","slug":"efficient-active-search-for-combinatorial","title":"Efficient Active Search for Combinatorial Optimization Problems","date":"2021-06-09","arxiv_id":"2106.05126","repositories_listed":4,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/efficient-active-search-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2106.05126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05126"}},"official":{"repos":["ahottung/EAS"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-reinforcement-learning-environment-for-job","slug":"a-reinforcement-learning-environment-for-job","title":"A Reinforcement Learning Environment For Job-Shop Scheduling","date":"2021-04-08","arxiv_id":"2104.03760","repositories_listed":4,"syntology":null},{"url":"/paper/learning-tsp-requires-rethinking","slug":"learning-tsp-requires-rethinking","title":"Learning the Travelling Salesperson Problem Requires Rethinking Generalization","date":"2020-06-12","arxiv_id":"2006.07054","repositories_listed":4,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-tsp-requires-rethinking#ran","syntology_url":"https://syntology.ai/paper/2006.07054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07054"}},"official":{"repos":["chaitjo/learning-tsp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/memory-augmented-policy-optimization-for","slug":"memory-augmented-policy-optimization-for","title":"Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing","date":"2018-07-06","arxiv_id":"1807.02322","repositories_listed":4,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/memory-augmented-policy-optimization-for#ran","syntology_url":"https://syntology.ai/paper/1807.02322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.02322"}},"official":{"repos":["crazydonkey200/neural-symbolic-machines"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-for-solving-the","slug":"reinforcement-learning-for-solving-the","title":"Reinforcement Learning for Solving the Vehicle Routing Problem","date":"2018-02-12","arxiv_id":"1802.04240","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-learning-for-solving-the#ran","syntology_url":"https://syntology.ai/paper/1802.04240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04240"}},"official":null}},{"url":"/paper/datasculpt-crafting-data-landscapes-for-llm","slug":"datasculpt-crafting-data-landscapes-for-llm","title":"DataSculpt: Crafting Data Landscapes for Long-Context LLMs through Multi-Objective Partitioning","date":"2024-09-02","arxiv_id":"2409.00997","repositories_listed":3,"syntology":null},{"url":"/paper/reevo-large-language-models-as-hyper","slug":"reevo-large-language-models-as-hyper","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","date":"2024-02-02","arxiv_id":"2402.01145","repositories_listed":3,"syntology":{"n":10,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/reevo-large-language-models-as-hyper#ran","syntology_url":"https://syntology.ai/paper/2402.01145","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01145"}},"official":{"repos":["ai4co/llm-as-hh"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/rl4co-an-extensive-reinforcement-learning-for","slug":"rl4co-an-extensive-reinforcement-learning-for","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","date":"2023-06-29","arxiv_id":"2306.17100","repositories_listed":3,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rl4co-an-extensive-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/2306.17100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17100"}},"official":{"repos":["ai4co/rl4co","pytorch/rl"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/combinatorial-optimization-with-physics","slug":"combinatorial-optimization-with-physics","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","date":"2021-07-02","arxiv_id":"2107.01188","repositories_listed":3,"syntology":null},{"url":"/paper/implicit-mle-backpropagating-through-discrete","slug":"implicit-mle-backpropagating-through-discrete","title":"Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions","date":"2021-06-03","arxiv_id":"2106.01798","repositories_listed":3,"syntology":{"n":10,"n_ran":7,"n_constructed":2,"n_ran_checked":2,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/implicit-mle-backpropagating-through-discrete#ran","syntology_url":"https://syntology.ai/paper/2106.01798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01798"}},"official":{"repos":["nec-research/tf-imle"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/pomo-policy-optimization-with-multiple-optima","slug":"pomo-policy-optimization-with-multiple-optima","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","date":"2020-10-30","arxiv_id":"2010.16011","repositories_listed":3,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/pomo-policy-optimization-with-multiple-optima#ran","syntology_url":"https://syntology.ai/paper/2010.16011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16011"}},"official":{"repos":["yd-kwon/POMO"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-deep-reinforcement-learning-algorithm-using","slug":"a-deep-reinforcement-learning-algorithm-using","title":"A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems","date":"2020-02-09","arxiv_id":"2002.03282","repositories_listed":3,"syntology":null},{"url":"/paper/xx-t-can-be-faster","slug":"xx-t-can-be-faster","title":"$XX^{t}$ Can Be Faster","date":"2025-05-14","arxiv_id":"2505.09814","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-solve-combinatorial-optimization-1","slug":"learning-to-solve-combinatorial-optimization-1","title":"Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks","date":"2024-09-06","arxiv_id":"2409.04495","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-solve-combinatorial-optimization-1#ran","syntology_url":"https://syntology.ai/paper/2409.04495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.04495"}},"official":{"repos":["thinklab-sjtu/nar-co-solver"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/parco-learning-parallel-autoregressive","slug":"parco-learning-parallel-autoregressive","title":"Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","date":"2024-09-05","arxiv_id":"2409.03811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/parco-learning-parallel-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2409.03811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.03811"}},"official":{"repos":["ai4co/parco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/udc-a-unified-neural-divide-and-conquer","slug":"udc-a-unified-neural-divide-and-conquer","title":"UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems","date":"2024-06-29","arxiv_id":"2407.00312","repositories_listed":2,"syntology":null},{"url":"/paper/joint-admission-control-and-resource","slug":"joint-admission-control-and-resource","title":"Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning","date":"2024-06-25","arxiv_id":"2406.17334","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/joint-admission-control-and-resource#ran","syntology_url":"https://syntology.ai/paper/2406.17334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17334"}},"official":{"repos":["geminilight/hrl-acra"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/distributional-miplib-a-multi-domain-library","slug":"distributional-miplib-a-multi-domain-library","title":"Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods","date":"2024-06-11","arxiv_id":"2406.06954","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/distributional-miplib-a-multi-domain-library#ran","syntology_url":"https://syntology.ai/paper/2406.06954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06954"}},"official":{"repos":["amf272/Distributional-MIPLIB-Generators"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tackling-prevalent-conditions-in-unsupervised","slug":"tackling-prevalent-conditions-in-unsupervised","title":"Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More","date":"2024-05-14","arxiv_id":"2405.08424","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tackling-prevalent-conditions-in-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2405.08424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08424"}},"official":{"repos":["ai4co/unsupervised-co-ucom2","bokveizen/unsupervised-CO-ucom2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mvmoe-multi-task-vehicle-routing-solver-with","slug":"mvmoe-multi-task-vehicle-routing-solver-with","title":"MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts","date":"2024-05-02","arxiv_id":"2405.01029","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mvmoe-multi-task-vehicle-routing-solver-with#ran","syntology_url":"https://syntology.ai/paper/2405.01029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01029"}},"official":{"repos":["ai4co/awesome-fm4co","royalskye/routing-mvmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ant-colony-sampling-with-gflownets-for","slug":"ant-colony-sampling-with-gflownets-for","title":"Ant Colony Sampling with GFlowNets for Combinatorial Optimization","date":"2024-03-11","arxiv_id":"2403.07041","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ant-colony-sampling-with-gflownets-for#ran","syntology_url":"https://syntology.ai/paper/2403.07041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07041"}},"official":{"repos":["ai4co/gfacs","henry-yeh/DeepACO"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/falcon-flop-aware-combinatorial-optimization","slug":"falcon-flop-aware-combinatorial-optimization","title":"FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning","date":"2024-03-11","arxiv_id":"2403.07094","repositories_listed":2,"syntology":null},{"url":"/paper/domain-independent-dynamic-programming-1","slug":"domain-independent-dynamic-programming-1","title":"Domain-Independent Dynamic Programming","date":"2024-01-25","arxiv_id":"2401.13883","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-joint-optimization-of-layer","slug":"efficient-joint-optimization-of-layer","title":"Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep Neural Networks","date":"2023-08-21","arxiv_id":"2308.10438","repositories_listed":2,"syntology":null},{"url":"/paper/data-driven-chance-constrained-multiple","slug":"data-driven-chance-constrained-multiple","title":"Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications","date":"2023-06-26","arxiv_id":"2306.14690","repositories_listed":2,"syntology":null},{"url":"/paper/faster-predict-and-optimize-with-three","slug":"faster-predict-and-optimize-with-three","title":"Differentiating Through Integer Linear Programs with Quadratic Regularization and Davis-Yin Splitting","date":"2023-01-31","arxiv_id":"2301.13395","repositories_listed":2,"syntology":null},{"url":"/paper/quantum-hypernetworks-training-binary-neural","slug":"quantum-hypernetworks-training-binary-neural","title":"Quantum HyperNetworks: Training Binary Neural Networks in Quantum Superposition","date":"2023-01-19","arxiv_id":"2301.08292","repositories_listed":2,"syntology":null},{"url":"/paper/bq-nco-bisimulation-quotienting-for-efficient-1","slug":"bq-nco-bisimulation-quotienting-for-efficient-1","title":"BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization","date":"2023-01-09","arxiv_id":"2301.03313","repositories_listed":2,"syntology":null},{"url":"/paper/equivariant-quantum-circuits-for-learning-on","slug":"equivariant-quantum-circuits-for-learning-on","title":"Equivariant quantum circuits for learning on weighted graphs","date":"2022-05-12","arxiv_id":"2205.06109","repositories_listed":2,"syntology":null},{"url":"/paper/the-machine-learning-for-combinatorial","slug":"the-machine-learning-for-combinatorial","title":"The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights","date":"2022-03-04","arxiv_id":"2203.02433","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-machine-learning-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2203.02433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02433"}},"official":{"repos":["ds4dm/ml4co-competition","megvii-research/neurips2021-ml4co-kida"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/active-learning-meets-optimized-item","slug":"active-learning-meets-optimized-item","title":"Active Learning Meets Optimized Item Selection","date":"2021-11-22","arxiv_id":"2112.03105","repositories_listed":2,"syntology":null},{"url":"/paper/symbolic-regression-via-neural-guided-genetic","slug":"symbolic-regression-via-neural-guided-genetic","title":"Symbolic Regression via Neural-Guided Genetic Programming Population Seeding","date":"2021-10-29","arxiv_id":"2111.00053","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/symbolic-regression-via-neural-guided-genetic#ran","syntology_url":"https://syntology.ai/paper/2111.00053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.00053"}},"official":{"repos":["brendenpetersen/deep-symbolic-optimization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/rationales-for-sequential-predictions","slug":"rationales-for-sequential-predictions","title":"Rationales for Sequential Predictions","date":"2021-09-14","arxiv_id":"2109.06387","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rationales-for-sequential-predictions#ran","syntology_url":"https://syntology.ai/paper/2109.06387","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06387"}},"official":{"repos":["keyonvafa/sequential-rationales"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/matrix-encoding-networks-for-neural","slug":"matrix-encoding-networks-for-neural","title":"Matrix Encoding Networks for Neural Combinatorial Optimization","date":"2021-06-21","arxiv_id":"2106.11113","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":1,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/matrix-encoding-networks-for-neural#ran","syntology_url":"https://syntology.ai/paper/2106.11113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11113"}},"official":{"repos":["yd-kwon/MatNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/combinatorial-optimization-for-panoptic","slug":"combinatorial-optimization-for-panoptic","title":"Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable Approach","date":"2021-06-06","arxiv_id":"2106.03188","repositories_listed":2,"syntology":null},{"url":"/paper/es-enas-combining-evolution-strategies-with","slug":"es-enas-combining-evolution-strategies-with","title":"ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search Spaces","date":"2021-01-19","arxiv_id":"2101.07415","repositories_listed":2,"syntology":null},{"url":"/paper/deep-reinforcement-learning-of-graph-matching","slug":"deep-reinforcement-learning-of-graph-matching","title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching","date":"2020-12-16","arxiv_id":"2012.08950","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-of-graph-matching#ran","syntology_url":"https://syntology.ai/paper/2012.08950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.08950"}},"official":{"repos":["thinklab-sjtu/rgm","Thinklab-SJTU/awesome-ml4co"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hybrid-genetic-search-for-the-cvrp-open","slug":"hybrid-genetic-search-for-the-cvrp-open","title":"Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood","date":"2020-11-23","arxiv_id":"2012.10384","repositories_listed":2,"syntology":null},{"url":"/paper/clipper-a-graph-theoretic-framework-for","slug":"clipper-a-graph-theoretic-framework-for","title":"CLIPPER: A Graph-Theoretic Framework for Robust Data Association","date":"2020-11-20","arxiv_id":"2011.10202","repositories_listed":2,"syntology":null},{"url":"/paper/ecole-a-gym-like-library-for-machine-learning","slug":"ecole-a-gym-like-library-for-machine-learning","title":"Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers","date":"2020-11-11","arxiv_id":"2011.06069","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ecole-a-gym-like-library-for-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2011.06069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06069"}},"official":{"repos":["ds4dm/ecole"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/discrete-solution-pools-and-noise-contrastive","slug":"discrete-solution-pools-and-noise-contrastive","title":"Contrastive Losses and Solution Caching for Predict-and-Optimize","date":"2020-11-10","arxiv_id":"2011.05354","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discrete-solution-pools-and-noise-contrastive#ran","syntology_url":"https://syntology.ai/paper/2011.05354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.05354"}},"official":{"repos":["CryoCardiogram/ijcai-cache-loss-pno"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-reinforcement-learning-approach-to-the","slug":"a-reinforcement-learning-approach-to-the","title":"A Reinforcement Learning Approach to the Orienteering Problem with Time Windows","date":"2020-11-07","arxiv_id":"2011.03647","repositories_listed":2,"syntology":null},{"url":"/paper/exploring-search-space-trees-using-an-adapted","slug":"exploring-search-space-trees-using-an-adapted","title":"Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems","date":"2020-10-22","arxiv_id":"2010.11523","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-boolean-function-learnability","slug":"understanding-boolean-function-learnability","title":"Understanding Boolean Function Learnability on Deep Neural Networks: PAC Learning Meets Neurosymbolic Models","date":"2020-09-13","arxiv_id":"2009.05908","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-immunization-for-improving","slug":"adversarial-immunization-for-improving","title":"Adversarial Immunization for Certifiable Robustness on Graphs","date":"2020-07-19","arxiv_id":"2007.09647","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-immunization-for-improving#ran","syntology_url":"https://syntology.ai/paper/2007.09647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09647"}},"official":{"repos":["TaoShuchang/AdvImmune"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/erdos-goes-neural-an-unsupervised-learning","slug":"erdos-goes-neural-an-unsupervised-learning","title":"Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs","date":"2020-06-18","arxiv_id":"2006.10643","repositories_listed":2,"syntology":null},{"url":"/paper/local-search-is-state-of-the-art-for-nas","slug":"local-search-is-state-of-the-art-for-nas","title":"Exploring the Loss Landscape in Neural Architecture Search","date":"2020-05-06","arxiv_id":"2005.02960","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/local-search-is-state-of-the-art-for-nas#ran","syntology_url":"https://syntology.ai/paper/2005.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02960"}},"official":{"repos":["naszilla/naszilla","realityengines/local_search"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-differentiable-search-for-mixed","slug":"rethinking-differentiable-search-for-mixed","title":"Rethinking Differentiable Search for Mixed-Precision Neural Networks","date":"2020-04-13","arxiv_id":"2004.05795","repositories_listed":2,"syntology":null},{"url":"/paper/learn-to-design-the-heuristics-for-vehicle","slug":"learn-to-design-the-heuristics-for-vehicle","title":"Learn to Design the Heuristics for Vehicle Routing Problem","date":"2020-02-20","arxiv_id":"2002.08539","repositories_listed":2,"syntology":null},{"url":"/paper/combinatorial-optimization-by-graph-pointer","slug":"combinatorial-optimization-by-graph-pointer","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","date":"2019-11-12","arxiv_id":"1911.04936","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combinatorial-optimization-by-graph-pointer#ran","syntology_url":"https://syntology.ai/paper/1911.04936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04936"}},"official":{"repos":["qiang-ma/graph-pointer-network"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/exploratory-combinatorial-optimization-with","slug":"exploratory-combinatorial-optimization-with","title":"Exploratory Combinatorial Optimization with Reinforcement Learning","date":"2019-09-09","arxiv_id":"1909.04063","repositories_listed":2,"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/exploratory-combinatorial-optimization-with#ran","syntology_url":"https://syntology.ai/paper/1909.04063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04063"}},"official":{"repos":["tomdbar/eco-dqn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/solving-np-hard-problems-on-graphs-by","slug":"solving-np-hard-problems-on-graphs-by","title":"Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero","date":"2019-05-28","arxiv_id":"1905.11623","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-np-hard-problems-on-graphs-by#ran","syntology_url":"https://syntology.ai/paper/1905.11623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11623"}},"official":null}},{"url":"/paper/model-vulnerability-to-distributional-shifts","slug":"model-vulnerability-to-distributional-shifts","title":"Addressing Model Vulnerability to Distributional Shifts over Image Transformation Sets","date":"2019-03-28","arxiv_id":"1903.11900","repositories_listed":2,"syntology":null},{"url":"/paper/learning-heuristics-over-large-graphs-via","slug":"learning-heuristics-over-large-graphs-via","title":"Learning Heuristics over Large Graphs via Deep Reinforcement Learning","date":"2019-03-08","arxiv_id":"1903.03332","repositories_listed":2,"syntology":null},{"url":"/paper/combinatorial-optimization-with-graph","slug":"combinatorial-optimization-with-graph","title":"Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search","date":"2018-10-25","arxiv_id":"1810.10659","repositories_listed":2,"syntology":null},{"url":"/paper/fast-graph-cut-based-optimization-for","slug":"fast-graph-cut-based-optimization-for","title":"Fast Graph-Cut Based Optimization for Practical Dense Deformable Registration of Volume Images","date":"2018-10-19","arxiv_id":"1810.08427","repositories_listed":2,"syntology":null},{"url":"/paper/ranked-reward-enabling-self-play","slug":"ranked-reward-enabling-self-play","title":"Ranked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization","date":"2018-07-04","arxiv_id":"1807.01672","repositories_listed":2,"syntology":null},{"url":"/paper/on-training-test-mis-alignment-in","slug":"on-training-test-mis-alignment-in","title":"On Training-Test (Mis)alignment in Unsupervised Combinatorial Optimization: Observation, Empirical Exploration, and Analysis","date":"2025-06-20","arxiv_id":"2506.16732","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-training-test-mis-alignment-in#ran","syntology_url":"https://syntology.ai/paper/2506.16732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.16732"}},"official":{"repos":["bokveizen/uco_derand"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/heuragenix-leveraging-llms-for-solving","slug":"heuragenix-leveraging-llms-for-solving","title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges","date":"2025-06-18","arxiv_id":"2506.15196","repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-job-shop-scheduling-problem-with-1","slug":"solving-the-job-shop-scheduling-problem-with-1","title":"Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment","date":"2025-06-10","arxiv_id":"2506.13781","repositories_listed":1,"syntology":null},{"url":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","slug":"heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","arxiv_id":"2506.07972","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted#ran","syntology_url":"https://syntology.ai/paper/2506.07972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07972"}},"official":{"repos":["cornell-zhang/heurigym"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/intelligent-channel-allocation-for-ieee-802","slug":"intelligent-channel-allocation-for-ieee-802","title":"Intelligent Channel Allocation for IEEE 802.11be Multi-Link Operation: When MAB Meets LLM","date":"2025-06-05","arxiv_id":"2506.04594","repositories_listed":1,"syntology":null},{"url":"/paper/latent-guided-sampling-for-combinatorial","slug":"latent-guided-sampling-for-combinatorial","title":"Latent Guided Sampling for Combinatorial Optimization","date":"2025-06-04","arxiv_id":"2506.03672","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/latent-guided-sampling-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2506.03672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03672"}},"official":{"repos":["SobihanSurendran/LGS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/demand-selection-for-vrp-with-emission-quota","slug":"demand-selection-for-vrp-with-emission-quota","title":"Demand Selection for VRP with Emission Quota","date":"2025-05-25","arxiv_id":"2505.19315","repositories_listed":1,"syntology":null},{"url":"/paper/structured-reinforcement-learning-for-1","slug":"structured-reinforcement-learning-for-1","title":"Structured Reinforcement Learning for Combinatorial Decision-Making","date":"2025-05-25","arxiv_id":"2505.19053","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-evaluation-of-contemporary-ml","slug":"a-comprehensive-evaluation-of-contemporary-ml","title":"A Comprehensive Evaluation of Contemporary ML-Based Solvers for Combinatorial Optimization","date":"2025-05-22","arxiv_id":"2505.16952","repositories_listed":1,"syntology":null},{"url":"/paper/graph-supported-dynamic-algorithm","slug":"graph-supported-dynamic-algorithm","title":"Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization","date":"2025-05-22","arxiv_id":"2505.16471","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/graph-supported-dynamic-algorithm#ran","syntology_url":"https://syntology.ai/paper/2505.16471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16471"}},"official":{"repos":["robbertreijnen/gs-modac"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-heuristics-generation-for-solving","slug":"efficient-heuristics-generation-for-solving","title":"Efficient Heuristics Generation for Solving Combinatorial Optimization Problems Using Large Language Models","date":"2025-05-19","arxiv_id":"2505.12627","repositories_listed":1,"syntology":null},{"url":"/paper/lagrange-oscillatory-neural-networks-for","slug":"lagrange-oscillatory-neural-networks-for","title":"Lagrange Oscillatory Neural Networks for Constraint Satisfaction and Optimization","date":"2025-05-12","arxiv_id":"2505.07179","repositories_listed":1,"syntology":null},{"url":"/paper/unraveling-the-rainbow-can-value-based","slug":"unraveling-the-rainbow-can-value-based","title":"Unraveling the Rainbow: can value-based methods schedule?","date":"2025-05-06","arxiv_id":"2505.03323","repositories_listed":1,"syntology":null},{"url":"/paper/entropy-guided-sampling-of-flat-modes-in","slug":"entropy-guided-sampling-of-flat-modes-in","title":"Entropy-Guided Sampling of Flat Modes in Discrete Spaces","date":"2025-05-05","arxiv_id":"2505.02296","repositories_listed":1,"syntology":null},{"url":"/paper/futureproof-static-memory-planning","slug":"futureproof-static-memory-planning","title":"Futureproof Static Memory Planning","date":"2025-04-07","arxiv_id":"2504.04874","repositories_listed":1,"syntology":null},{"url":"/paper/co-bench-benchmarking-language-model-agents","slug":"co-bench-benchmarking-language-model-agents","title":"CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization","date":"2025-04-06","arxiv_id":"2504.04310","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/co-bench-benchmarking-language-model-agents#ran","syntology_url":"https://syntology.ai/paper/2504.04310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.04310"}},"official":{"repos":["sunnweiwei/co-bench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-combinatorial-optimization-for-real","slug":"neural-combinatorial-optimization-for-real","title":"Neural Combinatorial Optimization for Real-World Routing","date":"2025-03-20","arxiv_id":"2503.16159","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-combinatorial-optimization-for-real#ran","syntology_url":"https://syntology.ai/paper/2503.16159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.16159"}},"official":{"repos":["ai4co/real-routing-nco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-based-heuristics-to","slug":"reinforcement-learning-based-heuristics-to","title":"Reinforcement Learning-based Heuristics to Guide Domain-Independent Dynamic Programming","date":"2025-03-20","arxiv_id":"2503.16371","repositories_listed":1,"syntology":null},{"url":"/paper/fusdreamer-label-efficient-remote-sensing","slug":"fusdreamer-label-efficient-remote-sensing","title":"FusDreamer: Label-efficient Remote Sensing World Model for Multimodal Data Classification","date":"2025-03-18","arxiv_id":"2503.13814","repositories_listed":1,"syntology":null},{"url":"/paper/reheated-gradient-based-discrete-sampling-for","slug":"reheated-gradient-based-discrete-sampling-for","title":"Reheated Gradient-based Discrete Sampling for Combinatorial Optimization","date":"2025-03-06","arxiv_id":"2503.04047","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-large-language-models-to-develop","slug":"leveraging-large-language-models-to-develop","title":"Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems","date":"2025-03-05","arxiv_id":"2503.03350","repositories_listed":1,"syntology":null},{"url":"/paper/starjob-dataset-for-llm-driven-job-shop","slug":"starjob-dataset-for-llm-driven-job-shop","title":"Starjob: Dataset for LLM-Driven Job Shop Scheduling","date":"2025-02-26","arxiv_id":"2503.01877","repositories_listed":1,"syntology":null},{"url":"/paper/destroy-and-repair-using-hyper-graphs-for","slug":"destroy-and-repair-using-hyper-graphs-for","title":"Destroy and Repair Using Hyper Graphs for Routing","date":"2025-02-22","arxiv_id":"2502.16170","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/destroy-and-repair-using-hyper-graphs-for#ran","syntology_url":"https://syntology.ai/paper/2502.16170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.16170"}},"official":{"repos":["ciam-group/drhg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deriving-representative-structure-from-music","slug":"deriving-representative-structure-from-music","title":"Synthesizing Composite Hierarchical Structure from Symbolic Music Corpora","date":"2025-02-21","arxiv_id":"2502.15849","repositories_listed":1,"syntology":null},{"url":"/paper/equivamap-leveraging-llms-for-automatic","slug":"equivamap-leveraging-llms-for-automatic","title":"EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization Formulations","date":"2025-02-20","arxiv_id":"2502.14760","repositories_listed":1,"syntology":null},{"url":"/paper/learning-guided-rolling-horizon-optimization","slug":"learning-guided-rolling-horizon-optimization","title":"Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling","date":"2025-02-18","arxiv_id":"2502.15791","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-guided-rolling-horizon-optimization#ran","syntology_url":"https://syntology.ai/paper/2502.15791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.15791"}},"official":{"repos":["mit-wu-lab/l-rho"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/navigating-demand-uncertainty-in-container","slug":"navigating-demand-uncertainty-in-container","title":"Navigating Demand Uncertainty in Container Shipping: Deep Reinforcement Learning for Enabling Adaptive and Feasible Master Stowage Planning","date":"2025-02-18","arxiv_id":"2502.12756","repositories_listed":1,"syntology":null},{"url":"/paper/blackout-difusco","slug":"blackout-difusco","title":"Blackout DIFUSCO","date":"2025-02-05","arxiv_id":"2502.05221","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-optimization-perspective-based","slug":"combinatorial-optimization-perspective-based","title":"Combinatorial Optimization Perspective based Framework for Multi-behavior Recommendation","date":"2025-02-04","arxiv_id":"2502.02232","repositories_listed":1,"syntology":null},{"url":"/paper/regularized-langevin-dynamics-for","slug":"regularized-langevin-dynamics-for","title":"Regularized Langevin Dynamics for Combinatorial Optimization","date":"2025-02-01","arxiv_id":"2502.00277","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/regularized-langevin-dynamics-for#ran","syntology_url":"https://syntology.ai/paper/2502.00277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00277"}},"official":{"repos":["shengyu-feng/rld4co"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/genetic-algorithm-with-border-trades-gab","slug":"genetic-algorithm-with-border-trades-gab","title":"Genetic Algorithm with Innovative Chromosome Patterns in the Breeding Process","date":"2025-01-30","arxiv_id":"2501.18184","repositories_listed":1,"syntology":null},{"url":"/paper/monte-carlo-tree-search-for-comprehensive","slug":"monte-carlo-tree-search-for-comprehensive","title":"Monte Carlo Tree Search for Comprehensive Exploration in LLM-Based Automatic Heuristic Design","date":"2025-01-15","arxiv_id":"2501.08603","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/monte-carlo-tree-search-for-comprehensive#ran","syntology_url":"https://syntology.ai/paper/2501.08603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08603"}},"official":{"repos":["zz1358m/mcts-ahd-master"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/self-adaptive-ising-machines-for-constrained","slug":"self-adaptive-ising-machines-for-constrained","title":"Self-Adaptive Ising Machines for Constrained Optimization","date":"2025-01-09","arxiv_id":"2501.04971","repositories_listed":1,"syntology":null}],"syntology_records":46,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_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_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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":122,"papers_where_code_ran_first_page":"/task/combinatorial-optimization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":13,"url":"/task/combinatorial-optimization/papers/2","json":"/task/combinatorial-optimization/papers/2.json","rows":100},{"order":"archive","page":3,"of":13,"url":"/task/combinatorial-optimization/papers/3","json":"/task/combinatorial-optimization/papers/3.json","rows":100},{"order":"archive","page":4,"of":13,"url":"/task/combinatorial-optimization/papers/4","json":"/task/combinatorial-optimization/papers/4.json","rows":100},{"order":"archive","page":5,"of":13,"url":"/task/combinatorial-optimization/papers/5","json":"/task/combinatorial-optimization/papers/5.json","rows":100},{"order":"archive","page":6,"of":13,"url":"/task/combinatorial-optimization/papers/6","json":"/task/combinatorial-optimization/papers/6.json","rows":100},{"order":"archive","page":7,"of":13,"url":"/task/combinatorial-optimization/papers/7","json":"/task/combinatorial-optimization/papers/7.json","rows":100},{"order":"archive","page":8,"of":13,"url":"/task/combinatorial-optimization/papers/8","json":"/task/combinatorial-optimization/papers/8.json","rows":100},{"order":"archive","page":9,"of":13,"url":"/task/combinatorial-optimization/papers/9","json":"/task/combinatorial-optimization/papers/9.json","rows":100},{"order":"archive","page":10,"of":13,"url":"/task/combinatorial-optimization/papers/10","json":"/task/combinatorial-optimization/papers/10.json","rows":100},{"order":"archive","page":11,"of":13,"url":"/task/combinatorial-optimization/papers/11","json":"/task/combinatorial-optimization/papers/11.json","rows":100},{"order":"archive","page":12,"of":13,"url":"/task/combinatorial-optimization/papers/12","json":"/task/combinatorial-optimization/papers/12.json","rows":100},{"order":"archive","page":13,"of":13,"url":"/task/combinatorial-optimization/papers/13","json":"/task/combinatorial-optimization/papers/13.json","rows":77},{"order":"ran","page":1,"of":2,"url":"/task/combinatorial-optimization/papers/ran/1","json":"/task/combinatorial-optimization/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/combinatorial-optimization/papers/ran/2","json":"/task/combinatorial-optimization/papers/ran/2.json","rows":22}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"c911113056bf1c628d71efde590027b5b4c4ff44dcbce7f105ee03e008d0b82c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}