{"id":"W1968809051","doi":"10.1145/384101.384111","title":"Computing all factorizations in ***","year":2001,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Factorization; Unique factorization domain; Discriminant; Multiplication (music); Prime (order theory); Time complexity; Mathematics; Factorization of polynomials; Prime factor; Polynomial; Domain (mathematical analysis); Dixon's factorization method; Combinatorics; Degree (music); Computational complexity theory; Discrete mathematics; Computer science; Algorithm; Matrix polynomial; Artificial intelligence","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.0001160754,0.00003923558,0.00004136012,0.00009507095,0.00003695681,0.00005202667,0.0002986744,0.00001552138,0.00003671085],"category_scores_gemma":[0.000008837955,0.00003598244,0.00002151286,0.0005054658,0.000008546878,0.000157697,0.00007948149,0.0000438874,0.00002564737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006470822,"about_ca_system_score_gemma":0.000006755972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001357967,"about_ca_topic_score_gemma":0.00002123998,"domain_scores_codex":[0.9995993,0.00002472743,0.00007823268,0.0001203169,0.00005606227,0.0001213437],"domain_scores_gemma":[0.9997278,0.00005429511,0.00001275448,0.0001665671,0.00001092636,0.00002759334],"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":[6.322505e-7,0.00003092665,0.02415003,6.248316e-7,0.000002163909,0.000006727724,0.0004953891,0.0001817078,0.0001548985,0.9544308,0.0001112012,0.02043493],"study_design_scores_gemma":[0.001028511,0.0001409436,0.1793773,0.00004277183,0.000004699687,0.00005883451,0.0002118849,0.3078443,0.001021413,0.3927071,0.1168053,0.0007568673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08246802,0.000009955477,0.8875077,0.00039182,0.0001128437,0.000027935,5.929839e-8,0.0001477057,0.029334],"genre_scores_gemma":[0.9860908,0.000003607516,0.01340847,0.0003690405,0.00001631911,5.942608e-7,4.404535e-7,0.000001533288,0.0001092321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9036227,"threshold_uncertainty_score":0.1467321,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0242602653661409,"score_gpt":0.2604670875836516,"score_spread":0.2362068222175107,"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."}}