{"id":"W2158079656","doi":"10.1016/j.jsc.2007.03.001","title":"Output-sensitive modular algorithms for polynomial matrix normal forms","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Mathematics; Unimodular matrix; Polynomial matrix; Algorithm; Matrix multiplication; Polynomial; Normalization (sociology); Modular arithmetic; Matrix (chemical analysis); Homomorphism; Integer matrix; Matrix polynomial; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Symmetric matrix; 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.001256971,0.0001873727,0.0003415233,0.0004576176,0.0001703191,0.0001582912,0.0004059805,0.00009109358,0.000001246858],"category_scores_gemma":[0.00007092831,0.0001659837,0.0002603229,0.0003784036,0.00003667657,0.0009659925,0.0000933692,0.0001930041,0.000009760951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001486434,"about_ca_system_score_gemma":0.000175876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001466398,"about_ca_topic_score_gemma":0.000003809365,"domain_scores_codex":[0.9980428,0.00004003939,0.0008477659,0.0002248313,0.0004561607,0.0003884045],"domain_scores_gemma":[0.9980696,0.0003258432,0.0007139512,0.0001303842,0.0005629024,0.000197267],"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.0002584491,0.0002032229,0.0001424553,0.00003637821,0.0001330346,0.0000809089,0.003041076,0.0272863,0.00409618,0.008181809,0.001636274,0.9549039],"study_design_scores_gemma":[0.004446455,0.001177013,0.04118558,0.00009692534,0.00006852183,0.001039088,0.0003150105,0.9150918,0.01181537,0.02077669,0.003398425,0.0005891574],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2879018,0.00006805768,0.7100525,0.0005196436,0.00109543,0.0001793054,0.000002882093,0.00003971786,0.0001406035],"genre_scores_gemma":[0.8863814,0.000004463946,0.1122866,0.0001869657,0.001049412,0.000001632968,0.000005923532,0.0000134196,0.00007014849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9543148,"threshold_uncertainty_score":0.6768619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01627198849750778,"score_gpt":0.2861105198451552,"score_spread":0.2698385313476474,"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."}}