{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:EKJGUFE7AYKQLVLOLISF3LKVBB","short_pith_number":"pith:EKJGUFE7","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"},"canonical_sha256":"22926a149f061505d56e5a245dad55085a6c8e0c748733ed188d8905f3814229","source":{"kind":"arxiv","id":"2112.10223","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.10223","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"2112.10223v1","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10223","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"EKJGUFE7AYKQ","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKJGUFE7AYKQLVLO","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKJGUFE7","created_at":"2026-07-05T03:42:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:EKJGUFE7AYKQLVLOLISF3LKVBB","target":"record","payload":{"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"},"canonical_sha256":"22926a149f061505d56e5a245dad55085a6c8e0c748733ed188d8905f3814229","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"},"source_kind":"arxiv","source_id":"2112.10223","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LB8EZbwGxnJB/LM+AcS+F7t1aHDCkcXu18tQHQ6nM5WsytnPCDN1saBwiES5nnRliEamnkfsMQpCjaa65PELDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:32:00.225571Z"},"content_sha256":"c6c4785c1a583af03c3bc9748ac359afcac821a3dac0c53f369b12689cce7789","schema_version":"1.0","event_id":"sha256:c6c4785c1a583af03c3bc9748ac359afcac821a3dac0c53f369b12689cce7789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:EKJGUFE7AYKQLVLOLISF3LKVBB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/55uTdlHVAKlxzFDp88nXdxFuGh7Y4M73aXqSa346+ZaHCLXebfJZ1Tm6v0Vz4ZQn+oMobRkWXHZazr4krlQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:32:00.225967Z"},"content_sha256":"91823efde9b0a1478e8156440f741aafb8110161b9a415b6b64d38e9a9db9e75","schema_version":"1.0","event_id":"sha256:91823efde9b0a1478e8156440f741aafb8110161b9a415b6b64d38e9a9db9e75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/bundle.json","state_url":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T13:32:00Z","links":{"resolver":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB","bundle":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/bundle.json","state":"https://pith.science/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKJGUFE7AYKQLVLOLISF3LKVBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EKJGUFE7AYKQLVLOLISF3LKVBB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ebe988fa5f5d7ae3068e400930ad0815fe8e9bcc3a7d4218672c743b1d26c337","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-12-19T18:52:20Z","title_canon_sha256":"124c7197e82434bccd6d50f3d4584eb16a55144d64cc5417fc7c82bdcf1993cc"},"schema_version":"1.0","source":{"id":"2112.10223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.10223","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"2112.10223v1","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10223","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"EKJGUFE7AYKQ","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKJGUFE7AYKQLVLO","created_at":"2026-07-05T03:42:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKJGUFE7","created_at":"2026-07-05T03:42:12Z"}],"graph_snapshots":[{"event_id":"sha256:91823efde9b0a1478e8156440f741aafb8110161b9a415b6b64d38e9a9db9e75","target":"graph","created_at":"2026-07-05T03:42:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.10223/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ariful Azad, Aydin Bulu\\c{c}, Guttu Sai Abhishek, Md Taufique Hussain","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-12-19T18:52:20Z","title":"Parallel Algorithms for Adding a Collection of Sparse Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10223","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6c4785c1a583af03c3bc9748ac359afcac821a3dac0c53f369b12689cce7789","target":"record","created_at":"2026-07-05T03:42:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ebe988fa5f5d7ae3068e400930ad0815fe8e9bcc3a7d4218672c743b1d26c337","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-12-19T18:52:20Z","title_canon_sha256":"124c7197e82434bccd6d50f3d4584eb16a55144d64cc5417fc7c82bdcf1993cc"},"schema_version":"1.0","source":{"id":"2112.10223","kind":"arxiv","version":1}},"canonical_sha256":"22926a149f061505d56e5a245dad55085a6c8e0c748733ed188d8905f3814229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22926a149f061505d56e5a245dad55085a6c8e0c748733ed188d8905f3814229","first_computed_at":"2026-07-05T03:42:12.583593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:42:12.583593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0FL3lCSbM7PC0WZjqCip3P8jQQxUYpE0OUm4MsBY+Ubr11FOP8XGONuTvEwWkTRMeaMF9rHUWg0cCJqo0g/Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:42:12.583940Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.10223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6c4785c1a583af03c3bc9748ac359afcac821a3dac0c53f369b12689cce7789","sha256:91823efde9b0a1478e8156440f741aafb8110161b9a415b6b64d38e9a9db9e75"],"state_sha256":"19bb162798a44d47fbbdc0ccd615c910de117b498e9381b87268430a03bf6a7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VY9Aht69P8J9CpbQBeVnIkSKqL4gLMy4EuFFRdbHYTMQCQf4/kmr6af3HNGdmVsU3RNH5EVg25csSiFG+shAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:32:00.229195Z","bundle_sha256":"5e39110c5f0229ac8f3f2429f3e6c64eff128e0194978999675e8473efc7003a"}}