{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333309,0.0007529968,0.0007876036,0.002408488,0.001199667,0.002247286,0.0006602344,0.0003855303,0.00390372],"category_scores_gemma":[0.002800332,0.0003246045,0.001028521,0.001626407,0.00247091,0.004363436,0.002397697,0.002136334,0.0008468066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008772534,"about_ca_system_score_gemma":0.0006638846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006113257,"about_ca_topic_score_gemma":0.0005730663,"domain_scores_codex":[0.9987073,0.0002321849,0.00006515429,0.000217656,0.0004476859,0.0003301429],"domain_scores_gemma":[0.9982338,0.0005399148,0.0003322362,0.0002032297,0.0004274542,0.0002633843],"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.00003051109,0.0000216644,0.0003133323,0.00005796584,0.00001171829,0.0001062081,0.0002160254,0.001312145,0.001167426,0.9848257,0.000719421,0.01121777],"study_design_scores_gemma":[0.00001284936,0.00006143324,0.0003809576,0.00004425908,0.00001899812,0.0004178823,0.000202621,0.007707237,0.002181512,0.9824348,0.006514766,0.00002257835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4270448,0.005151006,0.4977025,0.001423046,0.0006479435,0.00008674878,0.0004882466,0.000221563,0.06723424],"genre_scores_gemma":[0.9356364,0.002216169,0.04503436,0.0002172508,0.000610891,0.00005244066,0.0004104339,0.00008049475,0.01574156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00390372,"threshold_uncertainty_score":0.01305926,"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."}}