{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UM3OH67GVCQZJ2NYYVKMLGFQT6","short_pith_number":"pith:UM3OH67G","canonical_record":{"source":{"id":"1809.10185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-26T18:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"53834a5e5a68aa7560f0e67003b1a5753b5095b15c639bbec48c36cd12e3077a","abstract_canon_sha256":"d605d632d209db28da994289a4abf15a2f99e2180665122545627ac5f6c1ada6"},"schema_version":"1.0"},"canonical_sha256":"a336e3fbe6a8a194e9b8c554c598b09fad0440ad4efafdea3f869d9abb9426dd","source":{"kind":"arxiv","id":"1809.10185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10185","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10185v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10185","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"UM3OH67GVCQZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UM3OH67GVCQZJ2NY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UM3OH67G","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UM3OH67GVCQZJ2NYYVKMLGFQT6","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-26T18:49:07Z","cross_cats_sorted":[],"title_canon_sha256":"53834a5e5a68aa7560f0e67003b1a5753b5095b15c639bbec48c36cd12e3077a","abstract_canon_sha256":"d605d632d209db28da994289a4abf15a2f99e2180665122545627ac5f6c1ada6"},"schema_version":"1.0"},"canonical_sha256":"a336e3fbe6a8a194e9b8c554c598b09fad0440ad4efafdea3f869d9abb9426dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.899072Z","signature_b64":"5hnBpKr8tC5FOqIk3BDmo4XDdcSC3iVDLB931d9Exf0vbanI4faX8TxZpl7r8Ur2xnpwifXTP6trQfnqFeusCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a336e3fbe6a8a194e9b8c554c598b09fad0440ad4efafdea3f869d9abb9426dd","last_reissued_at":"2026-05-18T00:04:38.898628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.898628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10185","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:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90h8ZHDRb773ZWvycxgMwDMeavNd5nthZmNPPE2SMt5Vbkq5XP9umo1KW0wFvSzL3gw/91SgYDC74a8QN3FxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:22:15.715849Z"},"content_sha256":"01a36dfbfd2532d38caab6058d99207fffa7f51be2dd7a89b818622f039e500c","schema_version":"1.0","event_id":"sha256:01a36dfbfd2532d38caab6058d99207fffa7f51be2dd7a89b818622f039e500c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UM3OH67GVCQZJ2NYYVKMLGFQT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Christopher D. Manning, Peng Qi, Yuhao Zhang","submitted_at":"2018-09-26T18:49:07Z","abstract_excerpt":"Dependency trees help relation extraction models capture long-range relations between words. However, existing dependency-based models either neglect crucial information (e.g., negation) by pruning the dependency trees too aggressively, or are computationally inefficient because it is difficult to parallelize over different tree structures. We propose an extension of graph convolutional networks that is tailored for relation extraction, which pools information over arbitrary dependency structures efficiently in parallel. To incorporate relevant information while maximally removing irrelevant c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10185","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:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+wAQiGvhx/rVzE6KWbccB0m3D5YOm07dXzw0SpqE04ti2rIKh4oIdoozbOPGDhDN7fgC7MYExZzWG60erutDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:22:15.716604Z"},"content_sha256":"c87f9e3249549ea206bfdf26bdaa93fab24f78f765c98b537110815cdf6975dc","schema_version":"1.0","event_id":"sha256:c87f9e3249549ea206bfdf26bdaa93fab24f78f765c98b537110815cdf6975dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UM3OH67GVCQZJ2NYYVKMLGFQT6/bundle.json","state_url":"https://pith.science/pith/UM3OH67GVCQZJ2NYYVKMLGFQT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UM3OH67GVCQZJ2NYYVKMLGFQT6/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-10T23:22:15Z","links":{"resolver":"https://pith.science/pith/UM3OH67GVCQZJ2NYYVKMLGFQT6","bundle":"https://pith.science/pith/UM3OH67GVCQZJ2NYYVKMLGFQT6/bundle.json","state":"https://pith.science/pith/UM3OH67GVCQZJ2NYYVKMLGFQT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UM3OH67GVCQZJ2NYYVKMLGFQT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UM3OH67GVCQZJ2NYYVKMLGFQT6","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":"d605d632d209db28da994289a4abf15a2f99e2180665122545627ac5f6c1ada6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-26T18:49:07Z","title_canon_sha256":"53834a5e5a68aa7560f0e67003b1a5753b5095b15c639bbec48c36cd12e3077a"},"schema_version":"1.0","source":{"id":"1809.10185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10185","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10185v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10185","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"UM3OH67GVCQZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UM3OH67GVCQZJ2NY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UM3OH67G","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:c87f9e3249549ea206bfdf26bdaa93fab24f78f765c98b537110815cdf6975dc","target":"graph","created_at":"2026-05-18T00:04:38Z","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":"Dependency trees help relation extraction models capture long-range relations between words. However, existing dependency-based models either neglect crucial information (e.g., negation) by pruning the dependency trees too aggressively, or are computationally inefficient because it is difficult to parallelize over different tree structures. We propose an extension of graph convolutional networks that is tailored for relation extraction, which pools information over arbitrary dependency structures efficiently in parallel. To incorporate relevant information while maximally removing irrelevant c","authors_text":"Christopher D. Manning, Peng Qi, Yuhao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-26T18:49:07Z","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10185","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:01a36dfbfd2532d38caab6058d99207fffa7f51be2dd7a89b818622f039e500c","target":"record","created_at":"2026-05-18T00:04:38Z","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":"d605d632d209db28da994289a4abf15a2f99e2180665122545627ac5f6c1ada6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-26T18:49:07Z","title_canon_sha256":"53834a5e5a68aa7560f0e67003b1a5753b5095b15c639bbec48c36cd12e3077a"},"schema_version":"1.0","source":{"id":"1809.10185","kind":"arxiv","version":1}},"canonical_sha256":"a336e3fbe6a8a194e9b8c554c598b09fad0440ad4efafdea3f869d9abb9426dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a336e3fbe6a8a194e9b8c554c598b09fad0440ad4efafdea3f869d9abb9426dd","first_computed_at":"2026-05-18T00:04:38.898628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.898628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5hnBpKr8tC5FOqIk3BDmo4XDdcSC3iVDLB931d9Exf0vbanI4faX8TxZpl7r8Ur2xnpwifXTP6trQfnqFeusCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.899072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01a36dfbfd2532d38caab6058d99207fffa7f51be2dd7a89b818622f039e500c","sha256:c87f9e3249549ea206bfdf26bdaa93fab24f78f765c98b537110815cdf6975dc"],"state_sha256":"efa53ff0a1f83e417793105d7f5835ca5a213515fad1e2093701716856c7294d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQ8AQfq8Q2UzpWCABpWprGES4FmrSw9riOCs0JKlmizWa3MCX7pW1GiGYI4GaHmEiaKaZZI03KUDlUziCPFJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:22:15.729878Z","bundle_sha256":"70fe67022408572f49fe4abfcfa1571de74b73ab160d90ad8d326d87505992fd"}}