{"id":"W2071880409","doi":"10.1109/jbhi.2014.2315798","title":"A Chance-Constrained Programming Approach to Preoperative Planning of Robotic Cardiac Surgery Under Task-Level Uncertainty","year":2014,"lang":"en","type":"article","venue":"IEEE Journal of Biomedical and Health Informatics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lawson Health Research Institute; Western University; SickKids Foundation; Hospital for Sick Children","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Maximization; Computer science; Artificial intelligence; Entropy (arrow of time); Robotics; Robustness (evolution); Mathematical optimization; Robot; Machine learning; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004001144,0.0001738655,0.0008028965,0.0003794754,0.0001421962,0.00007685428,0.0003856391,0.0001012057,4.011607e-7],"category_scores_gemma":[0.0001993465,0.0001265932,0.0001010841,0.0004985972,0.0001396948,0.0003657064,0.00007705206,0.0003538807,0.00000152157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007897004,"about_ca_system_score_gemma":0.0007188388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000212435,"about_ca_topic_score_gemma":2.110628e-7,"domain_scores_codex":[0.9969798,0.0001383511,0.001588211,0.0001145191,0.0007174457,0.0004616349],"domain_scores_gemma":[0.9975132,0.0003912126,0.001032748,0.0001903036,0.0002249813,0.0006474915],"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.00006334158,0.0005530884,0.002307915,0.002932719,0.0003744538,0.00001533487,0.0849888,0.09439635,0.00008065029,0.002697554,0.009175051,0.8024148],"study_design_scores_gemma":[0.0008046746,0.001558832,0.007882084,0.001781106,0.00003181891,0.0004238271,0.002882205,0.9820689,0.00005821665,0.0003583493,0.001762016,0.0003879713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008730512,0.0001544898,0.988122,0.001901002,0.0007817834,0.0002223554,0.000005949119,0.00002129492,0.00006056688],"genre_scores_gemma":[0.3241713,0.0000376842,0.6742927,0.00121094,0.0002625844,0.000005946629,0.000004402451,0.000006949446,0.000007501304],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8876725,"threshold_uncertainty_score":0.516232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07788039145171523,"score_gpt":0.3150091377617082,"score_spread":0.237128746309993,"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."}}