{"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/robot-task-planning","name":"Robot Task Planning","slug":"robot-task-planning","description_markdown":null,"categories":[{"name":"Reasoning","url":"/area/reasoning"},{"name":"Robots","url":"/area/robots"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":48,"papers_with_code":23,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"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":7,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/robot-task-planning-on-packit","slug":"robot-task-planning-on-packit","dataset":"PackIt","dataset_url":"/dataset/packit","rows_in_archive":4,"metrics":["Average Reward"],"first_row_in_archive_order":{"model":"PackNN","paper_title":"PackIt: A Virtual Environment for Geometric Planning","paper_url":"/paper/packit-a-virtual-environment-for-geometric","paper_date":"2020-07-21","arxiv_id":"2007.11121","code_links":[{"title":"princeton-vl/PackIt","url":"https://github.com/princeton-vl/PackIt"}],"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/packit-a-virtual-environment-for-geometric#ran","syntology_url":"https://syntology.ai/paper/2007.11121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.11121"}},"official":{"repos":["princeton-vl/PackIt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/robot-task-planning-on-sheetcopilot","slug":"robot-task-planning-on-sheetcopilot","dataset":"SheetCopilot","dataset_url":"/dataset/sheetcopilot","rows_in_archive":2,"metrics":["Pass@1"],"first_row_in_archive_order":{"model":"SheetAgent (GPT-3.5)","paper_title":"SheetAgent: Towards A Generalist Agent for Spreadsheet Reasoning and Manipulation via Large Language Models","paper_url":"/paper/sheetagent-a-generalist-agent-for-spreadsheet","paper_date":"2024-03-06","arxiv_id":"2403.03636","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/packit","name":"PackIt","full_name":"","num_papers_in_archive":3},{"url":"/dataset/sheetcopilot","name":"SheetCopilot","full_name":"","num_papers_in_archive":2},{"url":"/dataset/emmoe-100","name":"EMMOE-100","full_name":"","num_papers_in_archive":1},{"url":"/dataset/hri-simple-tasks","name":"HRI Simple Tasks","full_name":"","num_papers_in_archive":1},{"url":"/dataset/synthetic-object-preference-adaptation-data","name":"Synthetic Object Preference Adaptation Data","full_name":"","num_papers_in_archive":1},{"url":"/dataset/taskography","name":"Taskography","full_name":"PDDLGym Taskography","num_papers_in_archive":1},{"url":"/dataset/fields2benchmark-dataset","name":"Fields2Benchmark dataset","full_name":"","num_papers_in_archive":0}],"subtasks":[{"url":"/task/task-planning","name":"Task Planning"}],"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":48,"of":48,"of_with_code":23,"tagged_in_all":48,"counts":{"archive_papers_tagged":48,"with_a_code_link":23,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":48,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/do-as-i-can-not-as-i-say-grounding-language","slug":"do-as-i-can-not-as-i-say-grounding-language","title":"Do As I Can, Not As I Say: Grounding Language in Robotic Affordances","date":"2022-04-04","arxiv_id":"2204.01691","repositories_listed":3,"syntology":null},{"url":"/paper/3d-dynamic-scene-graphs-actionable-spatial","slug":"3d-dynamic-scene-graphs-actionable-spatial","title":"3D Dynamic Scene Graphs: Actionable Spatial Perception with Places, Objects, and Humans","date":"2020-02-15","arxiv_id":"2002.06289","repositories_listed":3,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/3d-dynamic-scene-graphs-actionable-spatial#ran","syntology_url":"https://syntology.ai/paper/2002.06289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06289"}},"official":{"repos":["MIT-SPARK/Kimera"],"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/training-frankensteins-creature-to-stack","slug":"training-frankensteins-creature-to-stack","title":"The CoSTAR Block Stacking Dataset: Learning with Workspace Constraints","date":"2018-10-27","arxiv_id":"1810.11714","repositories_listed":3,"syntology":null},{"url":"/paper/you-only-demonstrate-once-category-level","slug":"you-only-demonstrate-once-category-level","title":"You Only Demonstrate Once: Category-Level Manipulation from Single Visual Demonstration","date":"2022-01-30","arxiv_id":"2201.12716","repositories_listed":2,"syntology":{"n":30,"n_ran":18,"n_constructed":0,"n_ran_checked":15,"n_instrument":3,"n_unverified":12,"n_honours":0,"n_violates":1,"n_no_contract":14,"n_pointer_only":2,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 1 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/you-only-demonstrate-once-category-level#ran","syntology_url":"https://syntology.ai/paper/2201.12716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12716"}},"official":{"repos":["wenbowen123/catgrasp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/llm-map-bimanual-robot-task-planning-using","slug":"llm-map-bimanual-robot-task-planning-using","title":"LLM+MAP: Bimanual Robot Task Planning using Large Language Models and Planning Domain Definition Language","date":"2025-03-21","arxiv_id":"2503.17309","repositories_listed":1,"syntology":null},{"url":"/paper/mrbtp-efficient-multi-robot-behavior-tree","slug":"mrbtp-efficient-multi-robot-behavior-tree","title":"MRBTP: Efficient Multi-Robot Behavior Tree Planning and Collaboration","date":"2025-02-25","arxiv_id":"2502.18072","repositories_listed":1,"syntology":null},{"url":"/paper/robomatrix-a-skill-centric-hierarchical","slug":"robomatrix-a-skill-centric-hierarchical","title":"RoboMatrix: A Skill-centric Hierarchical Framework for Scalable Robot Task Planning and Execution in Open-World","date":"2024-11-29","arxiv_id":"2412.00171","repositories_listed":1,"syntology":null},{"url":"/paper/selp-generating-safe-and-efficient-task-plans","slug":"selp-generating-safe-and-efficient-task-plans","title":"SELP: Generating Safe and Efficient Task Plans for Robot Agents with Large Language Models","date":"2024-09-28","arxiv_id":"2409.19471","repositories_listed":1,"syntology":null},{"url":"/paper/coherent-collaboration-of-heterogeneous-multi","slug":"coherent-collaboration-of-heterogeneous-multi","title":"COHERENT: Collaboration of Heterogeneous Multi-Robot System with Large Language Models","date":"2024-09-23","arxiv_id":"2409.15146","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-planning-in-large-partially","slug":"sequential-planning-in-large-partially","title":"Sequential Planning in Large Partially Observable Environments guided by LLMs","date":"2023-12-12","arxiv_id":"2312.07368","repositories_listed":1,"syntology":null},{"url":"/paper/vision-language-interpreter-for-robot-task","slug":"vision-language-interpreter-for-robot-task","title":"Vision-Language Interpreter for Robot Task Planning","date":"2023-11-02","arxiv_id":"2311.00967","repositories_listed":1,"syntology":null},{"url":"/paper/reflect-summarizing-robot-experiences-for","slug":"reflect-summarizing-robot-experiences-for","title":"REFLECT: Summarizing Robot Experiences for Failure Explanation and Correction","date":"2023-06-27","arxiv_id":"2306.15724","repositories_listed":1,"syntology":{"n":19,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/reflect-summarizing-robot-experiences-for#ran","syntology_url":"https://syntology.ai/paper/2306.15724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15724"}},"official":{"repos":["real-stanford/reflect"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/robot-task-planning-based-on-large-language","slug":"robot-task-planning-based-on-large-language","title":"Robot Task Planning Based on Large Language Model Representing Knowledge with Directed Graph Structures","date":"2023-06-08","arxiv_id":"2306.05171","repositories_listed":1,"syntology":null},{"url":"/paper/sheetcopilot-bringing-software-productivity","slug":"sheetcopilot-bringing-software-productivity","title":"SheetCopilot: Bringing Software Productivity to the Next Level through Large Language Models","date":"2023-05-30","arxiv_id":"2305.19308","repositories_listed":1,"syntology":null},{"url":"/paper/parsel-a-unified-natural-language-framework","slug":"parsel-a-unified-natural-language-framework","title":"Parsel: Algorithmic Reasoning with Language Models by Composing Decompositions","date":"2022-12-20","arxiv_id":"2212.10561","repositories_listed":1,"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/parsel-a-unified-natural-language-framework#ran","syntology_url":"https://syntology.ai/paper/2212.10561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10561"}},"official":{"repos":["ezelikman/parsel"],"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/busybot-learning-to-interact-reason-and-plan","slug":"busybot-learning-to-interact-reason-and-plan","title":"BusyBot: Learning to Interact, Reason, and Plan in a BusyBoard Environment","date":"2022-07-17","arxiv_id":"2207.08192","repositories_listed":1,"syntology":null},{"url":"/paper/taskography-evaluating-robot-task-planning","slug":"taskography-evaluating-robot-task-planning","title":"TASKOGRAPHY: Evaluating robot task planning over large 3D scene graphs","date":"2022-07-11","arxiv_id":"2207.05006","repositories_listed":1,"syntology":null},{"url":"/paper/language-models-as-zero-shot-planners-1","slug":"language-models-as-zero-shot-planners-1","title":"Language Models as Zero-Shot Planners: Extracting Actionable Knowledge for Embodied Agents","date":"2022-01-18","arxiv_id":"2201.07207","repositories_listed":1,"syntology":null},{"url":"/paper/catgrasp-learning-category-level-task","slug":"catgrasp-learning-category-level-task","title":"CaTGrasp: Learning Category-Level Task-Relevant Grasping in Clutter from Simulation","date":"2021-09-19","arxiv_id":"2109.09163","repositories_listed":1,"syntology":null},{"url":"/paper/q-attention-enabling-efficient-learning-for","slug":"q-attention-enabling-efficient-learning-for","title":"Q-attention: Enabling Efficient Learning for Vision-based Robotic Manipulation","date":"2021-05-31","arxiv_id":"2105.14829","repositories_listed":1,"syntology":null},{"url":"/paper/packit-a-virtual-environment-for-geometric","slug":"packit-a-virtual-environment-for-geometric","title":"PackIt: A Virtual Environment for Geometric Planning","date":"2020-07-21","arxiv_id":"2007.11121","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/packit-a-virtual-environment-for-geometric#ran","syntology_url":"https://syntology.ai/paper/2007.11121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.11121"}},"official":{"repos":["princeton-vl/PackIt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/functional-object-oriented-network-1","slug":"functional-object-oriented-network-1","title":"Task Planning with a Weighted Functional Object-Oriented Network","date":"2019-05-01","arxiv_id":"1905.00502","repositories_listed":1,"syntology":null},{"url":"/paper/visual-robot-task-planning","slug":"visual-robot-task-planning","title":"Visual Robot Task Planning","date":"2018-03-30","arxiv_id":"1804.00062","repositories_listed":1,"syntology":null},{"url":null,"slug":"2505-10872","title":"REI-Bench: Can Embodied Agents Understand Vague Human Instructions in Task Planning?","date":"2025-05-16","arxiv_id":"2505.10872","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-corrective-task-planning-by-inverse","title":"Self-Corrective Task Planning by Inverse Prompting with Large Language Models","date":"2025-03-10","arxiv_id":"2503.07317","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-hierarchical-reinforcement-learning","title":"Scalable Hierarchical Reinforcement Learning for Hyper Scale Multi-Robot Task Planning","date":"2024-12-27","arxiv_id":"2412.19538","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-to-sim-via-end-to-end-differentiable","title":"One-Shot Real-to-Sim via End-to-End Differentiable Simulation and Rendering","date":"2024-11-29","arxiv_id":"2412.00259","repositories_listed":0,"syntology":null},{"url":null,"slug":"verigraph-scene-graphs-for-execution","title":"VeriGraph: Scene Graphs for Execution Verifiable Robot Planning","date":"2024-11-15","arxiv_id":"2411.10446","repositories_listed":0,"syntology":null},{"url":null,"slug":"climb-language-guided-continual-learning-for","title":"CLIMB: Language-Guided Continual Learning for Task Planning with Iterative Model Building","date":"2024-10-17","arxiv_id":"2410.13756","repositories_listed":0,"syntology":null},{"url":null,"slug":"vlm-see-robot-do-human-demo-video-to-robot","title":"VLM See, Robot Do: Human Demo Video to Robot Action Plan via Vision Language Model","date":"2024-10-11","arxiv_id":"2410.08792","repositories_listed":0,"syntology":null},{"url":null,"slug":"encoding-reusable-multi-robot-planning","title":"Encoding Reusable Multi-Robot Planning Strategies as Abstract Hypergraphs","date":"2024-09-16","arxiv_id":"2409.10692","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-natural-language-understanding-for","title":"Nl2Hltl2Plan: Scaling Up Natural Language Understanding for Multi-Robots Through Hierarchical Temporal Logic Task Representation","date":"2024-08-15","arxiv_id":"2408.08188","repositories_listed":0,"syntology":null},{"url":null,"slug":"dkprompt-domain-knowledge-prompting-vision","title":"DKPROMPT: Domain Knowledge Prompting Vision-Language Models for Open-World Planning","date":"2024-06-25","arxiv_id":"2406.17659","repositories_listed":0,"syntology":null},{"url":null,"slug":"delta-decomposed-efficient-long-term-robot","title":"DELTA: Decomposed Efficient Long-Term Robot Task Planning using Large Language Models","date":"2024-04-04","arxiv_id":"2404.03275","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-language-as-polices-reasoning-for","title":"Natural Language as Policies: Reasoning for Coordinate-Level Embodied Control with LLMs","date":"2024-03-20","arxiv_id":"2403.13801","repositories_listed":0,"syntology":null},{"url":"/paper/sheetagent-a-generalist-agent-for-spreadsheet","slug":"sheetagent-a-generalist-agent-for-spreadsheet","title":"SheetAgent: Towards A Generalist Agent for Spreadsheet Reasoning and Manipulation via Large Language Models","date":"2024-03-06","arxiv_id":"2403.03636","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-for-robotics","title":"Large Language Models for Robotics: Opportunities, Challenges, and Perspectives","date":"2024-01-09","arxiv_id":"2401.04334","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-raise-a-robot-a-case-for-neuro","title":"How to Raise a Robot -- A Case for Neuro-Symbolic AI in Constrained Task Planning for Humanoid Assistive Robots","date":"2023-12-14","arxiv_id":"2312.08820","repositories_listed":0,"syntology":null},{"url":null,"slug":"sayplan-grounding-large-language-models-using","title":"SayPlan: Grounding Large Language Models using 3D Scene Graphs for Scalable Robot Task Planning","date":"2023-07-12","arxiv_id":"2307.06135","repositories_listed":0,"syntology":null},{"url":null,"slug":"markov-decision-processes-with-maximum","title":"Entropy Rate Maximization of Markov Decision Processes under Linear Temporal Logic Tasks","date":"2022-11-23","arxiv_id":"2211.12805","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-don-t-know-when-i-will-arrive","title":"You Don't Know When I Will Arrive: Unpredictable Controller Synthesis for Temporal Logic Tasks","date":"2022-11-23","arxiv_id":"2211.12803","repositories_listed":0,"syntology":null},{"url":null,"slug":"robot-task-planning-and-situation-handling-in","title":"Robot Task Planning and Situation Handling in Open Worlds","date":"2022-10-04","arxiv_id":"2210.01287","repositories_listed":0,"syntology":null},{"url":"/paper/0-1-deep-neural-networks-via-block-coordinate","slug":"0-1-deep-neural-networks-via-block-coordinate","title":"0/1 Deep Neural Networks via Block Coordinate Descent","date":"2022-06-19","arxiv_id":"2206.09379","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-human-guided-causal-knowledge-for-more","title":"Using Human-Guided Causal Knowledge for More Generalized Robot Task Planning","date":"2021-10-09","arxiv_id":"2110.04664","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-planning-in-robotics-an-empirical","title":"Task Planning in Robotics: an Empirical Comparison of PDDL-based and ASP-based Systems","date":"2018-04-23","arxiv_id":"1804.08229","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-imagine-manipulation-goals-for","title":"Learning to Imagine Manipulation Goals for Robot Task Planning","date":"2017-11-08","arxiv_id":"1711.02783","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferring-forces-and-learning-human-utilities","title":"Inferring Forces and Learning Human Utilities From Videos","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"plan-explicability-and-predictability-for","title":"Plan Explicability and Predictability for Robot Task Planning","date":"2015-11-25","arxiv_id":"1511.08158","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":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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":[{"leaderboard":"/sota/robot-task-planning-on-sheetcopilot","since_archive":"/sota/robot-task-planning-on-sheetcopilot#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/task/robot-task-planning/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/robot-task-planning/papers/ran/1","json":"/task/robot-task-planning/papers/ran/1.json","rows":5}],"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":"b3b198bb6f666a37a95e447aa9b96fedb39d7a39f3393f4e4ebec7458cc7009e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}