{"id":"W4417316699","doi":"10.46298/lmcs-21(4:30)2025","title":"Approximating Queries on Probabilistic Graphs","year":2025,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India; Agence Nationale de la Recherche; National Research Foundation; Deutsche Forschungsgemeinschaft; National Research Foundation Singapore","keywords":"Probabilistic logic; Conjunctive query; Hyperbolic tree; Probabilistic database; Bounded function; Time complexity; Probabilistic analysis of algorithms; Focus (optics); Binary number; Treewidth","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.004101625,0.0002043189,0.0003024227,0.0004213199,0.0002878006,0.0004929231,0.002495871,0.00007029985,0.000003101501],"category_scores_gemma":[0.0008186786,0.0001580094,0.00006273116,0.003205905,0.0006249158,0.0004323804,0.0009721711,0.0003913456,0.000008508208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008780656,"about_ca_system_score_gemma":0.0002010381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001078361,"about_ca_topic_score_gemma":0.000001347016,"domain_scores_codex":[0.9971083,0.0004441144,0.0004652775,0.001044339,0.0003863933,0.0005515555],"domain_scores_gemma":[0.9978467,0.001006628,0.00008798416,0.000814338,0.0001275931,0.0001167731],"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.000002072821,0.00005476208,0.00008893295,0.00001132156,9.923052e-7,0.000005368679,0.000102875,0.003460254,0.0003271067,0.5719424,0.000007513438,0.4239963],"study_design_scores_gemma":[0.00007307974,0.00008627222,0.001234525,0.00008008692,8.212368e-7,0.000004342998,0.000002686637,0.5627656,0.001084502,0.434508,0.00003815139,0.0001219531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003969647,0.00005399383,0.9900711,0.0008446729,0.0009384276,0.0001909604,2.412654e-7,0.000244438,0.003686497],"genre_scores_gemma":[0.2186601,0.00000374641,0.7799118,0.001356595,0.00001793188,0.00002779311,9.69286e-8,0.000002430997,0.00001953711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5593054,"threshold_uncertainty_score":0.6443435,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07204387294373597,"score_gpt":0.3981254690196539,"score_spread":0.3260815960759179,"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."}}