{"id":"W6948012238","doi":"10.4230/lipics.cp.2023.14","title":"Fast Matrix Multiplication Without Tears: A Constraint Programming Approach","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Matrix multiplication; Multiplication (music); Matrix (chemical analysis); Correctness; Set (abstract data type); Simple (philosophy); Constraint satisfaction problem; Constraint programming; Constraint (computer-aided design)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004059524,0.002046709,0.001166194,0.001087982,0.001320871,0.00325217,0.00320072,0.001647328,0.0133701],"category_scores_gemma":[0.0176208,0.001259265,0.00178694,0.00220106,0.00260414,0.004197285,0.003127584,0.005099908,0.002192441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443962,"about_ca_system_score_gemma":0.003464992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006502378,"about_ca_topic_score_gemma":0.008353586,"domain_scores_codex":[0.9958612,0.001392097,0.0002576488,0.0007612705,0.001271578,0.0004562224],"domain_scores_gemma":[0.9888644,0.007872572,0.0006245131,0.001007457,0.001366491,0.0002645011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002267191,0.0001980852,0.0008307644,0.0006487955,0.0001133968,0.0004167684,0.0003182066,0.4865781,0.005201456,0.3302474,0.01295595,0.1622643],"study_design_scores_gemma":[0.00004495986,0.00006603594,0.00008953163,0.00006880745,0.00002022283,0.0001021036,0.00007403953,0.8216082,0.002839863,0.1633369,0.01172379,0.00002563102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002876673,0.0001359105,0.990882,0.0004939791,0.00005076513,0.0001202118,0.0001817158,0.000328126,0.004930672],"genre_scores_gemma":[0.06330305,0.000300394,0.9313747,0.0003229688,0.00008094223,0.0003920442,0.0003604695,0.0003698682,0.003495494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0133701,"threshold_uncertainty_score":0.04472744,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02621797317834897,"score_gpt":0.2758396775899735,"score_spread":0.2496217044116245,"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."}}