{"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/problem-decomposition","name":"Problem Decomposition","slug":"problem-decomposition","description_markdown":null,"categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":54,"papers_with_code":19,"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":0},"benchmarks":[],"datasets":[],"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":1,"rows_per_page":100,"shown":54,"of":54,"of_with_code":19,"tagged_in_all":54,"counts":{"archive_papers_tagged":54,"with_a_code_link":19,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":54,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/gradient-free-adaptive-global-pruning-for-pre","slug":"gradient-free-adaptive-global-pruning-for-pre","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","date":"2024-02-28","arxiv_id":"2402.17946","repositories_listed":2,"syntology":{"n":9,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/gradient-free-adaptive-global-pruning-for-pre#ran","syntology_url":"https://syntology.ai/paper/2402.17946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17946"}},"official":{"repos":["baithebest/adagp","baithebest/sparsellm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/agentgroupchat-v2-divide-and-conquer-is-what","slug":"agentgroupchat-v2-divide-and-conquer-is-what","title":"AgentGroupChat-V2: Divide-and-Conquer Is What LLM-Based Multi-Agent System Need","date":"2025-06-18","arxiv_id":"2506.15451","repositories_listed":1,"syntology":null},{"url":"/paper/raise-enhancing-scientific-reasoning-in-llms","slug":"raise-enhancing-scientific-reasoning-in-llms","title":"RAISE: Enhancing Scientific Reasoning in LLMs via Step-by-Step Retrieval","date":"2025-06-10","arxiv_id":"2506.08625","repositories_listed":1,"syntology":null},{"url":"/paper/mas-zero-designing-multi-agent-systems-with","slug":"mas-zero-designing-multi-agent-systems-with","title":"MAS-Zero: Designing Multi-Agent Systems with Zero Supervision","date":"2025-05-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meta-design-matters-a-self-design-multi-agent","slug":"meta-design-matters-a-self-design-multi-agent","title":"Meta-Design Matters: A Self-Design Multi-Agent System","date":"2025-05-21","arxiv_id":"2505.14996","repositories_listed":1,"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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/meta-design-matters-a-self-design-multi-agent#ran","syntology_url":"https://syntology.ai/paper/2505.14996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.14996"}},"official":null}},{"url":"/paper/tabletime-reformulating-time-series","slug":"tabletime-reformulating-time-series","title":"TableTime: Reformulating Time Series Classification as Zero-Shot Table Understanding via Large Language Models","date":"2024-11-24","arxiv_id":"2411.15737","repositories_listed":1,"syntology":null},{"url":"/paper/sra-mcts-self-driven-reasoning-aurmentation","slug":"sra-mcts-self-driven-reasoning-aurmentation","title":"SRA-MCTS: Self-driven Reasoning Augmentation with Monte Carlo Tree Search for Code Generation","date":"2024-11-17","arxiv_id":"2411.11053","repositories_listed":1,"syntology":null},{"url":"/paper/divide-or-conquer-which-part-should-you","slug":"divide-or-conquer-which-part-should-you","title":"Divide-or-Conquer? Which Part Should You Distill Your LLM?","date":"2024-02-22","arxiv_id":"2402.15000","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":11,"phrase":"9 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; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/divide-or-conquer-which-part-should-you#ran","syntology_url":"https://syntology.ai/paper/2402.15000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15000"}},"official":{"repos":["apple/ml-divide-or-conquer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/small-language-models-fine-tuned-to","slug":"small-language-models-fine-tuned-to","title":"Small Language Models Fine-tuned to Coordinate Larger Language Models improve Complex Reasoning","date":"2023-10-21","arxiv_id":"2310.18338","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"5 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/small-language-models-fine-tuned-to#ran","syntology_url":"https://syntology.ai/paper/2310.18338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18338"}},"official":{"repos":["lcs2-iiitd/daslam"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-solver-framework-for-dynamic","slug":"adaptive-solver-framework-for-dynamic","title":"Adaptive-Solver Framework for Dynamic Strategy Selection in Large Language Model Reasoning","date":"2023-10-01","arxiv_id":"2310.01446","repositories_listed":1,"syntology":{"n":11,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":11,"phrase":"4 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; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/adaptive-solver-framework-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2310.01446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01446"}},"official":{"repos":["john1226966735/adaptive-solver"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-matrix-multiplication-without-tears-a","slug":"fast-matrix-multiplication-without-tears-a","title":"Fast Matrix Multiplication Without Tears: A Constraint Programming Approach","date":"2023-06-01","arxiv_id":"2306.01097","repositories_listed":1,"syntology":null},{"url":"/paper/rolling-horizon-based-temporal-decomposition","slug":"rolling-horizon-based-temporal-decomposition","title":"Rolling Horizon based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows","date":"2023-03-06","arxiv_id":"2303.03475","repositories_listed":1,"syntology":null},{"url":"/paper/comparison-of-model-free-and-model-based","slug":"comparison-of-model-free-and-model-based","title":"Comparison of Model-Free and Model-Based Learning-Informed Planning for PointGoal Navigation","date":"2022-12-17","arxiv_id":"2212.08801","repositories_listed":1,"syntology":null},{"url":"/paper/distilling-multi-step-reasoning-capabilities","slug":"distilling-multi-step-reasoning-capabilities","title":"Distilling Reasoning Capabilities into Smaller Language Models","date":"2022-12-01","arxiv_id":"2212.00193","repositories_listed":1,"syntology":null},{"url":"/paper/problem-decomposition-and-multi-shot-asp","slug":"problem-decomposition-and-multi-shot-asp","title":"Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling","date":"2022-05-16","arxiv_id":"2205.07537","repositories_listed":1,"syntology":null},{"url":"/paper/fast-reinforcement-learning-with-generalized","slug":"fast-reinforcement-learning-with-generalized","title":"Fast reinforcement learning with generalized policy updates","date":"2020-07-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-reward-machines-for-partially","slug":"learning-reward-machines-for-partially","title":"Learning Reward Machines for Partially Observable Reinforcement Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/utility-decomposition-with-deep-corrections","slug":"utility-decomposition-with-deep-corrections","title":"Decomposition Methods with Deep Corrections for Reinforcement Learning","date":"2018-02-06","arxiv_id":"1802.01772","repositories_listed":1,"syntology":null},{"url":"/paper/meta-optimizing-semantic-evolutionary-search","slug":"meta-optimizing-semantic-evolutionary-search","title":"Meta-Optimizing Semantic Evolutionary Search","date":"2017-07-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"beyond-accuracy-dissecting-mathematical","title":"Beyond Accuracy: Dissecting Mathematical Reasoning for LLMs Under Reinforcement Learning","date":"2025-06-05","arxiv_id":"2506.04723","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-traces-unexpected-outcomes","title":"Interpretable Traces, Unexpected Outcomes: Investigating the Disconnect in Trace-Based Knowledge Distillation","date":"2025-05-20","arxiv_id":"2505.13792","repositories_listed":0,"syntology":null},{"url":null,"slug":"trace-of-thought-prompting-investigating","title":"Trace-of-Thought Prompting: Investigating Prompt-Based Knowledge Distillation Through Question Decomposition","date":"2025-04-29","arxiv_id":"2504.20946","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-large-language-models-to-reason-via","title":"Training Large Language Models to Reason via EM Policy Gradient","date":"2025-04-24","arxiv_id":"2504.18587","repositories_listed":0,"syntology":null},{"url":null,"slug":"availability-of-perfect-decomposition-in","title":"Availability of Perfect Decomposition in Statistical Linkage Learning for Unitation-based Function Concatenations","date":"2025-03-18","arxiv_id":"2503.17397","repositories_listed":0,"syntology":null},{"url":null,"slug":"ladder-self-improving-llms-through-recursive","title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","date":"2025-03-02","arxiv_id":"2503.00735","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-working-principles-of-model-based-gas","title":"The working principles of model-based GAs fall within the PAC framework: A mathematical theory of problem decomposition","date":"2025-01-18","arxiv_id":"2501.10777","repositories_listed":0,"syntology":null},{"url":null,"slug":"stackelberg-game-based-performance","title":"Stackelberg Game Based Performance Optimization in Digital Twin Assisted Federated Learning over NOMA Networks","date":"2025-01-03","arxiv_id":"2501.01584","repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-chatgpt-in-a-data-structures-and","title":"Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective","date":"2024-10-11","arxiv_id":"2410.08899","repositories_listed":0,"syntology":null},{"url":null,"slug":"navigating-the-nuances-a-fine-grained","title":"Navigating the Nuances: A Fine-grained Evaluation of Vision-Language Navigation","date":"2024-09-25","arxiv_id":"2409.17313","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-service-collaboration-and-composition","title":"Multi-service collaboration and composition of cloud manufacturing customized production based on problem decomposition","date":"2024-06-28","arxiv_id":"2406.19608","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-geometry-aware-pareto-set-learning","title":"Context-aware Diversity Enhancement for Neural Multi-Objective Combinatorial Optimization","date":"2024-05-14","arxiv_id":"2405.08604","repositories_listed":0,"syntology":null},{"url":null,"slug":"independent-rl-for-cooperative-competitive","title":"Independent RL for Cooperative-Competitive Agents: A Mean-Field Perspective","date":"2024-03-17","arxiv_id":"2403.11345","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-composite-decomposition-method-for-large","title":"A Composite Decomposition Method for Large-Scale Global Optimization","date":"2024-03-02","arxiv_id":"2403.01192","repositories_listed":0,"syntology":null},{"url":null,"slug":"client-orchestration-and-cost-efficient-joint","title":"Client Orchestration and Cost-Efficient Joint Optimization for NOMA-Enabled Hierarchical Federated Learning","date":"2023-11-03","arxiv_id":"2311.02130","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-guided-inductive-inference-for-solving","title":"LLM Guided Inductive Inference for Solving Compositional Problems","date":"2023-09-20","arxiv_id":"2309.11688","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-topology-and-parameter","title":"Data-driven Topology and Parameter Identification in Distribution Systems with limited Measurements","date":"2023-08-18","arxiv_id":"2308.09521","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybridization-of-evolutionary-algorithm-and","title":"Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization","date":"2022-06-21","arxiv_id":"2206.10464","repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-recursive-ranking-grouping-for","title":"Incremental Recursive Ranking Grouping for Large Scale Global Optimization","date":"2022-06-08","arxiv_id":"2206.04168","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-optimization-in-distribution","title":"Distributed Optimization in Distribution Systems with Grid-Forming and Grid-Supporting Inverters","date":"2022-05-20","arxiv_id":"2205.09981","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-diagnosis-of-the-progress-and","title":"Dynamic Diagnosis of the Progress and Shortcomings of Student Learning using Machine Learning based on Cognitive, Social, and Emotional Features","date":"2022-04-13","arxiv_id":"2204.13989","repositories_listed":0,"syntology":null},{"url":null,"slug":"physics-guided-problem-decomposition-for","title":"Physics-Guided Problem Decomposition for Scaling Deep Learning of High-dimensional Eigen-Solvers: The Case of Schrödinger's Equation","date":"2022-02-12","arxiv_id":"2202.05994","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-6-ds-of-creating-ai-enabled-systems","title":"The 6-Ds of Creating AI-Enabled Systems","date":"2022-02-04","arxiv_id":"2202.03172","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-reward-machines-a-study-in-partially","title":"Learning Reward Machines: A Study in Partially Observable Reinforcement Learning","date":"2021-12-17","arxiv_id":"2112.09477","repositories_listed":0,"syntology":null},{"url":null,"slug":"dibb-distributing-black-box-optimization","title":"DiBB: Distributing Black-Box Optimization","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-surrogate-assisted-variable-grouping","title":"A Surrogate-Assisted Variable Grouping Algorithm for General Large Scale Global Optimization Problems","date":"2021-01-19","arxiv_id":"2101.07430","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-algorithms-for-black-box-safety","title":"A Survey of Algorithms for Black-Box Safety Validation of Cyber-Physical Systems","date":"2020-05-06","arxiv_id":"2005.02979","repositories_listed":0,"syntology":null},{"url":null,"slug":"divide-and-conquer-large-scale-capacitated","title":"Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition","date":"2019-12-29","arxiv_id":"1912.12667","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-task-allocation-in-multi-robot","title":"Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering","date":"2018-07-20","arxiv_id":"1807.07957","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-dexterous","title":"Deep Reinforcement Learning for Dexterous Manipulation with Concept Networks","date":"2017-09-20","arxiv_id":"1709.06977","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-decomposition-for-nonconvex","title":"Recursive Decomposition for Nonconvex Optimization","date":"2016-11-08","arxiv_id":"1611.02755","repositories_listed":0,"syntology":null},{"url":null,"slug":"whittle-index-policy-for-crawling-ephemeral","title":"Whittle Index Policy for Crawling Ephemeral Content","date":"2015-03-30","arxiv_id":"1503.08558","repositories_listed":0,"syntology":null},{"url":null,"slug":"mapp-a-scalable-multi-agent-path-planning","title":"MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees","date":"2014-01-16","arxiv_id":"1401.3905","repositories_listed":0,"syntology":null},{"url":null,"slug":"collective-mind-cleaning-up-the-research-and","title":"Collective Mind: cleaning up the research and experimentation mess in computer engineering using crowdsourcing, big data and machine learning","date":"2013-08-11","arxiv_id":"1308.2410","repositories_listed":0,"syntology":null},{"url":null,"slug":"deciding-monotone-duality-and-identifying","title":"Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace","date":"2012-12-09","arxiv_id":"1212.1881","repositories_listed":0,"syntology":null}],"syntology_records":5,"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":4,"papers_where_code_ran_first_page":"/task/problem-decomposition/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":"ran","page":1,"of":1,"url":"/task/problem-decomposition/papers/ran/1","json":"/task/problem-decomposition/papers/ran/1.json","rows":4}],"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":"37d8f8c9e2f1105b86c3d2acdde1a8449a10332c47b24d8afede9b6ca030358b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}