{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZALFVVXNL25X56KVS5M4HNJRPO","short_pith_number":"pith:ZALFVVXN","canonical_record":{"source":{"id":"2010.08526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-10-16T17:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"678de9bdbd5208a7615cbd7f0e405dc850af1e7080ea10b76776074a8df8e476","abstract_canon_sha256":"19b26fc76e19171915e0b9426327d28626468bb5cdabe613d267692465898977"},"schema_version":"1.0"},"canonical_sha256":"c8165ad6ed5ebb7ef9559759c3b5317b93688329801c7cfe981bda904cd3a601","source":{"kind":"arxiv","id":"2010.08526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.08526","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"arxiv_version","alias_value":"2010.08526v1","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08526","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZALFVVXNL25X","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"pith_short_16","alias_value":"ZALFVVXNL25X56KV","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"pith_short_8","alias_value":"ZALFVVXN","created_at":"2026-07-05T01:43:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZALFVVXNL25X56KVS5M4HNJRPO","target":"record","payload":{"canonical_record":{"source":{"id":"2010.08526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-10-16T17:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"678de9bdbd5208a7615cbd7f0e405dc850af1e7080ea10b76776074a8df8e476","abstract_canon_sha256":"19b26fc76e19171915e0b9426327d28626468bb5cdabe613d267692465898977"},"schema_version":"1.0"},"canonical_sha256":"c8165ad6ed5ebb7ef9559759c3b5317b93688329801c7cfe981bda904cd3a601","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:35.750002Z","signature_b64":"lVL/kNWtIcpXp38mkIRuOHf/fSUJBVgm1drp0wFDi9M/wNGk4jTkX6fQaWrAi/1jNSe0iwwMUux6qON/2F3VDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8165ad6ed5ebb7ef9559759c3b5317b93688329801c7cfe981bda904cd3a601","last_reissued_at":"2026-07-05T01:43:35.749574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:35.749574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.08526","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-05T01:43:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oP74JKn+l+EyamQadF8Y5C22sF2+pQZWxdp9ei46B28ghDDdbp4JnnsYfqZlnl0SNfiNailS+TtFRnpCSqaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:16:30.020896Z"},"content_sha256":"9d35d455d4fd2472a583ee7af5e5ef03c29581bd1547a22e9901b18344a0d99d","schema_version":"1.0","event_id":"sha256:9d35d455d4fd2472a583ee7af5e5ef03c29581bd1547a22e9901b18344a0d99d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZALFVVXNL25X56KVS5M4HNJRPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Bulu\\c{c}, Md Taufique Hussain, Oguz Selvitopi","submitted_at":"2020-10-16T17:37:53Z","abstract_excerpt":"Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. In this paper, we consider SpGEMMs performed on hundreds of thousands of processors generating trillions of nonzeros in the output matrix. Distributed SpGEMM at this extreme scale faces two key challenges: (1) high communication cost and (2) inadequate memory to generate the output. We address these challenges with an integrated communication-avoiding and memory-constrained SpGEMM algorithm that scales to 262,144 cores (more than 1 million hardware thread"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08526","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/2010.08526/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-05T01:43:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/2aoBYboc6XGcpj6MJUI0E6Wr05FO6t79Qc4kv08PQ82YWmu6KVw+pdx0TgyJ2pkVJlLfwj0Y2LuOV6ukX1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:16:30.021289Z"},"content_sha256":"69f606e4476beb986618a9d7f80f64f44e853a0cdd6cffb9c494ef8dec597d56","schema_version":"1.0","event_id":"sha256:69f606e4476beb986618a9d7f80f64f44e853a0cdd6cffb9c494ef8dec597d56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZALFVVXNL25X56KVS5M4HNJRPO/bundle.json","state_url":"https://pith.science/pith/ZALFVVXNL25X56KVS5M4HNJRPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZALFVVXNL25X56KVS5M4HNJRPO/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-07T07:16:30Z","links":{"resolver":"https://pith.science/pith/ZALFVVXNL25X56KVS5M4HNJRPO","bundle":"https://pith.science/pith/ZALFVVXNL25X56KVS5M4HNJRPO/bundle.json","state":"https://pith.science/pith/ZALFVVXNL25X56KVS5M4HNJRPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZALFVVXNL25X56KVS5M4HNJRPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZALFVVXNL25X56KVS5M4HNJRPO","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":"19b26fc76e19171915e0b9426327d28626468bb5cdabe613d267692465898977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-10-16T17:37:53Z","title_canon_sha256":"678de9bdbd5208a7615cbd7f0e405dc850af1e7080ea10b76776074a8df8e476"},"schema_version":"1.0","source":{"id":"2010.08526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.08526","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"arxiv_version","alias_value":"2010.08526v1","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08526","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZALFVVXNL25X","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"pith_short_16","alias_value":"ZALFVVXNL25X56KV","created_at":"2026-07-05T01:43:35Z"},{"alias_kind":"pith_short_8","alias_value":"ZALFVVXN","created_at":"2026-07-05T01:43:35Z"}],"graph_snapshots":[{"event_id":"sha256:69f606e4476beb986618a9d7f80f64f44e853a0cdd6cffb9c494ef8dec597d56","target":"graph","created_at":"2026-07-05T01:43:35Z","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/2010.08526/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. In this paper, we consider SpGEMMs performed on hundreds of thousands of processors generating trillions of nonzeros in the output matrix. Distributed SpGEMM at this extreme scale faces two key challenges: (1) high communication cost and (2) inadequate memory to generate the output. We address these challenges with an integrated communication-avoiding and memory-constrained SpGEMM algorithm that scales to 262,144 cores (more than 1 million hardware thread","authors_text":"Ariful Azad, Aydin Bulu\\c{c}, Md Taufique Hussain, Oguz Selvitopi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-10-16T17:37:53Z","title":"Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08526","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:9d35d455d4fd2472a583ee7af5e5ef03c29581bd1547a22e9901b18344a0d99d","target":"record","created_at":"2026-07-05T01:43:35Z","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":"19b26fc76e19171915e0b9426327d28626468bb5cdabe613d267692465898977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-10-16T17:37:53Z","title_canon_sha256":"678de9bdbd5208a7615cbd7f0e405dc850af1e7080ea10b76776074a8df8e476"},"schema_version":"1.0","source":{"id":"2010.08526","kind":"arxiv","version":1}},"canonical_sha256":"c8165ad6ed5ebb7ef9559759c3b5317b93688329801c7cfe981bda904cd3a601","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8165ad6ed5ebb7ef9559759c3b5317b93688329801c7cfe981bda904cd3a601","first_computed_at":"2026-07-05T01:43:35.749574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:43:35.749574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lVL/kNWtIcpXp38mkIRuOHf/fSUJBVgm1drp0wFDi9M/wNGk4jTkX6fQaWrAi/1jNSe0iwwMUux6qON/2F3VDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:43:35.750002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.08526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d35d455d4fd2472a583ee7af5e5ef03c29581bd1547a22e9901b18344a0d99d","sha256:69f606e4476beb986618a9d7f80f64f44e853a0cdd6cffb9c494ef8dec597d56"],"state_sha256":"4ee0bdd19b145234546b2798eeb41a6c57b2278e0bee4a331d428144d121b2f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxmjR50dGJyccrxn0Ms3o5Paz9a/f5fmnNm6pGi+piswGjeYTeAlnPir0C6drTUbYKReG1LFC8NDXXlHGpnrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:16:30.023447Z","bundle_sha256":"2935bccb271151967808c864250c1fbb4744831f7cbd20f15c98667abed40cb0"}}