{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NGDAH5UVNO4JMBDGYISTFOLKW6","short_pith_number":"pith:NGDAH5UV","canonical_record":{"source":{"id":"1902.00756","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-02-02T17:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"2f1155d13f16cf70ec368f7222dcbc1ed1e6ebbeebe757254fa5b11fa8fab0ea","abstract_canon_sha256":"46c14c81cb964cef172c518f3dae33333f2c35d9c47c14795e42ba015e2fdd09"},"schema_version":"1.0"},"canonical_sha256":"698603f6956bb8960466c22532b96ab7be158f0abf7abe0efd3ebe6847c75f86","source":{"kind":"arxiv","id":"1902.00756","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00756","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00756v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00756","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"NGDAH5UVNO4J","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NGDAH5UVNO4JMBDG","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NGDAH5UV","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NGDAH5UVNO4JMBDGYISTFOLKW6","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00756","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-02-02T17:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"2f1155d13f16cf70ec368f7222dcbc1ed1e6ebbeebe757254fa5b11fa8fab0ea","abstract_canon_sha256":"46c14c81cb964cef172c518f3dae33333f2c35d9c47c14795e42ba015e2fdd09"},"schema_version":"1.0"},"canonical_sha256":"698603f6956bb8960466c22532b96ab7be158f0abf7abe0efd3ebe6847c75f86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.251593Z","signature_b64":"8s+ckeK7TDZOiRcHJ/C5tnpRZHruIEpdG/vg+UpojWJPDzQhJeVK87YYmR0GNY7vnNWIsZKhlaC3NOavXa1eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"698603f6956bb8960466c22532b96ab7be158f0abf7abe0efd3ebe6847c75f86","last_reissued_at":"2026-05-17T23:54:52.251031Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.251031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00756","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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpYPbFkW0mEAUKTb/kRWZUvz+ekcrXkTt03v1x9/cNsrthxM6bmFslOJOxUrTK4Lku5Twba9/CRSYM4tEs3FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:24.408066Z"},"content_sha256":"912146c09930ab981b58d0e56e2afd8a34d004efb7b4aea38ce92b413439f674","schema_version":"1.0","event_id":"sha256:912146c09930ab981b58d0e56e2afd8a34d004efb7b4aea38ce92b413439f674"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NGDAH5UVNO4JMBDGYISTFOLKW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Networks with Generated Parameters for Relation Extraction","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hao Zhu, Jie Fu, Maosong Sun, Tat-Seng Chua, Yankai Lin, Zhiyuan Liu","submitted_at":"2019-02-02T17:34:19Z","abstract_excerpt":"Recently, progress has been made towards improving relational reasoning in machine learning field. Among existing models, graph neural networks (GNNs) is one of the most effective approaches for multi-hop relational reasoning. In fact, multi-hop relational reasoning is indispensable in many natural language processing tasks such as relation extraction. In this paper, we propose to generate the parameters of graph neural networks (GP-GNNs) according to natural language sentences, which enables GNNs to process relational reasoning on unstructured text inputs. We verify GP-GNNs in relation extrac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00756","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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLl7sFiZGgYYwfauiSfbU4JTqeExGAVmi1+ZhjjfLDdSSYdIyxe1JHpOchaCoiwQQLj5XAaGSfbPqgJo055QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:24.408426Z"},"content_sha256":"2c9e92bced5de629531938608b197005106fc486a84f9e57d76d235ef9fcde17","schema_version":"1.0","event_id":"sha256:2c9e92bced5de629531938608b197005106fc486a84f9e57d76d235ef9fcde17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGDAH5UVNO4JMBDGYISTFOLKW6/bundle.json","state_url":"https://pith.science/pith/NGDAH5UVNO4JMBDGYISTFOLKW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGDAH5UVNO4JMBDGYISTFOLKW6/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-03T07:29:24Z","links":{"resolver":"https://pith.science/pith/NGDAH5UVNO4JMBDGYISTFOLKW6","bundle":"https://pith.science/pith/NGDAH5UVNO4JMBDGYISTFOLKW6/bundle.json","state":"https://pith.science/pith/NGDAH5UVNO4JMBDGYISTFOLKW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGDAH5UVNO4JMBDGYISTFOLKW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NGDAH5UVNO4JMBDGYISTFOLKW6","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":"46c14c81cb964cef172c518f3dae33333f2c35d9c47c14795e42ba015e2fdd09","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-02-02T17:34:19Z","title_canon_sha256":"2f1155d13f16cf70ec368f7222dcbc1ed1e6ebbeebe757254fa5b11fa8fab0ea"},"schema_version":"1.0","source":{"id":"1902.00756","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00756","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00756v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00756","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"NGDAH5UVNO4J","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NGDAH5UVNO4JMBDG","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NGDAH5UV","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:2c9e92bced5de629531938608b197005106fc486a84f9e57d76d235ef9fcde17","target":"graph","created_at":"2026-05-17T23:54:52Z","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":"Recently, progress has been made towards improving relational reasoning in machine learning field. Among existing models, graph neural networks (GNNs) is one of the most effective approaches for multi-hop relational reasoning. In fact, multi-hop relational reasoning is indispensable in many natural language processing tasks such as relation extraction. In this paper, we propose to generate the parameters of graph neural networks (GP-GNNs) according to natural language sentences, which enables GNNs to process relational reasoning on unstructured text inputs. We verify GP-GNNs in relation extrac","authors_text":"Hao Zhu, Jie Fu, Maosong Sun, Tat-Seng Chua, Yankai Lin, Zhiyuan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-02-02T17:34:19Z","title":"Graph Neural Networks with Generated Parameters for Relation Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00756","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:912146c09930ab981b58d0e56e2afd8a34d004efb7b4aea38ce92b413439f674","target":"record","created_at":"2026-05-17T23:54:52Z","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":"46c14c81cb964cef172c518f3dae33333f2c35d9c47c14795e42ba015e2fdd09","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-02-02T17:34:19Z","title_canon_sha256":"2f1155d13f16cf70ec368f7222dcbc1ed1e6ebbeebe757254fa5b11fa8fab0ea"},"schema_version":"1.0","source":{"id":"1902.00756","kind":"arxiv","version":1}},"canonical_sha256":"698603f6956bb8960466c22532b96ab7be158f0abf7abe0efd3ebe6847c75f86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"698603f6956bb8960466c22532b96ab7be158f0abf7abe0efd3ebe6847c75f86","first_computed_at":"2026-05-17T23:54:52.251031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:52.251031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8s+ckeK7TDZOiRcHJ/C5tnpRZHruIEpdG/vg+UpojWJPDzQhJeVK87YYmR0GNY7vnNWIsZKhlaC3NOavXa1eAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:52.251593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00756","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:912146c09930ab981b58d0e56e2afd8a34d004efb7b4aea38ce92b413439f674","sha256:2c9e92bced5de629531938608b197005106fc486a84f9e57d76d235ef9fcde17"],"state_sha256":"0fe1e207b10df694644f7fd07c3a16ba7b88bdeb81134d04d6bdf0774424c376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsZrx6DKgjZgQ9hMzj9zvxoGW0OmCV6KPTTrbaM6EfdcflAIEyZzcQ/AB1bz5517/99OGPxdf/GFE1O4nrfZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:29:24.410563Z","bundle_sha256":"01f01208108650466e6906d8964acb28d8503d530f91528c838d7a1460bd0df1"}}