{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YOSEFZGAYT2UIKRE3NNJNXTJI2","short_pith_number":"pith:YOSEFZGA","schema_version":"1.0","canonical_sha256":"c3a442e4c0c4f5442a24db5a96de6946a01c7d6ce018aa02d1ed5488abbc59bf","source":{"kind":"arxiv","id":"2203.06389","version":1},"attestation_state":"computed","paper":{"title":"GRAND+: Scalable Graph Random Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Evgeny Kharlamov, Jie Tang, Tinglin Huang, Wenzheng Feng, Xu Cheng, Yuxiao Dong, Ziqi Yin","submitted_at":"2022-03-12T09:41:23Z","abstract_excerpt":"Graph neural networks (GNNs) have been widely adopted for semi-supervised learning on graphs. A recent study shows that the graph random neural network (GRAND) model can generate state-of-the-art performance for this problem. However, it is difficult for GRAND to handle large-scale graphs since its effectiveness relies on computationally expensive data augmentation procedures. In this work, we present a scalable and high-performance GNN framework GRAND+ for semi-supervised graph learning. To address the above issue, we develop a generalized forward push (GFPush) algorithm in GRAND+ to pre-comp"},"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":"2203.06389","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-12T09:41:23Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b6864ea41903b3f283a80266a6659f5a4bd82f849b54051ace019c98eb695927","abstract_canon_sha256":"2abfd49324fea769adcb6747e0ae03aab2cf3d34dd1ca94b941ad3a5afcea7df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:50.157365Z","signature_b64":"vmmEQl3K101xMeLI1FxL2uW6ogXx60wbAQ/CYJVTH7YdcNCwMRgXcBVA5D+T16EFKvTe8gTJWCg1aes3Rw+8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a442e4c0c4f5442a24db5a96de6946a01c7d6ce018aa02d1ed5488abbc59bf","last_reissued_at":"2026-07-05T04:04:50.156932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:50.156932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRAND+: Scalable Graph Random Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Evgeny Kharlamov, Jie Tang, Tinglin Huang, Wenzheng Feng, Xu Cheng, Yuxiao Dong, Ziqi Yin","submitted_at":"2022-03-12T09:41:23Z","abstract_excerpt":"Graph neural networks (GNNs) have been widely adopted for semi-supervised learning on graphs. A recent study shows that the graph random neural network (GRAND) model can generate state-of-the-art performance for this problem. However, it is difficult for GRAND to handle large-scale graphs since its effectiveness relies on computationally expensive data augmentation procedures. In this work, we present a scalable and high-performance GNN framework GRAND+ for semi-supervised graph learning. To address the above issue, we develop a generalized forward push (GFPush) algorithm in GRAND+ to pre-comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06389","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.06389/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":"2203.06389","created_at":"2026-07-05T04:04:50.156988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.06389v1","created_at":"2026-07-05T04:04:50.156988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06389","created_at":"2026-07-05T04:04:50.156988+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOSEFZGAYT2U","created_at":"2026-07-05T04:04:50.156988+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOSEFZGAYT2UIKRE","created_at":"2026-07-05T04:04:50.156988+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOSEFZGA","created_at":"2026-07-05T04:04:50.156988+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2","json":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2.json","graph_json":"https://pith.science/api/pith-number/YOSEFZGAYT2UIKRE3NNJNXTJI2/graph.json","events_json":"https://pith.science/api/pith-number/YOSEFZGAYT2UIKRE3NNJNXTJI2/events.json","paper":"https://pith.science/paper/YOSEFZGA"},"agent_actions":{"view_html":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2","download_json":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2.json","view_paper":"https://pith.science/paper/YOSEFZGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.06389&json=true","fetch_graph":"https://pith.science/api/pith-number/YOSEFZGAYT2UIKRE3NNJNXTJI2/graph.json","fetch_events":"https://pith.science/api/pith-number/YOSEFZGAYT2UIKRE3NNJNXTJI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2/action/storage_attestation","attest_author":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2/action/author_attestation","sign_citation":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2/action/citation_signature","submit_replication":"https://pith.science/pith/YOSEFZGAYT2UIKRE3NNJNXTJI2/action/replication_record"}},"created_at":"2026-07-05T04:04:50.156988+00:00","updated_at":"2026-07-05T04:04:50.156988+00:00"}