{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QYBB2P7MJMX7YP27GBVYEJKNKV","short_pith_number":"pith:QYBB2P7M","canonical_record":{"source":{"id":"1202.3856","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-17T09:28:24Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"4027d84d8dd8227f8d0916540c4757760cbc5adf4de83c0bd15b5f9de0ea0214","abstract_canon_sha256":"fd06090e644983368fcf0e05563a902a63e3779693655af6929b8317654753a2"},"schema_version":"1.0"},"canonical_sha256":"86021d3fec4b2ffc3f5f306b82254d554d3a155e18ac65b43ae4779e0778e1cb","source":{"kind":"arxiv","id":"1202.3856","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3856","created_at":"2026-05-18T04:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3856v3","created_at":"2026-05-18T04:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3856","created_at":"2026-05-18T04:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"QYBB2P7MJMX7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QYBB2P7MJMX7YP27","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QYBB2P7M","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QYBB2P7MJMX7YP27GBVYEJKNKV","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3856","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-17T09:28:24Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"4027d84d8dd8227f8d0916540c4757760cbc5adf4de83c0bd15b5f9de0ea0214","abstract_canon_sha256":"fd06090e644983368fcf0e05563a902a63e3779693655af6929b8317654753a2"},"schema_version":"1.0"},"canonical_sha256":"86021d3fec4b2ffc3f5f306b82254d554d3a155e18ac65b43ae4779e0778e1cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:25.507459Z","signature_b64":"Mfvlbp01BeuG9joanw006tG+N/MFH7olib3Xg3GzG7cOjuEfoNtwMjQrrij+myS0o8SmU4hjRQCI91EDqdONDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86021d3fec4b2ffc3f5f306b82254d554d3a155e18ac65b43ae4779e0778e1cb","last_reissued_at":"2026-05-18T04:01:25.506673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:25.506673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3856","source_version":3,"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-18T04:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxBY/IOJCGdH+M0ho/YGsA6hDKuShZjKXtSZ9pAktOg5QHLJwJ+qzgEOPKZV7zW/5RC/TWGnIoFusfAbqGMwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:17:31.098083Z"},"content_sha256":"ca414b9cafce37dade59b45a16fa3c65c07c61d426fc51ee7bf208f66f2346be","schema_version":"1.0","event_id":"sha256:ca414b9cafce37dade59b45a16fa3c65c07c61d426fc51ee7bf208f66f2346be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QYBB2P7MJMX7YP27GBVYEJKNKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Technical Report on Hypergraph-Partitioning-Based Models and Methods for Exploiting Cache Locality in Sparse-Matrix Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NA","authors_text":"Cevdet Aykanat, Enver Kayaaslan, Kadir Akbudak","submitted_at":"2012-02-17T09:28:24Z","abstract_excerpt":"The 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 th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3856","kind":"arxiv","version":3},"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-18T04:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oF9uOGU52UlQ73Tl6fB26hF3VaOxH5YjRZjlbKRWLEEFVfGDOI9MxuCjdGNvO5e14iago7yhD2QvjfBV+jV3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:17:31.098440Z"},"content_sha256":"8f571760b2a94e2ae3970c9fc1342c3639168072fbc5c3bfb31b28e7fe3df9c3","schema_version":"1.0","event_id":"sha256:8f571760b2a94e2ae3970c9fc1342c3639168072fbc5c3bfb31b28e7fe3df9c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYBB2P7MJMX7YP27GBVYEJKNKV/bundle.json","state_url":"https://pith.science/pith/QYBB2P7MJMX7YP27GBVYEJKNKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYBB2P7MJMX7YP27GBVYEJKNKV/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-07-02T11:17:31Z","links":{"resolver":"https://pith.science/pith/QYBB2P7MJMX7YP27GBVYEJKNKV","bundle":"https://pith.science/pith/QYBB2P7MJMX7YP27GBVYEJKNKV/bundle.json","state":"https://pith.science/pith/QYBB2P7MJMX7YP27GBVYEJKNKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYBB2P7MJMX7YP27GBVYEJKNKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QYBB2P7MJMX7YP27GBVYEJKNKV","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":"fd06090e644983368fcf0e05563a902a63e3779693655af6929b8317654753a2","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-17T09:28:24Z","title_canon_sha256":"4027d84d8dd8227f8d0916540c4757760cbc5adf4de83c0bd15b5f9de0ea0214"},"schema_version":"1.0","source":{"id":"1202.3856","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3856","created_at":"2026-05-18T04:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3856v3","created_at":"2026-05-18T04:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3856","created_at":"2026-05-18T04:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"QYBB2P7MJMX7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QYBB2P7MJMX7YP27","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QYBB2P7M","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:8f571760b2a94e2ae3970c9fc1342c3639168072fbc5c3bfb31b28e7fe3df9c3","target":"graph","created_at":"2026-05-18T04:01:25Z","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":"The 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 th","authors_text":"Cevdet Aykanat, Enver Kayaaslan, Kadir Akbudak","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-17T09:28:24Z","title":"Technical Report on Hypergraph-Partitioning-Based Models and Methods for Exploiting Cache Locality in Sparse-Matrix Vector Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3856","kind":"arxiv","version":3},"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:ca414b9cafce37dade59b45a16fa3c65c07c61d426fc51ee7bf208f66f2346be","target":"record","created_at":"2026-05-18T04:01:25Z","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":"fd06090e644983368fcf0e05563a902a63e3779693655af6929b8317654753a2","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-17T09:28:24Z","title_canon_sha256":"4027d84d8dd8227f8d0916540c4757760cbc5adf4de83c0bd15b5f9de0ea0214"},"schema_version":"1.0","source":{"id":"1202.3856","kind":"arxiv","version":3}},"canonical_sha256":"86021d3fec4b2ffc3f5f306b82254d554d3a155e18ac65b43ae4779e0778e1cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86021d3fec4b2ffc3f5f306b82254d554d3a155e18ac65b43ae4779e0778e1cb","first_computed_at":"2026-05-18T04:01:25.506673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:25.506673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mfvlbp01BeuG9joanw006tG+N/MFH7olib3Xg3GzG7cOjuEfoNtwMjQrrij+myS0o8SmU4hjRQCI91EDqdONDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:25.507459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3856","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca414b9cafce37dade59b45a16fa3c65c07c61d426fc51ee7bf208f66f2346be","sha256:8f571760b2a94e2ae3970c9fc1342c3639168072fbc5c3bfb31b28e7fe3df9c3"],"state_sha256":"656db6c90f0e598dd98115def4f3216842b69968257b28bb0a7c49b754cf8737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbg8rNeQVbiWn8YAatpYMeJ06CA9JEgjaLUg9uPL7ZKVK0TE29iy9OBgRyDi0h6A5VEt46t5OtiuDTcaS+fMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T11:17:31.100578Z","bundle_sha256":"986e3f57cbb6a12de06a43de83e6159ef95187521daafea7f3b060a52b509028"}}