{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M6GEKWLMVF6OH5VT7H5TP2NIUX","short_pith_number":"pith:M6GEKWLM","schema_version":"1.0","canonical_sha256":"678c45596ca97ce3f6b3f9fb37e9a8a5e6e6ea96013a28529553ef71cb6e54aa","source":{"kind":"arxiv","id":"1308.0850","version":5},"attestation_state":"computed","paper":{"title":"Generating Sequences With Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.NE","authors_text":"Alex Graves","submitted_at":"2013-08-04T21:04:36Z","abstract_excerpt":"This paper shows how Long Short-term Memory recurrent neural networks can be used to generate complex sequences with long-range structure, simply by predicting one data point at a time. The approach is demonstrated for text (where the data are discrete) and online handwriting (where the data are real-valued). It is then extended to handwriting synthesis by allowing the network to condition its predictions on a text sequence. The resulting system is able to generate highly realistic cursive handwriting in a wide variety of styles."},"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":"1308.0850","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2013-08-04T21:04:36Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7bd031586d75a9d5646dc510bb8d5f8a9cc59f197b8f0d293a808b3f3536c976","abstract_canon_sha256":"453be324a8d9e9af39f5787edc4963af391a4781789a290cf4e9ef2e9aea4602"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:24.356240Z","signature_b64":"DFosR3bWsEb1UUo/xWMJz4wGH8tB21YsVjW17D+H19zaSA7BXNA0y1GpGGPgw5mSKbUwCa3R980J8o6wXBvHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"678c45596ca97ce3f6b3f9fb37e9a8a5e6e6ea96013a28529553ef71cb6e54aa","last_reissued_at":"2026-05-18T02:50:24.355787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:24.355787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Sequences With Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.NE","authors_text":"Alex Graves","submitted_at":"2013-08-04T21:04:36Z","abstract_excerpt":"This paper shows how Long Short-term Memory recurrent neural networks can be used to generate complex sequences with long-range structure, simply by predicting one data point at a time. The approach is demonstrated for text (where the data are discrete) and online handwriting (where the data are real-valued). It is then extended to handwriting synthesis by allowing the network to condition its predictions on a text sequence. The resulting system is able to generate highly realistic cursive handwriting in a wide variety of styles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0850","kind":"arxiv","version":5},"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":"1308.0850","created_at":"2026-05-18T02:50:24.355866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0850v5","created_at":"2026-05-18T02:50:24.355866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0850","created_at":"2026-05-18T02:50:24.355866+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6GEKWLMVF6O","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6GEKWLMVF6OH5VT","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6GEKWLM","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":37,"internal_anchor_count":21,"sample":[{"citing_arxiv_id":"1906.09003","citing_title":"Connectivity-Optimized Representation Learning via Persistent Homology","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"1906.12264","citing_title":"Accurate Robotic Pouring for Serving Drinks","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"1906.09808","citing_title":"Recurrent Adversarial Service Times","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"1907.00455","citing_title":"Multiplicative Models for Recurrent Language Modeling","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"1907.02649","citing_title":"A Unified Framework of Online Learning Algorithms for Training Recurrent Neural Networks","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06876","citing_title":"Separable Convolutional LSTMs for Faster Video Segmentation","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08040","citing_title":"Convolutional Reservoir Computing for World Models","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08752","citing_title":"RobustTP: End-to-End Trajectory Prediction for Heterogeneous Road-Agents in Dense Traffic with Noisy Sensor Inputs","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"1907.11848","citing_title":"Recurrent Neural Networks with Long Term Temporal Dependencies in Machine Tool Wear Diagnosis and Prognosis","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2410.24116","citing_title":"AIDOVECL: AI-generated Dataset of Outpainted Vehicles for Eye-level Classification and Localization","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2503.22693","citing_title":"Bridging Language Models and Financial Analysis","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2511.02610","citing_title":"Towards Migrating Neural Network Implementations","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20892","citing_title":"FruitEnsemble: MLLM-Guided Arbitration for Heterogeneous ensemble in Fine-Grained Fruit Recognition","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21058","citing_title":"A Dialogue between Causal and Traditional Representation Learning: Toward Mutual Benefits in a Unified Formulation","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17187","citing_title":"PluRule: A Benchmark for Moderating Pluralistic Communities on Social Media","ref_index":248,"is_internal_anchor":true},{"citing_arxiv_id":"2507.12720","citing_title":"FLEXITOKENS: Flexible Tokenization for Evolving Language Models","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2508.07876","citing_title":"Stochastic dynamics learning with state-space systems","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"1911.05507","citing_title":"Compressive Transformers for Long-Range Sequence Modelling","ref_index":117,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05600","citing_title":"Generative Modeling by Estimating Gradients of the Data Distribution","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2112.04426","citing_title":"Improving language models by retrieving from trillions of tokens","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2107.14795","citing_title":"Perceiver IO: A General Architecture for Structured Inputs & Outputs","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02103","citing_title":"CASHG: Context-Aware Stylized Online Handwriting Generation","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"1807.03819","citing_title":"Universal Transformers","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"1410.5401","citing_title":"Neural Turing Machines","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX","json":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX.json","graph_json":"https://pith.science/api/pith-number/M6GEKWLMVF6OH5VT7H5TP2NIUX/graph.json","events_json":"https://pith.science/api/pith-number/M6GEKWLMVF6OH5VT7H5TP2NIUX/events.json","paper":"https://pith.science/paper/M6GEKWLM"},"agent_actions":{"view_html":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX","download_json":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX.json","view_paper":"https://pith.science/paper/M6GEKWLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0850&json=true","fetch_graph":"https://pith.science/api/pith-number/M6GEKWLMVF6OH5VT7H5TP2NIUX/graph.json","fetch_events":"https://pith.science/api/pith-number/M6GEKWLMVF6OH5VT7H5TP2NIUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX/action/storage_attestation","attest_author":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX/action/author_attestation","sign_citation":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX/action/citation_signature","submit_replication":"https://pith.science/pith/M6GEKWLMVF6OH5VT7H5TP2NIUX/action/replication_record"}},"created_at":"2026-05-18T02:50:24.355866+00:00","updated_at":"2026-05-18T02:50:24.355866+00:00"}