{"id":"W2038770474","doi":"10.1145/1277548.1277575","title":"A sparse modular GCD algorithm for polynomials over algebraic function fields","year":2007,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Greatest common divisor; Algebraic number; Field (mathematics); Las vegas; Modular design; Function (biology); Mathematics; Computer science; Algebraic function; Modular arithmetic; Divisor (algebraic geometry); Sparse matrix; Discrete mathematics; Pure mathematics; Physics; Cryptography","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.0005495371,0.0001604725,0.0001720778,0.0001525277,0.0001431726,0.000130021,0.0003827361,0.000111516,0.00006230787],"category_scores_gemma":[0.00002706255,0.0001450678,0.0001345908,0.0002813371,0.0000222168,0.0005009672,0.0001258161,0.00008679084,0.00005801228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004587587,"about_ca_system_score_gemma":0.00005491557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009861802,"about_ca_topic_score_gemma":0.00004248312,"domain_scores_codex":[0.9986346,0.00002074225,0.000314838,0.0004138767,0.0002082285,0.0004077086],"domain_scores_gemma":[0.9991731,0.0001965807,0.00008988736,0.0003364055,0.00006678318,0.0001372662],"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.00001673888,0.00005746464,0.00003055656,0.000005469947,0.00002427573,0.000004194887,0.0001097032,0.00009413397,0.001207866,0.04043756,0.005131806,0.9528802],"study_design_scores_gemma":[0.001916502,0.0005363745,0.01280881,0.00001662206,0.00002722245,0.00002271072,0.00003124976,0.8493547,0.014886,0.08323409,0.03654608,0.0006195892],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0357394,0.00007206212,0.9604188,0.0005310427,0.00131346,0.0003038584,0.000002602887,0.0002651558,0.001353656],"genre_scores_gemma":[0.8209652,0.000003252819,0.1732292,0.002662661,0.0007795206,0.00002427454,0.00001142353,0.00001504463,0.002309376],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9522606,"threshold_uncertainty_score":0.5915695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01442029600102472,"score_gpt":0.2480402675302143,"score_spread":0.2336199715291896,"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."}}