{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EYKLNMMNFONLPODQURK2BN7RAU","short_pith_number":"pith:EYKLNMMN","canonical_record":{"source":{"id":"1605.07333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-24T08:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"a3bef34de8b7c8e35684cf745be68ece35223cbde24a61f587c5ccfe2a24fff3","abstract_canon_sha256":"4487ebd1d01d8dda2bc0b1b227ac923b482217da85ad77bf778707e129411c2c"},"schema_version":"1.0"},"canonical_sha256":"2614b6b18d2b9ab7b870a455a0b7f1053b4eb4c8811bd78d4cdaf7ed965eb54e","source":{"kind":"arxiv","id":"1605.07333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07333","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07333v1","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07333","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"EYKLNMMNFONL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EYKLNMMNFONLPODQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EYKLNMMN","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EYKLNMMNFONLPODQURK2BN7RAU","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-24T08:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"a3bef34de8b7c8e35684cf745be68ece35223cbde24a61f587c5ccfe2a24fff3","abstract_canon_sha256":"4487ebd1d01d8dda2bc0b1b227ac923b482217da85ad77bf778707e129411c2c"},"schema_version":"1.0"},"canonical_sha256":"2614b6b18d2b9ab7b870a455a0b7f1053b4eb4c8811bd78d4cdaf7ed965eb54e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:46.374415Z","signature_b64":"H08MmgZNQO9I7I5NvHODMK8YIq5VadIFJohx8uZtimbvC2KflNEOXb0gK6zcJSudj9vcuPdCOY8FVdzkZW3lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2614b6b18d2b9ab7b870a455a0b7f1053b4eb4c8811bd78d4cdaf7ed965eb54e","last_reissued_at":"2026-05-18T01:13:46.373751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:46.373751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07333","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-18T01:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxiWmes59m+bYOHLOshg3TMrqfVoEIeXBQ7TMAWSkcdRn0hrObkl+UjyC6OTFPaCk/TOpdtCPbXJ9BGiFgsyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:09.492636Z"},"content_sha256":"e856893f0279512826c659193c410950fc8e6ba7319f46e14a33374dd9d920cb","schema_version":"1.0","event_id":"sha256:e856893f0279512826c659193c410950fc8e6ba7319f46e14a33374dd9d920cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EYKLNMMNFONLPODQURK2BN7RAU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Recurrent and Convolutional Neural Networks for Relation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Heike Adel, Hinrich Sch\\\"utze, Ngoc Thang Vu, Pankaj Gupta","submitted_at":"2016-05-24T08:20:12Z","abstract_excerpt":"This paper investigates two different neural architectures for the task of relation classification: convolutional neural networks and recurrent neural networks. For both models, we demonstrate the effect of different architectural choices. We present a new context representation for convolutional neural networks for relation classification (extended middle context). Furthermore, we propose connectionist bi-directional recurrent neural networks and introduce ranking loss for their optimization. Finally, we show that combining convolutional and recurrent neural networks using a simple voting sch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07333","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-18T01:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+4M8Ea8Yzpw+0bTpSzjw8lxxwUiGB0bTXWXg/aMEUg3AYkvr58quVZfu0LhztOjsID8MCHR3VdwWKZPD5FMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:09.493234Z"},"content_sha256":"f60aa99a33edaf2d39cebcc0a35dcf21c12fac264d26e5b2918f6767b539bcd1","schema_version":"1.0","event_id":"sha256:f60aa99a33edaf2d39cebcc0a35dcf21c12fac264d26e5b2918f6767b539bcd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYKLNMMNFONLPODQURK2BN7RAU/bundle.json","state_url":"https://pith.science/pith/EYKLNMMNFONLPODQURK2BN7RAU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYKLNMMNFONLPODQURK2BN7RAU/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-31T09:21:09Z","links":{"resolver":"https://pith.science/pith/EYKLNMMNFONLPODQURK2BN7RAU","bundle":"https://pith.science/pith/EYKLNMMNFONLPODQURK2BN7RAU/bundle.json","state":"https://pith.science/pith/EYKLNMMNFONLPODQURK2BN7RAU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYKLNMMNFONLPODQURK2BN7RAU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EYKLNMMNFONLPODQURK2BN7RAU","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":"4487ebd1d01d8dda2bc0b1b227ac923b482217da85ad77bf778707e129411c2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-24T08:20:12Z","title_canon_sha256":"a3bef34de8b7c8e35684cf745be68ece35223cbde24a61f587c5ccfe2a24fff3"},"schema_version":"1.0","source":{"id":"1605.07333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07333","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07333v1","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07333","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"EYKLNMMNFONL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EYKLNMMNFONLPODQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EYKLNMMN","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:f60aa99a33edaf2d39cebcc0a35dcf21c12fac264d26e5b2918f6767b539bcd1","target":"graph","created_at":"2026-05-18T01:13:46Z","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":"This paper investigates two different neural architectures for the task of relation classification: convolutional neural networks and recurrent neural networks. For both models, we demonstrate the effect of different architectural choices. We present a new context representation for convolutional neural networks for relation classification (extended middle context). Furthermore, we propose connectionist bi-directional recurrent neural networks and introduce ranking loss for their optimization. Finally, we show that combining convolutional and recurrent neural networks using a simple voting sch","authors_text":"Heike Adel, Hinrich Sch\\\"utze, Ngoc Thang Vu, Pankaj Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-24T08:20:12Z","title":"Combining Recurrent and Convolutional Neural Networks for Relation Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07333","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:e856893f0279512826c659193c410950fc8e6ba7319f46e14a33374dd9d920cb","target":"record","created_at":"2026-05-18T01:13:46Z","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":"4487ebd1d01d8dda2bc0b1b227ac923b482217da85ad77bf778707e129411c2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-24T08:20:12Z","title_canon_sha256":"a3bef34de8b7c8e35684cf745be68ece35223cbde24a61f587c5ccfe2a24fff3"},"schema_version":"1.0","source":{"id":"1605.07333","kind":"arxiv","version":1}},"canonical_sha256":"2614b6b18d2b9ab7b870a455a0b7f1053b4eb4c8811bd78d4cdaf7ed965eb54e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2614b6b18d2b9ab7b870a455a0b7f1053b4eb4c8811bd78d4cdaf7ed965eb54e","first_computed_at":"2026-05-18T01:13:46.373751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:46.373751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H08MmgZNQO9I7I5NvHODMK8YIq5VadIFJohx8uZtimbvC2KflNEOXb0gK6zcJSudj9vcuPdCOY8FVdzkZW3lBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:46.374415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e856893f0279512826c659193c410950fc8e6ba7319f46e14a33374dd9d920cb","sha256:f60aa99a33edaf2d39cebcc0a35dcf21c12fac264d26e5b2918f6767b539bcd1"],"state_sha256":"afcaf3500c8160509ff8324826042b33386fd6e55a1a934504df5523b50a1436"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bjBwEz1ztjwGJtZ3eYJA/Flj6H0OtfRcnr2rSvXdTpdoQqeUZPtWf20i3YXT/T2Ynf9tmk+E0eTwcFcXJlOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:21:09.496423Z","bundle_sha256":"582fba0cdfea4091c49b6580c964caa91cdb42e00b47e75a47ec4f396185399e"}}