{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004984409,0.001202841,0.001564817,0.001781187,0.0007894954,0.004446368,0.003770755,0.002027118,0.004656683],"category_scores_gemma":[0.04164277,0.001000552,0.002912929,0.003257321,0.002044111,0.01150546,0.003590398,0.003413132,0.000773106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004718455,"about_ca_system_score_gemma":0.001577024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004991746,"about_ca_topic_score_gemma":0.005383621,"domain_scores_codex":[0.9891677,0.00282507,0.0008068566,0.002901042,0.00339091,0.0009083351],"domain_scores_gemma":[0.9612752,0.02869667,0.001800046,0.005956654,0.001812399,0.00045908],"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.0006637249,0.0001737479,0.004436175,0.000638293,0.0002338525,0.0002512999,0.0007112597,0.5771458,0.006095926,0.3095517,0.005298122,0.09480001],"study_design_scores_gemma":[0.00003542191,0.00003649666,0.0003110143,0.00002337439,0.0000493482,0.0001172541,0.00009365803,0.7304218,0.00199251,0.2651776,0.001726735,0.00001480535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1031669,0.0007268771,0.8835396,0.002048612,0.00005676724,0.0001865326,0.001365318,0.00255592,0.006353409],"genre_scores_gemma":[0.6648721,0.0006060911,0.3263057,0.0006624712,0.0001902395,0.0003110167,0.002103454,0.0005337423,0.004415285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004991746,"threshold_uncertainty_score":0.03423494,"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."}}