{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MFXO2FDYVEGEIJFYP6R6AZ7ZJ3","short_pith_number":"pith:MFXO2FDY","canonical_record":{"source":{"id":"2507.21253","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-28T18:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"566e3078d765779de7bf9fff30e79cc979f5226dd46ec726749b252767949cf0","abstract_canon_sha256":"5fb355c65e4fc68fe0046f7ae0150559a9603b63c5133c9181a257bd75b58481"},"schema_version":"1.0"},"canonical_sha256":"616eed1478a90c4424b87fa3e067f94eefdbec430a30a465cfa732c2049469c7","source":{"kind":"arxiv","id":"2507.21253","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.21253","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.21253v1","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21253","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"pith_short_12","alias_value":"MFXO2FDYVEGE","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"pith_short_16","alias_value":"MFXO2FDYVEGEIJFY","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"pith_short_8","alias_value":"MFXO2FDY","created_at":"2026-07-05T11:44:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MFXO2FDYVEGEIJFYP6R6AZ7ZJ3","target":"record","payload":{"canonical_record":{"source":{"id":"2507.21253","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-28T18:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"566e3078d765779de7bf9fff30e79cc979f5226dd46ec726749b252767949cf0","abstract_canon_sha256":"5fb355c65e4fc68fe0046f7ae0150559a9603b63c5133c9181a257bd75b58481"},"schema_version":"1.0"},"canonical_sha256":"616eed1478a90c4424b87fa3e067f94eefdbec430a30a465cfa732c2049469c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:55.720700Z","signature_b64":"jGF+KlSt+Tr7Bc3O5BMzC9xmFDqN1pTvdCMBzNeN/OneggxTPHBWqNRu3/IglSABWXp7XYD58bFD365jp7+LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"616eed1478a90c4424b87fa3e067f94eefdbec430a30a465cfa732c2049469c7","last_reissued_at":"2026-07-05T11:44:55.720250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:55.720250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.21253","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-05T11:44:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DM1ddmXUQIXfPyykcCVdiaAQ29b95a4a3sZXuhBfjLzlVz+BO3D3zAje1P9wTSFgRV7fmGC4Is80Oq74mXEUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:15:04.771563Z"},"content_sha256":"402595a235876ccc712ac3012d8b7e1cb9013c3fa1deebcd8cf3f17f96244b30","schema_version":"1.0","event_id":"sha256:402595a235876ccc712ac3012d8b7e1cb9013c3fa1deebcd8cf3f17f96244b30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MFXO2FDYVEGEIJFYP6R6AZ7ZJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving SpGEMM Performance Through Matrix Reordering and Cluster-wise Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abdullah Al Raqibul Islam, Ayd{\\i}n Bulu\\c{c}, Dong Dai, Helen Xu","submitted_at":"2025-07-28T18:16:49Z","abstract_excerpt":"Sparse matrix-sparse matrix multiplication (SpGEMM) is a key kernel in many scientific applications and graph workloads. Unfortunately, SpGEMM is bottlenecked by data movement due to its irregular memory access patterns. Significant work has been devoted to developing row reordering schemes towards improving locality in sparse operations, but prior studies mostly focus on the case of sparse-matrix vector multiplication (SpMV).\n  In this paper, we address these issues with hierarchical clustering for SpGEMM that leverages both row reordering and cluster-wise computation to improve reuse in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21253","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/2507.21253/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-05T11:44:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJbVt7fO6gbv0e2UnOMrYLYsc/Y+0rBE0c+Yeap+l33yJxLRjscdQu5EkYQCGi+YWAHZE+Ja+qYJMEkGrJ82Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:15:04.772289Z"},"content_sha256":"e9e7aa1d72ce98e3ab0b7e7cebe4a7f3e7b537a798721ab46d6a0fa7d3efae8e","schema_version":"1.0","event_id":"sha256:e9e7aa1d72ce98e3ab0b7e7cebe4a7f3e7b537a798721ab46d6a0fa7d3efae8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFXO2FDYVEGEIJFYP6R6AZ7ZJ3/bundle.json","state_url":"https://pith.science/pith/MFXO2FDYVEGEIJFYP6R6AZ7ZJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFXO2FDYVEGEIJFYP6R6AZ7ZJ3/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-08-07T16:15:04Z","links":{"resolver":"https://pith.science/pith/MFXO2FDYVEGEIJFYP6R6AZ7ZJ3","bundle":"https://pith.science/pith/MFXO2FDYVEGEIJFYP6R6AZ7ZJ3/bundle.json","state":"https://pith.science/pith/MFXO2FDYVEGEIJFYP6R6AZ7ZJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFXO2FDYVEGEIJFYP6R6AZ7ZJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MFXO2FDYVEGEIJFYP6R6AZ7ZJ3","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":"5fb355c65e4fc68fe0046f7ae0150559a9603b63c5133c9181a257bd75b58481","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-28T18:16:49Z","title_canon_sha256":"566e3078d765779de7bf9fff30e79cc979f5226dd46ec726749b252767949cf0"},"schema_version":"1.0","source":{"id":"2507.21253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.21253","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.21253v1","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21253","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"pith_short_12","alias_value":"MFXO2FDYVEGE","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"pith_short_16","alias_value":"MFXO2FDYVEGEIJFY","created_at":"2026-07-05T11:44:55Z"},{"alias_kind":"pith_short_8","alias_value":"MFXO2FDY","created_at":"2026-07-05T11:44:55Z"}],"graph_snapshots":[{"event_id":"sha256:e9e7aa1d72ce98e3ab0b7e7cebe4a7f3e7b537a798721ab46d6a0fa7d3efae8e","target":"graph","created_at":"2026-07-05T11:44:55Z","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/2507.21253/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse matrix-sparse matrix multiplication (SpGEMM) is a key kernel in many scientific applications and graph workloads. Unfortunately, SpGEMM is bottlenecked by data movement due to its irregular memory access patterns. Significant work has been devoted to developing row reordering schemes towards improving locality in sparse operations, but prior studies mostly focus on the case of sparse-matrix vector multiplication (SpMV).\n  In this paper, we address these issues with hierarchical clustering for SpGEMM that leverages both row reordering and cluster-wise computation to improve reuse in the ","authors_text":"Abdullah Al Raqibul Islam, Ayd{\\i}n Bulu\\c{c}, Dong Dai, Helen Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-28T18:16:49Z","title":"Improving SpGEMM Performance Through Matrix Reordering and Cluster-wise Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21253","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:402595a235876ccc712ac3012d8b7e1cb9013c3fa1deebcd8cf3f17f96244b30","target":"record","created_at":"2026-07-05T11:44:55Z","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":"5fb355c65e4fc68fe0046f7ae0150559a9603b63c5133c9181a257bd75b58481","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-28T18:16:49Z","title_canon_sha256":"566e3078d765779de7bf9fff30e79cc979f5226dd46ec726749b252767949cf0"},"schema_version":"1.0","source":{"id":"2507.21253","kind":"arxiv","version":1}},"canonical_sha256":"616eed1478a90c4424b87fa3e067f94eefdbec430a30a465cfa732c2049469c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"616eed1478a90c4424b87fa3e067f94eefdbec430a30a465cfa732c2049469c7","first_computed_at":"2026-07-05T11:44:55.720250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:55.720250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jGF+KlSt+Tr7Bc3O5BMzC9xmFDqN1pTvdCMBzNeN/OneggxTPHBWqNRu3/IglSABWXp7XYD58bFD365jp7+LBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:55.720700Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.21253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:402595a235876ccc712ac3012d8b7e1cb9013c3fa1deebcd8cf3f17f96244b30","sha256:e9e7aa1d72ce98e3ab0b7e7cebe4a7f3e7b537a798721ab46d6a0fa7d3efae8e"],"state_sha256":"eca5b21ef7f4d692eca57579c0611b1af7b3d54d813cc507bc228876fdcf0b2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/A7tGP7s/gzXan/BGHxbJV46DSDryoC55AG5TC4G6r2cjdLbZ1IYfxIgHjrgN+eee/qipyD/2zUO52UD0BkwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T16:15:04.778618Z","bundle_sha256":"9e38f7d2df5c4d87128f6e41608be9f16a4aa93c7030ff3f30c7c9c4af433eb3"}}