{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KAUHDLT3PTPXKPD2GBZZWI2IY4","short_pith_number":"pith:KAUHDLT3","schema_version":"1.0","canonical_sha256":"502871ae7b7cdf753c7a30739b2348c71b1076c075aae65a660fd7454772b90b","source":{"kind":"arxiv","id":"1510.00844","version":3},"attestation_state":"computed","paper":{"title":"Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Buluc, Grey Ballard, James Demmel, Laura Grigori, Oded Schwartz, Samuel Williams, Sivan Toledo","submitted_at":"2015-10-03T16:32:43Z","abstract_excerpt":"Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdos-Renyi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first ever implementation of the 3D SpGEMM formulati"},"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":"1510.00844","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-03T16:32:43Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"d0c62799ab109c90f72f25fb01bb1f77e880c0b7418099dcd99517b61c86653c","abstract_canon_sha256":"4d04bbf6bc02e60d8fc0622579c9f554a08c7589a34e6a82fb4cca2fc4229f2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:04.410340Z","signature_b64":"NW1Acxm0UNpPOw9q7Ypfzb4tFfIYS49V0s7h6Og0irZLbRyHgBmtSffxuc6Ur1/Ew9Xy3oG+QdBhTnT279tUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502871ae7b7cdf753c7a30739b2348c71b1076c075aae65a660fd7454772b90b","last_reissued_at":"2026-05-18T00:58:04.409934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:04.409934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Buluc, Grey Ballard, James Demmel, Laura Grigori, Oded Schwartz, Samuel Williams, Sivan Toledo","submitted_at":"2015-10-03T16:32:43Z","abstract_excerpt":"Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdos-Renyi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first ever implementation of the 3D SpGEMM formulati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00844","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":""},"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":"1510.00844","created_at":"2026-05-18T00:58:04.410002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00844v3","created_at":"2026-05-18T00:58:04.410002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00844","created_at":"2026-05-18T00:58:04.410002+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAUHDLT3PTPX","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAUHDLT3PTPXKPD2","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAUHDLT3","created_at":"2026-05-18T12:29:27.538025+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/KAUHDLT3PTPXKPD2GBZZWI2IY4","json":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4.json","graph_json":"https://pith.science/api/pith-number/KAUHDLT3PTPXKPD2GBZZWI2IY4/graph.json","events_json":"https://pith.science/api/pith-number/KAUHDLT3PTPXKPD2GBZZWI2IY4/events.json","paper":"https://pith.science/paper/KAUHDLT3"},"agent_actions":{"view_html":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4","download_json":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4.json","view_paper":"https://pith.science/paper/KAUHDLT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00844&json=true","fetch_graph":"https://pith.science/api/pith-number/KAUHDLT3PTPXKPD2GBZZWI2IY4/graph.json","fetch_events":"https://pith.science/api/pith-number/KAUHDLT3PTPXKPD2GBZZWI2IY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4/action/storage_attestation","attest_author":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4/action/author_attestation","sign_citation":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4/action/citation_signature","submit_replication":"https://pith.science/pith/KAUHDLT3PTPXKPD2GBZZWI2IY4/action/replication_record"}},"created_at":"2026-05-18T00:58:04.410002+00:00","updated_at":"2026-05-18T00:58:04.410002+00:00"}