{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WGL4EKGJNQWTQJMFGKDBTBIYIS","short_pith_number":"pith:WGL4EKGJ","schema_version":"1.0","canonical_sha256":"b197c228c96c2d382585328619851844ac359f32c47467e6aab8a0087c391683","source":{"kind":"arxiv","id":"1601.06733","version":7},"attestation_state":"computed","paper":{"title":"Long Short-Term Memory-Networks for Machine Reading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CL","authors_text":"Jianpeng Cheng, Li Dong, Mirella Lapata","submitted_at":"2016-01-25T19:25:48Z","abstract_excerpt":"In this paper we address the question of how to render sequence-level networks better at handling structured input. We propose a machine reading simulator which processes text incrementally from left to right and performs shallow reasoning with memory and attention. The reader extends the Long Short-Term Memory architecture with a memory network in place of a single memory cell. This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens. The system is initially designed to process a single sequence but we also demonstrate "},"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":"1601.06733","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-25T19:25:48Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6b8e10a76ca94f69b1997834823daafd43df03fb668686d319202d82857439d3","abstract_canon_sha256":"5c6f65c5f073005ea78f29766246b77c75f826093722cfa941ee4286403c3dae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.284331Z","signature_b64":"BFhgNxp4EJdK5ryZd4OM8lbqi8uzg7QQBtl+NTFF9UyTv6myNQlI2qfJGXDDS1QVqS6nA192EuWdaNiJ+bP+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b197c228c96c2d382585328619851844ac359f32c47467e6aab8a0087c391683","last_reissued_at":"2026-05-18T01:04:09.283684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.283684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long Short-Term Memory-Networks for Machine Reading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CL","authors_text":"Jianpeng Cheng, Li Dong, Mirella Lapata","submitted_at":"2016-01-25T19:25:48Z","abstract_excerpt":"In this paper we address the question of how to render sequence-level networks better at handling structured input. We propose a machine reading simulator which processes text incrementally from left to right and performs shallow reasoning with memory and attention. The reader extends the Long Short-Term Memory architecture with a memory network in place of a single memory cell. This enables adaptive memory usage during recurrence with neural attention, offering a way to weakly induce relations among tokens. The system is initially designed to process a single sequence but we also demonstrate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06733","kind":"arxiv","version":7},"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":"1601.06733","created_at":"2026-05-18T01:04:09.283773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.06733v7","created_at":"2026-05-18T01:04:09.283773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06733","created_at":"2026-05-18T01:04:09.283773+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGL4EKGJNQWT","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGL4EKGJNQWTQJMF","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGL4EKGJ","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1907.02226","citing_title":"Graph-based Knowledge Distillation by Multi-head Attention Network","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2412.20091","citing_title":"Gamma-Ray Burst Light Curve Reconstruction: A Comparative Machine and Deep Learning Analysis","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2308.08089","citing_title":"DragNUWA: Fine-grained Control in Video Generation by Integrating Text, Image, and Trajectory","ref_index":140,"is_internal_anchor":true},{"citing_arxiv_id":"2507.15774","citing_title":"Time Series Forecasting Through the Lens of Dynamics","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"1611.09268","citing_title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"1910.10683","citing_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"1609.07843","citing_title":"Pointer Sentinel Mixture Models","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"1710.10903","citing_title":"Graph Attention Networks","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"1706.03762","citing_title":"Attention Is All You Need","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS","json":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS.json","graph_json":"https://pith.science/api/pith-number/WGL4EKGJNQWTQJMFGKDBTBIYIS/graph.json","events_json":"https://pith.science/api/pith-number/WGL4EKGJNQWTQJMFGKDBTBIYIS/events.json","paper":"https://pith.science/paper/WGL4EKGJ"},"agent_actions":{"view_html":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS","download_json":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS.json","view_paper":"https://pith.science/paper/WGL4EKGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.06733&json=true","fetch_graph":"https://pith.science/api/pith-number/WGL4EKGJNQWTQJMFGKDBTBIYIS/graph.json","fetch_events":"https://pith.science/api/pith-number/WGL4EKGJNQWTQJMFGKDBTBIYIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/action/storage_attestation","attest_author":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/action/author_attestation","sign_citation":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/action/citation_signature","submit_replication":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/action/replication_record"}},"created_at":"2026-05-18T01:04:09.283773+00:00","updated_at":"2026-05-18T01:04:09.283773+00:00"}