{"id":"W1985407367","doi":"10.1016/j.jsc.2007.12.002","title":"A bound for the Rosenfeld–Gröbner algorithm","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; National Science Foundation","keywords":"Mathematics; Ideal (ethics); Gröbner basis; Decomposition; Differential (mechanical device); Upper and lower bounds; Algebraic number; Polynomial; Set (abstract data type); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0003982273,0.0001040897,0.0001834247,0.0001331294,0.000317326,0.0001145302,0.0004536906,0.00003631257,0.00000244703],"category_scores_gemma":[0.0000520474,0.00006996605,0.0001670254,0.000288546,0.00005153543,0.0004728092,0.00005847108,0.0001304297,0.000007467885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004755865,"about_ca_system_score_gemma":0.0002000686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001246653,"about_ca_topic_score_gemma":0.000001108436,"domain_scores_codex":[0.9989071,0.00004495299,0.000431014,0.0001265696,0.0003176247,0.0001727511],"domain_scores_gemma":[0.9986151,0.000468774,0.0003870643,0.0001237134,0.0003313833,0.00007394944],"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.00002016527,0.00009795697,0.00007035372,0.000008812148,0.00007773216,0.00002359,0.002830069,0.01284163,0.00032123,0.005157795,0.008615344,0.9699353],"study_design_scores_gemma":[0.001158058,0.0002973309,0.01584694,0.00002470362,0.00002554501,0.001095557,0.00005522732,0.9418423,0.0004350235,0.02972069,0.009337083,0.0001615186],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0525317,0.0003855526,0.943141,0.002517743,0.001167141,0.0001498684,0.000001165765,0.00002870289,0.00007715929],"genre_scores_gemma":[0.9183072,0.00004859867,0.08017325,0.0004506704,0.0008890328,0.000005464034,0.000001456176,0.000008492149,0.0001158001],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9697738,"threshold_uncertainty_score":0.2853133,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02419462705616257,"score_gpt":0.2645510586430663,"score_spread":0.2403564315869037,"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."}}