{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YHEG6MS47DBFVGTH2Z6ZMVIXBC","short_pith_number":"pith:YHEG6MS4","schema_version":"1.0","canonical_sha256":"c1c86f325cf8c25a9a67d67d965517088430cfca0ef31403ce68b96925d21633","source":{"kind":"arxiv","id":"2608.05466","version":1},"attestation_state":"computed","paper":{"title":"Recursive Synthesis for Long-Horizon Terminal Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Anhao Li, Haitao Mi, Junyao Yang, Lei Ke, Leowei Liang, Ninghao Liu, Ruhan Wang, Yucheng Shi, Zhongzhi Li, Zixun Huang, Zongxia Li","submitted_at":"2026-08-05T23:24:26Z","abstract_excerpt":"High-quality long-horizon training data for terminal agents is expensive to produce, often costing hundreds to thousands of dollars per task, because each task must keep the instruction, environment, reference solution, and verifier mutually consistent. Human authoring does not scale, and direct generation with large language models (LLMs) often breaks these dependencies. We present Recursive Synthetic Terminal Tasks (RST), a recursive verified synthesis framework for constructing long-horizon terminal-agent tasks at scale. Starting from verified seed tasks, RST extends the reference solution,"},"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":"2608.05466","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-05T23:24:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"445c5776286145a11efb1d4c2e1c26a211f33921233b2c2b477926d6708e91aa","abstract_canon_sha256":"f5cc0beb583e3629e1e8d7ad5f6424e1e584b8ab9395b0befce62a3dd337537a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:47:55.118763Z","signature_b64":"xmXGc276hrPZ5nLkVD+jVVorNYF+jMNBn3DeIr2Vme0dhRAty1bcRZdvAME1cbeTmo4pUbySdqKkzIGYS9InCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1c86f325cf8c25a9a67d67d965517088430cfca0ef31403ce68b96925d21633","last_reissued_at":"2026-08-07T00:47:55.117103Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:47:55.117103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Synthesis for Long-Horizon Terminal Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Anhao Li, Haitao Mi, Junyao Yang, Lei Ke, Leowei Liang, Ninghao Liu, Ruhan Wang, Yucheng Shi, Zhongzhi Li, Zixun Huang, Zongxia Li","submitted_at":"2026-08-05T23:24:26Z","abstract_excerpt":"High-quality long-horizon training data for terminal agents is expensive to produce, often costing hundreds to thousands of dollars per task, because each task must keep the instruction, environment, reference solution, and verifier mutually consistent. Human authoring does not scale, and direct generation with large language models (LLMs) often breaks these dependencies. We present Recursive Synthetic Terminal Tasks (RST), a recursive verified synthesis framework for constructing long-horizon terminal-agent tasks at scale. Starting from verified seed tasks, RST extends the reference solution,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05466","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/2608.05466/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":"2608.05466","created_at":"2026-08-07T00:47:55.118441+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.05466v1","created_at":"2026-08-07T00:47:55.118441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05466","created_at":"2026-08-07T00:47:55.118441+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHEG6MS47DBF","created_at":"2026-08-07T00:47:55.118441+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHEG6MS47DBFVGTH","created_at":"2026-08-07T00:47:55.118441+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHEG6MS4","created_at":"2026-08-07T00:47:55.118441+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC","json":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC.json","graph_json":"https://pith.science/api/pith-number/YHEG6MS47DBFVGTH2Z6ZMVIXBC/graph.json","events_json":"https://pith.science/api/pith-number/YHEG6MS47DBFVGTH2Z6ZMVIXBC/events.json","paper":"https://pith.science/paper/YHEG6MS4"},"agent_actions":{"view_html":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC","download_json":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC.json","view_paper":"https://pith.science/paper/YHEG6MS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.05466&json=true","fetch_graph":"https://pith.science/api/pith-number/YHEG6MS47DBFVGTH2Z6ZMVIXBC/graph.json","fetch_events":"https://pith.science/api/pith-number/YHEG6MS47DBFVGTH2Z6ZMVIXBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC/action/storage_attestation","attest_author":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC/action/author_attestation","sign_citation":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC/action/citation_signature","submit_replication":"https://pith.science/pith/YHEG6MS47DBFVGTH2Z6ZMVIXBC/action/replication_record"}},"created_at":"2026-08-07T00:47:55.118441+00:00","updated_at":"2026-08-07T00:47:55.118441+00:00"}