{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WGL4EKGJNQWTQJMFGKDBTBIYIS","short_pith_number":"pith:WGL4EKGJ","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"},"canonical_sha256":"b197c228c96c2d382585328619851844ac359f32c47467e6aab8a0087c391683","source":{"kind":"arxiv","id":"1601.06733","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06733","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06733v7","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06733","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"WGL4EKGJNQWT","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WGL4EKGJNQWTQJMF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WGL4EKGJ","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WGL4EKGJNQWTQJMFGKDBTBIYIS","target":"record","payload":{"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"},"canonical_sha256":"b197c228c96c2d382585328619851844ac359f32c47467e6aab8a0087c391683","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"},"source_kind":"arxiv","source_id":"1601.06733","source_version":7,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4cR2pl5NBM3d0Zg2EqcyFAfFG0Qzo3ykMRCSEkkbY4ejBGTE6UFdRVkQIdQcnN0U2nDrWBnHpCqxt1kTUzkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:58:26.450941Z"},"content_sha256":"a10384256ad124c8e249b52dc9153e5db8447c19c766b4dd1c329d4db4cecc40","schema_version":"1.0","event_id":"sha256:a10384256ad124c8e249b52dc9153e5db8447c19c766b4dd1c329d4db4cecc40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WGL4EKGJNQWTQJMFGKDBTBIYIS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OQYKg8AbqtNeYm24MuGbuA7dY0ufaHdUu22cAKG8NIcSKA8Tc+o6rVVUD8VuIHeRJAU0mgBq6fvS8/ffEQaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:58:26.451283Z"},"content_sha256":"b4fc58ae5e9ed437403677d5298a764a0bb564f574037eed52535c735710c18f","schema_version":"1.0","event_id":"sha256:b4fc58ae5e9ed437403677d5298a764a0bb564f574037eed52535c735710c18f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/bundle.json","state_url":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T09:58:26Z","links":{"resolver":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS","bundle":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/bundle.json","state":"https://pith.science/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGL4EKGJNQWTQJMFGKDBTBIYIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WGL4EKGJNQWTQJMFGKDBTBIYIS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5c6f65c5f073005ea78f29766246b77c75f826093722cfa941ee4286403c3dae","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-25T19:25:48Z","title_canon_sha256":"6b8e10a76ca94f69b1997834823daafd43df03fb668686d319202d82857439d3"},"schema_version":"1.0","source":{"id":"1601.06733","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06733","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06733v7","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06733","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"WGL4EKGJNQWT","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WGL4EKGJNQWTQJMF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WGL4EKGJ","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:b4fc58ae5e9ed437403677d5298a764a0bb564f574037eed52535c735710c18f","target":"graph","created_at":"2026-05-18T01:04:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Jianpeng Cheng, Li Dong, Mirella Lapata","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-25T19:25:48Z","title":"Long Short-Term Memory-Networks for Machine Reading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06733","kind":"arxiv","version":7},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a10384256ad124c8e249b52dc9153e5db8447c19c766b4dd1c329d4db4cecc40","target":"record","created_at":"2026-05-18T01:04:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5c6f65c5f073005ea78f29766246b77c75f826093722cfa941ee4286403c3dae","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-25T19:25:48Z","title_canon_sha256":"6b8e10a76ca94f69b1997834823daafd43df03fb668686d319202d82857439d3"},"schema_version":"1.0","source":{"id":"1601.06733","kind":"arxiv","version":7}},"canonical_sha256":"b197c228c96c2d382585328619851844ac359f32c47467e6aab8a0087c391683","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b197c228c96c2d382585328619851844ac359f32c47467e6aab8a0087c391683","first_computed_at":"2026-05-18T01:04:09.283684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:09.283684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BFhgNxp4EJdK5ryZd4OM8lbqi8uzg7QQBtl+NTFF9UyTv6myNQlI2qfJGXDDS1QVqS6nA192EuWdaNiJ+bP+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:09.284331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06733","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a10384256ad124c8e249b52dc9153e5db8447c19c766b4dd1c329d4db4cecc40","sha256:b4fc58ae5e9ed437403677d5298a764a0bb564f574037eed52535c735710c18f"],"state_sha256":"0506abbc6cacd99b9e3fc8014b02fdebe0f4e7c7c96967f24f83b10c1b3a1140"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vN8ODE70B9P872veYeLFs92bJ1ybAF3dh5AUKC3ccKivAKfAF2KNNCvSIPfGNKxszOq7dDgNitP1o/bhMm5EBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:58:26.453127Z","bundle_sha256":"27130f55092d8c2d5ea9c81eb6745ad78af5c74391510797381a761fd8eb7ad4"}}