{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018302,0.0009982636,0.0009955377,0.003581169,0.001284525,0.002585301,0.001278753,0.001316233,0.003620051],"category_scores_gemma":[0.01948759,0.0006470343,0.001200163,0.002942448,0.002520247,0.003947574,0.00188113,0.00205933,0.000620514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250644,"about_ca_system_score_gemma":0.0009174559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002760921,"about_ca_topic_score_gemma":0.003622417,"domain_scores_codex":[0.9984701,0.0007319823,0.00007113782,0.0002451818,0.0003638949,0.000117587],"domain_scores_gemma":[0.9848016,0.01131794,0.001114891,0.001261002,0.001099874,0.0004046313],"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.0001760669,0.0001308938,0.007659807,0.0002506254,0.00008726704,0.0004085051,0.0007487456,0.2631178,0.003586691,0.5958985,0.006112212,0.1218228],"study_design_scores_gemma":[0.00001089034,0.00002247204,0.0006634734,0.00005008219,0.0000190777,0.0001068705,0.00009618564,0.7132318,0.001519371,0.2819991,0.002259587,0.0000211955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03748724,0.000320393,0.9574556,0.0004285607,0.00002769154,0.00006904492,0.0001842983,0.0002784947,0.003748631],"genre_scores_gemma":[0.4391779,0.0004678957,0.5560163,0.000157057,0.00006797558,0.0002537359,0.0006232044,0.000359795,0.002876063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003620051,"threshold_uncertainty_score":0.01211029,"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."}}