{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249819,0.001240297,0.001431069,0.001192072,0.001349237,0.001861305,0.0008819989,0.0005679255,0.01103541],"category_scores_gemma":[0.004035296,0.0005740336,0.001230265,0.0009288657,0.0009801997,0.005552989,0.002337284,0.001435116,0.005072309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008118505,"about_ca_system_score_gemma":0.001928559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002366284,"about_ca_topic_score_gemma":0.003161326,"domain_scores_codex":[0.9987046,0.0001226894,0.000112282,0.0004462269,0.000338803,0.0002754071],"domain_scores_gemma":[0.9979091,0.0006335229,0.0001558351,0.0006207232,0.0005848118,0.00009609526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0011836,0.000244022,0.004517944,0.0005668178,0.0001282445,0.0004887708,0.0007950287,0.03474495,0.03449907,0.1390774,0.02246715,0.7612871],"study_design_scores_gemma":[0.0001633755,0.0003762159,0.002067651,0.00009996491,0.0001229728,0.0007287601,0.0005633297,0.2402496,0.06948565,0.634312,0.05166336,0.0001671817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.077154,0.0004542969,0.9081548,0.0003463246,0.0001420289,0.000185237,0.001170343,0.003685926,0.008707134],"genre_scores_gemma":[0.357646,0.0003197448,0.6259618,0.0001094277,0.0001103207,0.0001673824,0.003860015,0.0009195965,0.01090566],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01103541,"threshold_uncertainty_score":0.03691715,"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."}}