{"id":"W4401569379","doi":"10.1080/01621459.2024.2388908","title":"Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees","year":2024,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Graphical model; Markov chain Monte Carlo; Computer science; Approximate inference; Markov chain; Inference; Theoretical computer science; Graph partition; Algorithm; Mathematics; Graph; Bayesian probability; Artificial intelligence; Machine learning","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003490627,0.0007479834,0.001447084,0.001162393,0.001019052,0.00149744,0.002967283,0.001189442,0.003734611],"category_scores_gemma":[0.01484138,0.001090126,0.001491515,0.001147197,0.001899664,0.002502405,0.002149632,0.002733326,0.0007377867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001556834,"about_ca_system_score_gemma":0.002217242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01106106,"about_ca_topic_score_gemma":0.02015311,"domain_scores_codex":[0.9985514,0.0006403232,0.00005178405,0.0003468429,0.0002744653,0.0001351272],"domain_scores_gemma":[0.9920282,0.005884975,0.0004446805,0.0009730859,0.0003719631,0.0002971769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003040771,0.0001119563,0.003571775,0.000103807,0.0001048041,0.0002317967,0.000233271,0.8210729,0.002445731,0.128663,0.001599621,0.04155734],"study_design_scores_gemma":[0.00002411194,0.000009228706,0.0001053657,0.000006121842,0.000006634762,0.00001650133,0.00001012877,0.9611473,0.0003877374,0.0379839,0.0002971239,0.000005764534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03046386,0.0001244382,0.9671891,0.0001557072,0.00002729055,0.0000916873,0.0001458343,0.0007658383,0.001036232],"genre_scores_gemma":[0.5250382,0.0002752876,0.4695108,0.0002191608,0.00008255371,0.0004803709,0.001089563,0.000561873,0.002742199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01106106,"threshold_uncertainty_score":0.0219934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0304337309115025,"score_gpt":0.3143485202494659,"score_spread":0.2839147893379634,"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."}}