{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZR7NVWTXJQ5VGD67F5IIOY73O4","short_pith_number":"pith:ZR7NVWTX","schema_version":"1.0","canonical_sha256":"cc7edada774c3b530fdf2f508763fb771999df9c4eee60b45d056166cdc653b5","source":{"kind":"arxiv","id":"1904.08035","version":3},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.08035","created_at":"2026-07-04T23:59:31.743210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08035v3","created_at":"2026-07-04T23:59:31.743210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08035","created_at":"2026-07-04T23:59:31.743210+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZR7NVWTXJQ5V","created_at":"2026-07-04T23:59:31.743210+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZR7NVWTXJQ5VGD67","created_at":"2026-07-04T23:59:31.743210+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZR7NVWTX","created_at":"2026-07-04T23:59:31.743210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02606","citing_title":"Syntax-Aware Aspect Level Sentiment Classification with Graph Attention Networks","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4","json":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4.json","graph_json":"https://pith.science/api/pith-number/ZR7NVWTXJQ5VGD67F5IIOY73O4/graph.json","events_json":"https://pith.science/api/pith-number/ZR7NVWTXJQ5VGD67F5IIOY73O4/events.json","paper":"https://pith.science/paper/ZR7NVWTX"},"agent_actions":{"view_html":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4","download_json":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4.json","view_paper":"https://pith.science/paper/ZR7NVWTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08035&json=true","fetch_graph":"https://pith.science/api/pith-number/ZR7NVWTXJQ5VGD67F5IIOY73O4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZR7NVWTXJQ5VGD67F5IIOY73O4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/action/storage_attestation","attest_author":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/action/author_attestation","sign_citation":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/action/citation_signature","submit_replication":"https://pith.science/pith/ZR7NVWTXJQ5VGD67F5IIOY73O4/action/replication_record"}},"created_at":"2026-07-04T23:59:31.743210+00:00","updated_at":"2026-07-04T23:59:31.743210+00:00"}