{"id":"W2012117787","doi":"10.1145/1940475.1940479","title":"A fast recursive algorithm for computing cyclotomic polynomials","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm; Algebra over a field; Parallel computing; Mathematics; Pure mathematics","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006927043,0.0003135079,0.0004179927,0.000430321,0.0004038827,0.0001903467,0.00719674,0.0001297569,0.000007753885],"category_scores_gemma":[0.00008902544,0.0003416045,0.0001821819,0.0007890636,0.0001762742,0.0006706082,0.003863824,0.0003363887,0.00006388954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001500468,"about_ca_system_score_gemma":0.0001599409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001996769,"about_ca_topic_score_gemma":0.00005607837,"domain_scores_codex":[0.9975046,0.0002883588,0.0007831882,0.0006619805,0.0001915571,0.0005703436],"domain_scores_gemma":[0.9944156,0.001140382,0.0003157874,0.003799893,0.0001838087,0.0001445617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006884551,0.0002828992,0.0002705053,0.000009147278,0.00004204981,0.000003811093,0.004138217,0.00006370685,0.00004298411,0.05558425,0.0008523714,0.9387032],"study_design_scores_gemma":[0.001374928,0.0002093731,0.009379307,0.0001110854,0.00001615224,0.00004874428,0.00006060619,0.852567,0.0005662438,0.1330101,0.002059087,0.0005974082],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01219265,0.0003347966,0.9834195,0.001429221,0.000773313,0.0008126532,0.00001357836,0.0003794491,0.0006448448],"genre_scores_gemma":[0.2364487,0.00004241148,0.7623695,0.0008025622,0.0001654408,0.0000948564,0.0000316365,0.00002423691,0.00002064786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9381058,"threshold_uncertainty_score":0.9999036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05293683255233263,"score_gpt":0.2971493538939185,"score_spread":0.2442125213415859,"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."}}