{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:I4AGTFFQG7JDAY6D6Z2FEBQXA6","short_pith_number":"pith:I4AGTFFQ","schema_version":"1.0","canonical_sha256":"47006994b037d23063c3f67452061707a2435d2dc452a6a503644fba6cb6a7d9","source":{"kind":"arxiv","id":"2010.05337","version":3},"attestation_state":"computed","paper":{"title":"DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Chao Ma, Da Zheng, George Karypis, Jinjing Zhou, Minjie Wang, Qidong Su, Quan Gan, Xiang Song, Zheng Zhang","submitted_at":"2020-10-11T20:22:26Z","abstract_excerpt":"Graph neural networks (GNN) have shown great success in learning from graph-structured data. They are widely used in various applications, such as recommendation, fraud detection, and search. In these domains, the graphs are typically large, containing hundreds of millions of nodes and several billions of edges. To tackle this challenge, we develop DistDGL, a system for training GNNs in a mini-batch fashion on a cluster of machines. DistDGL is based on the Deep Graph Library (DGL), a popular GNN development framework. DistDGL distributes the graph and its associated data (initial features and "},"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":"2010.05337","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-11T20:22:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ba42323ae8f5d4a8cc6a55d86e85b38f1862cb90578620a038658ad79bed9d62","abstract_canon_sha256":"444855f7594c366e80d9ee3d8efb8a5f58c453b3501fca45cf439e8211a774f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:40.835308Z","signature_b64":"WBRXYjSoCJJrDKq3WVAhfJLltA7z7XNBhkv0n1toP4m829/pyRyVJDNnZU3Yag+Id4OeQn2BIRLst7K6bK8oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47006994b037d23063c3f67452061707a2435d2dc452a6a503644fba6cb6a7d9","last_reissued_at":"2026-07-05T03:02:40.834889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:40.834889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Chao Ma, Da Zheng, George Karypis, Jinjing Zhou, Minjie Wang, Qidong Su, Quan Gan, Xiang Song, Zheng Zhang","submitted_at":"2020-10-11T20:22:26Z","abstract_excerpt":"Graph neural networks (GNN) have shown great success in learning from graph-structured data. They are widely used in various applications, such as recommendation, fraud detection, and search. In these domains, the graphs are typically large, containing hundreds of millions of nodes and several billions of edges. To tackle this challenge, we develop DistDGL, a system for training GNNs in a mini-batch fashion on a cluster of machines. DistDGL is based on the Deep Graph Library (DGL), a popular GNN development framework. DistDGL distributes the graph and its associated data (initial features and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05337","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/2010.05337/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":"2010.05337","created_at":"2026-07-05T03:02:40.834943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.05337v3","created_at":"2026-07-05T03:02:40.834943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05337","created_at":"2026-07-05T03:02:40.834943+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4AGTFFQG7JD","created_at":"2026-07-05T03:02:40.834943+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4AGTFFQG7JDAY6D","created_at":"2026-07-05T03:02:40.834943+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4AGTFFQ","created_at":"2026-07-05T03:02:40.834943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11517","citing_title":"GriNNder: Breaking the Memory Capacity Wall in Full-Graph GNN Training with Storage Offloading","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6","json":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6.json","graph_json":"https://pith.science/api/pith-number/I4AGTFFQG7JDAY6D6Z2FEBQXA6/graph.json","events_json":"https://pith.science/api/pith-number/I4AGTFFQG7JDAY6D6Z2FEBQXA6/events.json","paper":"https://pith.science/paper/I4AGTFFQ"},"agent_actions":{"view_html":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6","download_json":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6.json","view_paper":"https://pith.science/paper/I4AGTFFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.05337&json=true","fetch_graph":"https://pith.science/api/pith-number/I4AGTFFQG7JDAY6D6Z2FEBQXA6/graph.json","fetch_events":"https://pith.science/api/pith-number/I4AGTFFQG7JDAY6D6Z2FEBQXA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6/action/storage_attestation","attest_author":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6/action/author_attestation","sign_citation":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6/action/citation_signature","submit_replication":"https://pith.science/pith/I4AGTFFQG7JDAY6D6Z2FEBQXA6/action/replication_record"}},"created_at":"2026-07-05T03:02:40.834943+00:00","updated_at":"2026-07-05T03:02:40.834943+00:00"}