{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B2HZ2LMOFUYBHM6A77K2YSB2K6","short_pith_number":"pith:B2HZ2LMO","schema_version":"1.0","canonical_sha256":"0e8f9d2d8e2d3013b3c0ffd5ac483a57be24abd90e298c446a62d4765a9cc58d","source":{"kind":"arxiv","id":"2504.04673","version":1},"attestation_state":"computed","paper":{"title":"Sparsity-Aware Communication for Distributed Graph Neural Network Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alok Tripathy, Aydin Buluc, Katherine Yelick, Oguz Selvitopi, Ujjaini Mukhodopadhyay","submitted_at":"2025-04-07T01:53:14Z","abstract_excerpt":"Graph Neural Networks (GNNs) are a computationally efficient method to learn embeddings and classifications on graph data. However, GNN training has low computational intensity, making communication costs the bottleneck for scalability. Sparse-matrix dense-matrix multiplication (SpMM) is the core computational operation in full-graph training of GNNs. Previous work parallelizing this operation focused on sparsity-oblivious algorithms, where matrix elements are communicated regardless of the sparsity pattern. This leads to a predictable communication pattern that can be overlapped with computat"},"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":"2504.04673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-07T01:53:14Z","cross_cats_sorted":[],"title_canon_sha256":"3d53736c59d08b169a58ee6c4f33e2f80a389972fb6ab039672bd7b4fbd73be5","abstract_canon_sha256":"3faccbb32eae8066cee581966394d66387a2b7e1f397e2c79aeb5d372fa8d6b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:28.299676Z","signature_b64":"btT6TNLGQlkg3kpvXmAJKGWL5jC7+5yRtyTkx2fbtUN+RQpsQlBoHo5suznfH0XYxmg62FOUorg5JKqGYZntBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e8f9d2d8e2d3013b3c0ffd5ac483a57be24abd90e298c446a62d4765a9cc58d","last_reissued_at":"2026-07-05T10:45:28.299159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:28.299159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity-Aware Communication for Distributed Graph Neural Network Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alok Tripathy, Aydin Buluc, Katherine Yelick, Oguz Selvitopi, Ujjaini Mukhodopadhyay","submitted_at":"2025-04-07T01:53:14Z","abstract_excerpt":"Graph Neural Networks (GNNs) are a computationally efficient method to learn embeddings and classifications on graph data. However, GNN training has low computational intensity, making communication costs the bottleneck for scalability. Sparse-matrix dense-matrix multiplication (SpMM) is the core computational operation in full-graph training of GNNs. Previous work parallelizing this operation focused on sparsity-oblivious algorithms, where matrix elements are communicated regardless of the sparsity pattern. This leads to a predictable communication pattern that can be overlapped with computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04673","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/2504.04673/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":"2504.04673","created_at":"2026-07-05T10:45:28.299224+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04673v1","created_at":"2026-07-05T10:45:28.299224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04673","created_at":"2026-07-05T10:45:28.299224+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2HZ2LMOFUYB","created_at":"2026-07-05T10:45:28.299224+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2HZ2LMOFUYBHM6A","created_at":"2026-07-05T10:45:28.299224+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2HZ2LMO","created_at":"2026-07-05T10:45:28.299224+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/B2HZ2LMOFUYBHM6A77K2YSB2K6","json":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6.json","graph_json":"https://pith.science/api/pith-number/B2HZ2LMOFUYBHM6A77K2YSB2K6/graph.json","events_json":"https://pith.science/api/pith-number/B2HZ2LMOFUYBHM6A77K2YSB2K6/events.json","paper":"https://pith.science/paper/B2HZ2LMO"},"agent_actions":{"view_html":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6","download_json":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6.json","view_paper":"https://pith.science/paper/B2HZ2LMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04673&json=true","fetch_graph":"https://pith.science/api/pith-number/B2HZ2LMOFUYBHM6A77K2YSB2K6/graph.json","fetch_events":"https://pith.science/api/pith-number/B2HZ2LMOFUYBHM6A77K2YSB2K6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6/action/storage_attestation","attest_author":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6/action/author_attestation","sign_citation":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6/action/citation_signature","submit_replication":"https://pith.science/pith/B2HZ2LMOFUYBHM6A77K2YSB2K6/action/replication_record"}},"created_at":"2026-07-05T10:45:28.299224+00:00","updated_at":"2026-07-05T10:45:28.299224+00:00"}