{"meta":{"query_hash":"a4b9ff0d8edb","filters":{"venue":"International Conference on Machine Learning"},"cohort_total":127,"direct_labels_cover":0,"predictions_cover":127,"exported":127,"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/a4b9ff0d8edb","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Machine+Learning"},"results":[{"id":"W13294968","doi":"10.1016/0021-8707(56)90033-8","title":"Toward Off-Policy Learning Control with Function Approximation","year":2010,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":175,"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":"Temporal difference learning; Function approximation; Approximation algorithm; Function (biology); Computer science; Linear approximation; Bellman equation; Optimal control; Extension (predicate logic); Mathematical optimization; Control (management); Artificial intelligence; Mathematics; Reinforcement learning; Artificial neural network; Nonlinear system","score_opus":0.022667319724685036,"score_gpt":0.27060077476957206,"score_spread":0.24793345504488704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13294968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010637496,0.0000060764123,0.93269134,0.004855052,0.0006330823,0.00018600453,0.0000011222951,0.00046299314,0.050526842],"genre_scores_gemma":[0.98772514,0.00001586709,0.0078101256,0.000462858,0.0003230211,0.000028780556,0.00005251193,0.000026189013,0.0035555132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978631,0.00015633852,0.00032513146,0.00049073703,0.0008307642,0.0003339077],"domain_scores_gemma":[0.9986272,0.00016847801,0.00036972738,0.0003038158,0.00041494818,0.000115861614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050584465,0.00026501218,0.00020328785,0.00041778525,0.00027424985,0.0006056678,0.00091474684,0.00011294749,0.00034063842],"category_scores_gemma":[0.0006329065,0.00023052351,0.00006914238,0.000303596,0.0000715315,0.00073665293,0.00014165201,0.0017606268,0.00027020022],"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.0001057528,0.00003190959,0.009701381,0.0000085443735,0.00006762356,0.0000094324505,0.00039676926,0.51574236,0.003923931,0.4264555,0.00001624982,0.04354053],"study_design_scores_gemma":[0.001065407,0.0005315858,0.0034238668,0.000040017156,0.000009685872,0.00003256329,0.000048973256,0.97862613,0.00018851185,0.0009824905,0.014780527,0.0002702108],"about_ca_topic_score_codex":0.00008420838,"about_ca_topic_score_gemma":0.000015204975,"teacher_disagreement_score":0.9770876,"about_ca_system_score_codex":0.0000818189,"about_ca_system_score_gemma":0.00016840616,"threshold_uncertainty_score":0.94004756},"labels":[],"label_agreement":null},{"id":"W1498573925","doi":"","title":"Alpha-Beta Divergences Discover Micro and Macro Structures in Data","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Neural Network Applications","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":"University of Toronto","funders":"","keywords":"Computer science; Divergence (linguistics); Visualization; Curse of dimensionality; Code (set theory); Macro; Grid; Dimensionality reduction; Data mining; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics","score_opus":0.10355522355114569,"score_gpt":0.3555235215195316,"score_spread":0.25196829796838593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498573925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3966115,0.0010893136,0.53175956,0.03938197,0.0020004287,0.0006597716,0.00016789815,0.0004626233,0.027866954],"genre_scores_gemma":[0.98519516,0.000106721025,0.013749366,0.00026175767,0.00007431246,0.000007648327,0.000085438536,0.0000069780544,0.0005126122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987705,0.00007302746,0.00018485611,0.0005019458,0.0003045212,0.00016518513],"domain_scores_gemma":[0.99925655,0.00009459283,0.00010642535,0.00038571452,0.000072448085,0.00008427431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018880778,0.00013140753,0.00011343161,0.00011018802,0.000071747265,0.00020191279,0.0015656105,0.00003191978,0.000050125145],"category_scores_gemma":[0.0001024211,0.00011538538,0.000013120323,0.00016034057,0.000057794063,0.0007243117,0.0010435845,0.0003329847,0.000027990745],"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.000056301666,0.00006651987,0.109865665,0.000005824758,0.000035163546,0.000040456624,0.0008427181,0.014673553,0.001960789,0.78518206,0.00082069257,0.08645025],"study_design_scores_gemma":[0.0006284204,0.00007112574,0.028611558,0.000037999453,0.0000037823243,0.000030953586,0.00008919864,0.88821834,0.00037192102,0.06176902,0.01985446,0.0003132069],"about_ca_topic_score_codex":0.0001541283,"about_ca_topic_score_gemma":0.0001815113,"teacher_disagreement_score":0.8735448,"about_ca_system_score_codex":0.000033035525,"about_ca_system_score_gemma":0.000049095783,"threshold_uncertainty_score":0.47052792},"labels":[],"label_agreement":null},{"id":"W151435321","doi":"","title":"Gaussian Processes for Bayesian Estimation in Ordinary Differential Equations","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":48,"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é Laval","funders":"","keywords":"Ode; Ordinary differential equation; Gaussian process; Applied mathematics; Estimation theory; Consistency (knowledge bases); Computer science; Gaussian; Mathematics; Bayesian probability; Mathematical optimization; Bayes estimator; Algorithm; Differential equation; Artificial intelligence; Mathematical analysis","score_opus":0.023736395395733804,"score_gpt":0.2975774090199679,"score_spread":0.2738410136242341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151435321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014839738,0.000013793854,0.9813843,0.0067064073,0.0003017181,0.00020052049,0.000007663622,0.00015098619,0.009750665],"genre_scores_gemma":[0.9683072,0.0000134959,0.030609757,0.00020795738,0.000089252535,0.000102783815,0.000085689164,0.000015364163,0.0005685281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984414,0.00009031457,0.0003579594,0.00050375634,0.00031666012,0.00028991894],"domain_scores_gemma":[0.9988862,0.00034336146,0.00020867628,0.00022377635,0.00025354358,0.00008442188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025956286,0.00021471542,0.00020168387,0.00034747226,0.00018376275,0.0004503442,0.0009396891,0.00010741846,0.00013866636],"category_scores_gemma":[0.001033554,0.00019900559,0.000055291173,0.00032611878,0.00003576624,0.00062498683,0.00012585023,0.00043735234,0.000034721783],"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.000039748207,0.00012371741,0.0029422005,0.000068661684,0.000015424792,0.0000025440277,0.00033112292,0.00588294,0.00028374346,0.8954255,0.000033388464,0.094850995],"study_design_scores_gemma":[0.000570042,0.00023878807,0.0032983024,0.00015021213,0.0000040026794,0.0000055130636,0.000015758455,0.93016815,0.00015281988,0.06431135,0.000858661,0.0002264072],"about_ca_topic_score_codex":0.00004867083,"about_ca_topic_score_gemma":0.000091730886,"teacher_disagreement_score":0.9668232,"about_ca_system_score_codex":0.000061799365,"about_ca_system_score_gemma":0.00014815076,"threshold_uncertainty_score":0.81152123},"labels":[],"label_agreement":null},{"id":"W159954324","doi":"","title":"Memory (and Time) Efficient Sequential Monte Carlo","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":9,"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; Particle filter; Resampling; Monte Carlo method; Algorithm; Consistency (knowledge bases); Mathematical optimization; Mathematics; Artificial intelligence; Statistics","score_opus":0.06628095819075386,"score_gpt":0.36787102704167385,"score_spread":0.30159006885092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159954324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45056525,0.000027545006,0.2512763,0.002175441,0.00072045455,0.00025102764,0.00004083226,0.0002557561,0.29468736],"genre_scores_gemma":[0.9721881,0.000006439506,0.024015088,0.0001502763,0.00013680778,0.0000090863,0.000005750597,0.000018182616,0.0034702567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986795,0.0002628038,0.00024396201,0.0002800511,0.00035820983,0.00017548159],"domain_scores_gemma":[0.9986833,0.00081929687,0.00012298183,0.00013042304,0.00015342636,0.000090576286],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061899354,0.00015808384,0.00020129865,0.000088398105,0.00010428755,0.000101008955,0.00020271662,0.00005625725,0.0017957113],"category_scores_gemma":[0.0026971335,0.00013497268,0.0000449056,0.000041896357,0.00007524649,0.00003179796,0.000104215425,0.00039663145,0.00013679352],"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.00006093797,0.000059265814,0.0005239565,0.000019981668,0.000041135638,0.000006778787,0.00029665368,0.0011261153,0.0021513943,0.93070006,0.00011146241,0.064902246],"study_design_scores_gemma":[0.0004328652,0.00016447584,0.0007128768,0.00008775946,0.000016737837,0.00001132891,0.00003692718,0.92437917,0.0003720665,0.072180875,0.0014129829,0.00019192992],"about_ca_topic_score_codex":0.00008665,"about_ca_topic_score_gemma":0.0000051418356,"teacher_disagreement_score":0.92325306,"about_ca_system_score_codex":0.000032485677,"about_ca_system_score_gemma":0.00002099251,"threshold_uncertainty_score":0.9991168},"labels":[],"label_agreement":null},{"id":"W1665214252","doi":"","title":"Rectified Linear Units Improve Restricted Boltzmann Machines","year":2010,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":13244,"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":"Boltzmann machine; Binary number; Sigmoid function; Computer science; Object (grammar); Restricted Boltzmann machine; Artificial intelligence; Inference; Pattern recognition (psychology); Feature (linguistics); Cognitive neuroscience of visual object recognition; Algorithm; Mathematics; Computer vision; Deep learning; Arithmetic; Artificial neural network","score_opus":0.030533236294757893,"score_gpt":0.2802265611432088,"score_spread":0.24969332484845091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1665214252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10440882,0.000044288812,0.7450849,0.015189621,0.009762648,0.00042329723,0.000039293125,0.0008622767,0.124184854],"genre_scores_gemma":[0.97803795,0.00002627783,0.016512038,0.00033972718,0.00059237494,0.000013599578,0.000044118613,0.000017379267,0.0044165053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842155,0.00015838347,0.00026699845,0.00050016714,0.00039541378,0.00025746354],"domain_scores_gemma":[0.9986144,0.00018710236,0.00018516486,0.0003522319,0.0005506591,0.000110465066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740815,0.00022271085,0.00017597836,0.00020673791,0.00024472238,0.0003454382,0.001088244,0.00009961436,0.00042081857],"category_scores_gemma":[0.0009773418,0.00019422048,0.000062610794,0.00035811414,0.00005108504,0.00043651185,0.00025742993,0.001087475,0.00015122343],"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.00015175609,0.00017945268,0.005260977,0.000008153805,0.00016905165,0.00007258736,0.00069586537,0.012411369,0.32190645,0.31747374,0.00095649785,0.3407141],"study_design_scores_gemma":[0.00037227027,0.00013386956,0.0021948107,0.00001802524,0.00000494069,0.0000103993225,0.000015074661,0.97019696,0.005083253,0.0017974592,0.01992706,0.00024584675],"about_ca_topic_score_codex":0.0003264335,"about_ca_topic_score_gemma":0.00013868164,"teacher_disagreement_score":0.9577856,"about_ca_system_score_codex":0.000023607301,"about_ca_system_score_gemma":0.00010137367,"threshold_uncertainty_score":0.79200816},"labels":[],"label_agreement":null},{"id":"W18175453","doi":"10.1525/tph.2007.29.3.87","title":"Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs","year":2002,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":54,"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":"Reinforcement learning; Oracle; Computer science; Planner; Mathematical optimization; Linear programming; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.08004596865886063,"score_gpt":0.30279357989068106,"score_spread":0.22274761123182044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18175453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057143345,0.000014727539,0.987839,0.002149628,0.00035961941,0.00036370195,0.000002186419,0.00052545033,0.008174283],"genre_scores_gemma":[0.9196168,0.000042376407,0.07337959,0.00031144742,0.00007037633,0.00011604885,0.000169501,0.000030056608,0.0062638135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976214,0.00014916097,0.0005450438,0.00055479276,0.00071786327,0.00041171358],"domain_scores_gemma":[0.99870545,0.0002293574,0.00034783393,0.00028010056,0.0003419766,0.000095302836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000438578,0.00029395375,0.00024929846,0.0005202671,0.00021891529,0.0003912879,0.000911106,0.0001116512,0.0002661272],"category_scores_gemma":[0.00054680335,0.0003073795,0.00010631567,0.0002961423,0.000034319975,0.0008108103,0.00013799655,0.00076965353,0.00009174106],"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.000023887576,0.000040291096,0.00070953934,0.0000086507,0.00001967703,0.000004901631,0.0006396675,0.94885665,0.00029066316,0.015777815,0.000049801616,0.03357848],"study_design_scores_gemma":[0.0012978452,0.0003495623,0.000111078654,0.000091775226,0.0000043547525,0.0000013693992,0.000040475945,0.9944002,0.00031586937,0.0007590117,0.0023073454,0.00032110055],"about_ca_topic_score_codex":0.00004275498,"about_ca_topic_score_gemma":0.00000992181,"teacher_disagreement_score":0.9190453,"about_ca_system_score_codex":0.00025770417,"about_ca_system_score_gemma":0.000068969945,"threshold_uncertainty_score":0.99993783},"labels":[],"label_agreement":null},{"id":"W1838099784","doi":"","title":"A New Generalized Error Path Algorithm for Model Selection","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","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":"Western University","funders":"","keywords":"Hyperparameter optimization; Piecewise; Regularization (linguistics); Model selection; Algorithm; Computer science; Path (computing); Generalization; Mathematics; Mathematical optimization; Quadratic equation; Search algorithm; Support vector machine; Artificial intelligence","score_opus":0.06930398399980568,"score_gpt":0.3347133790024918,"score_spread":0.2654093950026861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838099784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007351845,0.000031824922,0.9868674,0.0039465744,0.0007201189,0.00016477978,0.000009145319,0.00039163767,0.0071333153],"genre_scores_gemma":[0.1637632,0.000011869205,0.8110051,0.00058750773,0.0005693449,0.00004632817,0.0000909978,0.00003157275,0.023894044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820787,0.0001180803,0.00027343055,0.000531718,0.0005652516,0.00030363337],"domain_scores_gemma":[0.99891114,0.00006488723,0.00018982356,0.0001910877,0.0003999311,0.00024310066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050398736,0.00023399472,0.00020774303,0.00021565963,0.00016382021,0.00036152886,0.0008303205,0.000082237944,0.000083330575],"category_scores_gemma":[0.00024571802,0.00021760279,0.00010840238,0.00018525455,0.00001498269,0.00037270208,0.00015261189,0.00051363406,0.00007543872],"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.000055283825,0.0000674566,0.00048367566,0.0000043123478,0.000057017896,0.0000061320497,0.0007213937,0.19178021,0.00037192632,0.2314277,0.0025630945,0.5724618],"study_design_scores_gemma":[0.0013774137,0.00029672455,0.000037612466,0.000024750643,0.000005825107,0.000020614743,0.000019253735,0.9677219,0.00011514176,0.01713383,0.0129971765,0.00024976613],"about_ca_topic_score_codex":0.00036168037,"about_ca_topic_score_gemma":0.000015215367,"teacher_disagreement_score":0.77594167,"about_ca_system_score_codex":0.00011177992,"about_ca_system_score_gemma":0.00033191286,"threshold_uncertainty_score":0.8873584},"labels":[],"label_agreement":null},{"id":"W1849431564","doi":"","title":"Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning in Bioinformatics","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal; Université Laval; Institute for Research in Immunology and Cancer","funders":"","keywords":"String (physics); Kernel (algebra); String kernel; Heuristic; Computer science; Computational complexity theory; Function (biology); String metric; Task (project management); Upper and lower bounds; Image (mathematics); Algorithm; Edit distance; String searching algorithm; Artificial intelligence; Mathematics; Kernel method; Discrete mathematics; Radial basis function kernel; Support vector machine; Pattern matching","score_opus":0.03432492016534133,"score_gpt":0.312296814030021,"score_spread":0.2779718938646797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849431564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6601422,0.0005577947,0.31357342,0.0033727435,0.0004230306,0.0019844573,0.0002499469,0.00006486139,0.019631559],"genre_scores_gemma":[0.9773134,0.00011911789,0.020972494,0.000045369423,0.00016867399,0.00005154649,0.00013570584,0.000014852312,0.0011788481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988926,0.00010430738,0.00038408823,0.00018340423,0.00029743343,0.00013816987],"domain_scores_gemma":[0.99894226,0.000100969875,0.0003911855,0.00016090393,0.00036506332,0.000039615774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000941585,0.00014088892,0.00016024582,0.000051709718,0.000090633446,0.000058609934,0.00033701374,0.00007134229,0.00001388511],"category_scores_gemma":[0.0003372309,0.00009013448,0.00007251252,0.000047228445,0.00016304433,0.00001715357,0.00018047249,0.00028291694,7.972075e-7],"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.0049890648,0.00026920234,0.10166664,0.00060056936,0.001598424,0.000001808789,0.0076163164,0.30177197,0.15466024,0.28680587,0.000853445,0.13916646],"study_design_scores_gemma":[0.0035547626,0.0007849873,0.0044236183,0.00013470124,0.00005812391,0.000020215597,0.00044016913,0.9640597,0.013234589,0.0016322815,0.01147042,0.00018640065],"about_ca_topic_score_codex":0.0001513086,"about_ca_topic_score_gemma":0.000012413147,"teacher_disagreement_score":0.6622878,"about_ca_system_score_codex":0.000013110256,"about_ca_system_score_gemma":0.00007081931,"threshold_uncertainty_score":0.36755776},"labels":[],"label_agreement":null},{"id":"W1865403236","doi":"","title":"Atomic Spatial Processes","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Bayesian Methods and Mixture Models","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":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Data mining; Process (computing); Spatial analysis; Grid; Bayesian probability; Data modeling; Data science; Artificial intelligence; Geography; Remote sensing; Database","score_opus":0.06616046280778096,"score_gpt":0.32998526289528973,"score_spread":0.26382480008750875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1865403236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002791246,0.00004386309,0.9200253,0.003253451,0.00052394974,0.000053608117,0.000002013257,0.00015552198,0.07315104],"genre_scores_gemma":[0.9126914,0.000019190427,0.084721334,0.0004248096,0.00016065864,0.000008861506,0.000010401118,0.000008769254,0.001954574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883807,0.00012032879,0.00016073562,0.0003193398,0.00039907702,0.0001624324],"domain_scores_gemma":[0.9992028,0.000063921216,0.00010150452,0.00017538683,0.00033759384,0.00011880261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037432957,0.0001302248,0.000119606775,0.00011798777,0.000060918595,0.00024251308,0.00083548384,0.000046869358,0.000090211535],"category_scores_gemma":[0.00040344775,0.00011261934,0.00003284277,0.00012563968,0.000023112581,0.00030494752,0.00017518245,0.000332287,0.00015410532],"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.00003743529,0.000052744028,0.002349755,0.000007668642,0.000023291124,0.00002652207,0.00081159075,0.0003383241,0.0003066658,0.7932025,0.0002612661,0.20258224],"study_design_scores_gemma":[0.0006502636,0.00020522528,0.00039731248,0.00005680305,0.0000035600672,0.00003737304,0.000021580976,0.84056824,0.0009629703,0.13775288,0.01907226,0.00027153507],"about_ca_topic_score_codex":0.00014804519,"about_ca_topic_score_gemma":0.000033409524,"teacher_disagreement_score":0.9099001,"about_ca_system_score_codex":0.000047933576,"about_ca_system_score_gemma":0.0002199927,"threshold_uncertainty_score":0.45924833},"labels":[],"label_agreement":null},{"id":"W1868011046","doi":"","title":"On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 Alberta","funders":"","keywords":"Oracle; Set (abstract data type); Exploit; Computer science; Quality (philosophy); Mathematical optimization; Identification (biology); Mathematics; Theoretical computer science","score_opus":0.2028115132751566,"score_gpt":0.4445514399849025,"score_spread":0.2417399267097459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868011046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50949216,0.00016323851,0.39912227,0.009497384,0.008801813,0.0011662252,0.0002092891,0.00022951039,0.07131813],"genre_scores_gemma":[0.9897661,0.000025478492,0.000817506,0.00013926766,0.0001284566,0.000018721268,0.000065547174,0.000023146542,0.009015755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493396,0.00048428826,0.00057738303,0.0006533775,0.0030107673,0.0003402196],"domain_scores_gemma":[0.997745,0.0011603558,0.00027490445,0.0003532257,0.0002714167,0.00019511371],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016355048,0.00022705608,0.00027176848,0.00073072565,0.00014941688,0.0005032125,0.0011643206,0.000107949294,0.0016811783],"category_scores_gemma":[0.0049131964,0.00019496451,0.000077282835,0.00040373305,0.00010573858,0.00045952376,0.0003149684,0.0010775878,0.0015184749],"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.00048788093,0.00035023468,0.014524391,0.0000021834078,0.000061284074,0.00008246332,0.00076442247,0.80529636,0.0014042042,0.14921935,0.00019615423,0.027611068],"study_design_scores_gemma":[0.0034075317,0.00046799303,0.024563571,0.000094313924,0.0000042222923,0.000008363375,0.0009916004,0.4997863,0.00037042773,0.4645422,0.0053773746,0.00038610245],"about_ca_topic_score_codex":0.00012002351,"about_ca_topic_score_gemma":0.00017232313,"teacher_disagreement_score":0.480274,"about_ca_system_score_codex":0.00038164438,"about_ca_system_score_gemma":0.00012872416,"threshold_uncertainty_score":0.99925894},"labels":[],"label_agreement":null},{"id":"W1870822514","doi":"","title":"A Deeper Look at Planning as Learning from Replay","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":41,"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":"Reinforcement learning; Computer science; Bellman equation; Markov decision process; Function (biology); Temporal difference learning; Markov chain; Equivalence (formal languages); Artificial intelligence; Markov process; Machine learning; Mathematical optimization; Mathematics","score_opus":0.07534542055669481,"score_gpt":0.32282196044179445,"score_spread":0.24747653988509966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870822514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085250124,0.00010536725,0.71848,0.0023775126,0.0013323702,0.00015749675,0.0000020100417,0.00070919713,0.19158591],"genre_scores_gemma":[0.96582514,0.000018343011,0.009287778,0.00067788095,0.00022936612,0.000014469501,0.00012833592,0.0000344765,0.023784235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969473,0.0002907915,0.00043635795,0.00072363636,0.001187111,0.00041481585],"domain_scores_gemma":[0.9982561,0.00031494442,0.00038280064,0.00043335106,0.00035027793,0.000262551],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061218033,0.0003173217,0.00026410123,0.0002656038,0.0002931421,0.00057634694,0.0014803634,0.00012629616,0.0008789888],"category_scores_gemma":[0.0014174223,0.00031214432,0.000097391036,0.00019141447,0.000060399667,0.000606096,0.00087858655,0.0012340683,0.0022255785],"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.00008889432,0.000021960512,0.054060034,0.0000023733392,0.000075939504,0.00011787117,0.0025145896,0.89241874,0.000575754,0.047108695,0.00032438236,0.0026907728],"study_design_scores_gemma":[0.00084878283,0.00037126968,0.0013105155,0.00011994465,0.000008131918,0.000040813404,0.00025496454,0.9564802,0.00037145996,0.0024312336,0.037385754,0.00037694414],"about_ca_topic_score_codex":0.00035314524,"about_ca_topic_score_gemma":0.000010044379,"teacher_disagreement_score":0.880575,"about_ca_system_score_codex":0.0003370574,"about_ca_system_score_gemma":0.0001619256,"threshold_uncertainty_score":0.99993306},"labels":[],"label_agreement":null},{"id":"W2127099514","doi":"","title":"Large-Scale Learning of Embeddings with Reconstruction Sampling","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":34,"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","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Vocabulary; Estimator; Context (archaeology); Sampling (signal processing); Artificial neural network; Scale (ratio); Encoder; Computer vision; Mathematics","score_opus":0.05268136800075558,"score_gpt":0.28672302850387354,"score_spread":0.23404166050311798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127099514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20851511,0.000009490717,0.7598861,0.00016015343,0.00030861486,0.000053189582,0.0000012228511,0.00013700087,0.030929107],"genre_scores_gemma":[0.89712477,0.000014257027,0.10211979,0.000041111358,0.000046354184,0.0000054942616,0.0000057943876,0.000011105201,0.0006313499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986982,0.0000787962,0.00027607026,0.00038046303,0.000360605,0.00020588121],"domain_scores_gemma":[0.9991653,0.000054493783,0.00027604724,0.00019270828,0.00025512686,0.00005629988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035839688,0.00014387823,0.00016440554,0.0002057377,0.00012423379,0.00007742404,0.00059593096,0.00005407136,0.00037032747],"category_scores_gemma":[0.000100172496,0.00012944732,0.000049520753,0.00013782195,0.000036674326,0.0004175194,0.0001561264,0.0005539918,0.000025541589],"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.00016761417,0.00014342353,0.18816273,0.00003087159,0.00012193922,0.000017410648,0.014609922,0.025445297,0.0050708354,0.6290587,0.0000044458397,0.13716681],"study_design_scores_gemma":[0.0004402932,0.00023113318,0.002643672,0.0001775786,0.0000056135336,0.000053799988,0.0006614334,0.9902681,0.0015129329,0.003189974,0.0006219773,0.00019349993],"about_ca_topic_score_codex":0.00010556535,"about_ca_topic_score_gemma":0.000023849321,"teacher_disagreement_score":0.96482277,"about_ca_system_score_codex":0.000039250783,"about_ca_system_score_gemma":0.000048625177,"threshold_uncertainty_score":0.52787083},"labels":[],"label_agreement":null},{"id":"W2143797877","doi":"","title":"Deep Supervised t-Distributed Embedding","year":2010,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":48,"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":"Embedding; Computer science; Deep learning; Pairwise comparison; Scalability; Artificial intelligence; Parametric statistics; Visualization; Architecture; Class (philosophy); Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.025390876167961204,"score_gpt":0.2998689291950903,"score_spread":0.2744780530271291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143797877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17424186,0.000011519012,0.7691483,0.007726395,0.002218793,0.00013157904,0.000014869638,0.00054469646,0.04596199],"genre_scores_gemma":[0.9863181,0.000011470227,0.012586348,0.00036172578,0.0001125302,0.000012315026,0.00013445801,0.000008302804,0.00045472066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998889,0.00005821056,0.000179575,0.00032277545,0.0003597666,0.00019066654],"domain_scores_gemma":[0.99932516,0.0000860778,0.00008881592,0.00020354186,0.00020696699,0.00008944586],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019855883,0.00013367605,0.00010331468,0.00014517206,0.00016221181,0.00032970912,0.0007950383,0.00007442766,0.0016057218],"category_scores_gemma":[0.0002470365,0.00012181908,0.000057892117,0.00012230813,0.000024476249,0.00041822818,0.00017419226,0.0007327054,0.0004689711],"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.00008613299,0.00024810908,0.012829677,0.000013948206,0.0000809393,0.000084545274,0.001127937,0.009942995,0.22069417,0.48138854,0.0008038251,0.27269918],"study_design_scores_gemma":[0.0003431037,0.000047716512,0.001063094,0.000028843928,0.0000017675171,0.000015160619,0.000041376297,0.98490125,0.0025396827,0.0037229697,0.007136445,0.00015856828],"about_ca_topic_score_codex":0.00004195211,"about_ca_topic_score_gemma":0.000028709399,"teacher_disagreement_score":0.9749583,"about_ca_system_score_codex":0.000018535462,"about_ca_system_score_gemma":0.000033202283,"threshold_uncertainty_score":0.9993069},"labels":[],"label_agreement":null},{"id":"W2160142299","doi":"","title":"Unsupervised Models of Images by Spike-and-Slab RBMs","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":70,"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","funders":"","keywords":"Spike (software development); Slab; Computer science; Feature (linguistics); Pattern recognition (psychology); Variable (mathematics); Artificial intelligence; Binary number; Boltzmann machine; Latent variable; Algorithm; Mathematics; Artificial neural network; Physics; Mathematical analysis; Arithmetic","score_opus":0.05242372225847681,"score_gpt":0.2522785329033527,"score_spread":0.19985481064487592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160142299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011673698,0.00014304237,0.92363876,0.0009805403,0.00023450304,0.000079758036,0.000013941892,0.000066498185,0.06316923],"genre_scores_gemma":[0.97993004,0.00013050086,0.018868644,0.00013664321,0.000032021664,0.000005127274,0.00000963408,0.000007972974,0.00087939936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901503,0.00010142666,0.00020134871,0.00029453135,0.0002471265,0.00014054617],"domain_scores_gemma":[0.9994254,0.00005777407,0.00012196654,0.00016089622,0.00017761826,0.00005631435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019463105,0.0001342887,0.00015328219,0.000091454545,0.00006972663,0.00008252784,0.0005786429,0.000038381837,0.00031132082],"category_scores_gemma":[0.000060204653,0.00011758075,0.000047259084,0.0000800624,0.000060413524,0.00046354407,0.00018624293,0.00020402613,0.000015407999],"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.00014568286,0.00031009523,0.00931099,0.000021241109,0.00023140808,0.00002309845,0.0039989688,0.011914638,0.07563404,0.68205816,0.00092596066,0.2154257],"study_design_scores_gemma":[0.0003151338,0.00015310086,0.0010091081,0.000036061872,0.000005206787,0.00000354299,0.00004738686,0.9725039,0.014893559,0.010380817,0.00049378956,0.00015837648],"about_ca_topic_score_codex":0.00034217662,"about_ca_topic_score_gemma":0.0000059572612,"teacher_disagreement_score":0.96825635,"about_ca_system_score_codex":0.000012524991,"about_ca_system_score_gemma":0.000023650846,"threshold_uncertainty_score":0.47948036},"labels":[],"label_agreement":null},{"id":"W2182286517","doi":"","title":"From PAC-Bayes Bounds to Quadratic Programs for Majority Votes","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":49,"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é Laval","funders":"","keywords":"Margin (machine learning); Upper and lower bounds; AdaBoost; Bayes' theorem; Mathematics; Quadratic equation; Divergence (linguistics); Minification; Basis (linear algebra); Combinatorics; Computer science; Algorithm; Support vector machine; Mathematical optimization; Artificial intelligence; Machine learning; Bayesian probability","score_opus":0.06972141086261915,"score_gpt":0.3134253480200855,"score_spread":0.24370393715746633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182286517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05630509,0.000034787274,0.9169764,0.005460813,0.0014530824,0.00040945667,0.000027958737,0.0005904781,0.018741962],"genre_scores_gemma":[0.8879699,0.0000040987175,0.109022,0.0003937655,0.0003454701,0.00009038131,0.00009203155,0.000020391057,0.0020619398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981223,0.0001341149,0.00031001103,0.0006408662,0.0004492788,0.00034345256],"domain_scores_gemma":[0.9988821,0.00018271946,0.00017055773,0.0003363873,0.00025726322,0.00017096219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039674024,0.00025472415,0.00023221137,0.000189253,0.00026632493,0.0004973503,0.0013160167,0.00007458041,0.0003608845],"category_scores_gemma":[0.00041476748,0.00022953683,0.00011680214,0.00017996377,0.00003725841,0.00031369325,0.00024449895,0.00050406123,0.00021287966],"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.00017302098,0.00040781745,0.038920976,0.00002153853,0.00017820533,0.000030639258,0.0085861925,0.000525916,0.000992944,0.33154696,0.000374139,0.61824167],"study_design_scores_gemma":[0.0007776839,0.0010102855,0.008348304,0.00015128298,0.000013458714,0.000008487855,0.00019147558,0.9140614,0.0007030532,0.05402113,0.020160574,0.0005528086],"about_ca_topic_score_codex":0.0022505547,"about_ca_topic_score_gemma":0.00013447063,"teacher_disagreement_score":0.91353554,"about_ca_system_score_codex":0.00005053839,"about_ca_system_score_gemma":0.00006611843,"threshold_uncertainty_score":0.936024},"labels":[],"label_agreement":null},{"id":"W2186489521","doi":"","title":"Unsupervised and Transfer Learning Challenge: a Deep Learning Approach","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":147,"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","funders":"","keywords":"Transfer of learning; Artificial intelligence; Computer science; Unsupervised learning; Machine learning; Deep learning; Classifier (UML); Competitive learning; Semi-supervised learning; Task (project management)","score_opus":0.0682199232260771,"score_gpt":0.27585786633346404,"score_spread":0.20763794310738692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186489521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045805752,0.00034404232,0.68026674,0.0020917878,0.00034231294,0.00026783123,0.0000032075463,0.0010388391,0.2698395],"genre_scores_gemma":[0.9862804,0.0005298889,0.010840925,0.00013475915,0.00009749596,0.00003988918,0.00012802261,0.00003608911,0.0019125326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715424,0.0005618029,0.00039660707,0.0009030992,0.0005834399,0.0004008299],"domain_scores_gemma":[0.99898803,0.00013604281,0.00014955757,0.0003325549,0.00020738639,0.00018641134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077486504,0.00035293621,0.000288451,0.00037103632,0.00046186257,0.00036831183,0.0010747812,0.00014705723,0.0004336042],"category_scores_gemma":[0.00034596745,0.000335998,0.00009186747,0.0002487408,0.00008940664,0.0006760344,0.00026845405,0.001887527,0.0001337852],"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.00013261013,0.00027770153,0.03456064,0.000046567624,0.00011664683,0.000029889601,0.011220337,0.005042204,0.0011375237,0.6160211,0.0000068806703,0.3314079],"study_design_scores_gemma":[0.0008469226,0.00047786618,0.014396212,0.000055538865,0.000013642693,0.00004396171,0.000521393,0.97175664,0.000077721415,0.0013413602,0.0100187715,0.00044996353],"about_ca_topic_score_codex":0.00020913212,"about_ca_topic_score_gemma":0.000018280902,"teacher_disagreement_score":0.96671444,"about_ca_system_score_codex":0.00004985772,"about_ca_system_score_gemma":0.000044134566,"threshold_uncertainty_score":0.9999092},"labels":[],"label_agreement":null},{"id":"W2211963773","doi":"","title":"Risk Bounds and Learning Algorithms for the Regression Approach to Structured Output Prediction","year":2013,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"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é Laval","funders":"","keywords":"Quadratic equation; Regression; Kernel (algebra); Upper and lower bounds; Computer science; Regular polygon; Regression analysis; Mathematics; Algorithm; Mathematical optimization; Machine learning; Statistics; Discrete mathematics","score_opus":0.028572190901835257,"score_gpt":0.28665109385407767,"score_spread":0.2580789029522424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211963773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017749155,0.00009455124,0.9670653,0.005143903,0.0008865549,0.0005788834,0.000015556112,0.00034836022,0.008117737],"genre_scores_gemma":[0.937653,0.00006899268,0.05557142,0.00029915082,0.00038915436,0.00017331034,0.000058051177,0.000025407913,0.0057614828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789757,0.00030963586,0.00029371897,0.00064549316,0.0005334018,0.0003202011],"domain_scores_gemma":[0.9985824,0.0004443478,0.00025090695,0.00028165127,0.0002941422,0.0001465287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007834213,0.00026859,0.00019999298,0.00020961283,0.0009519275,0.0009558805,0.0008946776,0.0000925113,0.00006205396],"category_scores_gemma":[0.00085226266,0.00017954873,0.00008300974,0.00018904835,0.00005418146,0.00038954968,0.00032008288,0.0012824856,0.00004132946],"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.000045265973,0.000057864298,0.01545799,0.000014960244,0.00011028301,0.000001275658,0.0025135544,0.056136884,0.00039945633,0.037561167,0.0006175518,0.88708377],"study_design_scores_gemma":[0.00048414597,0.00028354116,0.026445797,0.000040300318,0.000010453699,0.000018672006,0.00020605193,0.95121986,0.00003648074,0.0017630729,0.019295054,0.00019657586],"about_ca_topic_score_codex":0.0005516317,"about_ca_topic_score_gemma":0.000005614138,"teacher_disagreement_score":0.9199039,"about_ca_system_score_codex":0.000039421404,"about_ca_system_score_gemma":0.000036710222,"threshold_uncertainty_score":0.92175776},"labels":[],"label_agreement":null},{"id":"W2294277889","doi":"","title":"Tensor Analyzers","year":2013,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"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":"Multilinear map; Generalization; Tensor (intrinsic definition); Artificial intelligence; Computer science; Latent variable; Face (sociological concept); Factor (programming language); Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.0714223381075099,"score_gpt":0.36052847844171104,"score_spread":0.2891061403342011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294277889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51164275,0.00001035465,0.014846375,0.027835794,0.0002749444,0.00041967756,0.000024441293,0.0005594555,0.44438618],"genre_scores_gemma":[0.98316526,0.000009562835,0.005293561,0.00045801225,0.000078486984,0.00005912606,0.000042551426,0.000015852229,0.010877597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917895,0.000048710193,0.0002007583,0.00019556744,0.0002460564,0.00012996615],"domain_scores_gemma":[0.99931926,0.00013905679,0.000111110574,0.00014219606,0.00021932584,0.00006903819],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008693984,0.00011307263,0.00011170403,0.000119399214,0.0001061393,0.00012563221,0.00025019774,0.000039097486,0.013875776],"category_scores_gemma":[0.00017897479,0.000099206954,0.000064587024,0.0000786949,0.000030637104,0.00010992372,0.000037008587,0.00030385418,0.0017466629],"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.0000103856255,0.00011024127,0.0058013895,0.0000047551316,0.000056198987,0.0000027009507,0.00014054474,0.00013974674,0.0057790885,0.9754585,0.003766986,0.008729438],"study_design_scores_gemma":[0.0012509762,0.00017828877,0.025398895,0.00011376602,0.000036612648,0.000042058826,0.0006419148,0.37371072,0.0012616955,0.5497018,0.046980675,0.00068260595],"about_ca_topic_score_codex":0.00008305275,"about_ca_topic_score_gemma":0.000008156733,"teacher_disagreement_score":0.47152248,"about_ca_system_score_codex":0.00003559681,"about_ca_system_score_gemma":0.000012733302,"threshold_uncertainty_score":0.9990306},"labels":[],"label_agreement":null},{"id":"W2398823745","doi":"","title":"A Generative Process for Contractive Auto-Encoders.","year":2012,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Process (computing); Generative grammar; Artificial intelligence; Programming language","score_opus":0.057069992015881,"score_gpt":0.3567650522907404,"score_spread":0.2996950602748594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398823745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012660503,0.00004996311,0.9716182,0.0025512553,0.00036489172,0.00017925478,0.000005352551,0.00036496503,0.023600094],"genre_scores_gemma":[0.93499887,0.00001734193,0.06322317,0.00053888315,0.00017426217,0.00006815662,0.000027312228,0.000009932876,0.00094205665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989663,0.00008764117,0.00018025095,0.00026203372,0.00026074378,0.00024302493],"domain_scores_gemma":[0.9991067,0.00015474205,0.00017426677,0.0001243972,0.0003618855,0.00007798348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456335,0.00014185728,0.00013038135,0.0001340374,0.00018182698,0.00017009585,0.0005765414,0.000054245,0.00006551972],"category_scores_gemma":[0.0002806457,0.00013090327,0.00005645919,0.00010005895,0.000025075029,0.0005631443,0.00007488852,0.00027767487,0.000025604986],"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.00008955638,0.0002531403,0.0045325,0.000012689136,0.00010964025,0.0000028118611,0.00408162,0.044041198,0.0012155136,0.9049813,0.00055094523,0.040129054],"study_design_scores_gemma":[0.00032103952,0.00012031676,0.00030478404,0.000027206619,0.0000030435242,0.000006894106,0.000046898596,0.9862464,0.0025036277,0.00624557,0.0040012393,0.00017296555],"about_ca_topic_score_codex":0.000013388169,"about_ca_topic_score_gemma":0.0000013859906,"teacher_disagreement_score":0.9422052,"about_ca_system_score_codex":0.000049797127,"about_ca_system_score_gemma":0.000063182364,"threshold_uncertainty_score":0.533808},"labels":[],"label_agreement":null},{"id":"W2406745441","doi":"","title":"Analyzing open data from the city of Montreal","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Data Mining Algorithms and Applications","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":true,"ca_institutions":"McGill University","funders":"","keywords":"Open data; Computer science; Context (archaeology); Data science; World Wide Web; Geography","score_opus":0.19996737314698346,"score_gpt":0.38267936776752587,"score_spread":0.1827119946205424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406745441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031448096,0.00010096577,0.86676365,0.019509707,0.00047296105,0.00022810418,0.00065990916,0.00011928701,0.08069731],"genre_scores_gemma":[0.96830136,0.000016987018,0.030354615,0.00016422934,0.0000893187,0.000007200419,0.00055589963,0.000004748581,0.00050567155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990058,0.00008359161,0.00018755221,0.00034543732,0.0002858287,0.00009181012],"domain_scores_gemma":[0.99863225,0.0001876271,0.00017017676,0.0007873936,0.00016613501,0.000056418896],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005871278,0.00008151814,0.00010744891,0.000035473637,0.00008907314,0.000432956,0.006340155,0.00002111688,0.000094952964],"category_scores_gemma":[0.00034291856,0.00005892809,0.000017608923,0.0001342773,0.00003545637,0.0005901197,0.0027986488,0.00024131396,0.000048077993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050800973,0.00021914003,0.090433635,0.000001697194,0.00018743637,0.000010088263,0.0017196678,0.0012219715,0.0003605481,0.33684886,0.006027878,0.5629183],"study_design_scores_gemma":[0.0002868879,0.000036678754,0.016875403,0.000028076183,0.000005296465,0.000001887597,0.000099320765,0.9624803,0.000046148176,0.0072619794,0.012794989,0.00008302078],"about_ca_topic_score_codex":0.010485795,"about_ca_topic_score_gemma":0.00050524424,"teacher_disagreement_score":0.96125835,"about_ca_system_score_codex":0.000019421137,"about_ca_system_score_gemma":0.00010113031,"threshold_uncertainty_score":0.999036},"labels":[],"label_agreement":null},{"id":"W2559780085","doi":"","title":"Proceedings of the 3rd International Workshop on Evaluation Methods for Machine Learning","year":2008,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":3,"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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.14147653804815027,"score_gpt":0.41304350251220384,"score_spread":0.2715669644640536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559780085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10273777,0.00013752237,0.7568947,0.024003768,0.0038054192,0.0014737828,0.00001787248,0.00040258255,0.1105266],"genre_scores_gemma":[0.9642351,0.00007072191,0.030863928,0.00035441638,0.00018384604,0.00011096578,0.000027645636,0.000025374253,0.0041279728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972736,0.00022169405,0.00053162937,0.00059736444,0.0010772805,0.00029843382],"domain_scores_gemma":[0.9969671,0.00067193975,0.0005564182,0.00023216137,0.0015005813,0.000071830385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019573637,0.00025733165,0.00023888283,0.00033853765,0.00044241894,0.0002052828,0.0020086009,0.00010161634,0.00031783717],"category_scores_gemma":[0.0038693277,0.00020870667,0.00018898532,0.00038946344,0.00011395973,0.0005664131,0.00036849326,0.00082177756,0.00004148905],"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.00026706283,0.00024743777,0.0105567565,0.000017334218,0.0001499766,0.0000029899218,0.0033519776,0.04081494,0.019976169,0.67654705,0.00020881118,0.24785948],"study_design_scores_gemma":[0.00038099717,0.00021102624,0.0013626548,0.0001366114,0.000010888449,0.000019456158,0.00019334898,0.9548531,0.018577846,0.01161255,0.012424967,0.00021653004],"about_ca_topic_score_codex":0.00008332481,"about_ca_topic_score_gemma":0.000012780162,"teacher_disagreement_score":0.9140382,"about_ca_system_score_codex":0.00021559946,"about_ca_system_score_gemma":0.00013740333,"threshold_uncertainty_score":0.8510811},"labels":[],"label_agreement":null},{"id":"W2740120517","doi":"","title":"Learning Latent Space Models with Angular Constraints","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":17,"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; Space (punctuation); Artificial intelligence","score_opus":0.06111164871674642,"score_gpt":0.29273717667035065,"score_spread":0.23162552795360425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740120517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048544157,0.000025028736,0.58111477,0.011518435,0.00047879652,0.00017697808,0.000006773609,0.00040870975,0.35772637],"genre_scores_gemma":[0.9711512,0.000051525116,0.025162885,0.00017584527,0.00006049692,0.000010674552,0.000011030096,0.0000137744055,0.00336258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856126,0.00010406215,0.00016560503,0.00042151252,0.00051818206,0.00022936375],"domain_scores_gemma":[0.99892944,0.00007979475,0.00027329137,0.00034898517,0.0002617833,0.0001066748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030802275,0.00017572852,0.00016740727,0.00014466676,0.0005328725,0.0009642037,0.0011659858,0.000057304114,0.00064709026],"category_scores_gemma":[0.00023533592,0.0001539553,0.00006441435,0.000043258733,0.00013328699,0.0006860836,0.00021310263,0.00055734307,0.00021709235],"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.000048327267,0.000060352195,0.008896877,0.000004779106,0.000089098765,0.0001621635,0.00043494668,0.003625212,0.00067311374,0.4549626,0.000021077962,0.5310214],"study_design_scores_gemma":[0.0006048146,0.0001897262,0.004134073,0.0001378378,0.0000061941464,0.00006769738,0.00007926946,0.98597264,0.0008415968,0.005985197,0.0017111134,0.00026982525],"about_ca_topic_score_codex":0.000106817955,"about_ca_topic_score_gemma":0.000024599427,"teacher_disagreement_score":0.9823474,"about_ca_system_score_codex":0.000044348075,"about_ca_system_score_gemma":0.00006668504,"threshold_uncertainty_score":0.9297838},"labels":[],"label_agreement":null},{"id":"W2740643007","doi":"","title":"Deep Spectral Clustering Learning.","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":107,"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":"Cluster analysis; Artificial intelligence; Computer science; Deep learning; Pattern recognition (psychology)","score_opus":0.0414787561868741,"score_gpt":0.3124472869121453,"score_spread":0.2709685307252712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740643007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060460288,0.000029849743,0.6153849,0.010953402,0.0018953576,0.00013429612,0.0000020522016,0.00046557843,0.31067428],"genre_scores_gemma":[0.9897862,0.00005794819,0.0051904344,0.00020117399,0.00016933167,0.000009265249,0.000017529783,0.000010947762,0.004557151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987642,0.000078353085,0.00017572627,0.00037339894,0.00038134088,0.00022696947],"domain_scores_gemma":[0.9991737,0.000050342584,0.00023670771,0.00032822997,0.00012835456,0.00008266364],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022599442,0.00015174631,0.0001254084,0.00012524992,0.0006683317,0.0010714692,0.0014113741,0.000059093927,0.000670843],"category_scores_gemma":[0.0003406496,0.00014172975,0.000070930095,0.000027438426,0.00004169036,0.00073023676,0.00044433607,0.0006470701,0.00059446535],"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.00016397733,0.00018574459,0.052264445,0.000024880615,0.00012828443,0.00021844584,0.001875025,0.042022064,0.015350864,0.23596396,0.00033739884,0.65146494],"study_design_scores_gemma":[0.00039221763,0.000114392074,0.008352347,0.00008260497,0.000002198789,0.000017526638,0.000036776262,0.9800685,0.00075912307,0.003233257,0.0067495103,0.00019156713],"about_ca_topic_score_codex":0.00012600211,"about_ca_topic_score_gemma":0.000047783138,"teacher_disagreement_score":0.9380464,"about_ca_system_score_codex":0.00003937172,"about_ca_system_score_gemma":0.000026279951,"threshold_uncertainty_score":0.9999655},"labels":[],"label_agreement":null},{"id":"W2740764198","doi":"","title":"Adapting Kernel Representations Online Using Submodular Maximization","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","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":"Submodular set function; Computer science; Kernel (algebra); Maximization; Artificial intelligence; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.08188702752310942,"score_gpt":0.35447475725112726,"score_spread":0.2725877297280178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740764198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045255475,0.000021087046,0.92788446,0.005787937,0.00059815816,0.000105834515,0.000013295443,0.00017632295,0.0201574],"genre_scores_gemma":[0.94981503,0.00004118955,0.048767086,0.00014802424,0.00015924362,0.0000053089416,0.000043202806,0.000014439794,0.0010064644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984256,0.000071257135,0.00029432838,0.00050432637,0.00046480633,0.00023966863],"domain_scores_gemma":[0.9984419,0.000047261103,0.00048154945,0.0005940154,0.00034771813,0.0000875604],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022653994,0.00018256456,0.00015533397,0.00016915757,0.0008118201,0.001349424,0.0018104936,0.000063960746,0.00020111694],"category_scores_gemma":[0.00059843814,0.00017901012,0.00006609837,0.00009332204,0.00006397936,0.0011546845,0.00045116665,0.0004259051,0.000046292284],"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.000044363394,0.00018620535,0.059770767,0.00002176141,0.00007911052,0.000086563974,0.0006416642,0.030915339,0.004433374,0.8214109,0.000031198357,0.08237877],"study_design_scores_gemma":[0.000312516,0.000046131532,0.02268019,0.00010187118,0.0000055038377,0.000026045558,0.00005791793,0.96492875,0.00026841107,0.010908083,0.00046096955,0.00020361601],"about_ca_topic_score_codex":0.00041959752,"about_ca_topic_score_gemma":0.000058301226,"teacher_disagreement_score":0.9340134,"about_ca_system_score_codex":0.00006216693,"about_ca_system_score_gemma":0.00010784496,"threshold_uncertainty_score":0.99968725},"labels":[],"label_agreement":null},{"id":"W2803299525","doi":"","title":"Inductive Two-layer Modeling with Parametric Bregman Transfer.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks and Applications","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":"University of Waterloo","funders":"","keywords":"Parametric statistics; Layer (electronics); Computer science; Transfer (computing); Mathematics; Materials science; Statistics; Parallel computing","score_opus":0.06569738614582407,"score_gpt":0.31988227408625663,"score_spread":0.2541848879404326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803299525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17190316,0.000008447658,0.80579215,0.002633511,0.00015010765,0.00010157151,0.000002008206,0.00013976354,0.019269254],"genre_scores_gemma":[0.9913773,0.000012794989,0.0075561963,0.00038519103,0.0002404608,0.000024070194,0.00000918832,0.000012212875,0.00038260993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987806,0.000056798563,0.00017023085,0.0004265534,0.00036044596,0.00020534638],"domain_scores_gemma":[0.9992969,0.00005873569,0.00005206474,0.00022444993,0.0002924209,0.000075447315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013222585,0.00015354154,0.00011771724,0.00017965634,0.00021844982,0.00024765625,0.0007606925,0.00003520118,0.00013178657],"category_scores_gemma":[0.000020650128,0.0001227118,0.000038849666,0.00041072306,0.000056893703,0.0003392248,0.000085467764,0.00045103286,0.000113819086],"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.000046336678,0.00007241132,0.0014622153,0.0000016339661,0.00004592706,0.0000083838195,0.00035714908,0.058759224,0.0016449302,0.8877893,0.00002138207,0.049791124],"study_design_scores_gemma":[0.00035289556,0.00024089514,0.00025480194,0.000032012726,0.0000039671127,0.000015480184,0.000024190585,0.9922039,0.00045986375,0.0053827628,0.00086227746,0.000166978],"about_ca_topic_score_codex":0.00015576485,"about_ca_topic_score_gemma":0.00005865074,"teacher_disagreement_score":0.9334447,"about_ca_system_score_codex":0.000036105263,"about_ca_system_score_gemma":0.000042048276,"threshold_uncertainty_score":0.5004042},"labels":[],"label_agreement":null},{"id":"W2803832867","doi":"","title":"Mutual Information Neural Estimation.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":598,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Mutual information; Estimation; Artificial intelligence; Artificial neural network; Engineering","score_opus":0.02579097961051308,"score_gpt":0.29717562734481257,"score_spread":0.2713846477342995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803832867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01976282,0.000006215474,0.8918799,0.013013562,0.00077393686,0.00013624832,0.0000062145223,0.00037054933,0.07405051],"genre_scores_gemma":[0.9884647,0.0000059158424,0.009562886,0.0010736939,0.000189444,0.00001599719,0.00004940679,0.0000041823187,0.00063373666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914324,0.0000375602,0.00019980244,0.00017850261,0.0002963802,0.00014449446],"domain_scores_gemma":[0.99934936,0.000051223105,0.0001256545,0.00018296466,0.00023465669,0.000056132805],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011769671,0.000104360166,0.000070017464,0.000118253476,0.00021030213,0.00038591455,0.00068471034,0.00003267532,0.0002986764],"category_scores_gemma":[0.000079110214,0.000094443385,0.000034047305,0.00017303957,0.00004651835,0.0010282475,0.00014691267,0.0002530058,0.00095979514],"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.000011798975,0.00001975319,0.0005908247,0.0000013759147,0.00000948362,0.0000012782768,0.00027522226,0.007351965,0.00019929533,0.75541013,0.00074015686,0.23538871],"study_design_scores_gemma":[0.00015713862,0.00010503597,0.0012993435,0.000010820413,0.0000011901734,0.000010499536,0.000010273189,0.9711389,0.00016097062,0.004739468,0.02226378,0.00010257978],"about_ca_topic_score_codex":0.000029344748,"about_ca_topic_score_gemma":0.000006884477,"teacher_disagreement_score":0.9687019,"about_ca_system_score_codex":0.000027722002,"about_ca_system_score_gemma":0.000025463494,"threshold_uncertainty_score":0.9998181},"labels":[],"label_agreement":null},{"id":"W2804682296","doi":"","title":"Spotlight: Optimizing Device Placement for Training Deep Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":57,"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; Artificial neural network; Training (meteorology); Artificial intelligence","score_opus":0.06539351812044211,"score_gpt":0.3354566578305311,"score_spread":0.270063139710089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804682296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039765383,0.000031059077,0.98414755,0.0039384705,0.00073861773,0.0002696709,0.0000030624267,0.00029915725,0.0065958514],"genre_scores_gemma":[0.90344155,0.00001794919,0.0944009,0.0010112704,0.0005806795,0.00015311541,0.00003776797,0.000023073817,0.00033368688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983739,0.00006610631,0.00030624066,0.00055919745,0.0003097847,0.00038476582],"domain_scores_gemma":[0.99880844,0.0002837137,0.00021380286,0.0002788994,0.00030758628,0.00010755488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025693484,0.0002154832,0.00016909065,0.0001369606,0.00041725536,0.00025335856,0.0010950738,0.00005093175,0.00011645531],"category_scores_gemma":[0.00011547109,0.00021102278,0.000077261444,0.00023287398,0.000063673644,0.00047081956,0.00023019292,0.00040114947,0.00003996157],"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.00007930863,0.000037231122,0.00027912526,0.0000033825856,0.00003975934,0.0000047722842,0.0008218033,0.4728996,0.0005599742,0.32268628,0.000060655024,0.2025281],"study_design_scores_gemma":[0.00040731908,0.00023437294,0.0001543893,0.000026220478,0.000004943297,0.000013757499,0.000072020346,0.98748326,0.00017710791,0.0019177524,0.009287211,0.00022162804],"about_ca_topic_score_codex":0.000007850728,"about_ca_topic_score_gemma":0.000028828697,"teacher_disagreement_score":0.899465,"about_ca_system_score_codex":0.00007996264,"about_ca_system_score_gemma":0.000025970825,"threshold_uncertainty_score":0.8605259},"labels":[],"label_agreement":null},{"id":"W2804948070","doi":"","title":"Using Reward Machines for High-Level Task Specification and Decomposition in Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":129,"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":"Reinforcement learning; Computer science; Task (project management); Decomposition; Artificial intelligence; Human–computer interaction; Engineering","score_opus":0.09333430035172953,"score_gpt":0.3548435333796292,"score_spread":0.2615092330278997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804948070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03878467,0.000012548217,0.95384485,0.0012168662,0.00049599103,0.00027133746,0.0000021579765,0.00011871526,0.0052528414],"genre_scores_gemma":[0.9404784,0.000034592715,0.05795851,0.00016528023,0.00020597452,0.00002163337,0.00009358234,0.000020318752,0.0010216933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981607,0.00013553664,0.00045957786,0.0005091034,0.00043704073,0.0002979974],"domain_scores_gemma":[0.99887276,0.00017221333,0.00034129847,0.00021517728,0.00032831493,0.00007024964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974613,0.000226202,0.00020009812,0.00041874283,0.00030538815,0.0003731153,0.0005681012,0.00008287372,0.00008011689],"category_scores_gemma":[0.00033045703,0.0002333267,0.000038121503,0.000201728,0.00007441393,0.00053680385,0.00023015607,0.0004673228,0.000032550615],"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.00012529475,0.00002815578,0.010549135,0.000019108704,0.000036666814,0.000004320693,0.0008235468,0.67962855,0.013811333,0.2791476,0.00002038995,0.015805937],"study_design_scores_gemma":[0.0008115113,0.00048975146,0.0057551907,0.00013011144,0.0000060882107,0.000011919759,0.000037893577,0.98768985,0.0006453297,0.003197852,0.0009762649,0.0002482276],"about_ca_topic_score_codex":0.00021625607,"about_ca_topic_score_gemma":0.00003057971,"teacher_disagreement_score":0.90169376,"about_ca_system_score_codex":0.00018860296,"about_ca_system_score_gemma":0.000054382894,"threshold_uncertainty_score":0.95147866},"labels":[],"label_agreement":null},{"id":"W2945905208","doi":"","title":"Per-Decision Option Discounting","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","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":"McGill University","funders":"","keywords":"Discounting; Computer science; Economics; Actuarial science; Finance","score_opus":0.03633236734184508,"score_gpt":0.26806036843716696,"score_spread":0.23172800109532188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945905208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85945517,0.000492635,0.002528334,0.0012170142,0.00072124676,0.00008308177,0.000021981672,0.00004914617,0.13543141],"genre_scores_gemma":[0.9852983,0.00039957286,0.0004890535,0.00015698036,0.00009191606,0.000004799695,0.00009678069,0.000013942432,0.013448656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911106,0.0000120142195,0.00032237527,0.00032261442,0.00009429632,0.00013766038],"domain_scores_gemma":[0.9995066,0.000043534637,0.00023468689,0.00013149017,0.00004690304,0.000036812904],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002738867,0.00011555063,0.00018740668,0.00027670132,0.000067639885,0.00018653246,0.00022549812,0.00005010855,0.008506565],"category_scores_gemma":[0.00008105195,0.00011487376,0.00011748803,0.000086064334,0.000017795788,0.00026484256,0.000063608975,0.00027184442,0.007564342],"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.000023295821,0.000029856243,0.1061988,0.0000026128916,0.00003655489,0.0000011076644,0.00013562958,0.0021363487,0.00024885032,0.88930416,0.00002263001,0.0018601506],"study_design_scores_gemma":[0.0006218236,0.00012760672,0.036839314,0.000056178156,0.000005861836,0.0000022473544,0.00018713842,0.8190229,0.00005320273,0.11534734,0.027422883,0.00031350253],"about_ca_topic_score_codex":0.00024739502,"about_ca_topic_score_gemma":0.000018891911,"teacher_disagreement_score":0.81688654,"about_ca_system_score_codex":0.00007428921,"about_ca_system_score_gemma":0.000006823447,"threshold_uncertainty_score":0.9932084},"labels":[],"label_agreement":null},{"id":"W2946506331","doi":"","title":"Unreproducible Research is Reproducible","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.4724560828290626,"score_gpt":0.5226980919648335,"score_spread":0.050242009135770926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946506331","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32874656,0.00004232678,0.0011057392,0.024833057,0.0032797456,0.00027334408,0.000018660987,0.00013215351,0.6415684],"genre_scores_gemma":[0.7851908,0.000010026796,0.00041037353,0.00033599488,0.00016634485,0.000005373976,0.000025756333,0.000009576467,0.21384576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99306077,0.0004727447,0.0005105408,0.0020197888,0.0035777627,0.00035837694],"domain_scores_gemma":[0.99558634,0.0008159848,0.00019597402,0.002094479,0.0012142748,0.000092926464],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.018612957,0.0001383984,0.00019179886,0.0009332252,0.00028582852,0.0012942601,0.0021910726,0.000044019373,0.020512681],"category_scores_gemma":[0.0085321935,0.00010891979,0.00008414331,0.0010779004,0.000082516926,0.00032839522,0.000994087,0.0007433065,0.023272144],"study_design_candidate":"not_applicable","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.00024990438,0.0003078083,0.23291296,0.000012270115,0.00008846552,0.00003140987,0.0024437152,0.013407424,0.004537428,0.3058331,0.16315521,0.2770203],"study_design_scores_gemma":[0.000374977,0.00019157282,0.009028423,0.000060594914,0.0000022049414,0.0000060683083,0.0010226346,0.2567964,0.0009329895,0.040055256,0.69131494,0.00021393702],"about_ca_topic_score_codex":0.00027320412,"about_ca_topic_score_gemma":0.00001476184,"teacher_disagreement_score":0.52815974,"about_ca_system_score_codex":0.00007057881,"about_ca_system_score_gemma":0.00008584415,"threshold_uncertainty_score":0.99981934},"labels":[],"label_agreement":null},{"id":"W2949593890","doi":"","title":"Fast and Simple Natural-Gradient Variational Inference with Mixture of Exponential-family Approximations.","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","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 British Columbia","funders":"","keywords":"Exponential family; Simple (philosophy); Inference; Applied mathematics; Gradient descent; Approximations of π; Mathematics; Convergence (economics); Representation (politics); Exponential function; Bayesian inference; Approximate inference; Computer science; Algorithm; Mathematical optimization; Bayesian probability; Artificial neural network; Artificial intelligence; Mathematical analysis; Statistics","score_opus":0.009866456545828465,"score_gpt":0.24522240259646963,"score_spread":0.23535594605064117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949593890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23225015,0.00011645271,0.7436512,0.0026601127,0.00045106842,0.0003358676,0.000024495554,0.00014821361,0.020362446],"genre_scores_gemma":[0.9829517,0.000035943733,0.016218923,0.00017137131,0.00003090234,0.000013638564,0.000058913076,0.000009607194,0.00050897076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984415,0.00006473138,0.0002883916,0.00045258217,0.0005568254,0.00019597217],"domain_scores_gemma":[0.9988765,0.00013907319,0.00029472727,0.00024263887,0.00037755308,0.00006948993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017152984,0.00020104824,0.00020970461,0.00021252953,0.00009614745,0.0002523704,0.0006842506,0.000056965964,0.00020831032],"category_scores_gemma":[0.00008413608,0.00016021621,0.000039115388,0.00023687632,0.0000602403,0.00057051954,0.00020146137,0.0004116918,0.000036383488],"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.000055713637,0.000080563834,0.032195207,0.000046243833,0.000058899772,0.000005185329,0.0006442879,0.0022823713,0.0033540572,0.94486946,0.00001609366,0.016391905],"study_design_scores_gemma":[0.0008908894,0.00040124348,0.06859043,0.00020189886,0.000009443956,0.000029986617,0.000110948415,0.91059834,0.0005291203,0.01757359,0.0007047566,0.00035934657],"about_ca_topic_score_codex":0.000068104295,"about_ca_topic_score_gemma":0.000014512691,"teacher_disagreement_score":0.92729586,"about_ca_system_score_codex":0.0000309596,"about_ca_system_score_gemma":0.00012944096,"threshold_uncertainty_score":0.6533427},"labels":[],"label_agreement":null},{"id":"W2949842650","doi":"","title":"Multivariate Submodular Optimization.","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Complexity and Algorithms in Graphs","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":"University of British Columbia","funders":"","keywords":"Submodular set function; Matroid; Monotone polygon; Combinatorics; Mathematics; Disjoint sets; Discrete mathematics; Approximation algorithm; Greedy algorithm; Maximization; Mathematical optimization","score_opus":0.029781064638663552,"score_gpt":0.28081359571158415,"score_spread":0.2510325310729206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949842650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006307043,0.00001842168,0.92621964,0.0030446567,0.0012102881,0.00012929861,0.0000058188766,0.00027656855,0.06278824],"genre_scores_gemma":[0.930521,0.0000171473,0.066034816,0.00035345537,0.00006979838,0.0000068291097,0.000040812687,0.000009941017,0.0029462061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875295,0.000089640176,0.00018350173,0.00038869726,0.00040402304,0.00018116059],"domain_scores_gemma":[0.9992957,0.000082782775,0.000108614484,0.00028109946,0.0001740998,0.000057664693],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021695158,0.00014029117,0.00012508484,0.00018976923,0.00010714345,0.0002847865,0.0010390935,0.000044666765,0.0015544017],"category_scores_gemma":[0.0000846075,0.00013520372,0.00006828524,0.00018151966,0.0000229201,0.0004019107,0.0002615393,0.00038957465,0.00047367925],"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.000013104739,0.00005204717,0.0036085101,0.0000033330693,0.000031095467,0.000008775877,0.00020196178,0.25447813,0.0003949382,0.72651386,0.00002138208,0.014672878],"study_design_scores_gemma":[0.00039468874,0.00008354028,0.001358352,0.000030254467,0.0000012964529,0.000007672326,0.0000138878395,0.98667765,0.000109204615,0.0063270293,0.004831494,0.00016494756],"about_ca_topic_score_codex":0.00007994252,"about_ca_topic_score_gemma":0.0000030851143,"teacher_disagreement_score":0.92421395,"about_ca_system_score_codex":0.000036909565,"about_ca_system_score_gemma":0.000035933772,"threshold_uncertainty_score":0.9993583},"labels":[],"label_agreement":null},{"id":"W2951025565","doi":"","title":"State-Reification Networks: Improving Generalization by Modeling the Distribution of Hidden Representations","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Reification (Marxism); Generalization; Computer science; State (computer science); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.022436667099194292,"score_gpt":0.2829833811041134,"score_spread":0.26054671400491913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951025565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08754812,0.00004658556,0.9078788,0.0029368766,0.00021386266,0.00021034777,0.000015963926,0.00007384855,0.0010755522],"genre_scores_gemma":[0.9976611,0.00008696225,0.00077835517,0.000111884794,0.00005648766,0.000031249518,0.00048224532,0.000008430005,0.00078330067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883944,0.00010121315,0.0003012037,0.00030971871,0.00030942677,0.00013899126],"domain_scores_gemma":[0.9990517,0.000090230766,0.00025450115,0.0003102177,0.00026057594,0.00003275968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002407202,0.000107445514,0.00009511939,0.000044611505,0.0001672097,0.0001874176,0.0006790045,0.000034736233,0.000046283],"category_scores_gemma":[0.00004737786,0.000086049,0.00004842274,0.00023707963,0.000022199609,0.000339253,0.00012385669,0.00025887298,0.00002215531],"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.000007998825,0.000028359615,0.0021627955,0.0000028461495,0.00001398479,1.619544e-7,0.00010331074,0.7772047,0.0044686855,0.19576393,0.00017111174,0.020072116],"study_design_scores_gemma":[0.00013969486,0.00003277575,0.00054421107,0.00001774239,0.0000034063587,0.0000015626482,0.000024822399,0.9958226,0.0003603056,0.0024298688,0.000533079,0.00008994528],"about_ca_topic_score_codex":0.00024332736,"about_ca_topic_score_gemma":0.0000095894175,"teacher_disagreement_score":0.910113,"about_ca_system_score_codex":0.00004311291,"about_ca_system_score_gemma":0.000027590124,"threshold_uncertainty_score":0.35089764},"labels":[],"label_agreement":null},{"id":"W2953418083","doi":"","title":"Compositional Fairness Constraints for Graph Embeddings","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":28,"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; Adversarial system; Social graph; Recommender system; Theoretical computer science; Inference; Graph; Embedding; Knowledge graph; Machine learning; Artificial intelligence; World Wide Web; Social media","score_opus":0.05734558416610852,"score_gpt":0.3996761543348702,"score_spread":0.34233057016876167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953418083","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25708494,0.000013688616,0.0042499746,0.035642006,0.001505469,0.0004508626,0.00008895665,0.00014878072,0.7008153],"genre_scores_gemma":[0.99270374,0.000036561214,0.00051868026,0.000983108,0.00024828225,0.0000128655265,0.000099720346,0.000011600764,0.0053854184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871725,0.00011769589,0.00016468031,0.00022111062,0.00054334855,0.00023588985],"domain_scores_gemma":[0.99867904,0.00040771853,0.00012699165,0.00005930646,0.00062826526,0.00009867213],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077032205,0.000107326945,0.00013682796,0.00010639917,0.00045598496,0.00031866433,0.00033446428,0.00011418766,0.0032387364],"category_scores_gemma":[0.00058951846,0.000111405476,0.000103625374,0.00007420401,0.00025651223,0.00028097405,0.00003317685,0.00042768044,0.00014659578],"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.000047394537,0.00003455933,0.0064070537,0.0000050116014,0.000036511643,0.0000012939408,0.0027617163,0.0001574942,0.0009625023,0.98646927,0.00013635795,0.0029808178],"study_design_scores_gemma":[0.0043730834,0.0009537662,0.011800369,0.00057390094,0.000046028574,0.00000794978,0.019308755,0.034128033,0.0005509779,0.722622,0.20420967,0.0014255027],"about_ca_topic_score_codex":0.000536539,"about_ca_topic_score_gemma":0.00018918459,"teacher_disagreement_score":0.7356188,"about_ca_system_score_codex":0.00008332078,"about_ca_system_score_gemma":0.00018780392,"threshold_uncertainty_score":0.99767244},"labels":[],"label_agreement":null},{"id":"W2954036577","doi":"","title":"A Wrapped Normal Distribution on Hyperbolic Space for Gradient-Based Learning","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","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 Toronto","funders":"","keywords":"Hyperbolic space; Mathematics; MNIST database; Gaussian; Distribution (mathematics); Mathematical analysis; Artificial intelligence; Computer science; Artificial neural network; Physics","score_opus":0.020446556151040705,"score_gpt":0.2606745710653548,"score_spread":0.2402280149143141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954036577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049504463,0.000014276891,0.9373041,0.0045190323,0.0009801983,0.00028304747,0.000019500272,0.00016004706,0.0072153327],"genre_scores_gemma":[0.9914955,0.0000068168642,0.0055580563,0.0003139467,0.000170502,0.000031197316,0.00020270338,0.000015116699,0.0022061532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850476,0.00015278754,0.00020052154,0.00047433432,0.00037217428,0.00029542294],"domain_scores_gemma":[0.9990815,0.00024123979,0.0001780561,0.0001999202,0.00022292795,0.0000763371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032718302,0.00020415052,0.00018388212,0.00012344384,0.00021743815,0.00027970932,0.00057033775,0.00006108089,0.00021223316],"category_scores_gemma":[0.00027379429,0.00018848747,0.00012718278,0.0001462617,0.000025054933,0.00026965563,0.00008685361,0.00043851964,0.00023195379],"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.00036827257,0.00017118875,0.014739797,0.0000172453,0.00007294429,0.0000069712546,0.00024120949,0.60024387,0.008859514,0.3249403,0.0002714746,0.050067242],"study_design_scores_gemma":[0.0008455819,0.00053667056,0.0022783973,0.00005564279,0.0000050167023,0.0000017633565,0.000026257232,0.96445787,0.0023554415,0.00039741644,0.028822714,0.00021720314],"about_ca_topic_score_codex":0.000051947147,"about_ca_topic_score_gemma":0.000006936764,"teacher_disagreement_score":0.94199103,"about_ca_system_score_codex":0.000087667875,"about_ca_system_score_gemma":0.00006223309,"threshold_uncertainty_score":0.7686296},"labels":[],"label_agreement":null},{"id":"W2954460650","doi":"","title":"Empirical Analysis of Beam Search Performance Degradation in Neural Sequence Models","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":42,"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":"Degradation (telecommunications); Sequence (biology); Computer science; Artificial neural network; Artificial intelligence; Pattern recognition (psychology); Chemistry; Telecommunications","score_opus":0.10930368572001913,"score_gpt":0.38573564821479633,"score_spread":0.2764319624947772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954460650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6629065,0.000018259507,0.33265287,0.00042242467,0.000057556645,0.00009021795,0.0000037231575,0.000067297864,0.003781112],"genre_scores_gemma":[0.99329895,0.000083059196,0.005991126,0.00012666809,0.000008875547,0.000005286025,0.000038049322,0.000005689638,0.00044229653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986082,0.00008693388,0.00028956836,0.0003470299,0.00049768167,0.0001705888],"domain_scores_gemma":[0.99925345,0.00011403245,0.00012741955,0.00023739769,0.0002309621,0.000036747755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035311736,0.00011813309,0.00021567813,0.00066725566,0.00003218229,0.000070935115,0.000751545,0.00004605621,0.000100424586],"category_scores_gemma":[0.00006584687,0.00010927201,0.000074234405,0.00088413997,0.000030827305,0.000951172,0.00017592956,0.00043415502,0.000016255815],"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.000076259144,0.00008331132,0.4262606,0.000014926511,0.00009020739,0.0000085004585,0.0005409751,0.43636745,0.0077941553,0.031306807,0.0000028122265,0.09745401],"study_design_scores_gemma":[0.00015035614,0.00016199595,0.028453404,0.000034764547,0.000006680079,0.000002004063,0.000017994473,0.965799,0.0044939755,0.0007326402,0.000039893028,0.00010730785],"about_ca_topic_score_codex":0.00010888205,"about_ca_topic_score_gemma":0.000012099292,"teacher_disagreement_score":0.5294315,"about_ca_system_score_codex":0.00008013279,"about_ca_system_score_gemma":0.000051746585,"threshold_uncertainty_score":0.44559833},"labels":[],"label_agreement":null},{"id":"W2955067198","doi":"","title":"Lorentzian Distance Learning for Hyperbolic Representations","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":43,"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; Artificial intelligence","score_opus":0.03603241555476244,"score_gpt":0.3178020778446282,"score_spread":0.2817696622898658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955067198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039823107,0.00006392193,0.8982388,0.007968049,0.00066686305,0.00023116327,0.000022766855,0.00027324836,0.052712105],"genre_scores_gemma":[0.9803573,0.00004219963,0.0043814755,0.00023887391,0.00007862233,0.000026045711,0.00016931035,0.000007537993,0.014698638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860805,0.000082541555,0.00022774136,0.0004952483,0.00036463593,0.00022176368],"domain_scores_gemma":[0.9990347,0.00028786768,0.00015839782,0.00026132583,0.00018483619,0.000072887815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002426104,0.0001358853,0.00017367778,0.00027097706,0.00016109942,0.00027770325,0.0009742543,0.000044614007,0.0008676319],"category_scores_gemma":[0.0005272485,0.000115933646,0.000117268704,0.00041975293,0.000029204248,0.00036487752,0.00020426916,0.00036421404,0.0004343585],"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.000030122266,0.00006835203,0.07094129,0.000006068112,0.00007002683,0.000004816329,0.00016668688,0.017696759,0.0004860332,0.85128486,0.000117742384,0.05912722],"study_design_scores_gemma":[0.0005182434,0.00022507126,0.013292316,0.000023146711,0.0000083887835,0.0000049244886,0.00010152523,0.8921545,0.00010899518,0.009468938,0.08386598,0.00022796945],"about_ca_topic_score_codex":0.00011107132,"about_ca_topic_score_gemma":0.000016399827,"teacher_disagreement_score":0.9405342,"about_ca_system_score_codex":0.000039062117,"about_ca_system_score_gemma":0.000025274208,"threshold_uncertainty_score":0.9499961},"labels":[],"label_agreement":null},{"id":"W2962725091","doi":"","title":"Structured Generative Models of Natural Source Code","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":48,"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":"Computer science; Generative grammar; Source code; Probabilistic logic; Code (set theory); Context (archaeology); Generative model; Natural language processing; Artificial intelligence; Natural language; Rule-based machine translation; Language model; Statistical model; Programming language","score_opus":0.023374194294264492,"score_gpt":0.29857618009771947,"score_spread":0.27520198580345495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962725091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008158857,0.0001475853,0.984733,0.0014150311,0.00025853343,0.00006163953,0.0000040144423,0.0002899668,0.004931377],"genre_scores_gemma":[0.8198657,0.0000061180954,0.17900947,0.0002758902,0.000060492817,0.0000040010264,0.00001664918,0.000008563632,0.00075314194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876934,0.00013113438,0.00021276726,0.00031442006,0.00042678087,0.00014553964],"domain_scores_gemma":[0.99912465,0.00009071404,0.00022123427,0.00021211218,0.0003115578,0.000039759394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023077655,0.0001492234,0.0001622798,0.00016336894,0.00007981932,0.0001439071,0.0011126309,0.00005627021,0.00004729625],"category_scores_gemma":[0.00023232271,0.0001239091,0.00005311905,0.00011741629,0.00004710152,0.00038769128,0.00023499726,0.0005145136,0.0000062438085],"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.000020686273,0.000014896436,0.00022986652,0.000006495604,0.000021550683,0.0000020493515,0.0005815797,0.0072653326,0.020833103,0.8950265,0.000033776985,0.07596417],"study_design_scores_gemma":[0.00016753683,0.00007094799,0.000047580263,0.00004372487,0.0000018973554,0.000007918214,0.00001011616,0.86973614,0.018596519,0.11072937,0.00046301834,0.00012521907],"about_ca_topic_score_codex":0.00006285613,"about_ca_topic_score_gemma":0.000020807553,"teacher_disagreement_score":0.8624708,"about_ca_system_score_codex":0.000037170164,"about_ca_system_score_gemma":0.000035365276,"threshold_uncertainty_score":0.50528663},"labels":[],"label_agreement":null},{"id":"W2962807943","doi":"","title":"Adaptive Consensus ADMM for Distributed Optimization","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Node (physics); Computer science; Convergence (economics); Reliability (semiconductor); Rate of convergence; Mathematical optimization; Mathematics; Key (lock); Engineering","score_opus":0.057130700337788665,"score_gpt":0.32816530335188204,"score_spread":0.2710346030140934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962807943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019998744,0.000012233116,0.9573048,0.013452842,0.0007255094,0.00016931162,0.00004644705,0.00022927704,0.026059745],"genre_scores_gemma":[0.9528857,0.000010237818,0.044309806,0.00018526365,0.00014934628,0.00002973242,0.00012657011,0.00001437895,0.0022889662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998683,0.00009232976,0.00022061473,0.0004427151,0.00031891654,0.00024245237],"domain_scores_gemma":[0.99852717,0.00018139115,0.00038197546,0.00044589344,0.00037372476,0.00008982731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036318012,0.00018319949,0.0001699661,0.00011029788,0.00079486315,0.0007648279,0.0014061087,0.00007041565,0.00014109875],"category_scores_gemma":[0.0012184222,0.000173713,0.00008827289,0.00004413503,0.00006550115,0.00026146322,0.00025742958,0.00032376315,0.000052836054],"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.000190485,0.000095652336,0.0035548732,0.000008284664,0.0000929931,0.0000196171,0.00025603443,0.35109106,0.00010179595,0.5477889,0.0005770632,0.09622324],"study_design_scores_gemma":[0.0008381118,0.00021015016,0.0016661311,0.000046226498,0.0000054275547,0.000008955375,0.000020465646,0.982014,0.00007167527,0.002770113,0.012149459,0.00019927006],"about_ca_topic_score_codex":0.00013985104,"about_ca_topic_score_gemma":0.000019366144,"teacher_disagreement_score":0.95088583,"about_ca_system_score_codex":0.00005473527,"about_ca_system_score_gemma":0.000071215385,"threshold_uncertainty_score":0.7375253},"labels":[],"label_agreement":null},{"id":"W2963110487","doi":"","title":"Differentially private policy evaluation","year":2016,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":10,"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":"Differential privacy; Computer science; Reinforcement learning; Task (project management); Simple (philosophy); Differential (mechanical device); Empirical research; Artificial intelligence; Machine learning; Data science; Data mining; Mathematics; Economics; Engineering","score_opus":0.061684237052326764,"score_gpt":0.34725636707081275,"score_spread":0.28557213001848597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963110487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057042144,0.000022053331,0.71647435,0.19778757,0.00082645233,0.00022129688,0.000022124077,0.0010377007,0.026566302],"genre_scores_gemma":[0.9799179,0.00008340258,0.018940696,0.00023287415,0.0001319014,0.00003053417,0.000026359907,0.000012799829,0.0006235422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784803,0.0001936902,0.00025661802,0.0005384376,0.0008872099,0.00027598743],"domain_scores_gemma":[0.99717265,0.00017349148,0.00020081262,0.0021130685,0.00027950655,0.00006044092],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00059845456,0.00018186883,0.00013272223,0.00039454628,0.00011579418,0.0002611573,0.014152742,0.00008419511,0.00069782074],"category_scores_gemma":[0.023738964,0.00012980716,0.00005434843,0.00022079084,0.00006776473,0.00066394074,0.016514491,0.00032262757,0.00044701746],"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.000018371376,0.000044026736,0.004812636,0.0000024682643,0.000040724655,0.0000061860515,0.00003073896,0.000035773566,0.014844109,0.48109123,0.0011835103,0.4978902],"study_design_scores_gemma":[0.00069442496,0.00010603205,0.0075003477,0.00010952587,0.000004039431,0.000009508528,0.0000034428026,0.520906,0.0031278243,0.46172342,0.005588891,0.00022658432],"about_ca_topic_score_codex":0.0000531012,"about_ca_topic_score_gemma":0.000011063173,"teacher_disagreement_score":0.92287576,"about_ca_system_score_codex":0.00024692938,"about_ca_system_score_gemma":0.00014081947,"threshold_uncertainty_score":0.99143976},"labels":[],"label_agreement":null},{"id":"W2963250930","doi":"","title":"Convergent Tree Backup and Retrace with Function Approximation","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":19,"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":"Backup; Reinforcement learning; Saddle point; Computer science; Tree (set theory); Function approximation; Mathematical optimization; Convergence (economics); Function (biology); Approximation algorithm; Bootstrapping (finance); Saddle; Quadratic equation; Applied mathematics; Mathematics; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.0275852956681716,"score_gpt":0.265515831660857,"score_spread":0.2379305359926854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963250930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015463401,0.000008837257,0.93049985,0.0017096206,0.00044352672,0.00010668286,5.7273144e-7,0.00016739822,0.0516001],"genre_scores_gemma":[0.9806107,0.00002055241,0.015351065,0.00027747563,0.00013298591,0.000007852477,0.000021877466,0.000011260283,0.0035661801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872017,0.00007861716,0.00018987345,0.00035793538,0.00048329204,0.00017013565],"domain_scores_gemma":[0.99919766,0.000058989925,0.00018287252,0.000201704,0.00029192618,0.000066874905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026617156,0.00015175353,0.00010763825,0.00015105116,0.00017750186,0.00030515168,0.00039384572,0.000051057912,0.000317947],"category_scores_gemma":[0.00010300532,0.00012872824,0.000021522132,0.00014528184,0.00008724393,0.00047433266,0.00013106293,0.00034726856,0.00016959537],"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.0003084109,0.000058266847,0.031989805,0.000022673516,0.00014169574,0.000012522785,0.0013834041,0.05123719,0.0030516468,0.83282924,0.00023383308,0.07873134],"study_design_scores_gemma":[0.00048673703,0.0008404995,0.008655562,0.000054670832,0.000006196357,0.00001628999,0.00004624257,0.9833678,0.000293576,0.0007184054,0.0053486023,0.0001653896],"about_ca_topic_score_codex":0.000025700476,"about_ca_topic_score_gemma":0.000016477237,"teacher_disagreement_score":0.9651474,"about_ca_system_score_codex":0.00005269845,"about_ca_system_score_gemma":0.000038668764,"threshold_uncertainty_score":0.5249385},"labels":[],"label_agreement":null},{"id":"W2963280733","doi":"","title":"DCM bandits: learning to rank with multiple clicks","year":2016,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Regret; Computer science; Logarithm; Online learning; Matching (statistics); Learning to rank; Rank (graph theory); Web page; Machine learning; Upper and lower bounds; Artificial intelligence; World Wide Web; Mathematics; Ranking (information retrieval); Statistics","score_opus":0.11166585086489081,"score_gpt":0.4292146443664688,"score_spread":0.31754879350157794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963280733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20436738,0.000033813692,0.7331016,0.022027893,0.0007950065,0.000557915,0.00006453379,0.00035463666,0.03869724],"genre_scores_gemma":[0.95916176,0.000028210654,0.002240046,0.00023546236,0.0002477938,0.000043127042,0.000014966269,0.000035526522,0.03799311],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948521,0.000421174,0.0005279975,0.00088537775,0.0028174084,0.0004959271],"domain_scores_gemma":[0.9952353,0.0027191525,0.0002707114,0.00039498415,0.0010973716,0.00028247197],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017496689,0.00027286418,0.00032211252,0.00071473833,0.00032610568,0.00043551612,0.0013845311,0.00008123818,0.0070375553],"category_scores_gemma":[0.011830646,0.00015431292,0.000091726244,0.0004633946,0.0001367362,0.0005363576,0.00034158575,0.0007819473,0.0043527186],"study_design_candidate":"design_other","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.0018666248,0.00012839625,0.24843355,0.0000034765496,0.00010892278,0.00013304081,0.0010455672,0.04959701,0.009946195,0.005239718,0.00082223344,0.6826753],"study_design_scores_gemma":[0.00767687,0.00306478,0.066471964,0.00056344445,0.000014392203,0.000097149394,0.001890168,0.31962556,0.005362794,0.01147492,0.5823237,0.0014342811],"about_ca_topic_score_codex":0.00008716188,"about_ca_topic_score_gemma":0.00016292618,"teacher_disagreement_score":0.75479436,"about_ca_system_score_codex":0.00016280886,"about_ca_system_score_gemma":0.00011446229,"threshold_uncertainty_score":0.9964931},"labels":[],"label_agreement":null},{"id":"W2963371670","doi":"","title":"Learning to Reweight Examples for Robust Deep Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":418,"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":"Hyperparameter; Overfitting; Computer science; Artificial intelligence; Machine learning; Regularization (linguistics); Deep learning; Gradient descent; Artificial neural network; Set (abstract data type); Deep neural networks; Supervised learning","score_opus":0.06198251208780124,"score_gpt":0.31968496760501225,"score_spread":0.257702455517211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963371670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011504817,0.000033376597,0.9407945,0.0077577196,0.0008638629,0.00031399634,0.0000066826647,0.00077421765,0.037950817],"genre_scores_gemma":[0.9147466,0.00004221943,0.07410017,0.0005946079,0.00070367206,0.0000881712,0.00026225307,0.000046219942,0.009416101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969825,0.0003782009,0.0004632231,0.0010051137,0.0006498792,0.0005210653],"domain_scores_gemma":[0.9978133,0.0004762481,0.0003456253,0.00043767388,0.0007050349,0.00022211461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011041221,0.00034171858,0.00028332399,0.0004921886,0.0008578479,0.0007642539,0.0016073172,0.00012249786,0.0005259847],"category_scores_gemma":[0.0025788895,0.0003335354,0.000118350654,0.000404149,0.00007584934,0.0005426779,0.0004260685,0.0010863249,0.0007732463],"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.00024630886,0.00012253453,0.019587152,0.000027368756,0.00010359287,0.000013710091,0.0039247717,0.048340905,0.00546048,0.35647312,0.0005340254,0.565166],"study_design_scores_gemma":[0.00045973592,0.0009559785,0.0036995427,0.000073766605,0.0000072718144,0.000015705999,0.00020156387,0.7772194,0.00029247324,0.0009472693,0.21576768,0.00035962742],"about_ca_topic_score_codex":0.0001557361,"about_ca_topic_score_gemma":0.00009606967,"teacher_disagreement_score":0.90324175,"about_ca_system_score_codex":0.000122681,"about_ca_system_score_gemma":0.00007525834,"threshold_uncertainty_score":0.99991167},"labels":[],"label_agreement":null},{"id":"W2963408680","doi":"","title":"DVAE++: Discrete Variational Autoencoders with Overlapping Transformations","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Latent variable; Prior probability; Transformation (genetics); Softmax function; Smoothing; Computer science; Artificial intelligence; Algorithm; Mathematics; Applied mathematics; Convolutional neural network; Statistics; Bayesian probability","score_opus":0.020686409982519808,"score_gpt":0.2663003432703145,"score_spread":0.24561393328779468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963408680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053105736,0.0000066649673,0.9143276,0.0068254946,0.0003451816,0.00008349942,0.0000077027335,0.0001139453,0.07775885],"genre_scores_gemma":[0.9376459,0.000020554764,0.060678408,0.00045090023,0.00027009426,0.000013281499,0.000034616383,0.000009621408,0.0008765905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986903,0.00010305926,0.00021054171,0.00032875035,0.00045609876,0.0002112473],"domain_scores_gemma":[0.9992168,0.000087960914,0.00012768965,0.00017289125,0.0003237125,0.00007093955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021716912,0.00016381453,0.00012433981,0.00015013976,0.00035673872,0.00036853144,0.0005970229,0.000038787322,0.00054038246],"category_scores_gemma":[0.00007292841,0.0001328874,0.00005179869,0.00020114856,0.00008180848,0.0008465425,0.000071518414,0.00026685247,0.00012836716],"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.00008060288,0.00005816759,0.0010851595,0.0000036481474,0.00015763061,0.000008836001,0.0019388868,0.15071574,0.0012814511,0.8209771,0.000230354,0.023462405],"study_design_scores_gemma":[0.00035599314,0.00022026527,0.0017848903,0.000042835716,0.0000056323997,0.000010089243,0.00005086196,0.9836002,0.00023460793,0.0025848635,0.010928158,0.00018161151],"about_ca_topic_score_codex":0.00007278909,"about_ca_topic_score_gemma":0.000064382424,"teacher_disagreement_score":0.9371149,"about_ca_system_score_codex":0.000053528944,"about_ca_system_score_gemma":0.00010071034,"threshold_uncertainty_score":0.5916809},"labels":[],"label_agreement":null},{"id":"W2963456073","doi":"","title":"IMEXnet - A Forward Stable Deep Neural Network","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":9,"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; Robustness (evolution); Convolutional neural network; Residual; Artificial intelligence; Convolution (computer science); Generalization; Key (lock); Artificial neural network; Deep learning; Pixel; Segmentation; Sensitivity (control systems); Field (mathematics); Machine learning; Algorithm; Mathematics","score_opus":0.01932532329003506,"score_gpt":0.2746675927385407,"score_spread":0.25534226944850563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963456073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5344653,0.000050615938,0.019570922,0.0022451403,0.00237201,0.00029912996,0.000017542794,0.00015001895,0.4408293],"genre_scores_gemma":[0.9855521,0.000005608345,0.00021286744,0.00022618467,0.000688442,0.000012199061,0.00014647505,0.00001835237,0.013137808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898934,0.00006426884,0.00018210619,0.00027078515,0.00024004154,0.00025343258],"domain_scores_gemma":[0.9995575,0.000045582452,0.00011750334,0.00012465294,0.00008123099,0.00007355316],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000106374915,0.0001550567,0.00014991348,0.000051263312,0.000097696,0.00012118127,0.00022971969,0.000031797183,0.018049313],"category_scores_gemma":[0.0000051069514,0.000141043,0.00009046343,0.00007886944,0.000016866696,0.00015785267,0.000070885704,0.0005287134,0.00053220417],"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.00013501754,0.000057891368,0.13613142,0.0000035573114,0.00009869675,0.0000022666043,0.000099656965,0.5635043,0.00046737454,0.24798921,0.0007539384,0.050756685],"study_design_scores_gemma":[0.00041753423,0.00008141485,0.0011471732,0.000021690657,0.0000057426905,0.0000019527477,0.0000695559,0.9730596,0.000056533347,0.00421776,0.020751148,0.00016991115],"about_ca_topic_score_codex":0.00013818647,"about_ca_topic_score_gemma":0.000005268746,"teacher_disagreement_score":0.45108673,"about_ca_system_score_codex":0.00001977142,"about_ca_system_score_gemma":0.00001733024,"threshold_uncertainty_score":0.98284835},"labels":[],"label_agreement":null},{"id":"W2963462732","doi":"","title":"Planning by Prioritized Sweeping with Small Backups","year":2013,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":9,"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":"Backup; Successor cardinal; Computer science; Reinforcement learning; Flexibility (engineering); Computation; Implementation; Process (computing); Distributed computing; State (computer science); Artificial intelligence; Algorithm; Mathematics","score_opus":0.03698794599683398,"score_gpt":0.27144154936796033,"score_spread":0.23445360337112636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963462732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017891286,0.000029485465,0.9226633,0.003062324,0.00028300798,0.00020659076,0.0000011389749,0.00035299687,0.055509914],"genre_scores_gemma":[0.95176524,0.000016113283,0.04068546,0.00065348734,0.00007654795,0.000034413995,0.000049383634,0.000025808618,0.0066935294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814576,0.00011609148,0.00030792717,0.00047379988,0.00058969535,0.0003667483],"domain_scores_gemma":[0.99885905,0.0001817858,0.00025295065,0.0002945954,0.00028882653,0.0001227762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024163345,0.00024893298,0.00020025721,0.00018246727,0.00020434648,0.0008433923,0.001226661,0.000068389854,0.0005560522],"category_scores_gemma":[0.00017231396,0.00021764499,0.000049579507,0.00017404403,0.000049666203,0.00060438656,0.00025529286,0.0007772346,0.0004653224],"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.00007303282,0.00008313533,0.049858656,0.00002941942,0.00021838376,0.00006403576,0.0016399835,0.7411642,0.00819745,0.15386318,0.0010800646,0.043728467],"study_design_scores_gemma":[0.00074757147,0.00025507296,0.002122056,0.00018452069,0.0000042360493,0.000021075733,0.00008039359,0.9871492,0.00029086624,0.0004467488,0.008365401,0.00033288877],"about_ca_topic_score_codex":0.00017493949,"about_ca_topic_score_gemma":0.0000028140078,"teacher_disagreement_score":0.93387395,"about_ca_system_score_codex":0.00008426362,"about_ca_system_score_gemma":0.00006377364,"threshold_uncertainty_score":0.8875305},"labels":[],"label_agreement":null},{"id":"W2963501401","doi":"","title":"Dynamic Measurement Scheduling for Event Forecasting using Deep RL.","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":6,"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":"Computer science; Reinforcement learning; Scheduling (production processes); Heuristic; Artificial intelligence; Task (project management); Machine learning; Operations research; Mathematical optimization; Engineering; Mathematics","score_opus":0.10177968711709934,"score_gpt":0.35212966121248196,"score_spread":0.2503499740953826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963501401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09757608,0.00011087921,0.89330834,0.002797891,0.0015693023,0.0005349734,0.0000043055925,0.0002515788,0.003846666],"genre_scores_gemma":[0.9083363,0.0000080226855,0.09085213,0.00028100333,0.000095145704,0.00003325478,0.00002497775,0.000033986802,0.00033520602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711716,0.00019873148,0.00048501565,0.0007182759,0.0010164294,0.00046438616],"domain_scores_gemma":[0.99812746,0.00022749061,0.00040211136,0.0003710422,0.0007512922,0.00012062016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013473015,0.00028135808,0.00026837477,0.00030664293,0.0002819875,0.00031722666,0.0011640484,0.00009389255,0.00021393725],"category_scores_gemma":[0.00067696284,0.00028300678,0.00014764257,0.0001875507,0.000019506571,0.00037433897,0.00030321119,0.0008041836,0.000090402216],"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.000083461426,0.000072300514,0.0295468,0.00013105605,0.000097080316,0.000011008979,0.00071264623,0.735189,0.0044016875,0.13013172,0.000003081114,0.09962012],"study_design_scores_gemma":[0.000619451,0.00024107534,0.0010887304,0.00030950908,0.0000062837853,0.0000269038,0.00006945151,0.9942286,0.00009823789,0.0019666636,0.0010521775,0.00029288745],"about_ca_topic_score_codex":0.00017421629,"about_ca_topic_score_gemma":0.000064806736,"teacher_disagreement_score":0.8107602,"about_ca_system_score_codex":0.0005021063,"about_ca_system_score_gemma":0.00019617076,"threshold_uncertainty_score":0.9999622},"labels":[],"label_agreement":null},{"id":"W2963540976","doi":"","title":"Invertible Residual Networks","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":193,"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":"Invertible matrix; Jacobian matrix and determinant; Normalization (sociology); Residual; Computer science; Generative grammar; Block (permutation group theory); Algorithm; Simple (philosophy); Theoretical computer science; Artificial intelligence; Mathematics; Applied mathematics","score_opus":0.02215808535166284,"score_gpt":0.2573328756627397,"score_spread":0.23517479031107688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963540976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013410147,0.00006759267,0.8316879,0.006084707,0.0018781696,0.00015819742,0.0000023364075,0.00021910785,0.14649183],"genre_scores_gemma":[0.98803616,0.000042798656,0.0048745517,0.0007430258,0.00023244861,0.000005305606,0.000017083466,0.0000101650685,0.006038483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875635,0.00013647623,0.00017767954,0.00037931604,0.00033282625,0.0002173482],"domain_scores_gemma":[0.9993428,0.00010188861,0.00010274685,0.00024610106,0.00014362442,0.000062816805],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025538885,0.00014526375,0.00013758062,0.00011239181,0.00009793119,0.00030283158,0.00082588725,0.00005315095,0.001081757],"category_scores_gemma":[0.00008004016,0.00013001206,0.000056252207,0.00014014912,0.0000209288,0.0004147406,0.00023759459,0.00040612242,0.0005361688],"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.00006130378,0.000067828834,0.026320959,0.000004067026,0.000093553565,0.000020749529,0.00026066706,0.50509346,0.003242242,0.40295357,0.0013125085,0.06056908],"study_design_scores_gemma":[0.00026756353,0.000117211035,0.0020256513,0.00002961423,0.0000018675306,0.0000039371157,0.000016848864,0.9860976,0.00042677333,0.0012282036,0.009626904,0.00015785843],"about_ca_topic_score_codex":0.00007843553,"about_ca_topic_score_gemma":0.000014108907,"teacher_disagreement_score":0.974626,"about_ca_system_score_codex":0.00003734236,"about_ca_system_score_gemma":0.000039444432,"threshold_uncertainty_score":0.9998314},"labels":[],"label_agreement":null},{"id":"W2963558557","doi":"","title":"A Spectral Approach to Gradient Estimation for Implicit Distributions.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Groundwater flow and contamination studies","field":"Environmental Science","cited_by":26,"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":"Estimator; Applied mathematics; Mathematics; Inference; Kernel (algebra); Computer science; Algorithm; Mathematical optimization; Artificial intelligence; Statistics","score_opus":0.02879580352621477,"score_gpt":0.2923980745180018,"score_spread":0.26360227099178707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963558557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18892312,0.0000017914278,0.76294,0.002468949,0.00022600716,0.00026558168,0.000033760054,0.00006568514,0.04507509],"genre_scores_gemma":[0.98663837,0.0000012150705,0.007985272,0.0002542686,0.00010695455,0.00011416833,0.00014329489,0.000008434858,0.0047479975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.0000273894,0.00015927432,0.00029520164,0.00025304253,0.00018884515],"domain_scores_gemma":[0.9997031,0.000031183677,0.000060129314,0.00009087565,0.00005117734,0.00006354243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017265957,0.000117883836,0.00009451852,0.00005717425,0.00027016355,0.00009011866,0.00021982804,0.000026002182,0.0006081015],"category_scores_gemma":[0.00010431862,0.00010526591,0.000046177287,0.000102896614,0.00006984961,0.00012137398,0.00010559073,0.00010748255,0.00051060197],"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.000405005,0.0005458705,0.06641003,0.000013927103,0.00014112804,0.0000023841576,0.0040529077,0.012135258,0.012819804,0.60674876,0.00453743,0.2921875],"study_design_scores_gemma":[0.00085652235,0.00077491073,0.12528343,0.000027437403,0.000020037232,0.000013067822,0.00022216511,0.77065814,0.0020139066,0.0062177065,0.09349621,0.00041647328],"about_ca_topic_score_codex":0.00016247055,"about_ca_topic_score_gemma":0.00006473434,"teacher_disagreement_score":0.79771525,"about_ca_system_score_codex":0.00017473522,"about_ca_system_score_gemma":0.0000061068513,"threshold_uncertainty_score":0.66582847},"labels":[],"label_agreement":null},{"id":"W2963622136","doi":"","title":"Bidirectional Helmholtz machines","year":2016,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":11,"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; Canadian Institute for Advanced Research","funders":"","keywords":"Inference; Autoencoder; Generative model; Computer science; Helmholtz free energy; Fiducial inference; Algorithm; Artificial intelligence; Bhattacharyya distance; Generative grammar; Frequentist inference; Machine learning; Bayesian inference; Deep learning; Bayesian probability","score_opus":0.029767150963290613,"score_gpt":0.27513869460975704,"score_spread":0.24537154364646643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963622136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035640923,0.00003664854,0.91537356,0.019292051,0.0014073914,0.000066753935,0.000010149597,0.00023511199,0.060014267],"genre_scores_gemma":[0.98148173,0.000069666006,0.007826474,0.00039177798,0.00034666376,0.000011354714,0.00000639657,0.000010209091,0.009855716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873906,0.00013521833,0.00018048067,0.00038404224,0.00036940956,0.00019179173],"domain_scores_gemma":[0.9992752,0.00017069714,0.00010415926,0.00018649874,0.0001917519,0.000071694114],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022634631,0.00015608278,0.00012050078,0.0001494268,0.00015623965,0.00018922832,0.00068997586,0.000041383122,0.0013133221],"category_scores_gemma":[0.00024017152,0.000102693426,0.00007726262,0.00011873013,0.000044438,0.00046382908,0.0001734028,0.00018140659,0.00040124808],"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.000050712257,0.000083968334,0.011968198,0.0000020171692,0.000093343086,0.000023155726,0.00011944184,0.002532681,0.034570567,0.36783695,0.0009835538,0.58173543],"study_design_scores_gemma":[0.00088514655,0.00022138943,0.008293247,0.00011618257,0.000005629083,0.00003419424,0.000010974239,0.8824903,0.0060771974,0.014140942,0.08726098,0.00046385947],"about_ca_topic_score_codex":0.000056819954,"about_ca_topic_score_gemma":0.000019125962,"teacher_disagreement_score":0.9779177,"about_ca_system_score_codex":0.000052499956,"about_ca_system_score_gemma":0.00004104996,"threshold_uncertainty_score":0.99959964},"labels":[],"label_agreement":null},{"id":"W2963642948","doi":"","title":"Synthesizing Programs for Images using Reinforced Adversarial Learning.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":42,"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","funders":"","keywords":"Computer science; Discriminator; MNIST database; Artificial intelligence; Inference; Machine learning; Graphics; Rendering (computer graphics); Adversarial system; Deep learning; Generative grammar; Generative adversarial network; Computer graphics; Reinforcement learning; Computer graphics (images)","score_opus":0.05329083591455927,"score_gpt":0.30830803711602445,"score_spread":0.2550172012014652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963642948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037644329,0.000017686143,0.9810079,0.0011013207,0.0011213599,0.00026748967,0.000003566586,0.00023142327,0.012484829],"genre_scores_gemma":[0.9132045,0.000012492313,0.08330794,0.00015414308,0.0010105122,0.000024440415,0.000026436308,0.000023584369,0.0022359355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981887,0.00017679752,0.00031177572,0.0005432389,0.0003973107,0.0003822035],"domain_scores_gemma":[0.99861956,0.00021979028,0.00026962443,0.00022315317,0.000574885,0.000092984905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300883,0.00024857215,0.00022634015,0.00017984485,0.0005287972,0.0006046513,0.0008753447,0.0000836594,0.0001884722],"category_scores_gemma":[0.00073339156,0.00023176914,0.00014158135,0.00017757187,0.00011632598,0.0006332155,0.00023788598,0.00038089327,0.00006229667],"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.00068434165,0.00013842825,0.0032403143,0.000031884814,0.00045416635,0.00002880536,0.0020743434,0.12214911,0.09787249,0.21990606,0.00044657657,0.5529735],"study_design_scores_gemma":[0.00051524903,0.0004224121,0.00007943692,0.00008927421,0.00001233493,0.000008254802,0.00006592879,0.97729945,0.007825404,0.00080813887,0.012599971,0.00027413218],"about_ca_topic_score_codex":0.00013760522,"about_ca_topic_score_gemma":0.000010479116,"teacher_disagreement_score":0.9094401,"about_ca_system_score_codex":0.00008427634,"about_ca_system_score_gemma":0.00009420902,"threshold_uncertainty_score":0.9451271},"labels":[],"label_agreement":null},{"id":"W2963723885","doi":"","title":"Understanding the Origins of Bias in Word Embeddings","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":58,"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":"Computer science; Word (group theory); Word embedding; Natural language processing; Embedding; Artificial intelligence; TRACE (psycholinguistics); Harm; Machine learning; Linguistics; Psychology","score_opus":0.10216070678590511,"score_gpt":0.34135641771307296,"score_spread":0.23919571092716785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963723885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23283571,0.00020180266,0.71854305,0.009197863,0.00078550837,0.00031941413,0.0000036517647,0.00040747187,0.037705537],"genre_scores_gemma":[0.98643374,0.000013259627,0.012929112,0.00017460497,0.000018569088,0.0000036342926,0.0000032484777,0.0000062970043,0.0004175359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900633,0.000084707826,0.00019204657,0.00022082005,0.00036415152,0.00013193274],"domain_scores_gemma":[0.9993303,0.00021530074,0.00017092717,0.00018373854,0.00008125187,0.000018518022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004814647,0.00009943401,0.0001167081,0.00021913956,0.00004086605,0.0001415154,0.0010599834,0.000039678132,0.00013607283],"category_scores_gemma":[0.00020251301,0.00006958447,0.000038156355,0.00025522424,0.00003100031,0.00028696572,0.00019807926,0.0005054864,0.000026368563],"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.00001243342,0.00001330868,0.017296365,0.00000612516,0.0000073350116,0.0000044963367,0.0006132139,0.0005096245,0.0020014949,0.9747549,0.000008413047,0.004772237],"study_design_scores_gemma":[0.00043476064,0.00012991966,0.0014686222,0.00040565882,0.0000022611093,0.000014115817,0.0003304123,0.8239937,0.0034386604,0.16828428,0.0012667474,0.0002308921],"about_ca_topic_score_codex":0.00018682764,"about_ca_topic_score_gemma":0.000031565458,"teacher_disagreement_score":0.82348406,"about_ca_system_score_codex":0.0002258279,"about_ca_system_score_gemma":0.000049255992,"threshold_uncertainty_score":0.28375724},"labels":[],"label_agreement":null},{"id":"W2963789586","doi":"","title":"Training deep neural networks via direct loss minimization","year":2016,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":55,"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":"Computer science; Artificial neural network; Artificial intelligence; Minification; Machine learning; Deep neural networks; Entropy (arrow of time); Context (archaeology); Cross entropy; Ranking (information retrieval); Deep learning; Pattern recognition (psychology)","score_opus":0.037073720324860934,"score_gpt":0.29698504882090826,"score_spread":0.2599113284960473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963789586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019957197,0.000031786865,0.9793006,0.006293365,0.0004990451,0.000118886244,0.0000025855722,0.0003631872,0.011394809],"genre_scores_gemma":[0.9897085,0.00006377894,0.008593721,0.00047948377,0.00025598166,0.00004166,0.000023107727,0.000020818687,0.00081294146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983779,0.00012775218,0.00028941626,0.00053502416,0.000356534,0.0003133786],"domain_scores_gemma":[0.9988525,0.00034486447,0.00021975065,0.00030115276,0.00017554294,0.00010622686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015511792,0.0002041561,0.00016325981,0.00013900481,0.0001988178,0.00014506659,0.0009883615,0.00006314666,0.00020983971],"category_scores_gemma":[0.000154109,0.00015754497,0.00006933644,0.00025413153,0.00006227908,0.00058179634,0.00020176837,0.00031104186,0.000076382814],"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.000026585956,0.000029468849,0.0024565477,0.0000011272467,0.000022760853,0.000015356198,0.0001926615,0.15599851,0.0010426557,0.11272587,0.000022708653,0.72746575],"study_design_scores_gemma":[0.00031994111,0.00007013627,0.0010133048,0.000029476618,0.0000029279136,0.000025503747,0.00000739254,0.9906861,0.00011664674,0.0040461277,0.0034726476,0.00020979573],"about_ca_topic_score_codex":0.0000086010705,"about_ca_topic_score_gemma":0.000017403047,"teacher_disagreement_score":0.9877128,"about_ca_system_score_codex":0.00007709866,"about_ca_system_score_gemma":0.0000183462,"threshold_uncertainty_score":0.64244974},"labels":[],"label_agreement":null},{"id":"W2963827215","doi":"","title":"Differentiable Compositional Kernel Learning for Gaussian Processes","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":29,"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":"Kernel (algebra); Extrapolation; Differentiable function; Generalization; Computer science; Artificial intelligence; Artificial neural network; Gaussian process; Mathematics; Gaussian; Algorithm; Pattern recognition (psychology); Discrete mathematics; Statistics; Pure mathematics; Mathematical analysis","score_opus":0.02641541766885436,"score_gpt":0.29616444822546417,"score_spread":0.2697490305566098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963827215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009447845,0.000041690786,0.9332802,0.0052168057,0.00052644213,0.00021963898,0.000014445472,0.00038549272,0.050867386],"genre_scores_gemma":[0.97734076,0.0000342148,0.016619144,0.00040898426,0.0004158416,0.00006561954,0.00010713352,0.000023629736,0.0049846442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997983,0.00007448754,0.00033854382,0.00066071196,0.00052972493,0.00041356322],"domain_scores_gemma":[0.99833524,0.00018570476,0.00026391802,0.00021774221,0.0008640552,0.00013331638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023230552,0.00028044856,0.0002276183,0.00023241469,0.00057899125,0.00076748984,0.001301064,0.00008956126,0.0007076408],"category_scores_gemma":[0.0003417601,0.00025333543,0.000084589235,0.00029012046,0.00011648961,0.0006059737,0.00023990753,0.00049340347,0.00022876597],"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.00014020827,0.00020272301,0.010443052,0.00010272905,0.00009731917,0.000010022939,0.0007004408,0.0006117923,0.0025763381,0.9650436,0.00045015136,0.01962161],"study_design_scores_gemma":[0.0012948764,0.0013058502,0.0051171947,0.00038301773,0.000016539729,0.00005715833,0.0000964088,0.89609206,0.004940758,0.056525346,0.033454552,0.0007162661],"about_ca_topic_score_codex":0.00003232285,"about_ca_topic_score_gemma":0.000025559591,"teacher_disagreement_score":0.96789294,"about_ca_system_score_codex":0.00006182768,"about_ca_system_score_gemma":0.00021784907,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W2964035032","doi":"","title":"Towards Binary-Valued Gates for Robust LSTM Training","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":6,"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; Generalization; Binary number; Computation; Sequence (biology); Compression (physics); Artificial intelligence; Rank (graph theory); Algorithm; Logic gate; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.12127680136731257,"score_gpt":0.3393365146854237,"score_spread":0.21805971331811114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964035032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017644458,0.000018441639,0.94406253,0.005775835,0.0010468302,0.00014389295,0.0000056858116,0.00025961522,0.031042684],"genre_scores_gemma":[0.8588766,0.000005669601,0.13856037,0.0004585178,0.00044926163,0.000025598172,0.000019622443,0.00001464481,0.0015897226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985109,0.00006976075,0.00026010355,0.0004879106,0.00038354154,0.00028780417],"domain_scores_gemma":[0.99907976,0.00009413883,0.00013929752,0.00024471708,0.00036318778,0.00007890744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047177752,0.00017280281,0.00016293806,0.00018570089,0.00022440014,0.00029941925,0.0010895141,0.00006264564,0.00031844666],"category_scores_gemma":[0.00038050333,0.00016348738,0.00008022815,0.000116731506,0.000055356606,0.00033604525,0.00020956136,0.00030309928,0.00008074324],"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.00004893364,0.000037747905,0.000695111,0.000008553753,0.000048677455,0.0000075746107,0.0024502038,0.009994771,0.0019424038,0.8078807,0.00010981759,0.17677553],"study_design_scores_gemma":[0.00044044195,0.0002871559,0.000379365,0.00006270204,0.0000034506788,0.000009427218,0.000101277685,0.9832795,0.0004315979,0.008827111,0.005990924,0.00018700177],"about_ca_topic_score_codex":0.000083848456,"about_ca_topic_score_gemma":0.000020134943,"teacher_disagreement_score":0.9732848,"about_ca_system_score_codex":0.00006261229,"about_ca_system_score_gemma":0.000118420125,"threshold_uncertainty_score":0.6666822},"labels":[],"label_agreement":null},{"id":"W2964116109","doi":"","title":"Regularizers versus Losses for Nonlinear Dimensionality Reduction: A Factored View with New Convex Relaxations","year":2012,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Dimensionality reduction; Reduction (mathematics); Regular polygon; Nonlinear system; Mathematics; Curse of dimensionality; Mathematical optimization; Computer science; Applied mathematics; Artificial intelligence; Physics; Geometry","score_opus":0.06546883029256352,"score_gpt":0.3103205734802099,"score_spread":0.2448517431876464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964116109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60122424,0.0012662489,0.32045516,0.0070615574,0.0068276688,0.0014991034,0.00016627698,0.0039596474,0.057540067],"genre_scores_gemma":[0.9861126,0.00006128052,0.012475253,0.000035683926,0.0003812852,0.000019583716,0.00019558493,0.000031496114,0.00068721944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992033,0.000028303331,0.0001735124,0.00016727902,0.00023459675,0.00019299268],"domain_scores_gemma":[0.99941343,0.00010241854,0.00008096939,0.00014355703,0.00016447026,0.0000951298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010209037,0.00016888417,0.0001551841,0.00008804061,0.00011051463,0.000059584894,0.0001398931,0.00006457783,0.00023783687],"category_scores_gemma":[0.000098081255,0.00015043415,0.00005647877,0.00007256354,0.000040803137,0.00020883093,0.000023877697,0.00029224207,0.000023310027],"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.0057394807,0.0007413255,0.021624701,0.00018429325,0.0032870055,0.00002409789,0.003424534,0.16588624,0.10571345,0.55957335,0.02050932,0.11329223],"study_design_scores_gemma":[0.0054840976,0.0010654965,0.007113613,0.00089671614,0.00020958322,0.00012129498,0.0006365299,0.6449754,0.04597703,0.0050121523,0.28689986,0.001608198],"about_ca_topic_score_codex":0.0000687682,"about_ca_topic_score_gemma":0.000011212482,"teacher_disagreement_score":0.5545612,"about_ca_system_score_codex":0.000077000615,"about_ca_system_score_gemma":0.000041375923,"threshold_uncertainty_score":0.6134526},"labels":[],"label_agreement":null},{"id":"W2964155212","doi":"","title":"Adversarial Distillation of Bayesian Neural Network Posteriors","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":11,"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":"Computer science; Bayesian probability; Artificial neural network; Posterior probability; Distillation; Artificial intelligence; Machine learning; Markov chain Monte Carlo; Langevin dynamics; Adversarial system; Variance (accounting); Mathematics; Statistics; Chemistry","score_opus":0.023221817081329713,"score_gpt":0.29423572523240576,"score_spread":0.27101390815107607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964155212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030278442,0.000016381364,0.9192001,0.002798729,0.003395187,0.00019099267,0.0000057771003,0.0002853326,0.043829013],"genre_scores_gemma":[0.97823745,0.0000058234673,0.020069076,0.00021961058,0.00096574624,0.0000060268203,0.00003178615,0.000019941359,0.0004445299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978943,0.00026625078,0.00043170725,0.00048282757,0.000612732,0.00031219693],"domain_scores_gemma":[0.9986021,0.00017571052,0.00043289235,0.00033455782,0.0003670631,0.00008769269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044582883,0.0002294531,0.00024596398,0.00019684754,0.00023874259,0.00016524714,0.0011854714,0.000092456066,0.00057027856],"category_scores_gemma":[0.00045628202,0.00022407835,0.00010133616,0.0003105943,0.00014415766,0.00051022397,0.00044967094,0.0005513144,0.000064266336],"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.00041139883,0.00007051875,0.06346118,0.000013376081,0.000117488446,0.000027767144,0.001199988,0.28211755,0.0015440776,0.49616548,0.00012587241,0.15474531],"study_design_scores_gemma":[0.0005425754,0.0003533124,0.0069340295,0.00006467471,0.0000072781463,0.000013503211,0.00002552517,0.9847213,0.0001219443,0.0047099595,0.0022923225,0.00021359693],"about_ca_topic_score_codex":0.00015321559,"about_ca_topic_score_gemma":0.000030332949,"teacher_disagreement_score":0.947959,"about_ca_system_score_codex":0.00006924903,"about_ca_system_score_gemma":0.0000689614,"threshold_uncertainty_score":0.913765},"labels":[],"label_agreement":null},{"id":"W2964212410","doi":"","title":"On calibration of modern neural networks","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":1185,"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":"Normalization (sociology); Computer science; Artificial neural network; Correctness; Calibration; Scaling; Deep neural networks; Artificial intelligence; Machine learning; Simple (philosophy); Deep learning; Pattern recognition (psychology); Data mining; Algorithm; Mathematics; Statistics","score_opus":0.035265833212912136,"score_gpt":0.31205347794228316,"score_spread":0.276787644729371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964212410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017135227,0.0000054129164,0.96183634,0.0025252865,0.00017285343,0.00006941536,0.0000025506122,0.00012073932,0.018132204],"genre_scores_gemma":[0.9968289,0.000012213824,0.0022180995,0.00016559508,0.000055708868,0.000015960752,0.000008767826,0.0000060258903,0.0006887113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928427,0.00003303991,0.00015839183,0.00022286964,0.00021118498,0.00009026213],"domain_scores_gemma":[0.99918073,0.000042732292,0.0002688504,0.00037144346,0.00010209167,0.000034159802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011206497,0.00008732355,0.00008597664,0.000078252524,0.00026787244,0.00024645482,0.00093637925,0.000043513533,0.00007741734],"category_scores_gemma":[0.000059705897,0.000080864316,0.0000492567,0.000033559456,0.000038516897,0.0002955308,0.0001487578,0.0002706188,0.000006331112],"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.00001625396,0.00003500897,0.0015913155,0.0000012305046,0.0000091963,0.0000015976904,0.000038132082,0.0375682,0.00069517584,0.8622808,0.00003506221,0.097728044],"study_design_scores_gemma":[0.000113787864,0.00011953512,0.0026206446,0.000016320982,0.0000011520626,0.0000023650427,0.000002183393,0.9769416,0.0008270384,0.019078016,0.00020296227,0.000074383344],"about_ca_topic_score_codex":0.00006325945,"about_ca_topic_score_gemma":0.000009126119,"teacher_disagreement_score":0.9796937,"about_ca_system_score_codex":0.000018980978,"about_ca_system_score_gemma":0.000013365007,"threshold_uncertainty_score":0.3297551},"labels":[],"label_agreement":null},{"id":"W2964271895","doi":"","title":"Augmented CycleGAN: Learning Many-to-Many Mappings from Unpaired Data","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":85,"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","funders":"","keywords":"Computer science; Domain (mathematical analysis); Image (mathematics); Artificial intelligence; Segmentation; Image segmentation; Pattern recognition (psychology); Mathematics","score_opus":0.07715892650561458,"score_gpt":0.3242514679354985,"score_spread":0.24709254142988396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964271895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033613596,0.0000306861,0.89246166,0.012099397,0.0014263006,0.00022645251,0.000034786706,0.0008623964,0.05924473],"genre_scores_gemma":[0.96404666,0.000020942738,0.025645263,0.0017665214,0.00049316214,0.000013893961,0.0004751955,0.00003716401,0.007501218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656594,0.0003568544,0.00049117196,0.0011653678,0.00095066224,0.0004699898],"domain_scores_gemma":[0.9979652,0.00022360739,0.0003299528,0.000831179,0.00039388976,0.00025617552],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00090978015,0.0003387793,0.000283234,0.00042825285,0.0005055742,0.0009049326,0.003348314,0.000101983234,0.0018492837],"category_scores_gemma":[0.0007988482,0.0003494881,0.00007374685,0.00044817085,0.00009595695,0.0009517297,0.0014909268,0.0010174732,0.0024160347],"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.00039105662,0.00033802906,0.035422396,0.000019154539,0.0005587362,0.00019615053,0.010491584,0.013050506,0.024421945,0.4418803,0.0038863139,0.46934384],"study_design_scores_gemma":[0.0006390338,0.00022459532,0.009174067,0.00012341539,0.0000074279847,0.000008559222,0.00025785583,0.8212873,0.00023021667,0.001101819,0.16658452,0.0003611942],"about_ca_topic_score_codex":0.000644004,"about_ca_topic_score_gemma":0.000075345546,"teacher_disagreement_score":0.93043303,"about_ca_system_score_codex":0.00011628702,"about_ca_system_score_gemma":0.00010449955,"threshold_uncertainty_score":0.9998957},"labels":[],"label_agreement":null},{"id":"W2964278219","doi":"","title":"Thompson Sampling for Combinatorial Semi-Bandits.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":24,"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":"Regret; Thompson sampling; Matroid; Oracle; Sampling (signal processing); Mathematics; Mathematical optimization; Independence (probability theory); Computer science; Combinatorics; Statistics","score_opus":0.27226303544098335,"score_gpt":0.5115727209194741,"score_spread":0.2393096854784908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964278219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038872704,0.000056435245,0.876223,0.007860162,0.009188243,0.0006977632,0.0001550353,0.0002613452,0.06668529],"genre_scores_gemma":[0.9862724,0.000014032949,0.003384513,0.00015998534,0.0018837713,0.000038157235,0.00006253165,0.000026281514,0.008158306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634326,0.00018484305,0.00050579006,0.0006658003,0.0019172358,0.00038306578],"domain_scores_gemma":[0.99563515,0.0018819023,0.000279973,0.00030987253,0.0017614235,0.00013167779],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021138808,0.00019870936,0.00026550225,0.00034214492,0.00045254364,0.0005660841,0.0012546323,0.00009751853,0.0038150046],"category_scores_gemma":[0.009208562,0.0001597294,0.00012639661,0.00032198554,0.00018875368,0.0003482532,0.00022051306,0.00055657147,0.0008005794],"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.0030121196,0.00039690558,0.01931644,0.000014959184,0.0002164804,0.00002651023,0.0018656986,0.012813391,0.009623867,0.46602952,0.0053274124,0.48135668],"study_design_scores_gemma":[0.0017921856,0.0008651336,0.001680142,0.0000543652,0.0000053807485,0.000009800691,0.0003037155,0.53743833,0.0022101968,0.19962019,0.2556994,0.00032119278],"about_ca_topic_score_codex":0.000027407481,"about_ca_topic_score_gemma":0.000026300266,"teacher_disagreement_score":0.94739974,"about_ca_system_score_codex":0.0001156936,"about_ca_system_score_gemma":0.000112909904,"threshold_uncertainty_score":0.9999774},"labels":[],"label_agreement":null},{"id":"W2964304579","doi":"","title":"On orthogonality and learning recurrent networks with long term dependencies","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Orthogonality; Backpropagation; Artificial neural network; Computer science; Convergence (economics); Term (time); Stability (learning theory); Property (philosophy); Matrix (chemical analysis); Norm (philosophy); Applied mathematics; Mathematical optimization; Gradient method; Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.032612500154181503,"score_gpt":0.2885483512715729,"score_spread":0.2559358511173914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964304579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93856084,0.000116822404,0.021885073,0.00025617986,0.00029574885,0.000098150296,0.0000027656251,0.0004666147,0.03831783],"genre_scores_gemma":[0.998873,0.00021062623,0.00034257522,0.000039625196,0.00009821677,0.000007794613,0.000024074536,0.000025289997,0.0003787889],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915123,0.000057956622,0.00013187237,0.00023580919,0.0002513874,0.00017172215],"domain_scores_gemma":[0.9994639,0.00008660552,0.00010977895,0.00019274795,0.000090276095,0.000056660996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001649899,0.00018598295,0.00014896988,0.000078225974,0.00037122855,0.00035213056,0.00027360214,0.000060201637,0.00010367186],"category_scores_gemma":[0.00013298714,0.00015939605,0.00003069193,0.000018823976,0.0000704089,0.00014596601,0.00008647233,0.00095212494,0.000009312996],"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.00037687487,0.00006179783,0.44246075,0.000026513395,0.0002628612,0.00018556046,0.00032332414,0.25271475,0.0011678585,0.034032382,0.00009076093,0.26829654],"study_design_scores_gemma":[0.00038026867,0.0003003916,0.23487572,0.0005608885,0.000014126868,0.000032504762,0.000024068268,0.761909,0.00048610475,0.00057482923,0.0005209588,0.000321134],"about_ca_topic_score_codex":0.00005597006,"about_ca_topic_score_gemma":0.00011184991,"teacher_disagreement_score":0.50919425,"about_ca_system_score_codex":0.000035912308,"about_ca_system_score_gemma":0.0000098907185,"threshold_uncertainty_score":0.6499982},"labels":[],"label_agreement":null},{"id":"W3003585919","doi":"","title":"GainForest: Scaling Climate Finance for Forest Conservation using Interpretable Machine Learning on Satellite Imagery","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Institute for Cancer Research","funders":"","keywords":"Satellite imagery; Remote sensing; Computer science; Satellite; Scaling; Artificial intelligence; Environmental science; Environmental resource management; Meteorology; Machine learning; Geography; Engineering; Mathematics","score_opus":0.024414895533244437,"score_gpt":0.2833920555524063,"score_spread":0.2589771600191619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003585919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92127436,0.000027493139,0.016958876,0.0012594588,0.00038819882,0.00051681965,0.00004127057,0.00015387461,0.059379634],"genre_scores_gemma":[0.990384,0.00010618518,0.005198496,0.00054857845,0.00007234999,0.000011254152,0.00031332622,0.000042365824,0.0033234411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982128,0.00009193101,0.00038611452,0.0005253695,0.00040564255,0.00037811245],"domain_scores_gemma":[0.9990193,0.00028569577,0.00032591357,0.00023295725,0.00007160541,0.00006452427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052355276,0.0002563307,0.00022818368,0.00012580764,0.00034397235,0.0002024647,0.00031782122,0.000088453075,0.00065106794],"category_scores_gemma":[0.0002392227,0.00024965976,0.00011478646,0.00016106482,0.0000845233,0.000284275,0.00014151479,0.0005911144,0.0007171104],"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.00037850536,0.000079851656,0.338738,0.000027512046,0.00003520506,0.000004293499,0.00040403765,0.5846626,0.021446133,0.014979302,0.00004618809,0.039198376],"study_design_scores_gemma":[0.00047464753,0.00015823843,0.02081615,0.00019308364,0.0000107664855,0.000008762092,0.00006571948,0.951432,0.00048211598,0.00076014875,0.025327144,0.00027126126],"about_ca_topic_score_codex":0.00063254195,"about_ca_topic_score_gemma":0.000118452306,"teacher_disagreement_score":0.36676934,"about_ca_system_score_codex":0.00021616994,"about_ca_system_score_gemma":0.000024503193,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W3034189935","doi":"","title":"Online mirror descent and dual averaging: keeping pace in the dynamic case","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Blockchain Technology Applications and Security","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":"Dual (grammatical number); Pace; Computer science; Stochastic gradient descent; Descent (aeronautics); Artificial intelligence; Engineering; Aerospace engineering; Geodesy; Artificial neural network; Geography","score_opus":0.038844207665861066,"score_gpt":0.301901075546146,"score_spread":0.26305686788028493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034189935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7906391,0.0000824818,0.08842393,0.119670324,0.00006796658,0.00016280562,0.000007947138,0.00015655068,0.0007888797],"genre_scores_gemma":[0.99271816,0.000042656167,0.005196075,0.001976464,0.000014651423,0.000012918907,0.00001275683,0.0000046394284,0.000021693197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991358,0.00009609096,0.0001575493,0.0003097045,0.00016973671,0.00013111724],"domain_scores_gemma":[0.99958324,0.000099148005,0.00007408033,0.00015399736,0.000049088332,0.00004044679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021659718,0.000103015445,0.00009237027,0.000086769425,0.0001309189,0.0001219162,0.0005106323,0.000047340767,0.000021175783],"category_scores_gemma":[0.00010935256,0.00008465782,0.00002199593,0.00018086637,0.00004747509,0.000092785034,0.00021073868,0.00066754816,0.00001091551],"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.000028454398,0.000259316,0.011847645,0.000016962207,0.000034705266,0.0013734663,0.008673172,0.0006748293,0.0013865565,0.84811634,0.000024850486,0.12756369],"study_design_scores_gemma":[0.00026627278,0.000066552944,0.0043839603,0.000018270312,0.0000019342135,0.000404057,0.00032756783,0.9898592,0.00002536039,0.0027485327,0.0017973008,0.00010097224],"about_ca_topic_score_codex":0.00016859022,"about_ca_topic_score_gemma":0.00025500066,"teacher_disagreement_score":0.9891844,"about_ca_system_score_codex":0.000026117184,"about_ca_system_score_gemma":0.0000243193,"threshold_uncertainty_score":0.3452246},"labels":[],"label_agreement":null},{"id":"W3034251599","doi":"","title":"Distributed Online Optimization over a Heterogeneous Network","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Energy Efficient Wireless Sensor Networks","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":"Computer science; Distributed computing","score_opus":0.030833012846506205,"score_gpt":0.26788783215362594,"score_spread":0.23705481930711975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034251599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008770212,0.000044941055,0.9799561,0.007588853,0.0004840231,0.0000835964,0.000021914968,0.00043360362,0.0026167629],"genre_scores_gemma":[0.96990687,0.00005602038,0.026884317,0.0021243307,0.00042468487,0.0000053857943,0.00045497582,0.000020117259,0.00012332143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983044,0.00013903607,0.00028488893,0.0005017857,0.00048197506,0.000287872],"domain_scores_gemma":[0.99918455,0.0000941214,0.00019204241,0.00020569962,0.00017215755,0.00015140642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010065272,0.00020546644,0.00017683647,0.000061022056,0.00013665727,0.00027608595,0.0009841259,0.000076443765,0.00037413582],"category_scores_gemma":[0.00015085886,0.00020316403,0.00007937593,0.0003330643,0.00002892639,0.00020718965,0.00030856542,0.00050417404,0.000045628207],"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.000031785625,0.00004410161,0.0013206858,0.0000019638112,0.00002984431,0.000034924826,0.00007501424,0.960468,0.00007221391,0.034452636,0.00014171282,0.0033271313],"study_design_scores_gemma":[0.0003599827,0.00014167707,0.00028074082,0.00003604179,0.0000037032364,0.000009375175,0.000005152902,0.99415845,0.000041880638,0.00012694599,0.00463306,0.00020299455],"about_ca_topic_score_codex":0.000024628474,"about_ca_topic_score_gemma":0.000011677993,"teacher_disagreement_score":0.96113664,"about_ca_system_score_codex":0.000057467776,"about_ca_system_score_gemma":0.00003495563,"threshold_uncertainty_score":0.8284789},"labels":[],"label_agreement":null},{"id":"W3034360859","doi":"","title":"Learning with Good Feature Representations in Bandits and in RL with a Generative Model","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":57,"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":"Feature (linguistics); Generative model; Generative grammar; Computer science; Artificial intelligence; Feature learning; Machine learning; Linguistics","score_opus":0.03676985648599293,"score_gpt":0.3016793059080322,"score_spread":0.2649094494220393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034360859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.305977,0.00003492242,0.64385074,0.024251321,0.00003225096,0.00034197237,0.000019300182,0.00039208322,0.025100462],"genre_scores_gemma":[0.9239329,0.000022640845,0.07527363,0.00028884003,0.000018759734,0.00003010893,0.00004868552,0.000011107975,0.00037332307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987976,0.00011695353,0.00014225034,0.00048757961,0.00029997545,0.00015562752],"domain_scores_gemma":[0.9995325,0.00008081152,0.000108577704,0.00012768105,0.00008617042,0.00006426317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013966685,0.0001553088,0.00015333078,0.00019630884,0.000063835854,0.00023012742,0.00045226596,0.000043461452,0.0000147454975],"category_scores_gemma":[0.00014661689,0.00012726606,0.000011564483,0.0002871142,0.000040812087,0.000503702,0.0001968386,0.0007994889,0.000003871478],"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.00045416976,0.000120102064,0.38671613,0.00001929194,0.00006406941,0.00033927622,0.013052515,0.39715558,0.0023200405,0.17538375,0.00012948418,0.024245603],"study_design_scores_gemma":[0.00062278385,0.00039045396,0.009510461,0.00012822833,0.0000021060114,0.000017875464,0.0001655002,0.9878534,0.00034708244,0.00061553024,0.0001831125,0.0001634667],"about_ca_topic_score_codex":0.00010901757,"about_ca_topic_score_gemma":0.00035220504,"teacher_disagreement_score":0.6179559,"about_ca_system_score_codex":0.000042156058,"about_ca_system_score_gemma":0.00008214632,"threshold_uncertainty_score":0.5189759},"labels":[],"label_agreement":null},{"id":"W3034370310","doi":"","title":"Detecting Out-of-Distribution Examples with Gram Matrices","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Dalhousie University","funders":"","keywords":"Gram; Computer science; n-gram; Distribution (mathematics); Mathematics; Artificial intelligence; Geology","score_opus":0.05855191741722271,"score_gpt":0.29597505400348045,"score_spread":0.23742313658625774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034370310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07263299,0.000033390563,0.91480505,0.008328484,0.00012979418,0.000109983645,0.000013368662,0.00020444293,0.0037424888],"genre_scores_gemma":[0.99375784,0.00002352422,0.0058326,0.0001917586,0.00008984605,0.00000940721,0.000036336758,0.000005501812,0.00005317314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917763,0.000040334722,0.00016252608,0.00025196496,0.00025506338,0.00011248275],"domain_scores_gemma":[0.99943864,0.00009087189,0.00017443423,0.0001040441,0.00013384547,0.00005818575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084653904,0.0000956927,0.000098499615,0.000031324587,0.00009776289,0.00012897149,0.0005374691,0.000023148206,0.000049581304],"category_scores_gemma":[0.000063554726,0.00007830212,0.000031870703,0.00017743492,0.000023785047,0.00018081046,0.00010806183,0.00026396077,0.000027091046],"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.000092921706,0.000086695465,0.012568739,0.000026273754,0.00007439657,0.000017582563,0.0010564411,0.029236289,0.014764898,0.7302577,0.00020005053,0.21161804],"study_design_scores_gemma":[0.0002529261,0.00029453778,0.0018925895,0.00005140345,0.0000050365056,0.00000492845,0.000058937436,0.98402023,0.0018957962,0.0012625309,0.010105921,0.00015517169],"about_ca_topic_score_codex":0.000039723676,"about_ca_topic_score_gemma":0.00001269096,"teacher_disagreement_score":0.9547839,"about_ca_system_score_codex":0.000014235534,"about_ca_system_score_gemma":0.000023604283,"threshold_uncertainty_score":0.3193068},"labels":[],"label_agreement":null},{"id":"W3034607397","doi":"","title":"An Optimistic Perspective on Offline Deep Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Perspective (graphical); Artificial intelligence; Reinforcement; Machine learning; Psychology; Social psychology","score_opus":0.04466082375581626,"score_gpt":0.3204855486435333,"score_spread":0.27582472488771703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034607397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010088803,0.000011194637,0.8987529,0.008804753,0.0003144306,0.00016790492,7.591048e-7,0.0004824117,0.09045677],"genre_scores_gemma":[0.987827,0.000032112835,0.0073091597,0.0023239984,0.0002710194,0.000014404633,0.000081317914,0.000032690317,0.0021083124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970936,0.00024443452,0.00042013868,0.0008665926,0.0009925388,0.0003826787],"domain_scores_gemma":[0.9983172,0.00017684915,0.00033432158,0.0004445173,0.00044911046,0.00027802537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035730118,0.00034040876,0.0002611411,0.00021656958,0.0003052919,0.0005476592,0.0017003585,0.00008654805,0.0008736206],"category_scores_gemma":[0.0012997789,0.00033519752,0.000103355516,0.0002624735,0.000057045876,0.00052894175,0.0002948053,0.0014518903,0.00059282896],"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.00007535339,0.000029187295,0.00048476923,0.000004593856,0.00004354318,0.000027346403,0.0016120665,0.74410737,0.00047593834,0.24999066,0.000020371515,0.0031287782],"study_design_scores_gemma":[0.00065690133,0.0020554631,0.00023886896,0.00004920723,0.000008156555,0.0000065083877,0.00047414863,0.9927591,0.00023477108,0.0003573168,0.0028104163,0.000349149],"about_ca_topic_score_codex":0.00006817735,"about_ca_topic_score_gemma":0.00000241486,"teacher_disagreement_score":0.9868181,"about_ca_system_score_codex":0.00025192264,"about_ca_system_score_gemma":0.00010221856,"threshold_uncertainty_score":0.99991},"labels":[],"label_agreement":null},{"id":"W3034672496","doi":"","title":"Fundamental Tradeoffs between Invariance and Sensitivity to Adversarial Perturbations","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Adversarial system; Computer science; Invariant (physics); Sensitivity (control systems); Artificial intelligence; Robustness (evolution); Class (philosophy); Machine learning; Theoretical computer science; Mathematics","score_opus":0.06015761417466957,"score_gpt":0.29790528748645295,"score_spread":0.23774767331178337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034672496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047017474,0.000010000199,0.8792044,0.06474977,0.0004838726,0.00022387886,0.000024946901,0.00033288263,0.007952775],"genre_scores_gemma":[0.9727452,0.0000063073003,0.023700746,0.0027117208,0.0005212945,0.0000087163535,0.000039807455,0.000018898249,0.00024732106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790674,0.0003081234,0.0002815272,0.0006854077,0.0005441864,0.00027400142],"domain_scores_gemma":[0.9988918,0.00036487984,0.00015089492,0.00018529751,0.00011403999,0.00029311137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036935904,0.0002462764,0.00025334448,0.0001467221,0.00029536217,0.00038968882,0.0005404652,0.00007897433,0.00016331213],"category_scores_gemma":[0.0010266885,0.00025728677,0.00006209015,0.00027705374,0.000055154003,0.00057973067,0.00059570925,0.00086445455,0.00014149379],"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.00032832977,0.000114927825,0.13639925,0.0000344857,0.00029454945,0.0002638646,0.013171578,0.1141917,0.011041443,0.58774257,0.00046570218,0.13595162],"study_design_scores_gemma":[0.0007496294,0.00028802038,0.022102978,0.000042812604,0.000011188588,0.000018626446,0.00012799542,0.9655361,0.00013991787,0.0008804946,0.009742175,0.00036001988],"about_ca_topic_score_codex":0.00014765591,"about_ca_topic_score_gemma":0.000014186702,"teacher_disagreement_score":0.9257277,"about_ca_system_score_codex":0.000085356995,"about_ca_system_score_gemma":0.00007696747,"threshold_uncertainty_score":0.99998796},"labels":[],"label_agreement":null},{"id":"W3034727712","doi":"","title":"Tails of Lipschitz Triangular Flows","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"","keywords":"Lipschitz continuity; Transformation (genetics); Gaussian; Density estimation; Probability density function; Flow (mathematics); Computer science; Statistical physics; Algorithm; Mathematical optimization; Mathematics; Mathematical analysis; Physics; Geometry; Statistics; Estimator","score_opus":0.046527295370293154,"score_gpt":0.27012380389539,"score_spread":0.22359650852509683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034727712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009581969,0.000058499732,0.9517064,0.015213708,0.00039438278,0.0000963052,0.000007059624,0.000094616116,0.02284705],"genre_scores_gemma":[0.9808546,0.000024643457,0.017965255,0.00064926135,0.00021269024,0.0000037808998,0.000010011502,0.0000073099272,0.00027245545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988856,0.00013926243,0.00023078694,0.00029026277,0.0003245676,0.00012954591],"domain_scores_gemma":[0.99938095,0.000080306825,0.00014999132,0.0001408145,0.00016513503,0.00008282158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017035764,0.00012172573,0.00017315513,0.000068602,0.00006121206,0.000113105554,0.0007714554,0.000035790985,0.00051383936],"category_scores_gemma":[0.0003626774,0.000108994376,0.000086661144,0.00015340638,0.000022590511,0.0002493757,0.00017118365,0.00026780413,0.00008601674],"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.00024536916,0.00015827196,0.0037931458,0.000024208966,0.0002795269,0.00006138011,0.0028618786,0.1883409,0.10580378,0.42930198,0.0008643493,0.26826522],"study_design_scores_gemma":[0.00035703846,0.00017883185,0.00025640966,0.000022418624,0.0000037517768,0.0000015349302,0.00003065911,0.984418,0.0049986765,0.0007865105,0.00883074,0.000115476774],"about_ca_topic_score_codex":0.0000358453,"about_ca_topic_score_gemma":0.0000043284504,"teacher_disagreement_score":0.97127265,"about_ca_system_score_codex":0.000013114055,"about_ca_system_score_gemma":0.0000444392,"threshold_uncertainty_score":0.5626181},"labels":[],"label_agreement":null},{"id":"W3034833014","doi":"","title":"OPtions as REsponses: Grounding behavioural hierarchies in multi-agent reinforcement learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":10,"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":"Reinforcement learning; Computer science; Ground; Reinforcement; Artificial intelligence; Cognitive psychology; Human–computer interaction; Cognitive science; Psychology; Engineering; Social psychology; Electrical engineering","score_opus":0.12890161320820673,"score_gpt":0.34831895195492124,"score_spread":0.2194173387467145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034833014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042711016,0.000034387576,0.93841386,0.007590912,0.0004968829,0.00028366433,0.000001386864,0.00041556617,0.010052343],"genre_scores_gemma":[0.98164696,0.000116995456,0.011560422,0.0008189139,0.00006977585,0.000035842982,0.00006433506,0.000027257598,0.005659487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970029,0.0004487997,0.000606654,0.0006194619,0.0008693262,0.0004528459],"domain_scores_gemma":[0.9988338,0.00023667066,0.0003139128,0.00024806053,0.0001651907,0.00020239888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000619512,0.00031274036,0.00026367692,0.0004825984,0.00032074036,0.00062288955,0.0013497509,0.00008738273,0.00045874753],"category_scores_gemma":[0.0012508037,0.00032673706,0.000115260256,0.0004164879,0.00006786067,0.00071611063,0.00062540505,0.0016090111,0.0004605243],"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.00008918352,0.0000338953,0.03874375,0.000008929851,0.000028981995,0.00008371561,0.0030773585,0.84504104,0.0010017927,0.1089869,0.00001038328,0.0028940644],"study_design_scores_gemma":[0.00097585435,0.0005449527,0.00797199,0.00012019101,0.0000058374967,0.00001633863,0.000418385,0.9857543,0.0001348113,0.00014154767,0.0035765057,0.00033924993],"about_ca_topic_score_codex":0.00026857335,"about_ca_topic_score_gemma":0.000016676806,"teacher_disagreement_score":0.93893594,"about_ca_system_score_codex":0.00025769367,"about_ca_system_score_gemma":0.00013355965,"threshold_uncertainty_score":0.99991846},"labels":[],"label_agreement":null},{"id":"W3034890132","doi":"","title":"Few-shot Relation Extraction via Bayesian Meta-learning on Task Graphs","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Relationship extraction; Computer science; Leverage (statistics); Parameterized complexity; Relation (database); Artificial intelligence; Bayesian probability; Graph; Machine learning; Theoretical computer science; Algorithm; Data mining","score_opus":0.08655251143981235,"score_gpt":0.3171795000600261,"score_spread":0.23062698862021375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034890132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109438915,0.000035631503,0.946357,0.014456898,0.00049372495,0.00013701544,0.0000020711154,0.00044181838,0.02713193],"genre_scores_gemma":[0.9904648,0.000025322797,0.007409011,0.0011997697,0.00017056393,0.000019176572,0.00004239591,0.000021433021,0.000647513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764794,0.0002937448,0.00038162284,0.00069264096,0.0007422528,0.00024182111],"domain_scores_gemma":[0.9989676,0.00018407387,0.0003036456,0.00023107743,0.00016809745,0.00014552334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038639846,0.0002554343,0.00024954032,0.000233402,0.00024902777,0.00031805487,0.00075922103,0.000098546596,0.00067380856],"category_scores_gemma":[0.00039547434,0.00024126007,0.00017475459,0.00024687045,0.000021884453,0.00062786107,0.00014838453,0.0012872131,0.00023405346],"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.0001401649,0.00010549048,0.01000823,0.00002004863,0.00051521824,0.00007018264,0.002359704,0.35754544,0.012908207,0.5200874,0.00007464169,0.09616527],"study_design_scores_gemma":[0.000302057,0.0002601819,0.0013927339,0.000026713738,0.00002919387,0.000011871026,0.000037911577,0.9875391,0.00037551494,0.0049560713,0.0048281644,0.00024048166],"about_ca_topic_score_codex":0.00007967018,"about_ca_topic_score_gemma":0.000010905889,"teacher_disagreement_score":0.9795209,"about_ca_system_score_codex":0.00007793116,"about_ca_system_score_gemma":0.000042461797,"threshold_uncertainty_score":0.98383003},"labels":[],"label_agreement":null},{"id":"W3034917202","doi":"","title":"On Variational Learning of Controllable Representations for Text without Supervision","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":33,"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":"Autoencoder; Computer science; Unsupervised learning; Artificial intelligence; Decoding methods; Space (punctuation); Encoding (memory); Simplex; Sequence (biology); Latent variable; Machine learning; Deep learning; Algorithm; Mathematics","score_opus":0.041010886409364275,"score_gpt":0.30264751106133425,"score_spread":0.26163662465196996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034917202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029374803,0.000015435871,0.9722952,0.011482211,0.00024239245,0.00019519891,0.000014438787,0.00007157895,0.012746039],"genre_scores_gemma":[0.97481614,0.0000141450155,0.023481142,0.00063544576,0.00017610678,0.000022686856,0.000058724323,0.000011637763,0.00078398903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859977,0.00017521117,0.00028493226,0.00039074122,0.00039819584,0.00015115672],"domain_scores_gemma":[0.9986132,0.0005497526,0.00021538042,0.00012608044,0.00042099008,0.00007458988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026539175,0.00014024078,0.00020200452,0.000098954035,0.00018549386,0.00015702519,0.0005059666,0.00004364763,0.000382546],"category_scores_gemma":[0.0013792329,0.00012832585,0.00009748625,0.00014847906,0.000026683423,0.00029052034,0.00010451183,0.0002880353,0.00004213218],"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.00022338888,0.000058928013,0.0033472192,0.0000070554706,0.00007907305,0.0000016217126,0.00062434975,0.516586,0.010684937,0.45644033,0.00022298253,0.011724089],"study_design_scores_gemma":[0.00092558103,0.00046051302,0.0009175566,0.00003440223,0.0000069986877,8.015925e-7,0.00005370583,0.98969376,0.0013918706,0.0034502381,0.0029414431,0.00012314678],"about_ca_topic_score_codex":0.00005951398,"about_ca_topic_score_gemma":0.0000042540196,"teacher_disagreement_score":0.97187865,"about_ca_system_score_codex":0.000025138395,"about_ca_system_score_gemma":0.00006678039,"threshold_uncertainty_score":0.5232976},"labels":[],"label_agreement":null},{"id":"W3034959582","doi":"","title":"Causal Modeling for Fairness In Dynamical Systems","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Income, Poverty, and Inequality","field":"Social Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Equity (law); Dynamical systems theory; Causal model; Term (time); Intervention (counseling); Directed acyclic graph; Theoretical computer science; Fairness measure; Management science; Psychology; Mathematics; Algorithm","score_opus":0.11089227497408154,"score_gpt":0.3786740997846798,"score_spread":0.26778182481059826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034959582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48764682,0.000077700555,0.29810065,0.037403356,0.0024636665,0.00084118336,0.000098881086,0.00032458268,0.17304318],"genre_scores_gemma":[0.9983431,0.000023232118,0.00013179232,0.00039363897,0.00044884224,0.000025507436,0.00005429936,0.000010821477,0.00056875404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861467,0.00022929008,0.0002690127,0.00025245515,0.0004145467,0.00022005127],"domain_scores_gemma":[0.99943626,0.00014502491,0.00008319374,0.000050512917,0.00019320367,0.00009179035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063293276,0.00010244867,0.00016493775,0.00006825836,0.00018332024,0.00015466478,0.0003268908,0.00008198604,0.00017981663],"category_scores_gemma":[0.0009852991,0.00010133597,0.000054441003,0.00009436371,0.000042280524,0.00017418695,0.00004358405,0.00036429756,0.000032157335],"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.00013894464,0.000037874943,0.01641377,0.000021236212,0.000015809386,0.0000049878245,0.005197553,0.06634844,0.0001315782,0.91026956,0.000030210338,0.0013900397],"study_design_scores_gemma":[0.00037318614,0.000064912114,0.00023901107,0.000043732583,0.0000025849918,2.8510735e-7,0.0021932905,0.9898668,0.0000026670416,0.0023358555,0.0047513093,0.00012637675],"about_ca_topic_score_codex":0.005426701,"about_ca_topic_score_gemma":0.0011199109,"teacher_disagreement_score":0.92351836,"about_ca_system_score_codex":0.00015007738,"about_ca_system_score_gemma":0.00011758774,"threshold_uncertainty_score":0.8203585},"labels":[],"label_agreement":null},{"id":"W3035020106","doi":"","title":"Selective Dyna-style Planning Under Limited Model Capacity","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"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":"Computer science; Style (visual arts); Geography","score_opus":0.09384211262854002,"score_gpt":0.297064049864816,"score_spread":0.20322193723627596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035020106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029742332,0.000030926785,0.9228,0.012527352,0.00018044506,0.00009323148,0.000013413576,0.00050146645,0.03411082],"genre_scores_gemma":[0.9780235,0.0000046471064,0.018557476,0.0027675969,0.00011512285,0.000009098393,0.00004439339,0.000016940734,0.00046120878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983236,0.00014119716,0.0002451615,0.00053296145,0.00047046228,0.00028661636],"domain_scores_gemma":[0.9990939,0.00018701337,0.00017977763,0.00016282845,0.00021535286,0.0001611297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024500058,0.00022073252,0.00018721008,0.00013808333,0.00024782142,0.000311262,0.0008995558,0.00008679031,0.00009309119],"category_scores_gemma":[0.0002770352,0.00021923347,0.000070671835,0.00024843458,0.00003185838,0.00040281223,0.00020369265,0.0010279276,0.000113182155],"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.00005400709,0.000028072343,0.0050610695,0.000008941558,0.000058564292,0.000015921918,0.003649914,0.8830871,0.0020121073,0.10254299,0.0002758704,0.0032054712],"study_design_scores_gemma":[0.0003370513,0.00016697755,0.0006554897,0.000078795616,0.000004160256,0.0000065081044,0.00007107262,0.99382114,0.00032608013,0.0036722755,0.00061322417,0.0002472232],"about_ca_topic_score_codex":0.00008036093,"about_ca_topic_score_gemma":0.0000047502563,"teacher_disagreement_score":0.94828117,"about_ca_system_score_codex":0.00008144814,"about_ca_system_score_gemma":0.00011155755,"threshold_uncertainty_score":0.8940081},"labels":[],"label_agreement":null},{"id":"W3035283082","doi":"","title":"Linear Lower Bounds and Conditioning of Differentiable Games","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Université de Montréal","funders":"","keywords":"Differentiable function; Upper and lower bounds; Convexity; Mathematics; Saddle point; Leverage (statistics); Complement (music); Regular polygon; Saddle; Convex function; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.11423283619060517,"score_gpt":0.3897468339893966,"score_spread":0.2755139977987914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035283082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9223749,0.000034557837,0.020638501,0.009642295,0.00012544988,0.00009081409,0.00004720239,0.000056158107,0.04699014],"genre_scores_gemma":[0.9962481,0.000015704869,0.00045995667,0.00041816116,0.000077897574,0.0000063595153,0.000026521737,0.0000073366,0.002739937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985735,0.00011609201,0.00034259018,0.00030500017,0.00056128367,0.00010155672],"domain_scores_gemma":[0.9988305,0.00045341268,0.00023091288,0.0001281561,0.0002688406,0.000088199085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004163426,0.00010210882,0.00017833889,0.000105382576,0.00011894413,0.00015852676,0.00041746142,0.000036688405,0.0045608827],"category_scores_gemma":[0.0014040922,0.00008292026,0.000053961798,0.00016985329,0.00012511764,0.00015923486,0.00012435715,0.0002798979,0.00019427582],"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.00024160693,0.000114097915,0.051893,0.000009629213,0.00007189846,0.000006081604,0.0015612938,0.0039065816,0.027422192,0.8949152,0.00059507065,0.019263346],"study_design_scores_gemma":[0.0013391396,0.00067289,0.027114686,0.00011354689,0.000028308763,0.0000132271125,0.0016294081,0.7170057,0.00661876,0.17806593,0.066954635,0.00044376036],"about_ca_topic_score_codex":0.000014270305,"about_ca_topic_score_gemma":0.0000031543443,"teacher_disagreement_score":0.71684927,"about_ca_system_score_codex":0.000007404386,"about_ca_system_score_gemma":0.000025433746,"threshold_uncertainty_score":0.9963491},"labels":[],"label_agreement":null},{"id":"W3035353183","doi":"","title":"Small-GAN: Speeding up GAN Training using Core-Sets","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":10,"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; University of Toronto","funders":"","keywords":"Computer science; Selection (genetic algorithm); Training (meteorology); Cache; Core (optical fiber); Fraction (chemistry); Machine learning; Artificial intelligence; Generative grammar; Training set; Parallel computing","score_opus":0.27406164920131143,"score_gpt":0.3543970622550278,"score_spread":0.08033541305371639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035353183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050028786,0.000013478565,0.91672367,0.006381056,0.00030693613,0.00013283973,0.000005979194,0.0005628659,0.025844399],"genre_scores_gemma":[0.97009826,0.000016570346,0.028260114,0.001066625,0.00018466268,0.000010752158,0.000013497867,0.000016518925,0.00033297966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987141,0.000039899853,0.00027004743,0.00045381783,0.00030761614,0.00021451087],"domain_scores_gemma":[0.99929196,0.000059124828,0.0001956775,0.00016314186,0.00015234397,0.00013775454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017819492,0.00017216461,0.00015853357,0.00012672789,0.00024274405,0.00029445667,0.000884045,0.000061764906,0.00027544016],"category_scores_gemma":[0.00013649219,0.00017758449,0.00008126043,0.00026465804,0.000033974804,0.00024824444,0.00014597009,0.00053687685,0.00008333612],"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.000043959288,0.000049698556,0.0038136027,0.000014514402,0.000073741685,0.000034589884,0.0041036783,0.011817816,0.05594751,0.7353928,0.00015617917,0.18855189],"study_design_scores_gemma":[0.00019692672,0.00011701489,0.00033047333,0.00003871782,0.0000042467514,0.000025898184,0.00016147939,0.9843449,0.0029163035,0.0026110401,0.009047042,0.00020595164],"about_ca_topic_score_codex":0.00006671909,"about_ca_topic_score_gemma":0.0000053910717,"teacher_disagreement_score":0.9725271,"about_ca_system_score_codex":0.000060863127,"about_ca_system_score_gemma":0.00006736373,"threshold_uncertainty_score":0.72416854},"labels":[],"label_agreement":null},{"id":"W3035353486","doi":"","title":"From Local SGD to Local Fixed Point Methods for Federated Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Bottleneck; Computer science; Fixed point; Saddle point; Mathematical optimization; Context (archaeology); Computation; Operator (biology); Saddle; Convergence (economics); Theoretical computer science; Mathematics; Algorithm","score_opus":0.0574492059463758,"score_gpt":0.36364651826580796,"score_spread":0.30619731231943215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035353486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033189383,0.000013552115,0.979477,0.016478518,0.00034979393,0.00030317227,0.000009814375,0.00069879857,0.0023374455],"genre_scores_gemma":[0.53988546,0.0000026538366,0.45795643,0.0017080401,0.00008692869,0.00005509888,0.000080075966,0.000020030435,0.00020525433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980202,0.00026415128,0.00037711448,0.0006981961,0.00036423307,0.0002761564],"domain_scores_gemma":[0.9984888,0.0005123981,0.0001821667,0.00015772825,0.0004248221,0.00023408358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003992518,0.00024501543,0.0002628316,0.00017639132,0.00021243449,0.0004134484,0.000956311,0.00008850271,0.00034390666],"category_scores_gemma":[0.0014594318,0.00024728768,0.00009533363,0.00028910616,0.00004625535,0.0002679616,0.0003616457,0.000581141,0.000099059595],"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.00026251684,0.000062823994,0.00028451617,0.000009874116,0.00010521319,0.000012511882,0.002969939,0.3183586,0.0057472936,0.20534644,0.00055218564,0.46628806],"study_design_scores_gemma":[0.0004891355,0.0005643157,0.00006120176,0.00005304481,0.000005929494,0.000003235907,0.00019538152,0.9820394,0.004326643,0.004924962,0.0070733204,0.00026344325],"about_ca_topic_score_codex":0.00015700042,"about_ca_topic_score_gemma":0.0000057424754,"teacher_disagreement_score":0.6636808,"about_ca_system_score_codex":0.000116339186,"about_ca_system_score_gemma":0.00008206874,"threshold_uncertainty_score":0.9999979},"labels":[],"label_agreement":null},{"id":"W3035389942","doi":"","title":"Online Bayesian Moment Matching based SAT Solver Heuristics","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Distributed systems and fault tolerance","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":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Matching (statistics); Solver; Bayesian probability; Moment (physics); Algorithm; Artificial intelligence; Mathematics; Statistics; Programming language; Physics","score_opus":0.04184371776120862,"score_gpt":0.29043884637231565,"score_spread":0.24859512861110702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035389942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051391786,0.000024306522,0.96431404,0.023081005,0.00045283316,0.00009571218,0.00007542445,0.00023277549,0.006584712],"genre_scores_gemma":[0.98061395,0.000007081333,0.015348213,0.0031803153,0.00020393009,0.000006762962,0.00020428874,0.000013990317,0.00042149116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982869,0.00012231055,0.00032606683,0.00045308837,0.0005814493,0.00023018297],"domain_scores_gemma":[0.99919903,0.00008115226,0.0001785055,0.00020409773,0.00017116829,0.00016605695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019479869,0.00019905948,0.00019865354,0.00007664971,0.00014828364,0.000354957,0.0009810022,0.00005290034,0.00027123],"category_scores_gemma":[0.000115886774,0.00018721187,0.00008065841,0.00016364749,0.00002197266,0.00022502661,0.00017666467,0.00063200016,0.00015998847],"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.00016814009,0.0006527342,0.010056496,0.00010539836,0.00018437473,0.0003698648,0.0028274294,0.20520464,0.005150482,0.66806203,0.0020421606,0.10517624],"study_design_scores_gemma":[0.000463553,0.00012213975,0.0009941634,0.00008060345,0.0000029714843,0.0000042655365,0.000051264593,0.9685887,0.00006563722,0.0007229689,0.028699962,0.00020374882],"about_ca_topic_score_codex":0.00008479983,"about_ca_topic_score_gemma":0.000013238453,"teacher_disagreement_score":0.9754748,"about_ca_system_score_codex":0.00006316257,"about_ca_system_score_gemma":0.00007604018,"threshold_uncertainty_score":0.76342785},"labels":[],"label_agreement":null},{"id":"W3035503873","doi":"","title":"Energy-Based Processes for Exchangeable Data","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","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":"Google (Canada); University of Alberta","funders":"","keywords":"Cardinality (data modeling); Computer science; Key (lock); Point cloud; Data mining; Energy (signal processing); Artificial neural network; Data modeling; Cloud computing; Variety (cybernetics); Function (biology); Machine learning; State (computer science); Point (geometry); Artificial intelligence; Algorithm; Mathematics; Database; Computer security","score_opus":0.13709502006650395,"score_gpt":0.3115046162466212,"score_spread":0.17440959618011723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035503873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039164155,0.000069177804,0.96685463,0.02814497,0.00020522806,0.00006975278,0.000043552394,0.000105992505,0.0044675176],"genre_scores_gemma":[0.95254576,0.0000312129,0.043139018,0.0032023892,0.00037577713,0.000023419201,0.0002391627,0.0000114794,0.0004317566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989674,0.00005660364,0.00014086015,0.00046874708,0.00020968897,0.00015669498],"domain_scores_gemma":[0.9991436,0.00017374751,0.000104093095,0.00023934392,0.0002621655,0.00007703625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014546067,0.00012559786,0.00012063267,0.00005091636,0.00012492231,0.00028784727,0.0015240441,0.00003005094,0.00014396661],"category_scores_gemma":[0.0005104597,0.00011330271,0.000031038697,0.00014992485,0.000018647683,0.00043562838,0.00027855302,0.00012756318,0.000018614192],"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.00042179882,0.00026859684,0.0023275765,0.00015330936,0.00025537296,0.000027627884,0.0008962453,0.18460907,0.010569615,0.3361396,0.01572806,0.44860312],"study_design_scores_gemma":[0.00028407178,0.0001332128,0.000019058041,0.000022890705,0.0000036225017,4.850971e-7,0.000009553969,0.90129644,0.0015877363,0.0008860194,0.09563661,0.000120312456],"about_ca_topic_score_codex":0.000041341962,"about_ca_topic_score_gemma":0.000024320918,"teacher_disagreement_score":0.9525066,"about_ca_system_score_codex":0.0000136671815,"about_ca_system_score_gemma":0.00012947855,"threshold_uncertainty_score":0.46203506},"labels":[],"label_agreement":null},{"id":"W3035564323","doi":"","title":"Undirected Graphical Models as Approximate Posteriors","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Graphical model; Computer science; Markov chain Monte Carlo; Estimator; Representation (politics); Undirected graph; Posterior probability; Markov chain; Algorithm; Backpropagation; Theoretical computer science; Artificial intelligence; Machine learning; Artificial neural network; Mathematics; Bayesian probability; Graph","score_opus":0.04728826431044014,"score_gpt":0.2723734905455278,"score_spread":0.22508522623508764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035564323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008224269,0.000029498298,0.91790324,0.025799582,0.00035504962,0.000112568385,0.0000057230627,0.00030502054,0.04726504],"genre_scores_gemma":[0.98772424,0.000039448867,0.009626595,0.0021165286,0.0001453234,0.000008054739,0.000021370623,0.000012375266,0.0003060883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998589,0.0001644498,0.00020691965,0.00044958395,0.00038807554,0.00020200136],"domain_scores_gemma":[0.999361,0.00006712776,0.00010858839,0.00014806383,0.00017068697,0.0001445757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013081817,0.00017421885,0.00016726687,0.00009121807,0.00013211329,0.00034552405,0.00083714933,0.00005276679,0.00032951],"category_scores_gemma":[0.00017105516,0.00015681887,0.00008376347,0.00021920253,0.000038196544,0.00047446022,0.0002589035,0.00041232008,0.00014181857],"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.00016793597,0.00008745526,0.0009611157,0.000009063269,0.00014716406,0.00008604627,0.0017161738,0.1328033,0.0141349835,0.7973547,0.00025103963,0.052281022],"study_design_scores_gemma":[0.00025335565,0.00016647867,0.00017435725,0.000020557456,0.000003601848,0.0000068516656,0.00002749161,0.98811454,0.0007220601,0.008649821,0.001686634,0.00017422637],"about_ca_topic_score_codex":0.00007180668,"about_ca_topic_score_gemma":0.0000049033993,"teacher_disagreement_score":0.97949994,"about_ca_system_score_codex":0.000021712469,"about_ca_system_score_gemma":0.000046093144,"threshold_uncertainty_score":0.6394888},"labels":[],"label_agreement":null},{"id":"W3035618017","doi":"","title":"Improving Transformer Optimization Through Better Initialization","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Power Transformer Diagnostics and Insulation","field":"Engineering","cited_by":51,"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":"Initialization; Computer science; Transformer; Electrical engineering; Engineering; Voltage; Programming language","score_opus":0.028935627757113617,"score_gpt":0.25366306709168546,"score_spread":0.22472743933457184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035618017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007339437,0.000032021555,0.93232465,0.0026208293,0.00038665545,0.00012084353,0.000025318423,0.00030926327,0.056841005],"genre_scores_gemma":[0.99494314,0.00023153273,0.0032108137,0.00094448944,0.00019345788,0.000012301784,0.00040745502,0.000034591132,0.000022199147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918914,0.000021381411,0.00023300867,0.0001739265,0.00023776997,0.00014479489],"domain_scores_gemma":[0.9997359,0.000030106348,0.00004011228,0.000049159047,0.00009016643,0.000054564323],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004875409,0.0001501152,0.000107741165,0.000060237995,0.00006717869,0.000108505206,0.0001395621,0.00006462472,0.0010172438],"category_scores_gemma":[0.00006570984,0.0001567958,0.000045334065,0.00011051924,0.000015286714,0.00042871485,0.000006846941,0.00030156423,0.00006613775],"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.000027139693,0.000013676873,0.0009935688,0.000026612659,0.00003923261,0.0000033415456,0.0009314829,0.96596855,0.0054243584,0.009679059,0.000058093286,0.0168349],"study_design_scores_gemma":[0.0004083718,0.00007649721,0.00020539484,0.000031242533,0.000010531797,0.0000012914068,0.000036080604,0.99145705,0.0023208028,0.00023199344,0.005045383,0.00017538831],"about_ca_topic_score_codex":0.000025850095,"about_ca_topic_score_gemma":0.0000037031666,"teacher_disagreement_score":0.9876037,"about_ca_system_score_codex":0.000038786027,"about_ca_system_score_gemma":0.000013682279,"threshold_uncertainty_score":0.999896},"labels":[],"label_agreement":null},{"id":"W3035668914","doi":"","title":"PoKED: A Semi-Supervised System for Word Sense Disambiguation","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Word-sense disambiguation; Computer science; Natural language processing; SemEval; Artificial intelligence; Word (group theory); Linguistics; WordNet; Engineering","score_opus":0.043391661373164574,"score_gpt":0.30795606690180205,"score_spread":0.26456440552863747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035668914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042225053,0.000107985834,0.97745645,0.014034465,0.00027152503,0.00023496816,0.000012839934,0.0010963562,0.0025629296],"genre_scores_gemma":[0.90447575,0.0000056562744,0.09410198,0.0009068104,0.00016888793,0.000037348877,0.000055693636,0.000015155788,0.00023273096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.00008566517,0.00023672015,0.0004281842,0.0003866767,0.00017945476],"domain_scores_gemma":[0.99919266,0.000119955286,0.00015990502,0.0001599903,0.0002778047,0.000089714056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022632234,0.00016569611,0.00015859229,0.000105238076,0.00012982501,0.00036447187,0.00072853663,0.0000656238,0.000038900296],"category_scores_gemma":[0.00044734438,0.00015063363,0.00007466737,0.0001761756,0.000018221057,0.00038305283,0.00017741948,0.000362032,0.000041882315],"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.00020531203,0.000046765927,0.000717811,0.00014139955,0.0000632654,0.00005656183,0.0023351866,0.0011333419,0.030259471,0.7883538,0.00032307944,0.17636402],"study_design_scores_gemma":[0.00039680258,0.00013807941,0.00003992728,0.00014443998,0.000004992242,0.000013899151,0.00008470478,0.98950243,0.0046622423,0.0033836302,0.0014382991,0.00019056568],"about_ca_topic_score_codex":0.000037254365,"about_ca_topic_score_gemma":0.0000035013368,"teacher_disagreement_score":0.98836905,"about_ca_system_score_codex":0.000091095506,"about_ca_system_score_gemma":0.00005572044,"threshold_uncertainty_score":0.6142661},"labels":[],"label_agreement":null},{"id":"W3035688841","doi":"","title":"Acceleration for Compressed Gradient Descent in Distributed Optimization","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Acceleration; Descent (aeronautics); Computer science; Gradient descent; Mathematical optimization; Mathematics; Artificial intelligence; Physics; Aerospace engineering; Engineering; Classical mechanics","score_opus":0.06559826797288805,"score_gpt":0.2811279469838047,"score_spread":0.21552967901091669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035688841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030285511,0.000025882122,0.9647868,0.0017175064,0.00018520857,0.00024272654,0.00003128708,0.00045872948,0.00226633],"genre_scores_gemma":[0.9949061,0.000047456666,0.004315677,0.00015429102,0.00007004766,0.000025524492,0.00045445233,0.000016780827,0.000009628919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943274,0.000023934195,0.00016819274,0.00014729988,0.00012040374,0.00010740702],"domain_scores_gemma":[0.99974966,0.00003384583,0.000039294915,0.00004960863,0.00008916731,0.000038416332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004412485,0.000105078696,0.00010363786,0.00006840677,0.00003504465,0.000074430034,0.00013629987,0.000038804494,0.00008503739],"category_scores_gemma":[0.00007694402,0.00011164252,0.000030564017,0.00007289604,0.000008868508,0.000088016095,0.000020598378,0.00019960155,0.000004934659],"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.000050519262,0.000015493022,0.0008717011,0.0000060971133,0.000013237102,0.0000024840385,0.00012524825,0.987586,0.00507065,0.0035723783,0.00018603253,0.002500109],"study_design_scores_gemma":[0.0003753522,0.00006644394,0.00051971234,0.00005240599,0.0000029838077,6.9603897e-7,0.000020806307,0.9917306,0.00496134,0.00021227315,0.0019466652,0.000110767185],"about_ca_topic_score_codex":0.000015251874,"about_ca_topic_score_gemma":0.000008274474,"teacher_disagreement_score":0.96462065,"about_ca_system_score_codex":0.00005787924,"about_ca_system_score_gemma":0.000007634398,"threshold_uncertainty_score":0.45526496},"labels":[],"label_agreement":null},{"id":"W3035691313","doi":"","title":"A simpler approach to accelerated optimization: iterative averaging meets optimism","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 Alberta","funders":"","keywords":"Mathematical optimization; Computer science; Control theory (sociology); Mathematics; Artificial intelligence","score_opus":0.19871367044126856,"score_gpt":0.4037736806013445,"score_spread":0.20506001016007594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035691313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005732864,0.000009387594,0.90927386,0.012861214,0.00009858417,0.00044429515,0.000026509362,0.00030464627,0.07640823],"genre_scores_gemma":[0.53829527,0.000026992439,0.45739514,0.0018253939,0.00020663517,0.00008071268,0.0002282752,0.00007054942,0.001871061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758947,0.00021521596,0.00043247128,0.0006214135,0.0008052846,0.00033615448],"domain_scores_gemma":[0.99833685,0.00023135818,0.00018525243,0.00018319472,0.00075950264,0.0003038158],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023985641,0.00030009993,0.00030316057,0.00024783704,0.00022871776,0.00035636275,0.00059206993,0.000084116415,0.0030431768],"category_scores_gemma":[0.0018207155,0.00029199777,0.000073202034,0.0005015691,0.000038967493,0.00036005315,0.00026318134,0.00077393226,0.0001416983],"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.00012580579,0.000089511675,0.00009209723,0.000015314461,0.000071929906,0.000014185032,0.0023142458,0.9353582,0.00021043366,0.05936586,0.0003932523,0.001949129],"study_design_scores_gemma":[0.0007537237,0.0001335581,0.000013454746,0.000043511605,0.000007224221,0.000009303593,0.00030214412,0.9937548,0.00025650038,0.0009934254,0.0034318736,0.00030048165],"about_ca_topic_score_codex":0.000009345677,"about_ca_topic_score_gemma":9.67352e-7,"teacher_disagreement_score":0.537722,"about_ca_system_score_codex":0.00012657879,"about_ca_system_score_gemma":0.000091793656,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W3035691406","doi":"","title":"Graph Representation Learning by Maximizing Mutual Information Between Spatial and Spectral Views","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":0,"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; Mutual information; Graph; Representation (politics); Artificial intelligence; Theoretical computer science","score_opus":0.04797287760010207,"score_gpt":0.29932861233777697,"score_spread":0.2513557347376749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035691406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060092863,0.000048768656,0.92590004,0.007916841,0.00022784491,0.00018049616,0.000009006952,0.0003329365,0.0052912203],"genre_scores_gemma":[0.9931079,0.00010161495,0.0056372825,0.0006846034,0.00017818598,0.000008875143,0.00018564996,0.000011180123,0.00008468357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998348,0.00017379082,0.00037437087,0.00039424325,0.000473653,0.000235963],"domain_scores_gemma":[0.9991699,0.00014683258,0.0003084395,0.00011766244,0.00011174208,0.00014546339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016993462,0.00020283338,0.00020005295,0.00015313782,0.0002077191,0.0004123045,0.00053032115,0.00006587706,0.0000659671],"category_scores_gemma":[0.00028231405,0.00020490304,0.00006207254,0.0002670841,0.00004729749,0.0015647163,0.00024486173,0.0008858147,0.000060071605],"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.00018046789,0.000029914303,0.17732547,0.000027317017,0.000115758216,0.000023251638,0.004931945,0.03661314,0.004794841,0.067591235,0.000545278,0.70782137],"study_design_scores_gemma":[0.00072183536,0.00036250375,0.009558902,0.000042078078,0.000007868199,0.000009938691,0.000120190045,0.9753623,0.0008078554,0.0030260345,0.009658163,0.00032235717],"about_ca_topic_score_codex":0.000080575286,"about_ca_topic_score_gemma":0.0000074477102,"teacher_disagreement_score":0.93874913,"about_ca_system_score_codex":0.00003058578,"about_ca_system_score_gemma":0.000018433107,"threshold_uncertainty_score":0.83557034},"labels":[],"label_agreement":null},{"id":"W3035741541","doi":"","title":"Fiduciary Bandits","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Fiduciary; Recommender system; Computer science; Incentive; Ask price; Constraint (computer-aided design); Action (physics); Face (sociological concept); Ex-ante; Operations research; Mathematical optimization; Risk analysis (engineering); Economics; Microeconomics; Business; Machine learning; Engineering; Mathematics; Finance; Law","score_opus":0.30271457978874516,"score_gpt":0.47533798022670787,"score_spread":0.1726234004379627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035741541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060510565,0.00021937909,0.3856631,0.17820041,0.0023562284,0.00060145924,0.00016943917,0.00064232474,0.3716371],"genre_scores_gemma":[0.9906839,0.000031260042,0.00085371453,0.0013217247,0.00044450752,0.000008852472,0.00003451917,0.000016798303,0.0066047325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620414,0.0002518377,0.0004148724,0.0006018264,0.0022717125,0.00025563163],"domain_scores_gemma":[0.9980932,0.0007411125,0.00018297973,0.00021215218,0.00055583514,0.00021471792],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00084084907,0.00016071423,0.00021294394,0.00023495247,0.00016972036,0.00039181914,0.0013282053,0.00005733477,0.012677291],"category_scores_gemma":[0.00848818,0.00012609252,0.000095529394,0.000411148,0.00007612382,0.00036544917,0.00029892425,0.0008323403,0.004304257],"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.0011049977,0.00022169462,0.059213206,0.000011366907,0.00017588183,0.0004806947,0.0033766888,0.10910391,0.0068074856,0.074355066,0.016175397,0.7289736],"study_design_scores_gemma":[0.0006390392,0.00029052995,0.0052172435,0.000020096762,0.0000024477918,0.000009867872,0.0003484272,0.81740594,0.0006770996,0.017251084,0.1578965,0.00024173321],"about_ca_topic_score_codex":0.000022697113,"about_ca_topic_score_gemma":0.000008809679,"teacher_disagreement_score":0.93017334,"about_ca_system_score_codex":0.000047534184,"about_ca_system_score_gemma":0.00008291982,"threshold_uncertainty_score":0.99986374},"labels":[],"label_agreement":null},{"id":"W3081963674","doi":"","title":"Contrastive Multi-View Representation Learning on Graphs","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":97,"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":"Computer science; Graph; Artificial intelligence; Node (physics); Binary classification; Theoretical computer science; Representation (politics); Machine learning; Binary number; Feature learning; Mathematics; Support vector machine","score_opus":0.0770792012378027,"score_gpt":0.3372805158083014,"score_spread":0.26020131457049867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081963674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015599506,0.00012612893,0.94995916,0.017297955,0.0007490451,0.00035387458,0.000006462586,0.00082194596,0.015085914],"genre_scores_gemma":[0.9900829,0.00015426688,0.0068561747,0.0022562004,0.00011072778,0.000020511552,0.00004290639,0.000020309746,0.00045600516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979013,0.00028550753,0.00030623263,0.00069668156,0.00054123544,0.0002690123],"domain_scores_gemma":[0.9988784,0.0002999784,0.00026827006,0.00017906373,0.00021672515,0.00015755968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015221175,0.00024453943,0.00022576418,0.00015354638,0.0002095139,0.00023388806,0.00086050754,0.00006341645,0.00015359839],"category_scores_gemma":[0.0006670758,0.00023268064,0.0001123928,0.0003890457,0.00005172377,0.00047494896,0.0001995629,0.0011980698,0.00021940522],"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.00022926113,0.00010844005,0.020340407,0.000010797633,0.00010445551,0.00012444211,0.0014339626,0.24698532,0.0031154086,0.52782255,0.00009991682,0.19962503],"study_design_scores_gemma":[0.0008034695,0.00045788416,0.00434363,0.00008603114,0.000004458516,0.000007104474,0.00006856927,0.98709995,0.00043985713,0.0027575453,0.003670356,0.0002611371],"about_ca_topic_score_codex":0.000023909957,"about_ca_topic_score_gemma":0.000006278411,"teacher_disagreement_score":0.9744834,"about_ca_system_score_codex":0.00004097548,"about_ca_system_score_gemma":0.00002700934,"threshold_uncertainty_score":0.94884413},"labels":[],"label_agreement":null},{"id":"W3094191864","doi":"","title":"Learning the Stein Discrepancy for Training and Evaluating Energy-Based Models without Sampling","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":20,"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":"Computer science; Artificial neural network; Sampling (signal processing); Function (biology); Artificial intelligence; Training set; Goodness of fit; Energy (signal processing); Feature (linguistics); Data modeling; Machine learning; Algorithm; Mathematics; Statistics","score_opus":0.1657884621947862,"score_gpt":0.3439734482612751,"score_spread":0.17818498606648892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094191864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057368567,0.000069053815,0.9806064,0.011280997,0.00014065954,0.00013270196,0.000004019802,0.00011266756,0.0019166763],"genre_scores_gemma":[0.9164335,0.000015564217,0.08196206,0.0010880299,0.00024559078,0.000039843813,0.000020067408,0.00001798696,0.00017735029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838936,0.00026467795,0.00025237066,0.00048598298,0.00036801727,0.00023960164],"domain_scores_gemma":[0.99887466,0.00050669664,0.00020360736,0.00012458886,0.00020014476,0.00009031175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005813929,0.00019416305,0.00019780602,0.000058990525,0.00048730618,0.0004924513,0.0005680693,0.000040846717,0.00003163981],"category_scores_gemma":[0.0006461898,0.00014801907,0.00008175422,0.00011445347,0.000045910663,0.0003616203,0.0001630381,0.000393723,0.000002393877],"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.00005697136,0.000010261154,0.00043370613,0.000006426517,0.000045498582,0.000001268869,0.0028716703,0.668367,0.0022927888,0.12669626,0.000006009805,0.19921213],"study_design_scores_gemma":[0.0004910691,0.0003395466,0.000055455315,0.00006420003,0.000010652312,0.0000016775311,0.00032093556,0.990494,0.000284058,0.0056480183,0.0021118673,0.00017850751],"about_ca_topic_score_codex":0.00005542408,"about_ca_topic_score_gemma":0.000010907246,"teacher_disagreement_score":0.9106966,"about_ca_system_score_codex":0.000023690665,"about_ca_system_score_gemma":0.00008889322,"threshold_uncertainty_score":0.6036042},"labels":[],"label_agreement":null},{"id":"W3094623068","doi":"","title":"How to Train Your Neural ODE: the World of Jacobian and Kinetic Regularization","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":29,"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; McGill University","funders":"","keywords":"Ode; Solver; Regularization (linguistics); Jacobian matrix and determinant; Artificial neural network; Computer science; Convergence (economics); Applied mathematics; Stability (learning theory); Mathematical optimization; Mathematics; Artificial intelligence; Machine learning","score_opus":0.04947007862184124,"score_gpt":0.28915931665326494,"score_spread":0.2396892380314237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094623068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6108937,0.000035296507,0.09373313,0.25126046,0.0004826114,0.00045000462,0.0000433303,0.00007631008,0.043025136],"genre_scores_gemma":[0.9946931,0.0000020171256,0.00015455348,0.0005115786,0.00027434307,0.000006020972,0.000034033495,0.0000083257255,0.0043160277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994333,0.000059005415,0.00011260662,0.00016003313,0.00015316714,0.00008188762],"domain_scores_gemma":[0.99970955,0.000028554872,0.0000826944,0.00005405085,0.00006151501,0.00006363544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050869923,0.00008706253,0.000088239794,0.00004502981,0.000060399925,0.0000987322,0.00014079167,0.000011931068,0.00045078975],"category_scores_gemma":[0.000022283732,0.00006602163,0.000034375553,0.00010817914,0.00002690324,0.0000653748,0.00004356242,0.00025154988,0.000004127026],"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.00023079857,0.000058597714,0.026103571,0.000013119387,0.00010238056,0.0000021380063,0.0020885756,0.09121322,0.024981325,0.61898285,0.0007916134,0.23543182],"study_design_scores_gemma":[0.00031379433,0.00011151803,0.0034230526,0.000027757276,0.000009441755,0.0000010145305,0.00031733926,0.9831844,0.0009822545,0.0013659605,0.010146887,0.00011660299],"about_ca_topic_score_codex":0.00003013501,"about_ca_topic_score_gemma":0.0000060923935,"teacher_disagreement_score":0.8919712,"about_ca_system_score_codex":0.000004420895,"about_ca_system_score_gemma":0.000008553085,"threshold_uncertainty_score":0.49358314},"labels":[],"label_agreement":null},{"id":"W3114060070","doi":"","title":"Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":11,"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; Stochastic gradient descent; Distributed computing; Gradient descent; Artificial intelligence; Artificial neural network","score_opus":0.15685260508525875,"score_gpt":0.4146580197922753,"score_spread":0.25780541470701657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114060070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049897704,0.00005011759,0.93629694,0.0118463235,0.00025427507,0.00031601355,0.00025041157,0.0001707439,0.0009174616],"genre_scores_gemma":[0.98263663,0.000039963168,0.015223086,0.0007219948,0.00024353708,0.000014236723,0.0005605839,0.000030729327,0.0005292185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603087,0.00026059852,0.00049641175,0.00070429966,0.0021240697,0.00038373354],"domain_scores_gemma":[0.9979592,0.00040940262,0.00031537778,0.00024407338,0.00081472314,0.00025725475],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045992303,0.00024405969,0.00028945334,0.00014007355,0.00020588425,0.00043533792,0.00094497984,0.00007257251,0.0038658753],"category_scores_gemma":[0.001935779,0.0001807135,0.00008417863,0.00066110905,0.0000968568,0.00029444927,0.00024711498,0.0007144342,0.00016915303],"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.0005412533,0.00007341495,0.016320618,0.0000023369491,0.000045459554,0.00007897044,0.000115824325,0.97444284,0.00010864704,0.0004025049,0.00017750106,0.007690614],"study_design_scores_gemma":[0.00082968635,0.0004310286,0.00366732,0.0000428397,0.0000058861183,0.000016553842,0.000089948,0.9854024,0.00008518537,0.00059221004,0.008623037,0.00021392274],"about_ca_topic_score_codex":0.00006239656,"about_ca_topic_score_gemma":0.00009039599,"teacher_disagreement_score":0.93273896,"about_ca_system_score_codex":0.00011313449,"about_ca_system_score_gemma":0.00011120758,"threshold_uncertainty_score":0.99704474},"labels":[],"label_agreement":null},{"id":"W3116747493","doi":"","title":"All in the Exponential Family: Bregman Duality in Thermodynamic Variational Inference.","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","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 British Columbia","funders":"","keywords":"Exponential family; Inference; Estimator; Computer science; Grid; Applied mathematics; Exponential function; Hyperparameter optimization; Upper and lower bounds; Mathematical optimization; Mathematics; Artificial intelligence; Statistics; Mathematical analysis","score_opus":0.06415591807818004,"score_gpt":0.3211540639702533,"score_spread":0.25699814589207326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116747493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27192613,0.000056014436,0.5707404,0.10245012,0.0005671904,0.00043789926,0.00002205481,0.00022689415,0.053573295],"genre_scores_gemma":[0.9943931,0.00003263059,0.0013948717,0.0039627072,0.000094494884,0.00002979019,0.00004389091,0.000008423764,0.000040058763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781734,0.00032405512,0.00040756035,0.0005148248,0.0006579698,0.0002782809],"domain_scores_gemma":[0.99923193,0.00020900284,0.00017465852,0.0002169293,0.000098420605,0.0000690697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005175888,0.00020703855,0.00018781592,0.00017284587,0.00007479164,0.00042905528,0.0018669354,0.00007556414,0.0002454061],"category_scores_gemma":[0.0002607211,0.00016262432,0.000058304384,0.00039675692,0.000042607582,0.00049531803,0.0002483976,0.00086512585,0.000097580996],"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.000045561093,0.00012994569,0.02455979,0.000012564918,0.000018256307,0.00006643475,0.004650504,0.002805186,0.0009035618,0.9574481,0.000024889374,0.009335207],"study_design_scores_gemma":[0.0005724846,0.000101518126,0.16557278,0.000048414433,0.0000020545083,0.0000061439982,0.0001740331,0.80355406,0.0000143079515,0.029080568,0.0006680709,0.00020559655],"about_ca_topic_score_codex":0.00042699877,"about_ca_topic_score_gemma":0.00015530181,"teacher_disagreement_score":0.92836756,"about_ca_system_score_codex":0.000062804895,"about_ca_system_score_gemma":0.00015520422,"threshold_uncertainty_score":0.6631627},"labels":[],"label_agreement":null},{"id":"W3160916081","doi":"","title":"LeanResNet: A Low-cost yet Effective Convolutional Residual Networks","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Neural Network Applications","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":"Convolutional neural network; Convolution (computer science); Residual; Computer science; Computational complexity theory; Range (aeronautics); Convolutional code; Pattern recognition (psychology); Artificial intelligence; Filter (signal processing); Algorithm; Artificial neural network; Computer vision; Decoding methods","score_opus":0.01699334081363223,"score_gpt":0.29154294039788387,"score_spread":0.2745495995842516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160916081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051003855,0.00009553709,0.8936955,0.0057757245,0.0016776762,0.0011644183,0.000024313244,0.00060131116,0.045961667],"genre_scores_gemma":[0.9928026,0.000036626283,0.0030156735,0.0007222898,0.00022016687,0.00012056811,0.00011094065,0.000020194711,0.0029509217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807763,0.00016309871,0.00026829247,0.0006418278,0.0005123448,0.00033680178],"domain_scores_gemma":[0.9985676,0.00050763,0.0002077781,0.00037489572,0.00023823522,0.00010390493],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002474448,0.00023025672,0.0001926231,0.0001576304,0.00017424618,0.000187711,0.0011388472,0.00008351314,0.00047037555],"category_scores_gemma":[0.00012225955,0.00022600626,0.000075515694,0.00027068655,0.00006072696,0.00043813375,0.0003473257,0.0008463543,0.0009082626],"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.00008326635,0.000072053714,0.012263533,0.0000045354163,0.00004675102,0.000011914341,0.000114405826,0.28151825,0.00085113157,0.666926,0.00044203218,0.03766612],"study_design_scores_gemma":[0.00063111645,0.00012232833,0.012794985,0.000074086456,0.0000030601523,0.000019405898,0.000014381816,0.971175,0.00016441685,0.0061887684,0.008544647,0.00026780088],"about_ca_topic_score_codex":0.000027147727,"about_ca_topic_score_gemma":0.000015765107,"teacher_disagreement_score":0.94179875,"about_ca_system_score_codex":0.0001314686,"about_ca_system_score_gemma":0.00005775587,"threshold_uncertainty_score":0.99986964},"labels":[],"label_agreement":null},{"id":"W3163970035","doi":"","title":"Addressing the Exorbitant Cost of Labeling Medical Images with Active Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":8,"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; Artificial intelligence","score_opus":0.10645226323996002,"score_gpt":0.4081330735488411,"score_spread":0.30168081030888105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163970035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44594574,0.00045937113,0.11415499,0.2471753,0.0003218098,0.0009598892,0.000046611127,0.00064628077,0.19028999],"genre_scores_gemma":[0.99250567,0.00020981651,0.004683882,0.0007161665,0.000108836815,0.00003387401,0.00010721618,0.000018746498,0.0016158086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984405,0.000116609684,0.00024560254,0.0002453838,0.0007968796,0.00015504174],"domain_scores_gemma":[0.9987843,0.0002798239,0.00017009379,0.00015968259,0.0004940772,0.00011203019],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036122915,0.00012323266,0.00020482126,0.00006539518,0.00015150994,0.000047012207,0.00020255656,0.000059952697,0.0020287505],"category_scores_gemma":[0.001487445,0.00007863365,0.00005628006,0.00015600289,0.00017841726,0.000055814122,0.00010227698,0.0012470479,0.0000135521595],"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.0011850516,0.0011302625,0.07955162,0.00023042166,0.0009114639,0.0011883177,0.0021019592,0.0020278185,0.22142738,0.12964535,0.0015165037,0.5590839],"study_design_scores_gemma":[0.0051489314,0.0010197735,0.017950853,0.0077658123,0.0002958764,0.0016947725,0.004106102,0.7372922,0.15131451,0.0017393251,0.07092427,0.00074761687],"about_ca_topic_score_codex":0.000076552984,"about_ca_topic_score_gemma":0.0000114753775,"teacher_disagreement_score":0.7352643,"about_ca_system_score_codex":0.000041775464,"about_ca_system_score_gemma":0.00027250472,"threshold_uncertainty_score":0.99888355},"labels":[],"label_agreement":null},{"id":"W3167624337","doi":"","title":"Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","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 Alberta","funders":"","keywords":"Minimax; Estimator; Reinforcement learning; Lasso (programming language); Upper and lower bounds; Covariance; Divergence (linguistics); Computer science; Sample size determination; Feature selection; Mathematical optimization; Dimension (graph theory); Mathematics; Function (biology); Model selection; Algorithm; Artificial intelligence; Statistics","score_opus":0.030037715410598808,"score_gpt":0.29334601178244984,"score_spread":0.26330829637185105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167624337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006057122,0.00003912461,0.9648504,0.0059568346,0.0008455479,0.00014659061,0.0000019547022,0.00041996426,0.021682423],"genre_scores_gemma":[0.9597772,0.000070098446,0.019682739,0.00056783634,0.00018435717,0.000020262623,0.00020984073,0.00003025486,0.019457433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970066,0.00024724094,0.0004025318,0.00071699906,0.0011563391,0.0004702859],"domain_scores_gemma":[0.9982356,0.0002822117,0.00033786206,0.0003489208,0.00065555266,0.00013984823],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043875852,0.0003343341,0.00026169227,0.00026817058,0.00044665087,0.0007172424,0.00088574365,0.0001332196,0.0009744776],"category_scores_gemma":[0.0011350842,0.00033919566,0.00014063902,0.0004849642,0.00004844215,0.000303351,0.00047509553,0.001496152,0.00021527961],"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.000023233959,0.000035048437,0.007213074,0.000011183286,0.00005333046,0.000034682365,0.00059444114,0.9012622,0.0016394008,0.08434716,0.00013374389,0.004652457],"study_design_scores_gemma":[0.000519483,0.00019557403,0.0015424713,0.00011221183,0.000010420127,0.000050006474,0.00019056747,0.9698751,0.0016232672,0.00017360017,0.025367519,0.00033979327],"about_ca_topic_score_codex":0.00010434557,"about_ca_topic_score_gemma":0.000012651226,"teacher_disagreement_score":0.95372003,"about_ca_system_score_codex":0.00025990183,"about_ca_system_score_gemma":0.0002058634,"threshold_uncertainty_score":0.9999388},"labels":[],"label_agreement":null},{"id":"W3167824561","doi":"","title":"Beyond Variance Reduction: Understanding the True Impact of Baselines on Policy Optimization","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Stochastic Gradient Optimization Techniques","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":"McGill University","funders":"","keywords":"Reinforcement learning; Mathematical optimization; Variance reduction; Computer science; Variance (accounting); Noise (video); Optimization problem; Baseline (sea); Focus (optics); Stochastic optimization; Curvature; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.04983852392367744,"score_gpt":0.3330668308248156,"score_spread":0.28322830690113815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167824561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036907106,0.000017709293,0.97306365,0.006929736,0.00035190652,0.00009306573,0.000008929947,0.00012792376,0.019038009],"genre_scores_gemma":[0.9618095,0.00006483805,0.03717952,0.0001790445,0.00015725881,0.000011334576,0.000045296725,0.000012147906,0.0005410436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.00016137635,0.00027529706,0.0003272945,0.00043681174,0.00014791511],"domain_scores_gemma":[0.9988071,0.00016971029,0.0002544784,0.00031028368,0.0004128359,0.000045616518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028107845,0.00015098808,0.00013741068,0.00026973448,0.00017205272,0.00019556115,0.0005790874,0.00004993794,0.00028701432],"category_scores_gemma":[0.0007012482,0.00011749795,0.000097675846,0.0005473949,0.00005776765,0.00026432573,0.000120744524,0.00029367759,0.000006773283],"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.000014128308,0.000028919967,0.00011740963,0.0000014557453,0.00002446983,0.0000022302638,0.0002033629,0.4933438,0.00023465266,0.5047289,0.000028162327,0.001272508],"study_design_scores_gemma":[0.00023460713,0.00017864471,0.00015387556,0.000069951355,0.0000041459307,0.00003964693,0.00008357574,0.97424996,0.00079545524,0.024042573,0.00003585607,0.00011170831],"about_ca_topic_score_codex":0.00006600242,"about_ca_topic_score_gemma":0.0000013302503,"teacher_disagreement_score":0.96144044,"about_ca_system_score_codex":0.00026902568,"about_ca_system_score_gemma":0.00025702393,"threshold_uncertainty_score":0.47914273},"labels":[],"label_agreement":null},{"id":"W3167967639","doi":"","title":"LEGO: Latent Execution-Guided Reasoning for Multi-Hop Question Answering on Knowledge Graphs","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); University of Alberta","funders":"","keywords":"Computer science; Question answering; Knowledge graph; Hop (telecommunications); Natural language processing; Artificial intelligence; Computer network","score_opus":0.08323708750218646,"score_gpt":0.35839867169081263,"score_spread":0.2751615841886262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167967639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03293076,0.00013348307,0.9568662,0.0019428431,0.0013120028,0.0001574516,0.000005708362,0.00027418468,0.006377372],"genre_scores_gemma":[0.93012244,0.00005685339,0.06696106,0.00022908155,0.00013054418,0.000041161446,0.000059785067,0.000017773295,0.0023813152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831367,0.00014699616,0.00032387298,0.0006200853,0.00033315012,0.0002622451],"domain_scores_gemma":[0.99878985,0.00014093009,0.00015386043,0.0002908448,0.000539382,0.000085123145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004358942,0.00020134123,0.00017659405,0.00020443802,0.00023324735,0.0003232043,0.0005697081,0.00007846749,0.000065203574],"category_scores_gemma":[0.00051809195,0.0002088582,0.000115866416,0.00016511563,0.000019534993,0.0003051218,0.00018429871,0.00044507984,0.000051983214],"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.000019424746,0.000097428565,0.0032684978,0.000013978721,0.00003588141,0.0000184308,0.00051423186,0.024685513,0.003219931,0.9439581,0.00003616558,0.024132408],"study_design_scores_gemma":[0.00067461404,0.00008585377,0.0017365912,0.0002980365,0.0000050276353,0.000017120743,0.000034915985,0.9890198,0.0017923972,0.0042426893,0.0018723425,0.00022060217],"about_ca_topic_score_codex":0.00008068407,"about_ca_topic_score_gemma":0.00005309269,"teacher_disagreement_score":0.9643343,"about_ca_system_score_codex":0.00014188059,"about_ca_system_score_gemma":0.000120185905,"threshold_uncertainty_score":0.85169905},"labels":[],"label_agreement":null},{"id":"W3168197022","doi":"","title":"Improved Regret Bound and Experience Replay in Regularized Policy Iteration","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Age of Information Optimization","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 Alberta","funders":"","keywords":"Regret; Markov decision process; Computer science; Function (biology); Computation; Mathematical optimization; Upper and lower bounds; Bellman equation; Simple (philosophy); Function approximation; Algorithm; Markov process; Mathematics; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.018731941990948114,"score_gpt":0.2950064456519339,"score_spread":0.27627450366098577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168197022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15118411,0.000053847234,0.7880596,0.018498767,0.00048843137,0.00022454084,0.0000050916233,0.00023374462,0.04125189],"genre_scores_gemma":[0.97002417,0.00007144042,0.02676416,0.0007276516,0.000053795957,0.000017605227,0.00007154986,0.0000069015646,0.0022627157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987917,0.00011364493,0.00031796,0.0003326308,0.00029280467,0.00015128215],"domain_scores_gemma":[0.9991965,0.00006214756,0.00017635412,0.00022687687,0.0002842033,0.000053917287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498238,0.00012531488,0.000118738666,0.00027411978,0.000115523115,0.00064393034,0.0003424369,0.000060158134,0.00013340343],"category_scores_gemma":[0.0007817723,0.00012936932,0.000025034878,0.0003037145,0.00003465868,0.0012419433,0.00019904638,0.0002829858,0.000012747297],"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.00006951272,0.000065260756,0.0061618467,0.0000132299365,0.000020470005,0.00005662948,0.008518128,0.009240217,0.01755689,0.91095626,0.00003300767,0.04730856],"study_design_scores_gemma":[0.00058460026,0.00004455439,0.002494855,0.000053873664,6.928429e-7,0.000045556877,0.00013568721,0.9916584,0.0017658843,0.00210566,0.0009694129,0.00014082817],"about_ca_topic_score_codex":0.00010101342,"about_ca_topic_score_gemma":0.00004335465,"teacher_disagreement_score":0.9824182,"about_ca_system_score_codex":0.00010866389,"about_ca_system_score_gemma":0.00015739647,"threshold_uncertainty_score":0.62094355},"labels":[],"label_agreement":null},{"id":"W3168883534","doi":"","title":"A Scalable Deterministic Global Optimization Algorithm for Clustering Problems","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"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; Cluster analysis; Scalability; Algorithm design; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04968482956191144,"score_gpt":0.3361670436158939,"score_spread":0.28648221405398244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168883534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002107953,0.000037885333,0.98465484,0.0018700019,0.00065883034,0.00023923161,0.000038256185,0.00017240831,0.012307448],"genre_scores_gemma":[0.04893806,0.000083896186,0.94532627,0.0003105329,0.00015547976,0.00010919477,0.00023451466,0.000022925286,0.0048191403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786824,0.00017343069,0.00036508,0.00061249256,0.00064844865,0.00033233126],"domain_scores_gemma":[0.99819005,0.00018166743,0.00016566695,0.00029915464,0.0010303544,0.00013312914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004244377,0.00019256413,0.00020316495,0.0001306018,0.0002314857,0.0008091657,0.0008328333,0.00007340019,0.00054980675],"category_scores_gemma":[0.0008505819,0.0002015185,0.000082672566,0.00038063747,0.00003597108,0.0003653814,0.00038793337,0.00027619337,0.000057840327],"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.000009974502,0.00008522125,0.00018780078,0.000018467757,0.000043092663,0.00003414524,0.00006292875,0.7576644,0.0000586262,0.03298883,0.000046085483,0.20880044],"study_design_scores_gemma":[0.000706825,0.00012360341,0.00005558081,0.000063906315,0.0000051623488,0.00006146462,0.000017843182,0.99511373,0.00007092163,0.001423194,0.0021559342,0.00020185176],"about_ca_topic_score_codex":0.000029569297,"about_ca_topic_score_gemma":0.000015662528,"teacher_disagreement_score":0.23744932,"about_ca_system_score_codex":0.00016066867,"about_ca_system_score_gemma":0.00026691408,"threshold_uncertainty_score":0.8217686},"labels":[],"label_agreement":null},{"id":"W3168901912","doi":"","title":"On the Optimality of Batch Policy Optimization Algorithms","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Google (Canada); University of Alberta","funders":"","keywords":"Computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.027271148238776546,"score_gpt":0.2846968536771992,"score_spread":0.2574257054384227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168901912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02162069,0.0000962557,0.8241792,0.008996107,0.0010234077,0.00015357412,0.0000601575,0.0004045688,0.14346607],"genre_scores_gemma":[0.9698784,0.00017109845,0.02828215,0.0002876298,0.00015676154,0.00001090537,0.00014073547,0.000027726344,0.0010446248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901897,0.0000908125,0.00024006977,0.0001762872,0.0003410924,0.00013278596],"domain_scores_gemma":[0.9992293,0.00018821484,0.00007267924,0.00016880684,0.00029794007,0.000043025197],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020570244,0.00013821853,0.00013171653,0.00012158028,0.000078851364,0.000080519225,0.00022895166,0.00006077756,0.0017747938],"category_scores_gemma":[0.0005877666,0.000114988456,0.00006359883,0.00024468167,0.000036048237,0.000069775706,0.000038399514,0.00039795408,0.000038758186],"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.000010067573,0.000027346996,0.00015086369,0.0000051341826,0.000043528857,0.000003542176,0.00012159548,0.9407322,0.00019902871,0.055132784,0.000032544493,0.0035413643],"study_design_scores_gemma":[0.00022674094,0.000033841152,0.00014442451,0.000052573414,0.0000048198917,0.0000054410502,0.00011462203,0.9962153,0.0023161313,0.0005508318,0.0002236846,0.00011162213],"about_ca_topic_score_codex":0.00003508553,"about_ca_topic_score_gemma":0.000002915326,"teacher_disagreement_score":0.9482577,"about_ca_system_score_codex":0.000063391235,"about_ca_system_score_gemma":0.000063557185,"threshold_uncertainty_score":0.9991377},"labels":[],"label_agreement":null},{"id":"W3169476548","doi":"","title":"PID Accelerated Value Iteration Algorithm","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"Vector Institute; University of Toronto","funders":"","keywords":"PID controller; Computer science; Algorithm; Value (mathematics); Algorithm design; Control engineering; Engineering; Machine learning; Temperature control","score_opus":0.021749745793390597,"score_gpt":0.27118235204454577,"score_spread":0.24943260625115518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169476548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008211211,0.00020006951,0.91878307,0.0007299084,0.0013701548,0.00013798503,0.000026914426,0.00066829834,0.06987237],"genre_scores_gemma":[0.98822665,0.000099447025,0.008678103,0.00012442288,0.00023623186,0.000023542641,0.00046250975,0.00003618951,0.0021128755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990274,0.0000773398,0.0002519506,0.00022086917,0.00026716557,0.00015531917],"domain_scores_gemma":[0.99942696,0.00004713718,0.000059557944,0.00011873047,0.0002984656,0.000049174865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009281284,0.00015778648,0.00014381878,0.00010661348,0.000076433214,0.00018394444,0.00014017346,0.00006685791,0.00061639014],"category_scores_gemma":[0.000120426295,0.00017318482,0.000043099513,0.00014368472,0.000009727594,0.00028314872,0.000027375114,0.00035986758,0.00013289736],"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.000008968573,0.000016781038,0.00039263957,0.0000073453202,0.00006162117,0.000027595404,0.00010754478,0.91234434,0.022821235,0.014190373,0.00004160229,0.04997993],"study_design_scores_gemma":[0.00044800932,0.000023380157,0.0002546146,0.00005349752,0.0000052431665,0.000019340387,0.00003576019,0.9900786,0.0036441067,0.0004671446,0.0048014694,0.00016878749],"about_ca_topic_score_codex":0.000012857674,"about_ca_topic_score_gemma":0.000008069476,"teacher_disagreement_score":0.98001546,"about_ca_system_score_codex":0.0001179868,"about_ca_system_score_gemma":0.000028590364,"threshold_uncertainty_score":0.7062272},"labels":[],"label_agreement":null},{"id":"W3169494070","doi":"","title":"SketchEmbedNet: Learning Novel Concepts by Imitating Drawings","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":9,"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":"Sketch; Computer science; Leverage (statistics); Generative grammar; Artificial intelligence; Domain (mathematical analysis); Generative model; Machine learning; Natural language processing","score_opus":0.0286740712518305,"score_gpt":0.33986954431294836,"score_spread":0.31119547306111783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169494070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008562893,0.00022857846,0.9310497,0.0062829168,0.0006253248,0.00006178144,0.000005551267,0.00037203063,0.052811205],"genre_scores_gemma":[0.9327151,0.000086918415,0.05732998,0.0014901118,0.00009296993,0.000008163705,0.000080410086,0.000024346356,0.008171958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799263,0.00012509596,0.0003261839,0.0006373987,0.00058741216,0.00033129926],"domain_scores_gemma":[0.99874127,0.0002596183,0.00023271605,0.00022215693,0.00042057704,0.00012366482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839067,0.00022848524,0.00020446404,0.0001149774,0.0003355288,0.0005480168,0.00076230406,0.000056267545,0.000512993],"category_scores_gemma":[0.0010058923,0.00023875742,0.0000901877,0.00025957296,0.000050301616,0.00069982145,0.00041175363,0.0009977119,0.00013120439],"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.000024437166,0.00018283355,0.00670823,0.000014911753,0.00008182764,0.00010090635,0.0026788912,0.009988513,0.31978315,0.19342719,0.00069931074,0.4663098],"study_design_scores_gemma":[0.0007291732,0.00007583434,0.00022546947,0.0001637214,0.000003073521,0.000049007154,0.0005905175,0.9368193,0.009486285,0.0014313359,0.050093733,0.0003325609],"about_ca_topic_score_codex":0.00003086629,"about_ca_topic_score_gemma":0.000003243976,"teacher_disagreement_score":0.92683077,"about_ca_system_score_codex":0.00007878227,"about_ca_system_score_gemma":0.00011375351,"threshold_uncertainty_score":0.97362447},"labels":[],"label_agreement":null},{"id":"W3169514089","doi":"","title":"EMaQ: Expected-Max Q-Learning Operator for Simple Yet Effective Offline and Online RL","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); University of Alberta; University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Backup; Heuristic; Operator (biology); Online and offline; Offline learning; Simple (philosophy); Artificial intelligence; Generative grammar; Machine learning; Mathematical optimization; Theoretical computer science; Online learning; Mathematics","score_opus":0.028410596128182336,"score_gpt":0.3196032698915692,"score_spread":0.29119267376338687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169514089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06487779,0.00013123598,0.92544115,0.0030999323,0.0006934142,0.00039564192,0.000022545002,0.00034963008,0.004988674],"genre_scores_gemma":[0.97107464,0.00008260257,0.022862865,0.0005726183,0.00019692627,0.000053324817,0.00042429983,0.000034165125,0.0046985573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978267,0.0002624973,0.0003843544,0.00067882217,0.0004998803,0.0003477224],"domain_scores_gemma":[0.997979,0.00067221076,0.00023702676,0.00027391256,0.00070853165,0.00012933543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037418384,0.00028381663,0.00030607512,0.00019076999,0.00032112285,0.00055451365,0.00063367386,0.000097463846,0.0002814477],"category_scores_gemma":[0.0021620232,0.0002823384,0.00009557708,0.0002334735,0.00005185902,0.00040226904,0.00049032335,0.0008313278,0.00003970401],"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.0001456156,0.00020750155,0.02372496,0.00007704897,0.00032617935,0.00013507901,0.0018937858,0.6653191,0.011180749,0.23271516,0.00031285908,0.06396199],"study_design_scores_gemma":[0.0011287298,0.00047655034,0.002694733,0.00011040271,0.000012496554,0.00003676293,0.00023077738,0.9731099,0.0012288381,0.00078764017,0.019862179,0.00032099665],"about_ca_topic_score_codex":0.00003610417,"about_ca_topic_score_gemma":0.00002570941,"teacher_disagreement_score":0.90619683,"about_ca_system_score_codex":0.00009253198,"about_ca_system_score_gemma":0.00012794844,"threshold_uncertainty_score":0.99996287},"labels":[],"label_agreement":null},{"id":"W3169904086","doi":"","title":"Nonmyopic Multifidelity Acitve Search","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"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","score_opus":0.08054011375428007,"score_gpt":0.36158431784632106,"score_spread":0.281044204092041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169904086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003192524,0.00003999909,0.932309,0.0087559335,0.00059870456,0.00009227303,0.000009935359,0.0001712211,0.054830458],"genre_scores_gemma":[0.89876086,0.00011411267,0.085340165,0.00048749213,0.00012725411,0.00001456599,0.00008601212,0.000015309699,0.015054215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736464,0.00040824665,0.00029598232,0.00058539794,0.0010500287,0.0002956874],"domain_scores_gemma":[0.99799997,0.00023405431,0.00008059321,0.00043714076,0.0010997072,0.00014854126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062590855,0.00015392953,0.00016617969,0.00020739443,0.00017939777,0.00060575025,0.0011288895,0.00006163615,0.0029455258],"category_scores_gemma":[0.0011805726,0.00015248865,0.000072189156,0.000378329,0.000048547816,0.00033472528,0.0005825642,0.0007644012,0.0006900303],"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.000032790893,0.00028235288,0.008570781,0.000021313888,0.00012267967,0.00039346633,0.0007241982,0.054403104,0.0038522624,0.7216989,0.00026576425,0.20963238],"study_design_scores_gemma":[0.00038174598,0.000044384975,0.0022164374,0.000023787323,0.0000014189446,0.000026439035,0.000041895535,0.98958135,0.0015759324,0.0010782828,0.0048768055,0.00015152877],"about_ca_topic_score_codex":0.00009422586,"about_ca_topic_score_gemma":0.000016668952,"teacher_disagreement_score":0.9351782,"about_ca_system_score_codex":0.000093645445,"about_ca_system_score_gemma":0.00027728782,"threshold_uncertainty_score":0.99796593},"labels":[],"label_agreement":null},{"id":"W3170281420","doi":"","title":"Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","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":"Vector Institute; University of Toronto","funders":"","keywords":"Kernel (algebra); Orthogonality; Scalability; Gaussian process; Computer science; Algorithm; Applied mathematics; Gaussian; Mathematical optimization; Range (aeronautics); Fourier transform; Mathematics; Mathematical analysis; Physics; Discrete mathematics; Quantum mechanics","score_opus":0.020270192004813586,"score_gpt":0.2882641235050731,"score_spread":0.2679939315002595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170281420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026739321,0.00012627547,0.93639827,0.012194415,0.00052096,0.000081192964,0.000011581489,0.00024427223,0.047749102],"genre_scores_gemma":[0.967517,0.00010883265,0.028925752,0.0007328503,0.00014710738,0.000025302981,0.000140919,0.000015815076,0.0023864121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794525,0.00011046813,0.00034092748,0.000647175,0.00064624054,0.00030993126],"domain_scores_gemma":[0.9984702,0.0001186548,0.00022084311,0.00027249363,0.0007902625,0.00012754838],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020253015,0.00023310941,0.00019040852,0.00016835016,0.0002819326,0.0008100521,0.000936173,0.00008672933,0.0014023402],"category_scores_gemma":[0.00025184138,0.00022753264,0.000069282796,0.00047586585,0.00003715732,0.0008324065,0.00026305512,0.0005052792,0.00036513325],"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.00004322979,0.0003521555,0.008170087,0.000086295804,0.00010870543,0.00017004725,0.00045671334,0.0024712577,0.007215088,0.93731725,0.00019860629,0.043410555],"study_design_scores_gemma":[0.00080549537,0.00018156187,0.011090548,0.00026927947,0.000013668476,0.00027110844,0.000043929627,0.88721657,0.008579869,0.08512517,0.0058365962,0.0005662002],"about_ca_topic_score_codex":0.00004641179,"about_ca_topic_score_gemma":0.000035120516,"teacher_disagreement_score":0.9648431,"about_ca_system_score_codex":0.00009721761,"about_ca_system_score_gemma":0.0005443533,"threshold_uncertainty_score":0.9995105},"labels":[],"label_agreement":null},{"id":"W3170503988","doi":"","title":"A Novel Method to Solve Neural Knapsack Problems","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Optimization and Packing Problems","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Knapsack problem; Computer science; Artificial neural network; Continuous knapsack problem; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","score_opus":0.04815810532373953,"score_gpt":0.30894578768717124,"score_spread":0.2607876823634317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170503988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001430985,0.000038953574,0.91491985,0.0027225374,0.00065273105,0.00010660101,0.00002182661,0.00036342817,0.07974309],"genre_scores_gemma":[0.84511673,0.00004128435,0.1486107,0.0009194129,0.00016690981,0.00003199521,0.00020590787,0.0000600802,0.0048469882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990533,0.000033182863,0.00021464085,0.00024569407,0.00026083845,0.00019236606],"domain_scores_gemma":[0.99947065,0.000062337014,0.00003797293,0.00011872184,0.00021387082,0.00009645072],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016826262,0.00016156505,0.00014282615,0.00013141014,0.00006279618,0.00018356285,0.00020018026,0.000056533558,0.001802649],"category_scores_gemma":[0.00011099182,0.0001691406,0.000057284054,0.0001865579,0.000008616682,0.00010388494,0.00006293093,0.00043992334,0.00019857728],"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.0000074638347,0.000025138817,0.00035975373,0.0000143867255,0.00004440019,0.0000071983154,0.00038538838,0.937879,0.02761858,0.02142317,0.00014446564,0.012091019],"study_design_scores_gemma":[0.000324734,0.000040378076,0.00025222724,0.000072894756,0.0000050642752,0.000038271734,0.000043398017,0.967316,0.0014004648,0.000262414,0.030043352,0.00020085278],"about_ca_topic_score_codex":0.000029537283,"about_ca_topic_score_gemma":0.000041632153,"teacher_disagreement_score":0.84368575,"about_ca_system_score_codex":0.00005111186,"about_ca_system_score_gemma":0.000027560605,"threshold_uncertainty_score":0.99910986},"labels":[],"label_agreement":null},{"id":"W3170865782","doi":"","title":"Environment Inference for Invariant Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Inference; Invariant (physics); Computer science; Benchmark (surveying); Artificial intelligence; Machine learning; Generalization; Domain (mathematical analysis); Mathematics","score_opus":0.04867667267188184,"score_gpt":0.3042943594813409,"score_spread":0.25561768680945907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170865782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029238563,0.000070813476,0.95208645,0.0053712637,0.00048774228,0.00013828238,0.0000047850617,0.00023478888,0.03868203],"genre_scores_gemma":[0.94045097,0.00015302331,0.046041835,0.0007896795,0.00012066309,0.000050530147,0.000120528355,0.00002187523,0.012250929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979162,0.00024799068,0.0003407217,0.00062881317,0.00054420624,0.0003220757],"domain_scores_gemma":[0.99868506,0.00044669077,0.00022490542,0.00026904192,0.00024602623,0.00012830339],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004480733,0.0002213695,0.0002045564,0.0001607582,0.00032139113,0.00053735747,0.00075022253,0.000079536345,0.0011496987],"category_scores_gemma":[0.0010762007,0.0002300981,0.0001164352,0.0001536348,0.00003941971,0.00039541934,0.00031848415,0.00072589354,0.00032681634],"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.000039282593,0.0001046553,0.003564078,0.000011719644,0.00007088757,0.000058845453,0.0010853352,0.061217275,0.007545754,0.8346936,0.00005946588,0.09154909],"study_design_scores_gemma":[0.0007656515,0.00017861149,0.001154233,0.000057326753,0.0000058382875,0.000022694028,0.00020627218,0.85220957,0.0010671708,0.00695359,0.13707732,0.00030173012],"about_ca_topic_score_codex":0.000023831191,"about_ca_topic_score_gemma":0.000007886951,"teacher_disagreement_score":0.93752706,"about_ca_system_score_codex":0.00009904318,"about_ca_system_score_gemma":0.00013111948,"threshold_uncertainty_score":0.99976337},"labels":[],"label_agreement":null},{"id":"W3171132675","doi":"","title":"Robust Asymmetric Learning in POMDPs","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and ELM","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 British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Robustness (evolution); Mathematical optimization; Mathematics; Chemistry","score_opus":0.04529815596095739,"score_gpt":0.2896324102183735,"score_spread":0.24433425425741612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171132675","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09577451,0.00048588996,0.2317677,0.027704744,0.0021132317,0.0001988653,0.0000037605405,0.0016782301,0.6402731],"genre_scores_gemma":[0.97866327,0.00013104493,0.011278421,0.0005040451,0.00012616235,0.000010916163,0.00004423244,0.00002093152,0.009220962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974542,0.00046475162,0.00036521617,0.0006840713,0.00064433477,0.0003873793],"domain_scores_gemma":[0.99888355,0.00026704965,0.00017660274,0.00029975027,0.000260639,0.00011238344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006620464,0.00023756982,0.00024600144,0.00059777766,0.00018878248,0.00048181266,0.00097145233,0.00009869463,0.00048373084],"category_scores_gemma":[0.0011618623,0.00024480428,0.00010046338,0.00090227503,0.000020470336,0.00037251922,0.00042563066,0.0013665501,0.00038447566],"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.00003052217,0.0003599277,0.13393573,0.000019464149,0.000072523144,0.0005864594,0.0011227031,0.16066481,0.0005482895,0.41743854,0.00013959491,0.28508145],"study_design_scores_gemma":[0.0007568925,0.00013084096,0.024243547,0.00008863483,0.000003353305,0.00006991525,0.0000852722,0.9406308,0.00019641368,0.0015524671,0.03192783,0.00031402052],"about_ca_topic_score_codex":0.00022483818,"about_ca_topic_score_gemma":0.00007513379,"teacher_disagreement_score":0.8828888,"about_ca_system_score_codex":0.00012916232,"about_ca_system_score_gemma":0.00017639952,"threshold_uncertainty_score":0.99828285},"labels":[],"label_agreement":null},{"id":"W3171517119","doi":"","title":"LTL2Action: Generalizing LTL Instructions for Multi-Task RL","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Natural Language Processing Techniques","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Task (project management); Reinforcement learning; Syntax; Semantics (computer science); Overhead (engineering); Linear temporal logic; Artificial intelligence; Scheme (mathematics); Sample complexity; Programming language; Theoretical computer science; Natural language processing; Mathematics","score_opus":0.07083520501108485,"score_gpt":0.3596141055672882,"score_spread":0.2887789005562033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171517119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023528344,0.00032208487,0.9891091,0.004422527,0.0010595805,0.000093458766,0.000010831099,0.00052775396,0.0021018242],"genre_scores_gemma":[0.471664,0.00003510555,0.5251624,0.00043149525,0.00016075329,0.00003285662,0.000059688064,0.00001175647,0.0024419266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882627,0.00007135933,0.0002095072,0.00042430023,0.0002845536,0.00018402646],"domain_scores_gemma":[0.9990024,0.00006583213,0.0001419649,0.00021758518,0.00051641295,0.0000558181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017064501,0.00014607947,0.00012723319,0.00015535663,0.00025727987,0.00041346785,0.0006266681,0.00007227651,0.00011742487],"category_scores_gemma":[0.0003779239,0.00014515663,0.00008422847,0.00019515253,0.000025188428,0.00047088868,0.00019697614,0.00045187763,0.000022160677],"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.000016023989,0.00007188713,0.00093709305,0.000016503502,0.000051625953,0.00003509981,0.0004068987,0.00055178336,0.036670655,0.82949406,0.00018466273,0.1315637],"study_design_scores_gemma":[0.0006104093,0.000081921295,0.00028300835,0.000114256116,0.000007933647,0.00014526451,0.000054919583,0.9203968,0.02601055,0.024250358,0.027716866,0.0003276846],"about_ca_topic_score_codex":0.00006148399,"about_ca_topic_score_gemma":0.000047244008,"teacher_disagreement_score":0.91984504,"about_ca_system_score_codex":0.00009417656,"about_ca_system_score_gemma":0.00011398963,"threshold_uncertainty_score":0.5919316},"labels":[],"label_agreement":null},{"id":"W3172058676","doi":"","title":"On Monotonic Linear Interpolation of Neural Network Parameters","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks 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":"Vector Institute; University of Toronto","funders":"","keywords":"Interpolation (computer graphics); Monotonic function; Artificial neural network; Linear interpolation; Computer science; Mathematics; Mathematical optimization; Applied mathematics; Artificial intelligence; Mathematical analysis; Pattern recognition (psychology)","score_opus":0.03636786631191663,"score_gpt":0.3014350248448471,"score_spread":0.26506715853293045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172058676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40722933,0.00011570391,0.53441674,0.015599069,0.0016735756,0.0002900164,0.000013457689,0.00030557587,0.040356513],"genre_scores_gemma":[0.98840064,0.00003479863,0.010286718,0.00061057234,0.00008890958,0.00001194015,0.000034145953,0.000008459425,0.0005237894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.00010460814,0.00025091792,0.00032584058,0.00028184196,0.00016161303],"domain_scores_gemma":[0.9991159,0.00022275999,0.00017797161,0.0002558992,0.00017684718,0.000050617222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012508067,0.00012263499,0.0001355906,0.00006709724,0.000088537665,0.00009889909,0.00052300916,0.00004075449,0.00015427964],"category_scores_gemma":[0.00009158078,0.000115919946,0.000081955855,0.00022593395,0.000026217323,0.00015447341,0.00015793247,0.00040226275,0.00004216792],"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.00002757839,0.00006314044,0.0015409994,0.0000028694824,0.00002817514,0.000010627896,0.00007599406,0.33356225,0.0015270009,0.63237715,0.00016973953,0.03061449],"study_design_scores_gemma":[0.00018265666,0.00012340887,0.0011141684,0.000057508707,0.0000028348543,0.000007618655,0.000008984587,0.9859536,0.0006942182,0.010727227,0.0010220282,0.00010571119],"about_ca_topic_score_codex":0.000024273479,"about_ca_topic_score_gemma":0.000012745376,"teacher_disagreement_score":0.6523914,"about_ca_system_score_codex":0.000023993933,"about_ca_system_score_gemma":0.00003825559,"threshold_uncertainty_score":0.4727078},"labels":[],"label_agreement":null},{"id":"W3172591507","doi":"","title":"Unsupervised Part Representation by Flow Capsules","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Image Processing and 3D Reconstruction","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":"Computer science; Representation (politics); Flow (mathematics); Artificial intelligence; Mathematics","score_opus":0.03204435531729514,"score_gpt":0.29072273426665507,"score_spread":0.2586783789493599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172591507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04230724,0.0003943992,0.840976,0.017637601,0.0031100959,0.00009974461,0.000023440249,0.0005549374,0.09489654],"genre_scores_gemma":[0.9679893,0.0001348122,0.021830183,0.00044011686,0.00016661514,0.000011219687,0.00021890173,0.0000109041175,0.009197914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881047,0.00013195239,0.00019157684,0.00038712745,0.00033686764,0.00014202917],"domain_scores_gemma":[0.99930006,0.00005060681,0.00009886746,0.000176144,0.000323434,0.000050877607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013985387,0.00011188269,0.000103592785,0.00007885713,0.00016460128,0.0004613699,0.0003700051,0.00004514034,0.00048350164],"category_scores_gemma":[0.0002184119,0.0001113349,0.00004873075,0.00016644881,0.000029996532,0.0004528899,0.000099720644,0.0003114814,0.00010719934],"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.000026066411,0.00013054287,0.007905451,0.000016442193,0.000078829966,0.000070410024,0.0008271751,0.0037016673,0.030530704,0.0571544,0.002652952,0.89690536],"study_design_scores_gemma":[0.00042260502,0.000034399924,0.000347811,0.000068554684,0.000003862847,0.00007900086,0.00010859737,0.9626545,0.018353276,0.0038174563,0.013928407,0.0001815634],"about_ca_topic_score_codex":0.000038636663,"about_ca_topic_score_gemma":0.00000888807,"teacher_disagreement_score":0.9589528,"about_ca_system_score_codex":0.000033352426,"about_ca_system_score_gemma":0.000111638794,"threshold_uncertainty_score":0.5294004},"labels":[],"label_agreement":null},{"id":"W3172691730","doi":"","title":"Parameterless Transductive Feature Re-representation for Few-Shot Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","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":"Carleton University","funders":"","keywords":"Feature (linguistics); Computer science; Artificial intelligence; Shot (pellet); Representation (politics); Pattern recognition (psychology); Feature learning; Machine learning; Chemistry","score_opus":0.09124599111745589,"score_gpt":0.3547058943733342,"score_spread":0.2634599032558783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172691730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014325687,0.00011463244,0.92362803,0.015135444,0.00116662,0.00029053653,0.000012487221,0.00039857012,0.044927977],"genre_scores_gemma":[0.95596504,0.000066665794,0.030483723,0.0006378486,0.00019243907,0.00006617625,0.0002798008,0.000029914492,0.01227839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753803,0.0004017092,0.0003206499,0.00077558926,0.0006226345,0.00034138327],"domain_scores_gemma":[0.99816203,0.00050695235,0.0002634099,0.00026997156,0.0006753714,0.00012225946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043753782,0.00026114975,0.00026672747,0.00022103393,0.00039225994,0.0006959611,0.0007017183,0.00012091689,0.0004496034],"category_scores_gemma":[0.00092825806,0.00027309314,0.00019076745,0.0003604737,0.000048703234,0.0006257375,0.00012364864,0.0009906272,0.0000776038],"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.00032959093,0.00024394276,0.0067735184,0.00004421261,0.00031666146,0.00013345445,0.0092608305,0.10707468,0.024904523,0.62582093,0.00046041413,0.22463723],"study_design_scores_gemma":[0.0015338188,0.00026437535,0.0026210248,0.000109931665,0.00001811547,0.00004646367,0.0018025242,0.9289253,0.004342144,0.006324042,0.05353519,0.00047706708],"about_ca_topic_score_codex":0.00002901633,"about_ca_topic_score_gemma":0.00003096711,"teacher_disagreement_score":0.94163936,"about_ca_system_score_codex":0.000096673844,"about_ca_system_score_gemma":0.0001423576,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W3173104782","doi":"","title":"Markpainting: Adversarial Machine Learning meets Inpainting","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","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":"Vector Institute; University of Toronto","funders":"","keywords":"Inpainting; Computer science; Watermark; Artificial intelligence; Computer vision; Image (mathematics); Interpolation (computer graphics); Generative grammar; Adversarial system; Image editing","score_opus":0.027111261133747993,"score_gpt":0.2661754514699486,"score_spread":0.2390641903362006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173104782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008758462,0.00030207552,0.84763277,0.018432679,0.002921214,0.00019135488,0.0000108678305,0.00061124243,0.12113936],"genre_scores_gemma":[0.96809703,0.00012493633,0.02533878,0.0006387932,0.0005558671,0.000009992447,0.00009213583,0.000029389887,0.0051130694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684197,0.00073926366,0.00044824442,0.0008138862,0.00069911056,0.0004575257],"domain_scores_gemma":[0.99828035,0.00039098077,0.0003151044,0.00033053945,0.0005411579,0.00014186517],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00091593433,0.00032966715,0.00031843528,0.0002097635,0.00048854953,0.0007504803,0.0009884764,0.0001080893,0.0014692673],"category_scores_gemma":[0.0018616266,0.00033010557,0.00018955074,0.00035584308,0.000054211527,0.00059530884,0.0007071626,0.0011205863,0.0001681447],"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.0001893194,0.00037691247,0.030390214,0.0000359333,0.00060352846,0.0007429465,0.0022513357,0.23733333,0.053649645,0.34401172,0.0006295021,0.32978562],"study_design_scores_gemma":[0.0006529338,0.00011478517,0.00068803283,0.00009309249,0.000011191011,0.000035600053,0.00012248113,0.94889563,0.0029965218,0.0010296699,0.044996407,0.00036366336],"about_ca_topic_score_codex":0.00017301796,"about_ca_topic_score_gemma":0.00007463067,"teacher_disagreement_score":0.95933855,"about_ca_system_score_codex":0.000100044344,"about_ca_system_score_gemma":0.00015413282,"threshold_uncertainty_score":0.9999151},"labels":[],"label_agreement":null},{"id":"W3179689435","doi":"","title":"A Joint Model for Question Answering and Question Generation","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","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 Toronto","funders":"","keywords":"Computer science; Novelty; Question answering; Artificial intelligence; Generative model; Comprehension; Perspective (graphical); Generative grammar; Joint (building); Sequence (biology); Natural language processing; Ask price; Sequence labeling; Machine learning; Programming language; Task (project management); Engineering","score_opus":0.11396602430690275,"score_gpt":0.3511012088271431,"score_spread":0.23713518452024032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179689435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05306012,0.000015541664,0.94003034,0.0045546484,0.0003672252,0.0001138601,0.0000025785805,0.000088954184,0.0017667181],"genre_scores_gemma":[0.92600304,0.000032325665,0.07281577,0.000111371184,0.00017248245,0.000026571526,0.000016744962,0.0000075394346,0.00081417564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999116,0.00004091179,0.00017213897,0.00034411682,0.00020454827,0.00012226265],"domain_scores_gemma":[0.9993178,0.00002100006,0.00018448534,0.00025336986,0.0001776761,0.00004566476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004593256,0.00010792916,0.000095807,0.00009173002,0.00040370255,0.0007029136,0.00041037385,0.000048600305,0.0000068737004],"category_scores_gemma":[0.00036101637,0.00010870805,0.00003086704,0.000011832457,0.000021793601,0.0006688396,0.00015338471,0.00018943861,0.0000046921864],"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.000010670688,0.000013192385,0.0014105523,0.000007264685,0.000010069656,0.0000015243356,0.0003223849,0.084535025,0.011052192,0.80806535,0.000008803696,0.09456294],"study_design_scores_gemma":[0.00027303025,0.000050074203,0.0011382614,0.000057120782,0.000002542041,0.000005444955,0.000004700941,0.98388344,0.00046721386,0.013869771,0.00013411467,0.00011427941],"about_ca_topic_score_codex":0.00013049017,"about_ca_topic_score_gemma":0.00006584855,"teacher_disagreement_score":0.89934844,"about_ca_system_score_codex":0.00005117695,"about_ca_system_score_gemma":0.00003534603,"threshold_uncertainty_score":0.6778212},"labels":[],"label_agreement":null},{"id":"W3185313117","doi":"","title":"Exploration-Driven Representation Learning in Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","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":"Université de Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Representation (politics); Machine learning","score_opus":0.06580708750621926,"score_gpt":0.32819784165969396,"score_spread":0.2623907541534747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185313117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007037508,0.00003059396,0.91318405,0.0048840875,0.0006748372,0.00017648071,3.554308e-7,0.0004046244,0.07360747],"genre_scores_gemma":[0.97355795,0.00026492847,0.0063918666,0.00028560645,0.000118811455,0.000040267383,0.00023591075,0.000028473887,0.019076178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965946,0.00054764666,0.00066659437,0.00074107875,0.0010281331,0.0004219278],"domain_scores_gemma":[0.99832416,0.0002912615,0.00042184285,0.000361478,0.0004928169,0.000108446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005312223,0.00028961938,0.00028285137,0.0004522982,0.00030638,0.00068533205,0.0008472953,0.00011175832,0.00068110065],"category_scores_gemma":[0.001559316,0.00032449153,0.00009533347,0.0006283116,0.00004042054,0.0013252757,0.00051010837,0.0016566284,0.0003468063],"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.000020857851,0.000029293744,0.02576623,0.000007653563,0.000034003697,0.000094575094,0.0013157493,0.88823676,0.0019613563,0.07560354,0.000024885285,0.00690512],"study_design_scores_gemma":[0.0007856997,0.0002286176,0.0020729452,0.00014611954,0.0000048905467,0.00001899382,0.000533653,0.9865861,0.0009962178,0.0007037591,0.0075984686,0.0003245672],"about_ca_topic_score_codex":0.000115119816,"about_ca_topic_score_gemma":0.000041896492,"teacher_disagreement_score":0.9665204,"about_ca_system_score_codex":0.00025385272,"about_ca_system_score_gemma":0.00019859475,"threshold_uncertainty_score":0.9999207},"labels":[],"label_agreement":null},{"id":"W3191294170","doi":"","title":"HNHN: Hypergraph Networks With Hyperedge Neurons","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Graph Neural Networks","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":"Université de Montréal","funders":"","keywords":"Hypergraph; Normalization (sociology); Cardinality (data modeling); Computer science; Representation (politics); Convolution (computer science); Theoretical computer science; Nonlinear system; Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Data mining; Mathematics; Discrete mathematics","score_opus":0.034173267919214864,"score_gpt":0.25821426540436776,"score_spread":0.22404099748515288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191294170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131653,0.00009219014,0.93634754,0.026743628,0.00052198826,0.00017863176,0.000004269757,0.00067587144,0.02227056],"genre_scores_gemma":[0.9871283,0.000081586484,0.0082748225,0.003981827,0.00022180921,0.000013322791,0.000021524223,0.000024785844,0.00025197657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983052,0.00011328718,0.0002181403,0.00061115396,0.0004375318,0.00031468217],"domain_scores_gemma":[0.9991099,0.00012932233,0.00015416676,0.00025214697,0.00015076452,0.00020366629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007882753,0.00024710727,0.0001933124,0.00010606618,0.00016827375,0.00023868414,0.0012655661,0.00005710889,0.00011245991],"category_scores_gemma":[0.00008261451,0.00020774602,0.00007463751,0.0004351144,0.000066099485,0.0004348983,0.00026446415,0.00096708117,0.000068021785],"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.00019602042,0.00006321266,0.019368846,0.0000060654197,0.00008009731,0.00022765,0.00031674805,0.5355178,0.0007909982,0.37949675,0.0003718057,0.063563965],"study_design_scores_gemma":[0.0004546835,0.00044846963,0.0021290726,0.00003215859,0.0000044693224,0.0000340046,0.000015687066,0.9869022,0.000053438507,0.0007784621,0.008890376,0.00025702573],"about_ca_topic_score_codex":0.000013255712,"about_ca_topic_score_gemma":0.000011014551,"teacher_disagreement_score":0.973963,"about_ca_system_score_codex":0.00002042009,"about_ca_system_score_gemma":0.000033947923,"threshold_uncertainty_score":0.84716374},"labels":[],"label_agreement":null},{"id":"W3197001625","doi":"","title":"Improving Continuous Normalizing Flows using a Multi-Resolution Framework","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University; Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.0522823980054143,"score_gpt":0.3415162221050181,"score_spread":0.2892338240996038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197001625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011857322,0.00011128752,0.9856344,0.0004257143,0.00065642974,0.00007707611,0.0000034527777,0.0003893131,0.0008449902],"genre_scores_gemma":[0.73478645,0.000043424923,0.26452756,0.00035699346,0.00010637939,0.0000065379213,0.000022682138,0.000013691772,0.00013627922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836016,0.00017074324,0.0003211722,0.000492204,0.00041173588,0.00024401359],"domain_scores_gemma":[0.9987879,0.00009500028,0.00021863425,0.00028888948,0.00053248345,0.00007709724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003160897,0.00018524159,0.00017779207,0.0002493086,0.00025542747,0.00067104906,0.0006784757,0.0000974835,0.00010171842],"category_scores_gemma":[0.00032494785,0.00019887755,0.00010035831,0.00034796723,0.00002166225,0.00043379242,0.0004849468,0.000549699,0.000014491319],"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.000007765742,0.00009796164,0.0054022535,0.000010777734,0.00003503988,0.00006154939,0.00046182337,0.0037151286,0.006018462,0.9597976,0.000008214748,0.024383374],"study_design_scores_gemma":[0.00023327004,0.000054275664,0.00043645236,0.00015316106,0.0000041621306,0.000039601757,0.00003306279,0.9918853,0.0017354926,0.003827745,0.0013757998,0.00022169453],"about_ca_topic_score_codex":0.00023214557,"about_ca_topic_score_gemma":0.000031441257,"teacher_disagreement_score":0.98817015,"about_ca_system_score_codex":0.00007734359,"about_ca_system_score_gemma":0.000118381875,"threshold_uncertainty_score":0.8109991},"labels":[],"label_agreement":null},{"id":"W3197911353","doi":"","title":"Preserving the integrity of the Canadian northern ecosystems through insights provided by reinforcement learning-based Arctic fox movement models","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Fire effects on ecosystems","field":"Environmental 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":true,"ca_institutions":"Université du Québec à Rimouski; Université Laval","funders":"","keywords":"Arctic; Ecosystem; Reinforcement learning; Movement (music); Computer science; The arctic; Environmental resource management; Geography; Artificial intelligence; Oceanography; Environmental science; Geology; Ecology; Biology","score_opus":0.021506731409794047,"score_gpt":0.24196365885312357,"score_spread":0.2204569274433295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197911353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8596691,0.00024001875,0.007507485,0.0135313915,0.0012090193,0.0016131214,0.00003794419,0.000105763225,0.116086185],"genre_scores_gemma":[0.99551255,0.000010441303,0.000040582952,0.00068921765,0.000031229527,0.000077855235,0.00007542374,0.000024822544,0.003537863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997168,0.0006321441,0.00044342256,0.00041624557,0.0010298378,0.00031032762],"domain_scores_gemma":[0.9987333,0.00020943873,0.00038832525,0.0004199519,0.00016560049,0.00008338057],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005449604,0.0002381042,0.00021226604,0.000041265925,0.0004870082,0.00016948466,0.00092699396,0.000089456575,0.0014754407],"category_scores_gemma":[0.00047047273,0.00015597817,0.000121542194,0.00021454366,0.00008973896,0.00025932683,0.00030897502,0.0010265051,0.000082102946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038484326,0.00008415958,0.11844543,0.000055821736,0.000099498335,0.0000101190035,0.0017752658,0.8676929,0.00363535,0.007036318,0.0002850999,0.00084154285],"study_design_scores_gemma":[0.00039247307,0.00010235392,0.002420134,0.0002432923,0.000012801721,0.0000032055184,0.0001906952,0.9779715,0.0027536943,0.0013953922,0.014329059,0.0001853946],"about_ca_topic_score_codex":0.4396427,"about_ca_topic_score_gemma":0.665879,"teacher_disagreement_score":0.2262363,"about_ca_system_score_codex":0.0010100545,"about_ca_system_score_gemma":0.00026105825,"threshold_uncertainty_score":0.99943733},"labels":[],"label_agreement":null},{"id":"W3198435904","doi":"","title":"Agent Forecasting at Flexible Horizons using ODE Flows","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"York University; Simon Fraser University","funders":"","keywords":"Ode; Computer science; Mathematical optimization; Applied mathematics; Mathematics","score_opus":0.37409545717126097,"score_gpt":0.46026877042013414,"score_spread":0.08617331324887317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198435904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63485646,0.00006893711,0.22056586,0.0070592314,0.0006932025,0.0002132096,0.00006413219,0.00030637736,0.13617261],"genre_scores_gemma":[0.97296876,0.000015413852,0.010188872,0.00027340313,0.00015917556,0.000014589839,0.00008316045,0.00001685603,0.016279751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975362,0.00015566667,0.0005103032,0.0005267586,0.0010666435,0.00020444111],"domain_scores_gemma":[0.99789774,0.00064299564,0.00026810766,0.0003316866,0.0007614713,0.00009796582],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072608097,0.00015257693,0.00018465846,0.00022668175,0.0004157856,0.00039491776,0.00052516704,0.00006660432,0.0075517753],"category_scores_gemma":[0.0023406427,0.00013592008,0.00012924797,0.00041032454,0.000047738664,0.00018699428,0.0003384642,0.00033480764,0.00037661113],"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.0001063057,0.00022503224,0.051133506,0.0000053464782,0.000095063144,0.00009485474,0.00072158035,0.34317714,0.056301627,0.32226187,0.0014364462,0.22444125],"study_design_scores_gemma":[0.0001958029,0.000032316777,0.0005501049,0.000040952058,0.0000058321366,0.0000361995,0.00023377438,0.927059,0.004332875,0.01700725,0.050352048,0.00015386389],"about_ca_topic_score_codex":0.00009759645,"about_ca_topic_score_gemma":0.00008665582,"teacher_disagreement_score":0.58388186,"about_ca_system_score_codex":0.00017205274,"about_ca_system_score_gemma":0.00010731002,"threshold_uncertainty_score":0.99335545},"labels":[],"label_agreement":null},{"id":"W3199726524","doi":"","title":"Poisoning the Search Space in Neural Architecture Search","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","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":"University of Toronto","funders":"","keywords":"Robustness (evolution); Computer science; Exploit; Architecture; Artificial intelligence; Machine learning; Artificial neural network; Search algorithm; Domain (mathematical analysis); Data mining; Computer security; Algorithm; Mathematics","score_opus":0.03840090311261272,"score_gpt":0.3208602456421639,"score_spread":0.2824593425295512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199726524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12839644,0.0002805391,0.67958623,0.11896442,0.0016873686,0.00030794504,0.0000058517735,0.00039560764,0.070375614],"genre_scores_gemma":[0.9858821,0.000024322693,0.010592,0.0007374161,0.00021005466,0.00001071015,0.000024430643,0.000024625502,0.0024943636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648106,0.0009893024,0.00031601006,0.0006925656,0.0010118909,0.0005091601],"domain_scores_gemma":[0.99836254,0.0006511326,0.000101357895,0.00049538683,0.00029332712,0.00009625917],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010074188,0.00025566493,0.00022500193,0.0002967415,0.00034456773,0.00063290674,0.001868296,0.00008925259,0.0004478012],"category_scores_gemma":[0.0008461937,0.0002061353,0.00010438175,0.0006799162,0.000076651246,0.0003556113,0.0010683528,0.0029529207,0.00009602649],"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.000037720914,0.00004565807,0.02636981,0.0000076245374,0.000029047924,0.00030233848,0.00234442,0.63375986,0.00092057674,0.28624147,0.000016370659,0.049925074],"study_design_scores_gemma":[0.00049087184,0.000063110085,0.008903071,0.000083474064,0.0000024059539,0.00010318747,0.00041329654,0.98561394,0.0003934741,0.001918118,0.0017896107,0.00022546401],"about_ca_topic_score_codex":0.0004136671,"about_ca_topic_score_gemma":0.00015902596,"teacher_disagreement_score":0.85748565,"about_ca_system_score_codex":0.00014256228,"about_ca_system_score_gemma":0.00023231225,"threshold_uncertainty_score":0.9993473},"labels":[],"label_agreement":null},{"id":"W3201587969","doi":"","title":"Conformal Embedding Flows: Tractable Density Estimation on Learned Manifolds","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"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":"Conformal map; Embedding; Estimation; Computer science; Mathematics; Mathematical optimization; Mathematical analysis; Artificial intelligence; Economics","score_opus":0.03983173517339811,"score_gpt":0.3204656192178434,"score_spread":0.2806338840444453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201587969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20213343,0.00002750369,0.70257133,0.014450564,0.0008546389,0.00018433358,0.000008331265,0.0004494633,0.07932037],"genre_scores_gemma":[0.98495775,0.00003431242,0.011311142,0.0007562493,0.00011208396,0.000014680206,0.000082461775,0.000010307826,0.0027210382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986318,0.00007970211,0.00023686251,0.00041206955,0.00041784847,0.00022176263],"domain_scores_gemma":[0.99915344,0.00013532337,0.00013862013,0.00026418478,0.0002269178,0.000081491096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020406065,0.00015925469,0.0001409014,0.00009299679,0.0002691769,0.00047808283,0.0005238636,0.0000603235,0.0003975188],"category_scores_gemma":[0.00012303745,0.00015658888,0.0000702184,0.00018233796,0.000015951335,0.0004526715,0.00016332422,0.0005342477,0.00029394138],"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.000024997633,0.000098128905,0.0004735823,0.0000051853694,0.000028409244,0.0000514294,0.00016163285,0.18500057,0.0039831,0.7038365,0.00015796442,0.10617852],"study_design_scores_gemma":[0.0002723227,0.00007471953,0.0010677855,0.00005488437,0.0000035932314,0.000039695853,0.000028762612,0.9866804,0.0023084655,0.0044377767,0.0048658364,0.00016575507],"about_ca_topic_score_codex":0.000036823487,"about_ca_topic_score_gemma":0.00002343594,"teacher_disagreement_score":0.80167985,"about_ca_system_score_codex":0.00006095486,"about_ca_system_score_gemma":0.000069319845,"threshold_uncertainty_score":0.63855094},"labels":[],"label_agreement":null},{"id":"W3203670901","doi":"","title":"Prediction of Boreal Peatland Fires in Canada using Spatio-Temporal Methods","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Fire effects on ecosystems","field":"Environmental Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Peat; Boreal; Environmental science; Taiga; Remote sensing; Meteorology; Physical geography; Climatology; Geography; Geology; Forestry","score_opus":0.03487790959023879,"score_gpt":0.2963152344361251,"score_spread":0.26143732484588633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203670901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863,0.000016880347,0.001826751,0.00021551116,0.00035311506,0.00007275567,0.000031722662,0.000012635688,0.011170615],"genre_scores_gemma":[0.99573255,0.0000075344337,0.003835564,0.00003875565,0.000027216325,0.0000045230145,0.00014369309,0.000009573169,0.00020060698],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864596,0.00031520147,0.00027514843,0.00023662206,0.00039374427,0.00013333718],"domain_scores_gemma":[0.9995401,0.00012729473,0.00015420088,0.00010110522,0.000034052144,0.000043232416],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034598034,0.00010377989,0.00015356993,0.000050408984,0.000039201313,0.000023568517,0.00015694859,0.000033535925,0.0018859329],"category_scores_gemma":[0.00025688673,0.000104036684,0.000027938322,0.00013571377,0.00002507304,0.00012099336,0.000095312054,0.0002519687,0.000006903397],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026799316,0.000018750017,0.95706946,0.000008114942,0.0000124915,0.000032516487,0.00011301412,0.02903402,0.0044528586,0.00015642795,0.00003355255,0.009041975],"study_design_scores_gemma":[0.00020825236,0.000028164739,0.3191841,0.000058430927,0.0000028663621,0.00001173051,0.00006327233,0.67805374,0.0014263695,0.000064351305,0.0008353128,0.00006343029],"about_ca_topic_score_codex":0.9193543,"about_ca_topic_score_gemma":0.8485054,"teacher_disagreement_score":0.6490197,"about_ca_system_score_codex":0.00080440904,"about_ca_system_score_gemma":0.00024531828,"threshold_uncertainty_score":0.9990265},"labels":[],"label_agreement":null},{"id":"W3203762460","doi":"","title":"Seasonal Sea Ice Presence Forecasting of Hudson Bay using Seq2Seq Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Arctic and Antarctic ice dynamics","field":"Earth and Planetary Sciences","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":"Bay; Sea ice; Oceanography; Climatology; Environmental science; Meteorology; Geology; Geography","score_opus":0.052081393743024854,"score_gpt":0.27768810070935235,"score_spread":0.2256067069663275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203762460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94973415,0.000075205324,0.008238931,0.00060469075,0.0004780696,0.00006571844,0.000057243666,0.00004957577,0.04069641],"genre_scores_gemma":[0.992658,0.00006382078,0.005004203,0.00011155322,0.00015972258,4.754384e-7,0.00034613392,0.000008305216,0.0016477465],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982625,0.00021904665,0.00029675057,0.00034367733,0.0005942205,0.0002837773],"domain_scores_gemma":[0.99879926,0.00041496343,0.00025465694,0.00010362674,0.00033034827,0.0000971408],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003756148,0.00017452308,0.00020540808,0.0000909842,0.0002615442,0.00009977255,0.00028265425,0.000069254376,0.005817318],"category_scores_gemma":[0.00083769934,0.0001674902,0.00008941226,0.00018424097,0.00008587076,0.00026348114,0.00006237521,0.00072869845,0.000045617115],"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.000063264735,0.00001949225,0.7425507,0.000024544031,0.000047057572,0.000065016364,0.00034315966,0.22515957,0.0004007726,0.002012659,0.000004067369,0.029309722],"study_design_scores_gemma":[0.00024205471,0.00009523123,0.033517066,0.00018635075,0.000015650447,0.00010659987,0.0007806517,0.96338254,0.00014056903,0.00046746453,0.00089059776,0.0001751955],"about_ca_topic_score_codex":0.0011009595,"about_ca_topic_score_gemma":0.00037854564,"teacher_disagreement_score":0.738223,"about_ca_system_score_codex":0.000018066356,"about_ca_system_score_gemma":0.0001926865,"threshold_uncertainty_score":0.9950915},"labels":[],"label_agreement":null},{"id":"W3205427743","doi":"","title":"MASAI: Multi-agent Summative Assessment Improvement for Unsupervised Environment Design","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"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":"Summative assessment; Computer science; Formative assessment; Psychology; Mathematics education","score_opus":0.09432305776176142,"score_gpt":0.3331575425502579,"score_spread":0.2388344847884965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205427743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062690355,0.000023999448,0.9919725,0.0031061415,0.00057409547,0.0004634531,0.000008102868,0.00012578981,0.0030990054],"genre_scores_gemma":[0.60860926,0.00010741399,0.3835815,0.00056001614,0.00007065202,0.00016533966,0.00014323402,0.000025571977,0.006737045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976009,0.00022993979,0.0004335707,0.00064451946,0.00073998905,0.00035108614],"domain_scores_gemma":[0.9986582,0.00028860086,0.00026159192,0.00039603288,0.00028222243,0.00011338887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005755951,0.00027340272,0.00022551153,0.00013359262,0.00025683787,0.0004320809,0.0009005707,0.0000682838,0.00060289697],"category_scores_gemma":[0.00020533269,0.00026959917,0.00012768262,0.00009802659,0.00003520135,0.00029340884,0.00043384166,0.0004726638,0.000116148374],"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.000025129697,0.00016498154,0.0011546403,0.00001655596,0.00015707112,0.000028197042,0.00046093424,0.877563,0.0113835465,0.08721632,0.000075718504,0.02175393],"study_design_scores_gemma":[0.001303363,0.00045406868,0.0011462115,0.000055560773,0.000011406272,0.000004409866,0.00013430841,0.9841159,0.004897569,0.0006184634,0.006973761,0.00028496736],"about_ca_topic_score_codex":0.000016249518,"about_ca_topic_score_gemma":0.0000024662759,"teacher_disagreement_score":0.608391,"about_ca_system_score_codex":0.0003657406,"about_ca_system_score_gemma":0.00016961152,"threshold_uncertainty_score":0.9999756},"labels":[],"label_agreement":null},{"id":"W55051199","doi":"","title":"True Online TD(lambda)","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":30,"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":"Lambda; Computer science; Physics; Optics","score_opus":0.03161988976831424,"score_gpt":0.3009143998948404,"score_spread":0.26929451012652617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55051199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114247445,0.000018306093,0.94871867,0.0035866275,0.0008632055,0.000058795034,0.000020489413,0.00024252835,0.035066616],"genre_scores_gemma":[0.95819753,0.000021335525,0.03749115,0.0005878677,0.00026064942,0.000008190985,0.00011348393,0.000011524524,0.0033082408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873316,0.00011485997,0.00022210412,0.00036287933,0.00038355935,0.00018340949],"domain_scores_gemma":[0.9992266,0.00010396746,0.00014076167,0.00030671063,0.0001487486,0.00007318611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002463955,0.00015054223,0.0001502812,0.00012392599,0.0001266168,0.00010866307,0.0006226543,0.000038260947,0.00020138251],"category_scores_gemma":[0.00029860836,0.00013144681,0.000050627907,0.00010150961,0.000032887627,0.00043861542,0.00022468514,0.00037241256,0.00018047773],"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.000009858044,0.000032696073,0.0012119955,0.000003879786,0.000011719272,0.0000062015592,0.00011636787,0.001225041,0.0009104921,0.93862504,0.00006851343,0.057778213],"study_design_scores_gemma":[0.00035048337,0.00015227789,0.0019082907,0.0000704387,0.0000015713595,0.000016207918,0.00004227846,0.7061751,0.0002657937,0.0037479466,0.2870606,0.00020905095],"about_ca_topic_score_codex":0.00009193014,"about_ca_topic_score_gemma":0.00006628566,"teacher_disagreement_score":0.9467728,"about_ca_system_score_codex":0.000034506425,"about_ca_system_score_gemma":0.000030375282,"threshold_uncertainty_score":0.5360246},"labels":[],"label_agreement":null},{"id":"W571574196","doi":"","title":"Deterministic Independent Component Analysis","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Blind Source Separation Techniques","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 Alberta","funders":"","keywords":"Independent component analysis; Algorithm; Gaussian; Component (thermodynamics); Computer science; Mixing (physics); Mathematics; Matrix (chemical analysis); Polynomial; Applied mathematics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.07364211003263099,"score_gpt":0.3404124261591362,"score_spread":0.2667703161265052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571574196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025181076,0.000012569404,0.9069139,0.0037702727,0.00027416626,0.00008961566,0.000003850229,0.00043567305,0.06331888],"genre_scores_gemma":[0.98799044,0.0000069437456,0.010145612,0.0006242365,0.00003621362,0.000014120301,0.000044966175,0.000007066202,0.0011304005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983686,0.00020974477,0.00024998022,0.00034641087,0.0006787669,0.00014647083],"domain_scores_gemma":[0.9990647,0.00007439789,0.00016794486,0.0002731691,0.0002905254,0.00012925551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822962,0.00013857298,0.00016945945,0.00048305208,0.000065551336,0.00038421573,0.0009524565,0.000051606123,0.00013074723],"category_scores_gemma":[0.00017392213,0.00013101583,0.000089927205,0.00033162956,0.000025358584,0.00028455618,0.00024914197,0.0003948259,0.00016778096],"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.00004366535,0.00016895952,0.018315671,0.0000024621786,0.00032464022,0.00006100805,0.0020217206,0.02346637,0.00050907227,0.9315175,0.00018002895,0.023388943],"study_design_scores_gemma":[0.00027728814,0.00014724938,0.0040881857,0.000009369794,0.000018548066,0.000010274532,0.000045378107,0.9831398,0.00026467143,0.0066527044,0.0051764403,0.00017010634],"about_ca_topic_score_codex":0.000117193165,"about_ca_topic_score_gemma":0.000048508864,"teacher_disagreement_score":0.9628094,"about_ca_system_score_codex":0.00009328776,"about_ca_system_score_gemma":0.0000903403,"threshold_uncertainty_score":0.53426707},"labels":[],"label_agreement":null},{"id":"W65834064","doi":"","title":"Clustering in the Presence of Background Noise","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":21,"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":"Cluster analysis; Robustness (evolution); Computer science; Centroid; CURE data clustering algorithm; Data mining; Cluster (spacecraft); Correlation clustering; Noise (video); Algorithm; Constrained clustering; Canopy clustering algorithm; Artificial intelligence","score_opus":0.05514190194778961,"score_gpt":0.34961984386203676,"score_spread":0.29447794191424714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65834064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03359577,0.000014924416,0.9333991,0.0033029062,0.00025405342,0.00011941877,0.0000014895453,0.000053224823,0.029259142],"genre_scores_gemma":[0.9850756,0.0000175884,0.014209034,0.00014295806,0.00005652789,0.00001537423,0.0000034718948,0.0000071046975,0.00047234993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830806,0.00030050726,0.0002373465,0.00029567245,0.00064658053,0.00021181772],"domain_scores_gemma":[0.99886745,0.0005044312,0.00011552535,0.0003414567,0.00013616105,0.000034997036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008788844,0.00011305284,0.00012485778,0.00018395172,0.00006891834,0.00016099148,0.0019169473,0.000032945856,0.00005326893],"category_scores_gemma":[0.0004309884,0.00008726597,0.000037287726,0.00023134661,0.00005870351,0.00032125736,0.00041814058,0.00053393614,0.000034452143],"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.00009826154,0.00019697745,0.00987826,0.00005180586,0.000031323547,0.000042155552,0.0036903752,0.23252851,0.007557661,0.4098033,0.000030898354,0.33609048],"study_design_scores_gemma":[0.00028139286,0.0001251178,0.0052371793,0.0000721268,5.468239e-7,0.000013299883,0.00009921116,0.9899597,0.00018512341,0.0026546272,0.0012814018,0.00009023531],"about_ca_topic_score_codex":0.00015393624,"about_ca_topic_score_gemma":0.000054709493,"teacher_disagreement_score":0.9514798,"about_ca_system_score_codex":0.000042177617,"about_ca_system_score_gemma":0.000029472783,"threshold_uncertainty_score":0.35621968},"labels":[],"label_agreement":null},{"id":"W75509695","doi":"","title":"A new Q(lambda) with interim forward view and Monte Carlo equivalence","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":26,"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; University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Monte Carlo method; Markov decision process; Algorithm; Equivalence (formal languages); Q-learning; Markov process; Mathematical optimization; Artificial intelligence; Mathematics; Discrete mathematics; Statistics","score_opus":0.03106032801753098,"score_gpt":0.2875444306336761,"score_spread":0.25648410261614507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75509695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058020637,0.000039453327,0.96132034,0.0031802608,0.00027388183,0.000101508915,6.2678805e-7,0.00018687545,0.029095018],"genre_scores_gemma":[0.96463466,0.00007349564,0.029527644,0.0005087558,0.00009552104,0.000008056833,0.000004363942,0.000017892475,0.005129643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982998,0.000119026976,0.00025315658,0.00046917453,0.0005884228,0.00027041783],"domain_scores_gemma":[0.9990155,0.00014582435,0.00020950189,0.00031188517,0.00016285018,0.0001544155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330419,0.00022769332,0.00020464147,0.00016338739,0.00012920039,0.00049456133,0.0009886603,0.000052767038,0.00017736766],"category_scores_gemma":[0.0002251644,0.00019371982,0.000043594882,0.00013641789,0.0000549234,0.00047791295,0.00039539495,0.0005431382,0.00007747731],"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.000104523155,0.000026052054,0.02129933,0.000042235155,0.00011702433,0.000026306325,0.0013384855,0.30017272,0.000511555,0.46526465,0.00020744055,0.2108897],"study_design_scores_gemma":[0.00056254346,0.0007122847,0.0018067358,0.0002505214,0.0000075706766,0.00003886014,0.00002873256,0.97990346,0.00011449504,0.0008080657,0.015504364,0.0002623498],"about_ca_topic_score_codex":0.00014961127,"about_ca_topic_score_gemma":0.000024258123,"teacher_disagreement_score":0.95883256,"about_ca_system_score_codex":0.000046968547,"about_ca_system_score_gemma":0.000072106945,"threshold_uncertainty_score":0.7899665},"labels":[],"label_agreement":null}]}