{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":35,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":35,"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":"5648e54e999c","filters":{"venue":"Uncertainty in Artificial Intelligence"}},"results":[{"id":"W9932698","doi":"10.48550/arxiv.1205.2619","title":"Regret-based Reward Elicitation for Markov Decision Processes","year":2012,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":61,"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":"Regret; Markov decision process; Computer science; Preference elicitation; Function (biology); Minimax; Preference; Markov process; Markov chain; Mathematical optimization; Machine learning; Mathematics; Economics; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.06076316977610513,"gpt":0.3316740532104062,"spread":0.2709108834343011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001253235,0.0002091232,0.0002104733,0.0002943731,0.0001690765,0.0001853213,0.000864263,0.0001195639,0.00002927518],"category_scores_gemma":[0.00340313,0.0001980682,0.00007388119,0.001069128,0.00008641126,0.0006849042,0.00009730591,0.0001855271,0.0001174913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001913796,"about_ca_system_score_gemma":0.000198879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006058887,"about_ca_topic_score_gemma":0.00008485498,"domain_scores_codex":[0.9977805,0.00007609058,0.0006583534,0.0003969138,0.0004505945,0.0006375163],"domain_scores_gemma":[0.9971154,0.001666937,0.0002077292,0.0005200125,0.0003607238,0.0001292467],"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.00008674122,0.0000885804,0.0009281563,0.00006248597,0.000004225817,0.000001190737,0.001179174,0.7760761,0.000173311,0.03872203,0.0001767744,0.1825013],"study_design_scores_gemma":[0.00006960314,0.0001709705,0.0001921221,0.0001483679,0.000005887343,0.000001682434,0.0002495141,0.9661885,0.01221098,0.01719148,0.003266823,0.0003040811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006224458,0.0001005677,0.9910662,0.0006289717,0.0008009584,0.0005801766,0.000002140948,0.0001426596,0.0004539385],"genre_scores_gemma":[0.8359503,0.00001535571,0.1633287,0.0003666744,0.0001428577,0.0001002042,0.00001274772,0.00001530113,0.00006795394],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8297258,"threshold_uncertainty_score":0.8076988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161202741","doi":"10.5555/1036843.1036873","title":"From fields to trees","year":2004,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":45,"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":"Gibbs sampling; Markov chain Monte Carlo; Graphical model; Tree (set theory); Sampling (signal processing); Computer science; Focus (optics); Markov chain; Importance sampling; Posterior probability; Algorithm; Mathematics; Belief propagation; Statistics; Artificial intelligence; Bayesian probability; Monte Carlo method; Machine learning; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04739542792282484,"gpt":0.3219355585509258,"spread":0.274540130628101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003711313,0.000169811,0.0002111195,0.0001676101,0.00007009054,0.0001490622,0.001040973,0.0001130507,0.00005402944],"category_scores_gemma":[0.0001811629,0.0001578594,0.00007128077,0.0007039856,0.00004564588,0.0002187374,0.0001885216,0.0002235041,0.000271456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001064953,"about_ca_system_score_gemma":0.00009454368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00386142,"about_ca_topic_score_gemma":0.004089796,"domain_scores_codex":[0.9983639,0.00007507892,0.0004008053,0.000549086,0.000228434,0.0003827247],"domain_scores_gemma":[0.9989518,0.0001666429,0.00004645329,0.0006154267,0.0000581011,0.0001616033],"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.00001413436,0.00007165864,0.000009125511,0.00000127059,0.000003570915,0.00002990977,0.004499635,0.04243318,0.00106382,0.4923437,0.0000597021,0.4594703],"study_design_scores_gemma":[0.00003134611,0.00008257264,0.00006229851,0.00004536811,0.000001837327,0.000001910433,0.0001271646,0.03047827,0.03197251,0.9363816,0.0005910659,0.0002240598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02321407,0.00005140634,0.9681598,0.006199467,0.0006125178,0.0001895092,0.000004203862,0.00009956339,0.001469438],"genre_scores_gemma":[0.6835588,0.000007744668,0.3148934,0.001315478,0.000155495,0.00001905499,0.000001439722,0.000005988549,0.00004262269],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6603447,"threshold_uncertainty_score":0.6437319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964434332","doi":"","title":"Low Frequency Adversarial Perturbation","year":2018,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Adversarial system; Computer science; Black box; Image (mathematics); Perturbation (astronomy); Cloud computing; Frequency domain; Transformation (genetics); Artificial intelligence; Theoretical computer science; Computer vision; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02908829838875739,"gpt":0.2972562858240615,"spread":0.2681679874353041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001015607,0.0002474895,0.0002405737,0.0003041457,0.0002718824,0.0002005327,0.001431401,0.000162135,0.0002968848],"category_scores_gemma":[0.001162215,0.0002488481,0.00008517656,0.001200056,0.0003214541,0.0007760671,0.0002977522,0.0004318923,0.0007066485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002599062,"about_ca_system_score_gemma":0.000177719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005546663,"about_ca_topic_score_gemma":0.0007088163,"domain_scores_codex":[0.997353,0.0002834119,0.0006283156,0.0007131933,0.000455295,0.0005668411],"domain_scores_gemma":[0.9984267,0.0003210186,0.0001744377,0.0007079316,0.0002551172,0.0001148269],"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.00003891847,0.0001231429,0.0002721839,0.000008710063,0.000009010066,0.0000303982,0.003998017,0.06203754,0.001701545,0.7074978,0.00008341512,0.2241994],"study_design_scores_gemma":[0.0000572698,0.0001647016,0.0001529857,0.00004770514,0.000003352058,0.000005911546,0.000256718,0.7077595,0.008261301,0.2825394,0.0004380918,0.0003130693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01452699,0.00001937539,0.9744436,0.001626645,0.002427648,0.0002599838,0.000001663358,0.0002458033,0.006448349],"genre_scores_gemma":[0.9653844,0.000006135111,0.03312543,0.0004588249,0.0008611937,0.00001923331,0.000005335107,0.00001586676,0.0001236403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9508573,"threshold_uncertainty_score":0.9999964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401533533","doi":"","title":"Off-policy TD(λ) with a true online equivalence","year":2014,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Online algorithm; Computer science; Equivalence (formal languages); Generalization; TRACE (psycholinguistics); Function approximation; Online learning; Algorithm; Function (biology); Artificial intelligence; Machine learning; Mathematics; Discrete mathematics; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.02643517356787296,"gpt":0.2660537146128079,"spread":0.2396185410449349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005592987,0.0003249999,0.000439426,0.0002745884,0.00007780109,0.00007958747,0.0004951005,0.0001430516,0.0001157715],"category_scores_gemma":[0.0005786722,0.0002861566,0.0000866989,0.0008476314,0.0002281156,0.0001745219,0.00003878966,0.0003647058,0.0001588082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000273774,"about_ca_system_score_gemma":0.00009328112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001136421,"about_ca_topic_score_gemma":0.006401729,"domain_scores_codex":[0.9977524,0.0001168548,0.00069867,0.0004227607,0.0003592191,0.0006500593],"domain_scores_gemma":[0.9985019,0.0005803598,0.00006814468,0.0005782662,0.0001126393,0.000158692],"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.0001137933,0.00009877271,0.0003503045,0.00006802733,0.0000185748,0.000008336516,0.0009478783,0.7441798,0.0009388151,0.02680293,0.0000265217,0.2264463],"study_design_scores_gemma":[0.0001330741,0.0002448216,0.0002885131,0.0002134596,0.00001176215,0.000009164648,0.0012673,0.9702102,0.002361227,0.0192314,0.005526056,0.0005030473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6503232,0.0007501958,0.3320099,0.001934343,0.001059182,0.001176939,0.00007149895,0.0009840634,0.01169075],"genre_scores_gemma":[0.9985037,0.00006619768,0.0005251087,0.0002158398,0.0005030897,0.00006536404,0.00001217414,0.00003852354,0.00007003554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3481805,"threshold_uncertainty_score":0.9999591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2772489041","doi":"","title":"Triply Stochastic Gradients on Multiple Kernel Learning.","year":2017,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Kernel (algebra); Artificial intelligence; Multiple kernel learning; Kernel method; Mathematics; Support vector machine; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04788244141461452,"gpt":0.3144047320931431,"spread":0.2665222906785286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007584347,0.0002498624,0.0002669772,0.0002212577,0.0008120633,0.000564246,0.00209544,0.0001051454,0.0000421059],"category_scores_gemma":[0.004200893,0.0002342556,0.0001027964,0.0002219857,0.0001810728,0.0003183968,0.0003330373,0.0005637891,0.0007578512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001066908,"about_ca_system_score_gemma":0.00006071182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001682583,"about_ca_topic_score_gemma":0.0006681231,"domain_scores_codex":[0.9977193,0.0001574499,0.0004444577,0.0006914313,0.0004054344,0.0005819205],"domain_scores_gemma":[0.9978189,0.0005430345,0.0002665667,0.001128837,0.00008509016,0.0001575067],"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.00008479977,0.0002464607,0.002166098,0.00000736127,0.000008590189,0.00004672413,0.001533498,0.4871734,0.00008317592,0.06223872,0.00008590029,0.4463252],"study_design_scores_gemma":[0.0001096438,0.0002584267,0.004111047,0.00008378758,0.000002832181,0.000004211956,0.000117138,0.9688435,0.0006018665,0.02433125,0.001224754,0.0003115067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.313288,0.0000437225,0.6747015,0.003222541,0.002171392,0.0004519832,0.000003653305,0.0003804419,0.005736765],"genre_scores_gemma":[0.997956,0.000007169107,0.0008548251,0.0001860425,0.0001386948,0.00002586033,0.000003271762,0.00001499962,0.0008131372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.684668,"threshold_uncertainty_score":0.9740896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914852071","doi":"","title":"Subsampled Stochastic Variance-Reduced Gradient Langevin Dynamics.","year":2018,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Langevin dynamics; Variance (accounting); Dynamics (music); Statistical physics; Computer science; Stochastic process; Langevin equation; Stochastic dynamics; Physics; Mathematics; Statistics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1252566851254776,"gpt":0.383399165742813,"spread":0.2581424806173354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001465293,0.0003071698,0.0004529459,0.0002423518,0.0001547085,0.00007112797,0.0004728461,0.0001627126,0.000290226],"category_scores_gemma":[0.00251956,0.0002857106,0.0001325083,0.0006581341,0.000340625,0.0000867014,0.0001158402,0.0003149295,0.00001302875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003867563,"about_ca_system_score_gemma":0.000100233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007018461,"about_ca_topic_score_gemma":0.01348036,"domain_scores_codex":[0.9973873,0.0002655238,0.0007980117,0.0005626307,0.0003285965,0.0006579158],"domain_scores_gemma":[0.9977675,0.0009756714,0.0001912759,0.0006378238,0.0002608886,0.0001668105],"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.0002565663,0.0003770454,0.00004341037,0.00005642726,0.00003631986,0.00002762399,0.004303928,0.001401106,0.002373961,0.8891155,0.0005932194,0.1014149],"study_design_scores_gemma":[0.0001310617,0.000337907,0.00002945807,0.0002250703,0.00004393828,0.00001642609,0.003607488,0.4660279,0.00681784,0.5214804,0.0006013348,0.0006811678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2574434,0.00005102042,0.7313279,0.0007036653,0.001657262,0.0007727726,0.00004378957,0.0001824286,0.007817753],"genre_scores_gemma":[0.980408,0.000008757187,0.01827936,0.0001632054,0.000511751,0.00007773328,0.00001693542,0.00004237735,0.0004919467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7229645,"threshold_uncertainty_score":0.9999595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398850217","doi":"","title":"Off-policy learning based on weighted importance sampling with linear computational complexity","year":2015,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Component (thermodynamics); Computational complexity theory; Computer science; Sampling (signal processing); Measure (data warehouse); Stochastic gradient descent; Importance sampling; Algorithm; Function (biology); Mathematical optimization; Artificial intelligence; Mathematics; Machine learning; Data mining; Artificial neural network; Statistics; Monte Carlo method","retraction":null,"screen_n_in":null,"score":{"opus":0.09631687283916708,"gpt":0.3443424134911935,"spread":0.2480255406520264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009793651,0.0002772136,0.00029904,0.0003877211,0.0002284174,0.0001766961,0.0007577104,0.00008302501,0.00003403316],"category_scores_gemma":[0.000579313,0.0002406302,0.0000614802,0.001429596,0.0002140437,0.0002070034,0.0001078717,0.000715045,0.0001335582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002462965,"about_ca_system_score_gemma":0.0005434809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008314554,"about_ca_topic_score_gemma":0.0002953709,"domain_scores_codex":[0.9973401,0.00025819,0.0005341959,0.000659847,0.0006976792,0.0005100168],"domain_scores_gemma":[0.9983453,0.0004829309,0.000213377,0.00042604,0.0002949243,0.0002373943],"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.00008046426,0.0001284483,0.001997954,0.000005992463,0.000004750284,0.00002566432,0.000670577,0.8587947,0.000005049031,0.08123843,0.00001486686,0.05703305],"study_design_scores_gemma":[0.0001276778,0.0003734022,0.0004008528,0.00007288471,0.000002054605,0.000007615158,0.0001707732,0.9410805,0.000145514,0.05623412,0.001090161,0.0002944139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03107515,0.0000260963,0.9631496,0.0035784,0.0001839313,0.0002105229,0.000004229126,0.0002870912,0.001484941],"genre_scores_gemma":[0.8723392,0.000002094098,0.1265895,0.0007171653,0.0002279944,0.00001607992,0.00003545838,0.00001792476,0.0000545711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8412641,"threshold_uncertainty_score":0.9812614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090054376","doi":"","title":"Amortized Bayesian Optimization over Discrete Spaces","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"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":"Bayesian probability; Amortized analysis; Computer science; Bayesian optimization; Mathematical optimization; Mathematics; Artificial intelligence; Data structure; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02776626218202575,"gpt":0.2920423037285984,"spread":0.2642760415465726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003034186,0.0001943059,0.0002303015,0.000110523,0.0001179667,0.0003164304,0.0008130986,0.00007373893,0.0002522426],"category_scores_gemma":[0.0004021464,0.0001795503,0.00007818028,0.0009669163,0.00008058999,0.0003573909,0.0001904185,0.0003229004,0.0001002019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004473312,"about_ca_system_score_gemma":0.00006111203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005067816,"about_ca_topic_score_gemma":0.00009083973,"domain_scores_codex":[0.9981437,0.0001475103,0.0004555627,0.0005607036,0.0003237062,0.0003687723],"domain_scores_gemma":[0.9991722,0.0001340232,0.000128239,0.0003303949,0.00005660291,0.0001785028],"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.00002424171,0.0000297421,0.0003360182,0.000008437491,0.000004982558,0.00002306151,0.001996162,0.8936639,0.0001507439,0.03905076,0.00006298078,0.064649],"study_design_scores_gemma":[0.00004471852,0.00008781779,0.00005650364,0.00002262436,0.000002711671,0.000001601751,0.000179356,0.9904122,0.001121608,0.007231042,0.0006107681,0.000229077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003272895,0.00004377132,0.9863282,0.008486524,0.0002954354,0.0001814205,0.000002520362,0.0002365656,0.001152674],"genre_scores_gemma":[0.9449714,0.00002204999,0.0536009,0.001108238,0.0002087283,0.0000137725,0.000008223096,0.00001320357,0.00005343993],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9416986,"threshold_uncertainty_score":0.7321849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963001956","doi":"","title":"Bayesian hyperparameter optimization for ensemble learning","year":2016,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université Laval","funders":"","keywords":"Hyperparameter; Bayesian optimization; Hyperparameter optimization; Ensemble learning; Computer science; Machine learning; Artificial intelligence; Bayesian probability; Greedy algorithm; Mathematical optimization; Algorithm; Mathematics; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.04312508995708945,"gpt":0.3025274425148194,"spread":0.25940235255773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736309,0.0001385494,0.0001492962,0.000184331,0.0001435891,0.0001418064,0.0005610277,0.00008348846,0.00006396297],"category_scores_gemma":[0.001197391,0.0001049486,0.00005776909,0.0003921206,0.00005867349,0.0004162545,0.00007902731,0.0001317004,0.00009084018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009071382,"about_ca_system_score_gemma":0.00005508749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000742128,"about_ca_topic_score_gemma":0.00008187888,"domain_scores_codex":[0.998457,0.0001357934,0.0003997241,0.00049771,0.0001744571,0.0003353251],"domain_scores_gemma":[0.9986182,0.0006568957,0.0001248574,0.0004133609,0.0001156521,0.00007101425],"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.0000264381,0.00003049467,0.0002498674,0.000006041061,0.00000282399,0.000001439714,0.0002337047,0.2725374,0.002002007,0.1032444,0.00004494543,0.6216205],"study_design_scores_gemma":[0.00004869244,0.0001011224,0.00003236564,0.00004067062,0.000002249505,0.000002341057,0.00006266275,0.9628856,0.005584687,0.02804222,0.003022044,0.000175375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001517107,0.00001990825,0.9939186,0.003306372,0.00025005,0.0002410195,0.000002744639,0.0001564584,0.0005877714],"genre_scores_gemma":[0.9030059,0.0000288614,0.09637958,0.0001336735,0.0000754529,0.00006668342,0.00001297744,0.00001120396,0.0002856666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9014888,"threshold_uncertainty_score":0.4279679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2809487708","doi":"","title":"Comparing Direct and Indirect Temporal-Difference Methods for Estimating the Variance of the Return","year":2018,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Variance (accounting); Temporal difference learning; Computer science; Reinforcement learning; Mean squared error; Lookup table; Function (biology); Algorithm; Artificial intelligence; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1008153029018901,"gpt":0.3667202816540406,"spread":0.2659049787521505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327298,0.0001803729,0.0002955048,0.00007973375,0.000375523,0.0001737847,0.001512429,0.00007041315,0.000005240654],"category_scores_gemma":[0.002208543,0.0001133936,0.00006906054,0.0007697128,0.0005769173,0.0001506027,0.0004718563,0.0002580807,0.000002951745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006066305,"about_ca_system_score_gemma":0.0000908607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003270555,"about_ca_topic_score_gemma":0.0002366487,"domain_scores_codex":[0.9979954,0.0003747098,0.0006335867,0.0004044402,0.0002353231,0.0003565166],"domain_scores_gemma":[0.9968705,0.001780294,0.0003762969,0.0007312485,0.0001980754,0.00004361862],"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.00004864595,0.00004294043,0.007104582,0.00006798737,0.00003092308,6.8925e-7,0.01040407,0.6588489,0.005068832,0.06448582,0.00003421429,0.2538624],"study_design_scores_gemma":[0.00002821581,0.00008760605,0.001136529,0.0001379379,0.000007399344,0.000002642892,0.0001373099,0.949399,0.02662312,0.02214844,0.0001566957,0.0001350854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01684576,0.00005651842,0.9804161,0.0005722437,0.0008506401,0.0005190744,9.868444e-7,0.000049243,0.0006894831],"genre_scores_gemma":[0.7168425,0.000003516472,0.2828715,0.0001062759,0.0000766349,0.00002639166,4.915146e-7,0.000007020046,0.00006563711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6999968,"threshold_uncertainty_score":0.4624059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089723243","doi":"","title":"Learning Intrinsic Rewards as a Bi-Level Optimization Problem","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"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; Intrinsic motivation; Mathematical optimization; Mathematics; Psychology; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.06927971827994504,"gpt":0.2923596390382754,"spread":0.2230799207583304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005935945,0.0002674374,0.0002884361,0.0002252524,0.000192281,0.0003696927,0.001226044,0.0001369031,0.0001636265],"category_scores_gemma":[0.001416976,0.0002791107,0.00008541073,0.001751169,0.0001121979,0.0005606853,0.0004332732,0.0006762156,0.0006226582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001740083,"about_ca_system_score_gemma":0.0002269295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002613764,"about_ca_topic_score_gemma":0.00003017375,"domain_scores_codex":[0.997175,0.0002055981,0.0007975627,0.0006971014,0.0005722038,0.0005524899],"domain_scores_gemma":[0.9986991,0.0002288305,0.0002481251,0.0003980274,0.0002187252,0.0002071441],"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.00002979709,0.00002649894,0.0001391639,0.0000195082,0.000008003498,0.00002526094,0.004339095,0.8736681,0.0001548751,0.05331301,0.00003526275,0.06824138],"study_design_scores_gemma":[0.00005195508,0.0003956192,0.0000174925,0.00006140299,0.00000448466,0.000005598848,0.000560008,0.9907634,0.002118227,0.004667889,0.001034352,0.0003196142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001744108,0.00002618891,0.9894383,0.004360224,0.000252179,0.0004057195,7.745625e-7,0.0003566405,0.003415862],"genre_scores_gemma":[0.8751268,0.00006660161,0.1231025,0.00124528,0.0001542735,0.00003237151,0.00001319792,0.00002597584,0.000232998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8733827,"threshold_uncertainty_score":0.9999661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090466896","doi":"","title":"Differentially Private Small Dataset Release Using Random Projections","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; BC Cancer Agency","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1354467866766076,"gpt":0.3239428926810161,"spread":0.1884961060044085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004707265,0.0002963561,0.0003495275,0.0002430085,0.0002153202,0.0003442018,0.01617228,0.0001597317,0.00005881908],"category_scores_gemma":[0.0183676,0.0002911335,0.0000819265,0.001609472,0.0002385778,0.0005753145,0.02340988,0.0006011005,0.000140302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000169655,"about_ca_system_score_gemma":0.0001886394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009006776,"about_ca_topic_score_gemma":0.0005345999,"domain_scores_codex":[0.9970627,0.0002014297,0.0007683631,0.0009985071,0.0003514971,0.0006174685],"domain_scores_gemma":[0.9950271,0.0003144666,0.0002005838,0.004197831,0.0000857476,0.00017425],"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.001260113,0.001566503,0.001465531,0.0003247241,0.0002002477,0.0008431658,0.003634742,0.1552685,0.06187988,0.1532025,0.0409811,0.5793729],"study_design_scores_gemma":[0.00009966434,0.00006991094,0.00001616612,0.00004710016,0.000008763412,0.000007810716,0.0001020673,0.841666,0.01836335,0.1377393,0.001575691,0.0003041348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04464773,0.00005037317,0.9374645,0.01591118,0.0004257052,0.0005808421,0.0002644852,0.000592376,0.00006278605],"genre_scores_gemma":[0.7939322,0.0000720178,0.204505,0.001011152,0.0001575093,0.00005343137,0.0002380085,0.00002687409,0.000003742664],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7492845,"threshold_uncertainty_score":0.9999541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966820259","doi":"","title":"Problem-dependent Regret Bounds for Online Learning with Feedback Graphs.","year":2019,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Regret; Computer science; Online learning; Theoretical computer science; Artificial intelligence; Machine learning; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.1217124348623598,"gpt":0.4182077194194262,"spread":0.2964952845570664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003533044,0.0003269943,0.0005571393,0.0007320554,0.000245485,0.0004410867,0.001346651,0.0001624888,0.0008565547],"category_scores_gemma":[0.002725786,0.0002369631,0.0001515792,0.002128505,0.0003809971,0.0005096626,0.0002122723,0.0007616902,0.0007842815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00024371,"about_ca_system_score_gemma":0.0002429058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003497327,"about_ca_topic_score_gemma":0.003667202,"domain_scores_codex":[0.994307,0.0002655144,0.001206985,0.001205047,0.002072872,0.000942533],"domain_scores_gemma":[0.9950705,0.002590969,0.0003498766,0.0007972589,0.0009959402,0.0001954597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009571567,0.0002791105,0.003943352,0.00002259702,0.0000184324,0.00002191752,0.001105847,0.5984356,0.000788249,0.009224301,0.0001364582,0.3850669],"study_design_scores_gemma":[0.0004060458,0.001691574,0.0006654172,0.0001766679,0.0000101175,0.00002124268,0.01116151,0.4294479,0.007196718,0.529703,0.01876473,0.0007550914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6132775,0.0001960344,0.3781739,0.002120942,0.0007715348,0.003279109,0.0001052459,0.0001727112,0.001903088],"genre_scores_gemma":[0.9801668,0.00004024192,0.01287476,0.0001161941,0.0001300582,0.0001253537,0.00004234432,0.00004595546,0.00645831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5204787,"threshold_uncertainty_score":0.9999937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402930259","doi":"","title":"Intelligent affect: rational decision making for socially aligned agents","year":2015,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Affect (linguistics); Computer science; Probabilistic logic; Planner; Deception; Action (physics); Encoding (memory); Cognition; Monte Carlo tree search; Function (biology); Range (aeronautics); Artificial intelligence; Human–computer interaction; Monte Carlo method; Social psychology; Psychology; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1292949818094062,"gpt":0.4102366722908574,"spread":0.2809416904814511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003285697,0.0001701005,0.0002074662,0.0001797952,0.0005831034,0.0001533497,0.0004009673,0.0001746065,0.00036321],"category_scores_gemma":[0.00315034,0.0001808314,0.0001080022,0.0005797776,0.00031948,0.0003555228,0.00005408979,0.0001110095,0.0002121481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006682623,"about_ca_system_score_gemma":0.000922958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005297275,"about_ca_topic_score_gemma":0.01608373,"domain_scores_codex":[0.9975429,0.0004101693,0.0005847022,0.0003890973,0.0006055504,0.0004676525],"domain_scores_gemma":[0.9980585,0.0009761539,0.0001335436,0.0001749531,0.0004998751,0.0001569926],"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.000505115,0.0001614709,0.0002098145,0.000004747006,0.000008603603,0.000003669736,0.01519488,0.06460082,0.00009619294,0.8059589,0.0008631611,0.1123926],"study_design_scores_gemma":[0.00008736321,0.0001607394,0.00009574724,0.0001008158,0.00001187927,0.000001009518,0.0164275,0.0496811,0.000759943,0.9220659,0.01029822,0.0003098036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1754157,0.0002218876,0.8011575,0.003930798,0.002806247,0.002108643,0.0000352408,0.0001932827,0.01413076],"genre_scores_gemma":[0.9945097,0.0000373958,0.003864666,0.0004151308,0.0006458433,0.0001315401,0.00003282073,0.00001466258,0.0003482702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.819094,"threshold_uncertainty_score":0.8975099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089673743","doi":"","title":"C-MI-GAN : Estimation of Conditional Mutual Information using MinMax formulation","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"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":"Mutual information; Estimator; Minimax; Conditional independence; Conditional mutual information; Computer science; Mathematical optimization; Focus (optics); Independence (probability theory); Estimation; Conditional expectation; Artificial intelligence; Machine learning; Mathematics; Statistics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05566346586866754,"gpt":0.3117709213048471,"spread":0.2561074554361796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003503971,0.0001311778,0.0001742502,0.0001947705,0.00009868669,0.00008406663,0.0004541229,0.00008510979,0.00006243505],"category_scores_gemma":[0.0008939176,0.0001456632,0.00005414166,0.0007726653,0.00007029487,0.001763391,0.0001099672,0.0002110917,0.00005623342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001112705,"about_ca_system_score_gemma":0.0001318223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001891054,"about_ca_topic_score_gemma":0.00002287182,"domain_scores_codex":[0.9983968,0.00008677072,0.0007049931,0.0002132036,0.0003895588,0.0002086315],"domain_scores_gemma":[0.9990751,0.0002027846,0.0003114452,0.0001836224,0.0001561916,0.00007085166],"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.00002884673,0.00001534051,0.0001254467,0.00001775365,0.000003338211,0.000001291813,0.00337575,0.7790578,0.0004614416,0.1653845,0.000005401857,0.05152306],"study_design_scores_gemma":[0.0000501097,0.00006367276,0.0001617367,0.0000274662,0.000004041712,0.000002438871,0.0003814423,0.9501958,0.008236492,0.04068549,0.00005420975,0.0001370495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07240032,0.000005171511,0.9262177,0.0006632618,0.000181904,0.0001849083,0.000006036071,0.00006355032,0.0002771552],"genre_scores_gemma":[0.9481994,9.418727e-7,0.05144338,0.0002346985,0.00006392704,0.000005144623,0.00004651737,0.000004924129,0.000001106271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8757991,"threshold_uncertainty_score":0.5939974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2772322972","doi":"","title":"Holographic Feature Representations of Deep Networks.","year":2017,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Holography; Computer science; Feature (linguistics); Artificial intelligence; Pattern recognition (psychology); Computer vision; Computer graphics (images); Optics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04953838544420267,"gpt":0.3293500301314125,"spread":0.2798116446872098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002704276,0.000104886,0.0001544376,0.0001924854,0.0003104803,0.0002087441,0.0009751296,0.00009269966,0.0000587254],"category_scores_gemma":[0.0003139435,0.0001027287,0.00008573123,0.0002940524,0.0002163741,0.0004861385,0.0001440418,0.0002167218,0.00003814669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002148115,"about_ca_system_score_gemma":0.0000241112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002861278,"about_ca_topic_score_gemma":0.001104493,"domain_scores_codex":[0.9989043,0.00006350613,0.0003171016,0.0003214586,0.0001680037,0.0002255723],"domain_scores_gemma":[0.9986048,0.0001495375,0.0002486904,0.0008038164,0.0001385396,0.00005456057],"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.00002340365,0.0002114745,0.002670542,0.00001196102,0.00001892868,0.00003868499,0.00124207,0.06285801,0.0007629673,0.253648,0.000203149,0.6783108],"study_design_scores_gemma":[0.00005419232,0.00007768168,0.008934403,0.00006213823,0.000007619526,0.000007726684,0.0004164084,0.7724527,0.01040296,0.2070355,0.0003032686,0.0002454425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04796671,0.0001200257,0.9412389,0.002118772,0.001087364,0.0002723095,0.000003517381,0.00008613082,0.007106304],"genre_scores_gemma":[0.9969295,0.00007071765,0.002732444,0.0001035256,0.00008080695,0.00001720306,0.000005098928,0.000004539552,0.00005615559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9489628,"threshold_uncertainty_score":0.4189153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2572140284","doi":"","title":"On hyper-parameter estimation in empirical Bayes: a revisit of the MacKay algorithm","year":2016,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Bayes' theorem; Algorithm; Heuristic; Computer science; Gaussian; Estimation theory; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.05027605717255774,"gpt":0.3362111732541033,"spread":0.2859351160815455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050989,0.0001712093,0.0002656843,0.000188532,0.00004437579,0.00004532939,0.0009415341,0.0001150179,0.00003954176],"category_scores_gemma":[0.0009550345,0.00009700697,0.0001049926,0.0008418901,0.0001538515,0.0002003351,0.0001626704,0.0002158149,0.00004771095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001365373,"about_ca_system_score_gemma":0.00008972989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001204003,"about_ca_topic_score_gemma":0.0001161253,"domain_scores_codex":[0.997851,0.0003799379,0.0006354963,0.0004759963,0.0003333107,0.000324281],"domain_scores_gemma":[0.9978941,0.001107442,0.0001422851,0.0007238946,0.0000747625,0.0000575063],"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.0000175811,0.00009296912,0.0001528939,0.000005874825,0.000002271709,0.000003177705,0.0005855291,0.001968832,0.000473388,0.1395256,0.00004104175,0.8571309],"study_design_scores_gemma":[0.00004184158,0.00007222609,0.0002807404,0.0002368161,0.000001937423,0.000002641764,0.00001295252,0.4393842,0.01818042,0.5415896,0.00007127251,0.0001252864],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01976337,0.0000303798,0.976234,0.003033797,0.0003167732,0.0002890929,0.000004292127,0.00002512501,0.0003032149],"genre_scores_gemma":[0.7300455,0.00001779032,0.2692522,0.0005654122,0.00002810412,0.00002388153,3.15443e-7,0.000008011084,0.00005883536],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8570056,"threshold_uncertainty_score":0.3955829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401728283","doi":"","title":"State sequence analysis in hidden Markov models","year":2015,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ottawa Hospital","funders":"","keywords":"Hidden Markov model; Viterbi algorithm; Sequence (biology); Inference; Forward algorithm; Computer science; State (computer science); Markov chain; Markov model; Hidden semi-Markov model; Sequence labeling; Artificial intelligence; Algorithm; Machine learning; Markov property; Variable-order Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.1614388410284468,"gpt":0.3358911258933971,"spread":0.1744522848649503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002031681,0.0002769792,0.0005361511,0.001157994,0.00005450543,0.0003042618,0.001346501,0.0001158904,0.00003636131],"category_scores_gemma":[0.0003630797,0.000289524,0.0001481097,0.004688156,0.0001281011,0.001325582,0.0003146759,0.0003679778,0.0002534621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005958209,"about_ca_system_score_gemma":0.0003573396,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.009547822,"about_ca_topic_score_gemma":0.02854497,"domain_scores_codex":[0.9963802,0.0004606009,0.0009976295,0.0008710405,0.0006617194,0.0006288056],"domain_scores_gemma":[0.9978887,0.0004350147,0.0002180255,0.0008611952,0.0003451391,0.0002519437],"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.00008123909,0.0002598165,0.003417168,0.00001239885,0.00007090239,0.0001992183,0.009891306,0.3656202,0.0002815322,0.01693789,0.00006672068,0.6031616],"study_design_scores_gemma":[0.00005742847,0.00004694526,0.0001672291,0.00004060019,0.00001060059,0.000007292019,0.0008055419,0.8543711,0.001247954,0.1428512,0.00007639819,0.0003177252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1681252,0.00009904057,0.8276244,0.0008934814,0.000444124,0.0004376821,0.00001840994,0.0001634038,0.002194311],"genre_scores_gemma":[0.994396,0.0000182505,0.005108057,0.0002086565,0.00004090423,0.00007252171,0.000009379162,0.00001190897,0.000134314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8262709,"threshold_uncertainty_score":0.9999557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965108857","doi":"","title":"Probability Distillation: A Caveat and Alternatives.","year":2019,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal","funders":"","keywords":"Computer science; Distillation; Reliability engineering; Environmental science; Engineering; Chemistry; Chromatography","retraction":null,"screen_n_in":null,"score":{"opus":0.04868565856059613,"gpt":0.2873961231225094,"spread":0.2387104645619132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003410355,0.000130168,0.0001611506,0.0000836004,0.00006463488,0.0001532981,0.0004955638,0.00005043863,0.00007388305],"category_scores_gemma":[0.0001174937,0.0001110756,0.00002803848,0.0003248067,0.00008898039,0.000461926,0.0003365756,0.0001428655,0.0001164704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006845067,"about_ca_system_score_gemma":0.00005222094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004697556,"about_ca_topic_score_gemma":0.0002487921,"domain_scores_codex":[0.9986374,0.0000696213,0.0003178781,0.0005172344,0.000222731,0.0002351732],"domain_scores_gemma":[0.9990624,0.0002250672,0.00007070613,0.0004990992,0.00006804581,0.00007466533],"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.00003428028,0.0001203646,0.006470961,0.00003415181,0.000005474431,0.00001775319,0.002074169,0.02037372,0.0006115233,0.5514335,0.00003080825,0.4187933],"study_design_scores_gemma":[0.00003450096,0.00006894036,0.003623132,0.00005477153,9.724118e-7,0.000005082089,0.0001004364,0.7738218,0.001393919,0.2199317,0.0007846065,0.00018014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3980497,0.0001320586,0.5981479,0.000775979,0.00056219,0.0004998865,0.000008794048,0.00009303798,0.001730538],"genre_scores_gemma":[0.9884775,0.00002872463,0.01127921,0.00008848647,0.00004462494,0.00001222153,0.000004594373,0.000004209413,0.00006040962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7534481,"threshold_uncertainty_score":0.4529531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2771250101","doi":"","title":"Why Rules are Complex: Real-Valued Probabilistic Logic Programs are not Fully Expressive.","year":2017,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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","funders":"","keywords":"Computer science; Probabilistic logic; Programming language; Probabilistic argumentation; Theoretical computer science; Logic program; Probabilistic logic network; Description logic; Logic programming; Artificial intelligence; Multimodal logic; Autoepistemic logic","retraction":null,"screen_n_in":null,"score":{"opus":0.1345770587479101,"gpt":0.3333605007034456,"spread":0.1987834419555355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008721694,0.0004957448,0.0006503666,0.0001873217,0.0009859616,0.001418161,0.003964738,0.0002417439,0.00007970821],"category_scores_gemma":[0.001858243,0.0004250837,0.0002102044,0.0003407113,0.00085116,0.0005407892,0.0009253009,0.0004692041,0.0003836374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002461276,"about_ca_system_score_gemma":0.0001575779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002114565,"about_ca_topic_score_gemma":0.009067516,"domain_scores_codex":[0.9959811,0.0002816536,0.000860079,0.001263185,0.0006015687,0.001012438],"domain_scores_gemma":[0.9958577,0.0002737207,0.0009120693,0.002146537,0.0005344663,0.000275536],"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.0001619885,0.001111377,0.004706364,0.0001438011,0.00003333195,0.0003592957,0.003821839,0.004921155,0.001009048,0.8212298,0.0008766261,0.1616253],"study_design_scores_gemma":[0.0002322299,0.0004733178,0.01625533,0.0007353894,0.00002893466,0.00003539732,0.001693783,0.440579,0.004515016,0.5302314,0.003749207,0.001470997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3092779,0.0004580492,0.6226623,0.01350199,0.005256677,0.005307405,0.0001001289,0.001977199,0.04145834],"genre_scores_gemma":[0.9904928,0.00004663445,0.00812426,0.0005976542,0.0003086595,0.0001908496,0.0000171273,0.00002555489,0.0001965222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6812148,"threshold_uncertainty_score":0.9998201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406813038","doi":"","title":"Learning and planning with timing information in Markov decision processes","year":2015,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"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":"Computer science; Markov decision process; Representation (politics); Artificial intelligence; Machine learning; Markov chain; Markov process; Set (abstract data type); State (computer science); Robot; Duration (music); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05173460047726749,"gpt":0.3098116824769045,"spread":0.258077081999637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008575333,0.0001504238,0.0001648714,0.0003916219,0.00007908745,0.0003292659,0.0003667196,0.00006903709,0.000004253252],"category_scores_gemma":[0.001878176,0.0001337627,0.00001013637,0.001018301,0.00006914234,0.001384715,0.0001765434,0.0003398868,0.00003031131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001331039,"about_ca_system_score_gemma":0.0001864715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001679221,"about_ca_topic_score_gemma":0.0001431985,"domain_scores_codex":[0.9984825,0.00006348037,0.0004873429,0.0002497318,0.0003948413,0.0003221391],"domain_scores_gemma":[0.9989749,0.0003967999,0.0001530295,0.0001682184,0.0002135283,0.00009356726],"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.0000641548,0.00001015067,0.007968863,0.0000206626,0.000001513431,0.00001431907,0.009325266,0.8806962,0.000005200055,0.001563026,0.000006982968,0.1003237],"study_design_scores_gemma":[0.00008453534,0.0002094069,0.0002645901,0.0003148289,0.00000141454,0.00001054059,0.004695522,0.9903697,0.0003637572,0.003024287,0.0004668437,0.0001945665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1094078,0.00005037044,0.8889863,0.0001252038,0.0001215959,0.0001827707,1.353916e-7,0.00007260119,0.001053202],"genre_scores_gemma":[0.9677154,0.00002071587,0.03212304,0.00007469608,0.0000216857,0.00001393381,0.000003606943,0.000005936438,0.00002100773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8583075,"threshold_uncertainty_score":0.5454684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089522502","doi":"","title":"Differentially Private Top-k Selection via Stability on Unknown Domain","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"BC Cancer Agency; Simon Fraser University","funders":"","keywords":"Selection (genetic algorithm); Stability (learning theory); Computer science; Domain (mathematical analysis); Mathematics; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.06484861329735347,"gpt":0.2932797702087032,"spread":0.2284311569113497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006576391,0.0003185192,0.0003372727,0.0001876838,0.0001686297,0.0002375347,0.01318938,0.0002069322,0.0001445204],"category_scores_gemma":[0.01015032,0.0003076649,0.00009551772,0.001677539,0.0002255067,0.0004611111,0.01276864,0.0007155599,0.0002576525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003407758,"about_ca_system_score_gemma":0.0001033288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002121357,"about_ca_topic_score_gemma":0.0004416593,"domain_scores_codex":[0.9966688,0.0002566465,0.0007417247,0.001154729,0.0005317855,0.0006462858],"domain_scores_gemma":[0.995936,0.0003570332,0.0001756869,0.003257782,0.0001097598,0.0001637539],"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.0003423978,0.0006879356,0.001876908,0.00007628203,0.00003713628,0.00005858142,0.001896142,0.008387054,0.04718592,0.3451329,0.002294579,0.5920242],"study_design_scores_gemma":[0.00003565021,0.0002225898,0.0001685257,0.0000248118,0.000002018175,0.000001714315,0.00004947394,0.4449967,0.1007141,0.4528219,0.0007143913,0.0002481473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2261326,0.00001447083,0.7445517,0.02748033,0.0003846513,0.0003950243,0.000008445719,0.0007272624,0.0003054424],"genre_scores_gemma":[0.9438816,0.00001719645,0.05519222,0.0007375886,0.0001027333,0.00004016712,0.000009824685,0.00001556511,0.000003057823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.717749,"threshold_uncertainty_score":0.9999375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3183287321","doi":"","title":"PROVIDE: A Probabilistic Framework for Unsupervised Video Decomposition","year":2021,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":2,"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":"Computer science; Inference; Leverage (statistics); Artificial intelligence; Probabilistic logic; Unsupervised learning; Benchmark (surveying); Machine learning; Decomposition; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.04810708885814038,"gpt":0.3203977335676425,"spread":0.2722906447095021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005066144,0.0002148023,0.0002846202,0.0001040088,0.0001987263,0.0003434424,0.0006096797,0.0001306028,0.00007025931],"category_scores_gemma":[0.001659204,0.000213604,0.0001417283,0.000880632,0.00009402125,0.0003757043,0.0001566169,0.0002108089,0.00004622378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001456302,"about_ca_system_score_gemma":0.0002530919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009179114,"about_ca_topic_score_gemma":0.0004793052,"domain_scores_codex":[0.9977762,0.0002049285,0.0005734894,0.0007321488,0.0002341453,0.0004791248],"domain_scores_gemma":[0.9977118,0.001090383,0.0001030718,0.0005908507,0.000395654,0.000108181],"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.0000469937,0.0002141813,0.0000253267,0.00003110941,0.00001367311,0.00002432435,0.000856555,0.1924425,0.003286868,0.6221681,0.0000839702,0.1808064],"study_design_scores_gemma":[0.00002962754,0.00006102262,0.00002230782,0.00007638909,0.000005705198,0.000003749348,0.0001526004,0.508361,0.0255478,0.4650828,0.0004807885,0.0001762072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00283475,0.0001581224,0.9918453,0.003494228,0.0007088173,0.0006054102,0.000008900217,0.0000870105,0.0002574866],"genre_scores_gemma":[0.7329317,0.00002127809,0.2660044,0.000580619,0.0002242121,0.0001767002,0.00001422225,0.00001251622,0.00003433622],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7300969,"threshold_uncertainty_score":0.8710518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965103194","doi":"","title":"Differentiable Probabilistic Models of Scientific Imaging with the Fourier Slice Theorem.","year":2019,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Advanced Electron Microscopy Techniques and Applications","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Computer science; Iterative reconstruction; Artificial intelligence; Algorithm; Inference; Fourier transform; Projection (relational algebra); Probabilistic logic; Computer vision; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01385795714457307,"gpt":0.2940716380388189,"spread":0.2802136808942459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002681093,0.0001203946,0.000115449,0.00004274592,0.00009347216,0.00004056528,0.0003323625,0.00004082648,0.00003586172],"category_scores_gemma":[0.00002273101,0.00008188312,0.00004133729,0.0002762694,0.000355412,0.000008804429,0.00007365975,0.0001143636,0.00000800721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002241818,"about_ca_system_score_gemma":0.00007308457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007611325,"about_ca_topic_score_gemma":0.0002426482,"domain_scores_codex":[0.999009,0.00003400398,0.0002202016,0.0003520064,0.0001307845,0.0002539757],"domain_scores_gemma":[0.9991807,0.00003169835,0.00009430649,0.0005347771,0.0001317912,0.00002674611],"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.000121904,0.0001086632,0.0002775584,0.00001875269,0.000008852733,2.957254e-7,0.0001791643,0.1019879,0.7571862,0.1319945,0.0001210347,0.00799523],"study_design_scores_gemma":[0.00004241081,0.0001376549,0.00002188254,0.00004173258,0.00001064916,0.000003668187,0.000502648,0.08594168,0.8032198,0.10719,0.002680377,0.0002074401],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8190715,0.0001298052,0.1789674,0.0002732263,0.0000339799,0.0005630628,0.00001055714,0.00001358528,0.0009369099],"genre_scores_gemma":[0.9975111,0.00001674338,0.001831261,0.00006915993,0.00002231824,0.0000683398,0.00002800178,0.00001382565,0.000439176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1784397,"threshold_uncertainty_score":0.3339097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090786554","doi":"","title":"Non Parametric Graph Learning for Bayesian Graph Neural Networks","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1,"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; McGill University","funders":"","keywords":"Computer science; Adjacency matrix; Inference; Graph; Theoretical computer science; Artificial intelligence; Machine learning; Statistical relational learning; Data mining; Relational database","retraction":null,"screen_n_in":null,"score":{"opus":0.04336867985110546,"gpt":0.2901535011615251,"spread":0.2467848213104196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000443597,0.0004094037,0.0004757848,0.0004422827,0.0003089114,0.0002621942,0.001583577,0.0001980838,0.00001589307],"category_scores_gemma":[0.0005406115,0.0004144608,0.0002950217,0.005145376,0.0001910185,0.0005782825,0.0002672178,0.0009109877,0.00001847114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006188462,"about_ca_system_score_gemma":0.00003783708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008285142,"about_ca_topic_score_gemma":0.0001364169,"domain_scores_codex":[0.9964694,0.0001447954,0.0008725834,0.001114333,0.000369234,0.001029634],"domain_scores_gemma":[0.9978392,0.000882119,0.0002654753,0.0005000666,0.0001628872,0.000350295],"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.00008500252,0.00004280712,0.0005826274,0.00001268222,0.000008623659,0.00002398549,0.0004291863,0.8150904,0.00009443361,0.02058091,0.00007759252,0.1629718],"study_design_scores_gemma":[0.00007803739,0.0004094293,0.00008410281,0.00002594278,0.000007119247,0.000004406406,0.0001719185,0.9355133,0.0008808252,0.06214985,0.0002392202,0.0004358636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01063342,0.0002379478,0.9849193,0.002258965,0.0007262402,0.0008003613,0.000001813515,0.0003271105,0.00009486596],"genre_scores_gemma":[0.9839388,0.00008121945,0.013921,0.001582187,0.0003064769,0.0001128866,0.00001221555,0.00003418943,0.00001106529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9733053,"threshold_uncertainty_score":0.9998307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3091221243","doi":"","title":"Semi-supervised Sequential Generative Models","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":1,"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":"MNIST database; Computer science; Estimator; Latent variable; Generative model; Generative grammar; Machine learning; Artificial intelligence; Trajectory; Forcing (mathematics); Variance (accounting); Variable (mathematics); Deep learning; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09722466294154446,"gpt":0.2841124223971038,"spread":0.1868877594555593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003257584,0.0002740982,0.0003248208,0.00009911216,0.0001644119,0.0002840159,0.001090884,0.000106731,0.0001529564],"category_scores_gemma":[0.0001771968,0.000261502,0.0001293366,0.000949108,0.0001291999,0.0008140116,0.0003085817,0.0002944097,0.0001893683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000896528,"about_ca_system_score_gemma":0.0001431297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003073765,"about_ca_topic_score_gemma":0.0002185804,"domain_scores_codex":[0.9975247,0.000258744,0.0005879382,0.0007696978,0.0003508806,0.0005080508],"domain_scores_gemma":[0.9989495,0.0001521041,0.00009876578,0.0004050765,0.0001648683,0.0002296555],"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.00003159426,0.00005135535,0.000008186119,0.00000487432,0.00001333807,0.00003209271,0.003920312,0.8264562,0.008275614,0.1015527,0.0002681874,0.05938552],"study_design_scores_gemma":[0.00004073197,0.00008585105,0.000002577278,0.00001434658,0.000004302084,0.000001559163,0.0003493084,0.8884271,0.05070469,0.05973781,0.0003571258,0.000274621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003241477,0.0001208696,0.9871388,0.006927011,0.00042139,0.0002999617,0.000008136414,0.0001318743,0.001710453],"genre_scores_gemma":[0.9621336,0.00004676253,0.03462091,0.002676903,0.0004413199,0.00002972323,0.000006912974,0.00001459016,0.00002929114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9588921,"threshold_uncertainty_score":0.9999837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963437270","doi":"","title":"Per-decision Multi-step Temporal Difference Learning with Control Variates.","year":2018,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of British Columbia","funders":"","keywords":"Control variates; Temporal difference learning; Reinforcement learning; Variance (accounting); Computer science; Control (management); Variance reduction; Monte Carlo method; Artificial intelligence; Machine learning; Statistics; Mathematics; Hybrid Monte Carlo; Bayesian probability; Markov chain Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.04175902341515242,"gpt":0.2973694407687176,"spread":0.2556104173535652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009206544,0.0003613908,0.0003918751,0.0003060785,0.0003176255,0.000430544,0.001517513,0.0001554478,0.000154445],"category_scores_gemma":[0.0006751445,0.0002985132,0.00007638901,0.0009073229,0.0004176887,0.000399269,0.0002760147,0.0006631381,0.0006328687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001877362,"about_ca_system_score_gemma":0.000176204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001161549,"about_ca_topic_score_gemma":0.001275252,"domain_scores_codex":[0.996689,0.0002348403,0.000788948,0.0008340014,0.000687497,0.0007657619],"domain_scores_gemma":[0.9977039,0.000656042,0.0002894164,0.0007735165,0.0004007421,0.0001764355],"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.0001677929,0.0001148146,0.009597239,0.000008790043,0.00001747183,0.00003204838,0.002219321,0.83322,0.0006661323,0.02269942,0.00001076672,0.1312462],"study_design_scores_gemma":[0.000216,0.0007720465,0.001982333,0.0001293162,0.000007377871,0.00001093256,0.000368892,0.992449,0.001145028,0.001942318,0.0005660027,0.0004107658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02428019,0.0000232633,0.973681,0.000296254,0.0005485174,0.0004097868,0.000001129842,0.0002514954,0.0005083972],"genre_scores_gemma":[0.9147429,0.000009434812,0.08444803,0.0002378197,0.0001397444,0.00002624314,0.000003935175,0.00002242893,0.0003694391],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8904628,"threshold_uncertainty_score":0.9999467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2774018923","doi":"","title":"Stochastic Segmentation Trees for Multiple Ground Truths.","year":2017,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":1,"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":"Segmentation; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07325594585640749,"gpt":0.3439437889214061,"spread":0.2706878430649986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002952059,0.0001240843,0.000133785,0.0001094827,0.0005884253,0.0004208246,0.001046187,0.00006664318,0.00001385698],"category_scores_gemma":[0.0002452735,0.000124571,0.00007299185,0.0001408834,0.0001205256,0.0004218952,0.00009216493,0.00009631117,0.00003644783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009314295,"about_ca_system_score_gemma":0.00003933222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006498058,"about_ca_topic_score_gemma":0.001293949,"domain_scores_codex":[0.9988641,0.00002106325,0.000341993,0.0003901855,0.0001353834,0.0002472725],"domain_scores_gemma":[0.998695,0.0002240275,0.0001921226,0.0007329,0.00009808676,0.00005782527],"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.00003508853,0.0001453202,0.0001378047,0.000007942359,0.00000655699,0.000001366145,0.0006691084,0.02862026,0.008066508,0.3453508,0.00006675944,0.6168925],"study_design_scores_gemma":[0.00004841452,0.0000953273,0.0006503757,0.00001713541,0.000003350413,0.000001706851,0.0002209721,0.7997108,0.03179588,0.1670067,0.0002742815,0.0001750532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0169228,0.00001193836,0.9809943,0.0009067465,0.0002402257,0.0006031186,0.000009579409,0.0001369266,0.0001743032],"genre_scores_gemma":[0.9679865,0.000006296223,0.03135657,0.00007684956,0.00008498259,0.0004062926,0.000005111831,0.000007684404,0.00006976427],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9510636,"threshold_uncertainty_score":0.5079859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966236725","doi":"","title":"On the Relationship Between Satisfiability and Markov Decision Processes.","year":2019,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Satisfiability; Markov process; Markov chain; Markov decision process; Boolean satisfiability problem; Theoretical computer science; Algorithm; Mathematics; Machine learning; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0628719743448886,"gpt":0.3038967491543022,"spread":0.2410247748094136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001676875,0.0001459596,0.000158793,0.0001137868,0.000193813,0.0001897184,0.0006209235,0.00009175132,0.00005407703],"category_scores_gemma":[0.00329806,0.0001054718,0.00002864943,0.0007615022,0.00009091165,0.0002191352,0.0001343575,0.0003861074,0.0002080639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006590353,"about_ca_system_score_gemma":0.0001164217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001993784,"about_ca_topic_score_gemma":0.0001709495,"domain_scores_codex":[0.9983831,0.0001798523,0.000395295,0.0004697444,0.000297837,0.0002741613],"domain_scores_gemma":[0.9864119,0.01279631,0.00009688078,0.0005503558,0.00008062027,0.00006395024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004348467,0.00003778252,0.4498785,0.00004555843,0.00000389044,0.00000310771,0.002127273,0.01853644,0.00001600608,0.3856311,0.0001202015,0.1435566],"study_design_scores_gemma":[0.00003324817,0.0001398591,0.05943644,0.0002853702,0.000002818386,0.000001783118,0.0001857865,0.1003616,0.0005040348,0.8386797,0.0001393812,0.0002299898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7674216,0.00006496286,0.2288977,0.00218659,0.0001694579,0.0003614868,0.000004217243,0.00006492827,0.0008290809],"genre_scores_gemma":[0.9958183,0.000003908805,0.003836809,0.0002432211,0.00003081752,0.00001537432,0.00000293473,0.000005900617,0.00004274908],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4530485,"threshold_uncertainty_score":0.4301015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090228367","doi":"","title":"Batch norm with entropic regularization turns deterministic autoencoders into generative models","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Autoencoder; Computer science; Generative model; Regularization (linguistics); Generative grammar; Encoder; Algorithm; Artificial neural network; Artificial intelligence; Encoding (memory); Matrix norm; Source code; Normalization (sociology); Theoretical computer science; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.04116235678626784,"gpt":0.2522136720768242,"spread":0.2110513152905563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002035405,0.0002945864,0.0003232212,0.0001133005,0.0001775994,0.0003030332,0.0008192108,0.00009638636,0.00004389306],"category_scores_gemma":[0.0001810995,0.0002521394,0.0000703008,0.0009952181,0.0001868369,0.0007413381,0.0001747249,0.000250925,0.00005192933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001374784,"about_ca_system_score_gemma":0.0002012698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003089765,"about_ca_topic_score_gemma":0.001023952,"domain_scores_codex":[0.9976653,0.0002021291,0.0005358087,0.0007710872,0.0003817734,0.0004438931],"domain_scores_gemma":[0.9988546,0.000165416,0.0001587609,0.0004105969,0.0002094819,0.0002010938],"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.00005225503,0.00005043253,0.00002874473,0.0000123005,0.00001557449,0.00003661852,0.009294292,0.8844852,0.001578351,0.07177978,0.00003846842,0.03262793],"study_design_scores_gemma":[0.00005584618,0.0002466824,0.0000124505,0.00003174781,0.000009574313,0.000002649675,0.0005237999,0.9081054,0.01087187,0.07970461,0.000140809,0.0002945843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002039416,0.00006065136,0.9915144,0.005179476,0.0002253792,0.0003635371,0.00000321622,0.0001070771,0.0005068138],"genre_scores_gemma":[0.9072923,0.00003114641,0.09125718,0.001120872,0.0002033944,0.00003688584,0.000009506556,0.00001597023,0.00003275504],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9052529,"threshold_uncertainty_score":0.9999931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3184302936","doi":"","title":"Identifying Regions of Trusted Predictions","year":2021,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Waterloo","funders":"","keywords":"Computer science; Pointwise; Machine learning; Artificial intelligence; Process (computing); Domain (mathematical analysis); Data mining; Confidence interval; Sample complexity; Sample (material); Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05836014756836001,"gpt":0.3227540973834027,"spread":0.2643939498150427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003641082,0.0001132334,0.0001898349,0.0001889811,0.0001184846,0.00009219883,0.0005433441,0.00006537115,0.00008682872],"category_scores_gemma":[0.0004752712,0.0001175435,0.00009032487,0.001377708,0.00009107994,0.0002027405,0.000180343,0.0002879927,0.00004360639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004831524,"about_ca_system_score_gemma":0.0001508625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004715599,"about_ca_topic_score_gemma":0.0003613447,"domain_scores_codex":[0.9984262,0.0001566932,0.0005060093,0.0003828249,0.0002635497,0.0002647261],"domain_scores_gemma":[0.9988704,0.0002290607,0.0001153762,0.0005249449,0.0001895445,0.00007072114],"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.00000759517,0.0002442059,0.0004393905,0.00002607337,0.00001636315,0.00007868848,0.003136202,0.1341852,0.003117717,0.7210572,0.0001110775,0.1375802],"study_design_scores_gemma":[0.00003355698,0.00004140624,0.0004182564,0.0001089619,0.00000546745,0.00002682111,0.0009631577,0.8492627,0.02537849,0.1229124,0.0006844457,0.0001642941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01170376,0.0001430631,0.9837835,0.001505859,0.0007080999,0.00008521359,0.000004152583,0.0001157772,0.001950597],"genre_scores_gemma":[0.9789599,0.00004367085,0.02048241,0.00008854523,0.00007752008,0.00001162089,0.000006658059,0.000006601255,0.0003231109],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9672561,"threshold_uncertainty_score":0.4793283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963763058","doi":"","title":"Convex-constrained Sparse Additive Modeling and Its Extensions.","year":2017,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Overfitting; Convexity; Additive model; Mathematical optimization; Mathematics; Regularization (linguistics); A priori and a posteriori; Computer science; Algorithm; Convex optimization; Regular polygon; Convex function; Artificial intelligence; Machine learning; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.2580744315264659,"gpt":0.4199282445267047,"spread":0.1618538130002388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0008115286,0.000205846,0.0003731609,0.0000861227,0.0003698191,0.0001546662,0.0003284412,0.000119779,0.0003951579],"category_scores_gemma":[0.01477071,0.000184931,0.00004809311,0.00007667358,0.0003515083,0.0001416532,0.0001523379,0.0003059651,0.00005814388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003978295,"about_ca_system_score_gemma":0.00006980245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002804301,"about_ca_topic_score_gemma":0.0003312253,"domain_scores_codex":[0.9983157,0.0001186361,0.0005615823,0.0004205128,0.000206399,0.0003772075],"domain_scores_gemma":[0.9975196,0.001479436,0.0001771026,0.0004410892,0.0002350467,0.0001476881],"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.00005364634,0.00006699475,0.00002883348,0.00002042306,0.000008601975,0.00003733251,0.0005787804,0.0006252253,0.0005990269,0.8667287,0.00002001999,0.1312324],"study_design_scores_gemma":[0.00002898513,0.00003374057,0.0000342258,0.0001048433,0.000008863623,0.000004590449,0.0005530857,0.4741134,0.002105374,0.5228595,0.00001455994,0.0001388428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4358971,0.0001055543,0.5547498,0.001089322,0.000549273,0.0006609493,0.0001334661,0.0000869291,0.006727575],"genre_scores_gemma":[0.9629824,0.00007852727,0.03665048,0.0001075347,0.00007965365,0.00002868975,0.000002367398,0.00001515452,0.00005524433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5270852,"threshold_uncertainty_score":0.9935283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3185541071","doi":"","title":"Contextual Policy Transfer in Reinforcement Learning Domains via Deep Mixtures-of-Experts","year":2021,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"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; Computer science; Robustness (evolution); Machine learning; Artificial intelligence; Transfer of learning; Reuse; Context (archaeology); Task (project management); Bayesian probability; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03181191723208893,"gpt":0.2972237819968313,"spread":0.2654118647647424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007407441,0.0003070765,0.0004627408,0.0005450668,0.0001142398,0.0001313286,0.0009605965,0.0001790882,0.0001491256],"category_scores_gemma":[0.0008757324,0.00032296,0.0001309926,0.001898916,0.0001947813,0.0003611309,0.0002617973,0.0005549738,0.00005069255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003605805,"about_ca_system_score_gemma":0.0003781205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001114903,"about_ca_topic_score_gemma":0.001289969,"domain_scores_codex":[0.9963885,0.0003235947,0.001273806,0.0006292852,0.0006361855,0.0007486546],"domain_scores_gemma":[0.9983697,0.0004778997,0.0001397803,0.000650998,0.0002267464,0.0001348975],"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.00003871293,0.00008595525,0.000323595,0.00002252266,0.00001333259,0.00009800476,0.006812552,0.8333458,0.006573731,0.1167647,0.000006336461,0.03591469],"study_design_scores_gemma":[0.0001554912,0.0002284047,0.0000757289,0.0001322209,0.000004143466,0.00001514394,0.001016291,0.9247836,0.06667003,0.005776791,0.0007781904,0.0003639817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0178021,0.0001435226,0.9778465,0.0007409882,0.0003448264,0.0003008406,5.034385e-7,0.0000747107,0.002746017],"genre_scores_gemma":[0.9953175,0.00009237086,0.00375067,0.00040664,0.00008703486,0.00002862503,0.00001303542,0.00001865457,0.0002854966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9775154,"threshold_uncertainty_score":0.9999223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3183593932","doi":"","title":"Efficient Greedy Coordinate Descent via Variable Partitioning","year":2021,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"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":"Coordinate descent; Greedy algorithm; Partition (number theory); Convergence (economics); Algorithm; Computer science; Descent (aeronautics); Mathematical optimization; Mathematics; Variable (mathematics); Rate of convergence; Key (lock); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03679210610531011,"gpt":0.2756887765513355,"spread":0.2388966704460254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000506329,0.0001715355,0.0002000093,0.0001377776,0.0002094225,0.00023098,0.0004550314,0.00009468452,0.0003544139],"category_scores_gemma":[0.0002335749,0.0001741413,0.00006929364,0.001143129,0.00006999024,0.0001703664,0.0002412483,0.0002496715,0.0005197065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000127691,"about_ca_system_score_gemma":0.0001505569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003361228,"about_ca_topic_score_gemma":0.000222284,"domain_scores_codex":[0.9979837,0.0001563885,0.0005121426,0.0005732976,0.000285401,0.0004890575],"domain_scores_gemma":[0.9988675,0.0001728743,0.00009504645,0.000463224,0.0002749459,0.0001264565],"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.00002445794,0.000503664,0.0001395784,0.00002624858,0.00001089573,0.0001248596,0.001329073,0.6721378,0.02372758,0.1453505,0.0002579593,0.1563674],"study_design_scores_gemma":[0.00004239871,0.00003411738,0.00005405228,0.0001462111,0.000003797624,0.00001877882,0.0003704012,0.8343149,0.09339187,0.07066771,0.0007262152,0.0002294979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05058338,0.00009687208,0.945062,0.001221987,0.0008606243,0.0001635987,0.000003930283,0.0001295523,0.001878009],"genre_scores_gemma":[0.9808239,0.00001858874,0.01838357,0.000512788,0.00006631175,0.00004059457,0.00001410405,0.000008993659,0.0001311562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9302405,"threshold_uncertainty_score":0.7101277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089548822","doi":"","title":"Stable Policy Optimization via Off-Policy Divergence Regularization.","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Reinforcement learning; Benchmark (surveying); Regularization (linguistics); Computer science; Divergence (linguistics); Stability (learning theory); Trust region; Mathematical optimization; Adversarial system; Optimization problem; Range (aeronautics); Term (time); Artificial intelligence; Machine learning; Algorithm; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03451898926511433,"gpt":0.2957511071451971,"spread":0.2612321178800828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004730046,0.0002948607,0.0003131407,0.0004295629,0.0002912872,0.0002549687,0.001676383,0.0001513272,0.000163343],"category_scores_gemma":[0.002710195,0.0003194869,0.00008551493,0.004242264,0.0001650309,0.0009387205,0.0006679203,0.0004372454,0.0001837183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003452065,"about_ca_system_score_gemma":0.0005280908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00155228,"about_ca_topic_score_gemma":0.00008636462,"domain_scores_codex":[0.9969914,0.000263544,0.0007536755,0.0008144684,0.0005448907,0.0006320011],"domain_scores_gemma":[0.9984587,0.0002065648,0.0002525444,0.0005923859,0.0002356986,0.0002541206],"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.0000218584,0.00003764155,0.0001586724,0.00001003325,0.000005327982,0.00001163282,0.001867349,0.703388,0.0002591815,0.2293497,0.0000294335,0.06486109],"study_design_scores_gemma":[0.0000474762,0.00006964336,0.00003446764,0.00002378914,0.000003550987,0.000003211796,0.0001663659,0.9574835,0.002097913,0.03905619,0.0006961949,0.000317669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004019767,0.00006047312,0.9822041,0.01500586,0.0003166337,0.0003300025,0.000004398284,0.0002999569,0.001376624],"genre_scores_gemma":[0.898549,0.0001035883,0.09778571,0.002491688,0.0008326095,0.00002918226,0.0000231595,0.00003335406,0.0001517012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.898147,"threshold_uncertainty_score":0.9999257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}