{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007490114,0.002449242,0.002731234,0.00351255,0.003314309,0.00741341,0.006922249,0.005600803,0.0238584],"category_scores_gemma":[0.03009578,0.001197092,0.002519536,0.004423776,0.004894931,0.01466626,0.007638074,0.01110233,0.0109402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005278284,"about_ca_system_score_gemma":0.005169587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001838854,"about_ca_topic_score_gemma":0.002490795,"domain_scores_codex":[0.9914267,0.002235366,0.0003793222,0.001536909,0.00312313,0.001298602],"domain_scores_gemma":[0.9832242,0.009911832,0.0005496251,0.003654491,0.001842686,0.0008173051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005476893,0.0002189323,0.0004075092,0.0002520153,0.00009534874,0.00007562001,0.0002126351,0.02365882,0.00347257,0.8907065,0.01544882,0.06490356],"study_design_scores_gemma":[0.00009064169,0.000101937,0.000251443,0.0001284372,0.00007593402,0.0001223143,0.00004452268,0.1201083,0.003640817,0.8609197,0.01445119,0.00006474405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02670721,0.005403428,0.857419,0.00940668,0.001340467,0.0002173518,0.0006230004,0.002109763,0.09677309],"genre_scores_gemma":[0.3857349,0.00405501,0.5492212,0.003687915,0.00170896,0.0009045126,0.001705906,0.001782708,0.05119899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0238584,"threshold_uncertainty_score":0.07981431,"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."}}