{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008703155,0.0008047011,0.0009560133,0.001665512,0.0008500002,0.001236008,0.001264768,0.0006226493,0.004563867],"category_scores_gemma":[0.004331831,0.0004628515,0.0006902293,0.001973604,0.0009009874,0.003298485,0.003173606,0.00111345,0.001869566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007213617,"about_ca_system_score_gemma":0.001733997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107136,"about_ca_topic_score_gemma":0.001653166,"domain_scores_codex":[0.9989836,0.0001386684,0.00007883714,0.0002192911,0.0003971088,0.0001824177],"domain_scores_gemma":[0.9984807,0.0004338079,0.0001388839,0.0004986293,0.0003381681,0.0001097905],"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.0005550227,0.0002038908,0.003382039,0.0002024263,0.00005727257,0.000239777,0.0003410562,0.02076235,0.02374068,0.06560799,0.01320419,0.8717033],"study_design_scores_gemma":[0.0007322653,0.001092376,0.002193241,0.0001198839,0.0001226418,0.001724982,0.000322656,0.5378493,0.08279437,0.3164587,0.05644407,0.0001455111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04836041,0.0002452023,0.9416339,0.000286536,0.00008372364,0.0001591134,0.0002551642,0.004365617,0.004610289],"genre_scores_gemma":[0.3002186,0.0002072254,0.6930566,0.0001626253,0.0001386135,0.0001988108,0.001185129,0.0003414468,0.00449077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004563867,"threshold_uncertainty_score":0.01526767,"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."}}