{"id":"W2955456460","doi":"10.1142/s0219498820501509","title":"Additive decompositions of polynomials over unique factorization domains","year":2019,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Factorization; Factorization of polynomials; Decomposition; Pure mathematics; Finite field; Unique factorization domain; Algebra over a field; Discrete mathematics; Combinatorics; Polynomial; Mathematical analysis; Algorithm; Matrix polynomial","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.0001679532,0.00006300087,0.000136496,0.0001646731,0.00007491706,0.00003693936,0.0002601706,0.00003795702,0.00004634087],"category_scores_gemma":[0.00001060852,0.00005467733,0.00007467738,0.0003248807,0.0000242897,0.0003955551,0.00004614924,0.00008433691,0.000005385214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001178943,"about_ca_system_score_gemma":0.00005216257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.94055e-7,"about_ca_topic_score_gemma":5.955599e-7,"domain_scores_codex":[0.999405,0.00004261564,0.0002666383,0.00009605332,0.0001145315,0.00007512922],"domain_scores_gemma":[0.999105,0.0001863791,0.0003104386,0.0001570684,0.0001758726,0.00006525452],"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.000007993235,0.00007433816,0.0005041966,0.000006818993,0.00003546544,2.714055e-7,0.0002949617,0.00001155765,0.0355332,0.9594566,0.0001562302,0.003918403],"study_design_scores_gemma":[0.002578996,0.001395471,0.1137137,0.0002782157,0.0001831463,0.0002193544,0.0003975853,0.002206446,0.1569634,0.6562068,0.06512569,0.0007311612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4227095,0.0002020335,0.5753292,0.0003438953,0.00008237084,0.000194014,0.00001699059,0.00001396514,0.001108008],"genre_scores_gemma":[0.9954059,0.0001414194,0.00427545,0.0000850135,0.00005482745,0.000006528238,0.00000261811,0.000003642161,0.00002462093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5726963,"threshold_uncertainty_score":0.2229677,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004977955045630473,"score_gpt":0.2325681719001281,"score_spread":0.2275902168544976,"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."}}