{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EKJGUFE7AYKQLVLOLISF3LKVBB","short_pith_number":"pith:EKJGUFE7","schema_version":"1.0","canonical_sha256":"22926a149f061505d56e5a245dad55085a6c8e0c748733ed188d8905f3814229","source":{"kind":"arxiv","id":"2112.10223","version":1},"attestation_state":"computed","paper":{"title":"Parallel Algorithms for Adding a Collection of Sparse Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Bulu\\c{c}, Guttu Sai Abhishek, Md Taufique Hussain","submitted_at":"2021-12-19T18:52:20Z","abstract_excerpt":"We develop a family of parallel algorithms for the SpKAdd operation that adds a collection of k sparse matrices. SpKAdd is a much needed operation in many applications including distributed memory sparse matrix-matrix multiplication (SpGEMM), streaming accumulations of graphs, and algorithmic sparsification of the gradient updates in deep learning. While adding two sparse matrices is a common operation in Matlab, Python, Intel MKL, and various GraphBLAS libraries, these implementations do not perform well when adding a large collection of sparse matrices. We develop a series of algorithms usin"},"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":"2112.10223","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-12-19T18:52:20Z","cross_cats_sorted":[],"title_canon_sha256":"124c7197e82434bccd6d50f3d4584eb16a55144d64cc5417fc7c82bdcf1993cc","abstract_canon_sha256":"ebe988fa5f5d7ae3068e400930ad0815fe8e9bcc3a7d4218672c743b1d26c337"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:42:12.583940Z","signature_b64":"B0FL3lCSbM7PC0WZjqCip3P8jQQxUYpE0OUm4MsBY+Ubr11FOP8XGONuTvEwWkTRMeaMF9rHUWg0cCJqo0g/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22926a149f061505d56e5a245dad55085a6c8e0c748733ed188d8905f3814229","last_reissued_at":"2026-07-05T03:42:12.583593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:42:12.583593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Algorithms for Adding a Collection of Sparse Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Bulu\\c{c}, Guttu Sai Abhishek, Md Taufique Hussain","submitted_at":"2021-12-19T18:52:20Z","abstract_excerpt":"We develop a family of parallel algorithms for the SpKAdd operation that adds a collection of k sparse matrices. SpKAdd is a much needed operation in many applications including distributed memory sparse matrix-matrix multiplication (SpGEMM), streaming accumulations of graphs, and algorithmic sparsification of the gradient updates in deep learning. While adding two sparse matrices is a common operation in Matlab, Python, Intel MKL, and various GraphBLAS libraries, these implementations do not perform well when adding a large collection of sparse matrices. We develop a series of algorithms usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10223","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/2112.10223/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":"2112.10223","created_at":"2026-07-05T03:42:12.583652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.10223v1","created_at":"2026-07-05T03:42:12.583652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10223","created_at":"2026-07-05T03:42:12.583652+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKJGUFE7AYKQ","created_at":"2026-07-05T03:42:12.583652+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKJGUFE7AYKQLVLO","created_at":"2026-07-05T03:42:12.583652+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKJGUFE7","created_at":"2026-07-05T03:42:12.583652+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/EKJGUFE7AYKQLVLOLISF3LKVBB","json":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB.json","graph_json":"https://pith.science/api/pith-number/EKJGUFE7AYKQLVLOLISF3LKVBB/graph.json","events_json":"https://pith.science/api/pith-number/EKJGUFE7AYKQLVLOLISF3LKVBB/events.json","paper":"https://pith.science/paper/EKJGUFE7"},"agent_actions":{"view_html":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB","download_json":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB.json","view_paper":"https://pith.science/paper/EKJGUFE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.10223&json=true","fetch_graph":"https://pith.science/api/pith-number/EKJGUFE7AYKQLVLOLISF3LKVBB/graph.json","fetch_events":"https://pith.science/api/pith-number/EKJGUFE7AYKQLVLOLISF3LKVBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/action/storage_attestation","attest_author":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/action/author_attestation","sign_citation":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/action/citation_signature","submit_replication":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/action/replication_record"}},"created_at":"2026-07-05T03:42:12.583652+00:00","updated_at":"2026-07-05T03:42:12.583652+00:00"}