{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RV7GP4ZD6QOJGLJL65XXRXQO7E","short_pith_number":"pith:RV7GP4ZD","canonical_record":{"source":{"id":"1109.3739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-16T23:25:28Z","cross_cats_sorted":["cs.MS","cs.NA","cs.PF"],"title_canon_sha256":"7b403e190e0ee1afa87c612906ab43bf64a59f8a5926bc272e122db6b26b389d","abstract_canon_sha256":"aaa9743cb98ec5e05c61aabb5984316ac03f2ef7a553c8d8630ee0ebdcf8496d"},"schema_version":"1.0"},"canonical_sha256":"8d7e67f323f41c932d2bf76f78de0ef92e91ee01b2e2a65f817714f9c454da8f","source":{"kind":"arxiv","id":"1109.3739","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3739","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3739v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3739","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"RV7GP4ZD6QOJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RV7GP4ZD6QOJGLJL","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RV7GP4ZD","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RV7GP4ZD6QOJGLJL65XXRXQO7E","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-16T23:25:28Z","cross_cats_sorted":["cs.MS","cs.NA","cs.PF"],"title_canon_sha256":"7b403e190e0ee1afa87c612906ab43bf64a59f8a5926bc272e122db6b26b389d","abstract_canon_sha256":"aaa9743cb98ec5e05c61aabb5984316ac03f2ef7a553c8d8630ee0ebdcf8496d"},"schema_version":"1.0"},"canonical_sha256":"8d7e67f323f41c932d2bf76f78de0ef92e91ee01b2e2a65f817714f9c454da8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.587031Z","signature_b64":"vDIQpi7ZCfdElj2Jee9R6Ly4KcWSPHfAa6fdfd+xeCBw5GwaqOuw9DoW5iycFI8fmFYsQCq/ZZqEn/QTDFlgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d7e67f323f41c932d2bf76f78de0ef92e91ee01b2e2a65f817714f9c454da8f","last_reissued_at":"2026-05-18T02:21:36.586555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.586555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3739","source_version":2,"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-05-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kA/K8uVyDRdyRrTqWHQtZXmTOdt7NnOcMaNCBO2RTKRFw0zTvTNhaWfCfR4aqy320Q7CPmozEziSCDaUGLhxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:10:21.666959Z"},"content_sha256":"dc3b6f78e5e4d16d584b905e1734e2f30fe5e6e49c4939750ec80f9c49063e50","schema_version":"1.0","event_id":"sha256:dc3b6f78e5e4d16d584b905e1734e2f30fe5e6e49c4939750ec80f9c49063e50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RV7GP4ZD6QOJGLJL65XXRXQO7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","cs.PF"],"primary_cat":"cs.DC","authors_text":"Aydin Buluc, John Gilbert","submitted_at":"2011-09-16T23:25:28Z","abstract_excerpt":"Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. Here we show that SpGEMM also yields efficient algorithms for general sparse-matrix indexing in distributed memory, provided that the underlying SpGEMM implementation is sufficiently flexible and scalable. We demonstrate that our parallel SpGEMM methods, which use two-dimensional block data distributions with serial hypersparse kernels, are indeed highly flexible, scalable, and memory-efficient in the general "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3739","kind":"arxiv","version":2},"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"},"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-05-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lq2lfDBE/hwuCFoLf0liC/w1+ZUnnuinAPi6C85UE+yE16UDaQhAsgmqu9TFoqCbSDQu4vEZZnk2FHdkczYjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:10:21.667306Z"},"content_sha256":"7bea999b02a466d6f03d79620199d685385a663edb7cf95a069a042d914ec6f2","schema_version":"1.0","event_id":"sha256:7bea999b02a466d6f03d79620199d685385a663edb7cf95a069a042d914ec6f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RV7GP4ZD6QOJGLJL65XXRXQO7E/bundle.json","state_url":"https://pith.science/pith/RV7GP4ZD6QOJGLJL65XXRXQO7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RV7GP4ZD6QOJGLJL65XXRXQO7E/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-06-03T14:10:21Z","links":{"resolver":"https://pith.science/pith/RV7GP4ZD6QOJGLJL65XXRXQO7E","bundle":"https://pith.science/pith/RV7GP4ZD6QOJGLJL65XXRXQO7E/bundle.json","state":"https://pith.science/pith/RV7GP4ZD6QOJGLJL65XXRXQO7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RV7GP4ZD6QOJGLJL65XXRXQO7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RV7GP4ZD6QOJGLJL65XXRXQO7E","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":"aaa9743cb98ec5e05c61aabb5984316ac03f2ef7a553c8d8630ee0ebdcf8496d","cross_cats_sorted":["cs.MS","cs.NA","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-16T23:25:28Z","title_canon_sha256":"7b403e190e0ee1afa87c612906ab43bf64a59f8a5926bc272e122db6b26b389d"},"schema_version":"1.0","source":{"id":"1109.3739","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3739","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3739v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3739","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"RV7GP4ZD6QOJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RV7GP4ZD6QOJGLJL","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RV7GP4ZD","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:7bea999b02a466d6f03d79620199d685385a663edb7cf95a069a042d914ec6f2","target":"graph","created_at":"2026-05-18T02:21:36Z","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"},"paper":{"abstract_excerpt":"Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. Here we show that SpGEMM also yields efficient algorithms for general sparse-matrix indexing in distributed memory, provided that the underlying SpGEMM implementation is sufficiently flexible and scalable. We demonstrate that our parallel SpGEMM methods, which use two-dimensional block data distributions with serial hypersparse kernels, are indeed highly flexible, scalable, and memory-efficient in the general ","authors_text":"Aydin Buluc, John Gilbert","cross_cats":["cs.MS","cs.NA","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-16T23:25:28Z","title":"Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3739","kind":"arxiv","version":2},"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:dc3b6f78e5e4d16d584b905e1734e2f30fe5e6e49c4939750ec80f9c49063e50","target":"record","created_at":"2026-05-18T02:21:36Z","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":"aaa9743cb98ec5e05c61aabb5984316ac03f2ef7a553c8d8630ee0ebdcf8496d","cross_cats_sorted":["cs.MS","cs.NA","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-16T23:25:28Z","title_canon_sha256":"7b403e190e0ee1afa87c612906ab43bf64a59f8a5926bc272e122db6b26b389d"},"schema_version":"1.0","source":{"id":"1109.3739","kind":"arxiv","version":2}},"canonical_sha256":"8d7e67f323f41c932d2bf76f78de0ef92e91ee01b2e2a65f817714f9c454da8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d7e67f323f41c932d2bf76f78de0ef92e91ee01b2e2a65f817714f9c454da8f","first_computed_at":"2026-05-18T02:21:36.586555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.586555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vDIQpi7ZCfdElj2Jee9R6Ly4KcWSPHfAa6fdfd+xeCBw5GwaqOuw9DoW5iycFI8fmFYsQCq/ZZqEn/QTDFlgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.587031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3739","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc3b6f78e5e4d16d584b905e1734e2f30fe5e6e49c4939750ec80f9c49063e50","sha256:7bea999b02a466d6f03d79620199d685385a663edb7cf95a069a042d914ec6f2"],"state_sha256":"b306db016430bd60d990171e47a31ca64291769d6944231d9f6571b8133b3244"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50QS5OBPy6FDpQhCxkExHmYlh64Yh5fnzYfXG1fO7hEjcOVJG9vfMWzpWs8a01YsHXT8i8C9Vl+5gqtm8ueFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:10:21.669226Z","bundle_sha256":"3ffafcda87899b969f06961ce0dda45a4c78b8f1563d46b498ef2f310454cd5d"}}