{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EASO7XMPIL7PYLF5C4EUWHOABR","short_pith_number":"pith:EASO7XMP","schema_version":"1.0","canonical_sha256":"2024efdd8f42fefc2cbd17094b1dc00c5a5daac2d076521dcf74e31c66ca7b5d","source":{"kind":"arxiv","id":"2508.07421","version":1},"attestation_state":"computed","paper":{"title":"Triple-S: A Collaborative Multi-LLM Framework for Solving Long-Horizon Implicative Tasks in Robotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fashe Li, Hexiao Li, Hongbin Gao, Jiqiang Liu, Qinghua Liu, Zixi Jia","submitted_at":"2025-08-10T16:33:32Z","abstract_excerpt":"Leveraging Large Language Models (LLMs) to write policy code for controlling robots has gained significant attention. However, in long-horizon implicative tasks, this approach often results in API parameter, comments and sequencing errors, leading to task failure. To address this problem, we propose a collaborative Triple-S framework that involves multiple LLMs. Through In-Context Learning, different LLMs assume specific roles in a closed-loop Simplification-Solution-Summary process, effectively improving success rates and robustness in long-horizon implicative tasks. Additionally, a novel dem"},"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":"2508.07421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-08-10T16:33:32Z","cross_cats_sorted":[],"title_canon_sha256":"a048ca789eefde783fa56eac65777c4ca81d1328abe4840f89fdd1abc567525a","abstract_canon_sha256":"cf1535d121457354b1dd0207a2768eff8caffbfea24c07e2dcb0c1cea4257146"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:45.996500Z","signature_b64":"XKSdeDEG5sP5HkK3orfUPBXTPqE+Li6eiRI4edPq2if1Mrp641gmOjNw29SFiqA+LvhGCl/u1389Faq98CrmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2024efdd8f42fefc2cbd17094b1dc00c5a5daac2d076521dcf74e31c66ca7b5d","last_reissued_at":"2026-07-05T11:51:45.996018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:45.996018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triple-S: A Collaborative Multi-LLM Framework for Solving Long-Horizon Implicative Tasks in Robotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fashe Li, Hexiao Li, Hongbin Gao, Jiqiang Liu, Qinghua Liu, Zixi Jia","submitted_at":"2025-08-10T16:33:32Z","abstract_excerpt":"Leveraging Large Language Models (LLMs) to write policy code for controlling robots has gained significant attention. However, in long-horizon implicative tasks, this approach often results in API parameter, comments and sequencing errors, leading to task failure. To address this problem, we propose a collaborative Triple-S framework that involves multiple LLMs. Through In-Context Learning, different LLMs assume specific roles in a closed-loop Simplification-Solution-Summary process, effectively improving success rates and robustness in long-horizon implicative tasks. Additionally, a novel dem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07421","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/2508.07421/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":"2508.07421","created_at":"2026-07-05T11:51:45.996076+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.07421v1","created_at":"2026-07-05T11:51:45.996076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07421","created_at":"2026-07-05T11:51:45.996076+00:00"},{"alias_kind":"pith_short_12","alias_value":"EASO7XMPIL7P","created_at":"2026-07-05T11:51:45.996076+00:00"},{"alias_kind":"pith_short_16","alias_value":"EASO7XMPIL7PYLF5","created_at":"2026-07-05T11:51:45.996076+00:00"},{"alias_kind":"pith_short_8","alias_value":"EASO7XMP","created_at":"2026-07-05T11:51:45.996076+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25404","citing_title":"HEART: Coordination of Heterogeneous Expert Agents for Physically Grounded Robotic Task Planning","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR","json":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR.json","graph_json":"https://pith.science/api/pith-number/EASO7XMPIL7PYLF5C4EUWHOABR/graph.json","events_json":"https://pith.science/api/pith-number/EASO7XMPIL7PYLF5C4EUWHOABR/events.json","paper":"https://pith.science/paper/EASO7XMP"},"agent_actions":{"view_html":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR","download_json":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR.json","view_paper":"https://pith.science/paper/EASO7XMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.07421&json=true","fetch_graph":"https://pith.science/api/pith-number/EASO7XMPIL7PYLF5C4EUWHOABR/graph.json","fetch_events":"https://pith.science/api/pith-number/EASO7XMPIL7PYLF5C4EUWHOABR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR/action/storage_attestation","attest_author":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR/action/author_attestation","sign_citation":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR/action/citation_signature","submit_replication":"https://pith.science/pith/EASO7XMPIL7PYLF5C4EUWHOABR/action/replication_record"}},"created_at":"2026-07-05T11:51:45.996076+00:00","updated_at":"2026-07-05T11:51:45.996076+00:00"}