{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3GFJLSYSRDGTOAMUX6UHLNIVI6","short_pith_number":"pith:3GFJLSYS","canonical_record":{"source":{"id":"1906.07510","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-18T11:55:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"57e1b50989059d21d140f02d24c98191f1b4b777a38e2f69ba9d824d167e018e","abstract_canon_sha256":"10f857882b898820e1737ba82a2c123d40ca6737d8e99a85b2155e5bfa3c9ba5"},"schema_version":"1.0"},"canonical_sha256":"d98a95cb1288cd370194bfa875b51547974b4a85a9a5b223241a3eb8fc386d08","source":{"kind":"arxiv","id":"1906.07510","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07510","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07510v8","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07510","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"3GFJLSYSRDGT","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"pith_short_16","alias_value":"3GFJLSYSRDGTOAMU","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"pith_short_8","alias_value":"3GFJLSYS","created_at":"2026-07-05T01:33:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3GFJLSYSRDGTOAMUX6UHLNIVI6","target":"record","payload":{"canonical_record":{"source":{"id":"1906.07510","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-18T11:55:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"57e1b50989059d21d140f02d24c98191f1b4b777a38e2f69ba9d824d167e018e","abstract_canon_sha256":"10f857882b898820e1737ba82a2c123d40ca6737d8e99a85b2155e5bfa3c9ba5"},"schema_version":"1.0"},"canonical_sha256":"d98a95cb1288cd370194bfa875b51547974b4a85a9a5b223241a3eb8fc386d08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:16.865922Z","signature_b64":"HM8EVPqJsx49dnPnqnP/yfd4hgAEvFfDgIMySS7Sdl4ZrPCidyjUE7/UWnkQLn9duaqMDCVJsYMyznUlVZgpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98a95cb1288cd370194bfa875b51547974b4a85a9a5b223241a3eb8fc386d08","last_reissued_at":"2026-07-05T01:33:16.865495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:16.865495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.07510","source_version":8,"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-07-05T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"muvI2CL6Zzs10+I2XnpvGprmm6eGqR6cGnlIepnf78SiVtUAdvJU+ABzdx8qhj94v5xhbKpIuKh9TaCJVnLhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:25:53.767753Z"},"content_sha256":"585b9151eaf75ce2388c53bbe439e1be488a1c18a4c4f59e854507a05fb5d12f","schema_version":"1.0","event_id":"sha256:585b9151eaf75ce2388c53bbe439e1be488a1c18a4c4f59e854507a05fb5d12f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3GFJLSYSRDGTOAMUX6UHLNIVI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attention Guided Graph Convolutional Networks for Relation Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Wei Lu, Yan Zhang, Zhijiang Guo","submitted_at":"2019-06-18T11:55:16Z","abstract_excerpt":"Dependency trees convey rich structural information that is proven useful for extracting relations among entities in text. However, how to effectively make use of relevant information while ignoring irrelevant information from the dependency trees remains a challenging research question. Existing approaches employing rule based hard-pruning strategies for selecting relevant partial dependency structures may not always yield optimal results. In this work, we propose Attention Guided Graph Convolutional Networks (AGGCNs), a novel model which directly takes full dependency trees as inputs. Our mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07510","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.07510/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EPyQz7lGlvNt3SO8/pHuvT7ETQKnIgQrzhA2I3h0j+so1IB0RkYq9XLs3jY0fftsw66FcHe80aGtjIxjzR1CCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:25:53.768270Z"},"content_sha256":"642dacc760b00fe781174bb90281e532b41b98df86c0c8c68d6e4c67a1d93950","schema_version":"1.0","event_id":"sha256:642dacc760b00fe781174bb90281e532b41b98df86c0c8c68d6e4c67a1d93950"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GFJLSYSRDGTOAMUX6UHLNIVI6/bundle.json","state_url":"https://pith.science/pith/3GFJLSYSRDGTOAMUX6UHLNIVI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GFJLSYSRDGTOAMUX6UHLNIVI6/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-08-09T16:25:53Z","links":{"resolver":"https://pith.science/pith/3GFJLSYSRDGTOAMUX6UHLNIVI6","bundle":"https://pith.science/pith/3GFJLSYSRDGTOAMUX6UHLNIVI6/bundle.json","state":"https://pith.science/pith/3GFJLSYSRDGTOAMUX6UHLNIVI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GFJLSYSRDGTOAMUX6UHLNIVI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3GFJLSYSRDGTOAMUX6UHLNIVI6","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":"10f857882b898820e1737ba82a2c123d40ca6737d8e99a85b2155e5bfa3c9ba5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-18T11:55:16Z","title_canon_sha256":"57e1b50989059d21d140f02d24c98191f1b4b777a38e2f69ba9d824d167e018e"},"schema_version":"1.0","source":{"id":"1906.07510","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07510","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07510v8","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07510","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"3GFJLSYSRDGT","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"pith_short_16","alias_value":"3GFJLSYSRDGTOAMU","created_at":"2026-07-05T01:33:16Z"},{"alias_kind":"pith_short_8","alias_value":"3GFJLSYS","created_at":"2026-07-05T01:33:16Z"}],"graph_snapshots":[{"event_id":"sha256:642dacc760b00fe781174bb90281e532b41b98df86c0c8c68d6e4c67a1d93950","target":"graph","created_at":"2026-07-05T01:33:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1906.07510/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dependency trees convey rich structural information that is proven useful for extracting relations among entities in text. However, how to effectively make use of relevant information while ignoring irrelevant information from the dependency trees remains a challenging research question. Existing approaches employing rule based hard-pruning strategies for selecting relevant partial dependency structures may not always yield optimal results. In this work, we propose Attention Guided Graph Convolutional Networks (AGGCNs), a novel model which directly takes full dependency trees as inputs. Our mo","authors_text":"Wei Lu, Yan Zhang, Zhijiang Guo","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-18T11:55:16Z","title":"Attention Guided Graph Convolutional Networks for Relation Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07510","kind":"arxiv","version":8},"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:585b9151eaf75ce2388c53bbe439e1be488a1c18a4c4f59e854507a05fb5d12f","target":"record","created_at":"2026-07-05T01:33:16Z","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":"10f857882b898820e1737ba82a2c123d40ca6737d8e99a85b2155e5bfa3c9ba5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-18T11:55:16Z","title_canon_sha256":"57e1b50989059d21d140f02d24c98191f1b4b777a38e2f69ba9d824d167e018e"},"schema_version":"1.0","source":{"id":"1906.07510","kind":"arxiv","version":8}},"canonical_sha256":"d98a95cb1288cd370194bfa875b51547974b4a85a9a5b223241a3eb8fc386d08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d98a95cb1288cd370194bfa875b51547974b4a85a9a5b223241a3eb8fc386d08","first_computed_at":"2026-07-05T01:33:16.865495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:33:16.865495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HM8EVPqJsx49dnPnqnP/yfd4hgAEvFfDgIMySS7Sdl4ZrPCidyjUE7/UWnkQLn9duaqMDCVJsYMyznUlVZgpBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:33:16.865922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.07510","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:585b9151eaf75ce2388c53bbe439e1be488a1c18a4c4f59e854507a05fb5d12f","sha256:642dacc760b00fe781174bb90281e532b41b98df86c0c8c68d6e4c67a1d93950"],"state_sha256":"7c690ba19291ff595713b0acaea77122464f087e387b2f0bfe18d7e99af653a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5q5vDL5MuInjGMhqSvbRk+G7UQKvKrf6t2+KhPZvsaJIdhVe3IApCSiXv9zEzo4/XkoyciSnkUFksrjyoyTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T16:25:53.773887Z","bundle_sha256":"ea49618f07edd1e1d12bce287c86e537031428ce8ad9798e6fd1bd20caa9c3fb"}}