{"id":"W2012368965","doi":"10.1145/1837210.1837238","title":"Cache friendly sparse matrix-vector multiplication","year":2010,"lang":"en","type":"article","venue":"","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; Western University","funders":"","keywords":"Computer science; Multiplication (music); Parallel computing; Matrix multiplication; Cache-oblivious algorithm; Locality; Cache; Kernel (algebra); Context (archaeology); Cache algorithms; Conjugate gradient method; Sparse matrix; Algorithm; Theoretical computer science; CPU cache; Mathematics; Discrete mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001509701,0.00009536257,0.00007699368,0.0001002246,0.00007393429,0.00009813986,0.0006718831,0.00007108945,0.0001160653],"category_scores_gemma":[0.0001213138,0.0000845148,0.00003408072,0.0003124631,0.00003403969,0.0003265299,0.0001364897,0.0001347564,0.0001392847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001549673,"about_ca_system_score_gemma":0.00003115806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003664999,"about_ca_topic_score_gemma":0.00001533166,"domain_scores_codex":[0.999182,0.00001327421,0.0001601533,0.000299539,0.0001739803,0.0001710042],"domain_scores_gemma":[0.9989873,0.00006250892,0.00006470281,0.0006877342,0.0001102717,0.00008751608],"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.000001330651,0.00006053298,0.0004994601,0.00000254516,0.000003942211,0.000001146259,0.0001659906,0.00005532261,0.02287494,0.9648315,0.003592086,0.007911152],"study_design_scores_gemma":[0.0004036971,0.000106606,0.004715369,0.00000597793,0.000006690764,0.00004082086,0.00001601122,0.8832256,0.08797508,0.01225394,0.01082092,0.0004292745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004062206,0.00000509375,0.9881604,0.0009266407,0.0003804952,0.0002244979,0.000001014714,0.001018744,0.005220895],"genre_scores_gemma":[0.444358,7.346213e-7,0.5549903,0.00008977389,0.00003277458,0.00003415945,0.000002124891,0.000005573772,0.0004865957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9525776,"threshold_uncertainty_score":0.3446413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01219378125737502,"score_gpt":0.2626093437592976,"score_spread":0.2504155625019226,"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."}}