{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q","short_pith_number":"pith:6ZXSXVZZ","canonical_record":{"source":{"id":"1703.02620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-07T22:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"57a448b0815fcb56e21bdda6063edf9e4791162c89c7cddfada0df71f64cb1e7","abstract_canon_sha256":"768673a645d56fdd1e9ef1d94080c9c7768753e672b921462113fab9d9de647f"},"schema_version":"1.0"},"canonical_sha256":"f66f2bd739ced59d124ed0426eb32fe407fcfd10c9f4ecb47f2c6b8217c8170f","source":{"kind":"arxiv","id":"1703.02620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02620","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02620v1","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02620","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"6ZXSXVZZZ3KZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZXSXVZZZ3KZ2ESO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZXSXVZZ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-07T22:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"57a448b0815fcb56e21bdda6063edf9e4791162c89c7cddfada0df71f64cb1e7","abstract_canon_sha256":"768673a645d56fdd1e9ef1d94080c9c7768753e672b921462113fab9d9de647f"},"schema_version":"1.0"},"canonical_sha256":"f66f2bd739ced59d124ed0426eb32fe407fcfd10c9f4ecb47f2c6b8217c8170f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.023075Z","signature_b64":"+DHNIO/xROEz0NOF7Qjzn2TEnIOKVnKph+FdZPlW+rc/vXlALaaeIqp4y7ldpjV68f9CttubqHK+h33X+ZiWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f66f2bd739ced59d124ed0426eb32fe407fcfd10c9f4ecb47f2c6b8217c8170f","last_reissued_at":"2026-05-18T00:49:06.022686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.022686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02620","source_version":1,"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-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YNEaFVtwxZrFWB8I7JWwUvM2KHieS5affatCQC3vuMi7CxbUuZEG3w/p1G2Wo86xwvFVacmJjqNxlqaUhzoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:33:44.910836Z"},"content_sha256":"f575ae224321a214279b96e0291da1f7d5017081280381d06ac1b877034e8aec","schema_version":"1.0","event_id":"sha256:f575ae224321a214279b96e0291da1f7d5017081280381d06ac1b877034e8aec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linguistic Knowledge as Memory for Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bhuwan Dhingra, Ruslan Salakhutdinov, William W. Cohen, Zhilin Yang","submitted_at":"2017-03-07T22:13:17Z","abstract_excerpt":"Training recurrent neural networks to model long term dependencies is difficult. Hence, we propose to use external linguistic knowledge as an explicit signal to inform the model which memories it should utilize. Specifically, external knowledge is used to augment a sequence with typed edges between arbitrarily distant elements, and the resulting graph is decomposed into directed acyclic subgraphs. We introduce a model that encodes such graphs as explicit memory in recurrent neural networks, and use it to model coreference relations in text. We apply our model to several text comprehension task"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02620","kind":"arxiv","version":1},"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-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20HgePuYsE1iRaPjQfc6Qg43lzOV0QxGhX/WKkMG03OIACbZXbox0+LRRTWI8eco8qFi5K/xtLoPGgcDNqfbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:33:44.911522Z"},"content_sha256":"574090d2417fb244dd6c33422795500c69dbcf2ea2140f400c77833c74a6cf20","schema_version":"1.0","event_id":"sha256:574090d2417fb244dd6c33422795500c69dbcf2ea2140f400c77833c74a6cf20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q/bundle.json","state_url":"https://pith.science/pith/6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q/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-05-18T17:33:44Z","links":{"resolver":"https://pith.science/pith/6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q","bundle":"https://pith.science/pith/6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q/bundle.json","state":"https://pith.science/pith/6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6ZXSXVZZZ3KZ2ESO2BBG5MZP4Q","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":"768673a645d56fdd1e9ef1d94080c9c7768753e672b921462113fab9d9de647f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-07T22:13:17Z","title_canon_sha256":"57a448b0815fcb56e21bdda6063edf9e4791162c89c7cddfada0df71f64cb1e7"},"schema_version":"1.0","source":{"id":"1703.02620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02620","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02620v1","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02620","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"6ZXSXVZZZ3KZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZXSXVZZZ3KZ2ESO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZXSXVZZ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:574090d2417fb244dd6c33422795500c69dbcf2ea2140f400c77833c74a6cf20","target":"graph","created_at":"2026-05-18T00:49:06Z","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":"Training recurrent neural networks to model long term dependencies is difficult. Hence, we propose to use external linguistic knowledge as an explicit signal to inform the model which memories it should utilize. Specifically, external knowledge is used to augment a sequence with typed edges between arbitrarily distant elements, and the resulting graph is decomposed into directed acyclic subgraphs. We introduce a model that encodes such graphs as explicit memory in recurrent neural networks, and use it to model coreference relations in text. We apply our model to several text comprehension task","authors_text":"Bhuwan Dhingra, Ruslan Salakhutdinov, William W. Cohen, Zhilin Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-07T22:13:17Z","title":"Linguistic Knowledge as Memory for Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02620","kind":"arxiv","version":1},"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:f575ae224321a214279b96e0291da1f7d5017081280381d06ac1b877034e8aec","target":"record","created_at":"2026-05-18T00:49:06Z","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":"768673a645d56fdd1e9ef1d94080c9c7768753e672b921462113fab9d9de647f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-07T22:13:17Z","title_canon_sha256":"57a448b0815fcb56e21bdda6063edf9e4791162c89c7cddfada0df71f64cb1e7"},"schema_version":"1.0","source":{"id":"1703.02620","kind":"arxiv","version":1}},"canonical_sha256":"f66f2bd739ced59d124ed0426eb32fe407fcfd10c9f4ecb47f2c6b8217c8170f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f66f2bd739ced59d124ed0426eb32fe407fcfd10c9f4ecb47f2c6b8217c8170f","first_computed_at":"2026-05-18T00:49:06.022686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:06.022686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+DHNIO/xROEz0NOF7Qjzn2TEnIOKVnKph+FdZPlW+rc/vXlALaaeIqp4y7ldpjV68f9CttubqHK+h33X+ZiWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:06.023075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f575ae224321a214279b96e0291da1f7d5017081280381d06ac1b877034e8aec","sha256:574090d2417fb244dd6c33422795500c69dbcf2ea2140f400c77833c74a6cf20"],"state_sha256":"844042bb6f3d77d85418c50baa2dd8fee42379f6122a681a7a5b02b14e4f7c15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nF6cchBosADfybmnOsS6OyGWOWmqRCjGrX27Pp81lHmOXRXbPXlS6p+bAhT9ncu+UZQKdu1VYHckTwsyqxSYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T17:33:44.913346Z","bundle_sha256":"db2cc25114650cace5d9acad0d1d27e6ee5d99d5249f2a235c1e97d7eedeeeba"}}