{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":961,"total_is_capped":false,"direct_labels_cover":2,"predictions_cover":961,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"5bebb99d1830","filters":{"topic":"Bayesian Modeling and Causal Inference"}},"results":[{"id":"W178169250","doi":"","title":"Proceedings of the 20th conference on Uncertainty in artificial intelligence","year":2004,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1548,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Scope (computer science); Computer science; Library science; Operations research; Artificial intelligence; Engineering; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.06224835690363485,"gpt":0.2800019701178966,"spread":0.2177536132142618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002266582,0.00009924489,0.0001153563,0.00006051944,0.0000449396,0.00007241108,0.0009717462,0.00005138074,0.000009777345],"category_scores_gemma":[0.00004542375,0.00006432102,0.00003920265,0.0005142846,0.00008776833,0.0001677373,0.000141649,0.0001845769,0.00002117109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004495422,"about_ca_system_score_gemma":0.0001353114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002094085,"about_ca_topic_score_gemma":0.00009617546,"domain_scores_codex":[0.9990348,0.000008747026,0.0002539991,0.0002692814,0.0002389389,0.0001941844],"domain_scores_gemma":[0.9995275,0.00002281558,0.00007069662,0.0002097152,0.0001286719,0.00004065872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004619983,0.00006306339,0.00007562285,0.000004723504,0.000001136041,4.350217e-7,0.0004956926,0.005828344,0.001478749,0.9798506,0.00001220399,0.01218484],"study_design_scores_gemma":[0.00006687705,0.0001271314,0.0008801382,0.0001520007,0.000001412955,0.000003617021,0.0002011526,0.127246,0.06192082,0.8092366,0.00001172366,0.0001524639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.321051,0.000008684669,0.6485759,0.005881392,0.0002126261,0.0002102917,0.000001025665,0.00008913202,0.02397],"genre_scores_gemma":[0.9942953,0.000005508294,0.00531223,0.0003071226,0.000013381,0.000006480027,8.264157e-8,0.000002766923,0.00005709941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6732444,"threshold_uncertainty_score":0.2622935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W349770100","doi":"","title":"The Optimality of Naive Bayes.","year":2004,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1402,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Naive Bayes classifier; Machine learning; Bayesian programming; Bayes error rate; Artificial intelligence; Conditional independence; Bayes classifier; Bayes' theorem; Computer science; Classifier (UML); Mathematics; Bayes factor; Support vector machine; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.01804341773806222,"gpt":0.2526500020834926,"spread":0.2346065843454304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002248851,0.00004570691,0.0000558717,0.00001047292,0.000084507,0.00005144924,0.0005997143,0.00002141468,0.000004249591],"category_scores_gemma":[0.00002087851,0.0000270483,0.00003215946,0.0001218067,0.00005914297,0.0001168415,0.0001074898,0.00005662678,0.00002418725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001157575,"about_ca_system_score_gemma":0.00007299324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001089711,"about_ca_topic_score_gemma":0.000009013835,"domain_scores_codex":[0.9994947,0.00001586741,0.0001199764,0.0001236447,0.0001265888,0.0001192077],"domain_scores_gemma":[0.9994607,0.00004491863,0.00003348132,0.0003576904,0.0000684862,0.00003472656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[9.97074e-7,0.00001443669,0.00003102371,0.000001420956,0.000003580232,6.939943e-7,0.0001390033,0.0009305694,0.000203792,0.984383,0.0001002517,0.01419119],"study_design_scores_gemma":[0.0005301835,0.0001900388,0.002825876,0.00003497479,0.000005607459,0.00001797836,0.0000953485,0.1040472,0.04827771,0.8421363,0.001549159,0.0002896419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006147412,0.00007508024,0.9776838,0.001918844,0.00008670615,0.00003066896,2.704368e-7,0.00005816071,0.01399908],"genre_scores_gemma":[0.9200091,0.00001766675,0.07963482,0.0001584449,0.000009284541,0.00000192813,7.968769e-8,0.000001360138,0.0001673542],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9138616,"threshold_uncertainty_score":0.1114428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135588948","doi":"10.1109/jproc.2021.3058954","title":"Toward Causal Representation Learning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1024,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Representation (politics); Computer science; Artificial intelligence; Cognitive psychology; Psychology; Cognitive science; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.04589998154648502,"gpt":0.2709303443717051,"spread":0.2250303628252201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000158103,0.00006237653,0.00009032378,0.00002217462,0.00008078983,0.0001043416,0.0005175474,0.00003540737,0.000004327333],"category_scores_gemma":[0.0001534361,0.00004871345,0.00005524535,0.0003543906,0.00002746258,0.0002919704,0.0001766519,0.0001580987,0.000007801597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001376905,"about_ca_system_score_gemma":0.00004962839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001426126,"about_ca_topic_score_gemma":4.718178e-7,"domain_scores_codex":[0.9992813,0.000008265022,0.0001406876,0.0002131416,0.0002283652,0.0001282293],"domain_scores_gemma":[0.999422,0.00002368245,0.0001031225,0.0001082483,0.0003110573,0.00003189445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001316031,0.0001095694,0.01512946,0.0001693832,0.00005715189,0.000006550064,0.006977472,0.001537816,0.715237,0.221205,0.006949102,0.03260832],"study_design_scores_gemma":[0.0001725811,0.00003661992,0.002258603,0.00009558582,0.00001258947,0.00005760136,0.0002748278,0.06173208,0.902813,0.03189513,0.0004963335,0.0001550656],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7638768,0.0001444609,0.2116151,0.00502872,0.0008559757,0.0000998643,5.419714e-7,0.0002026315,0.0181759],"genre_scores_gemma":[0.9888532,0.00001531353,0.009929991,0.0001093198,0.0000541999,0.000003612811,1.323462e-7,0.000004420897,0.001029782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2249764,"threshold_uncertainty_score":0.1986477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993853885","doi":"10.1016/s1566-2535(01)00026-4","title":"A new distance between two bodies of evidence","year":2001,"lang":"en","type":"article","venue":"Information Fusion","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":913,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Metric (unit); Dempster–Shafer theory; Measure (data warehouse); Interpretation (philosophy); Similarity (geometry); Computer science; Similarity measure; Identification (biology); Artificial intelligence; Algorithm; Mathematics; Data mining; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.09037753590317457,"gpt":0.3162440271561893,"spread":0.2258664912530148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002104951,0.00007313349,0.0001019678,0.00008292401,0.00006703653,0.00008863646,0.0004300921,0.000032322,0.00002156361],"category_scores_gemma":[0.00007076585,0.0000566812,0.00003110719,0.0002299039,0.00001655004,0.002757198,0.0001278104,0.00006795745,0.0001147258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000193735,"about_ca_system_score_gemma":0.00007432389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000139364,"about_ca_topic_score_gemma":0.000007824781,"domain_scores_codex":[0.9991826,0.00001804231,0.0003185888,0.00008208787,0.000274465,0.0001242049],"domain_scores_gemma":[0.9992896,0.00006863925,0.0001602432,0.0002811514,0.0001322388,0.0000681074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009717333,0.000005148624,0.005259752,0.00002291579,0.000003480008,5.715697e-7,0.002543821,0.0005097227,0.0001662296,0.02595618,0.001721567,0.9638009],"study_design_scores_gemma":[0.002176703,0.000613191,0.07171547,0.002272352,0.00003895387,0.00004250715,0.0003029481,0.6216111,0.01244531,0.09240807,0.1950346,0.001338846],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01044198,0.00008051092,0.9842409,0.000863551,0.0001025712,0.00006314011,0.000001286164,0.00009371545,0.004112378],"genre_scores_gemma":[0.9635314,0.0001131742,0.03595975,0.0001547157,0.00003836529,0.000002074279,0.000003382028,0.000001447632,0.0001957117],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9624621,"threshold_uncertainty_score":0.2311392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114660707","doi":"10.1613/jair.1234","title":"CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements","year":2004,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":878,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Ceteris paribus; Preference; Outcome (game theory); Inference; Representation (politics); Computer science; Semantics (computer science); Set (abstract data type); Interpretation (philosophy); Artificial intelligence; Mathematical economics; Mathematics; Statistics; Epistemology; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.2770353824879733,"gpt":0.4600891532587523,"spread":0.183053770770779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00383516,0.000136348,0.0002368212,0.0003229777,0.0004110535,0.0006594817,0.0008162134,0.00008096778,0.000016183],"category_scores_gemma":[0.001012791,0.000119692,0.00008193379,0.0004795539,0.0001931398,0.001226591,0.0002568187,0.0005548393,0.00001341486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001184675,"about_ca_system_score_gemma":0.0004810802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000961976,"about_ca_topic_score_gemma":0.00001934837,"domain_scores_codex":[0.9971665,0.0001630394,0.0007992837,0.000369658,0.0009361965,0.0005653402],"domain_scores_gemma":[0.9974142,0.0004207251,0.0002883056,0.0002925716,0.00138395,0.0002002564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004302403,0.000523226,0.001267426,0.0001377542,0.0001516398,0.0001371179,0.006293748,0.01198202,0.02884177,0.5174263,0.0005035965,0.4323052],"study_design_scores_gemma":[0.0002570117,0.001341221,0.0007150653,0.0007829584,0.00001469052,0.0002333909,0.001129893,0.09030212,0.07790895,0.8265997,0.0003459183,0.0003691426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2344209,0.000130313,0.7640154,0.001007369,0.0001554807,0.0001767745,0.000005172547,0.0000159536,0.00007263399],"genre_scores_gemma":[0.8903816,0.000138569,0.1092153,0.000045195,0.0001630957,0.00001788063,0.000001475407,0.000009336969,0.00002759485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6559607,"threshold_uncertainty_score":0.6359397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983690667","doi":"10.1016/s0004-3702(02)00191-1","title":"Learning Bayesian networks from data: An information-theory based approach","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":803,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Carnegie Mellon University; University of Washington","keywords":"Bayesian network; Computer science; Conditional independence; Machine learning; Artificial intelligence; Bayesian probability; Independence (probability theory); Variable-order Bayesian network; Data mining; Bayesian inference; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09874819574461036,"gpt":0.2791029661627809,"spread":0.1803547704181706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099904,0.0002054096,0.0001812016,0.000109836,0.0003314247,0.00071732,0.002327131,0.0001320882,0.000191215],"category_scores_gemma":[0.0001879919,0.0002050216,0.00004389922,0.0005119735,0.0001012371,0.003061542,0.0003040365,0.0004465013,0.0004080354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002412006,"about_ca_system_score_gemma":0.00003915205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001450084,"about_ca_topic_score_gemma":0.00001679648,"domain_scores_codex":[0.9979308,0.0002620078,0.0005009362,0.0005797857,0.0003204571,0.0004060351],"domain_scores_gemma":[0.9978563,0.0002489146,0.0001444764,0.001429976,0.0001190372,0.0002013603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007735311,0.0001007135,0.00004065937,0.000003347555,0.000008710183,0.000002894601,0.001137817,0.2197247,0.00002437962,0.1462506,0.0001418757,0.6325565],"study_design_scores_gemma":[0.0000177502,0.00007111989,0.00001801567,0.00001343082,0.000007153348,0.000002062553,0.0002063778,0.9675561,0.0003551639,0.03086028,0.0006331733,0.000259445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008167216,0.00007910019,0.9957353,0.0002295862,0.0003099444,0.0001102725,0.000008188528,0.0003776363,0.002333237],"genre_scores_gemma":[0.8958138,0.0000186177,0.103141,0.0006752023,0.0001704895,0.00001074624,0.0001192138,0.00001013882,0.00004080522],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8949971,"threshold_uncertainty_score":0.8360538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027334892","doi":"10.1890/12-0976.1","title":"The AIC model selection method applied to path analytic models compared using a d‐separation test","year":2012,"lang":"en","type":"article","venue":"Ecology","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":592,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Akaike information criterion; Path analysis (statistics); Model selection; Statistics; Selection (genetic algorithm); Test statistic; Mathematics; Generalization; Multivariate statistics; Statistic; Separation (statistics); Path (computing); Normality; Latent variable; Statistical hypothesis testing; Econometrics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07198916841485963,"gpt":0.3472428033528066,"spread":0.2752536349379469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006873977,0.0001150349,0.0001597073,0.00007700182,0.0003402173,0.00009266863,0.0003711543,0.00008030373,0.000002703684],"category_scores_gemma":[0.00003613095,0.00009292941,0.00003218301,0.000363389,0.00001931047,0.0002827939,0.000115072,0.0001346417,0.00004499204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001162887,"about_ca_system_score_gemma":0.0001189547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002287707,"about_ca_topic_score_gemma":0.00005726721,"domain_scores_codex":[0.9988866,0.00009651365,0.0002156654,0.0002622016,0.0001209812,0.0004180708],"domain_scores_gemma":[0.9992077,0.0002297265,0.0000794097,0.000279933,0.00008507217,0.0001182004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006157421,0.0000531972,0.0002312276,0.000001732861,0.00001076822,1.579829e-7,0.000735514,0.905057,0.004328472,0.08663611,0.0003367138,0.002602907],"study_design_scores_gemma":[0.00008923402,0.00003837321,0.0004216283,0.000001930631,0.00001358232,0.00001074575,0.00001498711,0.9732161,0.0004013128,0.02564334,0.00003584158,0.0001129078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02737042,0.00002219646,0.9708642,0.0003074581,0.0001764647,0.0001741118,7.977411e-7,0.00009597249,0.0009883798],"genre_scores_gemma":[0.7522891,0.000001906722,0.2471621,0.0003828993,0.00005553879,0.00003128459,9.443336e-7,0.000005801835,0.00007053898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7249186,"threshold_uncertainty_score":0.3789551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544444076","doi":"10.48550/arxiv.1302.3562","title":"Context-Specific Independence in Bayesian Networks","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":557,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Independence (probability theory); Context (archaeology); Bayesian probability; Bayesian network; Computer science; Artificial intelligence; Econometrics; Mathematics; Statistics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.07534082173510322,"gpt":0.1872408082316576,"spread":0.1118999864965544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003637554,0.0004199104,0.0004496578,0.0003376482,0.0001196793,0.0003295972,0.003090119,0.0006633621,0.00007178243],"category_scores_gemma":[0.00001685594,0.000493078,0.0001649419,0.0007182814,0.0001361776,0.000603253,0.002054804,0.001651938,0.0001848117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002205116,"about_ca_system_score_gemma":0.0002789446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007796329,"about_ca_topic_score_gemma":0.0002251771,"domain_scores_codex":[0.9971865,0.0002077398,0.0003339221,0.001532006,0.0001357772,0.0006040058],"domain_scores_gemma":[0.9976321,0.0001073829,0.0002313571,0.001557191,0.0002161054,0.0002557883],"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.00001192925,0.00008049267,0.002281527,0.00002486636,0.00002303294,0.0003656658,0.0002235162,0.4345514,0.000006264333,0.5522088,0.0006348127,0.00958774],"study_design_scores_gemma":[0.0002884688,0.00002678849,0.0009607626,0.000176682,0.000007307396,0.00000523202,0.00004565826,0.8904477,0.00001271837,0.1073095,0.0002137433,0.0005054403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04182358,0.000433043,0.9540632,0.000150417,0.0007080758,0.0002893027,0.000003094015,0.0002571305,0.002272122],"genre_scores_gemma":[0.996367,0.0006749573,0.001794768,0.0002276196,0.00008466724,0.000002989802,0.000007366384,0.00002079782,0.0008197795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9545435,"threshold_uncertainty_score":0.9997521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124914669","doi":"","title":"Exponential Family Harmoniums with an Application to Information Retrieval","year":2004,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":436,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Graphical model; Exponential family; Computer science; Semantics (computer science); Inference; Probabilistic logic; Artificial intelligence; Random variable; Hidden variable theory; Search engine indexing; Divergence (linguistics); Probabilistic latent semantic analysis; Exponential random graph models; Theoretical computer science; Data mining; Natural language processing; Machine learning; Mathematics; Random graph; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01530961524456303,"gpt":0.2395663121343414,"spread":0.2242566968897784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001192654,0.00007820492,0.0000599708,0.00007008829,0.00007505871,0.0002229804,0.0004015849,0.00003765528,0.000001942304],"category_scores_gemma":[0.000004094549,0.00006304173,0.00001211836,0.00031929,0.00001160445,0.001622536,0.00005346395,0.00006395161,0.000228204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003610396,"about_ca_system_score_gemma":0.00008235293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001560282,"about_ca_topic_score_gemma":0.000009450595,"domain_scores_codex":[0.9992955,0.000009315936,0.0001380215,0.0001748609,0.000234292,0.0001480091],"domain_scores_gemma":[0.9993696,0.000003870847,0.00003539755,0.0003542142,0.0001113165,0.0001255547],"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.0001687872,0.0001442377,0.00005506797,0.00001225634,0.00001154101,0.000002475193,0.003300925,0.02883345,0.02376824,0.7444364,0.0001984758,0.1990681],"study_design_scores_gemma":[0.00341396,0.003553852,0.01469148,0.00008078368,0.00002219924,0.00007007609,0.0005715964,0.7832887,0.1277369,0.05962553,0.005258974,0.001685974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1105793,0.000002223585,0.8872025,0.0006740372,0.00004920994,0.000134018,5.050005e-7,0.0002276317,0.001130546],"genre_scores_gemma":[0.841832,0.000001067927,0.1568935,0.001213551,0.00002473776,0.00000996627,0.000006049163,0.000002554954,0.00001661619],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7544553,"threshold_uncertainty_score":0.2933177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W73939759","doi":"","title":"First-order probabilistic inference","year":2003,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":423,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Unification; Inference; Probabilistic logic; Population; Computer science; Order (exchange); Variable (mathematics); Artificial intelligence; Machine learning; Mathematics; Demography; Sociology","retraction":null,"screen_n_in":null,"score":{"opus":0.03063413944353445,"gpt":0.2628088907239787,"spread":0.2321747512804443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001864131,0.0001082602,0.00009620823,0.00003932169,0.0001006096,0.0001451056,0.000498633,0.00004817036,0.0001363306],"category_scores_gemma":[0.0002990774,0.00008880435,0.00002597799,0.0003657471,0.0000333315,0.0002522489,0.00006753999,0.0001014002,0.0002992387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001749773,"about_ca_system_score_gemma":0.0001187123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003260338,"about_ca_topic_score_gemma":0.00003689021,"domain_scores_codex":[0.9990904,0.00003972384,0.0001505177,0.0003129609,0.0001585197,0.0002479076],"domain_scores_gemma":[0.9991574,0.0001028103,0.00002792495,0.0004857357,0.0001279755,0.00009812656],"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":[2.909511e-7,0.0000321759,0.00025274,0.000006717668,0.000002398501,0.000002323082,0.00009725914,0.001198748,0.00002087858,0.9946586,0.000355189,0.003372671],"study_design_scores_gemma":[0.0002179204,0.00008569553,0.0005014722,0.00002563776,0.000003822224,0.00002120757,0.00001235475,0.5103126,0.0004020559,0.4785385,0.009495129,0.0003835385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001496897,0.00003649649,0.9429408,0.000478855,0.0001596265,0.00007117028,2.085683e-7,0.0002365409,0.05457937],"genre_scores_gemma":[0.8158125,0.000007613516,0.1828173,0.0004097502,0.00000880781,0.00001403459,2.400543e-7,0.000003847363,0.0009260053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8143156,"threshold_uncertainty_score":0.3846208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1530444831","doi":"10.48550/arxiv.1301.6704","title":"SPUDD: Stochastic Planning using Decision Diagrams","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":394,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov decision process; Dynamic programming; Computer science; Influence diagram; Mathematical optimization; Enumeration; Bellman equation; Representation (politics); Stochastic programming; Class (philosophy); State (computer science); Algebraic number; Binary decision diagram; Reduction (mathematics); Markov process; Value (mathematics); Decision tree; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Machine learning; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1125782135995779,"gpt":0.2053104171897187,"spread":0.0927322035901408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001087511,0.0001393338,0.00013062,0.000126458,0.0001830014,0.0001519687,0.0007562452,0.00007601987,0.00003773892],"category_scores_gemma":[0.00003045914,0.0001452251,0.00006004274,0.0005264387,0.00004824081,0.000824723,0.000263198,0.0001540312,0.000277828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006182868,"about_ca_system_score_gemma":0.00005109786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001428163,"about_ca_topic_score_gemma":0.000003282386,"domain_scores_codex":[0.9989856,0.00003882316,0.0001166685,0.0004722513,0.0000755075,0.0003111559],"domain_scores_gemma":[0.9990763,0.000120952,0.00006638943,0.0004686142,0.00009844003,0.0001692747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007573316,0.00004826653,0.001693715,0.000005161945,0.00001549719,0.00008773682,0.0002323596,0.8785416,0.0004876191,0.107885,0.0001886574,0.01080683],"study_design_scores_gemma":[0.0001827411,0.00003116584,0.00091116,0.00004909469,0.000008080661,0.000008718715,0.00004328434,0.9441764,0.00004454319,0.05434648,0.00001389262,0.000184446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4103671,0.00001831828,0.5890486,0.00001412004,0.0001196979,0.00005589782,2.733987e-7,0.00009971434,0.0002762202],"genre_scores_gemma":[0.9859729,0.000003271972,0.01374057,0.00009217999,0.00003220548,2.825599e-7,6.332559e-7,0.000007642747,0.0001502682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5756058,"threshold_uncertainty_score":0.5922109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976452867","doi":"10.1139/x06-238","title":"Bayesian belief networks: applications in ecology and natural resource management","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":382,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"U.S. Bureau of Land Management","keywords":"Bayesian network; Adaptive management; Natural resource management; Ecosystem management; Resource management (computing); Computer science; Resource (disambiguation); Natural resource; Ecology; Bayesian probability; Environmental resource management; Ecosystem; Artificial intelligence; Environmental science","retraction":null,"screen_n_in":null,"score":{"opus":0.01952312044216336,"gpt":0.2832562241847414,"spread":0.2637331037425781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001185829,0.00008057459,0.0001310606,0.0007767806,0.0002312371,0.000211408,0.0007842573,0.00006742306,0.000004275244],"category_scores_gemma":[0.0000217616,0.00007372096,0.00002974485,0.0007130438,0.0001686812,0.000175634,0.00007296884,0.0005912668,0.000003233291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710874,"about_ca_system_score_gemma":0.0003960145,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003771655,"about_ca_topic_score_gemma":0.1395082,"domain_scores_codex":[0.9986032,0.0001402523,0.0002822098,0.0001918085,0.0002352944,0.0005472273],"domain_scores_gemma":[0.9990318,0.0001309239,0.00005853789,0.000242746,0.0001772577,0.0003587351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001036922,0.0000519756,0.3505543,0.00003185698,0.00002224575,0.0007376518,0.000284808,0.01914725,0.000006204772,0.5843598,0.007210632,0.03758289],"study_design_scores_gemma":[0.0005530088,0.0001893577,0.8090686,0.0001118393,0.000005269502,0.0002215759,0.0001947029,0.07174239,0.0000088433,0.09322443,0.02446059,0.0002194425],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3019022,0.005626024,0.6704124,0.006740504,0.0002527144,0.0005940269,0.000003093041,0.00002257581,0.01444645],"genre_scores_gemma":[0.9947889,0.00003618465,0.004634545,0.00007155207,0.0001105783,0.00001059719,0.000001742385,0.000006157255,0.0003397485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6928867,"threshold_uncertainty_score":0.8761935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997477668","doi":"10.1016/s0004-3702(00)00033-3","title":"Stochastic dynamic programming with factored representations","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":365,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Markov decision process; Computer science; Representation (politics); Dynamic programming; Generalization; Decision tree; State space; Computation; Influence diagram; Exploit; Stochastic programming; State (computer science); Dynamic Bayesian network; Dynamic decision-making; Mathematical optimization; Bayesian network; Theoretical computer science; Artificial intelligence; Markov process; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04257783472299416,"gpt":0.3077484925454908,"spread":0.2651706578224967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001287153,0.0001470922,0.0001234909,0.00006837487,0.0002100498,0.0002945182,0.0006321924,0.00004709756,0.0001587918],"category_scores_gemma":[0.00002918012,0.0001262671,0.00004078446,0.0005541858,0.0001151889,0.0004185124,0.00004387207,0.0001639479,0.000479123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002791105,"about_ca_system_score_gemma":0.000075064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001290058,"about_ca_topic_score_gemma":0.0001226236,"domain_scores_codex":[0.9986147,0.00004105796,0.0002754044,0.0004657032,0.0002590182,0.0003441499],"domain_scores_gemma":[0.9991296,0.0000842823,0.00005102249,0.0005195706,0.00009610877,0.0001194358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001369107,0.00007304455,0.00001672461,0.000002816869,0.000009571366,0.00001153538,0.001015788,0.02875926,0.0002262696,0.05607498,0.000008744263,0.9137876],"study_design_scores_gemma":[0.00002331899,0.0001861238,0.0001725001,0.00004329152,0.0000101789,0.00003213372,0.0002058398,0.9336369,0.002686636,0.06252094,0.000157263,0.0003248836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03201635,0.0000349957,0.9660396,0.0005613202,0.00008745508,0.000173135,0.000001534468,0.0002879844,0.0007976373],"genre_scores_gemma":[0.9481677,0.000006277146,0.05137221,0.00008773051,0.00002537235,0.00003403551,0.000003422335,0.00000986024,0.0002933305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9161514,"threshold_uncertainty_score":0.6158317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010225880","doi":"10.5555/777092.777132","title":"A POMDP formulation of preference elicitation problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":276,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Parameterized complexity; Preference elicitation; Preference; Exploit; Decision problem; Artificial intelligence; Markov process; State space; Decision theory; Decision quality; Machine learning; Markov chain; Markov model; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1034912892955536,"gpt":0.2439517545703536,"spread":0.1404604652747999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009062807,0.00005680909,0.00006925543,0.00005587894,0.00003494127,0.00003582039,0.0002583138,0.00003430695,0.00004867753],"category_scores_gemma":[0.00001818137,0.00004812305,0.00002219322,0.0002153958,0.000009371788,0.0004293336,0.00003755733,0.00004284659,0.00004831761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008672382,"about_ca_system_score_gemma":0.000006778777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002902671,"about_ca_topic_score_gemma":0.000004406859,"domain_scores_codex":[0.9993947,0.00001721907,0.0001745611,0.0001515139,0.0001547811,0.000107269],"domain_scores_gemma":[0.9995468,0.00002864549,0.00006462027,0.000220505,0.0001072021,0.00003226714],"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.000001279214,0.00009568942,0.0004931656,0.00003292231,0.000006665387,2.971721e-7,0.002120005,0.002611585,0.007863978,0.7987233,0.000514616,0.1875365],"study_design_scores_gemma":[0.00009913544,0.00006877851,0.001133177,0.00001955177,0.00000145138,0.000001652818,0.000005735467,0.9640647,0.002971868,0.03146516,0.00009675556,0.00007206328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02162935,0.00004338364,0.9623609,0.0002594734,0.00003985098,0.00007821909,3.239557e-7,0.00009756716,0.01549096],"genre_scores_gemma":[0.9528151,0.00001468101,0.04663479,0.00006891034,0.000007839791,0.000006556927,7.4542e-7,0.000002224107,0.0004492032],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9614531,"threshold_uncertainty_score":0.1962401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010780110","doi":"10.1177/0278364910369861","title":"Planning under Uncertainty for Robotic Tasks with Mixed Observability","year":2010,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":238,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Observability; Observable; Representation (politics); Computer science; Robot; State space; Motion planning; State (computer science); Markov decision process; Point (geometry); Artificial intelligence; Mathematical optimization; Robotics; Markov process; Markov chain; Algorithm; Mathematics; Machine learning; Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.1720898217430469,"gpt":0.4145882820447523,"spread":0.2424984603017054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003572341,0.00009663897,0.0001485159,0.0001589047,0.0001915655,0.0004247456,0.003007597,0.00006083799,0.000009220845],"category_scores_gemma":[0.0005022049,0.00005715425,0.0000804369,0.0002204042,0.0002012744,0.0002921814,0.0002706192,0.001037338,0.000005138434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009053141,"about_ca_system_score_gemma":0.0005459995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003398902,"about_ca_topic_score_gemma":0.00004750658,"domain_scores_codex":[0.9977275,0.0001362772,0.000327818,0.0001774261,0.001330573,0.0003003904],"domain_scores_gemma":[0.9951592,0.001315964,0.0001686816,0.0003704614,0.002865029,0.0001206589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001078511,0.00007336304,0.0003910702,0.000005227687,0.00008195017,0.00001695921,0.0002695439,0.9087095,0.002445229,0.08370835,0.0008122837,0.003378693],"study_design_scores_gemma":[0.0005797073,0.0003355434,0.001957789,0.00008294148,0.00001005045,0.0002395494,0.000174139,0.8949795,0.000955423,0.1002075,0.0003592578,0.0001185327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07267913,0.00003748712,0.9083067,0.01772247,0.001006519,0.0001114872,0.000001172071,0.00001262455,0.0001224114],"genre_scores_gemma":[0.9124519,0.00000685409,0.08690155,0.0001706588,0.0003199295,0.000004585445,0.000001128485,0.000008277759,0.0001350736],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8397728,"threshold_uncertainty_score":0.5588914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030623877","doi":"10.1142/s0218001405003983","title":"EXPLORING CONDITIONS FOR THE OPTIMALITY OF NAÏVE BAYES","year":2005,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Bayes' theorem; Conditional independence; Naive Bayes classifier; Independence (probability theory); Artificial intelligence; Machine learning; Class (philosophy); Bayesian probability; Bayesian programming; Computer science; Distribution (mathematics); Mathematics; Gaussian; Bayesian network; Conditional probability distribution; Conditional probability; Prior probability; Algorithm; Bayes factor; Econometrics; Statistics; Support vector machine; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.3707631980474821,"gpt":0.367587719428236,"spread":0.003175478619246108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004767219,0.00007674324,0.0001113139,0.0001122672,0.00007545123,0.0001278459,0.0005019202,0.0000245745,0.00004656412],"category_scores_gemma":[0.0001270064,0.00005815093,0.00009721005,0.00007182559,0.00007968368,0.000681107,0.00005516614,0.000120532,0.00001178534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001888022,"about_ca_system_score_gemma":0.00003836208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000017509,"about_ca_topic_score_gemma":0.00001408067,"domain_scores_codex":[0.998968,0.00003526379,0.0005263356,0.0001176879,0.0002552034,0.00009752583],"domain_scores_gemma":[0.9983571,0.0003851689,0.0003113312,0.00008692727,0.0008084939,0.00005104637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002184351,0.00007141163,0.00004810126,0.000005081406,0.00005042939,0.000002303481,0.0006560229,0.0008857535,0.001436681,0.007186396,0.00002919651,0.9896068],"study_design_scores_gemma":[0.0002475571,0.0004256917,0.001356421,0.0004840853,0.00006652996,0.00027534,0.00141286,0.5382251,0.2512913,0.2048085,0.001038822,0.0003677666],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1043071,0.00008293244,0.8906025,0.004231916,0.0006300486,0.00006125873,0.00003516139,0.000009306433,0.0000397076],"genre_scores_gemma":[0.9871177,0.0003138404,0.01182062,0.0003444422,0.0003802501,0.00001121222,0.000003331042,0.000003775813,0.000004804032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.989239,"threshold_uncertainty_score":0.2371326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1800916125","doi":"","title":"Symbolic dynamic programming for first-order MDPs","year":2001,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":216,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Markov decision process; Bellman equation; Dynamic programming; Enumeration; State space; Computer science; Mathematical optimization; State (computer science); Set (abstract data type); Partition (number theory); Stochastic programming; Function (biology); Value (mathematics); Markov process; Mathematics; Algorithm; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02240077377207218,"gpt":0.2777757904593725,"spread":0.2553750166873003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001488027,0.0001085198,0.0001072594,0.00005387167,0.0001488054,0.0001821574,0.000538596,0.00005389425,0.00001691993],"category_scores_gemma":[0.00002777447,0.00009304097,0.0000510149,0.000312339,0.00002020681,0.0002384975,0.00008580945,0.00006814157,0.00005871548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002133374,"about_ca_system_score_gemma":0.00004279106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002951109,"about_ca_topic_score_gemma":0.000085272,"domain_scores_codex":[0.999069,0.0000097206,0.0001489322,0.0003129807,0.0001182332,0.0003410965],"domain_scores_gemma":[0.99937,0.00005409081,0.00003106115,0.0003524564,0.0001080201,0.00008430705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006678463,0.0001205662,0.0005652246,0.0000301592,0.00001905563,0.000008048475,0.0005091169,0.0005692945,0.0001229683,0.2503189,0.001039532,0.7466905],"study_design_scores_gemma":[0.0002200004,0.00008322331,0.0002386333,0.00001713853,0.000004237952,0.00002522098,0.00001844596,0.9558272,0.00005316785,0.01619136,0.02712055,0.0002008309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004722049,0.00007876545,0.9897671,0.002203371,0.0001634869,0.0001967719,4.153206e-7,0.0003715856,0.002496396],"genre_scores_gemma":[0.6745669,0.00002481344,0.3228253,0.0004109338,0.00003245477,0.00007053247,0.000002041619,0.000008537299,0.002058489],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9552579,"threshold_uncertainty_score":0.3794101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145868584","doi":"10.1257/aer.103.7.2790","title":"“Reverse Bayesianism”: A Choice-Based Theory of Growing Awareness","year":2013,"lang":"en","type":"article","venue":"American Economic Review","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Axiom; Mathematical economics; Extension (predicate logic); Universe; Invariant (physics); Preference; Decision theory; Set (abstract data type); Ranking (information retrieval); Expected utility hypothesis; Epistemology; Mathematics; Computer science; Economics; Microeconomics; Artificial intelligence; Philosophy; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0247825452576291,"gpt":0.2730122084426547,"spread":0.2482296631850256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004782969,0.0001756558,0.0005533919,0.00006092777,0.00004923732,0.00005313501,0.0009413821,0.00002343548,0.0002223772],"category_scores_gemma":[0.00005237929,0.0001581739,0.0001650068,0.0001916129,0.0001664685,0.0005607277,0.0001001159,0.00009941385,0.0004899385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000567667,"about_ca_system_score_gemma":0.0002523213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007213941,"about_ca_topic_score_gemma":0.000005639003,"domain_scores_codex":[0.9985873,0.0001990216,0.0004846229,0.0003910778,0.00007931601,0.0002586343],"domain_scores_gemma":[0.9984232,0.0002307551,0.0003746913,0.0007991413,0.00005069021,0.0001214767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001178471,0.00003450288,0.0009472868,0.0004783296,0.0000330234,0.000001395435,0.00004278667,0.0002060181,0.0001336167,0.05456987,0.002046891,0.9415051],"study_design_scores_gemma":[0.002732498,0.001598452,0.02533115,0.02018675,0.0005248043,0.0001107017,0.000356076,0.6733996,0.006333,0.09602981,0.1674391,0.005958074],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01300395,0.01004723,0.9701344,0.003141262,0.0002185571,0.0004636622,0.000003651441,0.0001407321,0.002846583],"genre_scores_gemma":[0.9453592,0.006456756,0.037401,0.010458,0.00005820667,0.0001385171,0.000003289488,0.0000243211,0.0001006507],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.935547,"threshold_uncertainty_score":0.6450146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144349330","doi":"10.1287/mnsc.47.9.1235.9779","title":"Representing and Solving Decision Problems with Limited Information","year":2001,"lang":"en","type":"article","venue":"Management Science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":206,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Computer science; Markov decision process; Influence diagram; Forgetting; Optimal decision; Decision problem; Computation; Partially observable Markov decision process; Mathematical optimization; Decision rule; Markov chain; Operations research; Markov process; Artificial intelligence; Decision tree; Machine learning; Markov model; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01575540065476958,"gpt":0.2323186183187749,"spread":0.2165632176640053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007791815,0.00008396919,0.00006279871,0.0002619483,0.0003740053,0.0009161699,0.0007126759,0.00001437646,0.000002440086],"category_scores_gemma":[0.00003378413,0.00006584948,0.000008801301,0.00126708,0.0001218004,0.003314669,0.0005788841,0.00006226084,0.00002164586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002350089,"about_ca_system_score_gemma":0.00001664748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001733384,"about_ca_topic_score_gemma":0.000003177997,"domain_scores_codex":[0.9987075,0.000009450698,0.0001625091,0.0003293708,0.0005041576,0.00028702],"domain_scores_gemma":[0.9993241,0.00002476103,0.00007383333,0.0004130056,0.00008360943,0.00008063413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007704908,0.00002636797,0.007826785,0.00003318964,0.000005874577,0.00001677497,0.001011279,0.006354605,0.0002327989,0.1114886,0.0001496725,0.8728463],"study_design_scores_gemma":[0.0002723653,0.00006301368,0.02322735,0.0001519245,0.000004611194,0.00003343323,0.0001271765,0.9652854,0.0001241209,0.007978092,0.00253223,0.0002003123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07110652,0.00001753435,0.9108009,0.0003528286,0.00006623683,0.0001396932,5.745643e-8,0.0001291401,0.01738713],"genre_scores_gemma":[0.8627824,0.00005186632,0.1368135,0.0002257968,0.000006154796,0.000009004497,2.998414e-7,0.000001797999,0.0001092003],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9589308,"threshold_uncertainty_score":0.8834648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2921518676","doi":"10.1016/j.jval.2019.01.006","title":"Bayesian Networks for Risk Prediction Using Real-World Data: A Tool for Precision Medicine","year":2019,"lang":"en","type":"review","venue":"Value in Health","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Public Health Ontario; University of Toronto","funders":"","keywords":"Bayesian network; Machine learning; Computer science; Artificial intelligence; Graphical model; Bayes' theorem; Estimation; Naive Bayes classifier; Bayesian probability; Data mining; Data science; Support vector machine; Risk analysis (engineering); Engineering; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.3173173099108415,"gpt":0.4416796139974549,"spread":0.1243623040866134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006444766,0.0004507883,0.001971508,0.0005163338,0.0002365004,0.0001113954,0.001818552,0.0002737992,0.000001381975],"category_scores_gemma":[0.0003961159,0.0003665906,0.0001965933,0.001016816,0.00004817277,0.0004083185,0.0003559753,0.0006193078,0.000002822541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005384236,"about_ca_system_score_gemma":0.001507352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00374539,"about_ca_topic_score_gemma":0.0001518685,"domain_scores_codex":[0.9949934,0.0007019273,0.001791855,0.001418123,0.0003566164,0.0007380609],"domain_scores_gemma":[0.9940416,0.002153319,0.001370535,0.002135804,0.0001190149,0.0001797431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001069635,0.00002715341,0.00001392056,0.008972229,0.0000229753,5.089574e-7,0.00005782679,0.02067192,8.310285e-9,0.003610143,0.001888245,0.9647244],"study_design_scores_gemma":[0.0002693126,0.000287154,0.000003521713,0.02048692,0.00009850205,0.000006492729,0.000001627359,0.7248714,8.457531e-9,0.001887456,0.251877,0.000210601],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[3.053818e-7,0.4425418,0.5535302,0.00009104471,0.001247344,0.002301722,0.0002022388,0.00007304103,0.00001234036],"genre_scores_gemma":[0.0000162266,0.8658133,0.1323513,0.00009263086,0.001014361,0.0001757594,0.0004132245,0.00005390042,0.00006923179],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9645138,"threshold_uncertainty_score":0.9998786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963456618","doi":"10.1609/aaai.v33i01.33015829","title":"Bayesian Graph Convolutional Neural Networks for Semi-Supervised Classification","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Graph; Inference; Machine learning; Theoretical computer science; Random graph; Graphical model; Spurious relationship; Bayesian probability; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.07611389153592427,"gpt":0.2874026157032265,"spread":0.2112887241673022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351412,0.0002652009,0.0002934298,0.000129231,0.0002228972,0.0002847419,0.002064664,0.0001592153,0.00005305786],"category_scores_gemma":[0.0001450524,0.0002108202,0.0002045605,0.0006255677,0.0002000441,0.0005047424,0.000210767,0.0003350645,0.00004295702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004673759,"about_ca_system_score_gemma":0.0001080898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001597137,"about_ca_topic_score_gemma":0.000003522269,"domain_scores_codex":[0.9978023,0.00002288425,0.0006028861,0.000668283,0.0004499489,0.0004536532],"domain_scores_gemma":[0.9980284,0.0001563604,0.0003661928,0.0004062205,0.0009257179,0.0001171277],"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.00006765809,0.00009060655,0.0004763681,0.00003693828,0.00001424007,6.523396e-8,0.0002492342,0.002563886,0.01755339,0.9477912,0.0001903733,0.03096603],"study_design_scores_gemma":[0.00004609916,0.0001746651,0.0002305076,0.00009417081,0.000009444419,0.000002749361,0.0001413116,0.8241533,0.01990204,0.1550022,0.00002998992,0.000213531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04652651,0.00003275213,0.9442648,0.003766057,0.000861912,0.0007952495,0.000008538918,0.0001395863,0.003604605],"genre_scores_gemma":[0.9938371,0.00001901929,0.00530133,0.0004079085,0.00009801437,0.00007150712,0.000002892842,0.0000158398,0.0002463554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9473106,"threshold_uncertainty_score":0.8596996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1576216411","doi":"10.22329/il.v25i1.1040","title":"The Logic of Deep Disagreements","year":2005,"lang":"en","type":"article","venue":"Informal Logic","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Epistemology; Computer science; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.02678810802545237,"gpt":0.2643453754008185,"spread":0.2375572673753661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002672328,0.00008542189,0.00008559402,0.00002612405,0.0001415948,0.00008369483,0.0009429583,0.00004213375,0.00001829623],"category_scores_gemma":[0.00003060704,0.00005035125,0.00003993489,0.0001465531,0.00007182421,0.0004618273,0.0002253804,0.0001003135,0.0001818624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001227759,"about_ca_system_score_gemma":0.00002564294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007993341,"about_ca_topic_score_gemma":0.00001234346,"domain_scores_codex":[0.99915,0.00001705673,0.0002627572,0.0001049948,0.0002128499,0.0002523655],"domain_scores_gemma":[0.999367,0.00005658111,0.00009852892,0.0003610901,0.00006503446,0.00005174472],"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.000005772004,0.00002784942,0.0002594954,0.000005032276,0.000008750137,0.000001168681,0.0003667933,0.002578771,0.0000761322,0.5883914,0.0002523924,0.4080265],"study_design_scores_gemma":[0.0005674844,0.0005330196,0.008057526,0.0000247199,0.000009974502,0.00003504147,0.000108499,0.8680259,0.002190863,0.08666319,0.03334443,0.0004393747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006503168,0.0002363277,0.9444803,0.001576014,0.0001744195,0.00008046863,8.633366e-7,0.00008361571,0.04686481],"genre_scores_gemma":[0.9798515,0.00003309769,0.01884395,0.0009730004,0.00005445219,0.000005800429,8.030162e-7,0.000001804166,0.0002355783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9733483,"threshold_uncertainty_score":0.2337534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W179198942","doi":"","title":"Combining Component Caching and Clause Learning for Effective Model Counting.","year":2004,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Satisfiability; Component (thermodynamics); False sharing; Disjoint sets; Cache; Theoretical computer science; Boolean satisfiability problem; Inference; Time complexity; Reuse; CPU cache; Algorithm; Mathematics; Discrete mathematics; Parallel computing; Artificial intelligence; Cache algorithms","retraction":null,"screen_n_in":null,"score":{"opus":0.01969585564522821,"gpt":0.2617064070928905,"spread":0.2420105514476623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004066352,0.0001281785,0.0001548037,0.00005716558,0.0003188922,0.0002118631,0.0002387836,0.00005304876,4.205412e-7],"category_scores_gemma":[0.00006959037,0.0001180024,0.00003649264,0.00008233091,0.00003149978,0.0003377835,0.0001470305,0.0002094354,0.000004115982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004375351,"about_ca_system_score_gemma":0.00004620256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001061725,"about_ca_topic_score_gemma":0.00000890987,"domain_scores_codex":[0.9990838,0.00002918708,0.0001508317,0.0003447368,0.0001310545,0.0002603921],"domain_scores_gemma":[0.999427,0.0002005444,0.00005752944,0.0001587257,0.00007319618,0.00008301292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009439419,0.00004358219,0.0002349317,0.0000215293,0.00001649561,0.000002184018,0.001835372,0.5852991,0.004224457,0.382785,0.00002203549,0.02550588],"study_design_scores_gemma":[0.0006425091,0.0001071657,0.00020915,0.00006467497,0.000005795634,0.000008875848,0.00002775483,0.9645809,0.001231777,0.03292817,0.00002908491,0.0001641729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1478912,0.00005315938,0.8505011,0.000365344,0.00006203055,0.0001818877,3.634212e-7,0.0002172985,0.0007275916],"genre_scores_gemma":[0.886323,0.00000593976,0.1132511,0.0003054262,0.00001648748,0.00002778432,0.000001699242,0.000008923083,0.0000596846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7384318,"threshold_uncertainty_score":0.4811997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158679941","doi":"10.1214/06-ba129","title":"Checking for prior-data conflict","year":2006,"lang":"en","type":"article","venue":"Bayesian Analysis","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Prior probability; Computer science; Inference; Context (archaeology); Sampling (signal processing); Data mining; Bayesian probability; Econometrics; Machine learning; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0541998460996983,"gpt":0.3024496183704897,"spread":0.2482497722707914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005107261,0.0001699565,0.0003228521,0.0002982639,0.0001926645,0.0003419657,0.001848501,0.00008174319,0.00003063923],"category_scores_gemma":[0.00003793463,0.0001624152,0.0002189436,0.001345772,0.00003508512,0.0004161359,0.0002684608,0.00009010209,0.00001859514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002798639,"about_ca_system_score_gemma":0.00007273639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003064228,"about_ca_topic_score_gemma":0.0001588357,"domain_scores_codex":[0.9982624,0.00003949358,0.0003519605,0.000728946,0.000250125,0.0003670534],"domain_scores_gemma":[0.9979183,0.00009085931,0.0001326411,0.001651949,0.0001151994,0.00009106755],"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.00003566757,0.0005916895,0.01843822,0.00009288461,0.002658829,0.00005020541,0.0007133877,0.01530076,0.002054558,0.6845429,0.03405957,0.2414613],"study_design_scores_gemma":[0.0001947699,0.00002148812,0.001828004,0.000006881165,0.0003448374,0.000002252028,0.000007928278,0.9846027,0.0003389567,0.006543396,0.005861385,0.0002474307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008137019,0.0002352314,0.9949442,0.0008067035,0.00006436405,0.0001134747,0.00002522068,0.00020625,0.002790881],"genre_scores_gemma":[0.8037228,0.000009112762,0.1948544,0.0002378668,0.0001281184,0.00001423534,0.000115672,0.000009892434,0.0009078992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9693019,"threshold_uncertainty_score":0.6623099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W113002869","doi":"","title":"Learning graphical model structure using L1-regularization paths","year":2007,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Graphical model; Regularization (linguistics); Directed acyclic graph; Markov blanket; Computer science; Markov chain; Model selection; Artificial intelligence; Markov model; Machine learning; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Variable-order Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.02201590631160621,"gpt":0.2645028979282441,"spread":0.2424869916166379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002851635,0.0001088255,0.00009441277,0.0001053384,0.0001695411,0.0001276532,0.0003355333,0.0001187515,0.000009118857],"category_scores_gemma":[0.00002434345,0.00009573362,0.00003854745,0.0003793754,0.00002755623,0.0003339417,0.0001045918,0.0002427744,0.000003366223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002186695,"about_ca_system_score_gemma":0.000052541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001177223,"about_ca_topic_score_gemma":0.000006808843,"domain_scores_codex":[0.9989866,0.00002747829,0.0001814628,0.0002940246,0.0002387253,0.0002716896],"domain_scores_gemma":[0.9994974,0.00002418505,0.00004907594,0.0002359329,0.00009431547,0.00009912831],"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.000004233068,0.00001955602,0.0008893332,0.00000642848,0.000007093543,0.000007672994,0.0004908827,0.3557203,0.03689094,0.5772108,0.0000214075,0.0287313],"study_design_scores_gemma":[0.00007185966,0.00001975221,0.0001873493,0.000007731343,0.000002849943,0.00001238067,0.00001308591,0.9364039,0.003360874,0.05977958,0.00001190463,0.0001286818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1214704,0.00001427397,0.8771699,0.00008554164,0.00008561214,0.00003628024,2.881366e-7,0.0002089318,0.0009287886],"genre_scores_gemma":[0.7382971,0.000001341049,0.2613278,0.0001790546,0.00003018388,2.060781e-7,0.000001736078,0.000005622877,0.0001569432],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6168267,"threshold_uncertainty_score":0.3903904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770616710","doi":"10.1016/b978-0-444-53859-8.00003-5","title":"The Cross-Entropy Method for Optimization","year":2013,"lang":"en","type":"book-chapter","venue":"Handbook of statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Cross-entropy method; Heuristics; Cross entropy; Mathematical optimization; Entropy (arrow of time); Minification; Kullback–Leibler divergence; Computer science; Optimization problem; Mathematics; Algorithm; Principle of maximum entropy; Artificial intelligence; Quadratic assignment problem","retraction":null,"screen_n_in":null,"score":{"opus":0.03155202280743595,"gpt":0.3017830485488732,"spread":0.2702310257414372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002825478,0.0002124704,0.0002695065,0.00004479017,0.0002150861,0.0002841498,0.000698448,0.000169619,0.00006824364],"category_scores_gemma":[0.00008721028,0.0001602346,0.00007702554,0.00001678843,0.0001334891,0.00009621747,0.0001202884,0.0001614771,0.00003538102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002936595,"about_ca_system_score_gemma":0.0001534221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007848727,"about_ca_topic_score_gemma":0.000002190024,"domain_scores_codex":[0.9987559,0.00001957066,0.0004402381,0.0003039749,0.0002693206,0.0002110413],"domain_scores_gemma":[0.9976033,0.000737329,0.0003966464,0.0005169276,0.0006765254,0.00006927328],"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.000006324293,0.000004108642,2.770555e-7,0.00004144074,0.00003123151,8.040108e-7,0.00004055411,0.005475354,0.00001101433,0.912114,0.01001119,0.07226375],"study_design_scores_gemma":[0.0001428128,0.0000850216,5.636135e-7,0.0001245263,0.00002417822,0.00000232495,5.773033e-7,0.6032497,0.0001807035,0.3780501,0.01798626,0.0001531953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.72959e-8,0.0009339488,0.9815952,0.00006277301,0.0003631695,0.0003246186,0.0002548731,0.00004176011,0.01642363],"genre_scores_gemma":[0.000004912446,0.00100553,0.860179,0.00006881493,0.00007625732,0.00002462982,0.00004097742,0.00002510769,0.1385748],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5977744,"threshold_uncertainty_score":0.6534177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134963415","doi":"10.1109/tpami.2005.169","title":"A comparison of algorithms for inference and learning in probabilistic graphical models","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Inference; Graphical model; Machine learning; Algorithm; Belief propagation; Probabilistic logic; Expectation–maximization algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05955866244286064,"gpt":0.3373903912953424,"spread":0.2778317288524818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003367591,0.0001581568,0.0003768365,0.0004355471,0.0001083257,0.00006678943,0.0002418328,0.00006967364,0.000006613235],"category_scores_gemma":[0.00001227884,0.0001423609,0.0001085155,0.0006772208,0.000083214,0.0002171801,0.000006094414,0.0003331626,8.038994e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001529039,"about_ca_system_score_gemma":0.00002134586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004968752,"about_ca_topic_score_gemma":0.001424173,"domain_scores_codex":[0.9986865,0.00008017694,0.0004505595,0.0004291049,0.0001634797,0.0001902094],"domain_scores_gemma":[0.9991917,0.0003267711,0.00009823613,0.0002128203,0.00008284677,0.00008764307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006797279,0.0001292434,0.0009149709,0.00001893865,0.00004842674,3.028371e-7,0.0006536143,0.4258265,0.00007379667,0.0008248998,2.062061e-7,0.5715023],"study_design_scores_gemma":[0.0000906863,0.0001782782,0.0003904676,0.00003398421,0.00009717258,0.000001716245,0.0000400965,0.988322,0.007433189,0.003260241,0.000003659701,0.0001484878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02051809,0.0001508048,0.9788283,0.0002896853,0.00002524339,0.0001274235,0.00000967044,0.00003671232,0.00001404423],"genre_scores_gemma":[0.9823932,0.0001748949,0.01729625,0.00006859466,0.000006112447,0.00003347213,0.000001687287,0.000005422439,0.00002038536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9618751,"threshold_uncertainty_score":0.5805308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114267503","doi":"10.1109/sfcs.2003.1238208","title":"Algorithms and complexity results for #SAT and Bayesian inference","year":2004,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Speedup; Inference; Probabilistic logic; DPLL algorithm; Time complexity; Theoretical computer science; Computational complexity theory; Algorithm; Bayesian probability; Artificial intelligence; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.07613792616992533,"gpt":0.3068064110935668,"spread":0.2306684849236414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002445299,0.0001271881,0.0001447317,0.00004736248,0.0001609774,0.0002216119,0.0002707484,0.00006006261,0.000001162239],"category_scores_gemma":[0.00006572732,0.0001081584,0.0000206139,0.0001122653,0.0001227384,0.0003104064,0.0001708977,0.00008466155,0.000004184795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001492032,"about_ca_system_score_gemma":0.00006010779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001793592,"about_ca_topic_score_gemma":0.00008472499,"domain_scores_codex":[0.9990085,0.00001602406,0.000192776,0.0004323374,0.0001119435,0.0002383838],"domain_scores_gemma":[0.9993363,0.000107006,0.00004296468,0.0002843054,0.00007646142,0.0001529865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001808261,0.00004175581,0.0001283782,0.00002419665,0.000009122002,0.000003610553,0.0007815727,0.0001038618,0.0001906873,0.9254721,0.0001906896,0.07303589],"study_design_scores_gemma":[0.001610477,0.0002823543,0.00301314,0.00004372672,0.000005708692,0.00003181976,0.00003498625,0.3647092,0.000971842,0.6284916,0.0004875694,0.0003176317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006707348,0.000074452,0.9882188,0.003199374,0.00007409501,0.0001451826,0.00001368145,0.0001470142,0.001420016],"genre_scores_gemma":[0.6247122,0.0000234144,0.3748143,0.0003362951,0.0000210446,0.000007403776,0.000003452007,0.000003054449,0.00007880258],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6180049,"threshold_uncertainty_score":0.4410572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2810683420","doi":"10.1111/cogs.12634","title":"Facts and Possibilities: A Model‐Based Theory of Sentential Reasoning","year":2018,"lang":"en","type":"article","venue":"Cognitive Science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University College London; York University","keywords":"Defeasible reasoning; Defeasible estate; Psychology of reasoning; Non-monotonic logic; Computer science; Dual process theory (moral psychology); Process (computing); Cognitive science; Default logic; Dual (grammatical number); Inference; Belief revision; Artificial intelligence; Epistemology; Deductive reasoning; Model-based reasoning; Psychology; Knowledge representation and reasoning; Linguistics; Philosophy; Description logic; Autoepistemic logic; Multimodal logic; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03668377793801679,"gpt":0.2973556731641711,"spread":0.2606718952261543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050787,0.0001079472,0.0001221454,0.0001479478,0.0002720422,0.0001525324,0.0005805295,0.00003166608,0.000008606285],"category_scores_gemma":[0.0005726194,0.00009372841,0.00002801766,0.0005493111,0.002293786,0.0006765131,0.0002683375,0.00008482023,0.000009316676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001654662,"about_ca_system_score_gemma":0.0004624558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001300032,"about_ca_topic_score_gemma":0.000002196786,"domain_scores_codex":[0.9985919,0.00005986619,0.000161225,0.0005132792,0.0003659706,0.0003077784],"domain_scores_gemma":[0.9986258,0.0001529322,0.0000843054,0.0002624974,0.0007366575,0.0001378657],"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.000134996,0.0002099733,0.001371805,0.00006814231,0.0000211528,0.00001099175,0.02017111,0.0002658039,0.07820988,0.6384277,0.00003142343,0.261077],"study_design_scores_gemma":[0.0002236948,0.0001714553,0.001032076,0.0001546885,0.000006206617,0.000005949227,0.0004106051,0.8808054,0.06463369,0.05241497,9.307368e-7,0.0001403701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3494038,0.00003393793,0.6478059,0.0000315139,0.00007159141,0.00005651575,0.000004343984,0.00003911746,0.002553237],"genre_scores_gemma":[0.9690881,0.000002319338,0.03055561,0.0002458981,0.00002179932,0.000002532984,2.923175e-7,0.000003570484,0.00007985542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8805395,"threshold_uncertainty_score":0.8451549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4296614209","doi":"10.1002/ecm.1554","title":"Applying the structural causal model framework for observational causal inference in ecology","year":2022,"lang":"en","type":"article","venue":"Ecological Monographs","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Causal inference; Observational study; Causal model; Directed acyclic graph; Ecology; Causal structure; Econometrics; Confounding; Causality (physics); Statistical inference; Computer science; Causation; Inference; Outcome (game theory); Artificial intelligence; Statistics; Mathematics; Biology; Algorithm; Epistemology; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0967409152947531,"gpt":0.3283432374285913,"spread":0.2316023221338382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007175808,0.0002053701,0.0002612717,0.0001333727,0.0007921318,0.0001269723,0.001503376,0.0001502803,0.00006962686],"category_scores_gemma":[0.0003836893,0.0001551679,0.0001256913,0.0007459095,0.0001263742,0.0002212107,0.0007431601,0.0007962205,0.000003911261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009928145,"about_ca_system_score_gemma":0.0001847909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001780833,"about_ca_topic_score_gemma":0.0000618335,"domain_scores_codex":[0.9979133,0.000223449,0.0004093139,0.00057488,0.0002992266,0.0005798444],"domain_scores_gemma":[0.9974276,0.001856744,0.0001393096,0.0004093663,0.00007656041,0.00009036672],"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.00002138686,0.00007364601,0.02535678,0.00000391401,0.00001126986,0.000006717734,0.0002737742,0.2118377,0.00002848516,0.7583562,0.0002069154,0.003823247],"study_design_scores_gemma":[0.000141104,0.0001551183,0.03301774,0.000001918048,0.000002898131,0.000003847324,0.00004113312,0.5298862,0.000004350581,0.4364612,0.0001537204,0.00013079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2800196,0.00004899983,0.7163421,0.002079416,0.0004345398,0.000843534,0.00002781218,0.0001257362,0.00007835145],"genre_scores_gemma":[0.8791948,0.000006503915,0.1137522,0.002582739,0.00004227359,0.004373057,0.00001752565,0.00000787656,0.00002305281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6025899,"threshold_uncertainty_score":0.6327562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048817927","doi":"10.1016/j.knosys.2011.08.010","title":"Improving Tree augmented Naive Bayes for class probability estimation","year":2011,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Naive Bayes classifier; Computer science; Conditional independence; Machine learning; Bayes' theorem; Tree (set theory); Bayes error rate; Class (philosophy); Artificial intelligence; Word error rate; Decision tree; Conditional probability; Independence (probability theory); Data mining; Algorithm; Statistics; Mathematics; Bayes classifier; Bayesian probability; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.06535823506187206,"gpt":0.267616737309994,"spread":0.202258502248122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095668,0.000242504,0.0002991668,0.0001353506,0.0002121627,0.0001898323,0.0007372565,0.0001445378,0.000004715645],"category_scores_gemma":[0.0001847573,0.0002169814,0.0001262072,0.0003141604,0.00006238474,0.0003775684,0.00008089868,0.0001306775,0.00007316874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001742871,"about_ca_system_score_gemma":0.0003621707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001769379,"about_ca_topic_score_gemma":0.00006312198,"domain_scores_codex":[0.9980623,0.0001947254,0.0005021307,0.0006382895,0.0001957729,0.0004067662],"domain_scores_gemma":[0.9981712,0.0002059869,0.0002253487,0.0007515938,0.0004901562,0.0001557195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002989004,0.00232707,0.002605522,0.00492347,0.0001940355,0.00001312518,0.0106451,0.007507582,0.01162626,0.4094884,0.004654428,0.5457161],"study_design_scores_gemma":[0.0005941639,0.0002520969,0.0001915137,0.000173906,0.00001733208,0.000002960908,0.00003381417,0.9889553,0.005388292,0.003875973,0.0002461175,0.0002685713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005211824,0.0002796195,0.9885345,0.00005540874,0.001143822,0.0009572286,0.00001111337,0.0004684239,0.003338138],"genre_scores_gemma":[0.9186751,3.863844e-7,0.08050601,0.00002650936,0.00008937318,0.0004285619,0.00001121368,0.00001795635,0.0002449241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9814477,"threshold_uncertainty_score":0.8848246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1532777422","doi":"","title":"Exact Bayesian structure learning from uncertain interventions","year":2007,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"A priori and a posteriori; Bayesian probability; Computer science; Psychological intervention; Set (abstract data type); Algorithm; Machine learning; Bayesian network; Markov chain Monte Carlo; Posterior probability; Data set; Artificial intelligence; Mathematics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.03925883602500592,"gpt":0.3018201689189307,"spread":0.2625613328939248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002779042,0.0001197373,0.000116576,0.0000865953,0.0001409945,0.0001737325,0.0005820118,0.00008068363,0.0003613864],"category_scores_gemma":[0.00004340503,0.0001035782,0.00009989931,0.0002561635,0.00002410662,0.0002876021,0.000139586,0.0002931025,0.00005097638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003209919,"about_ca_system_score_gemma":0.00003157536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003730506,"about_ca_topic_score_gemma":0.0002611949,"domain_scores_codex":[0.9989132,0.00004980061,0.0002438755,0.0003306502,0.0001799965,0.0002824654],"domain_scores_gemma":[0.9993234,0.0001021584,0.00006253018,0.0003311343,0.00005446086,0.0001263482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001540741,0.0001397785,0.008907857,0.00003520703,0.0001027194,0.0001070208,0.003166476,0.007222455,0.0131052,0.3848415,0.002077795,0.5802786],"study_design_scores_gemma":[0.0007831433,0.000321237,0.02567898,0.0003227367,0.0000319634,0.0000392107,0.0005891678,0.7328411,0.01613671,0.2179032,0.004230314,0.00112217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01825443,0.00009341072,0.9760297,0.0003437559,0.0002302812,0.00004333224,0.000001436608,0.0003061344,0.004697532],"genre_scores_gemma":[0.8805912,0.000003443883,0.1182498,0.0002101852,0.00007066215,8.518446e-7,0.000007893174,0.000006189661,0.0008598571],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8623368,"threshold_uncertainty_score":0.4223795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281723409","doi":"10.1111/ele.14033","title":"Predictive models aren't for causal inference","year":2022,"lang":"en","type":"article","venue":"Ecology Letters","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Causal inference; Observational study; Inference; Causal model; Causal structure; Predictive inference; Causality (physics); Machine learning; Computer science; Econometrics; Ecology; Artificial intelligence; Frequentist inference; Bayesian inference; Mathematics; Statistics; Biology; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.02761812261061658,"gpt":0.2557518434216327,"spread":0.2281337208110161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002978372,0.0001343579,0.0001683568,0.0001100506,0.0004162005,0.00004911903,0.0009510709,0.00004696524,0.00004170406],"category_scores_gemma":[0.00003558967,0.0001472211,0.00006969624,0.000188564,0.00006642596,0.0003011555,0.0004588472,0.0002837388,0.00001357355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001339476,"about_ca_system_score_gemma":0.0001305726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001959515,"about_ca_topic_score_gemma":0.00001378517,"domain_scores_codex":[0.9986349,0.0001188925,0.0001939658,0.0004697476,0.0001728309,0.0004096768],"domain_scores_gemma":[0.9991415,0.000278756,0.00008516685,0.0003680844,0.00005029546,0.00007616272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008408936,0.0002785681,0.003513269,0.00002100876,0.0001603819,0.00007850533,0.003113357,0.6515723,0.003213444,0.2761023,0.05551964,0.006343161],"study_design_scores_gemma":[0.0004193331,0.000397604,0.001285617,0.000002498522,0.00001251362,0.00002161655,0.00003669612,0.9546672,0.0001180077,0.04187438,0.0009356916,0.0002288729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04437821,0.00001708278,0.9441547,0.00974765,0.0008541094,0.0002441119,0.00002652886,0.0001941666,0.0003834781],"genre_scores_gemma":[0.9711173,0.000002300465,0.01901352,0.009250861,0.00006350531,0.0004155336,0.0000123495,0.00001024567,0.0001144242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.926739,"threshold_uncertainty_score":0.6003502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3007289092","doi":"10.1038/s41598-020-59669-x","title":"Challenges and Opportunities with Causal Discovery Algorithms: Application to Alzheimer’s Pathophysiology","year":2020,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Sunnybrook Health Science Centre; St Joseph's Health Centre; McGill University; Jewish General Hospital","funders":"National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; Genentech; National Institute of Neurological Disorders and Stroke; IXICO; H. Lundbeck A/S; Servier; Eisai; Northern California Institute for Research and Education; Pfizer; Biogen; BioClinica; F. Hoffmann-La Roche; University of Southern California; Novartis Pharmaceuticals Corporation; U.S. Department of Defense; Eli Lilly and Company; Bristol-Myers Squibb; Alzheimer's Disease Neuroimaging Initiative; National Center for Advancing Translational Sciences; Meso Scale Diagnostics; National Institute on Aging; Alzheimer's Association; National Institutes of Health; U.S. Department of Health and Human Services; Foundation for the National Institutes of Health","keywords":"Causal inference; Computer science; Causal structure; Causal model; Alzheimer's Disease Neuroimaging Initiative; Gold standard (test); Machine learning; Neuroimaging; Observational study; Data science; Inference; Graph; Artificial intelligence; Disease; Theoretical computer science; Psychology; Alzheimer's disease; Econometrics; Medicine; Mathematics; Psychiatry","retraction":null,"screen_n_in":null,"score":{"opus":0.09869281773235718,"gpt":0.2759703795366834,"spread":0.1772775618043262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003833761,0.0001377205,0.0001701145,0.00006633754,0.0001635367,0.0003703724,0.000267651,0.0000433672,0.000001103213],"category_scores_gemma":[0.00001936481,0.0001102052,0.00002205634,0.0001880833,0.0001496643,0.0005598287,0.0002337171,0.00008420531,0.00001042444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007753754,"about_ca_system_score_gemma":0.0001357423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009460739,"about_ca_topic_score_gemma":0.000007602831,"domain_scores_codex":[0.9982029,0.00004129537,0.0002362982,0.0009934487,0.0002877868,0.0002382867],"domain_scores_gemma":[0.9988327,0.00002134672,0.0001212388,0.000646496,0.000119088,0.0002591426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001715964,0.00007187224,0.00004979649,0.00004648064,0.00005137315,0.0006371475,0.007443245,0.0005330349,0.01534205,0.06379634,0.002832565,0.9091789],"study_design_scores_gemma":[0.0008032078,0.002801246,0.004651291,0.0003326164,0.0002058432,0.001924364,0.003083725,0.336403,0.03512561,0.4930193,0.11798,0.003669712],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01588738,0.001982913,0.9698865,0.0103503,0.0007431755,0.0002571496,0.000002022578,0.0001964031,0.0006941116],"genre_scores_gemma":[0.9834908,0.0001305474,0.01522925,0.0008867363,0.00007975145,0.0000534811,0.00001103957,0.000009637509,0.0001087637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9676034,"threshold_uncertainty_score":0.4494037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037360823","doi":"10.1016/j.csda.2010.07.009","title":"Simulation smoothing for state–space models: A computational efficiency analysis","year":2010,"lang":"en","type":"article","venue":"Computational Statistics & Data Analysis","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Smoothing; State space; Cholesky decomposition; Gaussian; Kalman filter; Algorithm; Mathematics; Mathematical optimization; Applied mathematics; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.061005219233886,"gpt":0.3427019538957092,"spread":0.2816967346618232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001066783,0.0003072941,0.0005505023,0.001053285,0.0005341678,0.0007591669,0.001761551,0.0000998499,0.00004990229],"category_scores_gemma":[0.000451498,0.0003248256,0.0002397083,0.00393942,0.0001168585,0.001075743,0.0004774292,0.0003048021,0.00001631714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005202652,"about_ca_system_score_gemma":0.0003278887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003090807,"about_ca_topic_score_gemma":0.0004288976,"domain_scores_codex":[0.9965065,0.0001050513,0.0007736554,0.001228306,0.0009541873,0.0004323671],"domain_scores_gemma":[0.9942262,0.002679312,0.0004208202,0.001227112,0.00121482,0.000231797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007684851,0.00009624811,0.0005187297,0.000009949588,0.001380882,0.000002790755,0.0002525179,0.8301308,0.000003765642,0.1611065,0.0003157919,0.006174295],"study_design_scores_gemma":[0.0002165814,0.0000218683,0.002112984,0.000002654856,0.001464388,7.668444e-7,0.000005085914,0.741486,8.826487e-7,0.2542991,0.0001049074,0.0002847638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001960616,0.0000354193,0.9930875,0.0003134542,0.0001544303,0.0002141767,0.004016816,0.000171305,0.00004628696],"genre_scores_gemma":[0.4905226,0.000002053587,0.5029975,0.0001111224,0.00003127487,0.00001020817,0.006284705,0.000009577678,0.00003099742],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.49009,"threshold_uncertainty_score":0.9999204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2223868250","doi":"10.1184/r1/6605669","title":"Finding optimal Bayesian networks by dynamic programming","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bayesian network; Dynamic programming; Maxima; Exponential function; Maxima and minima; Bayesian probability; Function (biology); Dynamic Bayesian network; Directed acyclic graph; Computer science; Mathematics; Enumeration; Algorithm; Artificial intelligence; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02699603855321714,"gpt":0.2755551727978576,"spread":0.2485591342446405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007207779,0.0001550335,0.0001159862,0.00004613521,0.0002249619,0.0003063033,0.0008833191,0.0001098665,0.007483906],"category_scores_gemma":[0.0000957405,0.0001530542,0.0000531594,0.0003370778,0.00001340419,0.0003700295,0.0002799513,0.000197153,0.0008045388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003645314,"about_ca_system_score_gemma":0.00004925946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003845703,"about_ca_topic_score_gemma":0.00000435223,"domain_scores_codex":[0.9987519,0.00002975591,0.0001750059,0.0004130583,0.0001737353,0.0004565668],"domain_scores_gemma":[0.999227,0.00004625361,0.00008091873,0.000400465,0.0001074839,0.0001379076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005300396,0.0000698712,0.0000326433,0.00005204984,0.00002644757,0.00001957981,0.000534971,0.0009256813,0.0001332163,0.0006936854,0.6641332,0.3333734],"study_design_scores_gemma":[0.00008140038,0.00009538089,0.00005397723,0.0003824533,0.000001871838,0.00001021127,0.000006786853,0.9572865,0.0001896755,0.00008435696,0.04156895,0.0002384842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001842843,0.0002532853,0.9938558,0.0001593858,0.0002053035,0.0001623711,0.002607962,0.0005421557,0.002029397],"genre_scores_gemma":[0.9370771,0.000002087154,0.05487882,0.0003078607,0.0002484164,0.0001050061,0.006635552,0.00002696166,0.0007181719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9563608,"threshold_uncertainty_score":0.9999735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044665483","doi":"10.1111/j.1551-6709.2011.01182.x","title":"Bayesian Intractability Is Not an Ailment That Approximation Can Cure","year":2011,"lang":"en","type":"letter","venue":"Cognitive Science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Bayesian probability; Artificial intelligence; Bounded function; Probabilistic logic; Computation; Bayesian inference; Class (philosophy); Variety (cybernetics); Categorization; Machine learning; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0799380831230464,"gpt":0.2932410918662071,"spread":0.2133030087431607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001441699,0.0005581924,0.0004410819,0.0004102524,0.0006255471,0.0009898109,0.003581249,0.0005078795,0.0001415512],"category_scores_gemma":[0.0001884383,0.0005120369,0.0001285489,0.001033483,0.001352926,0.002195202,0.0006451047,0.001786871,0.0001326538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000234209,"about_ca_system_score_gemma":0.001187858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001763017,"about_ca_topic_score_gemma":0.00001677422,"domain_scores_codex":[0.9943899,0.0002462066,0.0004395674,0.002272843,0.001590575,0.001060894],"domain_scores_gemma":[0.9966916,0.0001496484,0.0003988642,0.001404639,0.001014734,0.0003405418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005597611,0.0008365,0.001003984,0.0005866803,0.0001090741,0.0004725586,0.03472234,0.000009614204,0.002163563,0.01182385,0.2005904,0.7476255],"study_design_scores_gemma":[0.002352769,0.002691956,0.01221215,0.002899046,0.0004270038,0.0004556595,0.001272629,0.4855975,0.2039959,0.2125365,0.06433179,0.01122716],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001188821,0.00003694318,0.862117,0.1305993,0.0009547407,0.0005895587,0.0001069889,0.0003033764,0.004103332],"genre_scores_gemma":[0.5998185,0.00002215308,0.01831187,0.380837,0.0005535631,0.00009559082,0.00006061146,0.00002953022,0.0002711605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8438051,"threshold_uncertainty_score":0.9997332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152511329","doi":"10.1109/72.846725","title":"Taking on the curse of dimensionality in joint distributions using neural networks","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Curse of dimensionality; Joint probability distribution; Artificial neural network; Computer science; Artificial intelligence; Conditional probability distribution; Random variable; Graphical model; Bayesian network; Bayesian probability; Pattern recognition (psychology); Machine learning; Mathematics; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05487977902440835,"gpt":0.2758654856001564,"spread":0.2209857065757481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003180203,0.0002331026,0.0002496282,0.00007860638,0.0003693685,0.00008611268,0.0004821256,0.0001285675,0.0001128287],"category_scores_gemma":[0.000005139334,0.0001795046,0.0001771442,0.0007729732,0.0001404464,0.0002481182,0.000005499957,0.0008669271,0.000003999648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006673615,"about_ca_system_score_gemma":0.00002710799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001865553,"about_ca_topic_score_gemma":0.00004748172,"domain_scores_codex":[0.9981108,0.0002766567,0.0004654892,0.0004235353,0.0002747253,0.0004487496],"domain_scores_gemma":[0.9988173,0.0002835273,0.0001329797,0.0006064179,0.00005943641,0.0001003578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002661135,0.0001365088,0.00001636483,0.000001921454,0.000009002389,0.000007229276,0.00004519835,0.947786,0.00006202351,0.001545217,0.00002876632,0.05033519],"study_design_scores_gemma":[0.0001898293,0.00009135625,0.0008291982,0.00008156457,0.00001332912,0.00002003427,0.000005897246,0.9979188,0.0002668209,0.0004101373,0.000007262559,0.0001657781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2454386,0.00004964763,0.7529111,0.0007888526,0.0004992821,0.0001570442,0.000009338598,0.00007230943,0.00007379764],"genre_scores_gemma":[0.9985753,0.00003351607,0.0006528257,0.0006102907,0.00007023541,0.00001781114,0.000002540929,0.00001277122,0.00002470526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7531367,"threshold_uncertainty_score":0.7319985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144414892","doi":"","title":"HOP-MAP: Efficient Message Passing with High Order Potentials","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Message passing; Inference; Computer science; Hop (telecommunications); Probabilistic logic; Maximum a posteriori estimation; A priori and a posteriori; Class (philosophy); Theoretical computer science; Representation (politics); Exponential function; Algorithm; Artificial intelligence; Distributed computing; Mathematics; Computer network; Maximum likelihood","retraction":null,"screen_n_in":null,"score":{"opus":0.05460748480378558,"gpt":0.3106988401195279,"spread":0.2560913553157423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456089,0.0002301272,0.0001930131,0.0001508986,0.0002181952,0.0008180711,0.0007185209,0.00009582109,0.0002812993],"category_scores_gemma":[0.0001825577,0.0001905365,0.00002363981,0.0001847902,0.0002541412,0.000194013,0.000133434,0.0004095552,0.0001403977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001991044,"about_ca_system_score_gemma":0.000175357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000117134,"about_ca_topic_score_gemma":0.0001781423,"domain_scores_codex":[0.9981597,0.00005819529,0.0003917781,0.0005329041,0.0005552983,0.0003021333],"domain_scores_gemma":[0.9983953,0.0002327238,0.0001537861,0.0003392127,0.0007198287,0.0001591285],"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.00002877441,0.00009188397,0.00001848606,0.000004497702,0.00001802461,0.00003286414,0.0002363079,0.00107728,0.004927258,0.852735,0.00005597567,0.1407736],"study_design_scores_gemma":[0.00005629953,0.0001962348,0.0001800096,0.00006478725,0.00001119454,0.00002798963,0.0001574461,0.710277,0.009386385,0.2790434,0.0002553879,0.0003438433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01273033,0.000006503464,0.9808627,0.002859628,0.001178117,0.0001117608,0.00007347546,0.00008984827,0.002087595],"genre_scores_gemma":[0.8261513,0.0000218906,0.1732695,0.0002665581,0.0001017762,0.00001154137,0.00001888272,0.00001031689,0.0001482479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.813421,"threshold_uncertainty_score":0.7888679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1527842677","doi":"10.1007/978-3-540-30115-8_46","title":"Naive Bayesian Classifiers for Ranking","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Naive Bayes classifier; Ranking (information retrieval); Bayesian programming; Machine learning; Computer science; Artificial intelligence; Bayes' theorem; Decision tree; Bayesian probability; Bayes error rate; Class (philosophy); Data mining; Bayes factor; Bayes classifier; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.02831859215245992,"gpt":0.261975388317121,"spread":0.2336567961646611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009391591,0.0006378227,0.0006195683,0.0007728513,0.0004253669,0.00077823,0.003828541,0.0004918513,0.0000161865],"category_scores_gemma":[0.0001018844,0.000607939,0.0002409558,0.0005089438,0.0006683567,0.0006215015,0.0007474808,0.0008874592,0.00002632641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005467042,"about_ca_system_score_gemma":0.001445875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002389539,"about_ca_topic_score_gemma":0.00003446173,"domain_scores_codex":[0.9956137,0.00002388709,0.0005955347,0.001932393,0.0008813187,0.0009531893],"domain_scores_gemma":[0.9972968,0.0004437459,0.0003051552,0.00135146,0.0003461349,0.0002567691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001091945,0.00002083471,0.000007466596,0.00006193361,0.00001525144,0.00004455696,0.0007295638,0.05176234,0.0001028008,0.3132811,0.00002449006,0.6339388],"study_design_scores_gemma":[0.0002979596,0.0001657034,0.000006639787,0.0004516965,0.000007626079,0.00002773795,1.199539e-7,0.4445766,0.0005544619,0.55298,0.0003882069,0.000543267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009885726,0.0003245267,0.9916814,0.001283517,0.002067908,0.0005506373,0.000006641818,0.0002591634,0.003816318],"genre_scores_gemma":[0.2811073,0.00003662717,0.7157973,0.002124986,0.0005458402,0.00002771878,0.000006713168,0.00005226114,0.0003012939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6333955,"threshold_uncertainty_score":0.9996372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4300129738","doi":"10.1142/6300","title":"A First Look at Rigorous Probability Theory","year":2006,"lang":"en","type":"book","venue":"WORLD SCIENTIFIC eBooks","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mathematical economics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0242865732949439,"gpt":0.2221282226411241,"spread":0.1978416493461802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002275,0.0006335835,0.0006050717,0.0005274248,0.001239905,0.001274461,0.002999979,0.0003125443,0.0001429726],"category_scores_gemma":[0.00002294071,0.0005871577,0.0003630775,0.0002644191,0.001147012,0.0001781493,0.001335712,0.0007440195,0.001216195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007952733,"about_ca_system_score_gemma":0.00107341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001328864,"about_ca_topic_score_gemma":0.005372988,"domain_scores_codex":[0.9948696,0.0001860006,0.0007447955,0.002205524,0.001114898,0.0008791816],"domain_scores_gemma":[0.9955859,0.0002834925,0.0003966682,0.003134412,0.0003065742,0.0002929098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000912567,0.00005027075,0.000008200489,0.0001259766,0.00002383476,0.00004480925,0.0003839673,0.0001095913,0.00001981991,0.5245745,0.4678656,0.006784348],"study_design_scores_gemma":[0.0001173081,0.00001960745,0.000007471771,0.0002069192,0.00002228171,0.00001424149,5.276698e-7,0.00266672,0.0001098,0.4296615,0.566676,0.0004975377],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00004500388,0.0002592182,0.1388554,0.0001214899,0.002242873,0.0005806197,0.00003859413,0.0006183671,0.8572385],"genre_scores_gemma":[0.001835487,2.624077e-7,0.008851443,0.0001955036,0.0002329211,0.00007489388,0.00005200331,0.00004923108,0.9887083],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1314698,"threshold_uncertainty_score":0.9997623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008561984","doi":"10.1093/biomet/asm056","title":"Simulation of hyper-inverse Wishart distributions in graphical models","year":2007,"lang":"en","type":"article","venue":"Biometrika","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Wishart distribution; Markov chain Monte Carlo; Graphical model; Mathematics; Inverse; Inverse-Wishart distribution; Context (archaeology); Markov chain; Algorithm; Gibbs sampling; Applied mathematics; Monte Carlo method; Theoretical computer science; Computer science; Statistics; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.05460151362738178,"gpt":0.3021830003647726,"spread":0.2475814867373909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005644549,0.00007762564,0.0001227904,0.0007755043,0.00003512708,0.00002666257,0.0003407866,0.00008907756,0.000004981837],"category_scores_gemma":[0.0001248028,0.0000761779,0.00005277199,0.00362796,0.00005337623,0.0003193252,0.00007938467,0.00009517893,0.00001056876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000372439,"about_ca_system_score_gemma":0.00003821548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005370417,"about_ca_topic_score_gemma":0.00001881193,"domain_scores_codex":[0.999027,0.0000237993,0.0002818642,0.0002198368,0.0002290609,0.0002185026],"domain_scores_gemma":[0.9992575,0.0002059849,0.0000598568,0.0002835831,0.0001086797,0.0000844052],"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.00005982667,0.001040558,0.01404899,0.00005696499,0.00003316374,0.00003482133,0.0007505364,0.214769,0.01339071,0.5440085,0.0003750964,0.2114318],"study_design_scores_gemma":[0.0002099595,0.00004631519,0.00486443,0.00001648184,0.000002316698,0.000001190332,0.000007911675,0.9726762,0.001787491,0.0200853,0.0002010001,0.0001014653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1515779,0.00006623103,0.8477098,0.00009682145,0.00008945058,0.00005450418,0.000008578129,0.0000482144,0.0003484478],"genre_scores_gemma":[0.9793296,0.0000083672,0.0205849,0.00003459538,0.00001694519,0.00000153865,0.000007347224,0.000003076173,0.0000135844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8277517,"threshold_uncertainty_score":0.3106444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998889600","doi":"10.1016/s0010-0277(00)00082-2","title":"The task-specific nature of domain-general reasoning","year":2000,"lang":"en","type":"article","venue":"Cognition","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Inference; Interpretation (philosophy); Statement (logic); Task (project management); Psychology; Relation (database); Domain specificity; Cognitive psychology; Representation (politics); Cognition; Artificial intelligence; Epistemology; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01122342580078115,"gpt":0.2383466538938178,"spread":0.2271232280930366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001767582,0.00006084775,0.00005835299,0.00001866421,0.0001660541,0.00008720825,0.0003090917,0.00006842655,0.00003064432],"category_scores_gemma":[0.000008953314,0.00004472259,0.00003454557,0.0001669532,0.00004571335,0.0001421569,0.00002520745,0.0001684217,0.00005391206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008195297,"about_ca_system_score_gemma":0.00001804796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001400496,"about_ca_topic_score_gemma":0.000001228069,"domain_scores_codex":[0.9993924,0.00004584921,0.0001201125,0.0001576342,0.0001498701,0.0001340801],"domain_scores_gemma":[0.9995899,0.00003629512,0.00003965427,0.0002303719,0.00007218991,0.00003154873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002668345,0.00004479415,0.00002847994,0.000007189917,0.00001431746,0.000007032362,0.0004880521,0.0001118756,0.006854208,0.288031,0.004990522,0.6993959],"study_design_scores_gemma":[0.001403394,0.0003165939,0.006518517,0.0004100815,0.00002767651,0.0001287285,0.0001402596,0.1363209,0.05432877,0.6525591,0.1470021,0.0008438179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2630435,0.001897188,0.6905994,0.001028316,0.0004556183,0.0001283328,0.000006230522,0.0001610307,0.04268038],"genre_scores_gemma":[0.9836858,0.0002388595,0.01545655,0.0001845596,0.00009062737,0.000006195588,0.000005980471,0.000003731114,0.0003277217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7206423,"threshold_uncertainty_score":0.1823734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086322738","doi":"10.1007/bf02294842","title":"Maximum Likelihood Estimation of Nonlinear Structural Equation Models","year":2002,"lang":"en","type":"article","venue":"Psychometrika","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Expectation–maximization algorithm; Structural equation modeling; Computation; Mathematics; Maximum likelihood; Applied mathematics; Restricted maximum likelihood; Nonlinear system; Simple (philosophy); Maximization; Estimation theory; Latent variable; Maximum likelihood sequence estimation; Algorithm; Mathematical optimization; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06428106688192711,"gpt":0.2801914475930748,"spread":0.2159103807111477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001945514,0.0001182454,0.0001541276,0.0003466805,0.00005831786,0.00007879885,0.0005190222,0.00007221867,0.00006074832],"category_scores_gemma":[0.00007794662,0.0001113505,0.00005938324,0.001212375,0.00002544344,0.0006577455,0.0000501369,0.0001139987,0.00006925419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002221059,"about_ca_system_score_gemma":0.00001297318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002040199,"about_ca_topic_score_gemma":8.493564e-7,"domain_scores_codex":[0.9987968,0.00003330867,0.0003075026,0.0002887687,0.0003548626,0.0002187399],"domain_scores_gemma":[0.9991199,0.00008203471,0.0001346637,0.0004538878,0.0001270357,0.00008250641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005109211,0.00009014023,0.0001480817,0.00002612288,0.00001668658,9.111276e-7,0.0009347309,0.02451607,0.0003010218,0.02005881,0.0003811889,0.9535211],"study_design_scores_gemma":[0.0002232088,0.00007324369,0.0003118767,0.00001632243,0.000003970959,0.000003919272,0.000004436982,0.8901973,0.0005856982,0.1084462,0.00002142251,0.0001123525],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04048795,0.0003787736,0.9565187,0.0003419785,0.0003162751,0.00008841792,0.000004383336,0.0001107753,0.001752737],"genre_scores_gemma":[0.7590486,0.00003871253,0.2407636,0.00006708113,0.00003434129,0.000003889885,0.000003608704,0.000005949821,0.00003418423],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9534088,"threshold_uncertainty_score":0.454074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949437261","doi":"","title":"Context-Specific Independence in Bayesian Networks","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bayesian network; Conditional independence; Computer science; Independence (probability theory); Inference; Representation (politics); Context (archaeology); Theoretical computer science; Artificial intelligence; Node (physics); Conditional probability; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07534082173510322,"gpt":0.1872408082316576,"spread":0.1118999864965544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003637554,0.0004199104,0.0004496578,0.0003376482,0.0001196793,0.0003295972,0.003090119,0.0006633621,0.00007178243],"category_scores_gemma":[0.00001685594,0.000493078,0.0001649419,0.0007182814,0.0001361776,0.000603253,0.002054804,0.001651938,0.0001848117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002205116,"about_ca_system_score_gemma":0.0002789446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007796329,"about_ca_topic_score_gemma":0.0002251771,"domain_scores_codex":[0.9971865,0.0002077398,0.0003339221,0.001532006,0.0001357772,0.0006040058],"domain_scores_gemma":[0.9976321,0.0001073829,0.0002313571,0.001557191,0.0002161054,0.0002557883],"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.00001192925,0.00008049267,0.002281527,0.00002486636,0.00002303294,0.0003656658,0.0002235162,0.4345514,0.000006264333,0.5522088,0.0006348127,0.00958774],"study_design_scores_gemma":[0.0002884688,0.00002678849,0.0009607626,0.000176682,0.000007307396,0.00000523202,0.00004565826,0.8904477,0.00001271837,0.1073095,0.0002137433,0.0005054403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04182358,0.000433043,0.9540632,0.000150417,0.0007080758,0.0002893027,0.000003094015,0.0002571305,0.002272122],"genre_scores_gemma":[0.996367,0.0006749573,0.001794768,0.0002276196,0.00008466724,0.000002989802,0.000007366384,0.00002079782,0.0008197795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9545435,"threshold_uncertainty_score":0.9997521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W209492218","doi":"","title":"Hidden naive Bayes","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Naive Bayes classifier; Bayesian programming; Artificial intelligence; Bayesian network; Machine learning; Computer science; Conditional independence; Bayes' theorem; Bayesian probability; Estimator; Bayes error rate; Pattern recognition (psychology); Algorithm; Data mining; Mathematics; Bayes factor; Bayes classifier; Statistics; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.1332457761803776,"gpt":0.3481089768628088,"spread":0.2148632006824312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005105722,0.0002257719,0.0001837818,0.0002171076,0.0002315678,0.0004001784,0.00123113,0.0001234514,0.0004247722],"category_scores_gemma":[0.0002785027,0.0002182316,0.00008259813,0.0004505684,0.0001160157,0.0006452909,0.0001372354,0.0003349476,0.003147845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001281393,"about_ca_system_score_gemma":0.0003935029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001930996,"about_ca_topic_score_gemma":0.00003817644,"domain_scores_codex":[0.9975525,0.00008389781,0.0004623935,0.0006148189,0.0009177798,0.0003685869],"domain_scores_gemma":[0.9983137,0.0002080462,0.0001248044,0.0003542783,0.000833093,0.0001661394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007979001,0.0000760165,0.000003979003,0.000001490445,0.000005357285,0.00000179401,0.0001984478,0.0008738412,0.0007008198,0.6893758,0.0003481296,0.3084063],"study_design_scores_gemma":[0.00002005938,0.0000918946,0.00008714061,0.00003109207,0.000002126517,0.000006797943,0.0000466778,0.4772179,0.02894075,0.4922667,0.00102187,0.0002669569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002207579,0.00003933614,0.9378863,0.01196043,0.000301369,0.0001337771,0.000009955771,0.0002652136,0.04719605],"genre_scores_gemma":[0.9603268,0.0000283172,0.03703853,0.001800926,0.0003225366,0.00002802164,0.000006123391,0.000009622076,0.0004391147],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9581192,"threshold_uncertainty_score":0.9976283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W108116539","doi":"10.1080/10691898.2004.11910734","title":"The Counter-intuitive Non-informative Prior for the Bernoulli Family","year":2004,"lang":"en","type":"article","venue":"Journal of Statistics Education","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prior probability; Bayesian probability; Bernoulli's principle; Heuristic; Computer science; Simple (philosophy); Artificial intelligence; Mathematics; Machine learning; Econometrics; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.01573206867192304,"gpt":0.2933123331480379,"spread":0.2775802644761148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874982,0.00007901337,0.00009190056,0.00003852803,0.0003191978,0.0002945026,0.0005851199,0.00002597061,8.214311e-7],"category_scores_gemma":[0.0001990723,0.00004345137,0.00004308646,0.0001053033,0.00006639852,0.0003359413,0.00002889821,0.0001757695,0.000007841096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000129802,"about_ca_system_score_gemma":0.001307044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000254819,"about_ca_topic_score_gemma":0.000007667182,"domain_scores_codex":[0.9991605,0.00001947134,0.0003588469,0.00006724214,0.0002535429,0.0001404194],"domain_scores_gemma":[0.9976677,0.0006197149,0.000449022,0.0001733349,0.001035028,0.00005515105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003443774,0.0001099363,0.00001545079,0.00001925019,0.00006394805,9.630368e-7,0.01424443,0.001660359,0.0000846679,0.557843,0.01479774,0.4111258],"study_design_scores_gemma":[0.00140934,0.001293766,0.01186814,0.0003680129,0.0001268699,0.0001640892,0.009624278,0.1326569,0.001041483,0.8146361,0.02642087,0.0003901781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001871106,0.0002330518,0.9931234,0.002966285,0.001413759,0.0001674829,0.00001908847,0.000005093292,0.0002007508],"genre_scores_gemma":[0.7606381,0.0003946029,0.237708,0.0008096168,0.0002796547,0.00002113496,0.000002456845,0.000006462266,0.0001399377],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7587669,"threshold_uncertainty_score":0.2839895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949784712","doi":"10.48550/arxiv.1906.04477","title":"Causal Discovery with Reinforcement Learning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Reinforcement; Computer science; Cognitive science; Psychology; Artificial intelligence; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.05887176603568913,"gpt":0.1842319754472586,"spread":0.1253602094115694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001875922,0.0003345591,0.0003157435,0.0001661771,0.000142276,0.0003338496,0.00147095,0.0002191383,0.00001536828],"category_scores_gemma":[0.0000118961,0.0003263781,0.0001199564,0.0003266186,0.00007527115,0.00070095,0.001719844,0.0009324851,0.0001562379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001734911,"about_ca_system_score_gemma":0.0003970638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002023338,"about_ca_topic_score_gemma":0.00001741649,"domain_scores_codex":[0.9981109,0.00009610541,0.000169576,0.001077095,0.0001437614,0.0004025425],"domain_scores_gemma":[0.9983106,0.00006006262,0.0002327085,0.001131308,0.0001303361,0.000135013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002231316,0.00001920711,0.001554521,0.0000443352,0.00005398342,0.0001173381,0.000131957,0.8454975,0.00001157056,0.1522834,0.00007192886,0.0001919748],"study_design_scores_gemma":[0.0003518933,0.0001768312,0.0002855003,0.0002053438,0.00004458534,0.00000643311,0.0000485754,0.9908364,0.00008544921,0.007147679,0.00028139,0.0005298827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08962592,0.00002778623,0.9031602,0.00006177197,0.0003338647,0.0001839463,0.000001698298,0.0002462313,0.006358566],"genre_scores_gemma":[0.9857723,0.00009746067,0.001412871,0.00009301594,0.00004950579,8.910727e-7,0.00001692203,0.00001843936,0.01253861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9017473,"threshold_uncertainty_score":0.9999188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128290618","doi":"10.1111/j.1467-9868.2010.00750.x","title":"Default Priors for Bayesian and Frequentist Inference","year":2010,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series B (Statistical Methodology)","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Frequentist inference; Prior probability; Bayes factor; Bayes' theorem; Inference; Bayesian probability; Nuisance parameter; Bayesian inference; Mathematics; Econometrics; Statistics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0443617208273577,"gpt":0.3359364916562197,"spread":0.291574770828862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002549373,0.0002757933,0.0005946829,0.00003077869,0.0004249508,0.0002659848,0.001110126,0.0002770056,0.00009240813],"category_scores_gemma":[0.009620714,0.0001850298,0.0002149376,0.0001822679,0.001137349,0.0002556998,0.0003477635,0.001181037,0.000003053171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004170166,"about_ca_system_score_gemma":0.0002898773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005270215,"about_ca_topic_score_gemma":0.00003742603,"domain_scores_codex":[0.9972675,0.0005521913,0.0008053691,0.0003970597,0.0004433655,0.0005345063],"domain_scores_gemma":[0.9907027,0.007642239,0.0004134008,0.0003990818,0.0004340308,0.000408473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007407229,0.00006367387,0.0004568048,0.0000735371,0.00008886433,0.00001527207,0.0003981311,0.00007727099,0.001303535,0.93788,0.004078139,0.05549072],"study_design_scores_gemma":[0.0007731372,0.0007118321,0.01505476,0.00004673395,0.0001607307,0.0002720728,0.000110098,0.1336883,0.0006265633,0.8440624,0.004078047,0.000415317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002458057,0.00006669248,0.9920465,0.003489126,0.00145751,0.0001947427,0.0001445069,0.00003510398,0.000107736],"genre_scores_gemma":[0.1767496,0.00001743726,0.822301,0.0006230263,0.0001708016,0.00000974395,0.000002304224,0.00001561333,0.0001104296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1742916,"threshold_uncertainty_score":0.9987217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2211621381","doi":"10.5555/777092.777121","title":"Structural extension to logistic regression: discriminative parameter learning of belief net classifiers","year":2002,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Discriminative model; Artificial intelligence; Machine learning; Computer science; Graphical model; Logistic regression; Bayesian network; Extension (predicate logic); Task (project management); Class (philosophy); Probabilistic logic; Pattern recognition (psychology); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1150173072430006,"gpt":0.3076205414504122,"spread":0.1926032342074116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000127535,0.0001383755,0.000188347,0.00008502614,0.0001090721,0.00006085827,0.0004402184,0.00006128326,0.00009209869],"category_scores_gemma":[0.0002745889,0.00009509982,0.00005060864,0.0002572356,0.00007067857,0.0002154097,0.0002119396,0.0001967973,0.00002617345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002099806,"about_ca_system_score_gemma":0.00001093647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002860256,"about_ca_topic_score_gemma":0.000002271864,"domain_scores_codex":[0.9988006,0.00009585069,0.0002235903,0.0003839665,0.0002526471,0.0002433032],"domain_scores_gemma":[0.9991207,0.0001822613,0.00008487099,0.0003609904,0.000119681,0.000131471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002973016,0.00009642156,0.001075813,0.00004747992,0.00003291108,0.00005196418,0.007004716,0.007861685,0.004952508,0.3051594,0.01036651,0.6633208],"study_design_scores_gemma":[0.0001450041,0.0003434488,0.002759156,0.00009292784,0.00000706673,0.00001419323,0.0001460327,0.9767371,0.001613021,0.01778283,0.0001327059,0.000226509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0812172,0.00006273557,0.9145498,0.001147169,0.000203014,0.00007967546,5.631539e-7,0.0001061548,0.002633685],"genre_scores_gemma":[0.9123863,0.00000851732,0.08576518,0.0002691566,0.00002027156,0.00000357133,6.698129e-7,0.000005362342,0.001540985],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9688754,"threshold_uncertainty_score":0.3878058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}