{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166776,0.0001338485,0.0001177783,0.0002202479,0.0004622834,0.0004309265,0.00218255,0.00006896419,0.00001625849],"category_scores_gemma":[0.0001216845,0.0001156347,0.00007772532,0.0009105444,0.001269679,0.0004803994,0.0004495267,0.0001701073,0.00000962083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001363724,"about_ca_system_score_gemma":0.00005852709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.278069e-7,"about_ca_topic_score_gemma":4.898814e-7,"domain_scores_codex":[0.9985686,0.00003940078,0.0001987747,0.0005859024,0.0002424686,0.0003648874],"domain_scores_gemma":[0.9983923,0.0002830748,0.00006789809,0.0008254215,0.0002728332,0.0001584262],"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.000006641693,0.00003655985,0.00001440707,0.000004054166,0.000001156032,2.816206e-7,0.00007817716,0.0001948052,0.006504249,0.8971135,0.00001121438,0.09603498],"study_design_scores_gemma":[0.00009151302,0.0001133444,0.00005477633,0.000006096894,0.000002520508,0.00001018777,9.297655e-7,0.660696,0.02346299,0.315067,0.0003577934,0.0001369139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005333558,0.000003545968,0.991497,0.0007726742,0.0005156602,0.0003595644,0.000001377127,0.0005541776,0.0009624152],"genre_scores_gemma":[0.451784,7.719303e-7,0.547931,0.0001512007,0.00009578469,0.00002961409,8.536498e-7,0.000004320502,0.000002452402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6605011,"threshold_uncertainty_score":0.4715447,"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."}}