{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5SXRN4UBGIB3IIQGGTHXTMFFHQ","short_pith_number":"pith:5SXRN4UB","schema_version":"1.0","canonical_sha256":"ecaf16f2813203b4220634cf79b0a53c161bb483a94603bc61eb9dd640d23260","source":{"kind":"arxiv","id":"2310.10645","version":2},"attestation_state":"computed","paper":{"title":"Interactive Task Planning with Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.HC"],"primary_cat":"cs.RO","authors_text":"Boyi Li, Jitendra Malik, Philipp Wu, Pieter Abbeel","submitted_at":"2023-10-16T17:59:12Z","abstract_excerpt":"An interactive robot framework accomplishes long-horizon task planning and can easily generalize to new goals and distinct tasks, even during execution. However, most traditional methods require predefined module design, making it hard to generalize to different goals. Recent large language model based approaches can allow for more open-ended planning but often require heavy prompt engineering or domain specific pretrained models. To tackle this, we propose a simple framework that achieves interactive task planning with language models by incorporating both high-level planning and low-level sk"},"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":"2310.10645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-10-16T17:59:12Z","cross_cats_sorted":["cs.AI","cs.CL","cs.HC"],"title_canon_sha256":"421757f4c2b87fb869c33ac4f66bdbc1a2e7757b423ab146ee78811adbd95cae","abstract_canon_sha256":"27504b0338a3e8428fc625721dca671335b67592c5f6a9337a7815919fd7edd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:14.184816Z","signature_b64":"CHs0p3B5TI26b/FHYk2LjL7/2MS4PL5yTogN41GNaX744P3mg3Tby8bPBupskrQ0RbqYdb7y0p/1A57t+yb5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecaf16f2813203b4220634cf79b0a53c161bb483a94603bc61eb9dd640d23260","last_reissued_at":"2026-07-05T10:11:14.184308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:14.184308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interactive Task Planning with Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.HC"],"primary_cat":"cs.RO","authors_text":"Boyi Li, Jitendra Malik, Philipp Wu, Pieter Abbeel","submitted_at":"2023-10-16T17:59:12Z","abstract_excerpt":"An interactive robot framework accomplishes long-horizon task planning and can easily generalize to new goals and distinct tasks, even during execution. However, most traditional methods require predefined module design, making it hard to generalize to different goals. Recent large language model based approaches can allow for more open-ended planning but often require heavy prompt engineering or domain specific pretrained models. To tackle this, we propose a simple framework that achieves interactive task planning with language models by incorporating both high-level planning and low-level sk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10645","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/2310.10645/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":"2310.10645","created_at":"2026-07-05T10:11:14.184379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.10645v2","created_at":"2026-07-05T10:11:14.184379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10645","created_at":"2026-07-05T10:11:14.184379+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SXRN4UBGIB3","created_at":"2026-07-05T10:11:14.184379+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SXRN4UBGIB3IIQG","created_at":"2026-07-05T10:11:14.184379+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SXRN4UB","created_at":"2026-07-05T10:11:14.184379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23157","citing_title":"Bridging Semantics and Kinematics: A Modular Framework for Zero-Shot Robotic Manipulation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18189","citing_title":"Beyond Failure Recovery: An Engagement-Aware Human-in-the-loop Framework for Robotic Systems","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00985","citing_title":"Make Your VLA More Robust Without More Data By Interleaving Motion Planning","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31958","citing_title":"Adapting Generalist Robot Policies with Semantic Reinforcement Learning","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2401.03568","citing_title":"Agent AI: Surveying the Horizons of Multimodal Interaction","ref_index":135,"is_internal_anchor":false},{"citing_arxiv_id":"2502.19417","citing_title":"Hi Robot: Open-Ended Instruction Following with Hierarchical Vision-Language-Action Models","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2602.13193","citing_title":"Steerable Vision-Language-Action Policies for Embodied Reasoning and Hierarchical Control","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ","json":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ.json","graph_json":"https://pith.science/api/pith-number/5SXRN4UBGIB3IIQGGTHXTMFFHQ/graph.json","events_json":"https://pith.science/api/pith-number/5SXRN4UBGIB3IIQGGTHXTMFFHQ/events.json","paper":"https://pith.science/paper/5SXRN4UB"},"agent_actions":{"view_html":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ","download_json":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ.json","view_paper":"https://pith.science/paper/5SXRN4UB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.10645&json=true","fetch_graph":"https://pith.science/api/pith-number/5SXRN4UBGIB3IIQGGTHXTMFFHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5SXRN4UBGIB3IIQGGTHXTMFFHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ/action/storage_attestation","attest_author":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ/action/author_attestation","sign_citation":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ/action/citation_signature","submit_replication":"https://pith.science/pith/5SXRN4UBGIB3IIQGGTHXTMFFHQ/action/replication_record"}},"created_at":"2026-07-05T10:11:14.184379+00:00","updated_at":"2026-07-05T10:11:14.184379+00:00"}