{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G4NEFW45IKWAPNQLHJ2RYCMTPN","short_pith_number":"pith:G4NEFW45","canonical_record":{"source":{"id":"1601.03651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-14T16:30:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d315906fc34e38d0b61f6aa157b4ae58cec2591bb6f65e037656fa18c5856384","abstract_canon_sha256":"90e4e0f16243c0fa224b1549ba87591a93b63465447f51ff01092884ba563a28"},"schema_version":"1.0"},"canonical_sha256":"371a42db9d42ac07b60b3a751c09937b7233c9c6dee245de86f8babf63652698","source":{"kind":"arxiv","id":"1601.03651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03651","created_at":"2026-05-18T01:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03651v2","created_at":"2026-05-18T01:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03651","created_at":"2026-05-18T01:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"G4NEFW45IKWA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G4NEFW45IKWAPNQL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G4NEFW45","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G4NEFW45IKWAPNQLHJ2RYCMTPN","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-14T16:30:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d315906fc34e38d0b61f6aa157b4ae58cec2591bb6f65e037656fa18c5856384","abstract_canon_sha256":"90e4e0f16243c0fa224b1549ba87591a93b63465447f51ff01092884ba563a28"},"schema_version":"1.0"},"canonical_sha256":"371a42db9d42ac07b60b3a751c09937b7233c9c6dee245de86f8babf63652698","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:28.856985Z","signature_b64":"JbkcCxiFAvki8cF/RMkGps1bErqj7fr4G+CjyJ+6a1NQvXmAJqhAkUpt05Zxu254/0MhjJWbH22S0CR57k0zBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"371a42db9d42ac07b60b3a751c09937b7233c9c6dee245de86f8babf63652698","last_reissued_at":"2026-05-18T01:02:28.856362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:28.856362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03651","source_version":2,"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:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gC9jLe5LDA4HSj/NkSxN/WRh4FaQW/+7LZPHJGI9ypZaY50qGlJRsttfs//ToWuTt13pMfzQ6TScx/1iEmoxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:07:56.231958Z"},"content_sha256":"52fd27b33bbea11bda01528b7d6e356f302bbff95a59e80f14aafd3b45fedee4","schema_version":"1.0","event_id":"sha256:52fd27b33bbea11bda01528b7d6e356f302bbff95a59e80f14aafd3b45fedee4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G4NEFW45IKWAPNQLHJ2RYCMTPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Relation Classification by Deep Recurrent Neural Networks with Data Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Ge Li, Lili Mou, Ran Jia, Yangyang Lu, Yan Xu, Yunchuan Chen, Zhi Jin","submitted_at":"2016-01-14T16:30:41Z","abstract_excerpt":"Nowadays, neural networks play an important role in the task of relation classification. By designing different neural architectures, researchers have improved the performance to a large extent in comparison with traditional methods. However, existing neural networks for relation classification are usually of shallow architectures (e.g., one-layer convolutional neural networks or recurrent networks). They may fail to explore the potential representation space in different abstraction levels. In this paper, we propose deep recurrent neural networks (DRNNs) for relation classification to tackle "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03651","kind":"arxiv","version":2},"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:02:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOvZu4ZNVvbt2GqZIIqien/Shyb3+mMoGYaagnM1OjbWfp3NzG8WhF0P/6VsMWKpWQe4ooF+8UneQONXoWgeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:07:56.232566Z"},"content_sha256":"176fed008f5ad1a868080b18ec3639c44db3d18ae3fa02b2e228d3db92d13eb9","schema_version":"1.0","event_id":"sha256:176fed008f5ad1a868080b18ec3639c44db3d18ae3fa02b2e228d3db92d13eb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4NEFW45IKWAPNQLHJ2RYCMTPN/bundle.json","state_url":"https://pith.science/pith/G4NEFW45IKWAPNQLHJ2RYCMTPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4NEFW45IKWAPNQLHJ2RYCMTPN/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-31T21:07:56Z","links":{"resolver":"https://pith.science/pith/G4NEFW45IKWAPNQLHJ2RYCMTPN","bundle":"https://pith.science/pith/G4NEFW45IKWAPNQLHJ2RYCMTPN/bundle.json","state":"https://pith.science/pith/G4NEFW45IKWAPNQLHJ2RYCMTPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4NEFW45IKWAPNQLHJ2RYCMTPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G4NEFW45IKWAPNQLHJ2RYCMTPN","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":"90e4e0f16243c0fa224b1549ba87591a93b63465447f51ff01092884ba563a28","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-14T16:30:41Z","title_canon_sha256":"d315906fc34e38d0b61f6aa157b4ae58cec2591bb6f65e037656fa18c5856384"},"schema_version":"1.0","source":{"id":"1601.03651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03651","created_at":"2026-05-18T01:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03651v2","created_at":"2026-05-18T01:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03651","created_at":"2026-05-18T01:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"G4NEFW45IKWA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G4NEFW45IKWAPNQL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G4NEFW45","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:176fed008f5ad1a868080b18ec3639c44db3d18ae3fa02b2e228d3db92d13eb9","target":"graph","created_at":"2026-05-18T01:02:28Z","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":"Nowadays, neural networks play an important role in the task of relation classification. By designing different neural architectures, researchers have improved the performance to a large extent in comparison with traditional methods. However, existing neural networks for relation classification are usually of shallow architectures (e.g., one-layer convolutional neural networks or recurrent networks). They may fail to explore the potential representation space in different abstraction levels. In this paper, we propose deep recurrent neural networks (DRNNs) for relation classification to tackle ","authors_text":"Ge Li, Lili Mou, Ran Jia, Yangyang Lu, Yan Xu, Yunchuan Chen, Zhi Jin","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-14T16:30:41Z","title":"Improved Relation Classification by Deep Recurrent Neural Networks with Data Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03651","kind":"arxiv","version":2},"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:52fd27b33bbea11bda01528b7d6e356f302bbff95a59e80f14aafd3b45fedee4","target":"record","created_at":"2026-05-18T01:02:28Z","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":"90e4e0f16243c0fa224b1549ba87591a93b63465447f51ff01092884ba563a28","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-01-14T16:30:41Z","title_canon_sha256":"d315906fc34e38d0b61f6aa157b4ae58cec2591bb6f65e037656fa18c5856384"},"schema_version":"1.0","source":{"id":"1601.03651","kind":"arxiv","version":2}},"canonical_sha256":"371a42db9d42ac07b60b3a751c09937b7233c9c6dee245de86f8babf63652698","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"371a42db9d42ac07b60b3a751c09937b7233c9c6dee245de86f8babf63652698","first_computed_at":"2026-05-18T01:02:28.856362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:28.856362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JbkcCxiFAvki8cF/RMkGps1bErqj7fr4G+CjyJ+6a1NQvXmAJqhAkUpt05Zxu254/0MhjJWbH22S0CR57k0zBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:28.856985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52fd27b33bbea11bda01528b7d6e356f302bbff95a59e80f14aafd3b45fedee4","sha256:176fed008f5ad1a868080b18ec3639c44db3d18ae3fa02b2e228d3db92d13eb9"],"state_sha256":"d565ecc3f82ef6b6ae9c1ffe0c8ed10b78e3260383f38233254474f24ebcd752"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiLFZGQ2P7NGMUrv+ygDgEP4xDsnJp1ZEZlHKIF8njkQF9Tvt4ieMj39J04TDVAjCrtlWlEeMRdg59JSYV4RCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:07:56.235852Z","bundle_sha256":"71f34f589b24eed7e46df5534c2c0081ec4223aae5b89f09a2e56f0cb6ab73f4"}}