{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986411,0.0006394497,0.0008622713,0.001058238,0.0008422201,0.002040972,0.0006772962,0.0003529934,0.01083284],"category_scores_gemma":[0.001167015,0.0003896484,0.0007840437,0.000839982,0.0008972671,0.002851651,0.002064761,0.00169067,0.002484189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008657888,"about_ca_system_score_gemma":0.000754762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007275867,"about_ca_topic_score_gemma":0.001638181,"domain_scores_codex":[0.9995236,0.00009692185,0.00002721139,0.00006016225,0.0001541353,0.0001379566],"domain_scores_gemma":[0.9995294,0.0001126041,0.00003013515,0.0001207196,0.0001295747,0.00007762443],"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.0002465563,0.0001273548,0.0002368996,0.000102323,0.00002249699,0.00006063203,0.0003181779,0.005356102,0.008792101,0.9132345,0.005686019,0.06581687],"study_design_scores_gemma":[0.00003784322,0.00003419424,0.0001075531,0.00001901875,0.0000174947,0.00004079749,0.00009221243,0.03072834,0.004259489,0.9574022,0.00724945,0.00001130418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2380803,0.0008997265,0.6987769,0.0007885567,0.0002234745,0.0001549822,0.0005211157,0.0009810415,0.05957383],"genre_scores_gemma":[0.7787637,0.0006115229,0.1823664,0.0002222699,0.0001530308,0.0001109314,0.00121915,0.0005081461,0.03604496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01083284,"threshold_uncertainty_score":0.0362395,"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."}}