{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:W5FSCBDD3AS6T2KGLGNG3MIHVI","short_pith_number":"pith:W5FSCBDD","schema_version":"1.0","canonical_sha256":"b74b210463d825e9e946599a6db107aa04e2013a9f91a98497359f8f8e5d56c5","source":{"kind":"arxiv","id":"2308.13724","version":1},"attestation_state":"computed","paper":{"title":"ISR-LLM: Iterative Self-Refined Large Language Model for Long-Horizon Sequential Task Planning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Jiayang Song, Kunpeng Yao, Lei Ma, Zhan Shu, Zhehua Zhou","submitted_at":"2023-08-26T01:31:35Z","abstract_excerpt":"Motivated by the substantial achievements observed in Large Language Models (LLMs) in the field of natural language processing, recent research has commenced investigations into the application of LLMs for complex, long-horizon sequential task planning challenges in robotics. LLMs are advantageous in offering the potential to enhance the generalizability as task-agnostic planners and facilitate flexible interaction between human instructors and planning systems. However, task plans generated by LLMs often lack feasibility and correctness. To address this challenge, we introduce ISR-LLM, a nove"},"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":"2308.13724","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2023-08-26T01:31:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a02155a04cb71386e8dd6336adc006b0ca855935002362b23df3600a0de18793","abstract_canon_sha256":"b6ecb4bd70adee57c64c458a24cdd1ce890ee97e637ba06ddccb724880d517db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:45:03.933063Z","signature_b64":"pFNaj64kMYF1dAjlJPH9ngrqRV0gp/LDNygbtaedI41U/fDnnLG73/s+o5X8cRpXg9/Tue07wTB4aTWXtyTRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b74b210463d825e9e946599a6db107aa04e2013a9f91a98497359f8f8e5d56c5","last_reissued_at":"2026-07-05T06:45:03.932616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:45:03.932616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ISR-LLM: Iterative Self-Refined Large Language Model for Long-Horizon Sequential Task Planning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Jiayang Song, Kunpeng Yao, Lei Ma, Zhan Shu, Zhehua Zhou","submitted_at":"2023-08-26T01:31:35Z","abstract_excerpt":"Motivated by the substantial achievements observed in Large Language Models (LLMs) in the field of natural language processing, recent research has commenced investigations into the application of LLMs for complex, long-horizon sequential task planning challenges in robotics. LLMs are advantageous in offering the potential to enhance the generalizability as task-agnostic planners and facilitate flexible interaction between human instructors and planning systems. However, task plans generated by LLMs often lack feasibility and correctness. To address this challenge, we introduce ISR-LLM, a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13724","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/2308.13724/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":"2308.13724","created_at":"2026-07-05T06:45:03.932676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13724v1","created_at":"2026-07-05T06:45:03.932676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13724","created_at":"2026-07-05T06:45:03.932676+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5FSCBDD3AS6","created_at":"2026-07-05T06:45:03.932676+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5FSCBDD3AS6T2KG","created_at":"2026-07-05T06:45:03.932676+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5FSCBDD","created_at":"2026-07-05T06:45:03.932676+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2304.11477","citing_title":"LLM+P: Empowering Large Language Models with Optimal Planning Proficiency","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI","json":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI.json","graph_json":"https://pith.science/api/pith-number/W5FSCBDD3AS6T2KGLGNG3MIHVI/graph.json","events_json":"https://pith.science/api/pith-number/W5FSCBDD3AS6T2KGLGNG3MIHVI/events.json","paper":"https://pith.science/paper/W5FSCBDD"},"agent_actions":{"view_html":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI","download_json":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI.json","view_paper":"https://pith.science/paper/W5FSCBDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13724&json=true","fetch_graph":"https://pith.science/api/pith-number/W5FSCBDD3AS6T2KGLGNG3MIHVI/graph.json","fetch_events":"https://pith.science/api/pith-number/W5FSCBDD3AS6T2KGLGNG3MIHVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI/action/storage_attestation","attest_author":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI/action/author_attestation","sign_citation":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI/action/citation_signature","submit_replication":"https://pith.science/pith/W5FSCBDD3AS6T2KGLGNG3MIHVI/action/replication_record"}},"created_at":"2026-07-05T06:45:03.932676+00:00","updated_at":"2026-07-05T06:45:03.932676+00:00"}