{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GM7ZRC6KYUMWIYZQK43M6XOZBY","short_pith_number":"pith:GM7ZRC6K","canonical_record":{"source":{"id":"2002.11302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-26T04:47:54Z","cross_cats_sorted":[],"title_canon_sha256":"35f6f62da54729f8fe6c548d5860e3e857abaf3f75ebdfa325a56f6a83b5024c","abstract_canon_sha256":"c457bf5a80c02d53e7127b43f44d297d0b6cdb77f5e552bdf518ad377a30b902"},"schema_version":"1.0"},"canonical_sha256":"333f988bcac5196463305736cf5dd90e1be1c80371414076e548e09231ec8c79","source":{"kind":"arxiv","id":"2002.11302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.11302","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"2002.11302v1","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11302","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"GM7ZRC6KYUMW","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"pith_short_16","alias_value":"GM7ZRC6KYUMWIYZQ","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"pith_short_8","alias_value":"GM7ZRC6K","created_at":"2026-07-05T00:44:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GM7ZRC6KYUMWIYZQK43M6XOZBY","target":"record","payload":{"canonical_record":{"source":{"id":"2002.11302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-26T04:47:54Z","cross_cats_sorted":[],"title_canon_sha256":"35f6f62da54729f8fe6c548d5860e3e857abaf3f75ebdfa325a56f6a83b5024c","abstract_canon_sha256":"c457bf5a80c02d53e7127b43f44d297d0b6cdb77f5e552bdf518ad377a30b902"},"schema_version":"1.0"},"canonical_sha256":"333f988bcac5196463305736cf5dd90e1be1c80371414076e548e09231ec8c79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:00.858585Z","signature_b64":"i//khtD/j2qMs2tikynVYHJS0tux5DOrvMdPXFb9+mf+aTbG1Qxy86d2IrWg7ivwYC2TNft/u+qAZp11vRjrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"333f988bcac5196463305736cf5dd90e1be1c80371414076e548e09231ec8c79","last_reissued_at":"2026-07-05T00:44:00.858112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:00.858112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.11302","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-05T00:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIKvO1CHjzWf7EaltQ79jKHYzYL6plKmxhye4ahXO57hajB92PCN8Vvv5S7i2U5RlN+YFUr6BWyztVmY9gBXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:26:40.217208Z"},"content_sha256":"73a9e62a4aa481b1966e6cfa3c1430b5211905b4dac8558dbdbe42a08215cf87","schema_version":"1.0","event_id":"sha256:73a9e62a4aa481b1966e6cfa3c1430b5211905b4dac8558dbdbe42a08215cf87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GM7ZRC6KYUMWIYZQK43M6XOZBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bandwidth-Optimized Parallel Algorithms for Sparse Matrix-Matrix Multiplication using Propagation Blocking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, David Edelsohn, Jose Moreira, Zhixiang Gu","submitted_at":"2020-02-26T04:47:54Z","abstract_excerpt":"Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. It is well known that SpGEMM is a memory-bound operation, and its peak performance is expected to be bound by the memory bandwidth. Yet, existing algorithms fail to saturate the memory bandwidth, resulting in suboptimal performance under the Roofline model. In this paper we characterize existing SpGEMM algorithms based on their memory access patterns and develop practical lower and upper bounds for SpGEMM performance. We then develop an SpGEMM algorithm b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11302","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/2002.11302/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-05T00:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOMjROQCq6SHzFyNsV7Mgip1nnSYkAUVl5MZgsNCkEFsUYXYhQCsiEvWn382iSXAwlBwg6yMpoTb1Zwj2ZSuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:26:40.217625Z"},"content_sha256":"3424a119d496e95c792cfaca9a43591b3b52c1b46514121d5e61b7c1e3ff1ddc","schema_version":"1.0","event_id":"sha256:3424a119d496e95c792cfaca9a43591b3b52c1b46514121d5e61b7c1e3ff1ddc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GM7ZRC6KYUMWIYZQK43M6XOZBY/bundle.json","state_url":"https://pith.science/pith/GM7ZRC6KYUMWIYZQK43M6XOZBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GM7ZRC6KYUMWIYZQK43M6XOZBY/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-07T09:26:40Z","links":{"resolver":"https://pith.science/pith/GM7ZRC6KYUMWIYZQK43M6XOZBY","bundle":"https://pith.science/pith/GM7ZRC6KYUMWIYZQK43M6XOZBY/bundle.json","state":"https://pith.science/pith/GM7ZRC6KYUMWIYZQK43M6XOZBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GM7ZRC6KYUMWIYZQK43M6XOZBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GM7ZRC6KYUMWIYZQK43M6XOZBY","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":"c457bf5a80c02d53e7127b43f44d297d0b6cdb77f5e552bdf518ad377a30b902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-26T04:47:54Z","title_canon_sha256":"35f6f62da54729f8fe6c548d5860e3e857abaf3f75ebdfa325a56f6a83b5024c"},"schema_version":"1.0","source":{"id":"2002.11302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.11302","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"2002.11302v1","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11302","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"GM7ZRC6KYUMW","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"pith_short_16","alias_value":"GM7ZRC6KYUMWIYZQ","created_at":"2026-07-05T00:44:00Z"},{"alias_kind":"pith_short_8","alias_value":"GM7ZRC6K","created_at":"2026-07-05T00:44:00Z"}],"graph_snapshots":[{"event_id":"sha256:3424a119d496e95c792cfaca9a43591b3b52c1b46514121d5e61b7c1e3ff1ddc","target":"graph","created_at":"2026-07-05T00:44:00Z","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/2002.11302/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. It is well known that SpGEMM is a memory-bound operation, and its peak performance is expected to be bound by the memory bandwidth. Yet, existing algorithms fail to saturate the memory bandwidth, resulting in suboptimal performance under the Roofline model. In this paper we characterize existing SpGEMM algorithms based on their memory access patterns and develop practical lower and upper bounds for SpGEMM performance. We then develop an SpGEMM algorithm b","authors_text":"Ariful Azad, David Edelsohn, Jose Moreira, Zhixiang Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-26T04:47:54Z","title":"Bandwidth-Optimized Parallel Algorithms for Sparse Matrix-Matrix Multiplication using Propagation Blocking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11302","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:73a9e62a4aa481b1966e6cfa3c1430b5211905b4dac8558dbdbe42a08215cf87","target":"record","created_at":"2026-07-05T00:44:00Z","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":"c457bf5a80c02d53e7127b43f44d297d0b6cdb77f5e552bdf518ad377a30b902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-26T04:47:54Z","title_canon_sha256":"35f6f62da54729f8fe6c548d5860e3e857abaf3f75ebdfa325a56f6a83b5024c"},"schema_version":"1.0","source":{"id":"2002.11302","kind":"arxiv","version":1}},"canonical_sha256":"333f988bcac5196463305736cf5dd90e1be1c80371414076e548e09231ec8c79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"333f988bcac5196463305736cf5dd90e1be1c80371414076e548e09231ec8c79","first_computed_at":"2026-07-05T00:44:00.858112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:44:00.858112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i//khtD/j2qMs2tikynVYHJS0tux5DOrvMdPXFb9+mf+aTbG1Qxy86d2IrWg7ivwYC2TNft/u+qAZp11vRjrAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:44:00.858585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.11302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73a9e62a4aa481b1966e6cfa3c1430b5211905b4dac8558dbdbe42a08215cf87","sha256:3424a119d496e95c792cfaca9a43591b3b52c1b46514121d5e61b7c1e3ff1ddc"],"state_sha256":"5d0c8713b2a3dac249136f7fd688f6441a7f21efe81bf2687024e9356896fae8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sa8D6t0HbFlYrAT/UH5z5Oj9TPOqxPJ5KvW6+aolWLiKXasgv8aZRupq5i6TPyjOol74eIqw5rLCFeHqbTrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:26:40.219545Z","bundle_sha256":"5a786ed5c9a77ce859298570a535087d0c885eea751bd4d2eaf18bdf88812989"}}