{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AR6SASNJBJMTJAYFC3J4EYAP7A","short_pith_number":"pith:AR6SASNJ","canonical_record":{"source":{"id":"1707.01265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-05T08:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"d8ad445301432cbcc86331e4390f0d2e7140ac0aad1438561b99f21066685bf6","abstract_canon_sha256":"1d59ce4e9c540a4ce9a633e155bf589f7914d18363ddfeb64005f84dd61929e0"},"schema_version":"1.0"},"canonical_sha256":"047d2049a90a5934830516d3c2600ff8241c4d262e47446f674547ea1a8920ef","source":{"kind":"arxiv","id":"1707.01265","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01265","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01265v2","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01265","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"AR6SASNJBJMT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AR6SASNJBJMTJAYF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AR6SASNJ","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AR6SASNJBJMTJAYFC3J4EYAP7A","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-05T08:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"d8ad445301432cbcc86331e4390f0d2e7140ac0aad1438561b99f21066685bf6","abstract_canon_sha256":"1d59ce4e9c540a4ce9a633e155bf589f7914d18363ddfeb64005f84dd61929e0"},"schema_version":"1.0"},"canonical_sha256":"047d2049a90a5934830516d3c2600ff8241c4d262e47446f674547ea1a8920ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.806779Z","signature_b64":"byF4FeI75VS/mQr8Dh4aHNRwekkzCCKOdCgQH9X8PFzEhaBFA6EhJTTlz16yrzKimGA26PUFe+QigRS/R12ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047d2049a90a5934830516d3c2600ff8241c4d262e47446f674547ea1a8920ef","last_reissued_at":"2026-05-18T00:31:35.806161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.806161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01265","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gx9lfy+TEFmWvXcitCqWvzcUNHmlrNfWinxABKx9bl/dQQPQuy6S9RRfQ0yOKjH99xzEQmvrEF7//QxYxm33BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:36:56.283464Z"},"content_sha256":"be8848bcc9fa875b8973755d40363b665239a415594f1d308aeaec669fc365c4","schema_version":"1.0","event_id":"sha256:be8848bcc9fa875b8973755d40363b665239a415594f1d308aeaec669fc365c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AR6SASNJBJMTJAYFC3J4EYAP7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Range-Restricted Bidirectional Gated Recurrent Units with Attention for Relation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jonggu Kim, Jong-Hyeok Lee","submitted_at":"2017-07-05T08:55:28Z","abstract_excerpt":"Most of neural approaches to relation classification have focused on finding short patterns that represent the semantic relation using Convolutional Neural Networks (CNNs) and those approaches have generally achieved better performances than using Recurrent Neural Networks (RNNs). In a similar intuition to the CNN models, we propose a novel RNN-based model that strongly focuses on only important parts of a sentence using multiple range-restricted bidirectional layers and attention for relation classification. Experimental results on the SemEval-2010 relation classification task show that our m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01265","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9dPRdbPiN4zOV1feqTMrFOrVbjqiAMGVcvBQxzBiw0ZKEwtIQjMGQ8Qsume9R0+oBBdMN1sq8Hqj00ly8KiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:36:56.283818Z"},"content_sha256":"440fd67ea1ee02a721b38b28a90dba703a8ba641478a033763d69cb077160e9f","schema_version":"1.0","event_id":"sha256:440fd67ea1ee02a721b38b28a90dba703a8ba641478a033763d69cb077160e9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR6SASNJBJMTJAYFC3J4EYAP7A/bundle.json","state_url":"https://pith.science/pith/AR6SASNJBJMTJAYFC3J4EYAP7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR6SASNJBJMTJAYFC3J4EYAP7A/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-12T00:36:56Z","links":{"resolver":"https://pith.science/pith/AR6SASNJBJMTJAYFC3J4EYAP7A","bundle":"https://pith.science/pith/AR6SASNJBJMTJAYFC3J4EYAP7A/bundle.json","state":"https://pith.science/pith/AR6SASNJBJMTJAYFC3J4EYAP7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR6SASNJBJMTJAYFC3J4EYAP7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AR6SASNJBJMTJAYFC3J4EYAP7A","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":"1d59ce4e9c540a4ce9a633e155bf589f7914d18363ddfeb64005f84dd61929e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-05T08:55:28Z","title_canon_sha256":"d8ad445301432cbcc86331e4390f0d2e7140ac0aad1438561b99f21066685bf6"},"schema_version":"1.0","source":{"id":"1707.01265","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01265","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01265v2","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01265","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"AR6SASNJBJMT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AR6SASNJBJMTJAYF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AR6SASNJ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:440fd67ea1ee02a721b38b28a90dba703a8ba641478a033763d69cb077160e9f","target":"graph","created_at":"2026-05-18T00:31:35Z","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":"Most of neural approaches to relation classification have focused on finding short patterns that represent the semantic relation using Convolutional Neural Networks (CNNs) and those approaches have generally achieved better performances than using Recurrent Neural Networks (RNNs). In a similar intuition to the CNN models, we propose a novel RNN-based model that strongly focuses on only important parts of a sentence using multiple range-restricted bidirectional layers and attention for relation classification. Experimental results on the SemEval-2010 relation classification task show that our m","authors_text":"Jonggu Kim, Jong-Hyeok Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-05T08:55:28Z","title":"Multiple Range-Restricted Bidirectional Gated Recurrent Units with Attention for Relation Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01265","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:be8848bcc9fa875b8973755d40363b665239a415594f1d308aeaec669fc365c4","target":"record","created_at":"2026-05-18T00:31:35Z","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":"1d59ce4e9c540a4ce9a633e155bf589f7914d18363ddfeb64005f84dd61929e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-05T08:55:28Z","title_canon_sha256":"d8ad445301432cbcc86331e4390f0d2e7140ac0aad1438561b99f21066685bf6"},"schema_version":"1.0","source":{"id":"1707.01265","kind":"arxiv","version":2}},"canonical_sha256":"047d2049a90a5934830516d3c2600ff8241c4d262e47446f674547ea1a8920ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"047d2049a90a5934830516d3c2600ff8241c4d262e47446f674547ea1a8920ef","first_computed_at":"2026-05-18T00:31:35.806161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:35.806161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"byF4FeI75VS/mQr8Dh4aHNRwekkzCCKOdCgQH9X8PFzEhaBFA6EhJTTlz16yrzKimGA26PUFe+QigRS/R12ACg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:35.806779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01265","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be8848bcc9fa875b8973755d40363b665239a415594f1d308aeaec669fc365c4","sha256:440fd67ea1ee02a721b38b28a90dba703a8ba641478a033763d69cb077160e9f"],"state_sha256":"699ba5288845a5bd1c3c085161eda7420aea736da2ba7d86db547abbfc4a4fd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fL44Erzd5DCbf8NFjKNVG2cfHGH/gLkY5qkHrrKNGPPfa0nJmA+u/UTCgNZJ2niJm1JDATdm0dri9TRG042DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:36:56.286117Z","bundle_sha256":"f05b9de5822b1855d81b5f9b6bec142987bbcb53163a666b64a973b921bc24de"}}