{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RGPCREXZM33ZJXBNFEUANR376G","short_pith_number":"pith:RGPCREXZ","schema_version":"1.0","canonical_sha256":"899e2892f966f794dc2d292806c77ff1b2230adb984de2d660f6cde7d0ae94db","source":{"kind":"arxiv","id":"2501.01951","version":3},"attestation_state":"computed","paper":{"title":"MixGCN: Scalable GCN Training by Mixture of Parallelism and Mixture of Accelerators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cheng Wan, Runkai Tao, Yang Katie Zhao, Yingyan Celine Lin, Zheng Du","submitted_at":"2025-01-03T18:54:46Z","abstract_excerpt":"Graph convolutional networks (GCNs) have demonstrated superiority in graph-based learning tasks. However, training GCNs on full graphs is particularly challenging, due to the following two challenges: (1) the associated feature tensors can easily explode the memory and block the communication bandwidth of modern accelerators, and (2) the computation workflow in training GCNs alternates between sparse and dense matrix operations, complicating the efficient utilization of computational resources. Existing solutions for scalable distributed full-graph GCN training mostly adopt partition paralleli"},"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":"2501.01951","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-03T18:54:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"16c7f370c97ff5e2ab4fe02816d6e4c7f552cc4c10e596e789b8003cff2179c5","abstract_canon_sha256":"10587d27f79be35b725888dfed39b5fcf71fa70236de1c74b9d29fb37c6bf8a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:35.225806Z","signature_b64":"uxUJ1dAUIh6TnPzmOHzRPlNV5/DcJkIaew+/ICO6KGFvrH+aCnReD0rsZUSHaiVtS5LIVSg7WH6moIkhv2FFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"899e2892f966f794dc2d292806c77ff1b2230adb984de2d660f6cde7d0ae94db","last_reissued_at":"2026-07-05T10:19:35.225321Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:35.225321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MixGCN: Scalable GCN Training by Mixture of Parallelism and Mixture of Accelerators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cheng Wan, Runkai Tao, Yang Katie Zhao, Yingyan Celine Lin, Zheng Du","submitted_at":"2025-01-03T18:54:46Z","abstract_excerpt":"Graph convolutional networks (GCNs) have demonstrated superiority in graph-based learning tasks. However, training GCNs on full graphs is particularly challenging, due to the following two challenges: (1) the associated feature tensors can easily explode the memory and block the communication bandwidth of modern accelerators, and (2) the computation workflow in training GCNs alternates between sparse and dense matrix operations, complicating the efficient utilization of computational resources. Existing solutions for scalable distributed full-graph GCN training mostly adopt partition paralleli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01951","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/2501.01951/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":"2501.01951","created_at":"2026-07-05T10:19:35.225379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.01951v3","created_at":"2026-07-05T10:19:35.225379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01951","created_at":"2026-07-05T10:19:35.225379+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGPCREXZM33Z","created_at":"2026-07-05T10:19:35.225379+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGPCREXZM33ZJXBN","created_at":"2026-07-05T10:19:35.225379+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGPCREXZ","created_at":"2026-07-05T10:19:35.225379+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/RGPCREXZM33ZJXBNFEUANR376G","json":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G.json","graph_json":"https://pith.science/api/pith-number/RGPCREXZM33ZJXBNFEUANR376G/graph.json","events_json":"https://pith.science/api/pith-number/RGPCREXZM33ZJXBNFEUANR376G/events.json","paper":"https://pith.science/paper/RGPCREXZ"},"agent_actions":{"view_html":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G","download_json":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G.json","view_paper":"https://pith.science/paper/RGPCREXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.01951&json=true","fetch_graph":"https://pith.science/api/pith-number/RGPCREXZM33ZJXBNFEUANR376G/graph.json","fetch_events":"https://pith.science/api/pith-number/RGPCREXZM33ZJXBNFEUANR376G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G/action/storage_attestation","attest_author":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G/action/author_attestation","sign_citation":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G/action/citation_signature","submit_replication":"https://pith.science/pith/RGPCREXZM33ZJXBNFEUANR376G/action/replication_record"}},"created_at":"2026-07-05T10:19:35.225379+00:00","updated_at":"2026-07-05T10:19:35.225379+00:00"}