{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XLUJXCITD57IRAP6Q2M7E335ZY","short_pith_number":"pith:XLUJXCIT","schema_version":"1.0","canonical_sha256":"bae89b89131f7e8881fe8699f26f7dce3d8aedf5eb27a834f707f9d6cb40c10f","source":{"kind":"arxiv","id":"1705.10218","version":1},"attestation_state":"computed","paper":{"title":"Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Alfio Lazzaro, Joost VandeVondele, Juerg Hutter, Ole Schuett","submitted_at":"2017-05-29T14:42:14Z","abstract_excerpt":"Matrix-matrix multiplication is a basic operation in linear algebra and an essential building block for a wide range of algorithms in various scientific fields. Theory and implementation for the dense, square matrix case are well-developed. If matrices are sparse, with application-specific sparsity patterns, the optimal implementation remains an open question. Here, we explore the performance of communication reducing 2.5D algorithms and one-sided MPI communication in the context of linear scaling electronic structure theory. In particular, we extend the DBCSR sparse matrix library, which is t"},"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":"1705.10218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:42:14Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"0e2d2ce5188e815ca4378b9e7e062acee8c61d2e7017dedfc58816e7d4f97070","abstract_canon_sha256":"9fa4760469d6c248bf8542b55af6685cf1a85ec5d9b2f1d173e271e1a4831ef8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.293651Z","signature_b64":"YK3bCeJG7Qr8vCZQjmIFIy+U8XKGaUDu+TRgb345GGHULali2JptxBhtZO9ic5EsMnJ/SXqcv+YMBBHdfK6lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae89b89131f7e8881fe8699f26f7dce3d8aedf5eb27a834f707f9d6cb40c10f","last_reissued_at":"2026-05-18T00:43:20.293090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.293090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DC","authors_text":"Alfio Lazzaro, Joost VandeVondele, Juerg Hutter, Ole Schuett","submitted_at":"2017-05-29T14:42:14Z","abstract_excerpt":"Matrix-matrix multiplication is a basic operation in linear algebra and an essential building block for a wide range of algorithms in various scientific fields. Theory and implementation for the dense, square matrix case are well-developed. If matrices are sparse, with application-specific sparsity patterns, the optimal implementation remains an open question. Here, we explore the performance of communication reducing 2.5D algorithms and one-sided MPI communication in the context of linear scaling electronic structure theory. In particular, we extend the DBCSR sparse matrix library, which is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10218","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":""},"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":"1705.10218","created_at":"2026-05-18T00:43:20.293191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10218v1","created_at":"2026-05-18T00:43:20.293191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10218","created_at":"2026-05-18T00:43:20.293191+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLUJXCITD57I","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLUJXCITD57IRAP6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLUJXCIT","created_at":"2026-05-18T12:31:56.362134+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/XLUJXCITD57IRAP6Q2M7E335ZY","json":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY.json","graph_json":"https://pith.science/api/pith-number/XLUJXCITD57IRAP6Q2M7E335ZY/graph.json","events_json":"https://pith.science/api/pith-number/XLUJXCITD57IRAP6Q2M7E335ZY/events.json","paper":"https://pith.science/paper/XLUJXCIT"},"agent_actions":{"view_html":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY","download_json":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY.json","view_paper":"https://pith.science/paper/XLUJXCIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10218&json=true","fetch_graph":"https://pith.science/api/pith-number/XLUJXCITD57IRAP6Q2M7E335ZY/graph.json","fetch_events":"https://pith.science/api/pith-number/XLUJXCITD57IRAP6Q2M7E335ZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/action/storage_attestation","attest_author":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/action/author_attestation","sign_citation":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/action/citation_signature","submit_replication":"https://pith.science/pith/XLUJXCITD57IRAP6Q2M7E335ZY/action/replication_record"}},"created_at":"2026-05-18T00:43:20.293191+00:00","updated_at":"2026-05-18T00:43:20.293191+00:00"}