{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2T5H3ENUOXXUV5CL2RSUDDA3OG","short_pith_number":"pith:2T5H3ENU","schema_version":"1.0","canonical_sha256":"d4fa7d91b475ef4af44bd465418c1b71a3470c1056b00970daaf00959a29c57c","source":{"kind":"arxiv","id":"1307.6209","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6209","created_at":"2026-05-18T02:39:48.722699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6209v2","created_at":"2026-05-18T02:39:48.722699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6209","created_at":"2026-05-18T02:39:48.722699+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T5H3ENUOXXU","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T5H3ENUOXXUV5CL","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T5H3ENU","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG","json":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG.json","graph_json":"https://pith.science/api/pith-number/2T5H3ENUOXXUV5CL2RSUDDA3OG/graph.json","events_json":"https://pith.science/api/pith-number/2T5H3ENUOXXUV5CL2RSUDDA3OG/events.json","paper":"https://pith.science/paper/2T5H3ENU"},"agent_actions":{"view_html":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG","download_json":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG.json","view_paper":"https://pith.science/paper/2T5H3ENU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6209&json=true","fetch_graph":"https://pith.science/api/pith-number/2T5H3ENUOXXUV5CL2RSUDDA3OG/graph.json","fetch_events":"https://pith.science/api/pith-number/2T5H3ENUOXXUV5CL2RSUDDA3OG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/action/storage_attestation","attest_author":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/action/author_attestation","sign_citation":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/action/citation_signature","submit_replication":"https://pith.science/pith/2T5H3ENUOXXUV5CL2RSUDDA3OG/action/replication_record"}},"created_at":"2026-05-18T02:39:48.722699+00:00","updated_at":"2026-05-18T02:39:48.722699+00:00"}