{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2ENUI3RBQOLQPP2CL5AVW7LU7D","short_pith_number":"pith:2ENUI3RB","schema_version":"1.0","canonical_sha256":"d11b446e21839707bf425f415b7d74f8fc77e5740e3c299cb9d61b0d605aacb2","source":{"kind":"arxiv","id":"2210.06774","version":3},"attestation_state":"computed","paper":{"title":"Re3: Generating Longer Stories With Recursive Reprompting and Revision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dan Klein, Kevin Yang, Nanyun Peng, Yuandong Tian","submitted_at":"2022-10-13T06:29:57Z","abstract_excerpt":"We consider the problem of automatically generating longer stories of over two thousand words. Compared to prior work on shorter stories, long-range plot coherence and relevance are more central challenges here. We propose the Recursive Reprompting and Revision framework (Re3) to address these challenges by (a) prompting a general-purpose language model to construct a structured overarching plan, and (b) generating story passages by repeatedly injecting contextual information from both the plan and current story state into a language model prompt. We then revise by (c) reranking different cont"},"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":"2210.06774","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-13T06:29:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a5000e202631c850c96cd0e35dbe7fe5e81fd752679bd03b31de2651477c36fa","abstract_canon_sha256":"eef9114f00eff7d288a29c5dfcd2ef4600afcd06a75665e0798d1f4ef414c0f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:22.869514Z","signature_b64":"rGT2smQ9jS3xRm3qxlwA3SB/ngE4Fb3zGS+ELbaPgX/TJK7Ud/EsDup1QBMEZcFepGQWBVhdqaUPdq/YFGJJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d11b446e21839707bf425f415b7d74f8fc77e5740e3c299cb9d61b0d605aacb2","last_reissued_at":"2026-07-05T05:09:22.868990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:22.868990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Re3: Generating Longer Stories With Recursive Reprompting and Revision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dan Klein, Kevin Yang, Nanyun Peng, Yuandong Tian","submitted_at":"2022-10-13T06:29:57Z","abstract_excerpt":"We consider the problem of automatically generating longer stories of over two thousand words. Compared to prior work on shorter stories, long-range plot coherence and relevance are more central challenges here. We propose the Recursive Reprompting and Revision framework (Re3) to address these challenges by (a) prompting a general-purpose language model to construct a structured overarching plan, and (b) generating story passages by repeatedly injecting contextual information from both the plan and current story state into a language model prompt. We then revise by (c) reranking different cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06774","kind":"arxiv","version":3},"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/2210.06774/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":"2210.06774","created_at":"2026-07-05T05:09:22.869054+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06774v3","created_at":"2026-07-05T05:09:22.869054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06774","created_at":"2026-07-05T05:09:22.869054+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ENUI3RBQOLQ","created_at":"2026-07-05T05:09:22.869054+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ENUI3RBQOLQPP2C","created_at":"2026-07-05T05:09:22.869054+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ENUI3RB","created_at":"2026-07-05T05:09:22.869054+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17391","citing_title":"NarrativeWorldBench: A Frontier-Saturated Benchmark and a Latent World Model for Long-Horizon Co-Creative Audio Drama","ref_index":16,"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":1,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00918","citing_title":"From Personas to Plot: Character-Grounded Multi-Agent Story Generation for Long-Form Narratives","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2403.07974","citing_title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","ref_index":153,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14518","citing_title":"Mind DeepResearch Technical Report","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D","json":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D.json","graph_json":"https://pith.science/api/pith-number/2ENUI3RBQOLQPP2CL5AVW7LU7D/graph.json","events_json":"https://pith.science/api/pith-number/2ENUI3RBQOLQPP2CL5AVW7LU7D/events.json","paper":"https://pith.science/paper/2ENUI3RB"},"agent_actions":{"view_html":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D","download_json":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D.json","view_paper":"https://pith.science/paper/2ENUI3RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06774&json=true","fetch_graph":"https://pith.science/api/pith-number/2ENUI3RBQOLQPP2CL5AVW7LU7D/graph.json","fetch_events":"https://pith.science/api/pith-number/2ENUI3RBQOLQPP2CL5AVW7LU7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D/action/storage_attestation","attest_author":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D/action/author_attestation","sign_citation":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D/action/citation_signature","submit_replication":"https://pith.science/pith/2ENUI3RBQOLQPP2CL5AVW7LU7D/action/replication_record"}},"created_at":"2026-07-05T05:09:22.869054+00:00","updated_at":"2026-07-05T05:09:22.869054+00:00"}