{"id":"W1596459745","doi":"10.1023/a:1016521712726","title":"A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Coprime integers; Mathematics; Logarithm; Discrete logarithm; Heuristic; Calculus (dental); Saddle point; Discrete mathematics; Computer science; Mathematical analysis; Mathematical optimization","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.0005411738,0.0002265095,0.0002321473,0.0001310122,0.0006045956,0.0001953046,0.001132807,0.00007661006,0.00001446632],"category_scores_gemma":[0.00001062756,0.0001181666,0.0003695589,0.0008537312,0.0004338502,0.0002038421,0.0002119898,0.0001539188,8.309481e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004422919,"about_ca_system_score_gemma":0.00001078125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002380255,"about_ca_topic_score_gemma":0.00001154145,"domain_scores_codex":[0.9985296,0.0001435464,0.0002887428,0.000396699,0.0002596448,0.0003817786],"domain_scores_gemma":[0.9985935,0.0003569177,0.0001536057,0.0007201769,0.000102861,0.00007294298],"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.00001860573,0.0001768105,0.0005714982,0.00006291615,0.0002148696,0.000002271428,0.002754578,0.00004138324,0.0005817859,0.3166656,0.001469749,0.6774399],"study_design_scores_gemma":[0.002532715,0.001766455,0.002026656,0.0002386092,0.0003571321,0.0001291827,0.0005917988,0.3082612,0.01815296,0.6167743,0.04799387,0.001175061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001752255,0.001761503,0.9938137,0.0009807491,0.0001746924,0.0009146981,0.00002896784,0.00008141546,0.000492007],"genre_scores_gemma":[0.7773046,0.000259334,0.2212216,0.0005181441,0.0001039486,0.0004067373,0.000002258721,0.0000296378,0.0001537228],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7755524,"threshold_uncertainty_score":0.4818694,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02257684429155489,"score_gpt":0.2215719582243225,"score_spread":0.1989951139327677,"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."}}