{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:A5ERIT74BBHIRQA6TN75Q7Q3ZL","short_pith_number":"pith:A5ERIT74","schema_version":"1.0","canonical_sha256":"0749144ffc084e88c01e9b7fd87e1bcac60b9ef7447878eadf557ac0d3a0e2ba","source":{"kind":"arxiv","id":"2211.00216","version":2},"attestation_state":"computed","paper":{"title":"Distributed Graph Neural Network Training: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.DC"],"primary_cat":"cs.LG","authors_text":"Bin Cui, Hongbo Yin, Hongzheng Li, Lei Chen, Wentao Zhang, Xizhi Gu, Xupeng Miao, Yawen Li, Yingxia Shao","submitted_at":"2022-11-01T01:57:00Z","abstract_excerpt":"Graph neural networks (GNNs) are a type of deep learning models that are trained on graphs and have been successfully applied in various domains. Despite the effectiveness of GNNs, it is still challenging for GNNs to efficiently scale to large graphs. As a remedy, distributed computing becomes a promising solution of training large-scale GNNs, since it is able to provide abundant computing resources. However, the dependency of graph structure increases the difficulty of achieving high-efficiency distributed GNN training, which suffers from the massive communication and workload imbalance. In r"},"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":"2211.00216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T01:57:00Z","cross_cats_sorted":["cs.AI","cs.DB","cs.DC"],"title_canon_sha256":"88a36007ca3a498469f5e9fa615e1fdc861d5b2935ff5be58330e2b9909cbbdc","abstract_canon_sha256":"cf5663238765b08d5f4f5bc45b1c29381f4a73bb248faf797c60bae7c3c5970e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:28.186451Z","signature_b64":"yJ8RZrX0gvgMw/IEx4K0P59vszmenajYHJ/ISjfRKRlYRpTp93q4h5Ek1L+dG0QwvH0u7dFnGSCevVWHXy5aCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0749144ffc084e88c01e9b7fd87e1bcac60b9ef7447878eadf557ac0d3a0e2ba","last_reissued_at":"2026-07-05T06:44:28.185646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:28.185646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Graph Neural Network Training: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.DC"],"primary_cat":"cs.LG","authors_text":"Bin Cui, Hongbo Yin, Hongzheng Li, Lei Chen, Wentao Zhang, Xizhi Gu, Xupeng Miao, Yawen Li, Yingxia Shao","submitted_at":"2022-11-01T01:57:00Z","abstract_excerpt":"Graph neural networks (GNNs) are a type of deep learning models that are trained on graphs and have been successfully applied in various domains. Despite the effectiveness of GNNs, it is still challenging for GNNs to efficiently scale to large graphs. As a remedy, distributed computing becomes a promising solution of training large-scale GNNs, since it is able to provide abundant computing resources. However, the dependency of graph structure increases the difficulty of achieving high-efficiency distributed GNN training, which suffers from the massive communication and workload imbalance. In r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00216","kind":"arxiv","version":2},"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/2211.00216/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":"2211.00216","created_at":"2026-07-05T06:44:28.185699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.00216v2","created_at":"2026-07-05T06:44:28.185699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00216","created_at":"2026-07-05T06:44:28.185699+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5ERIT74BBHI","created_at":"2026-07-05T06:44:28.185699+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5ERIT74BBHIRQA6","created_at":"2026-07-05T06:44:28.185699+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5ERIT74","created_at":"2026-07-05T06:44:28.185699+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16144","citing_title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL","json":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL.json","graph_json":"https://pith.science/api/pith-number/A5ERIT74BBHIRQA6TN75Q7Q3ZL/graph.json","events_json":"https://pith.science/api/pith-number/A5ERIT74BBHIRQA6TN75Q7Q3ZL/events.json","paper":"https://pith.science/paper/A5ERIT74"},"agent_actions":{"view_html":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL","download_json":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL.json","view_paper":"https://pith.science/paper/A5ERIT74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.00216&json=true","fetch_graph":"https://pith.science/api/pith-number/A5ERIT74BBHIRQA6TN75Q7Q3ZL/graph.json","fetch_events":"https://pith.science/api/pith-number/A5ERIT74BBHIRQA6TN75Q7Q3ZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL/action/storage_attestation","attest_author":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL/action/author_attestation","sign_citation":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL/action/citation_signature","submit_replication":"https://pith.science/pith/A5ERIT74BBHIRQA6TN75Q7Q3ZL/action/replication_record"}},"created_at":"2026-07-05T06:44:28.185699+00:00","updated_at":"2026-07-05T06:44:28.185699+00:00"}