{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MIXFD7CAWD2MLDWUBMPRCDBICD","short_pith_number":"pith:MIXFD7CA","schema_version":"1.0","canonical_sha256":"622e51fc40b0f4c58ed40b1f110c2810d58aeab1bd13fbdde712f6ac427fee28","source":{"kind":"arxiv","id":"1511.02494","version":3},"attestation_state":"computed","paper":{"title":"A lightweight optimization selection method for Sparse Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Athena Elafrou, Georgios Goumas, Nectarios Koziris","submitted_at":"2015-11-08T15:06:10Z","abstract_excerpt":"In this paper, we propose an optimization selection methodology for the ubiquitous sparse matrix-vector multiplication (SpMV) kernel. We propose two models that attempt to identify the major performance bottleneck of the kernel for every instance of the problem and then select an appropriate optimization to tackle it. Our first model requires online profiling of the input matrix in order to detect its most prevailing performance issue, while our second model only uses comprehensive structural features of the sparse matrix. Our method delivers high performance stability for SpMV across differen"},"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":"1511.02494","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2015-11-08T15:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"ffc78df6e7671a85c7fe3b325ad82f13f153dd3a50aec318807a4c0c486f77c6","abstract_canon_sha256":"3f4b4a0dc621eccd753dfe3908eb33eb7728a9e6c9c6ae587da4ebc0e8cfe8d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:07.916725Z","signature_b64":"uJ5+rRXOAtzezhF2Pil4AW80sC/AP25/jpsGwV6OHvW5+8zcF6tuZnaVPkvqM4lYDX7ubJSLaia1BOVUEQttDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"622e51fc40b0f4c58ed40b1f110c2810d58aeab1bd13fbdde712f6ac427fee28","last_reissued_at":"2026-05-18T01:23:07.916180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:07.916180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lightweight optimization selection method for Sparse Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Athena Elafrou, Georgios Goumas, Nectarios Koziris","submitted_at":"2015-11-08T15:06:10Z","abstract_excerpt":"In this paper, we propose an optimization selection methodology for the ubiquitous sparse matrix-vector multiplication (SpMV) kernel. We propose two models that attempt to identify the major performance bottleneck of the kernel for every instance of the problem and then select an appropriate optimization to tackle it. Our first model requires online profiling of the input matrix in order to detect its most prevailing performance issue, while our second model only uses comprehensive structural features of the sparse matrix. Our method delivers high performance stability for SpMV across differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02494","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.02494","created_at":"2026-05-18T01:23:07.916249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02494v3","created_at":"2026-05-18T01:23:07.916249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02494","created_at":"2026-05-18T01:23:07.916249+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIXFD7CAWD2M","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIXFD7CAWD2MLDWU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIXFD7CA","created_at":"2026-05-18T12:29:32.376354+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/MIXFD7CAWD2MLDWUBMPRCDBICD","json":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD.json","graph_json":"https://pith.science/api/pith-number/MIXFD7CAWD2MLDWUBMPRCDBICD/graph.json","events_json":"https://pith.science/api/pith-number/MIXFD7CAWD2MLDWUBMPRCDBICD/events.json","paper":"https://pith.science/paper/MIXFD7CA"},"agent_actions":{"view_html":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD","download_json":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD.json","view_paper":"https://pith.science/paper/MIXFD7CA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02494&json=true","fetch_graph":"https://pith.science/api/pith-number/MIXFD7CAWD2MLDWUBMPRCDBICD/graph.json","fetch_events":"https://pith.science/api/pith-number/MIXFD7CAWD2MLDWUBMPRCDBICD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD/action/storage_attestation","attest_author":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD/action/author_attestation","sign_citation":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD/action/citation_signature","submit_replication":"https://pith.science/pith/MIXFD7CAWD2MLDWUBMPRCDBICD/action/replication_record"}},"created_at":"2026-05-18T01:23:07.916249+00:00","updated_at":"2026-05-18T01:23:07.916249+00:00"}