{"id":"W1970815075","doi":"10.1145/1073884.1073903","title":"Algorithms for the non-monic case of the sparse modular GCD algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Modular design; Algorithm; Algorithm design; Theoretical computer science; 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.001255868,0.0007166383,0.0007996492,0.0009616439,0.0007912419,0.001161015,0.001364906,0.0007967436,0.007913317],"category_scores_gemma":[0.005621819,0.0004001357,0.0007435955,0.001268895,0.0009171243,0.00239824,0.002265054,0.001362508,0.002655325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008594753,"about_ca_system_score_gemma":0.001577804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485138,"about_ca_topic_score_gemma":0.002747752,"domain_scores_codex":[0.9991482,0.000186389,0.00007291667,0.0001562369,0.0002831255,0.0001531262],"domain_scores_gemma":[0.998333,0.0006569602,0.000129156,0.0004674291,0.000329412,0.00008401083],"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.0004318894,0.0001751603,0.002125406,0.0002070197,0.00005243816,0.0002472994,0.0003693365,0.09055454,0.007443721,0.2788084,0.01233868,0.6072461],"study_design_scores_gemma":[0.0001925343,0.00009242965,0.0003268276,0.00003273556,0.00002798104,0.0002742858,0.00009945413,0.7642975,0.007862951,0.2138365,0.01292135,0.00003534128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01122531,0.0001067165,0.9840518,0.0001692438,0.00003456906,0.00007014487,0.00004745728,0.001128407,0.003166194],"genre_scores_gemma":[0.1122652,0.0001268288,0.8836582,0.00007168991,0.00008096793,0.0001500322,0.0002614614,0.00018922,0.003196412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007913317,"threshold_uncertainty_score":0.02647269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01762626213556659,"score_gpt":0.2539991642299192,"score_spread":0.2363729020943526,"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."}}