{"id":"W4406206083","doi":"10.4230/lipics.icdt.2024.15","title":"Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"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; Conjunctive query; Theoretical computer science; Artificial intelligence; Information retrieval; Relational database","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.0009811937,0.0003269615,0.0003455765,0.0002265004,0.000235109,0.0007156265,0.001670544,0.00009333023,0.00001286565],"category_scores_gemma":[0.0001855251,0.0002107527,0.0002560403,0.000647259,0.0003502084,0.002071294,0.0005023173,0.0003355744,0.00008464904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007205011,"about_ca_system_score_gemma":0.00007714945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000111836,"about_ca_topic_score_gemma":0.000007986419,"domain_scores_codex":[0.9977334,0.00005433978,0.0008233701,0.0003607485,0.0005463739,0.0004817616],"domain_scores_gemma":[0.9978569,0.0004337428,0.000222312,0.001194191,0.0002058919,0.00008693427],"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.00007029455,0.000334662,0.000316609,0.001635721,0.0002619228,0.000004331524,0.008394965,0.0001002102,0.000009761136,0.9173837,0.00807838,0.06340949],"study_design_scores_gemma":[0.002570703,0.001847485,0.002223303,0.0009441671,0.0001901325,0.00003481211,0.003292918,0.5743082,0.001964572,0.1277113,0.2835874,0.001324994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.101864,0.0004451875,0.8363909,0.00502908,0.006795802,0.007601961,0.002207411,0.001418056,0.03824761],"genre_scores_gemma":[0.9810436,0.00005749109,0.01655144,0.0009680376,0.0001272482,0.0003755494,0.0002941792,0.00003875624,0.0005437395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8791795,"threshold_uncertainty_score":0.8594248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02464285751339443,"score_gpt":0.2679624310476123,"score_spread":0.2433195735342179,"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."}}