{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UFASITV24PWFCVFJA44SN6QJ7S","short_pith_number":"pith:UFASITV2","canonical_record":{"source":{"id":"1801.03065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-09T18:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"2aba1367587186c60a823f2e859af783b14bc8a493b5aa47313838edb26ded0a","abstract_canon_sha256":"d8e005facb20a899697bd73079acb844a7fb6064698c051de85cc5149e3fbb54"},"schema_version":"1.0"},"canonical_sha256":"a141244ebae3ec5154a9073926fa09fcb360b1cc091be13c817be917fdf23866","source":{"kind":"arxiv","id":"1801.03065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03065","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03065v1","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03065","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"UFASITV24PWF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UFASITV24PWFCVFJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UFASITV2","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UFASITV24PWFCVFJA44SN6QJ7S","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-09T18:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"2aba1367587186c60a823f2e859af783b14bc8a493b5aa47313838edb26ded0a","abstract_canon_sha256":"d8e005facb20a899697bd73079acb844a7fb6064698c051de85cc5149e3fbb54"},"schema_version":"1.0"},"canonical_sha256":"a141244ebae3ec5154a9073926fa09fcb360b1cc091be13c817be917fdf23866","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:21.662155Z","signature_b64":"feXfTUmozGNLedDaWbOvbyuOkW+F1iJsPnPtc/s/uXaGjEcYFZcT+h6ynL9ozBgeLVau7YL1q/tDydgcJuQkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a141244ebae3ec5154a9073926fa09fcb360b1cc091be13c817be917fdf23866","last_reissued_at":"2026-05-18T00:26:21.661375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:21.661375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03065","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-05-18T00:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vg/sIdL0xx8JB/FS+sUGelgPCT2GW+RGi6r0wc4CV2eD+EoHsQqLsU1YnrQMhK+68fi2ZlhPW5EdFA5UJJThBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:39:31.301241Z"},"content_sha256":"9dd1d3f171657b557141cf7aaf4d7de8ff8bb704117534216870fd56a268fa02","schema_version":"1.0","event_id":"sha256:9dd1d3f171657b557141cf7aaf4d7de8ff8bb704117534216870fd56a268fa02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UFASITV24PWFCVFJA44SN6QJ7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-threaded Sparse Matrix-Matrix Multiplication for Many-Core and GPU Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Trott, Mehmet Deveci, Sivasankaran Rajamanickam","submitted_at":"2018-01-09T18:07:40Z","abstract_excerpt":"Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03065","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":""},"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-18T00:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdP1SGVOb6zuAWy1N6vAAee/jvLJEZm6DAJRqt/stv/nnPjradfVbgDLyll7tS+1Xn25pBAw0z6v5kxhPm8qBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:39:31.301609Z"},"content_sha256":"438b7ecdd2a32291f74835b68e5242732af172cb401ff48ffc463b1974fbfefc","schema_version":"1.0","event_id":"sha256:438b7ecdd2a32291f74835b68e5242732af172cb401ff48ffc463b1974fbfefc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFASITV24PWFCVFJA44SN6QJ7S/bundle.json","state_url":"https://pith.science/pith/UFASITV24PWFCVFJA44SN6QJ7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFASITV24PWFCVFJA44SN6QJ7S/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-02T22:39:31Z","links":{"resolver":"https://pith.science/pith/UFASITV24PWFCVFJA44SN6QJ7S","bundle":"https://pith.science/pith/UFASITV24PWFCVFJA44SN6QJ7S/bundle.json","state":"https://pith.science/pith/UFASITV24PWFCVFJA44SN6QJ7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFASITV24PWFCVFJA44SN6QJ7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UFASITV24PWFCVFJA44SN6QJ7S","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":"d8e005facb20a899697bd73079acb844a7fb6064698c051de85cc5149e3fbb54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-09T18:07:40Z","title_canon_sha256":"2aba1367587186c60a823f2e859af783b14bc8a493b5aa47313838edb26ded0a"},"schema_version":"1.0","source":{"id":"1801.03065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03065","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03065v1","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03065","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"UFASITV24PWF","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UFASITV24PWFCVFJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UFASITV2","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:438b7ecdd2a32291f74835b68e5242732af172cb401ff48ffc463b1974fbfefc","target":"graph","created_at":"2026-05-18T00:26:21Z","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":"Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between ","authors_text":"Christian Trott, Mehmet Deveci, Sivasankaran Rajamanickam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-09T18:07:40Z","title":"Multi-threaded Sparse Matrix-Matrix Multiplication for Many-Core and GPU Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03065","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:9dd1d3f171657b557141cf7aaf4d7de8ff8bb704117534216870fd56a268fa02","target":"record","created_at":"2026-05-18T00:26:21Z","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":"d8e005facb20a899697bd73079acb844a7fb6064698c051de85cc5149e3fbb54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-09T18:07:40Z","title_canon_sha256":"2aba1367587186c60a823f2e859af783b14bc8a493b5aa47313838edb26ded0a"},"schema_version":"1.0","source":{"id":"1801.03065","kind":"arxiv","version":1}},"canonical_sha256":"a141244ebae3ec5154a9073926fa09fcb360b1cc091be13c817be917fdf23866","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a141244ebae3ec5154a9073926fa09fcb360b1cc091be13c817be917fdf23866","first_computed_at":"2026-05-18T00:26:21.661375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:21.661375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"feXfTUmozGNLedDaWbOvbyuOkW+F1iJsPnPtc/s/uXaGjEcYFZcT+h6ynL9ozBgeLVau7YL1q/tDydgcJuQkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:21.662155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dd1d3f171657b557141cf7aaf4d7de8ff8bb704117534216870fd56a268fa02","sha256:438b7ecdd2a32291f74835b68e5242732af172cb401ff48ffc463b1974fbfefc"],"state_sha256":"e5da9d87b799fcae894a852f3b199b199fb6d0dc909443509bada94579519a45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgXGRWtDlSpQIkqKVrvtA1nM6f3oL747ep2hChbsZ0j6ub4R9I1qQtY9bLB6RoTPTCGAKyN2AXiYSWJb0CrzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:39:31.303701Z","bundle_sha256":"7e18c26a665c543748a30abdf2b4ec3d5ca0aab076b21c30a119b93f88bb7ea8"}}