{"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/heuristic-search/papers/ran/1","list_of":"/task/heuristic-search","task":"Heuristic Search","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":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,15],"of":15,"counts":{"archive_papers_tagged":261,"with_a_code_link":76,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":261,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/heuristic-search/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/sql-o1-a-self-reward-heuristic-dynamic-search","slug":"sql-o1-a-self-reward-heuristic-dynamic-search","title":"SQL-o1: A Self-Reward Heuristic Dynamic Search Method for Text-to-SQL","date":"2025-02-17","arxiv_id":"2502.11741","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sql-o1-a-self-reward-heuristic-dynamic-search#ran","syntology_url":"https://syntology.ai/paper/2502.11741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.11741"}},"official":{"repos":["shuailyu0110/sql-o1"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kbqa-o1-agentic-knowledge-base-question","slug":"kbqa-o1-agentic-knowledge-base-question","title":"KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search","date":"2025-01-31","arxiv_id":"2501.18922","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 6 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/kbqa-o1-agentic-knowledge-base-question#ran","syntology_url":"https://syntology.ai/paper/2501.18922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18922"}},"official":{"repos":["lhrlab/kbqa-o1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/hsevo-elevating-automatic-heuristic-design","slug":"hsevo-elevating-automatic-heuristic-design","title":"HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs","date":"2024-12-19","arxiv_id":"2412.14995","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hsevo-elevating-automatic-heuristic-design#ran","syntology_url":"https://syntology.ai/paper/2412.14995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.14995"}},"official":{"repos":["datphamvn/hsevo"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sam2long-enhancing-sam-2-for-long-video","slug":"sam2long-enhancing-sam-2-for-long-video","title":"SAM2Long: Enhancing SAM 2 for Long Video Segmentation with a Training-Free Memory Tree","date":"2024-10-21","arxiv_id":"2410.16268","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sam2long-enhancing-sam-2-for-long-video#ran","syntology_url":"https://syntology.ai/paper/2410.16268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16268"}},"official":{"repos":["mark12ding/sam2long"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/llm-a-large-language-model-enhanced","slug":"llm-a-large-language-model-enhanced","title":"LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning","date":"2024-06-20","arxiv_id":"2407.02511","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/llm-a-large-language-model-enhanced#ran","syntology_url":"https://syntology.ai/paper/2407.02511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02511"}},"official":{"repos":["SilinMeng0510/llm-astar"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/blockpruner-fine-grained-pruning-for-large","slug":"blockpruner-fine-grained-pruning-for-large","title":"BlockPruner: Fine-grained Pruning for Large Language Models","date":"2024-06-15","arxiv_id":"2406.10594","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":12,"phrase":"9 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/blockpruner-fine-grained-pruning-for-large#ran","syntology_url":"https://syntology.ai/paper/2406.10594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10594"}},"official":{"repos":["MrGGLS/BlockPruner"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dager-exact-gradient-inversion-for-large","slug":"dager-exact-gradient-inversion-for-large","title":"DAGER: Exact Gradient Inversion for Large Language Models","date":"2024-05-24","arxiv_id":"2405.15586","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/dager-exact-gradient-inversion-for-large#ran","syntology_url":"https://syntology.ai/paper/2405.15586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15586"}},"official":{"repos":["insait-institute/dager-gradient-inversion"],"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/chemreasoner-heuristic-search-over-a-large","slug":"chemreasoner-heuristic-search-over-a-large","title":"ChemReasoner: Heuristic Search over a Large Language Model's Knowledge Space using Quantum-Chemical Feedback","date":"2024-02-15","arxiv_id":"2402.10980","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/chemreasoner-heuristic-search-over-a-large#ran","syntology_url":"https://syntology.ai/paper/2402.10980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10980"}},"official":{"repos":["pnnl/chemreasoner"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-generative-symbolic-regression","slug":"deep-generative-symbolic-regression","title":"Deep Generative Symbolic Regression","date":"2023-12-30","arxiv_id":"2401.00282","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/deep-generative-symbolic-regression#ran","syntology_url":"https://syntology.ai/paper/2401.00282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00282"}},"official":{"repos":["samholt/deepgenerativesymbolicregression","vanderschaarlab/deepgenerativesymbolicregression"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/retrobridge-modeling-retrosynthesis-with","slug":"retrobridge-modeling-retrosynthesis-with","title":"RetroBridge: Modeling Retrosynthesis with Markov Bridges","date":"2023-08-30","arxiv_id":"2308.16212","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 2 unverified","sample_list":"/paper/retrobridge-modeling-retrosynthesis-with#ran","syntology_url":"https://syntology.ai/paper/2308.16212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16212"}},"official":{"repos":["igashov/retrobridge"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-optimization-over-permutation-spaces","slug":"bayesian-optimization-over-permutation-spaces","title":"Bayesian Optimization over Permutation Spaces","date":"2021-12-02","arxiv_id":"2112.01049","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/bayesian-optimization-over-permutation-spaces#ran","syntology_url":"https://syntology.ai/paper/2112.01049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.01049"}},"official":{"repos":["aryandeshwal/bops"],"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/policy-guided-heuristic-search-with","slug":"policy-guided-heuristic-search-with","title":"Policy-Guided Heuristic Search with Guarantees","date":"2021-03-21","arxiv_id":"2103.11505","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 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) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/policy-guided-heuristic-search-with#ran","syntology_url":"https://syntology.ai/paper/2103.11505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11505"}},"official":{"repos":["levilelis/h-levin"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/counterfactual-explanation-algorithms-for","slug":"counterfactual-explanation-algorithms-for","title":"Counterfactual Explanation Algorithms for Behavioral and Textual Data","date":"2019-12-04","arxiv_id":"1912.01819","repositories_listed":3,"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/counterfactual-explanation-algorithms-for#ran","syntology_url":"https://syntology.ai/paper/1912.01819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.01819"}},"official":{"repos":["yramon/LimeCounterfactual"],"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":["named_in_paper"]}}},{"url":"/paper/asnets-deep-learning-for-generalised-planning","slug":"asnets-deep-learning-for-generalised-planning","title":"ASNets: Deep Learning for Generalised Planning","date":"2019-08-04","arxiv_id":"1908.01362","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"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) · 6 unverified","sample_list":"/paper/asnets-deep-learning-for-generalised-planning#ran","syntology_url":"https://syntology.ai/paper/1908.01362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.01362"}},"official":{"repos":["qxcv/asnets"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/deeptype-multilingual-entity-linking-by","slug":"deeptype-multilingual-entity-linking-by","title":"DeepType: Multilingual Entity Linking by Neural Type System Evolution","date":"2018-02-03","arxiv_id":"1802.01021","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deeptype-multilingual-entity-linking-by#ran","syntology_url":"https://syntology.ai/paper/1802.01021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.01021"}},"official":{"repos":["openai/deeptype"],"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"]}}}],"record_sha256":"56f7a0a2de5f926d0ac5a1b50500e7ad5d4e2dd6bb5eb839c98a83a33cd874ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}