{"id":"W2018206679","doi":"10.1145/2576802.2576817","title":"A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Divisor (algebraic geometry); Mathematics; Greatest common divisor; Combinatorics; Algorithm; Statistics","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001356087,0.0002568179,0.0004286935,0.0003361636,0.0003675692,0.000189555,0.01096203,0.00008023695,0.000004837885],"category_scores_gemma":[0.0001038861,0.0002131502,0.000160022,0.001280488,0.0002675629,0.0002842886,0.006554113,0.0003624046,0.00005187771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003273842,"about_ca_system_score_gemma":0.00003759472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003128901,"about_ca_topic_score_gemma":0.0001448134,"domain_scores_codex":[0.9972032,0.00107684,0.0006686749,0.0004320489,0.000242939,0.0003762387],"domain_scores_gemma":[0.9894065,0.002658311,0.0002379694,0.00745767,0.0001204221,0.0001191615],"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.00001276772,0.0004580367,0.002850832,0.000009836297,0.00006325798,0.000001592143,0.003193045,0.001641997,0.00009262435,0.342382,0.0006266881,0.6486673],"study_design_scores_gemma":[0.001176048,0.0003525718,0.06388675,0.0001765389,0.0000239829,0.00002260335,0.00002613877,0.7687775,0.0002133751,0.1514255,0.01338581,0.0005331504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01960688,0.0001336341,0.9714527,0.007466225,0.0002946665,0.0004723047,0.000007607196,0.0001820658,0.0003839454],"genre_scores_gemma":[0.5034875,0.00002255584,0.4953342,0.001032014,0.00004711044,0.00005192032,0.000006629738,0.00001120469,0.000006816802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7671355,"threshold_uncertainty_score":0.9943891,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03876171908900557,"score_gpt":0.2948750600822716,"score_spread":0.256113340993266,"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."}}