{"id":"W1543993108","doi":"10.1007/978-3-540-87827-8_2","title":"Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Monic polynomial; Quartic function; Algebraic expression; Mathematics; Degree (music); Polynomial; Algebraic number; Simple (philosophy); Parametric statistics; Matrix polynomial; Upper and lower bounds; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003758296,0.000390461,0.0005433205,0.001242138,0.0001489581,0.0001826565,0.001247865,0.0002248385,0.000006252611],"category_scores_gemma":[0.0001140314,0.0003626968,0.00009409438,0.0009436428,0.0008388542,0.000476773,0.000697188,0.0003372645,0.000004215228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001209988,"about_ca_system_score_gemma":0.0005249651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002846324,"about_ca_topic_score_gemma":0.0000110176,"domain_scores_codex":[0.9973381,0.00003288611,0.0005819706,0.001038858,0.0006015185,0.0004066949],"domain_scores_gemma":[0.9981392,0.0005006093,0.0004211946,0.0006371233,0.0001553712,0.0001464925],"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.000008677173,0.00003004005,0.00007680551,0.00005299909,0.00001152113,0.00003031396,0.0007843312,0.01498118,0.0001020083,0.002494507,0.0000410335,0.9813866],"study_design_scores_gemma":[0.000581003,0.0002293267,0.0007304613,0.0002739957,0.00001066119,0.0001993311,2.250048e-7,0.9706658,0.001842074,0.02442531,0.0004102212,0.0006316483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002098948,0.0005729485,0.9950216,0.0002755537,0.0006862111,0.0003242211,0.000005255756,0.00009908586,0.0009161827],"genre_scores_gemma":[0.6551287,0.0001545853,0.3441015,0.0003018554,0.0001948422,0.000004632652,0.000006561388,0.00002250558,0.00008485342],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9807549,"threshold_uncertainty_score":0.9998825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01501828315605321,"score_gpt":0.2259007086924288,"score_spread":0.2108824255363756,"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."}}