{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RO6ZCCVHWVKZ7BPFJXPGF3QRZF","short_pith_number":"pith:RO6ZCCVH","canonical_record":{"source":{"id":"1203.2739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-03-13T08:50:14Z","cross_cats_sorted":[],"title_canon_sha256":"8f5775d9519d9562b0fc2af285fcb1bb66ade39a05b2e58003cbfea766d610cf","abstract_canon_sha256":"c2cafaa9b76e1e5451bcd6854a4b4be418871f3d3c492ee3cb62805dbc77e3d6"},"schema_version":"1.0"},"canonical_sha256":"8bbd910aa7b5559f85e54dde62ee11c972345fcce68228aba80271e91b6092e5","source":{"kind":"arxiv","id":"1203.2739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2739","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2739v1","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2739","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"RO6ZCCVHWVKZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RO6ZCCVHWVKZ7BPF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RO6ZCCVH","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RO6ZCCVHWVKZ7BPFJXPGF3QRZF","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-03-13T08:50:14Z","cross_cats_sorted":[],"title_canon_sha256":"8f5775d9519d9562b0fc2af285fcb1bb66ade39a05b2e58003cbfea766d610cf","abstract_canon_sha256":"c2cafaa9b76e1e5451bcd6854a4b4be418871f3d3c492ee3cb62805dbc77e3d6"},"schema_version":"1.0"},"canonical_sha256":"8bbd910aa7b5559f85e54dde62ee11c972345fcce68228aba80271e91b6092e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:58.491506Z","signature_b64":"byo8hBiLlnDQ35ci6uw67zQjEhESwSPLw0yU9S2zEsPtuz+R+rYaT8diVer6GYeQYK6wCqr37twbs6qqJ0ZfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bbd910aa7b5559f85e54dde62ee11c972345fcce68228aba80271e91b6092e5","last_reissued_at":"2026-05-18T03:10:58.490762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:58.490762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2739","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-18T03:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgXJ1MJNka0TVRBflRMo+JEF7b0a77NcBqPJbjiBnTxMi4R0MKkGRlEibVUzKaFsOr4aH4Ht8AiBfbvQmQhFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:23:30.599481Z"},"content_sha256":"3e735e826a6a1e7df2ad7998c0dd6de89e65ef463416eda03ffffa078c29cf5d","schema_version":"1.0","event_id":"sha256:3e735e826a6a1e7df2ad7998c0dd6de89e65ef463416eda03ffffa078c29cf5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RO6ZCCVHWVKZ7BPFJXPGF3QRZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing and enhancing OSKI for sparse matrix-vector multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Cevdet Aykanat, Enver Kayaaslan, Kadir Akbudak","submitted_at":"2012-03-13T08:50:14Z","abstract_excerpt":"Sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate single- and multiple-SpMxV frameworks for exploiting cache locality in SpMxV computations. For the single-SpMxV framework, we propose two cache-size-aware top-down row/column-reordering methods based on 1D and 2D sparse matrix partitioning by utilizing the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2739","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-18T03:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ua2GxCYSktsoyKlbj4NTRD0/Aw1XeKLkd594AQR7Mr4R299OfOxUzzDz27WVHXgFZbITB1x6NvCtaMoF+DSuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:23:30.599827Z"},"content_sha256":"675e0c07dc4d6342a5404bfc73797ec5b3f5a709313a48678346a8c1039a985c","schema_version":"1.0","event_id":"sha256:675e0c07dc4d6342a5404bfc73797ec5b3f5a709313a48678346a8c1039a985c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RO6ZCCVHWVKZ7BPFJXPGF3QRZF/bundle.json","state_url":"https://pith.science/pith/RO6ZCCVHWVKZ7BPFJXPGF3QRZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RO6ZCCVHWVKZ7BPFJXPGF3QRZF/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-30T17:23:30Z","links":{"resolver":"https://pith.science/pith/RO6ZCCVHWVKZ7BPFJXPGF3QRZF","bundle":"https://pith.science/pith/RO6ZCCVHWVKZ7BPFJXPGF3QRZF/bundle.json","state":"https://pith.science/pith/RO6ZCCVHWVKZ7BPFJXPGF3QRZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RO6ZCCVHWVKZ7BPFJXPGF3QRZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RO6ZCCVHWVKZ7BPFJXPGF3QRZF","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":"c2cafaa9b76e1e5451bcd6854a4b4be418871f3d3c492ee3cb62805dbc77e3d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-03-13T08:50:14Z","title_canon_sha256":"8f5775d9519d9562b0fc2af285fcb1bb66ade39a05b2e58003cbfea766d610cf"},"schema_version":"1.0","source":{"id":"1203.2739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2739","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2739v1","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2739","created_at":"2026-05-18T03:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"RO6ZCCVHWVKZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RO6ZCCVHWVKZ7BPF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RO6ZCCVH","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:675e0c07dc4d6342a5404bfc73797ec5b3f5a709313a48678346a8c1039a985c","target":"graph","created_at":"2026-05-18T03:10:58Z","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-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate single- and multiple-SpMxV frameworks for exploiting cache locality in SpMxV computations. For the single-SpMxV framework, we propose two cache-size-aware top-down row/column-reordering methods based on 1D and 2D sparse matrix partitioning by utilizing the co","authors_text":"Cevdet Aykanat, Enver Kayaaslan, Kadir Akbudak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-03-13T08:50:14Z","title":"Analyzing and enhancing OSKI for sparse matrix-vector multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2739","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:3e735e826a6a1e7df2ad7998c0dd6de89e65ef463416eda03ffffa078c29cf5d","target":"record","created_at":"2026-05-18T03:10:58Z","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":"c2cafaa9b76e1e5451bcd6854a4b4be418871f3d3c492ee3cb62805dbc77e3d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-03-13T08:50:14Z","title_canon_sha256":"8f5775d9519d9562b0fc2af285fcb1bb66ade39a05b2e58003cbfea766d610cf"},"schema_version":"1.0","source":{"id":"1203.2739","kind":"arxiv","version":1}},"canonical_sha256":"8bbd910aa7b5559f85e54dde62ee11c972345fcce68228aba80271e91b6092e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bbd910aa7b5559f85e54dde62ee11c972345fcce68228aba80271e91b6092e5","first_computed_at":"2026-05-18T03:10:58.490762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:58.490762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"byo8hBiLlnDQ35ci6uw67zQjEhESwSPLw0yU9S2zEsPtuz+R+rYaT8diVer6GYeQYK6wCqr37twbs6qqJ0ZfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:58.491506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e735e826a6a1e7df2ad7998c0dd6de89e65ef463416eda03ffffa078c29cf5d","sha256:675e0c07dc4d6342a5404bfc73797ec5b3f5a709313a48678346a8c1039a985c"],"state_sha256":"4a4d78bb220042ceafba93ca7fce9f2b2181d1649fdac8ad79160eb0e4dfd997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCntufx5TFN27CvB22O5VPLUxYSYQTzPzkFLUUw0ECb1sv6mr4/AxdhpYW+5RjO/gU1staL+OmuMWuc2h5RrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:23:30.601731Z","bundle_sha256":"64b60a623f212a36c1da2b09f72976a95c99b08c35f7b68ea8b906e35fe86818"}}