{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NE6SQSZADTT5QRGWOO4Y32UNNR","short_pith_number":"pith:NE6SQSZA","schema_version":"1.0","canonical_sha256":"693d284b201ce7d844d673b98dea8d6c737405779af0d303a3d5f10b10885a5c","source":{"kind":"arxiv","id":"2305.13304","version":1},"attestation_state":"computed","paper":{"title":"RecurrentGPT: Interactive Generation of (Arbitrarily) Long Text","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Mrinmaya Sachan, Peng Cui, Ryan Cotterell, Tiannan Wang, Wangchunshu Zhou, Yifan Hou, Yuchen Eleanor Jiang, Zhenxin Xiao","submitted_at":"2023-05-22T17:58:10Z","abstract_excerpt":"The fixed-size context of Transformer makes GPT models incapable of generating arbitrarily long text. In this paper, we introduce RecurrentGPT, a language-based simulacrum of the recurrence mechanism in RNNs. RecurrentGPT is built upon a large language model (LLM) such as ChatGPT and uses natural language to simulate the Long Short-Term Memory mechanism in an LSTM. At each timestep, RecurrentGPT generates a paragraph of text and updates its language-based long-short term memory stored on the hard drive and the prompt, respectively. This recurrence mechanism enables RecurrentGPT to generate tex"},"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":"2305.13304","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-22T17:58:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f84e1672592def142a3a0983d7270fc81a40341f3875828af598fd8d282f0ebb","abstract_canon_sha256":"a1e2008476a3f7c4aff5d2d6501404ed6924f237db6ce3e50790005942f2d52d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:28.833677Z","signature_b64":"tcmB0AmOpa8gu1hQRxtand4jKIgfZ0+tzWzFM2gEoPqEwGw0rl4WIgXzHGDcJi+FIFl9kxGulzzGwKAy7hnfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"693d284b201ce7d844d673b98dea8d6c737405779af0d303a3d5f10b10885a5c","last_reissued_at":"2026-07-05T06:12:28.833238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:28.833238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RecurrentGPT: Interactive Generation of (Arbitrarily) Long Text","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Mrinmaya Sachan, Peng Cui, Ryan Cotterell, Tiannan Wang, Wangchunshu Zhou, Yifan Hou, Yuchen Eleanor Jiang, Zhenxin Xiao","submitted_at":"2023-05-22T17:58:10Z","abstract_excerpt":"The fixed-size context of Transformer makes GPT models incapable of generating arbitrarily long text. In this paper, we introduce RecurrentGPT, a language-based simulacrum of the recurrence mechanism in RNNs. RecurrentGPT is built upon a large language model (LLM) such as ChatGPT and uses natural language to simulate the Long Short-Term Memory mechanism in an LSTM. At each timestep, RecurrentGPT generates a paragraph of text and updates its language-based long-short term memory stored on the hard drive and the prompt, respectively. This recurrence mechanism enables RecurrentGPT to generate tex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13304","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/2305.13304/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":"2305.13304","created_at":"2026-07-05T06:12:28.833293+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.13304v1","created_at":"2026-07-05T06:12:28.833293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13304","created_at":"2026-07-05T06:12:28.833293+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE6SQSZADTT5","created_at":"2026-07-05T06:12:28.833293+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE6SQSZADTT5QRGW","created_at":"2026-07-05T06:12:28.833293+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE6SQSZA","created_at":"2026-07-05T06:12:28.833293+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22385","citing_title":"MetaPS: Adaptive Programmatic Strategy Selection for Market Agents","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18874","citing_title":"Externalizing Research Synthesis and Validation in AI Scientists through a Research Harness","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01523","citing_title":"Multi-Head Recurrent Memory Agents","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09125","citing_title":"Unveiling Privacy Risks in Multi-modal Large Language Models: Task-specific Vulnerabilities and Mitigation Challenges","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04536","citing_title":"Scaling Self-Evolving Agents via Parametric Memory","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29522","citing_title":"DeepSurvey: Enhancing Analytical Depth and Citation Reliability in Automated Survey Generation","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17625","citing_title":"Episodic-Semantic Memory Architecture for Long-Horizon Scientific Agents","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2308.14508","citing_title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","ref_index":135,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08646","citing_title":"PAAC: Privacy-Aware Agentic Device-Cloud Collaboration","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07325","citing_title":"CSR: Infinite-Horizon Real-Time Policies with Massive Cached State Representations","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07462","citing_title":"The Moltbook Files: A Harmless Slopocalypse or Humanity's Last Experiment","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR","json":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR.json","graph_json":"https://pith.science/api/pith-number/NE6SQSZADTT5QRGWOO4Y32UNNR/graph.json","events_json":"https://pith.science/api/pith-number/NE6SQSZADTT5QRGWOO4Y32UNNR/events.json","paper":"https://pith.science/paper/NE6SQSZA"},"agent_actions":{"view_html":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR","download_json":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR.json","view_paper":"https://pith.science/paper/NE6SQSZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.13304&json=true","fetch_graph":"https://pith.science/api/pith-number/NE6SQSZADTT5QRGWOO4Y32UNNR/graph.json","fetch_events":"https://pith.science/api/pith-number/NE6SQSZADTT5QRGWOO4Y32UNNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR/action/storage_attestation","attest_author":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR/action/author_attestation","sign_citation":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR/action/citation_signature","submit_replication":"https://pith.science/pith/NE6SQSZADTT5QRGWOO4Y32UNNR/action/replication_record"}},"created_at":"2026-07-05T06:12:28.833293+00:00","updated_at":"2026-07-05T06:12:28.833293+00:00"}