{"id":"W2151460223","doi":"10.1287/ijoc.1090.0321","title":"Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; National Science Foundation","keywords":"Convexity; Solver; Mathematical optimization; Computer science; Tree (set theory); Nonlinear programming; Optimization problem; Constraint satisfaction problem; Mathematics; Nonlinear system; Artificial intelligence; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true,"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.001441513,0.0001778078,0.0003117594,0.0003224159,0.0003860685,0.0001644985,0.0001379948,0.0001006562,0.00001227689],"category_scores_gemma":[0.0005678706,0.0001553128,0.00008514396,0.0002628184,0.00007605212,0.0003926905,0.00004019085,0.0006786549,0.000001543094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002760148,"about_ca_system_score_gemma":0.0001154926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002254674,"about_ca_topic_score_gemma":0.000008769184,"domain_scores_codex":[0.9982386,0.00007036859,0.0006794364,0.0001866318,0.0004746458,0.0003502659],"domain_scores_gemma":[0.9979003,0.001047634,0.0003989569,0.0001068238,0.000386815,0.0001594592],"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.0003229518,0.0004112037,0.003211818,0.0001072352,0.00007177668,0.00003273465,0.0008262874,0.1177522,0.0001180398,0.06016876,0.0001521465,0.8168248],"study_design_scores_gemma":[0.002567107,0.0004574717,0.02700449,0.00008305001,0.000006213943,0.0001109087,0.0001431184,0.7041885,0.0001710057,0.2649834,0.0001096349,0.0001751676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2278943,0.00001052869,0.770467,0.0003678045,0.0001522673,0.000414165,0.000004319483,0.00004786729,0.0006417496],"genre_scores_gemma":[0.8140622,0.00001039805,0.1854897,0.0003227711,0.00007946582,0.000003361469,0.000004880484,0.00001145315,0.00001577461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8166496,"threshold_uncertainty_score":0.633347,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05230251937125117,"score_gpt":0.3995486111479443,"score_spread":0.3472460917766931,"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."}}