{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZLF7YFQBQIIYSFQCWUFKB3EBXV","short_pith_number":"pith:ZLF7YFQB","canonical_record":{"source":{"id":"1804.02042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-05T20:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"df821d122ebb179d97385d95bcbc9cf552758f243194b5b749a085f9d4c93796","abstract_canon_sha256":"17c4fd8a2f0ab73c2fa3399661bba356008db50d8deda56184e64699ede82258"},"schema_version":"1.0"},"canonical_sha256":"cacbfc16018211891602b50aa0ec81bd5a915274b1d7860954b6dc38ee41519a","source":{"kind":"arxiv","id":"1804.02042","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02042","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02042v1","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02042","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZLF7YFQBQIIY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZLF7YFQBQIIYSFQC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZLF7YFQB","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZLF7YFQBQIIYSFQCWUFKB3EBXV","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-05T20:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"df821d122ebb179d97385d95bcbc9cf552758f243194b5b749a085f9d4c93796","abstract_canon_sha256":"17c4fd8a2f0ab73c2fa3399661bba356008db50d8deda56184e64699ede82258"},"schema_version":"1.0"},"canonical_sha256":"cacbfc16018211891602b50aa0ec81bd5a915274b1d7860954b6dc38ee41519a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:10.228901Z","signature_b64":"k8o0lGCvYzA4oe8urIQm8wfzMWPmw6uv19Ct14Z+vOXKOTXseBYpFFDTE1me4o0aPMj1ckpxBofYfLmTbOwgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cacbfc16018211891602b50aa0ec81bd5a915274b1d7860954b6dc38ee41519a","last_reissued_at":"2026-05-18T00:13:10.228277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:10.228277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02042","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:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1UqUjlH/5S8q23rYqz8UQh0b/5FOb6GFVWs9rl920kBSphAssPnyTxFUQwNZsD3uCpCqHdTtVHPkYHeuQ8ADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:34:38.717306Z"},"content_sha256":"0c66d841230841988f81d65a3732faac9b47770fb8d9cf4832c04100fbf4fd76","schema_version":"1.0","event_id":"sha256:0c66d841230841988f81d65a3732faac9b47770fb8d9cf4832c04100fbf4fd76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZLF7YFQBQIIYSFQCWUFKB3EBXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ETH-DS3Lab at SemEval-2018 Task 7: Effectively Combining Recurrent and Convolutional Neural Networks for Relation Classification and Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ce Zhang, Jonathan Rotsztejn, Nora Hollenstein","submitted_at":"2018-04-05T20:01:48Z","abstract_excerpt":"Reliably detecting relevant relations between entities in unstructured text is a valuable resource for knowledge extraction, which is why it has awaken significant interest in the field of Natural Language Processing. In this paper, we present a system for relation classification and extraction based on an ensemble of convolutional and recurrent neural networks that ranked first in 3 out of the 4 subtasks at SemEval 2018 Task 7. We provide detailed explanations and grounds for the design choices behind the most relevant features and analyze their importance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02042","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:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIoOWi+6AlORhhIsRfAS3K9ytHlv5Q5R9WeEfWR/7GAgvzJig73vPEuFKs+bMAHXNIGawvy8FS2O4t3qH90tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:34:38.717689Z"},"content_sha256":"e09a5864d1992de4bfbb8cb8bfe48fd6f948051a8b87dc24f20648c3ff7ece05","schema_version":"1.0","event_id":"sha256:e09a5864d1992de4bfbb8cb8bfe48fd6f948051a8b87dc24f20648c3ff7ece05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLF7YFQBQIIYSFQCWUFKB3EBXV/bundle.json","state_url":"https://pith.science/pith/ZLF7YFQBQIIYSFQCWUFKB3EBXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLF7YFQBQIIYSFQCWUFKB3EBXV/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-28T13:34:38Z","links":{"resolver":"https://pith.science/pith/ZLF7YFQBQIIYSFQCWUFKB3EBXV","bundle":"https://pith.science/pith/ZLF7YFQBQIIYSFQCWUFKB3EBXV/bundle.json","state":"https://pith.science/pith/ZLF7YFQBQIIYSFQCWUFKB3EBXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLF7YFQBQIIYSFQCWUFKB3EBXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZLF7YFQBQIIYSFQCWUFKB3EBXV","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":"17c4fd8a2f0ab73c2fa3399661bba356008db50d8deda56184e64699ede82258","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-05T20:01:48Z","title_canon_sha256":"df821d122ebb179d97385d95bcbc9cf552758f243194b5b749a085f9d4c93796"},"schema_version":"1.0","source":{"id":"1804.02042","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02042","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02042v1","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02042","created_at":"2026-05-18T00:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZLF7YFQBQIIY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZLF7YFQBQIIYSFQC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZLF7YFQB","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e09a5864d1992de4bfbb8cb8bfe48fd6f948051a8b87dc24f20648c3ff7ece05","target":"graph","created_at":"2026-05-18T00:13:10Z","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":"Reliably detecting relevant relations between entities in unstructured text is a valuable resource for knowledge extraction, which is why it has awaken significant interest in the field of Natural Language Processing. In this paper, we present a system for relation classification and extraction based on an ensemble of convolutional and recurrent neural networks that ranked first in 3 out of the 4 subtasks at SemEval 2018 Task 7. We provide detailed explanations and grounds for the design choices behind the most relevant features and analyze their importance.","authors_text":"Ce Zhang, Jonathan Rotsztejn, Nora Hollenstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-05T20:01:48Z","title":"ETH-DS3Lab at SemEval-2018 Task 7: Effectively Combining Recurrent and Convolutional Neural Networks for Relation Classification and Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02042","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:0c66d841230841988f81d65a3732faac9b47770fb8d9cf4832c04100fbf4fd76","target":"record","created_at":"2026-05-18T00:13:10Z","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":"17c4fd8a2f0ab73c2fa3399661bba356008db50d8deda56184e64699ede82258","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-05T20:01:48Z","title_canon_sha256":"df821d122ebb179d97385d95bcbc9cf552758f243194b5b749a085f9d4c93796"},"schema_version":"1.0","source":{"id":"1804.02042","kind":"arxiv","version":1}},"canonical_sha256":"cacbfc16018211891602b50aa0ec81bd5a915274b1d7860954b6dc38ee41519a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cacbfc16018211891602b50aa0ec81bd5a915274b1d7860954b6dc38ee41519a","first_computed_at":"2026-05-18T00:13:10.228277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:10.228277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k8o0lGCvYzA4oe8urIQm8wfzMWPmw6uv19Ct14Z+vOXKOTXseBYpFFDTE1me4o0aPMj1ckpxBofYfLmTbOwgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:10.228901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02042","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c66d841230841988f81d65a3732faac9b47770fb8d9cf4832c04100fbf4fd76","sha256:e09a5864d1992de4bfbb8cb8bfe48fd6f948051a8b87dc24f20648c3ff7ece05"],"state_sha256":"643912c35c545f684b9f27c4948473f57bc82310df4b34ba6675b3036eab2209"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUz7peiQ48X2od+jFRJGyBNaamnHuQ+AvKpYjPdqJQLS34anzD1ZRSh+FiUTm8cLJELJwTl4BxlmDpavN+5+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:34:38.719995Z","bundle_sha256":"a85821613cbddcbe4cbcbc6733ea80ad8707caa4fab7e44b0d7793496dec66e4"}}