{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BUSKTDXLM63ZRGOHD4BJMJL6T4","short_pith_number":"pith:BUSKTDXL","schema_version":"1.0","canonical_sha256":"0d24a98eeb67b79899c71f0296257e9f2bce7d86cfdbd65d3ff1cc053ac8a4f6","source":{"kind":"arxiv","id":"2203.07673","version":2},"attestation_state":"computed","paper":{"title":"Distributed-Memory Sparse Kernels for Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Aydin Bulu\\c{c}, James Demmel, Vivek Bharadwaj","submitted_at":"2022-03-15T06:34:39Z","abstract_excerpt":"Sampled Dense Times Dense Matrix Multiplication (SDDMM) and Sparse Times Dense Matrix Multiplication (SpMM) appear in diverse settings, such as collaborative filtering, document clustering, and graph embedding. Frequently, the SDDMM output becomes the input sparse matrix for a subsequent SpMM operation. Existing work has focused on shared memory parallelization of these primitives. While there has been extensive analysis of communication-minimizing distributed 1.5D algorithms for SpMM, no such analysis exists for SDDMM or the back-to-back sequence of SDDMM and SpMM, termed FusedMM. We show tha"},"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":"2203.07673","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-03-15T06:34:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fcbac2a24c11814f703f542049de0a099a78072649e2796246a49b9495892a55","abstract_canon_sha256":"9176b95fc3b0fb002fbeab7b9e7f8cc395eb322784394073cb049b2e235c866e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:31.061641Z","signature_b64":"nLEs4rd74EO+dDozpvSiB97xQrsRMFZ7x+607V5C6ASznRxGGUkgdGrxShnBu2U9XncAzrw16uNanTLOzaczDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d24a98eeb67b79899c71f0296257e9f2bce7d86cfdbd65d3ff1cc053ac8a4f6","last_reissued_at":"2026-07-05T04:06:31.061153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:31.061153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed-Memory Sparse Kernels for Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Aydin Bulu\\c{c}, James Demmel, Vivek Bharadwaj","submitted_at":"2022-03-15T06:34:39Z","abstract_excerpt":"Sampled Dense Times Dense Matrix Multiplication (SDDMM) and Sparse Times Dense Matrix Multiplication (SpMM) appear in diverse settings, such as collaborative filtering, document clustering, and graph embedding. Frequently, the SDDMM output becomes the input sparse matrix for a subsequent SpMM operation. Existing work has focused on shared memory parallelization of these primitives. While there has been extensive analysis of communication-minimizing distributed 1.5D algorithms for SpMM, no such analysis exists for SDDMM or the back-to-back sequence of SDDMM and SpMM, termed FusedMM. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.07673","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/2203.07673/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":"2203.07673","created_at":"2026-07-05T04:06:31.061210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.07673v2","created_at":"2026-07-05T04:06:31.061210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07673","created_at":"2026-07-05T04:06:31.061210+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUSKTDXLM63Z","created_at":"2026-07-05T04:06:31.061210+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUSKTDXLM63ZRGOH","created_at":"2026-07-05T04:06:31.061210+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUSKTDXL","created_at":"2026-07-05T04:06:31.061210+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/BUSKTDXLM63ZRGOHD4BJMJL6T4","json":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4.json","graph_json":"https://pith.science/api/pith-number/BUSKTDXLM63ZRGOHD4BJMJL6T4/graph.json","events_json":"https://pith.science/api/pith-number/BUSKTDXLM63ZRGOHD4BJMJL6T4/events.json","paper":"https://pith.science/paper/BUSKTDXL"},"agent_actions":{"view_html":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4","download_json":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4.json","view_paper":"https://pith.science/paper/BUSKTDXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.07673&json=true","fetch_graph":"https://pith.science/api/pith-number/BUSKTDXLM63ZRGOHD4BJMJL6T4/graph.json","fetch_events":"https://pith.science/api/pith-number/BUSKTDXLM63ZRGOHD4BJMJL6T4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4/action/storage_attestation","attest_author":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4/action/author_attestation","sign_citation":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4/action/citation_signature","submit_replication":"https://pith.science/pith/BUSKTDXLM63ZRGOHD4BJMJL6T4/action/replication_record"}},"created_at":"2026-07-05T04:06:31.061210+00:00","updated_at":"2026-07-05T04:06:31.061210+00:00"}