{"id":"W4387074962","doi":"10.48550/arxiv.2309.13287","title":"Approximating Queries on Probabilistic Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"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; Computer science; Combinatorics; Chordal graph; Conjunctive query; Mathematics; Theoretical computer science; Discrete mathematics; Graph; Artificial intelligence; Information retrieval","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.0003410671,0.0002955764,0.0002714461,0.0003640205,0.0001851728,0.0003300033,0.002399736,0.0001303448,0.00001002963],"category_scores_gemma":[0.00007858768,0.0003249556,0.0001568828,0.0008024948,0.000101431,0.0004750091,0.003773347,0.0004276185,0.0003331612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009213005,"about_ca_system_score_gemma":0.00006143991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008493469,"about_ca_topic_score_gemma":0.00002419273,"domain_scores_codex":[0.9980161,0.0000870391,0.0001966759,0.001215687,0.0001275494,0.0003569962],"domain_scores_gemma":[0.9980015,0.0001186254,0.0002169767,0.001500135,0.00006561293,0.00009714756],"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.000005747224,0.00005682459,0.0002502514,0.0001640458,0.00005894497,0.0002480934,0.0001122457,0.04925618,0.000001083873,0.9466041,0.0009507746,0.002291717],"study_design_scores_gemma":[0.0001738995,0.00004760579,0.000494705,0.0001418304,0.00003258475,5.889932e-7,0.00006235252,0.5830557,0.00001101019,0.4149234,0.0006601265,0.0003962447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04132402,0.00001740712,0.9457985,0.0003395843,0.001778417,0.0007185803,0.00004898651,0.001727536,0.008246962],"genre_scores_gemma":[0.9805087,0.000102182,0.009909508,0.0001297106,0.0000923202,0.000005492309,0.00009780488,0.00003641885,0.009117825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9391847,"threshold_uncertainty_score":0.9999202,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1214280963833,"score_gpt":0.1940844299731426,"score_spread":0.07265633358984262,"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."}}