{"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","name":"Heuristic Search","slug":"heuristic-search","description_markdown":"Heuristic Search is a problem-solving method that uses practical rules or \"guides\" (heuristics) to find solutions more quickly than exhaustive search, by focusing on the most promising paths first.","categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":261,"papers_with_code":76,"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":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/objectgoal-navigation","name":"ObjectGoal Navigation"}],"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":3,"rows_per_page":100,"shown":100,"of":261,"of_with_code":76,"tagged_in_all":261,"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"},"items":[{"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/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/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/generalized-planning-as-heuristic-search-a","slug":"generalized-planning-as-heuristic-search-a","title":"Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects","date":"2023-01-26","arxiv_id":"2301.11087","repositories_listed":2,"syntology":null},{"url":"/paper/ultrafast-learning-of-4-node-hybridization","slug":"ultrafast-learning-of-4-node-hybridization","title":"Ultrafast learning of 4-node hybridization cycles in phylogenetic networks using algebraic invariants","date":"2022-11-30","arxiv_id":"2211.16647","repositories_listed":2,"syntology":null},{"url":"/paper/fanoos-multi-resolution-multi-strength","slug":"fanoos-multi-resolution-multi-strength","title":"Fanoos: Multi-Resolution, Multi-Strength, Interactive Explanations for Learned Systems","date":"2020-06-22","arxiv_id":"2006.12453","repositories_listed":2,"syntology":null},{"url":"/paper/gan-path-finder-preliminary-results","slug":"gan-path-finder-preliminary-results","title":"GAN Path Finder: Preliminary results","date":"2019-08-05","arxiv_id":"1908.01499","repositories_listed":2,"syntology":null},{"url":"/paper/hybrid-planning-for-dynamic-multimodal","slug":"hybrid-planning-for-dynamic-multimodal","title":"Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths","date":"2019-06-21","arxiv_id":"1906.09094","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-on-mathematical-reasoning-and","slug":"a-survey-on-mathematical-reasoning-and","title":"A Survey on Mathematical Reasoning and Optimization with Large Language Models","date":"2025-03-22","arxiv_id":"2503.17726","repositories_listed":1,"syntology":null},{"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/on-parallel-external-memory-bidirectional","slug":"on-parallel-external-memory-bidirectional","title":"On Parallel External-Memory Bidirectional Search","date":"2024-12-30","arxiv_id":"2412.21104","repositories_listed":1,"syntology":null},{"url":"/paper/llm-virus-evolutionary-jailbreak-attack-on","slug":"llm-virus-evolutionary-jailbreak-attack-on","title":"LLM-Virus: Evolutionary Jailbreak Attack on Large Language Models","date":"2024-12-28","arxiv_id":"2501.00055","repositories_listed":1,"syntology":null},{"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":7,"n_instrument":1,"n_unverified":1,"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) · 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":7,"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":3,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 4 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":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-discrete-world-models-for-heuristic","slug":"learning-discrete-world-models-for-heuristic","title":"Learning Discrete World Models for Heuristic Search","date":"2024-09-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pogema-a-benchmark-platform-for-cooperative","slug":"pogema-a-benchmark-platform-for-cooperative","title":"POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding","date":"2024-07-20","arxiv_id":"2407.14931","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-local-search-for-a-multi-objective","slug":"pareto-local-search-for-a-multi-objective","title":"Pareto local search for a multi-objective demand response problem in residential areas with heat pumps and electric vehicles","date":"2024-07-16","arxiv_id":"2407.11719","repositories_listed":1,"syntology":null},{"url":"/paper/a-training-data-recipe-to-accelerate-a-search","slug":"a-training-data-recipe-to-accelerate-a-search","title":"A Training Data Recipe to Accelerate A* Search with Language Models","date":"2024-07-13","arxiv_id":"2407.09985","repositories_listed":1,"syntology":null},{"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":3,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 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":5,"n_instrument":4,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 4 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":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/slope-search-with-learned-optimal-pruning","slug":"slope-search-with-learned-optimal-pruning","title":"SLOPE: Search with Learned Optimal Pruning-based Expansion","date":"2024-06-07","arxiv_id":"2406.04935","repositories_listed":1,"syntology":null},{"url":"/paper/sound-heuristic-search-value-iteration-for","slug":"sound-heuristic-search-value-iteration-for","title":"Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability Objectives","date":"2024-06-05","arxiv_id":"2406.02871","repositories_listed":1,"syntology":null},{"url":"/paper/using-constraints-to-discover-sparse-and","slug":"using-constraints-to-discover-sparse-and","title":"Using Constraints to Discover Sparse and Alternative Subgroup Descriptions","date":"2024-06-03","arxiv_id":"2406.01411","repositories_listed":1,"syntology":null},{"url":"/paper/crafting-a-pogo-stick-in-minecraft-with","slug":"crafting-a-pogo-stick-in-minecraft-with","title":"Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract)","date":"2024-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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":5,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 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":5,"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/act-as-you-learn-adaptive-decision-making-in","slug":"act-as-you-learn-adaptive-decision-making-in","title":"Act as You Learn: Adaptive Decision-Making in Non-Stationary Markov Decision Processes","date":"2024-01-03","arxiv_id":"2401.01841","repositories_listed":1,"syntology":null},{"url":"/paper/towards-efficient-verification-of-quantized","slug":"towards-efficient-verification-of-quantized","title":"Towards Efficient Verification of Quantized Neural Networks","date":"2023-12-20","arxiv_id":"2312.12679","repositories_listed":1,"syntology":null},{"url":"/paper/rectangle-search-an-anytime-beam-search","slug":"rectangle-search-an-anytime-beam-search","title":"Rectangle Search: An Anytime Beam Search (Extended Version)","date":"2023-12-19","arxiv_id":"2312.12554","repositories_listed":1,"syntology":null},{"url":"/paper/cylindertag-an-accurate-and-flexible-marker","slug":"cylindertag-an-accurate-and-flexible-marker","title":"CylinderTag: An Accurate and Flexible Marker for Cylinder-Shape Objects Pose Estimation Based on Projective Invariants","date":"2023-10-20","arxiv_id":"2310.13320","repositories_listed":1,"syntology":null},{"url":"/paper/learn-to-follow-decentralized-lifelong-multi","slug":"learn-to-follow-decentralized-lifelong-multi","title":"Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learning","date":"2023-10-02","arxiv_id":"2310.01207","repositories_listed":1,"syntology":null},{"url":"/paper/a-more-general-theory-of-diagnosis-from-first","slug":"a-more-general-theory-of-diagnosis-from-first","title":"A More General Theory of Diagnosis from First Principles","date":"2023-09-28","arxiv_id":"2309.16180","repositories_listed":1,"syntology":null},{"url":"/paper/an-energy-aware-approach-to-design-self","slug":"an-energy-aware-approach-to-design-self","title":"An Energy-Aware Approach to Design Self-Adaptive AI-based Applications on the Edge","date":"2023-08-31","arxiv_id":"2309.00022","repositories_listed":1,"syntology":null},{"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":4,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 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":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/finding-optimal-diverse-feature-sets-with","slug":"finding-optimal-diverse-feature-sets-with","title":"Finding Optimal Diverse Feature Sets with Alternative Feature Selection","date":"2023-07-21","arxiv_id":"2307.11607","repositories_listed":1,"syntology":null},{"url":"/paper/generic-and-robust-root-cause-localization","slug":"generic-and-robust-root-cause-localization","title":"Generic and Robust Root Cause Localization for Multi-Dimensional Data in Online Service Systems","date":"2023-05-05","arxiv_id":"2305.03331","repositories_listed":1,"syntology":null},{"url":"/paper/combining-monte-carlo-tree-search-and","slug":"combining-monte-carlo-tree-search-and","title":"Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring","date":"2023-04-24","arxiv_id":"2304.12146","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-point-based-algorithm-for-multi-agent","slug":"a-novel-point-based-algorithm-for-multi-agent","title":"A Novel Point-based Algorithm for Multi-agent Control Using the Common Information Approach","date":"2023-04-10","arxiv_id":"2304.04346","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-of-topology-aware-job-allocation","slug":"optimization-of-topology-aware-job-allocation","title":"Optimization of Topology-Aware Job Allocation on a High-Performance Computing Cluster by Neural Simulated Annealing","date":"2023-02-06","arxiv_id":"2302.03517","repositories_listed":1,"syntology":null},{"url":"/paper/transpath-learning-heuristics-for-grid-based","slug":"transpath-learning-heuristics-for-grid-based","title":"TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers","date":"2022-12-22","arxiv_id":"2212.11730","repositories_listed":1,"syntology":null},{"url":"/paper/shielding-in-resource-constrained-goal-pomdps","slug":"shielding-in-resource-constrained-goal-pomdps","title":"Shielding in Resource-Constrained Goal POMDPs","date":"2022-11-28","arxiv_id":"2211.15349","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-sample-generation-strategies","slug":"understanding-sample-generation-strategies","title":"Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning","date":"2022-11-23","arxiv_id":"2211.13316","repositories_listed":1,"syntology":null},{"url":"/paper/aerial-view-goal-localization-with","slug":"aerial-view-goal-localization-with","title":"Aerial View Localization with Reinforcement Learning: Towards Emulating Search-and-Rescue","date":"2022-09-08","arxiv_id":"2209.03694","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/aerial-view-goal-localization-with#ran","syntology_url":"https://syntology.ai/paper/2209.03694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.03694"}},"official":{"repos":["aleksispi/airloc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/the-un-scalability-of-heuristic-approximators","slug":"the-un-scalability-of-heuristic-approximators","title":"The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems","date":"2022-09-07","arxiv_id":"2209.03393","repositories_listed":1,"syntology":null},{"url":"/paper/syntax-controlled-knowledge-graph-to-text","slug":"syntax-controlled-knowledge-graph-to-text","title":"Syntax Controlled Knowledge Graph-to-Text Generation with Order and Semantic Consistency","date":"2022-07-02","arxiv_id":"2207.00719","repositories_listed":1,"syntology":null},{"url":"/paper/representation-and-synthesis-of-c-programs","slug":"representation-and-synthesis-of-c-programs","title":"Representation and Synthesis of C++ Programs for Generalized Planning","date":"2022-06-29","arxiv_id":"2206.14480","repositories_listed":1,"syntology":null},{"url":"/paper/factored-world-models-for-zero-shot-1","slug":"factored-world-models-for-zero-shot-1","title":"Factored World Models for Zero-Shot Generalization in Robotic Manipulation","date":"2022-02-10","arxiv_id":"2202.05333","repositories_listed":1,"syntology":null},{"url":"/paper/quantune-post-training-quantization-of","slug":"quantune-post-training-quantization-of","title":"Quantune: Post-training Quantization of Convolutional Neural Networks using Extreme Gradient Boosting for Fast Deployment","date":"2022-02-10","arxiv_id":"2202.05048","repositories_listed":1,"syntology":null},{"url":"/paper/flipping-the-switch-on-local-exploration","slug":"flipping-the-switch-on-local-exploration","title":"Flipping the switch on local exploration: Genetic Algorithms with Reversals","date":"2022-02-02","arxiv_id":"2202.00912","repositories_listed":1,"syntology":null},{"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/amra-anytime-multi-resolution-multi-heuristic","slug":"amra-anytime-multi-resolution-multi-heuristic","title":"AMRA*: Anytime Multi-Resolution Multi-Heuristic A*","date":"2021-10-11","arxiv_id":"2110.05328","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-downselection-a-python","slug":"similarity-downselection-a-python","title":"Similarity Downselection: A Python implementation of a heuristic search algorithm for finding the set of the n most dissimilar items with an application in conformer sampling","date":"2021-05-06","arxiv_id":"2105.02991","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-model-exploration-for-tumor","slug":"parallel-model-exploration-for-tumor","title":"Parallel Model Exploration for Tumor Treatment Simulations","date":"2021-03-25","arxiv_id":"2103.14132","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-based-equational-inference-in","slug":"similarity-based-equational-inference-in","title":"Similarity-Based Equational Inference in Physics","date":"2021-03-24","arxiv_id":"2103.13496","repositories_listed":1,"syntology":null},{"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/s-a-heuristic-information-based-approximation","slug":"s-a-heuristic-information-based-approximation","title":"S$^*$: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding","date":"2021-03-15","arxiv_id":"2103.08155","repositories_listed":1,"syntology":null},{"url":"/paper/fast-threshold-optimization-for-multi-label","slug":"fast-threshold-optimization-for-multi-label","title":"Fast threshold optimization for multi-label audio tagging using Surrogate gradient learning","date":"2021-03-01","arxiv_id":"2103.00833","repositories_listed":1,"syntology":null},{"url":"/paper/towards-optimally-efficient-tree-search-with","slug":"towards-optimally-efficient-tree-search-with","title":"Towards Optimally Efficient Search with Deep Learning for Large-Scale MIMO Systems","date":"2021-01-07","arxiv_id":"2101.02420","repositories_listed":1,"syntology":null},{"url":"/paper/deliberative-and-conceptual-inference-in","slug":"deliberative-and-conceptual-inference-in","title":"Deliberative and Conceptual Inference in Service Robots","date":"2020-12-13","arxiv_id":"2012.07121","repositories_listed":1,"syntology":null},{"url":"/paper/heuristic-domain-adaptation-1","slug":"heuristic-domain-adaptation-1","title":"Heuristic Domain Adaptation","date":"2020-11-30","arxiv_id":"2011.14540","repositories_listed":1,"syntology":null},{"url":"/paper/optimistic-variants-of-single-objective","slug":"optimistic-variants-of-single-objective","title":"Optimistic variants of single-objective bilevel optimization for evolutionary algorithms","date":"2020-08-22","arxiv_id":"2008.09926","repositories_listed":1,"syntology":null},{"url":"/paper/learning-heuristic-selection-with-dynamic","slug":"learning-heuristic-selection-with-dynamic","title":"Learning Heuristic Selection with Dynamic Algorithm Configuration","date":"2020-06-15","arxiv_id":"2006.08246","repositories_listed":1,"syntology":null},{"url":"/paper/arms-automated-rules-management-system-for","slug":"arms-automated-rules-management-system-for","title":"ARMS: Automated rules management system for fraud detection","date":"2020-02-14","arxiv_id":"2002.06075","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-reliable-correlations-in","slug":"discovering-reliable-correlations-in","title":"Discovering Reliable Correlations in Categorical Data","date":"2019-08-30","arxiv_id":"1908.11682","repositories_listed":1,"syntology":null},{"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/heuristic-authorship-obfuscation","slug":"heuristic-authorship-obfuscation","title":"Heuristic Authorship Obfuscation","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/optimal-decision-making-under-strategic","slug":"optimal-decision-making-under-strategic","title":"Optimal Decision Making Under Strategic Behavior","date":"2019-05-22","arxiv_id":"1905.09239","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-variation-operators-for","slug":"semantic-variation-operators-for","title":"Semantic variation operators for multidimensional genetic programming","date":"2019-04-18","arxiv_id":"1904.08577","repositories_listed":1,"syntology":null},{"url":"/paper/learning-loop-invariants-for-program","slug":"learning-loop-invariants-for-program","title":"Learning Loop Invariants for Program Verification","date":"2018-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/single-agent-policy-tree-search-with","slug":"single-agent-policy-tree-search-with","title":"Single-Agent Policy Tree Search With Guarantees","date":"2018-11-27","arxiv_id":"1811.10928","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-reliable-dependencies-from-data","slug":"discovering-reliable-dependencies-from-data","title":"Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms","date":"2018-09-14","arxiv_id":"1809.05467","repositories_listed":1,"syntology":null},{"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"]}}},{"url":"/paper/evolving-deep-convolutional-neural-networks","slug":"evolving-deep-convolutional-neural-networks","title":"Evolving Deep Convolutional Neural Networks for Image Classification","date":"2017-10-30","arxiv_id":"1710.10741","repositories_listed":1,"syntology":null},{"url":"/paper/learning-heuristic-search-via-imitation","slug":"learning-heuristic-search-via-imitation","title":"Learning Heuristic Search via Imitation","date":"2017-07-10","arxiv_id":"1707.03034","repositories_listed":1,"syntology":null},{"url":"/paper/front-to-end-bidirectional-heuristic-search","slug":"front-to-end-bidirectional-heuristic-search","title":"Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions","date":"2017-03-10","arxiv_id":"1703.03868","repositories_listed":1,"syntology":null},{"url":null,"slug":"optimising-4th-order-runge-kutta-methods-a","title":"Optimising 4th-Order Runge-Kutta Methods: A Dynamic Heuristic Approach for Efficiency and Low Storage","date":"2025-06-26","arxiv_id":"2506.21465","repositories_listed":0,"syntology":null},{"url":null,"slug":"naviagent-bilevel-planning-on-tool-dependency","title":"NaviAgent: Bilevel Planning on Tool Dependency Graphs for Function Calling","date":"2025-06-24","arxiv_id":"2506.19500","repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-reasoning-navigating-solution-spaces-in","title":"Soft Reasoning: Navigating Solution Spaces in Large Language Models through Controlled Embedding Exploration","date":"2025-05-30","arxiv_id":"2505.24688","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-based-abductive-reasoning-over","title":"Consistency-based Abductive Reasoning over Perceptual Errors of Multiple Pre-trained Models in Novel Environments","date":"2025-05-25","arxiv_id":"2505.19361","repositories_listed":0,"syntology":null},{"url":null,"slug":"movable-element-stars-assisted-near-field","title":"Movable-Element STARS-Assisted Near-Field Wideband Communications","date":"2025-05-25","arxiv_id":"2505.19048","repositories_listed":0,"syntology":null},{"url":null,"slug":"skip-thinking-chunk-wise-chain-of-thought","title":"Skip-Thinking: Chunk-wise Chain-of-Thought Distillation Enable Smaller Language Models to Reason Better and Faster","date":"2025-05-24","arxiv_id":"2505.18642","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-block-based-heuristic-algorithm-for-the","title":"A Block-Based Heuristic Algorithm for the Three-Dimensional Nuclear Waste Packing Problem","date":"2025-03-09","arxiv_id":"2503.08705","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-minimum-vertex-cover-solving-via-a","title":"Optimizing Minimum Vertex Cover Solving via a GCN-assisted Heuristic Algorithm","date":"2025-03-09","arxiv_id":"2503.06396","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-prompt-optimization-via-heuristic","title":"Automatic Prompt Optimization via Heuristic Search: A Survey","date":"2025-02-26","arxiv_id":"2502.18746","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardware-distortion-modeling-for-panel","title":"Hardware Distortion Modeling for Panel Selection in Large Intelligent Surfaces","date":"2025-01-22","arxiv_id":"2501.12861","repositories_listed":0,"syntology":null},{"url":null,"slug":"mesha-efficient-path-planing-with-motion","title":"MeshA*: Efficient Path Planing With Motion Primitives","date":"2024-12-13","arxiv_id":"2412.10320","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-7x7-killall-go-with-seki-database","title":"Solving 7x7 Killall-Go with Seki Database","date":"2024-11-08","arxiv_id":"2411.05565","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-memory-search-a-metaheuristic-approach","title":"Deep Memory Search: A Metaheuristic Approach for Optimizing Heuristic Search","date":"2024-10-22","arxiv_id":"2410.17042","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-reinforcement-learning-with-large","title":"Efficient Reinforcement Learning with Large Language Model Priors","date":"2024-10-10","arxiv_id":"2410.07927","repositories_listed":0,"syntology":null},{"url":null,"slug":"windowed-mapf-with-completeness-guarantees","title":"Windowed MAPF with Completeness Guarantees","date":"2024-10-02","arxiv_id":"2410.01798","repositories_listed":0,"syntology":null},{"url":null,"slug":"lamma-p-generalizable-multi-agent-long","title":"LaMMA-P: Generalizable Multi-Agent Long-Horizon Task Allocation and Planning with LM-Driven PDDL Planner","date":"2024-09-30","arxiv_id":"2409.20560","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-evolution-of-heuristic-using","title":"Multi-objective Evolution of Heuristic Using Large Language Model","date":"2024-09-25","arxiv_id":"2409.16867","repositories_listed":0,"syntology":null},{"url":null,"slug":"rt-attack-jailbreaking-text-to-image-models","title":"HTS-Attack: Heuristic Token Search for Jailbreaking Text-to-Image Models","date":"2024-08-25","arxiv_id":"2408.13896","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedmoe-personalized-federated-learning-via","title":"FedMoE: Personalized Federated Learning via Heterogeneous Mixture of Experts","date":"2024-08-21","arxiv_id":"2408.11304","repositories_listed":0,"syntology":null},{"url":null,"slug":"microgrid-planner-a-distributed-energy","title":"Microgrid Planner: A Distributed Energy Resource Sizing Method","date":"2024-06-27","arxiv_id":"2406.19431","repositories_listed":0,"syntology":null},{"url":null,"slug":"q-improving-multi-step-reasoning-for-llms","title":"Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning","date":"2024-06-20","arxiv_id":"2406.14283","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-based-reinforcement-learning-for","title":"Diffusion-based Reinforcement Learning for Dynamic UAV-assisted Vehicle Twins Migration in Vehicular Metaverses","date":"2024-06-08","arxiv_id":"2406.05422","repositories_listed":0,"syntology":null},{"url":null,"slug":"consolidating-lama-with-best-first-width","title":"Consolidating LAMA with Best-First Width Search","date":"2024-04-26","arxiv_id":"2404.17648","repositories_listed":0,"syntology":null},{"url":null,"slug":"hsvi-based-online-minimax-strategies-for","title":"HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms","date":"2024-04-16","arxiv_id":"2404.10679","repositories_listed":0,"syntology":null}],"syntology_records":16,"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":15,"papers_where_code_ran_first_page":"/task/heuristic-search/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":3,"url":"/task/heuristic-search/papers/2","json":"/task/heuristic-search/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/heuristic-search/papers/3","json":"/task/heuristic-search/papers/3.json","rows":61},{"order":"ran","page":1,"of":1,"url":"/task/heuristic-search/papers/ran/1","json":"/task/heuristic-search/papers/ran/1.json","rows":15}],"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":"a49854cf77d8280a5f5a7b8c4514f310a48edce645b825b3080413148517ed21","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}