{"id":"W2223868250","doi":"10.1184/r1/6605669","title":"Finding optimal Bayesian networks by dynamic programming","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bayesian network; Dynamic programming; Maxima; Exponential function; Maxima and minima; Bayesian probability; Function (biology); Dynamic Bayesian network; Directed acyclic graph; Computer science; Mathematics; Enumeration; Algorithm; Artificial intelligence; Combinatorics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007207779,0.0001550335,0.0001159862,0.00004613521,0.0002249619,0.0003063033,0.0008833191,0.0001098665,0.007483906],"category_scores_gemma":[0.0000957405,0.0001530542,0.0000531594,0.0003370778,0.00001340419,0.0003700295,0.0002799513,0.000197153,0.0008045388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003645314,"about_ca_system_score_gemma":0.00004925946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003845703,"about_ca_topic_score_gemma":0.00000435223,"domain_scores_codex":[0.9987519,0.00002975591,0.0001750059,0.0004130583,0.0001737353,0.0004565668],"domain_scores_gemma":[0.999227,0.00004625361,0.00008091873,0.000400465,0.0001074839,0.0001379076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005300396,0.0000698712,0.0000326433,0.00005204984,0.00002644757,0.00001957981,0.000534971,0.0009256813,0.0001332163,0.0006936854,0.6641332,0.3333734],"study_design_scores_gemma":[0.00008140038,0.00009538089,0.00005397723,0.0003824533,0.000001871838,0.00001021127,0.000006786853,0.9572865,0.0001896755,0.00008435696,0.04156895,0.0002384842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001842843,0.0002532853,0.9938558,0.0001593858,0.0002053035,0.0001623711,0.002607962,0.0005421557,0.002029397],"genre_scores_gemma":[0.9370771,0.000002087154,0.05487882,0.0003078607,0.0002484164,0.0001050061,0.006635552,0.00002696166,0.0007181719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9563608,"threshold_uncertainty_score":0.9999735,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02699603855321714,"score_gpt":0.2755551727978576,"score_spread":0.2485591342446405,"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."}}