{"id":"W1989290453","doi":"10.1016/j.tcs.2010.12.012","title":"Optimization techniques for small matrix multiplication","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Mitacs; Canada Research Chairs","keywords":"Strassen algorithm; Matrix multiplication; Multiplication (music); Mathematics; Multiplication algorithm; Matrix (chemical analysis); Base (topology); Arithmetic; Algebra over a field; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008586727,0.001224923,0.0009523433,0.001029757,0.0006555976,0.001008972,0.001226275,0.000750231,0.008909682],"category_scores_gemma":[0.004743511,0.0005808737,0.0006877827,0.001772219,0.00123585,0.002257002,0.00158764,0.002394974,0.0023875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000771298,"about_ca_system_score_gemma":0.0007372943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008182334,"about_ca_topic_score_gemma":0.001536024,"domain_scores_codex":[0.9990872,0.0003048207,0.00004044615,0.0001051468,0.0003807655,0.00008158744],"domain_scores_gemma":[0.9985616,0.0009117755,0.0001035624,0.0002237323,0.00014826,0.00005121637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003089726,0.0001420244,0.0002914512,0.0003541061,0.0000660059,0.00009345764,0.0001727877,0.1073015,0.0142612,0.5632362,0.01683094,0.2969413],"study_design_scores_gemma":[0.00006674825,0.00008954222,0.0002041731,0.00004504721,0.0000299222,0.0001077869,0.00002621413,0.4999843,0.00559066,0.4813083,0.01251854,0.00002871984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005896274,0.000939535,0.9809532,0.0004963378,0.0001587598,0.00004938646,0.00006252024,0.0003234739,0.0111206],"genre_scores_gemma":[0.262642,0.002460347,0.6978623,0.0005743762,0.0007639745,0.0005237372,0.0002772865,0.0008392803,0.03405681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008909682,"threshold_uncertainty_score":0.02980584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009235530333444139,"score_gpt":0.2618025722920485,"score_spread":0.2525670419586044,"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."}}