{"id":"W2737871803","doi":"10.1145/3087604.3087648","title":"Computing the Nearest Rank-Deficient Matrix Polynomial","year":2017,"lang":"en","type":"article","venue":"","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matrix polynomial; Polynomial matrix; Mathematics; Matrix norm; Matrix (chemical analysis); Rank (graph theory); Polynomial; Matrix splitting; Square matrix; Characteristic polynomial; Companion matrix; Symmetric matrix; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors","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.0002233496,0.00009656578,0.0001527393,0.000009702993,0.0007742571,0.0002015156,0.0004130025,0.00003390282,0.0003903878],"category_scores_gemma":[0.0007156184,0.00005052606,0.00006576713,0.00002770633,0.0001718511,0.000034542,0.0002064471,0.0001281778,0.0002724856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001303957,"about_ca_system_score_gemma":0.00001315904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002083308,"about_ca_topic_score_gemma":0.00001156385,"domain_scores_codex":[0.9992086,0.00002900691,0.0001830902,0.0001473578,0.0001965451,0.0002354167],"domain_scores_gemma":[0.9986409,0.000702348,0.00009525981,0.0004596626,0.00003238727,0.000069423],"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.00008537777,0.0004121341,0.00196161,0.00007715372,0.00008439346,0.00004765439,0.0007598755,0.00001502667,0.0003414357,0.7235394,0.1121779,0.1604981],"study_design_scores_gemma":[0.004972923,0.0004196239,0.1062953,0.0001503436,0.0002980485,0.0001450936,0.001162759,0.3196499,0.002726359,0.4610375,0.1014075,0.00173465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3050139,0.0000988929,0.5523443,0.01521707,0.00188188,0.0007250999,0.00004642516,0.0003900827,0.1242823],"genre_scores_gemma":[0.9494966,0.000001802349,0.0467896,0.0001629043,0.0003389496,0.000002853059,8.885901e-7,0.0000137764,0.003192606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6444827,"threshold_uncertainty_score":0.5955038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06572281494928114,"score_gpt":0.3839961363061212,"score_spread":0.3182733213568401,"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."}}