{"id":"W1992872735","doi":"10.1016/s0895-7177(02)00118-8","title":"An optimal two-stage graphical search planning procedure for submerged targets","year":2002,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Graphical model; Constraint (computer-aided design); Computer science; Mathematical optimization; Code (set theory); Stage (stratigraphy); Bayesian probability; Algorithm; Graphical user interface; Source code; Search algorithm; Mathematics; Artificial intelligence; Programming language","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.0001526909,0.0001566175,0.0002319071,0.00006481259,0.0001142867,0.0001029398,0.00009553931,0.00007503582,0.00003175259],"category_scores_gemma":[0.000001813603,0.0001360694,0.00006327742,0.00007436312,0.00002185535,0.0001077581,0.00001366542,0.0001583414,0.00001061605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009337713,"about_ca_system_score_gemma":0.000001749119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.924273e-7,"about_ca_topic_score_gemma":2.180566e-7,"domain_scores_codex":[0.9990943,0.00001852125,0.000237622,0.0002104215,0.0001402797,0.0002988209],"domain_scores_gemma":[0.9996375,0.00004570731,0.00001338266,0.000122577,0.00002602576,0.0001547638],"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.00001264591,0.00004463153,0.000008672979,0.0003083282,0.00002886703,0.000004355839,0.00095305,0.991459,0.0002874565,0.004931924,0.00005918375,0.001901902],"study_design_scores_gemma":[0.0004688249,0.00007475481,0.00000213985,0.00005275563,0.000009153458,0.00001858154,0.0000574665,0.9977906,0.0001980563,0.000846366,0.0003028732,0.0001784123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2406912,0.00024369,0.7583268,0.00002322088,0.00007130231,0.0002079671,0.000003073358,0.0002405687,0.0001921258],"genre_scores_gemma":[0.9687976,0.000006709873,0.03078261,0.00003150204,0.0002209043,0.00005509793,0.000002632437,0.00003056074,0.00007240546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7281064,"threshold_uncertainty_score":0.5548747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03159555799745902,"score_gpt":0.2463338443902232,"score_spread":0.2147382863927642,"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."}}