{"id":"W2949595835","doi":"10.48550/arxiv.0707.2347","title":"Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Strassen algorithm; Matrix multiplication; Multiplication algorithm; Computer science; Scheduling (production processes); Multiplication (music); Matrix (chemical analysis); Constant (computer programming); Algorithm; Arithmetic; Mathematics; Mathematical optimization; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000978914,0.0002883324,0.0003771006,0.0004704961,0.00008918564,0.0001379835,0.001530258,0.0003446724,0.000008153563],"category_scores_gemma":[0.00004829774,0.0002855146,0.0001923528,0.0004273784,0.00006001171,0.00007259764,0.001427263,0.0004735129,0.00001260434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008103973,"about_ca_system_score_gemma":0.0001684773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001082434,"about_ca_topic_score_gemma":0.000001031432,"domain_scores_codex":[0.9976627,0.0000824187,0.0007070409,0.000734279,0.0005010531,0.0003124965],"domain_scores_gemma":[0.9975754,0.0001370684,0.000537322,0.001234679,0.0004095139,0.0001060275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002151203,0.0001683153,0.00002668313,0.00009062673,0.0000301038,0.000003167474,0.0002756148,0.8036644,0.0001473086,0.002891495,0.000165321,0.1925348],"study_design_scores_gemma":[0.0001503811,0.00002337045,0.0002565228,0.0001170621,0.000009086175,0.000005047961,0.00001752608,0.9771399,0.0210448,0.000889225,0.00006037248,0.000286737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002123415,0.0004388898,0.9925553,0.0001379596,0.0004288036,0.0004709644,0.000004899041,0.001216507,0.002623299],"genre_scores_gemma":[0.1812841,0.00005488041,0.8183181,0.00004411152,0.0000788363,0.00001476051,0.00002169806,0.00001511571,0.0001684532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1922481,"threshold_uncertainty_score":0.9999597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02053359651592145,"score_gpt":0.3081984710519494,"score_spread":0.2876648745360279,"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."}}