{"meta":{"query_hash":"5648e54e999c","filters":{"venue":"Uncertainty in Artificial Intelligence"},"cohort_total":35,"direct_labels_cover":0,"predictions_cover":35,"exported":35,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/5648e54e999c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Uncertainty+in+Artificial+Intelligence"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04739542792282484,"score_gpt":0.3219355585509258,"score_spread":0.27454013062810095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161202741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022224628,0.0003716046,0.99526215,0.00026685745,0.000032670298,0.000022894146,0.000078419216,0.00017901446,0.0015639156],"genre_scores_gemma":[0.13559686,0.0018937659,0.85488224,0.00077159534,0.00029400323,0.0003550288,0.0005620466,0.00042641666,0.0052181003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816316,0.0008307121,0.00008022545,0.00033528384,0.0004549392,0.00013580492],"domain_scores_gemma":[0.9922454,0.005948545,0.00041857234,0.0007719699,0.00042639708,0.00018906446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026936324,0.00074734073,0.0010366353,0.0021700705,0.001076214,0.0023977584,0.0016936614,0.0018703822,0.0073483307],"category_scores_gemma":[0.019564655,0.00096835825,0.0013907553,0.002193641,0.0026990396,0.0053213844,0.0025905124,0.002929278,0.0012587161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037693564,0.000024787509,0.00049095775,0.00010627979,0.000029316858,0.00004037778,0.00017699577,0.16832243,0.0004923986,0.76143974,0.0037112238,0.06512783],"study_design_scores_gemma":[0.000015586815,0.000010716656,0.00009722353,0.000032496217,0.0000072876346,0.000026912936,0.000012683137,0.25115862,0.00025366154,0.7420385,0.0063341926,0.000012102024],"about_ca_topic_score_codex":0.004923123,"about_ca_topic_score_gemma":0.0042385673,"teacher_disagreement_score":0.0073483307,"about_ca_system_score_codex":0.0018653745,"about_ca_system_score_gemma":0.0015721066,"threshold_uncertainty_score":0.024582624},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09631687283916708,"score_gpt":0.3443424134911935,"score_spread":0.24802554065202642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398850217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010537651,0.00009537349,0.98779905,0.0001002615,0.000024693816,0.000088512956,0.000015493724,0.0004069948,0.00093191897],"genre_scores_gemma":[0.5699551,0.00020787376,0.4259922,0.00031979888,0.00008961504,0.00045550484,0.00020851965,0.00021444375,0.0025569326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762136,0.0010542814,0.00012422727,0.00033424012,0.00065591244,0.00020999857],"domain_scores_gemma":[0.98829556,0.008901855,0.00050059997,0.0010809174,0.00090741477,0.00031367553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004682454,0.00129556,0.0021088456,0.0010919695,0.00072437106,0.0015054338,0.0027834782,0.0014584902,0.0028171341],"category_scores_gemma":[0.020491125,0.0007692131,0.00081005803,0.0010627968,0.0016852411,0.0026807918,0.0024351382,0.0029846474,0.00051095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002859172,0.00025793456,0.0016302589,0.00012260534,0.00007240824,0.00009131889,0.00011339054,0.7394483,0.001688914,0.05577455,0.0013603368,0.19915393],"study_design_scores_gemma":[0.000011734879,0.00002410743,0.00003851313,0.000004607623,0.0000037607253,0.000010018649,0.000004015702,0.9899906,0.00040756667,0.009362892,0.00013916702,0.0000030174822],"about_ca_topic_score_codex":0.0044432236,"about_ca_topic_score_gemma":0.004288202,"teacher_disagreement_score":0.004682454,"about_ca_system_score_codex":0.001732054,"about_ca_system_score_gemma":0.0025945578,"threshold_uncertainty_score":0.024763465},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02643517356787296,"score_gpt":0.26605371461280786,"score_spread":0.2396185410449349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401533533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009696391,0.000083260216,0.98665327,0.00019681723,0.000073521245,0.00007356165,0.0000479349,0.00059241883,0.0025827913],"genre_scores_gemma":[0.50079334,0.00011213327,0.49124914,0.0006614611,0.00012043931,0.0002631058,0.00027155463,0.00035255824,0.0061763334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978834,0.00054277387,0.00013298733,0.00058797764,0.0006117551,0.00024110058],"domain_scores_gemma":[0.9942638,0.003274362,0.00032099875,0.0010657877,0.00082102674,0.0002539687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002824217,0.0009890335,0.0013441727,0.0005971142,0.00055622694,0.0019189863,0.0025073837,0.0022962955,0.0059000785],"category_scores_gemma":[0.014376165,0.00055756216,0.0009044041,0.00057952193,0.001674892,0.0031533046,0.003358632,0.0040125432,0.0009393892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004935339,0.0004319995,0.0017751987,0.00020371912,0.00007596559,0.0001562832,0.00026721944,0.45433697,0.005010171,0.1320229,0.0049370984,0.40028894],"study_design_scores_gemma":[0.00003825256,0.00011252139,0.00010698067,0.000010476904,0.000008723946,0.00004693538,0.000014026455,0.97033197,0.0018401777,0.026241569,0.0012374484,0.0000109215525],"about_ca_topic_score_codex":0.0040384727,"about_ca_topic_score_gemma":0.0027592422,"teacher_disagreement_score":0.0059000785,"about_ca_system_score_codex":0.0016638396,"about_ca_system_score_gemma":0.0029557832,"threshold_uncertainty_score":0.01973778},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16143884102844683,"score_gpt":0.3358911258933971,"score_spread":0.17445228486495026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401728283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018954444,0.00034056316,0.996808,0.00014360357,0.000022069102,0.000020108962,0.000066231085,0.00033281697,0.00037113865],"genre_scores_gemma":[0.2996757,0.0017148079,0.6942759,0.0003242823,0.00026626597,0.00036900956,0.0009143685,0.00029982702,0.0021598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968849,0.0015609596,0.00019163334,0.0006180304,0.0006005727,0.00014376812],"domain_scores_gemma":[0.981557,0.01606059,0.0007986201,0.0007703762,0.0006884989,0.00012499228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043393895,0.0010649337,0.0012458682,0.001706949,0.0007694305,0.001427604,0.0021023864,0.0019046384,0.0020589612],"category_scores_gemma":[0.025320495,0.0010767357,0.0012031496,0.0018284486,0.001898919,0.0036097942,0.0017209788,0.0031612092,0.00076065795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011779438,0.000048420967,0.001528767,0.0002983565,0.00009672855,0.00015552434,0.0002709877,0.71879417,0.0011424533,0.17432465,0.0016182377,0.10160387],"study_design_scores_gemma":[0.000007129811,0.000013039528,0.00009460723,0.00002503975,0.000010519266,0.000022132723,0.00001304357,0.86980253,0.00056387036,0.12858157,0.0008551511,0.0000114057775],"about_ca_topic_score_codex":0.007881377,"about_ca_topic_score_gemma":0.0051290626,"teacher_disagreement_score":0.007881377,"about_ca_system_score_codex":0.0021348028,"about_ca_system_score_gemma":0.0024523244,"threshold_uncertainty_score":0.0229491},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1292949818094062,"score_gpt":0.41023667229085736,"score_spread":0.2809416904814511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402930259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043774188,0.00048634343,0.91151935,0.0038317968,0.00013974581,0.00013534827,0.00013268927,0.00033887368,0.03964165],"genre_scores_gemma":[0.8080266,0.00040905425,0.1845642,0.00030812717,0.0000878903,0.00029013996,0.00010428873,0.0000631804,0.006146511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987367,0.0007205669,0.000051741867,0.00018134591,0.00021775895,0.00009181945],"domain_scores_gemma":[0.99765956,0.0014842997,0.0002883018,0.00021102108,0.00017041632,0.00018640899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022641358,0.00066989416,0.0004500448,0.00043161976,0.0008562551,0.0031622625,0.0012003239,0.0017469367,0.004427741],"category_scores_gemma":[0.008207993,0.00032281576,0.0006350042,0.00040908516,0.003141133,0.00280913,0.0020101499,0.0012934345,0.0005280924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009295675,0.000042190874,0.0009786494,0.00009782626,0.000055651708,0.00022684719,0.0007672909,0.1971786,0.0013373911,0.77419513,0.002076177,0.022951273],"study_design_scores_gemma":[0.000030279618,0.000032070104,0.00024537524,0.00002489489,0.00001582058,0.000049941034,0.00015845094,0.37791657,0.00040024542,0.61506146,0.006045255,0.00001967332],"about_ca_topic_score_codex":0.0021209265,"about_ca_topic_score_gemma":0.0015551642,"teacher_disagreement_score":0.004427741,"about_ca_system_score_codex":0.0012815204,"about_ca_system_score_gemma":0.0013157211,"threshold_uncertainty_score":0.014812231},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05173460047726749,"score_gpt":0.3098116824769045,"score_spread":0.258077081999637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406813038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08509644,0.00024914616,0.9126031,0.0004296591,0.000026438323,0.000028665514,0.00007334019,0.00018101843,0.0013123002],"genre_scores_gemma":[0.9035395,0.00025675818,0.09464844,0.000077256766,0.000037898095,0.000102745245,0.00014048137,0.000046967405,0.0011499593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886155,0.0005912927,0.00005668914,0.00021656792,0.00015651851,0.000117491865],"domain_scores_gemma":[0.99332607,0.005645429,0.00042124675,0.00022023842,0.00021300686,0.00017403213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023630857,0.0007817065,0.0011151716,0.00056273997,0.00053313765,0.00111546,0.0012041648,0.0013053456,0.0016284814],"category_scores_gemma":[0.009541492,0.0006235167,0.0008021451,0.00081385847,0.0020510978,0.002978705,0.0013396383,0.001574499,0.00017692994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008156322,0.000020958518,0.00028851113,0.000027086433,0.000015048909,0.000048957936,0.000044905253,0.95543516,0.000341535,0.036147196,0.00010474743,0.0074442644],"study_design_scores_gemma":[0.000011964532,0.000011706159,0.0000320744,0.0000028042637,0.0000028970464,0.0000044532953,0.00000383819,0.9674666,0.00017384096,0.032221995,0.00006387462,0.000004009566],"about_ca_topic_score_codex":0.0062187226,"about_ca_topic_score_gemma":0.004011709,"teacher_disagreement_score":0.0062187226,"about_ca_system_score_codex":0.0013768327,"about_ca_system_score_gemma":0.0012519748,"threshold_uncertainty_score":0.0124973655},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05027605717255774,"score_gpt":0.33621117325410327,"score_spread":0.28593511608154554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572140284","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010115162,0.0019750444,0.9930769,0.0008821125,0.00012094165,0.00003621916,0.00003117229,0.00008303379,0.0027831134],"genre_scores_gemma":[0.07923907,0.0049973526,0.9089992,0.0010183438,0.0014352036,0.00035086134,0.00010471628,0.00041015798,0.003445195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98031265,0.013110989,0.0010079725,0.0017917495,0.003340324,0.00043637305],"domain_scores_gemma":[0.94155115,0.05010981,0.0017500775,0.0031583142,0.0030014429,0.00042915234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038541872,0.0021204755,0.003378378,0.005676022,0.0019217436,0.0061804336,0.0049728206,0.003779652,0.004794792],"category_scores_gemma":[0.105247535,0.0019024705,0.0024512678,0.004899037,0.009955585,0.01324595,0.0064917654,0.008230183,0.0019138586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003931598,0.000025904397,0.0004954264,0.00025656217,0.00010963975,0.00007675417,0.0003455887,0.032783344,0.00030283013,0.9040094,0.0019597248,0.059595536],"study_design_scores_gemma":[0.000016980775,0.000023484683,0.00020777652,0.00016967641,0.000031210842,0.00007280063,0.000034102068,0.09999746,0.00024874523,0.8919688,0.007173588,0.000055273416],"about_ca_topic_score_codex":0.0050438945,"about_ca_topic_score_gemma":0.0038261972,"teacher_disagreement_score":0.038541872,"about_ca_system_score_codex":0.0031495267,"about_ca_system_score_gemma":0.0038841644,"threshold_uncertainty_score":0.20383132},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1345770587479101,"score_gpt":0.33336050070344564,"score_spread":0.19878344195553554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771250101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0688198,0.0028300933,0.8456652,0.027813317,0.00036982744,0.0001223087,0.0013431108,0.0013184252,0.05171788],"genre_scores_gemma":[0.82924813,0.0017433371,0.16032796,0.0028036234,0.0002720758,0.00018067964,0.00096212246,0.00034093062,0.004121154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944448,0.0019590864,0.00050358113,0.0011275365,0.0015311034,0.00043387155],"domain_scores_gemma":[0.9646045,0.025933115,0.0023230696,0.004415453,0.00204561,0.00067828404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066399714,0.0005135943,0.001010106,0.0013046955,0.00129893,0.009373823,0.0025238,0.0031448922,0.0061286367],"category_scores_gemma":[0.044501007,0.0010041595,0.0016904885,0.0014380477,0.0070574535,0.022963427,0.0034936836,0.0055233478,0.0012647852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006649075,0.000030278903,0.0011061787,0.0002105992,0.00008357085,0.00021649008,0.0006083101,0.008001926,0.00084637076,0.9594779,0.0038971077,0.025454683],"study_design_scores_gemma":[0.000009047198,0.0000031821862,0.00013050578,0.000029310351,0.0000131668085,0.00007968306,0.00010020865,0.00850206,0.0002905923,0.9883768,0.0024551952,0.000010297726],"about_ca_topic_score_codex":0.0028415043,"about_ca_topic_score_gemma":0.002407858,"teacher_disagreement_score":0.009373823,"about_ca_system_score_codex":0.0011751003,"about_ca_system_score_gemma":0.0016980739,"threshold_uncertainty_score":0.035115957},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04953838544420267,"score_gpt":0.32935003013141245,"score_spread":0.27981164468720976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772322972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046237204,0.0020294678,0.9373625,0.0013552385,0.00027576135,0.000031779506,0.0013300256,0.0010026614,0.010375239],"genre_scores_gemma":[0.9119088,0.0009830644,0.07408943,0.00031007628,0.00017259644,0.00007506916,0.0012469289,0.0001295604,0.011084457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982446,0.00004635482,0.000010929648,0.000043227392,0.000042306,0.000032725202],"domain_scores_gemma":[0.99961084,0.00014794887,0.000063068226,0.00008593399,0.00006202096,0.000030324252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032780707,0.0004268499,0.0004732916,0.00055135076,0.00021053971,0.0009853992,0.0010831548,0.00082918815,0.0041211024],"category_scores_gemma":[0.0020402933,0.00031959184,0.00034255706,0.0005896543,0.00066690025,0.002494247,0.0011098266,0.0012550983,0.0006965545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025099982,0.0000998157,0.0013967638,0.000246084,0.0001214124,0.00010249819,0.00011385913,0.33280414,0.0081217885,0.33440933,0.016527867,0.30580547],"study_design_scores_gemma":[0.00000993388,0.000029571373,0.00043952165,0.000021758613,0.000013485066,0.00002813302,0.000017511487,0.849765,0.0019922587,0.14552495,0.002149043,0.0000088579445],"about_ca_topic_score_codex":0.0033848463,"about_ca_topic_score_gemma":0.0046520443,"teacher_disagreement_score":0.0041211024,"about_ca_system_score_codex":0.0007507084,"about_ca_system_score_gemma":0.00050061615,"threshold_uncertainty_score":0.013786435},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04788244141461452,"score_gpt":0.31440473209314307,"score_spread":0.26652229067852856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772489041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018709794,0.0015927895,0.9747083,0.00085574994,0.00015089162,0.000032905325,0.00006587725,0.00025157756,0.0036320344],"genre_scores_gemma":[0.6895099,0.0012555039,0.29089406,0.000350175,0.00032543295,0.00014039289,0.00038547927,0.00024376104,0.01689534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901116,0.0005190019,0.00005212845,0.00011683409,0.00020146233,0.00009931309],"domain_scores_gemma":[0.9965469,0.0020735322,0.00019934784,0.00036185706,0.0006338074,0.00018463124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023991205,0.0006293347,0.0010995776,0.0007629135,0.00042617152,0.0011944746,0.0016213886,0.0013309581,0.0033610207],"category_scores_gemma":[0.011137122,0.00043025802,0.0004883524,0.0009186088,0.0013364581,0.002974645,0.0021399995,0.0019354555,0.0007585634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029360614,0.0001262624,0.0011387831,0.00017667229,0.00013181794,0.00009438039,0.00010859378,0.4986131,0.0014046802,0.32486874,0.010521092,0.16252236],"study_design_scores_gemma":[0.000008574297,0.000020546475,0.00011265473,0.000009716729,0.000006968215,0.000014013817,0.0000068735426,0.9387878,0.00033775056,0.0597325,0.000955962,0.0000066615958],"about_ca_topic_score_codex":0.0030912887,"about_ca_topic_score_gemma":0.003012759,"teacher_disagreement_score":0.0033610207,"about_ca_system_score_codex":0.0012412901,"about_ca_system_score_gemma":0.0009457565,"threshold_uncertainty_score":0.0126879215},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence","score_opus":0.07325594585640749,"score_gpt":0.3439437889214061,"score_spread":0.2706878430649986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774018923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013350937,0.00063372956,0.98131186,0.00038837918,0.0000808564,0.000055672208,0.0008344642,0.001852576,0.0014915765],"genre_scores_gemma":[0.3979031,0.00051008305,0.5916106,0.00021969345,0.000213662,0.0001772111,0.005478259,0.00058950385,0.0032978936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793637,0.0004798566,0.0001323066,0.00060182274,0.00065444474,0.00019528338],"domain_scores_gemma":[0.9928416,0.004617696,0.00055145886,0.00082812604,0.0009555564,0.00020555149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029446923,0.00078989234,0.0015162699,0.0030072036,0.00091227726,0.0023477226,0.0023691922,0.003202153,0.004686705],"category_scores_gemma":[0.015577687,0.0010910223,0.0015560478,0.0027603684,0.0011839833,0.0036651813,0.0019670809,0.0020575654,0.0017323096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040168714,0.00010419552,0.0028076468,0.0003389389,0.00017431586,0.00029637455,0.00029004697,0.56571746,0.005162113,0.09664396,0.015164124,0.31289914],"study_design_scores_gemma":[0.000008914954,0.000014492384,0.00032628493,0.00002612259,0.000011306816,0.00005243223,0.000019585601,0.93992347,0.0008800188,0.057117622,0.0016121204,0.000007745883],"about_ca_topic_score_codex":0.00639862,"about_ca_topic_score_gemma":0.009841499,"teacher_disagreement_score":0.00639862,"about_ca_system_score_codex":0.0018109116,"about_ca_system_score_gemma":0.0017626531,"threshold_uncertainty_score":0.015678644},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10081530290189013,"score_gpt":0.3667202816540406,"score_spread":0.26590497875215047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809487708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028061109,0.00085192773,0.9682406,0.00026714374,0.00007629362,0.00007144466,0.000050787716,0.0004688063,0.0019119154],"genre_scores_gemma":[0.45262772,0.00059823086,0.54157287,0.0002866102,0.00013430389,0.00023455177,0.00033109484,0.00035598068,0.0038586007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808013,0.0007154863,0.00012292691,0.00038588574,0.00060041365,0.000095170086],"domain_scores_gemma":[0.9808225,0.015067269,0.000829485,0.001277659,0.0016328646,0.00037031525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053409,0.0010836672,0.0011839793,0.00097327674,0.00034562667,0.001517429,0.0020335508,0.001379444,0.0022541583],"category_scores_gemma":[0.03270878,0.00044349107,0.0006960768,0.00066703116,0.00102828,0.0029325737,0.0026426858,0.0024744282,0.0005250929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007883848,0.00030663746,0.009143627,0.0003544764,0.0003107862,0.000073926414,0.0002900859,0.52133024,0.003762903,0.032735776,0.0021002144,0.42880294],"study_design_scores_gemma":[0.000035017933,0.00007112028,0.0006451336,0.000025094925,0.000020820858,0.000044189714,0.000023441778,0.9880095,0.0015999891,0.008978442,0.0005303762,0.00001681413],"about_ca_topic_score_codex":0.004060122,"about_ca_topic_score_gemma":0.004204431,"teacher_disagreement_score":0.0053409,"about_ca_system_score_codex":0.0010055485,"about_ca_system_score_gemma":0.0017263817,"threshold_uncertainty_score":0.028245747},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12525668512547758,"score_gpt":0.38339916574281296,"score_spread":0.25814248061733536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914852071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041990016,0.0011868648,0.94531465,0.0011627893,0.00030701913,0.000065451044,0.00031948648,0.00038445165,0.009269261],"genre_scores_gemma":[0.8637325,0.00060394144,0.12448985,0.0003287566,0.00014907385,0.00021040633,0.00048549447,0.0002451819,0.009754793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951386,0.00019791504,0.000017960225,0.000072324234,0.00014626766,0.000051542782],"domain_scores_gemma":[0.9980896,0.0012287204,0.00017082831,0.00019356847,0.0002088964,0.000108296124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011672254,0.0005421837,0.0010659081,0.00054025074,0.00035624072,0.00095097005,0.001500978,0.0013523259,0.0028292574],"category_scores_gemma":[0.007852943,0.00047755515,0.0006574619,0.00043947413,0.0012924592,0.0018791452,0.0013427614,0.0017413417,0.00037335505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011373982,0.00005878827,0.0007320279,0.000107888896,0.00007821915,0.00008147432,0.00008702333,0.6139422,0.0013160153,0.36821178,0.0029614128,0.0123094255],"study_design_scores_gemma":[0.000006306149,0.000006749232,0.000079713434,0.0000054893585,0.0000042508095,0.00000796018,0.0000043167242,0.95841324,0.0001413559,0.04087219,0.00045208825,0.0000062735717],"about_ca_topic_score_codex":0.004875422,"about_ca_topic_score_gemma":0.004856917,"teacher_disagreement_score":0.004875422,"about_ca_system_score_codex":0.0009499146,"about_ca_system_score_gemma":0.0010432563,"threshold_uncertainty_score":0.009694099},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04312508995708945,"score_gpt":0.30252744251481944,"score_spread":0.25940235255773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963001956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003127737,0.00029930813,0.9958047,0.0000824569,0.000014824536,0.000017201306,0.000026767382,0.0001813852,0.00044568104],"genre_scores_gemma":[0.3390102,0.00097183435,0.655434,0.0003517224,0.00026488,0.00054528285,0.00076006906,0.0004952514,0.0021667886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966883,0.0019274879,0.00014160527,0.00046539237,0.0006256897,0.0001515699],"domain_scores_gemma":[0.9956175,0.0028847095,0.00028966754,0.00051711954,0.0005691745,0.00012176708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052522877,0.0019997528,0.0027027798,0.0016811892,0.00086111604,0.0016747909,0.0021704496,0.0020959906,0.0018144051],"category_scores_gemma":[0.013021459,0.0011693259,0.0017645118,0.0014780978,0.0011981643,0.002510317,0.0023024105,0.0030161706,0.00080906565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040772633,0.000030781084,0.0005023312,0.000045505636,0.0001409307,0.000024711273,0.000047930604,0.9349021,0.00083013787,0.012902674,0.0010482478,0.04948386],"study_design_scores_gemma":[0.0000041313074,0.000012005553,0.000054422468,0.000009124602,0.000011770942,0.000008313886,0.000004634007,0.9872247,0.00030424204,0.0119296955,0.00042906826,0.000007986889],"about_ca_topic_score_codex":0.0033728983,"about_ca_topic_score_gemma":0.0029253906,"teacher_disagreement_score":0.0052522877,"about_ca_system_score_codex":0.001128818,"about_ca_system_score_gemma":0.0013207846,"threshold_uncertainty_score":0.027777076},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04175902341515242,"score_gpt":0.29736944076871763,"score_spread":0.2556104173535652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963437270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0150369,0.0004085802,0.9818672,0.00020042792,0.0001219127,0.000084040345,0.000035256482,0.0004402206,0.001805525],"genre_scores_gemma":[0.81434983,0.00014282008,0.18253028,0.0002726714,0.00006013165,0.00019093913,0.000115177114,0.00007669919,0.002261473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990398,0.00035441297,0.00006389794,0.0001917184,0.0002497193,0.00010030368],"domain_scores_gemma":[0.9945697,0.0039750487,0.000328714,0.00041619022,0.00044056945,0.0002696925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031541125,0.0008672708,0.001187087,0.0003521859,0.00038948722,0.0010013717,0.0020299812,0.0015201783,0.0038520577],"category_scores_gemma":[0.011967219,0.00042734883,0.0005111022,0.00043423395,0.0012225646,0.0016814348,0.0016631442,0.0023946385,0.0005230919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005693145,0.00029013449,0.0013716241,0.00016541188,0.000083884006,0.00008796369,0.00008131689,0.848229,0.0017650869,0.021626385,0.0013684622,0.12436139],"study_design_scores_gemma":[0.00001291764,0.000041629988,0.000041364994,0.000004391926,0.0000039319248,0.000009207711,0.0000019637112,0.9969494,0.0004561492,0.00225368,0.00022153326,0.0000038650674],"about_ca_topic_score_codex":0.0028337608,"about_ca_topic_score_gemma":0.002731928,"teacher_disagreement_score":0.0038520577,"about_ca_system_score_codex":0.0009492963,"about_ca_system_score_gemma":0.0016424592,"threshold_uncertainty_score":0.016680777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2580744315264659,"score_gpt":0.41992824452670474,"score_spread":0.16185381300023882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963763058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092467025,0.00017814775,0.9982003,0.00010967099,0.000017099925,0.000010562471,0.000034110253,0.00006601854,0.00045942696],"genre_scores_gemma":[0.2183194,0.00209803,0.7729466,0.0005157907,0.0003588231,0.00028822405,0.00061265426,0.00022922731,0.0046312436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981488,0.0008430329,0.00007914521,0.00024328599,0.00061190856,0.00007383106],"domain_scores_gemma":[0.99598783,0.0025409,0.00038850636,0.0005672599,0.00040677062,0.00010875395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031742682,0.001260068,0.0010103432,0.0010535467,0.00042291384,0.001430013,0.0020188622,0.0013094716,0.0019547998],"category_scores_gemma":[0.011523282,0.00081259536,0.0014194268,0.0015210044,0.0014904623,0.002003627,0.0025545596,0.0028949457,0.00080364814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091416165,0.00006844325,0.0009202413,0.00031865074,0.00016624806,0.00018182113,0.0002053045,0.5484309,0.005116542,0.28455925,0.005191807,0.15474932],"study_design_scores_gemma":[0.000003836864,0.00001704659,0.00009440441,0.000012467058,0.000012482523,0.00005370554,0.000009232537,0.95610195,0.0007900503,0.04058154,0.002312242,0.000011133507],"about_ca_topic_score_codex":0.0020983627,"about_ca_topic_score_gemma":0.002319407,"teacher_disagreement_score":0.0031742682,"about_ca_system_score_codex":0.0005624273,"about_ca_system_score_gemma":0.0010647167,"threshold_uncertainty_score":0.01678735},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02908829838875739,"score_gpt":0.2972562858240615,"score_spread":0.2681679874353041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964434332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024030473,0.0003207396,0.96734846,0.00049133116,0.000072209885,0.00010256127,0.0001174013,0.00078470784,0.006732159],"genre_scores_gemma":[0.86821777,0.00031838776,0.12386676,0.00054154726,0.0001069012,0.00017203795,0.00026602368,0.00015455364,0.006356018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989737,0.00033896253,0.000031594314,0.00019780676,0.00031560214,0.0001424314],"domain_scores_gemma":[0.9972752,0.0017533929,0.00019951406,0.0005524317,0.0001392575,0.00008031921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010362857,0.0010597465,0.0010214502,0.0004652585,0.00047910147,0.0009486263,0.0012409757,0.0013475451,0.0042627417],"category_scores_gemma":[0.0053897672,0.00031614953,0.00058621145,0.00039181032,0.0014962736,0.0019518399,0.0024413501,0.002203305,0.00083102164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035175154,0.00016366041,0.0009163631,0.0001405031,0.000103663246,0.00030863273,0.000085966574,0.7764242,0.025695609,0.09586233,0.008232464,0.09171478],"study_design_scores_gemma":[0.000015013191,0.000067588844,0.00015827242,0.00000989516,0.000009810321,0.00011080283,0.000018395845,0.95943105,0.0047975047,0.03334489,0.0020238922,0.000012906632],"about_ca_topic_score_codex":0.0008388974,"about_ca_topic_score_gemma":0.0008412664,"teacher_disagreement_score":0.0042627417,"about_ca_system_score_codex":0.0007488971,"about_ca_system_score_gemma":0.0005245146,"threshold_uncertainty_score":0.014260292},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01385795714457307,"score_gpt":0.2940716380388189,"score_spread":0.28021368089424586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965103194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022240337,0.0004919016,0.99488765,0.00041295204,0.000040485167,0.000015544041,0.000098468365,0.000110676854,0.0017183583],"genre_scores_gemma":[0.44244215,0.0032225,0.53969145,0.000594425,0.0005680407,0.00043468064,0.00088625296,0.00033713746,0.011823378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984701,0.00074177026,0.000064746026,0.00023418407,0.00039088694,0.000098240525],"domain_scores_gemma":[0.99497896,0.0033525035,0.0005999545,0.00051183894,0.0004039807,0.00015273395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00415759,0.0014173493,0.0010939931,0.001621377,0.00063534355,0.0024219377,0.002307639,0.0024917687,0.0024349228],"category_scores_gemma":[0.011217566,0.000962554,0.0021906996,0.0013206267,0.0030188004,0.0037687456,0.0022244332,0.0030496335,0.00081919326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035010264,0.00002420169,0.0005744477,0.00008421441,0.00005958861,0.00010701796,0.00010249375,0.42625603,0.0008444329,0.5545405,0.0018536183,0.015518439],"study_design_scores_gemma":[0.000005659917,0.000010611555,0.00012916073,0.000012824258,0.000008128104,0.00004126308,0.000007013596,0.79938346,0.00018537538,0.19856645,0.0016376404,0.000012402438],"about_ca_topic_score_codex":0.0054876893,"about_ca_topic_score_gemma":0.0037790847,"teacher_disagreement_score":0.0054876893,"about_ca_system_score_codex":0.0021397348,"about_ca_system_score_gemma":0.0013206796,"threshold_uncertainty_score":0.021987677},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04868565856059613,"score_gpt":0.2873961231225094,"score_spread":0.23871046456191325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965108857","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006894329,0.041712258,0.7151399,0.16466823,0.008953167,0.00015861818,0.0016623843,0.0006738988,0.060137134],"genre_scores_gemma":[0.35002378,0.029614206,0.53215647,0.044092245,0.014776051,0.0010156876,0.0010049776,0.00096687535,0.02634967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874358,0.006229853,0.00065056275,0.0016374764,0.003711167,0.00033510223],"domain_scores_gemma":[0.9313373,0.050730012,0.0012192008,0.012122993,0.0040721577,0.0005184327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02135887,0.0012005183,0.0018150338,0.001830407,0.0022727686,0.005487385,0.0067654145,0.004771383,0.011725666],"category_scores_gemma":[0.11542667,0.00076593907,0.0011680907,0.0035678686,0.013850858,0.021072192,0.007137232,0.016282836,0.0029842474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009204546,0.00002655831,0.00023088534,0.0002696853,0.000059722577,0.00005158828,0.00012450044,0.0020388155,0.00014072504,0.9412077,0.023471761,0.03228589],"study_design_scores_gemma":[0.000023266108,0.00001439773,0.00007429691,0.00010454188,0.000012358528,0.00008354574,0.000038870276,0.0054230886,0.0003268017,0.97704417,0.016833946,0.000020676556],"about_ca_topic_score_codex":0.002518913,"about_ca_topic_score_gemma":0.0038156086,"teacher_disagreement_score":0.02135887,"about_ca_system_score_codex":0.0012433882,"about_ca_system_score_gemma":0.0026325777,"threshold_uncertainty_score":0.112957835},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0628719743448886,"score_gpt":0.3038967491543022,"score_spread":0.2410247748094136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966236725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031020625,0.015674155,0.88476217,0.017142,0.0007247548,0.00017191829,0.00089805876,0.0002106176,0.04939575],"genre_scores_gemma":[0.75688744,0.014399496,0.21403183,0.0031097452,0.0018312272,0.0004363429,0.0009882154,0.00014419771,0.0081714485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99386,0.0032775833,0.0005116569,0.00069333916,0.0010942623,0.0005630919],"domain_scores_gemma":[0.85362273,0.13753872,0.0030935525,0.0023300229,0.0023610094,0.0010538525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008772957,0.0012085255,0.0016171957,0.0028175067,0.0018804354,0.0035845763,0.0022063134,0.0033840053,0.0075461306],"category_scores_gemma":[0.06889155,0.0011562097,0.0020163879,0.003030855,0.0075132544,0.0121793235,0.0029161258,0.00657312,0.00064474565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005477062,0.000041241783,0.00064984086,0.00015809713,0.00009242943,0.0001442514,0.00023077748,0.024230259,0.0001262928,0.96244144,0.0024611042,0.009369564],"study_design_scores_gemma":[0.000008072237,0.000009217122,0.00008639553,0.000032347816,0.0000122213505,0.000021708163,0.0000220679,0.022049613,0.000046275076,0.97702277,0.0006806769,0.00000874847],"about_ca_topic_score_codex":0.009600471,"about_ca_topic_score_gemma":0.0074171936,"teacher_disagreement_score":0.009600471,"about_ca_system_score_codex":0.0034939344,"about_ca_system_score_gemma":0.0026476046,"threshold_uncertainty_score":0.046396375},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1217124348623598,"score_gpt":0.41820771941942625,"score_spread":0.2964952845570664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966820259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023734327,0.009264614,0.93889624,0.0037753796,0.0005817445,0.00026151078,0.0009438162,0.0007456971,0.021796653],"genre_scores_gemma":[0.7842795,0.00693384,0.189327,0.0023003917,0.0012896209,0.0009891106,0.0018066246,0.00071431213,0.01235958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929463,0.0034972695,0.00021356177,0.00079154037,0.0016446566,0.00090671825],"domain_scores_gemma":[0.91800827,0.07217471,0.0022077668,0.00312473,0.0028920614,0.0015925524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011824571,0.0030511823,0.0027045761,0.001869493,0.0012191655,0.0035492342,0.0041408055,0.0032414324,0.007954157],"category_scores_gemma":[0.07505142,0.00094159535,0.0012273688,0.0024635496,0.0031215616,0.006683354,0.0038672634,0.00670093,0.0012520005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009193343,0.00044478642,0.0012091431,0.0007956593,0.00024093383,0.00011728019,0.00019786722,0.73027986,0.001045647,0.18889764,0.018141365,0.057710506],"study_design_scores_gemma":[0.000044868404,0.000084160994,0.00029710346,0.00012216285,0.00004916536,0.000044691944,0.00003055627,0.86798793,0.00042251483,0.12956707,0.0013321164,0.000017677785],"about_ca_topic_score_codex":0.0035901282,"about_ca_topic_score_gemma":0.0036210127,"teacher_disagreement_score":0.011824571,"about_ca_system_score_codex":0.0045612333,"about_ca_system_score_gemma":0.0032219558,"threshold_uncertainty_score":0.06253499},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06484861329735347,"score_gpt":0.2932797702087032,"score_spread":0.22843115691134974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089522502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06311905,0.0006126682,0.92617625,0.0025344419,0.00011123529,0.00014349219,0.00062296377,0.0012037484,0.0054762084],"genre_scores_gemma":[0.9274425,0.00041811573,0.06491515,0.00050026685,0.00023967677,0.00018893316,0.0004773088,0.00018880655,0.005629258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933838,0.0028282772,0.00028035403,0.0013254504,0.0013984414,0.0007837576],"domain_scores_gemma":[0.96839774,0.023887344,0.0011454389,0.0043952237,0.0013063323,0.000867924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005638526,0.0012523297,0.0036942128,0.0016061785,0.00243866,0.004203555,0.0030094103,0.0024528904,0.0046248375],"category_scores_gemma":[0.03536738,0.0008966962,0.0011991274,0.0030008415,0.0036121428,0.006847827,0.007021779,0.00372237,0.0015081421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021532213,0.0002450774,0.002012902,0.00031748778,0.00021584556,0.00040566997,0.00055488024,0.31285062,0.0069406317,0.5490453,0.012738403,0.112519905],"study_design_scores_gemma":[0.00009628896,0.000063260624,0.0001770998,0.000016495045,0.000025824886,0.00009904723,0.00004252183,0.5700039,0.0018313162,0.42688796,0.0007240637,0.000032230808],"about_ca_topic_score_codex":0.0011978282,"about_ca_topic_score_gemma":0.0011712812,"teacher_disagreement_score":0.005638526,"about_ca_system_score_codex":0.0025644968,"about_ca_system_score_gemma":0.0030039002,"threshold_uncertainty_score":0.029819727},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03451898926511433,"score_gpt":0.2957511071451971,"score_spread":0.26123211788008277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089548822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140274195,0.00020846489,0.9835998,0.00019675454,0.000037689242,0.00004380046,0.000026254284,0.00034260904,0.0015173109],"genre_scores_gemma":[0.8231747,0.0001956484,0.17255744,0.0002789431,0.000056439563,0.0001921453,0.00016945979,0.00020832305,0.003166912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916196,0.00033342352,0.000042159434,0.00017202599,0.00020857132,0.000081834885],"domain_scores_gemma":[0.9963697,0.002504192,0.00037259655,0.0002939764,0.00029656876,0.00016296828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022324976,0.0010066902,0.0011540272,0.00057180406,0.00045947867,0.00093646295,0.0012012606,0.001405468,0.0016931817],"category_scores_gemma":[0.011412296,0.00054598576,0.0006003701,0.00045700872,0.0018532067,0.0014321029,0.0020701636,0.0024932458,0.0004611632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010559199,0.00006238483,0.00057914434,0.000056053606,0.000039922943,0.000047679816,0.000063781714,0.94112915,0.0014600838,0.021189235,0.0011646682,0.034102336],"study_design_scores_gemma":[0.000005127191,0.000016264914,0.000029074925,0.0000037982184,0.0000019619015,0.0000069695157,0.0000027873875,0.9945575,0.00026626902,0.0049690963,0.00013896187,0.0000022790666],"about_ca_topic_score_codex":0.0027084167,"about_ca_topic_score_gemma":0.0022417232,"teacher_disagreement_score":0.0027084167,"about_ca_system_score_codex":0.0010724049,"about_ca_system_score_gemma":0.0017058345,"threshold_uncertainty_score":0.011806667},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05566346586866754,"score_gpt":0.3117709213048471,"score_spread":0.2561074554361796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089673743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059137014,0.00044899207,0.99030113,0.0002781805,0.00003360998,0.00006957438,0.0002041853,0.00074388616,0.00200673],"genre_scores_gemma":[0.5025173,0.00091971894,0.48431414,0.001152638,0.00030946138,0.00075704686,0.0024111937,0.0009997346,0.006618893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761665,0.0011967465,0.00008272992,0.00047344205,0.00047563217,0.00015482819],"domain_scores_gemma":[0.993536,0.0046231695,0.00043581164,0.00069579034,0.00053587114,0.00017334695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051979693,0.0017724702,0.0019381025,0.0011465887,0.0005007295,0.0015464792,0.0034415252,0.0017883716,0.0037610857],"category_scores_gemma":[0.013992425,0.00081281847,0.0010790434,0.0010355366,0.0018643253,0.0025088917,0.0030020517,0.003904469,0.0010375179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000275939,0.0001409755,0.002724814,0.00024780296,0.00026234373,0.00016337716,0.00013142091,0.766364,0.0036652307,0.09171764,0.009724064,0.12458241],"study_design_scores_gemma":[0.0000054280094,0.000022404458,0.00019393241,0.000015342495,0.000008027987,0.000035586603,0.000005510849,0.98184824,0.00091895903,0.01621634,0.00071863167,0.000011526636],"about_ca_topic_score_codex":0.0028688796,"about_ca_topic_score_gemma":0.0035021254,"teacher_disagreement_score":0.0051979693,"about_ca_system_score_codex":0.0013254699,"about_ca_system_score_gemma":0.0017695113,"threshold_uncertainty_score":0.027489841},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Intrinsic motivation; Mathematical optimization; Mathematics; Psychology; Social psychology","score_opus":0.06927971827994504,"score_gpt":0.29235963903827544,"score_spread":0.22307992075833039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089723243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021368152,0.000311094,0.9715674,0.0010100041,0.00005280093,0.00005524568,0.000097249045,0.0001831777,0.005354892],"genre_scores_gemma":[0.72457635,0.00041939472,0.25656196,0.00049721595,0.00016654137,0.00055750366,0.00025693185,0.00021821812,0.016745811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847454,0.00059027213,0.00006842547,0.00030621194,0.0003546251,0.00020594694],"domain_scores_gemma":[0.9959875,0.0029452997,0.00026233165,0.0001900053,0.000333149,0.00028179822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030176812,0.0009159143,0.0024887554,0.0007877587,0.00057630986,0.0031767252,0.0026469724,0.004620814,0.0069547566],"category_scores_gemma":[0.007924285,0.001120555,0.00093357573,0.0011176021,0.0020491837,0.0034778013,0.0035940243,0.0036708764,0.0008517234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082819926,0.000074572315,0.00038005575,0.00010673295,0.000061186336,0.000064935906,0.000060347436,0.8974233,0.00059394195,0.08479225,0.0013347473,0.015025098],"study_design_scores_gemma":[0.000012480877,0.00001771422,0.000045352986,0.000007193823,0.000005565926,0.0000055256146,0.000004455778,0.98019385,0.000079625366,0.019401558,0.00022225764,0.0000043916284],"about_ca_topic_score_codex":0.0028970342,"about_ca_topic_score_gemma":0.0026254796,"teacher_disagreement_score":0.0069547566,"about_ca_system_score_codex":0.0022645914,"about_ca_system_score_gemma":0.001886153,"threshold_uncertainty_score":0.023266017},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027766262182025745,"score_gpt":0.29204230372859835,"score_spread":0.2642760415465726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090054376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008720832,0.00077610824,0.9860394,0.0012423707,0.00011842901,0.00004530296,0.00019262987,0.00022565517,0.0026392774],"genre_scores_gemma":[0.4044394,0.0013543427,0.57699883,0.0009622893,0.00079028815,0.0005696761,0.0010999446,0.00059094327,0.013194336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947732,0.0031855726,0.00025887112,0.0005834644,0.00091188744,0.0002869503],"domain_scores_gemma":[0.9810141,0.015739843,0.0005677806,0.0012371216,0.0009683618,0.00047292715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009830501,0.0018768733,0.0033845874,0.0016367611,0.0010674817,0.0042759827,0.0036804317,0.0045555127,0.00754812],"category_scores_gemma":[0.025946828,0.0021839058,0.0017095878,0.0027953084,0.0036767635,0.0070163123,0.0051919073,0.00486866,0.0007881859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002460523,0.00010636527,0.000430682,0.00021427093,0.0001578629,0.000056224286,0.00008412115,0.7030598,0.00037989471,0.2592361,0.0043493607,0.031679254],"study_design_scores_gemma":[0.00002200898,0.000016784814,0.00004819322,0.000017239105,0.0000130657445,0.00001233874,0.000006271638,0.87031955,0.00012686377,0.12884402,0.00056464475,0.000009010305],"about_ca_topic_score_codex":0.005267889,"about_ca_topic_score_gemma":0.004103299,"teacher_disagreement_score":0.009830501,"about_ca_system_score_codex":0.003008708,"about_ca_system_score_gemma":0.002611737,"threshold_uncertainty_score":0.051989317},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04116235678626784,"score_gpt":0.25221367207682416,"score_spread":0.21105131529055632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090228367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041531282,0.00011585336,0.9931405,0.00019133168,0.00002530901,0.000011021503,0.000027492484,0.00013803071,0.002197322],"genre_scores_gemma":[0.65415066,0.0008517821,0.32808894,0.0005574668,0.00021541488,0.0001782857,0.00024857765,0.0005019425,0.015206933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929965,0.00029537248,0.000025294526,0.00015879978,0.00017178246,0.00004914305],"domain_scores_gemma":[0.9984018,0.0011684297,0.000104600265,0.0001723942,0.00009851356,0.00005418161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016856464,0.0010423283,0.00065869745,0.00047701827,0.0003121414,0.00095617224,0.001099365,0.0011017082,0.0021601995],"category_scores_gemma":[0.005250606,0.00067917234,0.000854335,0.00040927686,0.0021981115,0.0017357111,0.0017788106,0.002595612,0.00046766608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037283986,0.000025499412,0.0002442059,0.000046987312,0.000042078605,0.00007046235,0.00008121165,0.6238079,0.003995813,0.34779757,0.0013648578,0.022486152],"study_design_scores_gemma":[0.0000025918803,0.000010219323,0.000041022216,0.000007021595,0.0000040252776,0.000014879084,0.000003502716,0.92858,0.0009333208,0.06968754,0.0007095595,0.0000063869034],"about_ca_topic_score_codex":0.002581399,"about_ca_topic_score_gemma":0.0028480322,"teacher_disagreement_score":0.002581399,"about_ca_system_score_codex":0.0012714505,"about_ca_system_score_gemma":0.0008420793,"threshold_uncertainty_score":0.00922513},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; BC Cancer Agency","funders":"","keywords":"Computer science","score_opus":0.1354467866766076,"score_gpt":0.3239428926810161,"score_spread":0.18849610600440853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090466896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03635912,0.000795395,0.95435405,0.0027149117,0.00019639036,0.00019226003,0.0009665557,0.0012812032,0.0031401115],"genre_scores_gemma":[0.834903,0.0006348884,0.15361983,0.0009085505,0.0004165165,0.00047907094,0.0016139875,0.000356997,0.007067122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9883456,0.0052532,0.0005823766,0.0016967574,0.003127524,0.00099452],"domain_scores_gemma":[0.9606337,0.023885338,0.0012351952,0.012232003,0.001186834,0.0008269676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01031636,0.0012280032,0.0033952761,0.0009825367,0.00153884,0.004550034,0.0032709904,0.0025717963,0.004692514],"category_scores_gemma":[0.037066925,0.0011705831,0.0021132857,0.0022017162,0.0032086754,0.008926692,0.008948136,0.0043170606,0.0011514605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00597604,0.00045994789,0.0024776172,0.000645083,0.00055763783,0.00094512897,0.00073194376,0.32862535,0.017425176,0.46065208,0.020434503,0.16106945],"study_design_scores_gemma":[0.00020822475,0.00017693153,0.00044950043,0.00004124,0.0000737675,0.0002830617,0.00008786882,0.6799432,0.007931264,0.30770734,0.0030488616,0.000048744274],"about_ca_topic_score_codex":0.0007831346,"about_ca_topic_score_gemma":0.0008495463,"teacher_disagreement_score":0.01031636,"about_ca_system_score_codex":0.0020490112,"about_ca_system_score_gemma":0.0027799373,"threshold_uncertainty_score":0.054558754},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04336867985110546,"score_gpt":0.2901535011615251,"score_spread":0.24678482131041965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090786554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004124463,0.00044444462,0.9933561,0.000557737,0.000035081546,0.000038415357,0.0001594278,0.00024308726,0.0010413736],"genre_scores_gemma":[0.54139256,0.0027214694,0.4415625,0.000995956,0.00038492098,0.00092750473,0.002182872,0.00040784513,0.009424348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980166,0.0010905382,0.00007013516,0.00037864107,0.0003276592,0.00011634471],"domain_scores_gemma":[0.989532,0.00856991,0.00058272266,0.0004933825,0.00064487377,0.00017707968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039059175,0.0011646288,0.0015230486,0.0019515668,0.0007609443,0.0015615218,0.003470254,0.0028683995,0.0034543986],"category_scores_gemma":[0.023865692,0.0010196252,0.0010209422,0.0024028781,0.0019819604,0.0039474536,0.0018783584,0.0037250163,0.0008127422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048696777,0.000037837082,0.0007447907,0.0001073591,0.000060494178,0.0000515007,0.00006373726,0.82139987,0.00024695075,0.13712825,0.002474076,0.037636418],"study_design_scores_gemma":[0.0000034950147,0.0000039206006,0.000065499196,0.0000068623744,0.000003969548,0.000006645408,0.000003598912,0.93317765,0.000045008568,0.06634862,0.0003299072,0.0000049350306],"about_ca_topic_score_codex":0.012335315,"about_ca_topic_score_gemma":0.016459605,"teacher_disagreement_score":0.012335315,"about_ca_system_score_codex":0.003089213,"about_ca_system_score_gemma":0.0017171215,"threshold_uncertainty_score":0.024527013},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09722466294154446,"score_gpt":0.28411242239710377,"score_spread":0.1868877594555593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091221243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009587938,0.00013280529,0.9885352,0.0001745007,0.000025153862,0.000026953823,0.00016229477,0.00041572505,0.0009394343],"genre_scores_gemma":[0.7548983,0.00033062085,0.23221567,0.00034133682,0.00016107458,0.000302959,0.0012688778,0.00035055538,0.010130645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934226,0.00023878687,0.000026956914,0.00021552609,0.00011410864,0.00006238152],"domain_scores_gemma":[0.99765885,0.0014206328,0.00027082214,0.00036005134,0.0001864951,0.00010318281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629793,0.0009828527,0.0010576199,0.0005774359,0.00032198709,0.0008079034,0.0020821968,0.0011409471,0.0035352916],"category_scores_gemma":[0.004312427,0.0007109244,0.0009965568,0.000573729,0.0013591395,0.0013954273,0.0015391426,0.002001533,0.0007949909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009259264,0.0000482416,0.0011048643,0.00008037311,0.000066206,0.000104676845,0.000117922114,0.90649915,0.0025560276,0.041825436,0.0023470283,0.045157503],"study_design_scores_gemma":[0.000003518337,0.000008768184,0.00007260042,0.000004118031,0.0000036661338,0.000016028627,0.0000032433095,0.9889755,0.00033120034,0.010217409,0.00036015027,0.0000038069222],"about_ca_topic_score_codex":0.0025292845,"about_ca_topic_score_gemma":0.0060077882,"teacher_disagreement_score":0.0035352916,"about_ca_system_score_codex":0.00078224594,"about_ca_system_score_gemma":0.0007889125,"threshold_uncertainty_score":0.011826754},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04810708885814038,"score_gpt":0.32039773356764245,"score_spread":0.2722906447095021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183287321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094949646,0.00009290121,0.9976585,0.000082928505,0.000014060699,0.000017944674,0.00016890251,0.00057593227,0.0004392848],"genre_scores_gemma":[0.22516182,0.00082282507,0.76281416,0.0002982961,0.00019777362,0.00033007175,0.0025037066,0.0007226929,0.0071486714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992624,0.0002147041,0.000033987355,0.00020668676,0.00021075262,0.00007149991],"domain_scores_gemma":[0.99884737,0.00052333024,0.00015078619,0.0002170021,0.00018358072,0.0000779403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001422262,0.0011588372,0.00086508325,0.0014948886,0.0004936417,0.001192468,0.0023855565,0.0013668701,0.003604295],"category_scores_gemma":[0.004761787,0.0009331137,0.0016164406,0.001222231,0.0010518983,0.0023078332,0.0020472002,0.0026292745,0.0013780023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014708619,0.0000855898,0.00100483,0.0001527265,0.00011621734,0.00013807089,0.00014582885,0.6756638,0.0063993405,0.13168828,0.009947472,0.17451084],"study_design_scores_gemma":[0.000005520464,0.000009174526,0.00008493474,0.000008220511,0.0000063028006,0.000037457332,0.0000043466284,0.96916616,0.0005943452,0.0281473,0.0019292373,0.0000069835532],"about_ca_topic_score_codex":0.006338528,"about_ca_topic_score_gemma":0.010815332,"teacher_disagreement_score":0.006338528,"about_ca_system_score_codex":0.0012393389,"about_ca_system_score_gemma":0.0012337539,"threshold_uncertainty_score":0.012603283},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03679210610531011,"score_gpt":0.2756887765513355,"score_spread":0.2388966704460254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183593932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004605682,0.00015706092,0.99365073,0.00006935608,0.00003850056,0.0000328546,0.000049551665,0.00056551234,0.0008307873],"genre_scores_gemma":[0.20166461,0.00028305285,0.79192424,0.0001862308,0.00010791069,0.00037953112,0.0008758756,0.0004185957,0.004159969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905604,0.00030917404,0.000044965316,0.00021428504,0.00025560736,0.000119866345],"domain_scores_gemma":[0.9988488,0.0005591948,0.00007885478,0.00017277016,0.0002758662,0.000064504966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010313075,0.0013426833,0.0019162374,0.00082919124,0.0006041365,0.0011995089,0.0015736918,0.001020814,0.0027074327],"category_scores_gemma":[0.0048094355,0.00070937927,0.00086815015,0.0014229476,0.00085278193,0.0010041317,0.0016306466,0.0012609786,0.0013745879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020936115,0.000065096494,0.0009879543,0.00015030973,0.00008011199,0.00012086045,0.00010492229,0.69858146,0.0047376603,0.03130374,0.012225329,0.2514332],"study_design_scores_gemma":[0.000016211825,0.000021952092,0.00007547929,0.0000034267468,0.000004293662,0.000020112106,0.000006630523,0.99406993,0.00057764404,0.0041964306,0.0010031962,0.0000046998794],"about_ca_topic_score_codex":0.005922697,"about_ca_topic_score_gemma":0.005265528,"teacher_disagreement_score":0.005922697,"about_ca_system_score_codex":0.0008068567,"about_ca_system_score_gemma":0.0016789584,"threshold_uncertainty_score":0.011776447},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05836014756836001,"score_gpt":0.32275409738340266,"score_spread":0.26439394981504266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184302936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08944411,0.0006533541,0.90395945,0.0009463128,0.00003906128,0.000090269976,0.0005708079,0.0010608084,0.0032358135],"genre_scores_gemma":[0.8567128,0.00035346055,0.13948083,0.0003330635,0.00012095638,0.0002146455,0.0012612939,0.00045773442,0.0010651808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990298,0.0026241534,0.00054131285,0.002222119,0.0034410518,0.00087352726],"domain_scores_gemma":[0.8608825,0.10470001,0.010275956,0.013270704,0.009048479,0.0018223079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012793548,0.0010908087,0.0019050146,0.002139059,0.0015388166,0.0053589735,0.0035524482,0.002890103,0.0039894334],"category_scores_gemma":[0.12325603,0.001233248,0.0016207132,0.001525692,0.0044437996,0.007848712,0.007319223,0.0036817887,0.0010887142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018302705,0.00017464721,0.03449829,0.000674856,0.00020855055,0.0012427343,0.0027334508,0.47854394,0.014201572,0.3409552,0.0064246026,0.11851196],"study_design_scores_gemma":[0.00005055386,0.00012786718,0.0026650582,0.00012335792,0.00004492971,0.00037230938,0.00026237356,0.7213654,0.015749129,0.2562139,0.002967632,0.000057607875],"about_ca_topic_score_codex":0.002629122,"about_ca_topic_score_gemma":0.0016518444,"teacher_disagreement_score":0.012793548,"about_ca_system_score_codex":0.0020844026,"about_ca_system_score_gemma":0.002311049,"threshold_uncertainty_score":0.06765962},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03181191723208893,"score_gpt":0.2972237819968313,"score_spread":0.2654118647647424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185541071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049283657,0.0005257522,0.9467129,0.00032517564,0.000051359984,0.00008450114,0.000059103248,0.0011314718,0.0018261482],"genre_scores_gemma":[0.89965385,0.00018314556,0.09770652,0.00023767319,0.000039733914,0.0001477966,0.00011470098,0.00011249329,0.0018040608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986381,0.00059898506,0.000064091655,0.00029651797,0.00022719715,0.00017518285],"domain_scores_gemma":[0.99600005,0.002854253,0.0002896045,0.00030199578,0.00031748795,0.00023660016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035245605,0.001447765,0.0017417886,0.0006059097,0.0004881209,0.0010266951,0.002157267,0.0018580519,0.0021478473],"category_scores_gemma":[0.010889275,0.00088425033,0.0008115894,0.00052260427,0.001693613,0.0021679353,0.002774528,0.0031755855,0.00044007465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015351675,0.00009070586,0.0005535864,0.000049423357,0.000042847558,0.000047103735,0.000100465724,0.9580431,0.0007348411,0.006849368,0.00052537164,0.03280957],"study_design_scores_gemma":[0.00001191632,0.000024089426,0.000040343773,0.0000048328734,0.0000040403315,0.000004863537,0.0000046084997,0.99402606,0.00029880315,0.0054463395,0.00012949306,0.0000045979723],"about_ca_topic_score_codex":0.007612758,"about_ca_topic_score_gemma":0.0061775222,"teacher_disagreement_score":0.007612758,"about_ca_system_score_codex":0.0017019169,"about_ca_system_score_gemma":0.0016000636,"threshold_uncertainty_score":0.018639863},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06076316977610513,"score_gpt":0.3316740532104062,"score_spread":0.2709108834343011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9932698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018666958,0.00031697107,0.9776177,0.00044228762,0.00001983315,0.00012885022,0.00011256472,0.00027109,0.002423646],"genre_scores_gemma":[0.72220886,0.0005815595,0.27363673,0.0003022779,0.00006794183,0.00059048145,0.00035680362,0.00013881378,0.0021166543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9872334,0.008725257,0.00060061825,0.0009218833,0.0019952029,0.00052365195],"domain_scores_gemma":[0.96617883,0.02893035,0.0018995128,0.0013410148,0.0009995678,0.0006508022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011433134,0.0015079252,0.0015770271,0.00082163914,0.0006791665,0.002103598,0.0011756781,0.0017245708,0.0027358113],"category_scores_gemma":[0.041986015,0.0009217853,0.0012498028,0.0009218327,0.0017412058,0.0026677358,0.0025535296,0.003180852,0.00040626316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003249433,0.0001318848,0.00071712554,0.00020349641,0.000063731844,0.00010459884,0.00022319166,0.87428635,0.0016521846,0.09275765,0.0008459125,0.028688956],"study_design_scores_gemma":[0.00003686524,0.000060655544,0.0001073743,0.000023787328,0.000009743308,0.000018610837,0.000015950924,0.92830133,0.00085179973,0.07011199,0.00044815795,0.000013751724],"about_ca_topic_score_codex":0.002232675,"about_ca_topic_score_gemma":0.0023373375,"teacher_disagreement_score":0.011433134,"about_ca_system_score_codex":0.0031546152,"about_ca_system_score_gemma":0.002566503,"threshold_uncertainty_score":0.06046492},"labels":[],"label_agreement":null}]}