{"id":"W4254045242","doi":"10.1090/mbk/139/31","title":"The Pollard 𝑝-1 factorisation algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725272,0.001261948,0.00120448,0.001338838,0.0011063,0.002268738,0.001951691,0.001222747,0.02497337],"category_scores_gemma":[0.005358336,0.0007252711,0.001122642,0.001924026,0.001254388,0.002237313,0.002470652,0.002404664,0.01835542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007755417,"about_ca_system_score_gemma":0.001490751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002798085,"about_ca_topic_score_gemma":0.003174185,"domain_scores_codex":[0.9989306,0.0002340277,0.00004517439,0.0002214346,0.0004168433,0.0001520139],"domain_scores_gemma":[0.9991127,0.0002526327,0.00003614441,0.0003032497,0.0002553519,0.00003994203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002684192,0.00006067634,0.0002851716,0.000233552,0.00005969316,0.00008186758,0.0001493165,0.02490853,0.003857701,0.1911975,0.04498103,0.7339165],"study_design_scores_gemma":[0.0001654222,0.0001146375,0.0004428059,0.0001264817,0.00006941317,0.0003947403,0.00009860935,0.2499476,0.0116286,0.5583275,0.1785985,0.00008571815],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003783248,0.001226468,0.9579108,0.0004388226,0.0005294544,0.00008562018,0.0001920073,0.002258322,0.03357523],"genre_scores_gemma":[0.07466108,0.00145228,0.8578771,0.0004899295,0.0004366954,0.0002788083,0.001012027,0.00150502,0.06228713],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02497337,"threshold_uncertainty_score":0.08354419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01643895658298788,"score_gpt":0.2382546106545204,"score_spread":0.2218156540715325,"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."}}