{"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/papers/ran/2","list_of":"/task/combinatorial-optimization","task":"Combinatorial Optimization","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,122],"of":122,"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":105,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":105,"listed_every_run_a_failure_of_syntologys_instrument":17,"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"},"first_page":"/task/combinatorial-optimization/papers/ran/1","prev":"/task/combinatorial-optimization/papers/ran/1","next":null,"papers":[{"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/curriculum-learning-for-multilevel-budgeted","slug":"curriculum-learning-for-multilevel-budgeted","title":"Curriculum learning for multilevel budgeted combinatorial problems","date":"2020-07-07","arxiv_id":"2007.03151","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/curriculum-learning-for-multilevel-budgeted#ran","syntology_url":"https://syntology.ai/paper/2007.03151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03151"}},"official":{"repos":["AdelNabli/MCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/belief-propagation-neural-networks","slug":"belief-propagation-neural-networks","title":"Belief Propagation Neural Networks","date":"2020-07-01","arxiv_id":"2007.00295","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/belief-propagation-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.00295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00295"}},"official":{"repos":["jkuck/bpnn"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"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/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/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/a-bayesian-algorithm-for-retrosynthesis","slug":"a-bayesian-algorithm-for-retrosynthesis","title":"A Bayesian algorithm for retrosynthesis","date":"2020-03-06","arxiv_id":"2003.03190","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-bayesian-algorithm-for-retrosynthesis#ran","syntology_url":"https://syntology.ai/paper/2003.03190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03190"}},"official":{"repos":["zguo235/bayesian_retro"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/incremental-sampling-without-replacement-for","slug":"incremental-sampling-without-replacement-for","title":"Incremental Sampling Without Replacement for Sequence Models","date":"2020-02-21","arxiv_id":"2002.09067","repositories_listed":1,"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":0,"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/incremental-sampling-without-replacement-for#ran","syntology_url":"https://syntology.ai/paper/2002.09067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09067"}},"official":{"repos":["google-research/unique-randomizer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/smart-predict-and-optimize-for-hard","slug":"smart-predict-and-optimize-for-hard","title":"Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems","date":"2019-11-22","arxiv_id":"1911.10092","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/smart-predict-and-optimize-for-hard#ran","syntology_url":"https://syntology.ai/paper/1911.10092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10092"}},"official":{"repos":["JayMan91/aaai_predit_then_optimize"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"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/open-the-boxes-of-words-incorporating-sememes","slug":"open-the-boxes-of-words-incorporating-sememes","title":"Word-level Textual Adversarial Attacking as Combinatorial Optimization","date":"2019-10-27","arxiv_id":"1910.12196","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/open-the-boxes-of-words-incorporating-sememes#ran","syntology_url":"https://syntology.ai/paper/1910.12196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12196"}},"official":{"repos":["thunlp/SememePSO-Attack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/scalable-robust-kidney-exchange","slug":"scalable-robust-kidney-exchange","title":"Scalable Robust Kidney Exchange","date":"2018-11-08","arxiv_id":"1811.03532","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/scalable-robust-kidney-exchange#ran","syntology_url":"https://syntology.ai/paper/1811.03532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03532"}},"official":{"repos":["duncanmcelfresh/RobustKidneyExchange"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-optimization-bounds-using-machine","slug":"improving-optimization-bounds-using-machine","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","date":"2018-09-10","arxiv_id":"1809.03359","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/improving-optimization-bounds-using-machine#ran","syntology_url":"https://syntology.ai/paper/1809.03359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03359"}},"official":{"repos":["qcappart/learning-DD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/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/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":20,"n_instrument":7,"n_unverified":13,"n_honours":3,"n_violates":0,"n_no_contract":17,"n_pointer_only":5,"phrase":"27 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 3 honoured, 0 violated, 17 with no contract checked; 7 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/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/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/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/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}}],"record_sha256":"376385d6ccf548039ad5aed4bbbbeca25606306fb6994a6bfc5bf452014e5d85","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}