{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:S72NNISN6RGPUSS5W3PMI53E3O","short_pith_number":"pith:S72NNISN","canonical_record":{"source":{"id":"1303.1651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-03-07T11:40:27Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"19f51de9b0660a79d247fcb2883df513f0be3742dfd4fde15d55e89a17f19bc2","abstract_canon_sha256":"824f92ee87554b790d7c76a718183022e4b3a2335a80e79c4154816e0219b84d"},"schema_version":"1.0"},"canonical_sha256":"97f4d6a24df44cfa4a5db6dec47764db812852ab295e75bd7c7ffc8bfde21711","source":{"kind":"arxiv","id":"1303.1651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1651","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1651v2","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1651","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"S72NNISN6RGP","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S72NNISN6RGPUSS5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S72NNISN","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:S72NNISN6RGPUSS5W3PMI53E3O","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-03-07T11:40:27Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"19f51de9b0660a79d247fcb2883df513f0be3742dfd4fde15d55e89a17f19bc2","abstract_canon_sha256":"824f92ee87554b790d7c76a718183022e4b3a2335a80e79c4154816e0219b84d"},"schema_version":"1.0"},"canonical_sha256":"97f4d6a24df44cfa4a5db6dec47764db812852ab295e75bd7c7ffc8bfde21711","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:31.913147Z","signature_b64":"9//zT9FCw9cJcUThsoP3tB5lYbcpbSzjUbm+0Ci0ZjcZA0p8hbgo7Hd1S2dJyZ42P74i5YXVY9tqwbqXO3ksAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97f4d6a24df44cfa4a5db6dec47764db812852ab295e75bd7c7ffc8bfde21711","last_reissued_at":"2026-05-18T03:26:31.912547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:31.912547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1651","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-18T03:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ld+NqATNF7339SNhnbAZJRal18GEMjdJh8KYtRBfYiQl1GS/1boNXaarBZ+SlFoGYI95tJC/70y/N8OQO0QsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:37:44.755159Z"},"content_sha256":"567844b47ee706ccb985691ab60de3ef942304a38753f4a2b17d61870cd9a220","schema_version":"1.0","event_id":"sha256:567844b47ee706ccb985691ab60de3ef942304a38753f4a2b17d61870cd9a220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:S72NNISN6RGPUSS5W3PMI53E3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model-guided Performance Analysis of the Sparse Matrix-Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.PF","authors_text":"Georg Hager, Klaus Iglberger, Tobias Scharpff, Ulrich Ruede","submitted_at":"2013-03-07T11:40:27Z","abstract_excerpt":"Achieving high efficiency with numerical kernels for sparse matrices is of utmost importance, since they are part of many simulation codes and tend to use most of the available compute time and resources. In addition, especially in large scale simulation frameworks the readability and ease of use of mathematical expressions are essential components for the continuous maintenance, modification, and extension of software. In this context, the sparse matrix-matrix multiplication is of special interest. In this paper we thoroughly analyze the single-core performance of sparse matrix-matrix multipl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1651","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-18T03:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRvkCwuaImX0MsiEfGL3IzczGptYiY2W5dse7WecEN2IuWme0lPhI2LOT5lMFZEj+yTEL0eEKcr6VlOoo1OBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:37:44.755529Z"},"content_sha256":"5adccf922280dbbff5c680c2f1551e9ba72157b963d8db148a68dcca514e073a","schema_version":"1.0","event_id":"sha256:5adccf922280dbbff5c680c2f1551e9ba72157b963d8db148a68dcca514e073a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S72NNISN6RGPUSS5W3PMI53E3O/bundle.json","state_url":"https://pith.science/pith/S72NNISN6RGPUSS5W3PMI53E3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S72NNISN6RGPUSS5W3PMI53E3O/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-01T06:37:44Z","links":{"resolver":"https://pith.science/pith/S72NNISN6RGPUSS5W3PMI53E3O","bundle":"https://pith.science/pith/S72NNISN6RGPUSS5W3PMI53E3O/bundle.json","state":"https://pith.science/pith/S72NNISN6RGPUSS5W3PMI53E3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S72NNISN6RGPUSS5W3PMI53E3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:S72NNISN6RGPUSS5W3PMI53E3O","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":"824f92ee87554b790d7c76a718183022e4b3a2335a80e79c4154816e0219b84d","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-03-07T11:40:27Z","title_canon_sha256":"19f51de9b0660a79d247fcb2883df513f0be3742dfd4fde15d55e89a17f19bc2"},"schema_version":"1.0","source":{"id":"1303.1651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1651","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1651v2","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1651","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"S72NNISN6RGP","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"S72NNISN6RGPUSS5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"S72NNISN","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:5adccf922280dbbff5c680c2f1551e9ba72157b963d8db148a68dcca514e073a","target":"graph","created_at":"2026-05-18T03:26:31Z","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":"Achieving high efficiency with numerical kernels for sparse matrices is of utmost importance, since they are part of many simulation codes and tend to use most of the available compute time and resources. In addition, especially in large scale simulation frameworks the readability and ease of use of mathematical expressions are essential components for the continuous maintenance, modification, and extension of software. In this context, the sparse matrix-matrix multiplication is of special interest. In this paper we thoroughly analyze the single-core performance of sparse matrix-matrix multipl","authors_text":"Georg Hager, Klaus Iglberger, Tobias Scharpff, Ulrich Ruede","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-03-07T11:40:27Z","title":"Model-guided Performance Analysis of the Sparse Matrix-Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1651","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:567844b47ee706ccb985691ab60de3ef942304a38753f4a2b17d61870cd9a220","target":"record","created_at":"2026-05-18T03:26:31Z","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":"824f92ee87554b790d7c76a718183022e4b3a2335a80e79c4154816e0219b84d","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2013-03-07T11:40:27Z","title_canon_sha256":"19f51de9b0660a79d247fcb2883df513f0be3742dfd4fde15d55e89a17f19bc2"},"schema_version":"1.0","source":{"id":"1303.1651","kind":"arxiv","version":2}},"canonical_sha256":"97f4d6a24df44cfa4a5db6dec47764db812852ab295e75bd7c7ffc8bfde21711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97f4d6a24df44cfa4a5db6dec47764db812852ab295e75bd7c7ffc8bfde21711","first_computed_at":"2026-05-18T03:26:31.912547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:31.912547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9//zT9FCw9cJcUThsoP3tB5lYbcpbSzjUbm+0Ci0ZjcZA0p8hbgo7Hd1S2dJyZ42P74i5YXVY9tqwbqXO3ksAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:31.913147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:567844b47ee706ccb985691ab60de3ef942304a38753f4a2b17d61870cd9a220","sha256:5adccf922280dbbff5c680c2f1551e9ba72157b963d8db148a68dcca514e073a"],"state_sha256":"d3c5d6a77f9a1e83a6a75c218170b3c301aafe44622192e8cc153e57e73b0f3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFfXtwNLGheJLeGDO0Fef9jkG76Xu2BI0dcsJ4lSzgI3Pt9lLrQ/DntlX9BmrXZneyC+dLzh9wf/k9DvIbpRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:37:44.757521Z","bundle_sha256":"6e862f1fa1b3b02a15e91bc6f3d4bf2a26767d89989ab0bab85849bcb0d66c9d"}}