{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LWQ2KFMZVAWCVRXAGQI5SD6D5L","short_pith_number":"pith:LWQ2KFMZ","schema_version":"1.0","canonical_sha256":"5da1a51599a82c2ac6e03411d90fc3eacd4870f61836a7ab56b333e42736e077","source":{"kind":"arxiv","id":"1811.05701","version":3},"attestation_state":"computed","paper":{"title":"Plan-And-Write: Towards Better Automatic Storytelling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dongyan Zhao, Kevin Knight, Lili Yao, Nanyun Peng, Ralph Weischedel, Rui Yan","submitted_at":"2018-11-14T09:37:40Z","abstract_excerpt":"Automatic storytelling is challenging since it requires generating long, coherent natural language to describes a sensible sequence of events. Despite considerable efforts on automatic story generation in the past, prior work either is restricted in plot planning, or can only generate stories in a narrow domain. In this paper, we explore open-domain story generation that writes stories given a title (topic) as input. We propose a plan-and-write hierarchical generation framework that first plans a storyline, and then generates a story based on the storyline. We compare two planning strategies. "},"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":"1811.05701","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2018-11-14T09:37:40Z","cross_cats_sorted":[],"title_canon_sha256":"a4edc687df75e8bfc0ed61823e8437d84f895545f699cd4f73df7416c4f8c7f2","abstract_canon_sha256":"3fd3ac35630644f530de76bf82e17bd6aae6834a9ed6f7fc2562842584c10597"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:41.554783Z","signature_b64":"AARlwbyFio/FlQA4vwwnOgxZH1n9WcoismYGdstxZIw7A8A51Do3bBt1c6XOP6n5aPP0kIacqTZ59d8FVPS4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da1a51599a82c2ac6e03411d90fc3eacd4870f61836a7ab56b333e42736e077","last_reissued_at":"2026-05-17T23:53:41.554331Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:41.554331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plan-And-Write: Towards Better Automatic Storytelling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dongyan Zhao, Kevin Knight, Lili Yao, Nanyun Peng, Ralph Weischedel, Rui Yan","submitted_at":"2018-11-14T09:37:40Z","abstract_excerpt":"Automatic storytelling is challenging since it requires generating long, coherent natural language to describes a sensible sequence of events. Despite considerable efforts on automatic story generation in the past, prior work either is restricted in plot planning, or can only generate stories in a narrow domain. In this paper, we explore open-domain story generation that writes stories given a title (topic) as input. We propose a plan-and-write hierarchical generation framework that first plans a storyline, and then generates a story based on the storyline. We compare two planning strategies. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05701","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":""},"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":"1811.05701","created_at":"2026-05-17T23:53:41.554411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05701v3","created_at":"2026-05-17T23:53:41.554411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05701","created_at":"2026-05-17T23:53:41.554411+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWQ2KFMZVAWC","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWQ2KFMZVAWCVRXA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWQ2KFMZ","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.08259","citing_title":"WriterForcing: Generating more interesting story endings","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2506.18841","citing_title":"LongWriter-Zero: Mastering Ultra-Long Text Generation via Reinforcement Learning","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L","json":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L.json","graph_json":"https://pith.science/api/pith-number/LWQ2KFMZVAWCVRXAGQI5SD6D5L/graph.json","events_json":"https://pith.science/api/pith-number/LWQ2KFMZVAWCVRXAGQI5SD6D5L/events.json","paper":"https://pith.science/paper/LWQ2KFMZ"},"agent_actions":{"view_html":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L","download_json":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L.json","view_paper":"https://pith.science/paper/LWQ2KFMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05701&json=true","fetch_graph":"https://pith.science/api/pith-number/LWQ2KFMZVAWCVRXAGQI5SD6D5L/graph.json","fetch_events":"https://pith.science/api/pith-number/LWQ2KFMZVAWCVRXAGQI5SD6D5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L/action/storage_attestation","attest_author":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L/action/author_attestation","sign_citation":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L/action/citation_signature","submit_replication":"https://pith.science/pith/LWQ2KFMZVAWCVRXAGQI5SD6D5L/action/replication_record"}},"created_at":"2026-05-17T23:53:41.554411+00:00","updated_at":"2026-05-17T23:53:41.554411+00:00"}