{"id":"W2107482418","doi":"10.1016/j.jco.2014.09.004","title":"A deterministic algorithm for inverting a polynomial matrix","year":2014,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Exponent; Matrix multiplication; Inverse; Univariate; Matrix (chemical analysis); Polynomial matrix; Invariant (physics); Combinatorics; Upper and lower bounds; Field (mathematics); Polynomial; Discrete mathematics; Algorithm; Matrix polynomial; Pure mathematics; Mathematical analysis; Statistics; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.0006551783,0.0001026967,0.0002580614,0.0001214923,0.0001285649,0.0001320645,0.0006041975,0.0000338496,0.000004495345],"category_scores_gemma":[0.000183624,0.00008783982,0.0001721867,0.000132672,0.00004746042,0.0003184099,0.0001095552,0.0001201914,0.00000673054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004447437,"about_ca_system_score_gemma":0.0001117203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007600839,"about_ca_topic_score_gemma":0.000003074833,"domain_scores_codex":[0.9988819,0.00007814205,0.0004856537,0.0001299629,0.0002143195,0.0002099893],"domain_scores_gemma":[0.9987596,0.0003090558,0.0004716895,0.0001559398,0.000173267,0.0001304908],"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.00002635105,0.0000635662,0.00005457995,0.00001757563,0.0000230957,0.000006222128,0.0002445536,0.00003997945,0.0003756215,0.03079394,0.001653044,0.9667014],"study_design_scores_gemma":[0.0009803602,0.000417869,0.002042851,0.00002903925,0.00001282702,0.0001797784,0.000006068757,0.8423358,0.0004995154,0.1453803,0.007987075,0.0001285537],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0511065,0.0000297324,0.9469866,0.0007933901,0.0007868148,0.00007743492,0.000002180481,0.0000276024,0.0001897163],"genre_scores_gemma":[0.4712231,6.596701e-7,0.5277023,0.000278149,0.0007606259,0.000001556214,5.117319e-7,0.000005450077,0.00002764934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9665729,"threshold_uncertainty_score":0.3582004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03252501886350941,"score_gpt":0.2923396275986458,"score_spread":0.2598146087351364,"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."}}