{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZR7NVWTXJQ5VGD67F5IIOY73O4","short_pith_number":"pith:ZR7NVWTX","canonical_record":{"source":{"id":"1904.08035","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T00:46:20Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"9ca3c5a48acb230721ac9a8e5cc828f127024c368665f80a77121d61f41db8a1","abstract_canon_sha256":"fd63d48e0c546ad7bfa0edf7493514ebf23c8d2cdba1f5b382a2803b861b4c3c"},"schema_version":"1.0"},"canonical_sha256":"cc7edada774c3b530fdf2f508763fb771999df9c4eee60b45d056166cdc653b5","source":{"kind":"arxiv","id":"1904.08035","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08035","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08035v3","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08035","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZR7NVWTXJQ5V","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZR7NVWTXJQ5VGD67","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZR7NVWTX","created_at":"2026-07-04T23:59:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZR7NVWTXJQ5VGD67F5IIOY73O4","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08035","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T00:46:20Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"9ca3c5a48acb230721ac9a8e5cc828f127024c368665f80a77121d61f41db8a1","abstract_canon_sha256":"fd63d48e0c546ad7bfa0edf7493514ebf23c8d2cdba1f5b382a2803b861b4c3c"},"schema_version":"1.0"},"canonical_sha256":"cc7edada774c3b530fdf2f508763fb771999df9c4eee60b45d056166cdc653b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:31.743596Z","signature_b64":"mlFEfGkC35jLGOJpaVDEC3Z0SjpGix6AFqM5qweKIkCjQH7q64uB0tQKavguJbJ9ewDHJxxOaKqd514VkLTbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc7edada774c3b530fdf2f508763fb771999df9c4eee60b45d056166cdc653b5","last_reissued_at":"2026-07-04T23:59:31.743154Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:31.743154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08035","source_version":3,"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-04T23:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B50o1hXbhZUuy+cs5IiOhUzQdZf/mcfeB+BHJft6UAjcu6f75A3FJdAz3ooGJpj1T71Ip/MNlBtUm9SoNHLeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:24:27.019378Z"},"content_sha256":"68a90022eab1b66a664bb5d7f6939d821989f412e30fc5723299ce70b61c1378","schema_version":"1.0","event_id":"sha256:68a90022eab1b66a664bb5d7f6939d821989f412e30fc5723299ce70b61c1378"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZR7NVWTXJQ5VGD67F5IIOY73O4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Residual or Gate? Towards Deeper Graph Neural Networks for Inductive Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Binxuan Huang, Kathleen M. Carley","submitted_at":"2019-04-17T00:46:20Z","abstract_excerpt":"In this paper, we study the problem of node representation learning with graph neural networks. We present a graph neural network class named recurrent graph neural network (RGNN), that address the shortcomings of prior methods. By using recurrent units to capture the long-term dependency across layers, our methods can successfully identify important information during recursive neighborhood expansion. In our experiments, we show that our model class achieves state-of-the-art results on three benchmarks: the Pubmed, Reddit, and PPI network datasets. Our in-depth analyses also demonstrate that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08035","kind":"arxiv","version":3},"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/1904.08035/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-04T23:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZeYq6CuTSBDkIBnZK49eF8NeaXg0J8J4YP7nbWL6L6TDN55gVCDElVpt4WUOzZFu615xjbytU3OE6o0cBzkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:24:27.019880Z"},"content_sha256":"b0425c61ce0ad72eae6da76a6ab463e2e96f57270107418c6fcc189045e028db","schema_version":"1.0","event_id":"sha256:b0425c61ce0ad72eae6da76a6ab463e2e96f57270107418c6fcc189045e028db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/bundle.json","state_url":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/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-23T14:24:27Z","links":{"resolver":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4","bundle":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/bundle.json","state":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZR7NVWTXJQ5VGD67F5IIOY73O4","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":"fd63d48e0c546ad7bfa0edf7493514ebf23c8d2cdba1f5b382a2803b861b4c3c","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T00:46:20Z","title_canon_sha256":"9ca3c5a48acb230721ac9a8e5cc828f127024c368665f80a77121d61f41db8a1"},"schema_version":"1.0","source":{"id":"1904.08035","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08035","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08035v3","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08035","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZR7NVWTXJQ5V","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZR7NVWTXJQ5VGD67","created_at":"2026-07-04T23:59:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZR7NVWTX","created_at":"2026-07-04T23:59:31Z"}],"graph_snapshots":[{"event_id":"sha256:b0425c61ce0ad72eae6da76a6ab463e2e96f57270107418c6fcc189045e028db","target":"graph","created_at":"2026-07-04T23:59:31Z","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/1904.08035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the problem of node representation learning with graph neural networks. We present a graph neural network class named recurrent graph neural network (RGNN), that address the shortcomings of prior methods. By using recurrent units to capture the long-term dependency across layers, our methods can successfully identify important information during recursive neighborhood expansion. In our experiments, we show that our model class achieves state-of-the-art results on three benchmarks: the Pubmed, Reddit, and PPI network datasets. Our in-depth analyses also demonstrate that ","authors_text":"Binxuan Huang, Kathleen M. Carley","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T00:46:20Z","title":"Residual or Gate? Towards Deeper Graph Neural Networks for Inductive Graph Representation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08035","kind":"arxiv","version":3},"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:68a90022eab1b66a664bb5d7f6939d821989f412e30fc5723299ce70b61c1378","target":"record","created_at":"2026-07-04T23:59:31Z","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":"fd63d48e0c546ad7bfa0edf7493514ebf23c8d2cdba1f5b382a2803b861b4c3c","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-17T00:46:20Z","title_canon_sha256":"9ca3c5a48acb230721ac9a8e5cc828f127024c368665f80a77121d61f41db8a1"},"schema_version":"1.0","source":{"id":"1904.08035","kind":"arxiv","version":3}},"canonical_sha256":"cc7edada774c3b530fdf2f508763fb771999df9c4eee60b45d056166cdc653b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc7edada774c3b530fdf2f508763fb771999df9c4eee60b45d056166cdc653b5","first_computed_at":"2026-07-04T23:59:31.743154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:31.743154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mlFEfGkC35jLGOJpaVDEC3Z0SjpGix6AFqM5qweKIkCjQH7q64uB0tQKavguJbJ9ewDHJxxOaKqd514VkLTbDg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:31.743596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08035","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68a90022eab1b66a664bb5d7f6939d821989f412e30fc5723299ce70b61c1378","sha256:b0425c61ce0ad72eae6da76a6ab463e2e96f57270107418c6fcc189045e028db"],"state_sha256":"1d0b15371dc3ab3a38f5d69324fd85b030f4d8d2281c9bb0923f3e36fa6c5115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nV5zL/fBCApdEC4TRMJrAerRq9vnfPS6yDYTAvksir3cylC/527FwGsC5nWSnAy/SQO8vwtiGFtvwKTbJ9xkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T14:24:27.023719Z","bundle_sha256":"c114816ef379c5c17f66ac229911d2f733d856ab4257e507f5b4bf5a08e1f509"}}