{"id":"W1986190964","doi":"10.1145/2790282.2790287","title":"Optimizing and parallelizing the modular GCD algorithm","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Computer science; Computation; Parallel computing; Modular arithmetic; Algorithm; Polynomial; Theoretical computer science; Mathematics; Programming language","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.0005080554,0.00006673739,0.0000615887,0.00003568183,0.0001271778,0.0001826171,0.0004249673,0.00002034198,0.000003789546],"category_scores_gemma":[0.00001319419,0.00004167362,0.00002950105,0.0001836548,0.0000459996,0.0002535636,0.0002474622,0.0000679702,0.00001032804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004701619,"about_ca_system_score_gemma":0.00001298751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001198358,"about_ca_topic_score_gemma":0.00000121349,"domain_scores_codex":[0.9994336,0.00005562271,0.00007340555,0.0001716102,0.000121203,0.0001445044],"domain_scores_gemma":[0.9995022,0.00005421618,0.00001960154,0.0003139571,0.00002999983,0.0000800714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002482609,0.00001581049,0.00008409799,0.000001770804,0.00001666815,0.00000893267,0.002746409,0.0004544421,0.00008868716,0.7362197,0.0008707375,0.2594903],"study_design_scores_gemma":[0.0004370098,0.0001017183,0.0002272396,0.00001173691,0.000008045643,0.00005882931,0.0006362879,0.7274921,0.0005653517,0.2390249,0.03118282,0.0002539827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005290321,0.0005580551,0.9850396,0.001257923,0.0001421697,0.00005154225,1.214045e-7,0.0001413543,0.007518926],"genre_scores_gemma":[0.4558403,0.0000245401,0.5430018,0.0008653408,0.00006495775,0.000006958528,2.231757e-7,0.000004764965,0.0001911344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7270377,"threshold_uncertainty_score":0.1760981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02834768322936856,"score_gpt":0.2328361945423773,"score_spread":0.2044885113130087,"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."}}