{"id":"W2009009651","doi":"10.1007/s10589-013-9596-x","title":"Lower bounds on the global minimum of a polynomial","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Semidefinite programming; Degree (music); Ball (mathematics); Polynomial; Computation; Discrete mathematics; Mathematical analysis; Algorithm; Mathematical optimization","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":[],"consensus_categories":[],"category_scores_codex":[0.0001046732,0.0001092717,0.0001217702,0.00005888008,0.0002197324,0.00006706783,0.0001577871,0.00004908397,0.0005303962],"category_scores_gemma":[0.0001417036,0.00008496079,0.00003979251,0.0004381887,0.0001853022,0.0001172851,0.00005491342,0.00007847129,0.00004049432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004737046,"about_ca_system_score_gemma":0.00006647572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003978671,"about_ca_topic_score_gemma":6.17763e-7,"domain_scores_codex":[0.9990515,0.00004734304,0.0002970795,0.0001943452,0.0002814372,0.0001282746],"domain_scores_gemma":[0.9985454,0.0006166605,0.0001452309,0.0002018048,0.0004142801,0.00007661982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007793028,0.000162627,0.00007098207,0.00001088865,0.00001932679,7.927158e-8,0.00004499901,0.7004173,0.000004176608,0.2934483,0.003897242,0.001916294],"study_design_scores_gemma":[0.0003681423,0.00004164525,0.000344267,0.00001067177,0.000009581179,0.000004033364,0.0001038194,0.8711882,0.0000159768,0.1263705,0.00143056,0.0001125282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001617437,0.00002164019,0.9898209,0.00295082,0.0000255588,0.0008788207,0.00003676819,0.00005099572,0.004597048],"genre_scores_gemma":[0.3133492,0.00003198968,0.6839264,0.0008268402,0.0001289638,0.0008601075,0.0001078364,0.0000313868,0.0007372601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3117318,"threshold_uncertainty_score":0.5807466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03058245235795909,"score_gpt":0.3310471121649883,"score_spread":0.3004646598070292,"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."}}