{"id":"W2040516344","doi":"10.1016/s0747-7171(03)00071-3","title":"Efficient decomposition of separable algebras","year":2003,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Factorization of polynomials; Separable space; Polynomial; Generator (circuit theory); Simple (philosophy); Computation; Factorization; Pure mathematics; Matrix polynomial; Algorithm; Power (physics)","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.000588547,0.0001093852,0.0002595099,0.0003052652,0.00006986249,0.00005573518,0.0002671907,0.00004239125,0.000008964839],"category_scores_gemma":[0.00006061095,0.00009934609,0.000134673,0.0004951016,0.00002825004,0.0002178268,0.00003346136,0.000115219,0.00001020367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006444023,"about_ca_system_score_gemma":0.0001674954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005950738,"about_ca_topic_score_gemma":4.684562e-7,"domain_scores_codex":[0.998517,0.0001433922,0.0006544402,0.0001359521,0.0003903254,0.0001589207],"domain_scores_gemma":[0.9985868,0.0001579396,0.0006875352,0.000120474,0.0003532082,0.00009398886],"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.00004385615,0.0006067848,0.0006553762,0.00006367256,0.0001059795,0.00002727834,0.002658598,0.7372093,0.02310689,0.1415927,0.0008388917,0.09309074],"study_design_scores_gemma":[0.002336819,0.0007190859,0.02852018,0.000213423,0.00005571211,0.0007724552,0.000116162,0.8434196,0.02908586,0.09370326,0.0006776543,0.0003797685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4848801,0.0001446069,0.5138308,0.0001145896,0.0004036059,0.00005071819,2.983847e-7,0.00001362737,0.0005616383],"genre_scores_gemma":[0.9573709,0.000005951747,0.04247682,0.00006257019,0.00006415824,7.68722e-7,8.164975e-7,0.000005609701,0.00001237511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4724909,"threshold_uncertainty_score":0.4051216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009798005884001877,"score_gpt":0.2656074410536992,"score_spread":0.2558094351696973,"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."}}