{"id":"W4206995338","doi":"10.1090/mbk/139/32","title":"The Pollard Rho factorisaction algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm","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.001084447,0.001295651,0.001472175,0.001341756,0.001027127,0.002028526,0.001986036,0.001749554,0.01755772],"category_scores_gemma":[0.003939156,0.0005942581,0.0011282,0.001711067,0.001134228,0.001567557,0.001987105,0.002126202,0.005102812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009058776,"about_ca_system_score_gemma":0.002106694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006470555,"about_ca_topic_score_gemma":0.005438981,"domain_scores_codex":[0.9992738,0.000227823,0.00002664154,0.0001446003,0.0002294726,0.0000976672],"domain_scores_gemma":[0.9995084,0.0002101022,0.00002362116,0.0001070522,0.0001243732,0.00002650459],"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.0001849449,0.00008186261,0.0003511774,0.0001914577,0.00007662271,0.00007776005,0.0001185835,0.1715669,0.002371084,0.1530011,0.02817992,0.6437984],"study_design_scores_gemma":[0.00009355323,0.0001103623,0.0002516428,0.00008517583,0.00005114921,0.0001426508,0.00004954942,0.8328491,0.002593644,0.09771626,0.06601223,0.00004469208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004666297,0.001338207,0.9485974,0.0003524878,0.0003580648,0.000128271,0.0001025598,0.0009569242,0.04349973],"genre_scores_gemma":[0.09922022,0.00129607,0.8413752,0.0005012079,0.0001900924,0.0004560107,0.0004053187,0.0007573176,0.05579868],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01755772,"threshold_uncertainty_score":0.05873638,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02215236016215544,"score_gpt":0.2742301322675225,"score_spread":0.2520777721053671,"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."}}