{"id":"W1480311453","doi":"10.48550/arxiv.1212.2486","title":"Extending Factor Graphs so as to Unify Directed and Undirected Graphical Models","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Graphical model; Factor graph; Conditional independence; Computer science; Bayesian network; Theoretical computer science; Message passing; Undirected graph; Inference; Modular decomposition; Moral graph; Factor (programming language); Directed graph; Directed acyclic graph; Algorithm; Graph; Artificial intelligence; Line graph; Voltage graph; Pathwidth","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002279081,0.0004903756,0.0004950471,0.0006263455,0.0003157914,0.000347234,0.001517749,0.0004947479,0.00002287824],"category_scores_gemma":[0.00004294938,0.0005468327,0.0001843268,0.001204619,0.0001636301,0.0006082818,0.002107059,0.0008621627,0.00005271867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001156911,"about_ca_system_score_gemma":0.0002021469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004895093,"about_ca_topic_score_gemma":0.00006034136,"domain_scores_codex":[0.9972161,0.000224404,0.0002555467,0.001462573,0.0001683138,0.0006730292],"domain_scores_gemma":[0.997623,0.0001367332,0.0001681148,0.001132136,0.0002232391,0.0007167432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004435764,0.0001382125,0.002518009,0.00006831404,0.0001533381,0.0001500563,0.001064586,0.028879,0.0003254949,0.962881,0.0001033363,0.003674326],"study_design_scores_gemma":[0.0002961909,0.00006329585,0.005341082,0.0001780727,0.00007856582,0.00001478773,0.00003038953,0.6224065,0.0001714571,0.370353,0.0001344215,0.0009322169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4279476,0.0001885342,0.569455,0.0001027397,0.0003914201,0.0002143642,0.00001665807,0.0007015906,0.0009820595],"genre_scores_gemma":[0.9938691,0.0003325729,0.005118227,0.0001734152,0.00004703474,0.000002164784,0.00001191325,0.00002901314,0.0004166053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5935276,"threshold_uncertainty_score":0.9996983,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09903654883862346,"score_gpt":0.2168789189786269,"score_spread":0.1178423701400035,"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."}}