{"id":"W4390821557","doi":"10.3390/a17010031","title":"GPU Algorithms for Structured Sparse Matrix Multiplication with Diagonal Storage Schemes","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Qassim University; University of Northern British Columbia","keywords":"Matrix multiplication; Computer science; Multiplication (music); Diagonal; Sparse matrix; Overhead (engineering); Parallel computing; Matrix (chemical analysis); Diagonal matrix; Locality; Algorithm; Set (abstract data type); Computer data storage; Computational science; Mathematics; Computer hardware","routes":{"ca_aff":true,"ca_fund":true,"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.0002667143,0.0002292048,0.0002024106,0.0001879531,0.0001781817,0.0004187995,0.0006435828,0.0001044507,0.000008835423],"category_scores_gemma":[0.00002769621,0.0001878309,0.00008890092,0.0005327461,0.00005442356,0.0004749149,0.0001269374,0.0001682085,0.00002221574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006757588,"about_ca_system_score_gemma":0.000121221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001537039,"about_ca_topic_score_gemma":0.000001908399,"domain_scores_codex":[0.9984312,0.00003644538,0.0002520593,0.0006498332,0.0002981685,0.0003323079],"domain_scores_gemma":[0.9989728,0.0001638019,0.00008011959,0.0005076634,0.0001697014,0.0001058587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003404846,0.0001396716,0.000102204,0.0001759041,0.0002062103,0.00008552593,0.00111467,0.01987972,0.0007821679,0.0627827,0.01224906,0.9024481],"study_design_scores_gemma":[0.0003111965,0.0001318279,0.0001577082,0.00005197854,0.00001403057,0.00005570248,0.000007605536,0.9589247,0.003326884,0.003017404,0.03371523,0.0002857979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008450485,0.0009513846,0.9948745,0.0006800824,0.0004237879,0.0004878063,0.00002713853,0.001592902,0.0001173789],"genre_scores_gemma":[0.05755211,0.00004277306,0.9410316,0.0001090986,0.0002924537,0.0001514397,0.0000526954,0.00003301663,0.0007347737],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9390449,"threshold_uncertainty_score":0.7659522,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02040094391687363,"score_gpt":0.2955937275811731,"score_spread":0.2751927836642994,"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."}}