{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047954,0.0008831595,0.0008186716,0.0008964681,0.0007036485,0.001158213,0.00128928,0.0004638041,0.004044645],"category_scores_gemma":[0.003816373,0.0002731997,0.0004554935,0.001536952,0.0006430035,0.001882477,0.001212906,0.0006375041,0.001664517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104263,"about_ca_system_score_gemma":0.002011175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002110383,"about_ca_topic_score_gemma":0.003383386,"domain_scores_codex":[0.999012,0.0001836637,0.00007522003,0.0002161662,0.0003134877,0.0001994685],"domain_scores_gemma":[0.9988245,0.0002896259,0.0001051949,0.0003183534,0.0003956977,0.00006663497],"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.0008989366,0.000237429,0.006545606,0.0003686645,0.00008775042,0.0003446311,0.0002548116,0.2168267,0.07555075,0.05425967,0.01221583,0.6324093],"study_design_scores_gemma":[0.0001603974,0.0002039223,0.0007414177,0.00002565644,0.00004891738,0.0001906109,0.00007328871,0.9024336,0.05647489,0.02976146,0.00985672,0.00002914718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09627495,0.0004005796,0.8890462,0.0002802721,0.0001364976,0.000183421,0.00009588799,0.005075519,0.008506601],"genre_scores_gemma":[0.3321475,0.0002206826,0.6636961,0.00008466381,0.00007611467,0.000124189,0.0002394649,0.0003407253,0.003070551],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004044645,"threshold_uncertainty_score":0.01353073,"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."}}