{"id":"W2075789590","doi":"10.1145/1940475.1940490","title":"Cache friendly sparse matrix-vector multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; Western University","funders":"","keywords":"Multiplication (music); Computer science; Matrix multiplication; Kernel (algebra); Sparse matrix; Parallel computing; Column (typography); Cache; Matrix (chemical analysis); Conjugate gradient method; Cache-oblivious algorithm; CPU cache; Algorithm; Computational complexity theory; Cache algorithms; Mathematics; Discrete mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006773382,0.0002148051,0.0002267937,0.0002592294,0.0002577165,0.0001212027,0.00865518,0.0001082964,0.00004921994],"category_scores_gemma":[0.00008451516,0.0002206378,0.0000917823,0.0008627087,0.0001546132,0.0007277942,0.003759093,0.0003862201,0.0002979558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007150453,"about_ca_system_score_gemma":0.00006594593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001379104,"about_ca_topic_score_gemma":0.00005010582,"domain_scores_codex":[0.9980964,0.0004011707,0.0004990072,0.0004707534,0.0001880421,0.0003445931],"domain_scores_gemma":[0.9917451,0.000484555,0.0001720055,0.007375375,0.0001125118,0.0001104727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009559669,0.0007060427,0.002680964,0.00001616039,0.00003646668,0.00001016424,0.005369259,0.00003829346,0.0001624105,0.8121331,0.000890784,0.1779467],"study_design_scores_gemma":[0.00154595,0.0002508198,0.04590357,0.0001092326,0.0000255629,0.0001022511,0.0001011105,0.6649694,0.001967992,0.2632458,0.02065855,0.001119791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01492212,0.0005274088,0.9784552,0.002098857,0.0004127498,0.0004350007,0.000005692087,0.0004896964,0.002653223],"genre_scores_gemma":[0.4629003,0.00006897523,0.5366569,0.0001908118,0.00004636878,0.00006664617,0.00001138856,0.00001147213,0.0000471024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6649311,"threshold_uncertainty_score":0.9967085,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05468255262939944,"score_gpt":0.2969070496063049,"score_spread":0.2422244969769054,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}