{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KWZB5YUR24P3XY6QPWTJCRJSCM","short_pith_number":"pith:KWZB5YUR","schema_version":"1.0","canonical_sha256":"55b21ee291d71fbbe3d07da6914532132ff687674cd3f582ad7775693bb880ce","source":{"kind":"arxiv","id":"2110.08688","version":1},"attestation_state":"computed","paper":{"title":"MG-GCN: Scalable Multi-GPU GCN Training Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kaan Sancak, Muhammed Fatih Bal{\\i}n, \\\"Umit V. \\c{C}ataly\\\"urek","submitted_at":"2021-10-17T00:41:43Z","abstract_excerpt":"Full batch training of Graph Convolutional Network (GCN) models is not feasible on a single GPU for large graphs containing tens of millions of vertices or more. Recent work has shown that, for the graphs used in the machine learning community, communication becomes a bottleneck and scaling is blocked outside of the single machine regime. Thus, we propose MG-GCN, a multi-GPU GCN training framework taking advantage of the high-speed communication links between the GPUs present in multi-GPU systems. MG-GCN employs multiple High-Performance Computing optimizations, including efficient re-use of m"},"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":"2110.08688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-17T00:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"4336daff5ad76db126f06363f8d73908281fa2018aa66b07795c45eb975b8437","abstract_canon_sha256":"94e39bbc3cbe5de3c9a0b3cc7760dc13b40b83c44aebd77425942669c346928c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:19.413685Z","signature_b64":"OWPhzuUZT6Y3hzG7YMcg+ym3lNTfT/x8TjbCbZeSDDWZxZ4WTi/Lrq/LU7/VlOnEYhd/eNXBcF94mJ66fXg/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55b21ee291d71fbbe3d07da6914532132ff687674cd3f582ad7775693bb880ce","last_reissued_at":"2026-07-05T03:23:19.413304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:19.413304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MG-GCN: Scalable Multi-GPU GCN Training Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kaan Sancak, Muhammed Fatih Bal{\\i}n, \\\"Umit V. \\c{C}ataly\\\"urek","submitted_at":"2021-10-17T00:41:43Z","abstract_excerpt":"Full batch training of Graph Convolutional Network (GCN) models is not feasible on a single GPU for large graphs containing tens of millions of vertices or more. Recent work has shown that, for the graphs used in the machine learning community, communication becomes a bottleneck and scaling is blocked outside of the single machine regime. Thus, we propose MG-GCN, a multi-GPU GCN training framework taking advantage of the high-speed communication links between the GPUs present in multi-GPU systems. MG-GCN employs multiple High-Performance Computing optimizations, including efficient re-use of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08688","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/2110.08688/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":"2110.08688","created_at":"2026-07-05T03:23:19.413363+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.08688v1","created_at":"2026-07-05T03:23:19.413363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08688","created_at":"2026-07-05T03:23:19.413363+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWZB5YUR24P3","created_at":"2026-07-05T03:23:19.413363+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWZB5YUR24P3XY6Q","created_at":"2026-07-05T03:23:19.413363+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWZB5YUR","created_at":"2026-07-05T03:23:19.413363+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/KWZB5YUR24P3XY6QPWTJCRJSCM","json":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM.json","graph_json":"https://pith.science/api/pith-number/KWZB5YUR24P3XY6QPWTJCRJSCM/graph.json","events_json":"https://pith.science/api/pith-number/KWZB5YUR24P3XY6QPWTJCRJSCM/events.json","paper":"https://pith.science/paper/KWZB5YUR"},"agent_actions":{"view_html":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM","download_json":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM.json","view_paper":"https://pith.science/paper/KWZB5YUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.08688&json=true","fetch_graph":"https://pith.science/api/pith-number/KWZB5YUR24P3XY6QPWTJCRJSCM/graph.json","fetch_events":"https://pith.science/api/pith-number/KWZB5YUR24P3XY6QPWTJCRJSCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM/action/storage_attestation","attest_author":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM/action/author_attestation","sign_citation":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM/action/citation_signature","submit_replication":"https://pith.science/pith/KWZB5YUR24P3XY6QPWTJCRJSCM/action/replication_record"}},"created_at":"2026-07-05T03:23:19.413363+00:00","updated_at":"2026-07-05T03:23:19.413363+00:00"}