{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3AFTNEK3MSFGICHUYLNY4NGDDV","short_pith_number":"pith:3AFTNEK3","schema_version":"1.0","canonical_sha256":"d80b36915b648a6408f4c2db8e34c31d70d572b326e4cb9de1a46a13ae377513","source":{"kind":"arxiv","id":"2205.14288","version":1},"attestation_state":"computed","paper":{"title":"Few-shot Subgoal Planning with Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Honglak Lee, Lajanugen Logeswaran, Moontae Lee, Yao Fu","submitted_at":"2022-05-28T01:03:30Z","abstract_excerpt":"Pre-trained large language models have shown successful progress in many language understanding benchmarks. This work explores the capability of these models to predict actionable plans in real-world environments. Given a text instruction, we show that language priors encoded in pre-trained language models allow us to infer fine-grained subgoal sequences. In contrast to recent methods which make strong assumptions about subgoal supervision, our experiments show that language models can infer detailed subgoal sequences from few training sequences without any fine-tuning. We further propose a si"},"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":"2205.14288","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2022-05-28T01:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"da3e6834b36f71dafdc862fb8c02d82e59a1f41320963278ccf7ececa0f94f13","abstract_canon_sha256":"e4e534f0b9f474ae88ea252bca54a4ef84dee8827372fc4fc45a84ecd11f7727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:15.939581Z","signature_b64":"GJGMILtBSl+XApVZFvyEAuMGUzhNmcwzwsyR0liFNduwAWayx/HX8r9sVY76twHWHOE5eSxEeW6i4RgxV+UIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d80b36915b648a6408f4c2db8e34c31d70d572b326e4cb9de1a46a13ae377513","last_reissued_at":"2026-07-05T04:27:15.939180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:15.939180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Few-shot Subgoal Planning with Language Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Honglak Lee, Lajanugen Logeswaran, Moontae Lee, Yao Fu","submitted_at":"2022-05-28T01:03:30Z","abstract_excerpt":"Pre-trained large language models have shown successful progress in many language understanding benchmarks. This work explores the capability of these models to predict actionable plans in real-world environments. Given a text instruction, we show that language priors encoded in pre-trained language models allow us to infer fine-grained subgoal sequences. In contrast to recent methods which make strong assumptions about subgoal supervision, our experiments show that language models can infer detailed subgoal sequences from few training sequences without any fine-tuning. We further propose a si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14288","kind":"arxiv","version":1},"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/2205.14288/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":"2205.14288","created_at":"2026-07-05T04:27:15.939239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.14288v1","created_at":"2026-07-05T04:27:15.939239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14288","created_at":"2026-07-05T04:27:15.939239+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AFTNEK3MSFG","created_at":"2026-07-05T04:27:15.939239+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AFTNEK3MSFGICHU","created_at":"2026-07-05T04:27:15.939239+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AFTNEK3","created_at":"2026-07-05T04:27:15.939239+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17135","citing_title":"LLM-Based Offline Learning for Embodied Agents via Consistency-Guided Reward Ensemble","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV","json":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV.json","graph_json":"https://pith.science/api/pith-number/3AFTNEK3MSFGICHUYLNY4NGDDV/graph.json","events_json":"https://pith.science/api/pith-number/3AFTNEK3MSFGICHUYLNY4NGDDV/events.json","paper":"https://pith.science/paper/3AFTNEK3"},"agent_actions":{"view_html":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV","download_json":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV.json","view_paper":"https://pith.science/paper/3AFTNEK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.14288&json=true","fetch_graph":"https://pith.science/api/pith-number/3AFTNEK3MSFGICHUYLNY4NGDDV/graph.json","fetch_events":"https://pith.science/api/pith-number/3AFTNEK3MSFGICHUYLNY4NGDDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV/action/storage_attestation","attest_author":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV/action/author_attestation","sign_citation":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV/action/citation_signature","submit_replication":"https://pith.science/pith/3AFTNEK3MSFGICHUYLNY4NGDDV/action/replication_record"}},"created_at":"2026-07-05T04:27:15.939239+00:00","updated_at":"2026-07-05T04:27:15.939239+00:00"}