{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VJUWHJI34WOEU26CFR6UTTHK3M","short_pith_number":"pith:VJUWHJI3","schema_version":"1.0","canonical_sha256":"aa6963a51be59c4a6bc22c7d49cceadb3a68ced64877471c753f0f51318b61fc","source":{"kind":"arxiv","id":"2311.05772","version":2},"attestation_state":"computed","paper":{"title":"ADaPT: As-Needed Decomposition and Planning with Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Alexander Koller, Archiki Prasad, Ashish Sabharwal, Mareike Hartmann, Mohit Bansal, Peter Clark, Tushar Khot","submitted_at":"2023-11-08T17:59:15Z","abstract_excerpt":"Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment. Recent works employ LLMs-as-agents in broadly two ways: iteratively determining the next action (iterative executors) or generating plans and executing sub-tasks using LLMs (plan-and-execute). However, these methods struggle with task complexity, as the inability to execute any sub-task may lead to task failure. To address these shortcomings, we introduce As-Needed Decomposition and Planning for complex Tasks (ADaPT), an approach that explicitly pla"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2311.05772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-11-08T17:59:15Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"1956fae8a8504fd2d9faea69786778a288654e8d5976de57abb0170f406f4ae1","abstract_canon_sha256":"36280f9d6222cd41b35785ded7ff0156ff4e2303f2f269644d1dea6dcf94f091"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:51.919399Z","signature_b64":"3EfagNj9ivtGrXllixOdp/UIDMyWSStqunQ9CrY6+2o0L6oeaaNK3R+hQqOA0spHNnTP8hdKlIPfeHLR7dkQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa6963a51be59c4a6bc22c7d49cceadb3a68ced64877471c753f0f51318b61fc","last_reissued_at":"2026-07-05T08:05:51.918960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:51.918960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADaPT: As-Needed Decomposition and Planning with Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Alexander Koller, Archiki Prasad, Ashish Sabharwal, Mareike Hartmann, Mohit Bansal, Peter Clark, Tushar Khot","submitted_at":"2023-11-08T17:59:15Z","abstract_excerpt":"Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment. Recent works employ LLMs-as-agents in broadly two ways: iteratively determining the next action (iterative executors) or generating plans and executing sub-tasks using LLMs (plan-and-execute). However, these methods struggle with task complexity, as the inability to execute any sub-task may lead to task failure. To address these shortcomings, we introduce As-Needed Decomposition and Planning for complex Tasks (ADaPT), an approach that explicitly pla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05772","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.05772/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.05772","created_at":"2026-07-05T08:05:51.919018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.05772v2","created_at":"2026-07-05T08:05:51.919018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05772","created_at":"2026-07-05T08:05:51.919018+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJUWHJI34WOE","created_at":"2026-07-05T08:05:51.919018+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJUWHJI34WOEU26C","created_at":"2026-07-05T08:05:51.919018+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJUWHJI3","created_at":"2026-07-05T08:05:51.919018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.01990","citing_title":"Advances and Challenges in Foundation Agents: From Brain-Inspired Intelligence to Evolutionary, Collaborative, and Safe Systems","ref_index":124,"is_internal_anchor":false},{"citing_arxiv_id":"2506.03610","citing_title":"Orak: A Foundational Benchmark for Training and Evaluating LLM Agents on Diverse Video Games","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2503.09572","citing_title":"Plan-and-Act: Improving Planning of Agents for Long-Horizon Tasks","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2601.12538","citing_title":"Agentic Reasoning for Large Language Models","ref_index":227,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23194","citing_title":"From Coarse to Fine: Self-Adaptive Hierarchical Planning for LLM Agents","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01356","citing_title":"Model-Based Proactive Cost Generation for Learning Safe Policies Offline with Limited Violation Data","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M","json":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M.json","graph_json":"https://pith.science/api/pith-number/VJUWHJI34WOEU26CFR6UTTHK3M/graph.json","events_json":"https://pith.science/api/pith-number/VJUWHJI34WOEU26CFR6UTTHK3M/events.json","paper":"https://pith.science/paper/VJUWHJI3"},"agent_actions":{"view_html":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M","download_json":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M.json","view_paper":"https://pith.science/paper/VJUWHJI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.05772&json=true","fetch_graph":"https://pith.science/api/pith-number/VJUWHJI34WOEU26CFR6UTTHK3M/graph.json","fetch_events":"https://pith.science/api/pith-number/VJUWHJI34WOEU26CFR6UTTHK3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M/action/storage_attestation","attest_author":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M/action/author_attestation","sign_citation":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M/action/citation_signature","submit_replication":"https://pith.science/pith/VJUWHJI34WOEU26CFR6UTTHK3M/action/replication_record"}},"created_at":"2026-07-05T08:05:51.919018+00:00","updated_at":"2026-07-05T08:05:51.919018+00:00"}