{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2T5H3ENUOXXUV5CL2RSUDDA3OG","short_pith_number":"pith:2T5H3ENU","canonical_record":{"source":{"id":"1307.6209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-07-23T12:50:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"173b3b4126317eb30de1f4a3110f7c5296931235dfd51818e61094fa079e2fae","abstract_canon_sha256":"6d7f3fa009f80655f717f9a25a72177d582e5973d8874dd18df8d75339e677e6"},"schema_version":"1.0"},"canonical_sha256":"d4fa7d91b475ef4af44bd465418c1b71a3470c1056b00970daaf00959a29c57c","source":{"kind":"arxiv","id":"1307.6209","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6209","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6209v2","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6209","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"2T5H3ENUOXXU","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2T5H3ENUOXXUV5CL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2T5H3ENU","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2T5H3ENUOXXUV5CL2RSUDDA3OG","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-07-23T12:50:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"173b3b4126317eb30de1f4a3110f7c5296931235dfd51818e61094fa079e2fae","abstract_canon_sha256":"6d7f3fa009f80655f717f9a25a72177d582e5973d8874dd18df8d75339e677e6"},"schema_version":"1.0"},"canonical_sha256":"d4fa7d91b475ef4af44bd465418c1b71a3470c1056b00970daaf00959a29c57c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:48.723083Z","signature_b64":"Mche6sHtMHAOQJgM15txyD2YfyYlUgGY1psdurSD4OZp9gohExVzSCmdAw6mDjaEMa+4fGJyV/cTgaGFlch0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4fa7d91b475ef4af44bd465418c1b71a3470c1056b00970daaf00959a29c57c","last_reissued_at":"2026-05-18T02:39:48.722633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:48.722633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6209","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-18T02:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3EAyP3DnSC51NvdP+HvkwofYvyumkEa+F5l0Ct3jYPef2xdS1TTqiXKOW5V3JwkqyvmMWIOztPVztJPj3mwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:47:24.419636Z"},"content_sha256":"9068bc0baf2b65479c6e6410686a2864abc22dc2002f1476f7483adcad24ae96","schema_version":"1.0","event_id":"sha256:9068bc0baf2b65479c6e6410686a2864abc22dc2002f1476f7483adcad24ae96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2T5H3ENUOXXUV5CL2RSUDDA3OG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A unified sparse matrix data format for efficient general sparse matrix-vector multiply on modern processors with wide SIMD units","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.MS","authors_text":"Alan R. Bishop, Georg Hager, Gerhard Wellein, Holger Fehske, Moritz Kreutzer","submitted_at":"2013-07-23T12:50:28Z","abstract_excerpt":"Sparse matrix-vector multiplication (spMVM) is the most time-consuming kernel in many numerical algorithms and has been studied extensively on all modern processor and accelerator architectures. However, the optimal sparse matrix data storage format is highly hardware-specific, which could become an obstacle when using heterogeneous systems. Also, it is as yet unclear how the wide single instruction multiple data (SIMD) units in current multi- and many-core processors should be used most efficiently if there is no structure in the sparsity pattern of the matrix. We suggest SELL-C-sigma, a vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6209","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-18T02:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pC+I4I22ulCqO3wtAelisSwEvGF1I8ZlSm0Ce2vGTHvnW/eghfuEC0R0MavmzzHcQ6sGCRAYwg+rJS7Ccw7/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:47:24.420365Z"},"content_sha256":"deb48e568249089ccc90f2d12b2a8887c83cb147e9b488b7dc562716a18282ee","schema_version":"1.0","event_id":"sha256:deb48e568249089ccc90f2d12b2a8887c83cb147e9b488b7dc562716a18282ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/bundle.json","state_url":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/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-05-20T03:47:24Z","links":{"resolver":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG","bundle":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/bundle.json","state":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2T5H3ENUOXXUV5CL2RSUDDA3OG","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":"6d7f3fa009f80655f717f9a25a72177d582e5973d8874dd18df8d75339e677e6","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-07-23T12:50:28Z","title_canon_sha256":"173b3b4126317eb30de1f4a3110f7c5296931235dfd51818e61094fa079e2fae"},"schema_version":"1.0","source":{"id":"1307.6209","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6209","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6209v2","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6209","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"2T5H3ENUOXXU","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2T5H3ENUOXXUV5CL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2T5H3ENU","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:deb48e568249089ccc90f2d12b2a8887c83cb147e9b488b7dc562716a18282ee","target":"graph","created_at":"2026-05-18T02:39:48Z","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 (spMVM) is the most time-consuming kernel in many numerical algorithms and has been studied extensively on all modern processor and accelerator architectures. However, the optimal sparse matrix data storage format is highly hardware-specific, which could become an obstacle when using heterogeneous systems. Also, it is as yet unclear how the wide single instruction multiple data (SIMD) units in current multi- and many-core processors should be used most efficiently if there is no structure in the sparsity pattern of the matrix. We suggest SELL-C-sigma, a vari","authors_text":"Alan R. Bishop, Georg Hager, Gerhard Wellein, Holger Fehske, Moritz Kreutzer","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-07-23T12:50:28Z","title":"A unified sparse matrix data format for efficient general sparse matrix-vector multiply on modern processors with wide SIMD units"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6209","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:9068bc0baf2b65479c6e6410686a2864abc22dc2002f1476f7483adcad24ae96","target":"record","created_at":"2026-05-18T02:39:48Z","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":"6d7f3fa009f80655f717f9a25a72177d582e5973d8874dd18df8d75339e677e6","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-07-23T12:50:28Z","title_canon_sha256":"173b3b4126317eb30de1f4a3110f7c5296931235dfd51818e61094fa079e2fae"},"schema_version":"1.0","source":{"id":"1307.6209","kind":"arxiv","version":2}},"canonical_sha256":"d4fa7d91b475ef4af44bd465418c1b71a3470c1056b00970daaf00959a29c57c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4fa7d91b475ef4af44bd465418c1b71a3470c1056b00970daaf00959a29c57c","first_computed_at":"2026-05-18T02:39:48.722633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:48.722633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mche6sHtMHAOQJgM15txyD2YfyYlUgGY1psdurSD4OZp9gohExVzSCmdAw6mDjaEMa+4fGJyV/cTgaGFlch0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:48.723083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6209","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9068bc0baf2b65479c6e6410686a2864abc22dc2002f1476f7483adcad24ae96","sha256:deb48e568249089ccc90f2d12b2a8887c83cb147e9b488b7dc562716a18282ee"],"state_sha256":"eda7313d6ef44bb7c5ce0cda2a793efcdb760d39299562c0febb6d493f1fee4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBeCNWIngdRHi/MMsJbhGUYPcbasrHs6lc7B+EYODUlnyfByeuFGXQ39IHQlkfEuOjVdvel49GrqvKWYN0WkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T03:47:24.424474Z","bundle_sha256":"524b341d8687b26f6236f64f906ef875a8d47859364ecdedfa0f4b67394c9803"}}