{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003765274,0.00013775118,0.99314755,0.00014731786,0.00003939305,0.000035269397,0.000013915043,0.0003708324,0.0023426611],"genre_scores_gemma":[0.6216077,0.00033669677,0.3683889,0.0007247206,0.0001374821,0.00045868685,0.00018371313,0.00040238936,0.007759728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987147,0.0003347325,0.00006135148,0.00025391916,0.00045269355,0.00018267601],"domain_scores_gemma":[0.99645257,0.0023462828,0.0002544181,0.00027997122,0.0005250287,0.00014171322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002936141,0.001629104,0.0018601932,0.00083826296,0.0005538244,0.00166337,0.0020498752,0.0018601384,0.003300941],"category_scores_gemma":[0.008435267,0.0007002832,0.0009506204,0.00061411684,0.0021890658,0.0015316738,0.0027894713,0.0035542885,0.0007983472],"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.00011535346,0.00010360542,0.00041942674,0.000090931375,0.000032362525,0.000059084065,0.000120164324,0.86691326,0.001411857,0.055068694,0.0014039674,0.07426123],"study_design_scores_gemma":[0.0000071796326,0.000019315163,0.00001368817,0.000006413277,0.0000019035275,0.000005895445,0.0000029091477,0.991289,0.00020047858,0.008099364,0.00035093536,0.0000028056354],"about_ca_topic_score_codex":0.00585327,"about_ca_topic_score_gemma":0.0026254647,"teacher_disagreement_score":0.00585327,"about_ca_system_score_codex":0.0020377375,"about_ca_system_score_gemma":0.0022791037,"threshold_uncertainty_score":0.015527964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23727408,0.0054053096,0.74171036,0.0020450167,0.0002792374,0.00016482292,0.0030182574,0.005518026,0.00458482],"genre_scores_gemma":[0.642428,0.0010117437,0.3466828,0.0005458302,0.00019711984,0.00018647914,0.005825751,0.001408206,0.0017140683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663997,0.0011241235,0.0002934975,0.0008360638,0.00090912916,0.0001972818],"domain_scores_gemma":[0.9822838,0.0109574655,0.0013247139,0.0028201523,0.0019766209,0.0006372641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008122569,0.0023921418,0.0017039209,0.006754257,0.0013821154,0.0041909413,0.0015070431,0.0019886116,0.001644404],"category_scores_gemma":[0.032534827,0.0006714829,0.0018165852,0.00434556,0.0021141095,0.005092461,0.0033817915,0.0039532287,0.0010269118],"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.00094378507,0.0005036786,0.13426039,0.0013605263,0.0013227891,0.0005802078,0.0023029668,0.19832309,0.015338517,0.05638535,0.04405636,0.5446223],"study_design_scores_gemma":[0.00008495421,0.00018456522,0.01919701,0.00021232954,0.00008452912,0.000596851,0.0006621269,0.8061275,0.005880282,0.1567867,0.010088443,0.000094734605],"about_ca_topic_score_codex":0.0024267281,"about_ca_topic_score_gemma":0.005491652,"teacher_disagreement_score":0.008122569,"about_ca_system_score_codex":0.0013281445,"about_ca_system_score_gemma":0.0012822993,"threshold_uncertainty_score":0.04295671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068102387,0.00031021252,0.998083,0.00024489447,0.000033481454,0.000017815799,0.000046043635,0.000094904244,0.00048866967],"genre_scores_gemma":[0.24650359,0.0051977993,0.7358,0.0011121796,0.0009162826,0.0011412568,0.0009992887,0.0006123844,0.0077171274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960122,0.0020038113,0.0002085875,0.00063994067,0.0009214755,0.00021390065],"domain_scores_gemma":[0.98400867,0.012372372,0.0010379422,0.000999207,0.001338598,0.00024330948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011220962,0.0015894203,0.0023380937,0.0022946903,0.0010073949,0.0025237915,0.0034549038,0.0033568784,0.0042730463],"category_scores_gemma":[0.043428414,0.0014103499,0.0019442869,0.0024278366,0.0036616463,0.0037242996,0.0037260554,0.0049858713,0.0013164293],"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.00004666961,0.000041753097,0.0008514436,0.00020370104,0.000109419765,0.00011400013,0.00012889996,0.27955925,0.0007400589,0.6840998,0.00256184,0.031543165],"study_design_scores_gemma":[0.000011941713,0.000011102827,0.00015019639,0.000037214948,0.00001510294,0.0000203303,0.000010375021,0.7275253,0.00024539288,0.26991853,0.0020332225,0.000021331489],"about_ca_topic_score_codex":0.009102005,"about_ca_topic_score_gemma":0.0056228563,"teacher_disagreement_score":0.011220962,"about_ca_system_score_codex":0.0025084,"about_ca_system_score_gemma":0.002951406,"threshold_uncertainty_score":0.0593428},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009002768,0.00015087046,0.9876304,0.00015325627,0.000043307267,0.000056661527,0.000045680168,0.0006332928,0.0022838288],"genre_scores_gemma":[0.34125993,0.00022310775,0.6531212,0.00017681993,0.00010929878,0.00036719095,0.00028884667,0.00024401706,0.004209594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977648,0.0009282631,0.00013389743,0.00031715367,0.00066271995,0.00019306105],"domain_scores_gemma":[0.9907864,0.005968704,0.0003723985,0.0016579678,0.0009988175,0.00021566999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003029449,0.0007794326,0.0011129831,0.0005790267,0.00066917186,0.0012445238,0.0019784556,0.0011228278,0.005330291],"category_scores_gemma":[0.019233063,0.0006070183,0.00066641386,0.00088146585,0.0009513393,0.0014387832,0.001820365,0.0013979897,0.0013474604],"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.00065864826,0.0001638455,0.0023239043,0.00022497559,0.00010398536,0.00018574396,0.00021845804,0.7061796,0.005942348,0.09022531,0.0043958155,0.18937747],"study_design_scores_gemma":[0.000051546198,0.000040624513,0.00018475906,0.000011073571,0.000014078407,0.00004770928,0.000010644811,0.9702335,0.0019961337,0.025753066,0.0016481167,0.000008684554],"about_ca_topic_score_codex":0.0044403225,"about_ca_topic_score_gemma":0.0064556305,"teacher_disagreement_score":0.005330291,"about_ca_system_score_codex":0.0007829481,"about_ca_system_score_gemma":0.0019336728,"threshold_uncertainty_score":0.017831624},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017370235,0.00094501994,0.9741785,0.0003110991,0.00018721775,0.000055611225,0.000112604954,0.0024439907,0.004395715],"genre_scores_gemma":[0.62822455,0.0010426106,0.34393212,0.000694205,0.00026384037,0.00029153377,0.0006990057,0.0008741973,0.023977907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927264,0.00019384373,0.000045244753,0.00020338513,0.00019383007,0.000091045724],"domain_scores_gemma":[0.9986261,0.00065730984,0.0001297861,0.00030001305,0.00022986374,0.000057001012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011845744,0.0011410911,0.0015356585,0.00048166624,0.00027705426,0.0008527474,0.0026864226,0.0015239749,0.0066062114],"category_scores_gemma":[0.0049995845,0.0008760685,0.0011409394,0.0005322052,0.0008452683,0.002484872,0.0019558633,0.0027766782,0.0029129938],"study_design_candidate":"bench_or_experimental","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.00014844451,0.00007989147,0.00036821904,0.0001387986,0.00013535154,0.00006003154,0.000058161924,0.80293715,0.0051839063,0.04040131,0.0037798448,0.14670886],"study_design_scores_gemma":[0.000010130538,0.000025354897,0.000046591274,0.0000071284917,0.0000090516005,0.000013909485,0.0000028210713,0.9856435,0.0012311868,0.012174298,0.00082820747,0.000007768767],"about_ca_topic_score_codex":0.0022035544,"about_ca_topic_score_gemma":0.002299702,"teacher_disagreement_score":0.0066062114,"about_ca_system_score_codex":0.0007434928,"about_ca_system_score_gemma":0.00065691385,"threshold_uncertainty_score":0.022100031},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045031324,0.00046609307,0.9492612,0.0005132784,0.000062387066,0.00012326222,0.000079661666,0.0005550835,0.0039077075],"genre_scores_gemma":[0.89147455,0.0002160717,0.10434739,0.00018697558,0.00004577282,0.00048936304,0.00014594622,0.00010411423,0.0029897182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920976,0.00041891736,0.000044916513,0.00010633508,0.000098438264,0.00012168807],"domain_scores_gemma":[0.9931942,0.0057735844,0.00031466145,0.00017514381,0.00032899022,0.00021335408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031895316,0.0013355146,0.0021679013,0.00078459387,0.0005857314,0.0010293012,0.0015926887,0.0017171492,0.004118219],"category_scores_gemma":[0.009815553,0.0008343204,0.0007095321,0.00057608413,0.0016079741,0.0013642027,0.002034388,0.001959056,0.0003698321],"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.000057988604,0.000024753768,0.00029754636,0.00004055703,0.000022209204,0.00002620405,0.000036881036,0.9854154,0.00008188817,0.0062962607,0.00030268834,0.007397663],"study_design_scores_gemma":[0.000017925779,0.00001721551,0.000015798443,0.000004730849,0.0000027701797,0.0000026091918,0.0000036547199,0.9958584,0.00003254777,0.0039506,0.00009172709,0.0000020313257],"about_ca_topic_score_codex":0.010568295,"about_ca_topic_score_gemma":0.0088437805,"teacher_disagreement_score":0.010568295,"about_ca_system_score_codex":0.001545161,"about_ca_system_score_gemma":0.0019377006,"threshold_uncertainty_score":0.021013558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014602579,0.00017145011,0.99752337,0.000107694126,0.000023632998,0.000038514794,0.000040446586,0.0003297619,0.00030488102],"genre_scores_gemma":[0.07775911,0.00032270784,0.9177146,0.0003692898,0.00007502678,0.000602285,0.000710655,0.0003524751,0.0020938038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972567,0.0013617087,0.00014072828,0.00053398666,0.00056909194,0.00013779041],"domain_scores_gemma":[0.9958521,0.0027978919,0.0002911451,0.00034270386,0.00060766476,0.000108508124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00461034,0.0020307784,0.0022197478,0.0024025273,0.00091966585,0.0013679418,0.0028840934,0.0027939954,0.0044206735],"category_scores_gemma":[0.012727566,0.0010908211,0.0018120196,0.002471089,0.001304014,0.0025042123,0.002912954,0.0034879525,0.0013441676],"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.00016591148,0.00010491044,0.0014037677,0.0002047569,0.00024510844,0.00018487593,0.00012822809,0.6734585,0.0023257148,0.046654485,0.007566436,0.2675573],"study_design_scores_gemma":[0.000026681962,0.000046301982,0.00006658647,0.0000128563215,0.0000115497705,0.00004735527,0.0000064507326,0.9857949,0.0003476042,0.012295671,0.0013346123,0.000009404738],"about_ca_topic_score_codex":0.0040518474,"about_ca_topic_score_gemma":0.0034893584,"teacher_disagreement_score":0.00461034,"about_ca_system_score_codex":0.00092953286,"about_ca_system_score_gemma":0.0028889752,"threshold_uncertainty_score":0.024382114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005599842,0.00015771876,0.9917892,0.00026198127,0.000038641432,0.0000574687,0.000047965546,0.00067143363,0.0013756028],"genre_scores_gemma":[0.093864165,0.00032095026,0.8990812,0.0002546433,0.00013881615,0.00036001895,0.00055203383,0.0005289179,0.0048992494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881786,0.0002562385,0.00009104005,0.00033900177,0.0003409211,0.00015489211],"domain_scores_gemma":[0.99284136,0.0047712787,0.00055491587,0.0009177456,0.000695976,0.00021870405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248244,0.0015859839,0.0020041333,0.0015092561,0.00095752557,0.002278447,0.0030872107,0.003302755,0.01010533],"category_scores_gemma":[0.013949399,0.0007926377,0.0015812176,0.002277205,0.0014424153,0.0045036147,0.0033548276,0.0035126333,0.0029334214],"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.00024316164,0.0003177356,0.0012848281,0.00034961136,0.00007842317,0.00020788364,0.0002341531,0.39873898,0.0042816396,0.11135292,0.010897627,0.47201303],"study_design_scores_gemma":[0.00002800628,0.000045435234,0.00014300519,0.000023958652,0.000014102253,0.00006882626,0.0000306342,0.9175869,0.001094891,0.079543464,0.0014059328,0.00001485487],"about_ca_topic_score_codex":0.0025334503,"about_ca_topic_score_gemma":0.0033472707,"teacher_disagreement_score":0.01010533,"about_ca_system_score_codex":0.0015226419,"about_ca_system_score_gemma":0.0023029626,"threshold_uncertainty_score":0.033805728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03605343,0.00046458098,0.93059474,0.0016651674,0.00014497037,0.00014929318,0.0013533629,0.00042183895,0.029152643],"genre_scores_gemma":[0.7447453,0.0013414358,0.21410477,0.00052381254,0.00039029747,0.00069991965,0.0022898403,0.00028373685,0.0356209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981958,0.0005379708,0.00009007941,0.00060682825,0.00038523658,0.00018414075],"domain_scores_gemma":[0.9945856,0.0030199182,0.00048605187,0.0011100974,0.00057267305,0.00022579252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023008643,0.00059006247,0.0010791838,0.0021028125,0.0016748188,0.0039172415,0.0027810282,0.0021819884,0.019412484],"category_scores_gemma":[0.011650578,0.0007219961,0.0019060103,0.0025865927,0.004117554,0.006125454,0.002897573,0.0023178381,0.0020159925],"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.000007439117,0.000010522328,0.000992018,0.000027546543,0.000012610884,0.00005300406,0.00021781375,0.019995032,0.00012694258,0.97342616,0.0010623608,0.004068453],"study_design_scores_gemma":[0.000013068932,0.00001291,0.00077985047,0.000025279734,0.000013837654,0.00013868828,0.00017002801,0.16102336,0.00012361711,0.82655895,0.011121653,0.00001863913],"about_ca_topic_score_codex":0.014485231,"about_ca_topic_score_gemma":0.01130702,"teacher_disagreement_score":0.019412484,"about_ca_system_score_codex":0.0025879743,"about_ca_system_score_gemma":0.001565092,"threshold_uncertainty_score":0.06494123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07247603,0.0006217445,0.92270803,0.0010011034,0.000037630394,0.00016296977,0.00024649486,0.00034048487,0.0024055105],"genre_scores_gemma":[0.83127415,0.00079944823,0.16165744,0.0005667134,0.00018587727,0.0005910154,0.0006009268,0.00018010862,0.004144302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923844,0.004328335,0.000274729,0.0013077664,0.0009382515,0.0007666632],"domain_scores_gemma":[0.8807267,0.10905267,0.0048013497,0.002482181,0.0014280471,0.0015090579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014410293,0.0023800342,0.00456069,0.0017432875,0.001440451,0.0034769813,0.0036947622,0.0043117125,0.0034609379],"category_scores_gemma":[0.06181924,0.0013749099,0.001539405,0.0021270057,0.0072618118,0.008366873,0.0047448506,0.0039112293,0.0004893955],"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.0007704703,0.00017807215,0.0017908984,0.00022231249,0.00011105712,0.0002445342,0.00026079977,0.89398086,0.0010266311,0.08331958,0.00072890054,0.017365796],"study_design_scores_gemma":[0.00006115592,0.000096475465,0.0002747851,0.00003524992,0.000019143403,0.000047281435,0.000042410178,0.9000157,0.0005797727,0.098640576,0.0001523201,0.00003513403],"about_ca_topic_score_codex":0.002485255,"about_ca_topic_score_gemma":0.0014075682,"teacher_disagreement_score":0.014410293,"about_ca_system_score_codex":0.002346432,"about_ca_system_score_gemma":0.0019301753,"threshold_uncertainty_score":0.07620978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002378328,0.0016856887,0.99086577,0.0015782308,0.00011820729,0.000021774214,0.000029873861,0.0002397905,0.003082335],"genre_scores_gemma":[0.38590112,0.006757573,0.5892979,0.0019459666,0.0006739963,0.0003111145,0.00017935455,0.0005136695,0.014419305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988601,0.0004950304,0.00005330454,0.00027927555,0.00024431248,0.00006786358],"domain_scores_gemma":[0.99755764,0.0016392989,0.00018369143,0.00034077134,0.0001723983,0.0001061629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001978775,0.0011592944,0.0012972337,0.000534215,0.0005485629,0.0022758455,0.0019241432,0.0019769093,0.0052306103],"category_scores_gemma":[0.0069022304,0.0007499401,0.0014929348,0.00075111416,0.0032938153,0.0076393895,0.0020569486,0.005846545,0.00063278334],"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.00009092649,0.000061337756,0.0004556718,0.00034802206,0.00009722259,0.00008865405,0.0004295391,0.2832438,0.0019124337,0.6599524,0.0021147777,0.051205184],"study_design_scores_gemma":[0.00002488836,0.00012313016,0.00014311941,0.00011300114,0.000026158585,0.00006488646,0.00006658515,0.5853122,0.0010841035,0.4031106,0.0098879095,0.00004341671],"about_ca_topic_score_codex":0.00485964,"about_ca_topic_score_gemma":0.002755284,"teacher_disagreement_score":0.0052306103,"about_ca_system_score_codex":0.0017181558,"about_ca_system_score_gemma":0.0013174,"threshold_uncertainty_score":0.017498136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007837283,0.00010315737,0.99068403,0.00010840119,0.000020955293,0.000029865903,0.000049243317,0.0008926305,0.000274448],"genre_scores_gemma":[0.2696874,0.00029057183,0.7245209,0.00029024782,0.00016257471,0.00037236657,0.0014532813,0.000359377,0.0028632968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998131,0.00074599683,0.000107563115,0.00045187958,0.00044109664,0.00012249523],"domain_scores_gemma":[0.99326295,0.004112736,0.00036939367,0.001421269,0.0007003625,0.00013330524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002770897,0.0013879938,0.0014370956,0.00094243506,0.0005260048,0.0011722891,0.002139457,0.0016096276,0.0019184566],"category_scores_gemma":[0.019152125,0.000977012,0.0009217142,0.001114142,0.0012073697,0.0045730155,0.0026948573,0.002515605,0.0012432229],"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.00044805827,0.00024837078,0.0034483874,0.0003172345,0.00015949909,0.00027677655,0.0003242351,0.5476606,0.015499743,0.049280237,0.008650067,0.3736868],"study_design_scores_gemma":[0.000022970038,0.000033452587,0.00014780356,0.000005981639,0.000007249652,0.0000373682,0.000018084478,0.98123217,0.0026513597,0.015017941,0.0008175885,0.000007891834],"about_ca_topic_score_codex":0.002501535,"about_ca_topic_score_gemma":0.003958491,"teacher_disagreement_score":0.002770897,"about_ca_system_score_codex":0.00076125,"about_ca_system_score_gemma":0.001124028,"threshold_uncertainty_score":0.0146541},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02741076,0.00013273058,0.9703068,0.00012329001,0.000028998118,0.000037785598,0.00007981274,0.00094216043,0.00093768217],"genre_scores_gemma":[0.71134293,0.0001467146,0.28163296,0.0001786502,0.000080509046,0.00021747415,0.0006342787,0.00023070817,0.005535922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989135,0.00037868434,0.00006066521,0.00032216855,0.00024266246,0.000082384075],"domain_scores_gemma":[0.9967739,0.0012056788,0.0003756083,0.00083092327,0.0006771923,0.00013669467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013839047,0.0010299055,0.0010338933,0.0006860639,0.0004515583,0.00081667694,0.0014791235,0.001140783,0.0026812383],"category_scores_gemma":[0.0055802376,0.00034544812,0.00084262947,0.00079319754,0.001093056,0.002325168,0.0016279481,0.0016338667,0.0008410881],"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.00022630523,0.00020498194,0.0018951711,0.0001236444,0.00009488059,0.000088547386,0.00013077747,0.62550324,0.009303288,0.02649603,0.0035417944,0.33239135],"study_design_scores_gemma":[0.0000041120998,0.000031968902,0.00009510534,0.0000022726113,0.0000025172458,0.000015107047,0.00000552189,0.992417,0.0015961801,0.0055871033,0.00023884502,0.0000042866045],"about_ca_topic_score_codex":0.0016600514,"about_ca_topic_score_gemma":0.0030441626,"teacher_disagreement_score":0.0026812383,"about_ca_system_score_codex":0.0009937155,"about_ca_system_score_gemma":0.0009743678,"threshold_uncertainty_score":0.008969605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044744886,0.0002944559,0.9520854,0.00033075054,0.00003548858,0.000031110245,0.00018303016,0.00073831115,0.0015565816],"genre_scores_gemma":[0.88293654,0.0003342434,0.10865427,0.00026956107,0.00007354793,0.00014861215,0.00039094946,0.00025434545,0.006937898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.0001801207,0.000017167096,0.0000937969,0.000072564384,0.00005869537],"domain_scores_gemma":[0.99904007,0.00051818456,0.000124356,0.00016967132,0.000100482255,0.000047205478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147416,0.0005880458,0.001033493,0.0005472964,0.00025304029,0.0009439713,0.0024505323,0.0013356679,0.0019401596],"category_scores_gemma":[0.0037973407,0.00078578497,0.0011879135,0.00066426623,0.001402304,0.0023941556,0.0013808997,0.0022037716,0.000545385],"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.00010972054,0.000022395105,0.00046204246,0.00004788743,0.000049739334,0.00004724236,0.000097592405,0.9188038,0.0030978913,0.05719355,0.0010399501,0.019028135],"study_design_scores_gemma":[0.000003259456,0.0000053367894,0.000044566845,0.00000253297,0.0000023070081,0.000008762627,0.000002760556,0.98451245,0.00030008165,0.015002516,0.000111833826,0.0000036416202],"about_ca_topic_score_codex":0.0030050084,"about_ca_topic_score_gemma":0.004391215,"teacher_disagreement_score":0.0030050084,"about_ca_system_score_codex":0.0011142403,"about_ca_system_score_gemma":0.00057946204,"threshold_uncertainty_score":0.008084357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001764212,0.00045708558,0.9926246,0.00047978282,0.000055674434,0.000027949009,0.000027391648,0.00010673198,0.004456534],"genre_scores_gemma":[0.284379,0.0016438948,0.6925526,0.0014616891,0.0009500215,0.0007593217,0.00039034124,0.0010598084,0.016803266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99309856,0.0032184843,0.00018652728,0.0009781136,0.0020352127,0.00048312565],"domain_scores_gemma":[0.98300594,0.013076511,0.00075845956,0.00097588345,0.001777894,0.00040536828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010111499,0.0020392267,0.0021242464,0.001514971,0.0012628922,0.00484926,0.003210419,0.0029678165,0.007245364],"category_scores_gemma":[0.038752392,0.0013368941,0.0011796262,0.001443334,0.003869014,0.007734678,0.0052937404,0.0072272196,0.0015645579],"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.00011023392,0.00007755385,0.00044905685,0.0001767372,0.000054916192,0.000054567565,0.00019889715,0.24283628,0.0005501755,0.6747662,0.006242676,0.07448282],"study_design_scores_gemma":[0.000013078523,0.000019092142,0.000051481085,0.000042616928,0.000007705136,0.000016453432,0.00001538784,0.65514475,0.00045353523,0.3420186,0.0022056208,0.000011641378],"about_ca_topic_score_codex":0.002218257,"about_ca_topic_score_gemma":0.0020359375,"teacher_disagreement_score":0.010111499,"about_ca_system_score_codex":0.002975956,"about_ca_system_score_gemma":0.0026039134,"threshold_uncertainty_score":0.05347532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0216308,0.0020834126,0.95485026,0.013979956,0.00047038737,0.00022255727,0.0010232041,0.0010420223,0.0046973852],"genre_scores_gemma":[0.4195784,0.002147623,0.5539837,0.004117147,0.0018010994,0.0009587276,0.00383928,0.00047008644,0.013103902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607074,0.0016075535,0.00016948998,0.0009456675,0.00096670765,0.000239973],"domain_scores_gemma":[0.9908798,0.0053593554,0.00030984942,0.0017180112,0.0012524738,0.00048057767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007351813,0.00160286,0.0019207505,0.0010361751,0.0012295218,0.0024541975,0.004127303,0.005211365,0.0018922457],"category_scores_gemma":[0.016238902,0.0006088496,0.0013481863,0.0015648184,0.0027168852,0.0051757093,0.0045654005,0.007827694,0.00070305495],"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.00048134694,0.00075274403,0.0047214604,0.00071233814,0.00038317227,0.00043728066,0.00062093174,0.16615556,0.0069407234,0.1606938,0.084853716,0.57324684],"study_design_scores_gemma":[0.000052472737,0.00013479937,0.0011606665,0.00005648631,0.000024742365,0.00016721345,0.00016935499,0.6961474,0.0043277335,0.28180802,0.01590117,0.000049971277],"about_ca_topic_score_codex":0.003113645,"about_ca_topic_score_gemma":0.0034048932,"teacher_disagreement_score":0.007351813,"about_ca_system_score_codex":0.0018831867,"about_ca_system_score_gemma":0.0023763564,"threshold_uncertainty_score":0.038880587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017021451,0.0005582394,0.99545515,0.00044229618,0.000064106054,0.000029589086,0.000047647212,0.00019514872,0.0015056093],"genre_scores_gemma":[0.30442068,0.0038755627,0.67396694,0.0012153167,0.0014101323,0.0009440277,0.0010336434,0.0011086927,0.012024994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920684,0.0034040806,0.00034386912,0.0012436407,0.0023993335,0.00054063596],"domain_scores_gemma":[0.9508597,0.03740904,0.0025557221,0.0033554325,0.0050436524,0.000776375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013467181,0.003613578,0.0024120328,0.002113352,0.0009861201,0.0032484066,0.0033061237,0.003664238,0.0072609284],"category_scores_gemma":[0.07852713,0.0011092214,0.00203518,0.0019785997,0.003662852,0.0063435724,0.0062449006,0.009704475,0.002563614],"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.00021099132,0.00018772202,0.0014588267,0.0003801982,0.00014747151,0.00019364586,0.00023354185,0.47952533,0.0024228934,0.41829026,0.0077623734,0.089186765],"study_design_scores_gemma":[0.00001734689,0.000063056934,0.00017452684,0.00006124132,0.000019383679,0.00005648771,0.00001562578,0.8682609,0.00080097315,0.12924951,0.0012578558,0.000023119386],"about_ca_topic_score_codex":0.0015537818,"about_ca_topic_score_gemma":0.0013042428,"teacher_disagreement_score":0.013467181,"about_ca_system_score_codex":0.0023080935,"about_ca_system_score_gemma":0.0023032103,"threshold_uncertainty_score":0.07122207},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038350462,0.00026502088,0.98934424,0.00022928689,0.00012135265,0.0000971891,0.0005873098,0.0017609982,0.0037595143],"genre_scores_gemma":[0.13788003,0.001161974,0.8414649,0.00047208444,0.00036354637,0.0003889439,0.0030963891,0.0017677702,0.013404456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602425,0.0010987746,0.00030748828,0.0011373798,0.0011157818,0.0003163324],"domain_scores_gemma":[0.9934028,0.0017818102,0.0008655803,0.001848133,0.0016075989,0.00049408816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00363253,0.0023201483,0.0012787106,0.0029592996,0.0012983796,0.0036980337,0.0020111524,0.0013998335,0.016962778],"category_scores_gemma":[0.01435908,0.0008971128,0.0023592352,0.0023766558,0.0028690733,0.005894019,0.0035575768,0.0028090444,0.0066169696],"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.00037845678,0.000108476335,0.0028783693,0.0003625083,0.00018396134,0.0003661621,0.000581015,0.040813807,0.013076427,0.6459462,0.0222396,0.27306506],"study_design_scores_gemma":[0.000035724584,0.0001225726,0.0012043085,0.00010715408,0.00006070747,0.00053611875,0.00018064446,0.4276956,0.007616605,0.51148134,0.05085783,0.00010135996],"about_ca_topic_score_codex":0.0027867362,"about_ca_topic_score_gemma":0.0027936087,"teacher_disagreement_score":0.016962778,"about_ca_system_score_codex":0.0011735333,"about_ca_system_score_gemma":0.0021406473,"threshold_uncertainty_score":0.056746125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038923682,0.00025750115,0.9917109,0.00026406808,0.00007511126,0.00003935681,0.00012413466,0.00042202504,0.0032144196],"genre_scores_gemma":[0.47956902,0.0006855423,0.49263352,0.00052245974,0.00025077982,0.00040375485,0.0007479178,0.0010866598,0.024100399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847096,0.00063978654,0.00009280554,0.00029336166,0.00036802725,0.00013496366],"domain_scores_gemma":[0.99083954,0.0064394493,0.00032505105,0.0014103055,0.0006979445,0.00028773825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033830518,0.00060964044,0.0007338421,0.000871783,0.0007498301,0.0016686859,0.002391393,0.0017752732,0.009654273],"category_scores_gemma":[0.017666139,0.0010723282,0.0012542021,0.0009370704,0.0022138897,0.0030583413,0.0028952993,0.0031160037,0.0022575916],"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.00015931299,0.00007526352,0.0008592435,0.00012698208,0.000073711286,0.00031813636,0.00038425438,0.18008748,0.0031060928,0.71854514,0.006083737,0.09018054],"study_design_scores_gemma":[0.00001802138,0.00002112089,0.00010413878,0.000041086492,0.000015609121,0.000096081545,0.000019939385,0.7465732,0.0012919547,0.24848789,0.0033158425,0.000015110407],"about_ca_topic_score_codex":0.0028670905,"about_ca_topic_score_gemma":0.0053292424,"teacher_disagreement_score":0.009654273,"about_ca_system_score_codex":0.0010730507,"about_ca_system_score_gemma":0.0012396896,"threshold_uncertainty_score":0.032296777},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4419178,0.0033335567,0.011525758,0.0061304285,0.0007201797,0.00049492554,0.44829753,0.0026399754,0.084939815],"genre_scores_gemma":[0.6024543,0.0022888237,0.01822104,0.00061472366,0.00034801412,0.00047466476,0.34908575,0.00056804623,0.025944628],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9983438,0.00019452801,0.000058973375,0.00025403217,0.00080913317,0.00033939234],"domain_scores_gemma":[0.9945471,0.0006715475,0.0005427886,0.00049301365,0.0031429925,0.0006025376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008004462,0.0006454115,0.0004131235,0.0061480748,0.0022527387,0.002004116,0.001257764,0.0006120629,0.006377938],"category_scores_gemma":[0.0057643605,0.00019779381,0.00058220624,0.015522056,0.000783839,0.0010184,0.0014754118,0.00085598713,0.00136398],"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.00041856678,0.0002675184,0.3043441,0.0007578756,0.00041890104,0.002401567,0.0039764466,0.011848211,0.0038964648,0.020880729,0.4499254,0.2008642],"study_design_scores_gemma":[0.000038997314,0.000050539722,0.59917396,0.00023636957,0.0000752937,0.00016555985,0.0064848578,0.010659571,0.0025494169,0.0025485586,0.37781858,0.00019827527],"about_ca_topic_score_codex":0.9271395,"about_ca_topic_score_gemma":0.9673296,"teacher_disagreement_score":0.07286048,"about_ca_system_score_codex":0.008160721,"about_ca_system_score_gemma":0.008060722,"threshold_uncertainty_score":0.14657909},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075526894,0.016400164,0.9526222,0.004679707,0.0047884993,0.00056371297,0.00067643105,0.0016143249,0.011102248],"genre_scores_gemma":[0.105022915,0.005971047,0.8484313,0.0015033854,0.0036131782,0.0013944171,0.0043055895,0.0023169657,0.027441341],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.96827936,0.021597913,0.0024758484,0.0020861034,0.004958651,0.0006020774],"domain_scores_gemma":[0.917958,0.051222242,0.0013696539,0.010919759,0.01672795,0.0018023695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05922967,0.0019992297,0.004555145,0.002273677,0.00117001,0.009221082,0.0033549196,0.0026896708,0.020022444],"category_scores_gemma":[0.099962965,0.0011762936,0.0018156153,0.0011283648,0.0021426997,0.008137869,0.00375765,0.0052009607,0.005006608],"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.0011096711,0.0006282267,0.0049683107,0.0008867329,0.0006025389,0.00009906272,0.0008293226,0.0089033805,0.0020849048,0.06557404,0.10208229,0.81223154],"study_design_scores_gemma":[0.00056664506,0.0006382741,0.009605031,0.001682798,0.00084175495,0.0005568597,0.00077319506,0.297805,0.008130832,0.39038604,0.28881884,0.00019473213],"about_ca_topic_score_codex":0.0032090126,"about_ca_topic_score_gemma":0.004032744,"teacher_disagreement_score":0.05922967,"about_ca_system_score_codex":0.002328056,"about_ca_system_score_gemma":0.0034243441,"threshold_uncertainty_score":0.31324017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093944445,0.00062415184,0.9870745,0.00045349958,0.00007394283,0.000029186154,0.00035563883,0.0008981386,0.0010966237],"genre_scores_gemma":[0.5915012,0.001751934,0.38363704,0.00069938053,0.00044889923,0.00055874564,0.005245357,0.00081103644,0.015346487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980673,0.0010042134,0.00008966073,0.00044692954,0.0002293621,0.0001624195],"domain_scores_gemma":[0.9918047,0.0064781466,0.00040767892,0.0007460024,0.000352973,0.00021048226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029847242,0.0015804463,0.0018907998,0.0012442849,0.0007410075,0.003127504,0.0025905655,0.002631838,0.0065804953],"category_scores_gemma":[0.011709497,0.0020342255,0.0020972476,0.002021021,0.0016362609,0.0043080966,0.003104643,0.004724984,0.002965838],"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.0004889316,0.00022260296,0.0019732688,0.00018756387,0.00028132973,0.000135235,0.00018933427,0.74106634,0.0013638479,0.09478042,0.00786791,0.15144323],"study_design_scores_gemma":[0.000022252,0.000015063206,0.000068680485,0.0000120735585,0.000012597752,0.000009834981,0.000010608584,0.9736921,0.0001533958,0.025434349,0.0005612256,0.000007732916],"about_ca_topic_score_codex":0.007337723,"about_ca_topic_score_gemma":0.0088565,"teacher_disagreement_score":0.007337723,"about_ca_system_score_codex":0.00089331076,"about_ca_system_score_gemma":0.0013087147,"threshold_uncertainty_score":0.022013962},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016324064,0.0035296702,0.9545465,0.0011435215,0.0005354834,0.00009191301,0.0013688849,0.0075272913,0.014932685],"genre_scores_gemma":[0.30506477,0.0018716531,0.6290821,0.0009107671,0.000276931,0.00021077888,0.007227057,0.0018327262,0.05352336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939024,0.0001371993,0.000030354708,0.00018144347,0.0001780087,0.000082710394],"domain_scores_gemma":[0.99900705,0.00018123348,0.000063416985,0.00031824366,0.0003471696,0.00008291628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009822854,0.0011390814,0.0013591608,0.0013906765,0.0008927734,0.0015014705,0.002346037,0.0017021562,0.010748044],"category_scores_gemma":[0.0026310734,0.0008136243,0.0010031717,0.0015189094,0.0007741444,0.0017339737,0.0017309841,0.002022675,0.007750046],"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.00026264988,0.00028404396,0.0013406108,0.00027413663,0.00027115818,0.00008009445,0.000107664,0.12252087,0.008534096,0.05087933,0.11057176,0.7048736],"study_design_scores_gemma":[0.000016522341,0.000022813185,0.0004783623,0.000028927869,0.000028355425,0.00004686031,0.000038174956,0.9402713,0.005417664,0.039729267,0.013903134,0.000018564737],"about_ca_topic_score_codex":0.008069969,"about_ca_topic_score_gemma":0.01919611,"teacher_disagreement_score":0.010748044,"about_ca_system_score_codex":0.0010531422,"about_ca_system_score_gemma":0.0013392874,"threshold_uncertainty_score":0.035955846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009022334,0.0001042925,0.9891691,0.00013532618,0.00003933445,0.000023463786,0.000034839057,0.0009551571,0.0005162021],"genre_scores_gemma":[0.38032496,0.00026000236,0.6133152,0.00042206736,0.000106978536,0.00016609629,0.000530184,0.0008640296,0.004010351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895704,0.00037651765,0.000059773323,0.00024899805,0.00024880318,0.00010887136],"domain_scores_gemma":[0.99708766,0.0015760899,0.00017687547,0.0005933226,0.00042419662,0.00014184017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018952119,0.0011731007,0.0021778606,0.000815795,0.00052178843,0.0012760352,0.0021741746,0.0023897418,0.0047144187],"category_scores_gemma":[0.008821488,0.0010893465,0.0011329541,0.001281447,0.0009961032,0.0035418926,0.0030711577,0.0026507266,0.0018467903],"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.000444276,0.0004453966,0.0010546243,0.00018174277,0.00018344179,0.00013786314,0.00016109366,0.49732226,0.0130808195,0.022772828,0.0102099525,0.45400575],"study_design_scores_gemma":[0.000009942849,0.000014895952,0.000038400554,0.0000029359546,0.000006446943,0.000014781609,0.0000065453078,0.9924544,0.000527742,0.0066748145,0.00024406887,0.00000494308],"about_ca_topic_score_codex":0.003349626,"about_ca_topic_score_gemma":0.0039478606,"teacher_disagreement_score":0.0047144187,"about_ca_system_score_codex":0.00075059215,"about_ca_system_score_gemma":0.0013733631,"threshold_uncertainty_score":0.01577133},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006447374,0.00031836744,0.98793775,0.00014799925,0.0000626544,0.00003755765,0.00011703831,0.0011838309,0.0037473736],"genre_scores_gemma":[0.62576103,0.00045519366,0.35282162,0.00021315727,0.00006270339,0.00031245436,0.00071158074,0.0005452092,0.019117018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970263,0.000093904666,0.0000144494725,0.00006515618,0.000082874765,0.000041047428],"domain_scores_gemma":[0.99947995,0.00023474664,0.000039680803,0.0001063832,0.0001120304,0.000027310813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008555411,0.0007617562,0.00071504706,0.00048658135,0.0004359685,0.0010307255,0.0024623498,0.0013180966,0.0055924514],"category_scores_gemma":[0.002870402,0.0006257497,0.0008073193,0.00075931085,0.00052125484,0.0021078396,0.001751081,0.0021143116,0.0022442716],"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.00016657893,0.000107754924,0.0005062712,0.00015049311,0.0001061407,0.00012377926,0.00014592693,0.82898533,0.0071537048,0.040701993,0.00383218,0.11801973],"study_design_scores_gemma":[0.000002590757,0.0000076134083,0.000031733038,0.000005129175,0.000004966595,0.000010313681,0.000004700072,0.9925343,0.0010191394,0.0057242494,0.0006516073,0.00000371829],"about_ca_topic_score_codex":0.0054102913,"about_ca_topic_score_gemma":0.007991128,"teacher_disagreement_score":0.0055924514,"about_ca_system_score_codex":0.00065866386,"about_ca_system_score_gemma":0.0010307359,"threshold_uncertainty_score":0.018708646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050638355,0.0040806048,0.9767104,0.0008660764,0.00037756347,0.00006725858,0.00040585603,0.00104918,0.011379264],"genre_scores_gemma":[0.3953602,0.0036820145,0.55516684,0.0006695456,0.0011698187,0.00044454422,0.0027555325,0.0009943934,0.039757174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813324,0.0008509242,0.00011282632,0.0003172795,0.00047637205,0.00010936586],"domain_scores_gemma":[0.9959358,0.0021177127,0.00036946125,0.0007873261,0.00069205184,0.00009759443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028530932,0.0011733561,0.0016389824,0.0014888345,0.00070579216,0.0017962185,0.0019436531,0.001806656,0.0069036554],"category_scores_gemma":[0.013961683,0.0008708992,0.000891554,0.0015788015,0.0012852106,0.0029895382,0.0025340612,0.0019944943,0.0032238201],"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.00037593796,0.00014203122,0.0018449565,0.0006091339,0.00041807332,0.00014792422,0.0001701281,0.20461954,0.004568189,0.17241122,0.04352654,0.5711664],"study_design_scores_gemma":[0.000020851938,0.000051925694,0.0010075365,0.00006903261,0.000070220696,0.000117484655,0.000026406924,0.8873065,0.004953613,0.093131684,0.013203035,0.00004169054],"about_ca_topic_score_codex":0.0025693497,"about_ca_topic_score_gemma":0.0038657628,"teacher_disagreement_score":0.0069036554,"about_ca_system_score_codex":0.0007526306,"about_ca_system_score_gemma":0.0011427526,"threshold_uncertainty_score":0.023095012},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12153906,0.001735872,0.82880795,0.0008117047,0.0008627579,0.00025406617,0.0011444842,0.029002514,0.015841553],"genre_scores_gemma":[0.66822684,0.00021126674,0.32014513,0.00032071455,0.00007339413,0.0002350363,0.0010340567,0.0014207788,0.008332716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997843,0.00004571508,0.00001190095,0.000049121514,0.000055129083,0.000053841697],"domain_scores_gemma":[0.99954623,0.00019673344,0.00003436405,0.00006225078,0.00012254498,0.000037942973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039811878,0.0019682953,0.0008108728,0.0005008164,0.0003590906,0.00079745793,0.0018073131,0.0011166274,0.011170244],"category_scores_gemma":[0.0021276483,0.0006390288,0.0005523665,0.00044245398,0.00030661147,0.0010148939,0.00076629827,0.001368052,0.0020729357],"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.00048112028,0.0002409005,0.0018995777,0.00026918613,0.00008336358,0.00020590714,0.000068326444,0.6344073,0.012301932,0.0030566254,0.028858824,0.31812695],"study_design_scores_gemma":[0.000045293924,0.000113657574,0.00018811176,0.000014614875,0.000016616415,0.000028726037,0.000028343673,0.99014014,0.0051918677,0.0023129175,0.0019116788,0.000007960579],"about_ca_topic_score_codex":0.0066243545,"about_ca_topic_score_gemma":0.018428367,"teacher_disagreement_score":0.011170244,"about_ca_system_score_codex":0.0011394433,"about_ca_system_score_gemma":0.0014730443,"threshold_uncertainty_score":0.03736818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004756275,0.000041258932,0.9940925,0.00006205506,0.000016190917,0.000030773026,0.000017067112,0.00052994146,0.0004539775],"genre_scores_gemma":[0.54628175,0.00009231898,0.45050892,0.00014927126,0.000033181404,0.0003952037,0.00012237884,0.00028440976,0.0021324188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867934,0.0005568902,0.00009434766,0.0002207119,0.00026965622,0.00017914153],"domain_scores_gemma":[0.99584097,0.0029097782,0.0002672012,0.00041070892,0.00037690855,0.00019441485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025481451,0.0010088326,0.0013803495,0.00048519578,0.0005417572,0.0014187463,0.0015377033,0.001567223,0.00428763],"category_scores_gemma":[0.009726472,0.00089142483,0.0008940281,0.00045099796,0.0013413043,0.0021877664,0.0020535844,0.003628187,0.0008703198],"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.00020834302,0.00015490611,0.0006406398,0.00012367446,0.00004840447,0.00008591618,0.00014443809,0.83960855,0.005107183,0.035829563,0.0012820783,0.116766214],"study_design_scores_gemma":[0.000008479065,0.000015785754,0.000032920485,0.000005340651,0.0000031937263,0.0000042634565,0.0000033063818,0.987394,0.00072068,0.011642279,0.00016538051,0.0000043514237],"about_ca_topic_score_codex":0.0028536967,"about_ca_topic_score_gemma":0.004632657,"teacher_disagreement_score":0.00428763,"about_ca_system_score_codex":0.0010634571,"about_ca_system_score_gemma":0.001747118,"threshold_uncertainty_score":0.01434356},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01756753,0.001573961,0.96260625,0.0019622028,0.0004918183,0.000061771396,0.0002338175,0.00023978682,0.015262776],"genre_scores_gemma":[0.81740904,0.002206441,0.13643506,0.0003841428,0.0006656115,0.00011846398,0.0004667128,0.00021950559,0.042094987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974033,0.0011407628,0.00014342947,0.00048564066,0.0005703504,0.0002564443],"domain_scores_gemma":[0.99083203,0.0057755234,0.0004793468,0.0015135774,0.00082507177,0.0005744895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009063993,0.0013253121,0.0017968947,0.00079822855,0.00057592324,0.0038740383,0.002595481,0.0022911732,0.013557774],"category_scores_gemma":[0.02152213,0.001055458,0.001628956,0.0011305995,0.001831388,0.0068172044,0.0019242613,0.00620854,0.0012008345],"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.00013968961,0.0000705888,0.00049980095,0.00008415533,0.000082898994,0.00011403428,0.00009869231,0.13532424,0.0006488211,0.8187618,0.0027769234,0.041398376],"study_design_scores_gemma":[0.000014572223,0.000025484183,0.00013834788,0.0000211019,0.000025477455,0.00006200916,0.000009453324,0.52516955,0.00038397088,0.47149485,0.0026348953,0.000020420039],"about_ca_topic_score_codex":0.0014597205,"about_ca_topic_score_gemma":0.0010945862,"teacher_disagreement_score":0.013557774,"about_ca_system_score_codex":0.0022372473,"about_ca_system_score_gemma":0.0013704337,"threshold_uncertainty_score":0.047935545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064553,0.0133377025,0.43185145,0.13897204,0.017715963,0.003201159,0.0058168652,0.007297093,0.3172547],"genre_scores_gemma":[0.70305496,0.007706532,0.17718622,0.017080164,0.009862456,0.004633719,0.0066636684,0.0039539277,0.069858365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.8000788,0.07725739,0.018880768,0.022182683,0.07781791,0.0037823364],"domain_scores_gemma":[0.23499547,0.26920325,0.04132246,0.3522913,0.09408827,0.008099325],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.18736787,0.001144463,0.0030205129,0.008997427,0.0039943284,0.018888487,0.0051334025,0.004358014,0.019147145],"category_scores_gemma":[0.4559733,0.0015885291,0.0024072144,0.008655598,0.02428084,0.012469431,0.0149304485,0.0073242136,0.011588757],"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.0008288081,0.0004899283,0.019862104,0.0032169498,0.000904438,0.001308334,0.0064659715,0.0022417945,0.005871657,0.70507985,0.05870218,0.19502799],"study_design_scores_gemma":[0.00028905328,0.00023430046,0.0052787364,0.0012784126,0.00028273274,0.0007369818,0.0011071382,0.002397511,0.0061806035,0.8005225,0.18160494,0.00008712706],"about_ca_topic_score_codex":0.0008668511,"about_ca_topic_score_gemma":0.0010289728,"teacher_disagreement_score":0.81263214,"about_ca_system_score_codex":0.0053760884,"about_ca_system_score_gemma":0.021698326,"threshold_uncertainty_score":0.99090785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021487006,0.00017617804,0.99653184,0.00009092156,0.000027036442,0.000038225247,0.000034878653,0.00028517164,0.00066694536],"genre_scores_gemma":[0.12478726,0.00027502002,0.870053,0.0002177173,0.00006212309,0.0001941653,0.00036664528,0.00038173827,0.003662357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986558,0.00075056485,0.00006168237,0.00020454807,0.00026370707,0.00006367789],"domain_scores_gemma":[0.99656063,0.0023471715,0.00019444962,0.0003908593,0.00038126434,0.0001256285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003735239,0.0010965796,0.0008674617,0.0008290479,0.0005838625,0.0011762853,0.00233355,0.0017330502,0.003776854],"category_scores_gemma":[0.018825104,0.00084899476,0.0010377814,0.0006889251,0.0012244945,0.0031458358,0.0020797085,0.0026504959,0.0016668402],"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.0003199581,0.00015693739,0.0022535087,0.00041065575,0.00024212209,0.00016165034,0.00035187876,0.54306614,0.005016035,0.2202707,0.011149394,0.21660103],"study_design_scores_gemma":[0.000008426411,0.00000996259,0.00007910488,0.00001310986,0.0000059993154,0.00003095255,0.000007482678,0.9764193,0.000564399,0.02138419,0.0014678912,0.000009170645],"about_ca_topic_score_codex":0.006173844,"about_ca_topic_score_gemma":0.009644754,"teacher_disagreement_score":0.006173844,"about_ca_system_score_codex":0.0011695169,"about_ca_system_score_gemma":0.0018524273,"threshold_uncertainty_score":0.019754112},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056824675,0.0036505936,0.96521795,0.0018381081,0.0002420945,0.00012762751,0.0008402124,0.0005271139,0.02187382],"genre_scores_gemma":[0.38900042,0.008529601,0.5625518,0.0025481617,0.0010359854,0.0008114039,0.0024473597,0.00078288664,0.032292347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884534,0.00051456044,0.000039930128,0.00023625816,0.00024806935,0.00011596081],"domain_scores_gemma":[0.99849904,0.0009506246,0.00016431452,0.00018952371,0.00010216727,0.00009448909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002175526,0.0019789708,0.0015533882,0.0007705024,0.00050265575,0.0016757374,0.0013720543,0.0014567288,0.012020923],"category_scores_gemma":[0.004752299,0.0005996787,0.0011124918,0.0021258034,0.0013568857,0.0027594077,0.002108946,0.0034813276,0.0022294298],"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.00014472925,0.00019943628,0.0007359574,0.0007247458,0.00018076292,0.000119173266,0.00010877311,0.33626872,0.0017503083,0.43725657,0.054874297,0.16763662],"study_design_scores_gemma":[0.00003881431,0.00007997981,0.00028266478,0.000060545593,0.000027931103,0.000109379405,0.000043254593,0.6212183,0.0006370581,0.35618103,0.02130219,0.000018842404],"about_ca_topic_score_codex":0.0017512044,"about_ca_topic_score_gemma":0.0032441267,"teacher_disagreement_score":0.012020923,"about_ca_system_score_codex":0.0016283923,"about_ca_system_score_gemma":0.001587132,"threshold_uncertainty_score":0.040213943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06212186,0.00063748873,0.9337736,0.00045104494,0.0001032206,0.000045665947,0.00012399968,0.0011352214,0.0016080486],"genre_scores_gemma":[0.84229094,0.00053306576,0.15113427,0.000308462,0.000096456264,0.00012931449,0.00053539313,0.00022022975,0.0047518276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934036,0.00023417614,0.00004315754,0.00022059339,0.0000942908,0.00006755815],"domain_scores_gemma":[0.99698275,0.0016594254,0.00023361032,0.00071864866,0.00033960128,0.00006600697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002285273,0.0012467649,0.0013563675,0.00059926935,0.00044711403,0.00095446064,0.0020099012,0.0016693622,0.0023378083],"category_scores_gemma":[0.007732585,0.0007077964,0.0008826114,0.00070963625,0.00070105615,0.0031453574,0.0014773147,0.0028694964,0.0006657851],"study_design_candidate":"bench_or_experimental","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.00024270819,0.00012661617,0.0013383738,0.000050240807,0.000099447214,0.00006336991,0.00011436789,0.76403445,0.002995559,0.012227447,0.0019249732,0.21678248],"study_design_scores_gemma":[0.000004466486,0.000012561742,0.00005823716,0.0000036141469,0.000006122559,0.0000046508194,0.0000022084305,0.9961719,0.0003920404,0.0032336426,0.00010789967,0.0000027032386],"about_ca_topic_score_codex":0.009557621,"about_ca_topic_score_gemma":0.008606377,"teacher_disagreement_score":0.009557621,"about_ca_system_score_codex":0.0008362971,"about_ca_system_score_gemma":0.00083703373,"threshold_uncertainty_score":0.019003987},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01275584,0.00018213346,0.9835734,0.00071542175,0.00006124099,0.00008262462,0.00035627332,0.00030517267,0.0019678932],"genre_scores_gemma":[0.6925181,0.0005413974,0.29637086,0.00085851754,0.00025979444,0.0005372076,0.0014237069,0.00044602848,0.007044413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99242955,0.003008212,0.00048530643,0.0019293784,0.0016817603,0.0004658048],"domain_scores_gemma":[0.9713057,0.016711615,0.002285278,0.0060348026,0.0026894636,0.00097314175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008132136,0.0013450467,0.0011852003,0.0012483889,0.0014492866,0.0027259158,0.0026562829,0.002168966,0.004951586],"category_scores_gemma":[0.062180992,0.00078210846,0.0011031628,0.0012633951,0.0026224162,0.009043214,0.004680683,0.004661809,0.0009968845],"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.00021592694,0.00014292507,0.0025016225,0.00021762608,0.00006552466,0.0001978649,0.00040023247,0.43206114,0.0025422922,0.48832062,0.004247339,0.06908685],"study_design_scores_gemma":[0.000018351095,0.000035111385,0.00022478797,0.00003146809,0.000010561409,0.000052637348,0.00003953247,0.57253444,0.0012216367,0.42397538,0.0018414069,0.000014764572],"about_ca_topic_score_codex":0.003042661,"about_ca_topic_score_gemma":0.004381413,"teacher_disagreement_score":0.008132136,"about_ca_system_score_codex":0.0023108744,"about_ca_system_score_gemma":0.0024083012,"threshold_uncertainty_score":0.043007314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004691385,0.00015029692,0.993895,0.00017449785,0.000027177817,0.000031534008,0.000065358174,0.0001619997,0.0008026526],"genre_scores_gemma":[0.52086025,0.0014175564,0.4629457,0.0006519715,0.0002648915,0.00045648136,0.00090833515,0.000480669,0.012014205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989151,0.00048525832,0.000041934356,0.00027209678,0.00021863505,0.00006704453],"domain_scores_gemma":[0.9976242,0.0011672359,0.0001892914,0.0003810468,0.00047611797,0.00016205704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028437858,0.0009042357,0.0008295157,0.00091628754,0.0004796613,0.0012156948,0.0018196772,0.0011580968,0.0036114308],"category_scores_gemma":[0.009221866,0.00049943506,0.00073543756,0.0009604622,0.0028957261,0.0030053973,0.002386192,0.002544719,0.0012738694],"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.00017091547,0.00007879162,0.0020500657,0.00015996447,0.0000587939,0.0001475521,0.00021511177,0.2966638,0.004786773,0.5850519,0.0060501634,0.10456614],"study_design_scores_gemma":[0.000010020771,0.000047069745,0.00020404324,0.00001661758,0.000006124868,0.000059533348,0.000017010309,0.89208454,0.0011076677,0.103615336,0.0028130158,0.000018987268],"about_ca_topic_score_codex":0.0023512524,"about_ca_topic_score_gemma":0.0019472038,"teacher_disagreement_score":0.0036114308,"about_ca_system_score_codex":0.0014817534,"about_ca_system_score_gemma":0.0010491097,"threshold_uncertainty_score":0.015039563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7383288,0.0058870255,0.24814583,0.001236709,0.00014556471,0.00008107369,0.00137411,0.0017235734,0.00307726],"genre_scores_gemma":[0.9736143,0.00051607826,0.02245163,0.00012936455,0.000041094543,0.00004964319,0.0019390781,0.00016055151,0.0010982928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974291,0.0012777809,0.00017726065,0.00036839343,0.0005253282,0.00022208715],"domain_scores_gemma":[0.93216795,0.0577975,0.0018948831,0.0034776006,0.004144928,0.0005171674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084259035,0.0006433566,0.0008631665,0.0010568177,0.00046372082,0.0007937511,0.0009388309,0.0016893848,0.0019183388],"category_scores_gemma":[0.057549722,0.0004053525,0.00042915158,0.0012079553,0.00075688964,0.0018528628,0.0006860707,0.0014143464,0.00062073517],"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.0011002297,0.00023112421,0.013024646,0.00029323247,0.00018589055,0.000119267235,0.0001474031,0.90577,0.0050948756,0.0056496575,0.00378041,0.06460322],"study_design_scores_gemma":[0.000016716587,0.00014397805,0.0037194765,0.000023956029,0.000022798216,0.0001053619,0.000032397176,0.99179345,0.0025038393,0.0013322219,0.00028944656,0.000016382866],"about_ca_topic_score_codex":0.008301697,"about_ca_topic_score_gemma":0.0048251515,"teacher_disagreement_score":0.0084259035,"about_ca_system_score_codex":0.001274676,"about_ca_system_score_gemma":0.0011476021,"threshold_uncertainty_score":0.04456097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022981701,0.0004255785,0.9724582,0.0005058526,0.000112745365,0.000039895363,0.00017834664,0.00030876134,0.0029889753],"genre_scores_gemma":[0.55762106,0.0014743337,0.41811278,0.00053614145,0.0003799192,0.00021192525,0.0020604841,0.00046641502,0.019136908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986584,0.000524114,0.00009245261,0.00030739224,0.00032052046,0.000097102915],"domain_scores_gemma":[0.9967145,0.001307583,0.00025993495,0.00073871395,0.0007130152,0.00026629536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002465092,0.0006777537,0.0010871704,0.0014644655,0.00086684455,0.002309416,0.002254495,0.001298687,0.0051316833],"category_scores_gemma":[0.011084834,0.00045353643,0.0009056708,0.001546281,0.0018179881,0.0045080977,0.0038825895,0.002803688,0.0016082712],"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.00020595378,0.00011354211,0.0015879953,0.00017854304,0.000073801646,0.000057545498,0.00023883337,0.11314796,0.002430392,0.6428525,0.007152941,0.23195998],"study_design_scores_gemma":[0.000015721256,0.00007070893,0.0002594662,0.000019813633,0.000010089671,0.000036619065,0.000060018017,0.61194426,0.00077628694,0.38284996,0.003933269,0.000023721213],"about_ca_topic_score_codex":0.0036847165,"about_ca_topic_score_gemma":0.0031238354,"teacher_disagreement_score":0.0051316833,"about_ca_system_score_codex":0.0016078653,"about_ca_system_score_gemma":0.001540823,"threshold_uncertainty_score":0.01716721},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026416508,0.00034654155,0.968351,0.0005041801,0.000030663898,0.000059511414,0.0008158217,0.0011273929,0.0023484428],"genre_scores_gemma":[0.69397765,0.00082117313,0.29109147,0.0004271396,0.00012387022,0.0004996026,0.0047398396,0.0011556138,0.0071636974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984428,0.0006249373,0.00006299357,0.00039677392,0.00035987646,0.000112555725],"domain_scores_gemma":[0.9831366,0.013593438,0.0009715857,0.0011753901,0.00090538943,0.00021765122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020280394,0.0008506885,0.0005751484,0.0019798195,0.0005110956,0.0015232858,0.0019254916,0.0014760997,0.0032325964],"category_scores_gemma":[0.016193168,0.0008996109,0.0014526463,0.0014048591,0.0019037622,0.0028822236,0.001316102,0.0020026783,0.0009999388],"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.00006589059,0.00007663778,0.004550778,0.00019921293,0.000083645515,0.00038849784,0.0008438428,0.7320086,0.0024620437,0.20916997,0.0044449354,0.04570605],"study_design_scores_gemma":[0.000009641111,0.000009400772,0.0003024798,0.000019994439,0.000009482818,0.000086534405,0.000025556943,0.88699555,0.0004883753,0.11025917,0.0017830015,0.000010872104],"about_ca_topic_score_codex":0.006691869,"about_ca_topic_score_gemma":0.01157548,"teacher_disagreement_score":0.006691869,"about_ca_system_score_codex":0.00140358,"about_ca_system_score_gemma":0.0014210301,"threshold_uncertainty_score":0.013305843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051279407,0.000110621266,0.99838555,0.00008342124,0.000038181883,0.000011448962,0.000019990533,0.00017543042,0.0006625235],"genre_scores_gemma":[0.15486093,0.0006632758,0.8363083,0.0002961957,0.00024815384,0.0004231193,0.00038949473,0.00027806443,0.0065325145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988795,0.0003527434,0.00006112885,0.00030571653,0.00034258288,0.000058377795],"domain_scores_gemma":[0.99828196,0.0007975092,0.0001764417,0.00029554762,0.0003891564,0.00005942911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875689,0.0012881346,0.0012917047,0.00055401743,0.0005427664,0.00087532337,0.001933164,0.0016524924,0.0032684866],"category_scores_gemma":[0.0049967957,0.0005369459,0.0008749398,0.0010490853,0.0011180206,0.001293514,0.0016498655,0.0029685986,0.0011697682],"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.000059331687,0.00003448044,0.00020774904,0.00019188394,0.00006593098,0.00007870305,0.00005728172,0.864855,0.0032914588,0.052840274,0.006667232,0.071650766],"study_design_scores_gemma":[0.000014863894,0.000014824299,0.000031005082,0.000006911456,0.0000046045407,0.000019448762,0.0000041563976,0.97856724,0.000555102,0.018671477,0.0021043473,0.000006044236],"about_ca_topic_score_codex":0.0021643168,"about_ca_topic_score_gemma":0.0018924844,"teacher_disagreement_score":0.0032684866,"about_ca_system_score_codex":0.0007798883,"about_ca_system_score_gemma":0.001550218,"threshold_uncertainty_score":0.010934174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013276492,0.00027765322,0.98043936,0.0009252244,0.000098350894,0.00016404506,0.00009636293,0.0005672918,0.004155222],"genre_scores_gemma":[0.72197765,0.00028800138,0.27159378,0.0006304975,0.0001798599,0.00041651868,0.00020479792,0.00017806783,0.00453079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98746616,0.0063412264,0.00050874235,0.0016170334,0.0029987346,0.0010679767],"domain_scores_gemma":[0.9722387,0.01836983,0.001201776,0.005978383,0.0015235072,0.00068783795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010953593,0.0012987222,0.002202103,0.0009466702,0.001020755,0.0029324023,0.0037092222,0.0034967975,0.004535081],"category_scores_gemma":[0.055067584,0.0006125243,0.0011747221,0.0011393559,0.003311014,0.0046562017,0.004402779,0.004533228,0.0009812308],"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.0009856225,0.00036878596,0.0021054184,0.00020353138,0.00016790724,0.00019423343,0.0002719955,0.33386996,0.0032908334,0.46062285,0.00555588,0.1923631],"study_design_scores_gemma":[0.00009522778,0.00011788659,0.00015943106,0.000027234213,0.000023235662,0.00007909091,0.00001902584,0.76554036,0.0029107064,0.22892016,0.002087639,0.00002006444],"about_ca_topic_score_codex":0.0010348423,"about_ca_topic_score_gemma":0.0008320331,"teacher_disagreement_score":0.010953593,"about_ca_system_score_codex":0.0037197007,"about_ca_system_score_gemma":0.0035102472,"threshold_uncertainty_score":0.0579288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014164275,0.0002851525,0.98220414,0.00036187287,0.000064690554,0.00006951856,0.000043103966,0.00046762082,0.0023396243],"genre_scores_gemma":[0.664749,0.00024543074,0.3271852,0.00043101018,0.00007358113,0.00033274773,0.00024053612,0.0003394242,0.006403112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897766,0.00034070946,0.00004797934,0.00020931511,0.00030036434,0.00012398836],"domain_scores_gemma":[0.99499714,0.0031335226,0.00033326139,0.0006610859,0.0005613175,0.00031371572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027103839,0.001239705,0.0020847884,0.0006847101,0.0007663841,0.0011593611,0.0024604544,0.0020925356,0.0039389734],"category_scores_gemma":[0.013823671,0.0006008911,0.00081363984,0.0006384702,0.0017738305,0.0019754244,0.0028198923,0.0034232798,0.0009254823],"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.00021781611,0.000114996554,0.0008011697,0.00013682537,0.000042069503,0.00014111106,0.00013747005,0.8479833,0.0015891506,0.052664753,0.0033454245,0.09282597],"study_design_scores_gemma":[0.000015264513,0.00003464485,0.00003866708,0.000009706613,0.0000030756823,0.000023725104,0.000007728343,0.9866701,0.00051751896,0.012279235,0.0003959235,0.000004388615],"about_ca_topic_score_codex":0.003130248,"about_ca_topic_score_gemma":0.0026095058,"teacher_disagreement_score":0.0039389734,"about_ca_system_score_codex":0.0012483745,"about_ca_system_score_gemma":0.0018247485,"threshold_uncertainty_score":0.014334083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04360911,0.0009584599,0.9454795,0.0012123227,0.00015858204,0.00031844352,0.00049494614,0.0023354678,0.0054331943],"genre_scores_gemma":[0.71175075,0.00074932736,0.2720569,0.0010692434,0.00046362574,0.0007535446,0.0015014851,0.00042124026,0.0112339575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669564,0.0014897778,0.0001456634,0.00054272683,0.0006736731,0.00045257527],"domain_scores_gemma":[0.9894637,0.007325516,0.00079535693,0.0011150818,0.00076102157,0.0005392809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00540759,0.0020339282,0.0033206001,0.00138909,0.0012252418,0.0021740422,0.0045918603,0.0032865487,0.006061103],"category_scores_gemma":[0.021227986,0.0010073598,0.0010643547,0.0024264904,0.0019646643,0.003877722,0.0026282906,0.0032807994,0.0024282834],"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.0011596337,0.0007020694,0.0039468138,0.00036081078,0.00013271312,0.00019871628,0.00017108244,0.69551134,0.0019029086,0.055653553,0.016578808,0.22368152],"study_design_scores_gemma":[0.00005960291,0.00007433565,0.00014145832,0.000013598381,0.000011742095,0.00004132784,0.000014126088,0.9783724,0.00044566908,0.020169348,0.00064625207,0.000010111454],"about_ca_topic_score_codex":0.0057882727,"about_ca_topic_score_gemma":0.006767552,"teacher_disagreement_score":0.006061103,"about_ca_system_score_codex":0.0020977296,"about_ca_system_score_gemma":0.0029488448,"threshold_uncertainty_score":0.028598368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012681741,0.00023372697,0.9844466,0.0001227315,0.00004572638,0.000055279874,0.000045823635,0.0017947833,0.00057372625],"genre_scores_gemma":[0.2854782,0.00023707391,0.7093232,0.0003492083,0.0000828271,0.00027775188,0.00040432607,0.0006217023,0.0032256523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986085,0.0003745376,0.000100557125,0.00041262287,0.00040456752,0.000099275436],"domain_scores_gemma":[0.9973658,0.00076713576,0.00035761477,0.00085694273,0.00057452696,0.000078010606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003014941,0.0016480318,0.0014356484,0.0009686974,0.00048829237,0.00097474153,0.0028784028,0.0017649083,0.0023972245],"category_scores_gemma":[0.012157822,0.0010186281,0.0007445737,0.00081215805,0.0011906861,0.0024092062,0.0021923743,0.0025211123,0.0016236571],"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.00038767696,0.00017803494,0.0017646163,0.00020180333,0.00014002724,0.00010546793,0.00014108836,0.4014745,0.029572,0.014514827,0.007002268,0.5445177],"study_design_scores_gemma":[0.000021366905,0.000054195192,0.00016967837,0.000020248075,0.000014077788,0.00004607942,0.000012361416,0.97905433,0.009618066,0.009448349,0.0015300137,0.000011216259],"about_ca_topic_score_codex":0.0012831802,"about_ca_topic_score_gemma":0.0023567092,"teacher_disagreement_score":0.003014941,"about_ca_system_score_codex":0.0007359701,"about_ca_system_score_gemma":0.00096971134,"threshold_uncertainty_score":0.01594472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045449627,0.00011087459,0.99365187,0.00010758722,0.00001899875,0.00001843439,0.000050434875,0.00040269885,0.0010939847],"genre_scores_gemma":[0.4706727,0.00037476444,0.5154199,0.0005463081,0.0000791883,0.00033226298,0.00066086673,0.000754151,0.011159946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928844,0.00024571668,0.000033435466,0.00019135688,0.00017036035,0.00007060462],"domain_scores_gemma":[0.99880004,0.000696722,0.00007965451,0.00023472817,0.00011570954,0.00007315576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013551307,0.0010091033,0.0009119992,0.00041949152,0.00033992538,0.0010368628,0.0021915159,0.0013064475,0.0039412454],"category_scores_gemma":[0.00453036,0.0007768964,0.0008807061,0.00052026054,0.0011914758,0.0022048927,0.0028511784,0.0034085826,0.001131072],"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.00008354191,0.000066584464,0.0007040015,0.00006847001,0.00006237131,0.00006567569,0.00009752771,0.8006102,0.004667386,0.08688087,0.0028338043,0.103859566],"study_design_scores_gemma":[0.0000051989823,0.000009903773,0.000035171513,0.000004601424,0.0000027850022,0.000013086853,0.0000031581633,0.98571384,0.0006072481,0.0128792375,0.00072230306,0.000003531434],"about_ca_topic_score_codex":0.0029585343,"about_ca_topic_score_gemma":0.005609837,"teacher_disagreement_score":0.0039412454,"about_ca_system_score_codex":0.0008540086,"about_ca_system_score_gemma":0.0009380816,"threshold_uncertainty_score":0.013184726},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09186279,0.0031413166,0.84551597,0.0014420773,0.00084801554,0.000315771,0.0059002033,0.031412434,0.019561438],"genre_scores_gemma":[0.4777571,0.001110042,0.462626,0.0010813621,0.00021147626,0.00056298816,0.019063681,0.0015040477,0.036083214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956864,0.000052630774,0.000017731514,0.0001654938,0.0001377987,0.00005773594],"domain_scores_gemma":[0.9996093,0.00007275447,0.000037161928,0.000111418674,0.00014090698,0.000028543138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008134414,0.0013738719,0.00076593907,0.0005982749,0.00055482116,0.0010086006,0.0028126892,0.0014859593,0.0046733688],"category_scores_gemma":[0.0018490315,0.0005423979,0.0006344685,0.00063789455,0.00062391197,0.0018487709,0.0016207625,0.0017559112,0.0027649242],"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.0004937277,0.000284678,0.0020952392,0.00026797442,0.0001825813,0.00024897623,0.00007379579,0.4831185,0.016926818,0.024610888,0.064174965,0.4075219],"study_design_scores_gemma":[0.000024642333,0.000051717147,0.00019148005,0.000012632587,0.000010139355,0.000037409205,0.00000832341,0.9816373,0.006175678,0.005876848,0.005962354,0.000011529612],"about_ca_topic_score_codex":0.009484422,"about_ca_topic_score_gemma":0.017925654,"teacher_disagreement_score":0.009484422,"about_ca_system_score_codex":0.0011531821,"about_ca_system_score_gemma":0.0015515663,"threshold_uncertainty_score":0.018858433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060151707,0.00022972662,0.9341944,0.00021389505,0.00008121847,0.000097708136,0.00010494677,0.0023107608,0.0026156995],"genre_scores_gemma":[0.7448787,0.00012413015,0.25252843,0.00009963955,0.000027022852,0.00017651102,0.00013595715,0.00019356977,0.0018360124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994961,0.00011430168,0.000040622308,0.00012730023,0.00013873292,0.00008301013],"domain_scores_gemma":[0.9982339,0.0008953833,0.00014272021,0.0004440965,0.00013419718,0.00014969894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093853177,0.0007804367,0.0008157133,0.00042471127,0.00048157902,0.0007641969,0.0014583437,0.00065919635,0.005164178],"category_scores_gemma":[0.0036685716,0.0004869588,0.00044983227,0.00038382417,0.00095077255,0.0014300043,0.0015053486,0.0015403691,0.00056518544],"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.0009631538,0.00023366498,0.0014723531,0.0001891261,0.00006277036,0.00029409246,0.0002748831,0.7062021,0.020839116,0.026359016,0.0025149784,0.24059477],"study_design_scores_gemma":[0.00006826109,0.00008937803,0.00012900372,0.000011245612,0.00001343824,0.00004721026,0.000025383642,0.9798544,0.0037283085,0.014811961,0.0012098495,0.00001154878],"about_ca_topic_score_codex":0.0027193527,"about_ca_topic_score_gemma":0.0030980115,"teacher_disagreement_score":0.005164178,"about_ca_system_score_codex":0.00046719576,"about_ca_system_score_gemma":0.0012939163,"threshold_uncertainty_score":0.01727587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060311165,0.0009714551,0.93135846,0.0019258077,0.00018128731,0.00008537402,0.00028504262,0.0016193968,0.0032620127],"genre_scores_gemma":[0.9469174,0.00018093624,0.05043998,0.0003971942,0.00007572672,0.00009797402,0.00023336332,0.000066537905,0.001590813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993649,0.00023603413,0.00003323116,0.00015465611,0.000092794064,0.000118349046],"domain_scores_gemma":[0.9966912,0.0023849288,0.00029168985,0.00016610717,0.00026033202,0.00020576309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016947058,0.0011670658,0.0009237741,0.0003835848,0.00036161143,0.0007224043,0.0015686083,0.0011710336,0.0024723527],"category_scores_gemma":[0.008403841,0.000584111,0.0003912527,0.00044042338,0.0009297924,0.0012676935,0.0010934174,0.0022079716,0.00037178237],"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.00015714226,0.000068250534,0.0010871051,0.000038989027,0.00002511592,0.000039287963,0.00003359529,0.96930903,0.00056692463,0.0030399456,0.0012865331,0.024348097],"study_design_scores_gemma":[0.000009058054,0.000009977468,0.00005256265,0.0000030066753,0.000002664435,0.000003427858,0.0000026599641,0.9975858,0.00013539697,0.0021055068,0.0000878811,0.000002142903],"about_ca_topic_score_codex":0.01297212,"about_ca_topic_score_gemma":0.013963279,"teacher_disagreement_score":0.01297212,"about_ca_system_score_codex":0.0015417367,"about_ca_system_score_gemma":0.00224869,"threshold_uncertainty_score":0.025793195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017799444,0.00024357233,0.96541625,0.00032323963,0.00010894693,0.000047886362,0.00023013662,0.0016191292,0.014211371],"genre_scores_gemma":[0.7175115,0.0005490666,0.25228032,0.0005852358,0.00017787391,0.00020006244,0.0010851739,0.00068706175,0.026923684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951625,0.00008652104,0.000019321771,0.00013823951,0.0001665043,0.000073247254],"domain_scores_gemma":[0.99929714,0.00029575735,0.00008635526,0.00015639709,0.000121261604,0.000043102656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069547136,0.0010113487,0.0005174182,0.00046312754,0.00027793183,0.00087576517,0.001268173,0.0008748615,0.008725392],"category_scores_gemma":[0.0031388649,0.00035326174,0.00067375693,0.00026735102,0.0009797352,0.001475714,0.0016605817,0.0013242995,0.0023892496],"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.000117767864,0.000074477124,0.0007567519,0.00013453964,0.00006261921,0.00032816658,0.00013851722,0.6356168,0.013618444,0.18946336,0.007184343,0.15250412],"study_design_scores_gemma":[0.0000073936403,0.000037929643,0.00010188254,0.000012800381,0.000010967945,0.000092825285,0.000009670975,0.9460414,0.003425833,0.04632395,0.0039261356,0.000009188696],"about_ca_topic_score_codex":0.0021899596,"about_ca_topic_score_gemma":0.0037554991,"teacher_disagreement_score":0.008725392,"about_ca_system_score_codex":0.0005155413,"about_ca_system_score_gemma":0.00059169566,"threshold_uncertainty_score":0.029189408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057580543,0.00007419389,0.9989196,0.00007771858,0.000017063145,0.000012162529,0.0000122516685,0.000044380246,0.000266813],"genre_scores_gemma":[0.15019205,0.00082654256,0.8430253,0.00038537674,0.00026728402,0.00030226033,0.00022982991,0.00023768676,0.004533615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837494,0.0008595975,0.000065934815,0.00023049116,0.00038833433,0.00008061725],"domain_scores_gemma":[0.9940355,0.0041884086,0.0004206745,0.00055239565,0.0006022836,0.00020065323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080893,0.001086249,0.00089346303,0.0015720138,0.0006421201,0.0013998309,0.0017420322,0.0016922534,0.0026660669],"category_scores_gemma":[0.021480521,0.00084744097,0.0010670277,0.0010281751,0.0025397614,0.0033164395,0.0028944062,0.0032448312,0.00079904887],"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.000054769298,0.000096776734,0.0012781298,0.00024320041,0.00010926258,0.00012097057,0.00021595135,0.3102138,0.003589323,0.6000942,0.003534395,0.08044923],"study_design_scores_gemma":[0.000008081009,0.000018939088,0.00014826504,0.00002277618,0.000008330398,0.000050516708,0.000014253336,0.85843617,0.0006208141,0.1386103,0.0020461082,0.000015381958],"about_ca_topic_score_codex":0.0024563405,"about_ca_topic_score_gemma":0.0029011983,"teacher_disagreement_score":0.004080893,"about_ca_system_score_codex":0.001041376,"about_ca_system_score_gemma":0.0016542131,"threshold_uncertainty_score":0.021582067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007058033,0.00022945281,0.98709226,0.0002951227,0.000032666587,0.00002854719,0.00016709723,0.0005823646,0.004514406],"genre_scores_gemma":[0.53313154,0.00092165533,0.44082245,0.00079132995,0.00019876737,0.0004074729,0.0009170401,0.00094108045,0.021868613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886453,0.00041293967,0.000046915095,0.00028730126,0.00025652285,0.0001318027],"domain_scores_gemma":[0.9981225,0.001151177,0.0001483829,0.00032411568,0.00015133402,0.0001024749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016412296,0.0010521009,0.0012534007,0.0010214243,0.0008936266,0.0015015239,0.001965246,0.002138375,0.0072514075],"category_scores_gemma":[0.007709518,0.0009573208,0.0014581083,0.000959437,0.0023452032,0.0030921367,0.0036937918,0.002353824,0.0022554058],"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.00007919061,0.000031343727,0.0004998697,0.00010653518,0.00004966684,0.000085507716,0.00015663481,0.475684,0.0032456138,0.46140322,0.0027205944,0.055937856],"study_design_scores_gemma":[0.000006643569,0.000011252395,0.0000650096,0.000015701402,0.0000057395914,0.000034718272,0.0000128689735,0.7512513,0.0010580966,0.24572784,0.0017967486,0.000014053533],"about_ca_topic_score_codex":0.0018990464,"about_ca_topic_score_gemma":0.003091865,"teacher_disagreement_score":0.0072514075,"about_ca_system_score_codex":0.0012643267,"about_ca_system_score_gemma":0.0011685842,"threshold_uncertainty_score":0.024258375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021259215,0.00014313868,0.97285366,0.0002837145,0.00005920976,0.00008053095,0.000096911426,0.0016106359,0.0036129176],"genre_scores_gemma":[0.6290453,0.00018214702,0.36063862,0.00035105806,0.000041714364,0.0002827486,0.00031830536,0.00059913704,0.008540953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976987,0.000060324048,0.000008497952,0.000065657165,0.00007044892,0.000025212024],"domain_scores_gemma":[0.9992194,0.0005182623,0.00006712382,0.00010698069,0.0000483567,0.000039834078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006226793,0.00073332613,0.00035923097,0.00028931885,0.0002371629,0.0005913495,0.0009323251,0.0008104,0.003548558],"category_scores_gemma":[0.0029638587,0.00035853471,0.0005399295,0.00018829246,0.0010446358,0.0007100333,0.0014090731,0.0016747604,0.00057598256],"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.000058204485,0.000037663813,0.0005595168,0.00004853377,0.000025535235,0.000072615585,0.00008903787,0.9352196,0.0048656235,0.019542567,0.0016206916,0.037860427],"study_design_scores_gemma":[0.0000046158675,0.000011634231,0.00002929552,0.0000046113532,0.0000021339963,0.000011978132,0.0000043219256,0.9929015,0.0011459033,0.005225261,0.00065649557,0.0000021099975],"about_ca_topic_score_codex":0.0021518276,"about_ca_topic_score_gemma":0.00391197,"teacher_disagreement_score":0.003548558,"about_ca_system_score_codex":0.0007400499,"about_ca_system_score_gemma":0.0006143062,"threshold_uncertainty_score":0.0118710995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3268034,0.0015525637,0.6644776,0.0014992214,0.0001608544,0.000068123416,0.0004973945,0.0007151815,0.0042257025],"genre_scores_gemma":[0.8819226,0.0010121188,0.11390493,0.00024392405,0.000099842975,0.00010762242,0.00069889805,0.0003318803,0.0016779953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978573,0.0009006187,0.00015743263,0.0004023217,0.0005519471,0.0001304162],"domain_scores_gemma":[0.98407215,0.009261594,0.00166935,0.0025589839,0.0022950496,0.00014282049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003172817,0.0005175489,0.00047329796,0.0016221004,0.00054456404,0.0017597676,0.00052507233,0.0008547837,0.0009082171],"category_scores_gemma":[0.04818755,0.00047701556,0.00035981173,0.0016086907,0.0012911009,0.005480413,0.0015580286,0.0015430981,0.00052935735],"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.0003789664,0.00013762452,0.09534712,0.000577245,0.000242481,0.0004587252,0.0047169724,0.20142433,0.03820248,0.13347045,0.006925682,0.5181179],"study_design_scores_gemma":[0.000032886768,0.000079487865,0.019615978,0.00015576318,0.000057123103,0.00040670176,0.00093548145,0.7184461,0.030379986,0.21633318,0.013477878,0.000079504316],"about_ca_topic_score_codex":0.004065749,"about_ca_topic_score_gemma":0.005401797,"teacher_disagreement_score":0.004065749,"about_ca_system_score_codex":0.00092335127,"about_ca_system_score_gemma":0.0010997421,"threshold_uncertainty_score":0.016779661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011748978,0.00030287952,0.9839214,0.0002693075,0.0000415469,0.00008322692,0.00006748823,0.0011567936,0.0024083934],"genre_scores_gemma":[0.42915308,0.00057437655,0.556286,0.0006570305,0.00012956576,0.0007265375,0.00066216406,0.00055571453,0.011255578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902,0.00026555525,0.000057914905,0.00022251226,0.00033069318,0.000103323284],"domain_scores_gemma":[0.9985909,0.000687097,0.00016374815,0.0002009973,0.00028960395,0.00006759174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021941252,0.001937092,0.0012824001,0.0007156617,0.00049253856,0.0012934345,0.0018423349,0.0018930446,0.002715179],"category_scores_gemma":[0.0053885765,0.00088565936,0.000683122,0.00075856555,0.001108094,0.0018688161,0.0022293972,0.0032124615,0.0014184201],"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.00008397948,0.00014419103,0.0006811268,0.00012275121,0.000074613374,0.000074724536,0.000044238295,0.7875523,0.0052929325,0.0155924605,0.004187136,0.18614955],"study_design_scores_gemma":[0.000007799464,0.000036604837,0.0000613658,0.000009214324,0.0000042166175,0.000016672071,0.0000046965047,0.99070895,0.0013219247,0.007334057,0.0004900677,0.0000044092913],"about_ca_topic_score_codex":0.003008013,"about_ca_topic_score_gemma":0.006186543,"teacher_disagreement_score":0.003008013,"about_ca_system_score_codex":0.0016525901,"about_ca_system_score_gemma":0.0017935297,"threshold_uncertainty_score":0.011990368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011586674,0.0001810232,0.9870733,0.00015227671,0.000012235433,0.0000118763155,0.00003145682,0.00017844443,0.0007726814],"genre_scores_gemma":[0.6905538,0.0008001732,0.3036909,0.00015625634,0.00007149906,0.00010155536,0.00033622063,0.00018548894,0.0041040448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994549,0.0001881244,0.00002578129,0.00013405595,0.0001460682,0.000051090985],"domain_scores_gemma":[0.99824107,0.00093645754,0.00015445553,0.0003083205,0.0002682347,0.00009147837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001676011,0.00062729744,0.000700415,0.0006312861,0.000393779,0.0010446243,0.00093289954,0.0009794029,0.0017477892],"category_scores_gemma":[0.009560085,0.00033898026,0.00071013416,0.00062322646,0.0012226548,0.0021998745,0.0016808418,0.00199192,0.0005057763],"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.00011070673,0.00005293097,0.0015610134,0.00013019484,0.000047602607,0.000095774245,0.0001687353,0.59661525,0.0051625725,0.28260627,0.001518363,0.11193055],"study_design_scores_gemma":[0.000002164832,0.0000061392298,0.00009612268,0.000003938478,0.0000021352325,0.000009266203,0.000003858244,0.95208275,0.0003202507,0.047221538,0.00024837352,0.0000033821955],"about_ca_topic_score_codex":0.003221412,"about_ca_topic_score_gemma":0.0031723934,"teacher_disagreement_score":0.003221412,"about_ca_system_score_codex":0.0011589857,"about_ca_system_score_gemma":0.0009292579,"threshold_uncertainty_score":0.0088636875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014217505,0.0005366278,0.9799065,0.000360463,0.000073348485,0.000059179296,0.00022132728,0.0030227355,0.0016022433],"genre_scores_gemma":[0.59126365,0.0006370726,0.40022454,0.0008052499,0.00014750559,0.000380601,0.001289968,0.00058306276,0.0046682954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930775,0.00019310825,0.000055003944,0.00020928025,0.00014752675,0.000087394954],"domain_scores_gemma":[0.9986644,0.0008275282,0.00011049504,0.00018389699,0.00015697294,0.000056721317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010217694,0.0017176036,0.0012220173,0.0006846759,0.00031644292,0.0012694612,0.001939904,0.0018911753,0.0050180443],"category_scores_gemma":[0.005495403,0.0007378911,0.00067457417,0.0006857576,0.00093019113,0.0023413172,0.0016277465,0.0029628063,0.0018145631],"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.0004136054,0.000110648914,0.00051262585,0.00032722123,0.000096840406,0.00018400578,0.00011242664,0.58113647,0.023091404,0.042277917,0.0052964613,0.34644043],"study_design_scores_gemma":[0.000008745359,0.000022395569,0.000025076035,0.000012040165,0.0000066502125,0.000014305592,0.000004923277,0.9832997,0.002708815,0.013465116,0.00042821706,0.0000040293594],"about_ca_topic_score_codex":0.0022647078,"about_ca_topic_score_gemma":0.0030134362,"teacher_disagreement_score":0.0050180443,"about_ca_system_score_codex":0.0010453495,"about_ca_system_score_gemma":0.0011162646,"threshold_uncertainty_score":0.016787052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047993013,0.0005323645,0.99201465,0.0007338153,0.00007437913,0.000027117914,0.00005192822,0.000052710515,0.0017136852],"genre_scores_gemma":[0.23230734,0.0039090714,0.74952644,0.00066824874,0.0010721934,0.00031022116,0.00035160308,0.0003900088,0.011464811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864036,0.00071434927,0.0000683433,0.00021184565,0.00027892514,0.00008622127],"domain_scores_gemma":[0.9972881,0.0016947556,0.00021239814,0.00044731118,0.00024872244,0.00010869465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035967473,0.0021986554,0.0016190705,0.0006835558,0.00039660846,0.001921988,0.0015387175,0.0015737121,0.0031455248],"category_scores_gemma":[0.010331141,0.00072167115,0.0010933481,0.0009760565,0.0024531458,0.0051388796,0.002635385,0.0041323705,0.00056602183],"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.00040855902,0.00020013141,0.00032597344,0.00043262125,0.00010725316,0.00014569315,0.00019779641,0.4158923,0.0057779592,0.42536107,0.008452359,0.14269829],"study_design_scores_gemma":[0.000031234114,0.000106785774,0.00008390565,0.000037091748,0.000021271435,0.000068297675,0.000031339052,0.86837107,0.0011938785,0.12714311,0.0028899221,0.000021984246],"about_ca_topic_score_codex":0.0009502225,"about_ca_topic_score_gemma":0.0008176309,"teacher_disagreement_score":0.0035967473,"about_ca_system_score_codex":0.00052998896,"about_ca_system_score_gemma":0.00079293153,"threshold_uncertainty_score":0.01902169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012624708,0.00016158375,0.9838864,0.0003878003,0.000044388184,0.000029676963,0.00014145118,0.00052081095,0.0022030473],"genre_scores_gemma":[0.7288518,0.0004001719,0.26302096,0.0005102659,0.00010847086,0.00021549981,0.00079772936,0.00043383046,0.005661298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986921,0.00050891505,0.000046624547,0.00027637873,0.00034914765,0.0001267464],"domain_scores_gemma":[0.9957438,0.0030598827,0.0002658136,0.0004776359,0.00030958376,0.00014328702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002709325,0.0012209226,0.0012309777,0.0007589463,0.0006637704,0.0012659518,0.002168828,0.0015386115,0.0032782555],"category_scores_gemma":[0.012136292,0.00088344776,0.0009267658,0.0006819905,0.002329669,0.0026742748,0.0027797602,0.0045099235,0.00066111377],"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.00008319427,0.000021566208,0.00043676735,0.000038275695,0.000027069618,0.000056070134,0.000048556416,0.91613793,0.0010528739,0.061248742,0.0011162545,0.019732686],"study_design_scores_gemma":[0.0000035339854,0.000004610078,0.000029844361,0.000005283515,0.0000017613673,0.000007867558,0.000002012581,0.9820734,0.0003085485,0.017300239,0.0002584168,0.0000044065837],"about_ca_topic_score_codex":0.005161356,"about_ca_topic_score_gemma":0.0059989905,"teacher_disagreement_score":0.005161356,"about_ca_system_score_codex":0.0017617733,"about_ca_system_score_gemma":0.0018723748,"threshold_uncertainty_score":0.01432848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0658917,0.0027677305,0.91932863,0.0025710217,0.00030573815,0.00006882412,0.0001854233,0.0031882778,0.005692649],"genre_scores_gemma":[0.8029591,0.0017067245,0.18864626,0.0013768945,0.00039689543,0.00019981465,0.0005353052,0.0007356327,0.003443481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953661,0.001680136,0.00021161571,0.0011002467,0.0013465931,0.00029535202],"domain_scores_gemma":[0.9818045,0.008971954,0.0015339975,0.004284243,0.0031153152,0.00029002535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009801947,0.0015469254,0.0011995884,0.0015289183,0.0010772122,0.0024237738,0.0031246287,0.0024550194,0.0025557214],"category_scores_gemma":[0.06634749,0.0009977521,0.00082413416,0.0013825584,0.0031317854,0.005964175,0.0037580675,0.006323694,0.000991137],"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.00027007662,0.000072591734,0.0051115546,0.00013357533,0.000153817,0.00009772449,0.0002767117,0.7474628,0.0046913084,0.04942009,0.003786335,0.1885234],"study_design_scores_gemma":[0.000012279525,0.00004498034,0.0008077416,0.000054835615,0.000015932632,0.000055520795,0.000029581395,0.946363,0.003522083,0.04742347,0.0016450112,0.000025519344],"about_ca_topic_score_codex":0.0043114545,"about_ca_topic_score_gemma":0.0027311968,"teacher_disagreement_score":0.009801947,"about_ca_system_score_codex":0.0027789276,"about_ca_system_score_gemma":0.001476236,"threshold_uncertainty_score":0.05183822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11758275,0.0011632775,0.87414396,0.00070435397,0.00015181197,0.00016170196,0.0004784574,0.0018227282,0.003791016],"genre_scores_gemma":[0.7910136,0.00049343007,0.19874229,0.0010226205,0.0001046178,0.00030569636,0.002068745,0.00027042057,0.005978695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992336,0.00027726375,0.000024093562,0.00028000685,0.00009836985,0.00008671304],"domain_scores_gemma":[0.9982791,0.0009167259,0.00011023479,0.00044865758,0.0001710872,0.00007425487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017445899,0.001501825,0.0014661212,0.00075677456,0.0005350013,0.00087961176,0.0019257923,0.0017235006,0.0020468165],"category_scores_gemma":[0.005248987,0.00060242525,0.00096741266,0.00067544135,0.0015338449,0.0033489144,0.0024784647,0.0025217552,0.00065820734],"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.0006679269,0.0003556289,0.0061220154,0.00032759493,0.0002821303,0.00038976106,0.00033300093,0.5978578,0.018968115,0.02968371,0.009894793,0.33511755],"study_design_scores_gemma":[0.000018408702,0.0001003219,0.00047946948,0.00002007391,0.000016968872,0.00012470731,0.000029872182,0.97118384,0.0029975176,0.023779014,0.001230586,0.000019255136],"about_ca_topic_score_codex":0.0019727168,"about_ca_topic_score_gemma":0.0034418816,"teacher_disagreement_score":0.0020468165,"about_ca_system_score_codex":0.000667518,"about_ca_system_score_gemma":0.00082355406,"threshold_uncertainty_score":0.009226322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017529627,0.0007974888,0.9756141,0.00046239258,0.00009966984,0.00013429117,0.00009075631,0.00030031885,0.004971364],"genre_scores_gemma":[0.6492397,0.0010864275,0.34009495,0.0006281554,0.0002901192,0.00072301,0.0004263252,0.00023836507,0.0072729527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732286,0.0017120402,0.00009048361,0.0003019925,0.00038605824,0.0001865938],"domain_scores_gemma":[0.9865588,0.01099243,0.00084072957,0.0008237517,0.0004154668,0.00036870418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049328287,0.0013291042,0.0017725419,0.0011300176,0.000840617,0.001929459,0.0019669293,0.0017753638,0.0050398614],"category_scores_gemma":[0.022167312,0.0007568907,0.0012627683,0.0016273034,0.0020332674,0.0025288633,0.0014698558,0.0024336062,0.0007680389],"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.00022772318,0.00011646096,0.0013905539,0.00019105527,0.00011196663,0.00012107576,0.00008628379,0.65855265,0.0008958898,0.30430326,0.0029692121,0.031033885],"study_design_scores_gemma":[0.000018995097,0.000028739403,0.00008692448,0.000014241344,0.000009335402,0.000019233437,0.000008611239,0.92704034,0.00019649036,0.07195295,0.00061860523,0.0000056715835],"about_ca_topic_score_codex":0.003290706,"about_ca_topic_score_gemma":0.0039938353,"teacher_disagreement_score":0.0050398614,"about_ca_system_score_codex":0.0021968496,"about_ca_system_score_gemma":0.0015044629,"threshold_uncertainty_score":0.026087642},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026933251,0.00082225277,0.9696591,0.0006507508,0.00004402371,0.000024326488,0.000047634494,0.00019031987,0.001628326],"genre_scores_gemma":[0.72682476,0.0032736396,0.26130202,0.0005583695,0.00031182106,0.00025777853,0.00041774026,0.00031752267,0.006736356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900573,0.0004778117,0.000055493583,0.00017579908,0.00019387293,0.00009131946],"domain_scores_gemma":[0.9914927,0.0065522315,0.00071493443,0.00044396322,0.0006091151,0.0001870776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036049148,0.0013066423,0.0009823715,0.0007559572,0.00044734636,0.0010296798,0.001167747,0.0012604455,0.0016506063],"category_scores_gemma":[0.017209083,0.00084229757,0.0006240071,0.0007398401,0.0022585047,0.0033897352,0.0024345522,0.0025472075,0.0003164541],"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.000104918254,0.00005652142,0.0010278764,0.000117924734,0.000068471985,0.00012415547,0.00014197822,0.8271533,0.0048262076,0.13309343,0.0010792721,0.032205917],"study_design_scores_gemma":[0.000004850192,0.00002496609,0.00008593875,0.000010042922,0.000004605964,0.000014556037,0.000006070834,0.9676317,0.00049379974,0.0314903,0.00022648346,0.000006678708],"about_ca_topic_score_codex":0.004057998,"about_ca_topic_score_gemma":0.0047651893,"teacher_disagreement_score":0.004057998,"about_ca_system_score_codex":0.00091260637,"about_ca_system_score_gemma":0.0009300134,"threshold_uncertainty_score":0.019064844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.547167,0.0016721088,0.29124182,0.0030635467,0.0008698142,0.0006697997,0.025543237,0.10703555,0.022737108],"genre_scores_gemma":[0.8298802,0.00028241883,0.15076448,0.0002408762,0.0001459129,0.000199817,0.012063375,0.0023521462,0.004070861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996486,0.00008781659,0.000016754144,0.000084357,0.00011303866,0.00004935351],"domain_scores_gemma":[0.9990907,0.0003984141,0.000056829413,0.00021303138,0.00015052833,0.00009050768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451594,0.00077583554,0.00056090293,0.0013419023,0.00033546623,0.0011611566,0.00090540556,0.00054145884,0.00905452],"category_scores_gemma":[0.0068704905,0.00035661313,0.00041140607,0.0012500046,0.00035890733,0.002349148,0.0012115926,0.0009556008,0.0013002948],"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.001346959,0.0008269072,0.024255907,0.00025596027,0.00043604008,0.00023375475,0.00017969459,0.33528247,0.0042859437,0.014495299,0.13460729,0.48379374],"study_design_scores_gemma":[0.00018259295,0.00008027729,0.0035090158,0.000012755329,0.000022159764,0.000037086458,0.000039079314,0.98115635,0.0013234018,0.0079339845,0.0056859446,0.000017300654],"about_ca_topic_score_codex":0.013832698,"about_ca_topic_score_gemma":0.017974978,"teacher_disagreement_score":0.013832698,"about_ca_system_score_codex":0.0008897425,"about_ca_system_score_gemma":0.0010020034,"threshold_uncertainty_score":0.030290365},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048157178,0.0005273885,0.94323516,0.00094592304,0.00033261962,0.000044775785,0.000067727255,0.00051213324,0.0061771055],"genre_scores_gemma":[0.7606824,0.00032466283,0.22455725,0.0003369443,0.00034760224,0.000118459866,0.00017125899,0.00039085903,0.013070488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988953,0.00046804102,0.00005277006,0.00019897861,0.00021579467,0.00016917997],"domain_scores_gemma":[0.9948161,0.002823687,0.0002768474,0.0010979453,0.0006588582,0.00032651375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034559616,0.0008802225,0.0019279526,0.0006497741,0.0009891791,0.0020296432,0.0023302864,0.0019095169,0.0052781035],"category_scores_gemma":[0.01731152,0.0006959335,0.00060574914,0.00069291244,0.0016195702,0.004519187,0.0027201923,0.0026077763,0.0008092179],"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.0012529667,0.00045127416,0.0023841232,0.00024368399,0.00017224434,0.00036018863,0.00024552358,0.46559277,0.006234319,0.317063,0.010036554,0.19596331],"study_design_scores_gemma":[0.00002051887,0.000032548665,0.0000647864,0.000005349136,0.0000071571158,0.00001900023,0.00000901615,0.9704977,0.00048746055,0.02845547,0.00039400908,0.000006968662],"about_ca_topic_score_codex":0.003388938,"about_ca_topic_score_gemma":0.0040461957,"teacher_disagreement_score":0.0052781035,"about_ca_system_score_codex":0.00074539473,"about_ca_system_score_gemma":0.0019283291,"threshold_uncertainty_score":0.018277109},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08912105,0.00046766052,0.90521574,0.00090599805,0.00012472166,0.00008062233,0.00008190687,0.00028931725,0.0037129323],"genre_scores_gemma":[0.9273905,0.00018313204,0.067517474,0.00015434918,0.00012130174,0.000121355195,0.00012047743,0.00008285624,0.004308548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985655,0.0005816506,0.000063470245,0.00036587587,0.00021001657,0.00021351865],"domain_scores_gemma":[0.9963147,0.0026001662,0.00024413469,0.00034117542,0.00028343298,0.00021634785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028446028,0.0009876047,0.0019579588,0.00061495526,0.0010522351,0.0018007075,0.0023037964,0.0016287472,0.0030196428],"category_scores_gemma":[0.0055400413,0.0008436024,0.0007339994,0.0011754754,0.0011549235,0.00237293,0.0024278746,0.0014008752,0.00029229323],"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.00018344063,0.000093651746,0.00030395124,0.000024020857,0.000041275147,0.00007055983,0.000019830999,0.9793649,0.0008044096,0.0049596797,0.00066317455,0.01347112],"study_design_scores_gemma":[0.000008284829,0.000009273331,0.000025329125,5.403598e-7,0.0000027833555,0.000003056947,0.0000032496066,0.99841213,0.000061360915,0.001436075,0.000037051184,8.6594497e-7],"about_ca_topic_score_codex":0.0043788804,"about_ca_topic_score_gemma":0.00442389,"teacher_disagreement_score":0.0043788804,"about_ca_system_score_codex":0.0015468474,"about_ca_system_score_gemma":0.0012144216,"threshold_uncertainty_score":0.015043855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027933227,0.00033721016,0.96856403,0.0007430987,0.00004697276,0.000022211818,0.00007770748,0.00042187324,0.0018536295],"genre_scores_gemma":[0.8364969,0.00035330417,0.15612608,0.00039082285,0.00015256746,0.0001966646,0.0002653791,0.00032364373,0.005694756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981852,0.001095964,0.00007826278,0.00028327756,0.0001976314,0.00015961222],"domain_scores_gemma":[0.9868059,0.011105594,0.00044325955,0.00093365205,0.00041676906,0.0002948312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033080175,0.0011934072,0.0023768987,0.00090091437,0.00087723584,0.0026188453,0.002012132,0.0034826812,0.003506488],"category_scores_gemma":[0.022403436,0.001492067,0.0011908023,0.0011498645,0.0029782194,0.0048832176,0.003479902,0.003540602,0.0007141049],"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.000173859,0.000072846844,0.0008870505,0.000100241916,0.00008995599,0.00011284795,0.00018671944,0.80673045,0.00075448205,0.16160212,0.0015564222,0.027732976],"study_design_scores_gemma":[0.000016389233,0.000011712789,0.000041165607,0.000009151094,0.000007843156,0.000011894981,0.000008356005,0.92590934,0.00012608129,0.07371467,0.00013689218,0.000006503011],"about_ca_topic_score_codex":0.003311217,"about_ca_topic_score_gemma":0.003261361,"teacher_disagreement_score":0.003506488,"about_ca_system_score_codex":0.0011399965,"about_ca_system_score_gemma":0.0011175483,"threshold_uncertainty_score":0.017494678},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61965936,0.0006041713,0.36965564,0.0006594876,0.00016863726,0.00010102109,0.00089791307,0.004763612,0.003490134],"genre_scores_gemma":[0.9121309,0.00018418695,0.083730094,0.00014185139,0.00008752355,0.000041039773,0.001529484,0.0003034179,0.0018515798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982158,0.00045858705,0.000111101435,0.00034666582,0.0006524117,0.00021538624],"domain_scores_gemma":[0.99245995,0.0041374485,0.00075355003,0.0009347312,0.001332389,0.00038198582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012847253,0.00086037297,0.00075322716,0.0023050199,0.0007516422,0.0011996055,0.0010576346,0.0019537301,0.0020991527],"category_scores_gemma":[0.010628351,0.000426879,0.00048041242,0.0012575921,0.0007589112,0.0018944977,0.0019180841,0.0016308444,0.0011468241],"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.0027338313,0.00089213776,0.16180566,0.00049365463,0.00035662428,0.006069094,0.0010976685,0.04935011,0.14112909,0.022912858,0.022674663,0.59048456],"study_design_scores_gemma":[0.000047645743,0.00016279955,0.021495024,0.000052525353,0.00005609593,0.0031127606,0.00043792152,0.91707,0.038570877,0.013682452,0.005262438,0.000049460505],"about_ca_topic_score_codex":0.0017886908,"about_ca_topic_score_gemma":0.003761075,"teacher_disagreement_score":0.0023050199,"about_ca_system_score_codex":0.00045054723,"about_ca_system_score_gemma":0.00062734174,"threshold_uncertainty_score":0.007022381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011701743,0.018407717,0.72291636,0.13816041,0.0039702062,0.000031348594,0.00034469628,0.00032846635,0.10413905],"genre_scores_gemma":[0.8172453,0.015704723,0.09115303,0.013350904,0.011361647,0.00015305397,0.00022848143,0.00030694413,0.050495874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828774,0.0007985032,0.00005257446,0.00021207056,0.0005228274,0.00012631746],"domain_scores_gemma":[0.9909609,0.0066884495,0.0002884717,0.0008350075,0.0008856789,0.000341529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035846038,0.0010833823,0.00091436185,0.0005724762,0.0008744919,0.003424035,0.0018503168,0.0031655636,0.0076192017],"category_scores_gemma":[0.01386805,0.00046354532,0.000390664,0.00061226595,0.003994334,0.0084235575,0.002499212,0.008672443,0.0011314309],"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.00013162215,0.000039392537,0.00012987065,0.00010623961,0.000025740654,0.00005015662,0.000059512673,0.02138823,0.00026620092,0.9258012,0.011114414,0.04088736],"study_design_scores_gemma":[0.000019050512,0.00002473404,0.000052346884,0.000051904462,0.0000075126927,0.000030589454,0.00002137016,0.047322705,0.00030277582,0.9422253,0.00992963,0.000012175352],"about_ca_topic_score_codex":0.0015095127,"about_ca_topic_score_gemma":0.0010772039,"teacher_disagreement_score":0.0076192017,"about_ca_system_score_codex":0.0022376785,"about_ca_system_score_gemma":0.0012133087,"threshold_uncertainty_score":0.025488794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06984034,0.0005690632,0.91463035,0.0030454386,0.00011406891,0.00015708758,0.00014754325,0.00079907913,0.0106971385],"genre_scores_gemma":[0.9324486,0.00041984298,0.06419825,0.00056733936,0.000156584,0.00020591612,0.00014815126,0.00017965223,0.0016756156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9875832,0.005193582,0.00060933235,0.0020266806,0.0037205347,0.00086658896],"domain_scores_gemma":[0.9171763,0.057716314,0.004501977,0.017419359,0.002132424,0.0010536431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013583453,0.001697897,0.0011433461,0.0008600819,0.00085636316,0.0026644634,0.00264255,0.0027565788,0.002193448],"category_scores_gemma":[0.08327256,0.0009040793,0.0010750075,0.000496593,0.006087805,0.006152884,0.0060723084,0.0065030926,0.0005203863],"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.00042840553,0.00019238036,0.004060602,0.00024820317,0.00018390952,0.00044332613,0.0004579003,0.5643301,0.023723556,0.34296337,0.0025752904,0.06039296],"study_design_scores_gemma":[0.000038252143,0.00030919875,0.001133386,0.000082789324,0.000044783083,0.00045088877,0.000087640066,0.6697973,0.012917203,0.3131266,0.0019555488,0.00005641285],"about_ca_topic_score_codex":0.00040906822,"about_ca_topic_score_gemma":0.00034891846,"teacher_disagreement_score":0.013583453,"about_ca_system_score_codex":0.001669867,"about_ca_system_score_gemma":0.0008832967,"threshold_uncertainty_score":0.07183701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080911264,0.00014798301,0.91203797,0.0003004438,0.000036078105,0.00005435006,0.0001122926,0.0004167253,0.0059828563],"genre_scores_gemma":[0.9341864,0.00021732393,0.059404958,0.00019856304,0.000046064968,0.00010257103,0.00021706999,0.00016978943,0.005457319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955565,0.00014448968,0.000019829748,0.00008991405,0.00011580403,0.00007435954],"domain_scores_gemma":[0.99568933,0.0028416163,0.00040833218,0.00045427718,0.0003955269,0.00021096677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017686893,0.0005348315,0.00050070824,0.0008868209,0.0005256502,0.0012672511,0.0008437358,0.0010400356,0.0037527564],"category_scores_gemma":[0.013018775,0.00035042607,0.000563929,0.00041404448,0.001584335,0.0022851937,0.0014917331,0.001601221,0.00048147072],"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.00014613263,0.00004073975,0.0018754578,0.00007010798,0.00001617506,0.0001694334,0.00022444781,0.7632115,0.004961121,0.2003827,0.0015715526,0.027330646],"study_design_scores_gemma":[0.000004466758,0.0000147653245,0.00016521616,0.000006551005,0.0000018807539,0.000025536998,0.000013415202,0.96881,0.00073909434,0.029827,0.00038626645,0.0000058023074],"about_ca_topic_score_codex":0.0031859542,"about_ca_topic_score_gemma":0.0019455844,"teacher_disagreement_score":0.0037527564,"about_ca_system_score_codex":0.0013726498,"about_ca_system_score_gemma":0.0006733567,"threshold_uncertainty_score":0.012554288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14239797,0.0001437292,0.84984916,0.0007890675,0.000060914863,0.000084182124,0.000098004886,0.0005121082,0.0060649207],"genre_scores_gemma":[0.94391453,0.000045963418,0.054494325,0.000101266545,0.0000109462935,0.00007879031,0.00005388874,0.000045046945,0.0012552586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897885,0.0005755264,0.000044759992,0.00016832085,0.000113357484,0.000119210614],"domain_scores_gemma":[0.9942457,0.0038769776,0.00047240622,0.0005877593,0.0004025082,0.00041466384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023558596,0.0005889152,0.00079772243,0.0005255658,0.0005544263,0.0012519074,0.0017835048,0.0012953947,0.0048223543],"category_scores_gemma":[0.012079798,0.0006077595,0.0005185204,0.00037897303,0.0021540136,0.002576538,0.0023353635,0.0021158282,0.00028842848],"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.00025146958,0.00014862166,0.002437349,0.000112391666,0.00006847967,0.00011568786,0.0005798488,0.8209447,0.0028049995,0.11653964,0.00093374477,0.055063024],"study_design_scores_gemma":[0.000024873681,0.000037070302,0.00017847568,0.000010560432,0.00000810479,0.000006519702,0.000041401356,0.92714983,0.0002646463,0.07206038,0.00020952443,0.00000854415],"about_ca_topic_score_codex":0.004308442,"about_ca_topic_score_gemma":0.0052290154,"teacher_disagreement_score":0.0048223543,"about_ca_system_score_codex":0.0008961641,"about_ca_system_score_gemma":0.0008729218,"threshold_uncertainty_score":0.016132355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014587517,0.0009291585,0.9793158,0.0003615677,0.000053359447,0.00009749582,0.0005715886,0.002909576,0.0011739415],"genre_scores_gemma":[0.4941717,0.00091387104,0.4899543,0.00083444524,0.00020394701,0.00043464525,0.006250672,0.0007967323,0.0064397943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790525,0.0005898841,0.00010305869,0.00089625997,0.0003636877,0.00014190667],"domain_scores_gemma":[0.99690825,0.001813338,0.00024407703,0.0006255217,0.00028135994,0.00012739308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018758249,0.0022668843,0.002221677,0.002818285,0.001046458,0.0019114601,0.004636619,0.0025253668,0.0026348887],"category_scores_gemma":[0.007531204,0.0014475674,0.0020688667,0.0028010227,0.0011638869,0.0068242396,0.0027087205,0.0030926277,0.0018100861],"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.0004982962,0.00048497302,0.003084904,0.0007033962,0.00037487067,0.00072305166,0.00068322406,0.38399237,0.013225666,0.028994104,0.016034987,0.55120015],"study_design_scores_gemma":[0.000014953505,0.00003763705,0.00033205032,0.000024692376,0.00003641905,0.000092148504,0.000042943117,0.94596547,0.0023835422,0.049286593,0.0017631403,0.000020365704],"about_ca_topic_score_codex":0.0047595664,"about_ca_topic_score_gemma":0.01070057,"teacher_disagreement_score":0.0047595664,"about_ca_system_score_codex":0.0013661771,"about_ca_system_score_gemma":0.0014071743,"threshold_uncertainty_score":0.009920418},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012702051,0.00016492326,0.9848968,0.00024531694,0.000027840964,0.000035663754,0.00010220346,0.00039242575,0.0014328876],"genre_scores_gemma":[0.7362354,0.0004712056,0.24756634,0.00051464676,0.00016651997,0.0003912109,0.0009389121,0.00063349557,0.013082299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994417,0.00022189318,0.00002324182,0.00016456678,0.000092391536,0.00005630384],"domain_scores_gemma":[0.99737966,0.0019413222,0.00016695302,0.00027060026,0.00015015308,0.000091404654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012946276,0.0010330392,0.0008319074,0.00052565197,0.0004226251,0.0008271868,0.001350951,0.0013457983,0.0029358396],"category_scores_gemma":[0.006149759,0.00069222064,0.00085476495,0.00053091475,0.0018507668,0.0018814955,0.0016141474,0.0023303463,0.000625035],"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.0000778118,0.00005203352,0.00050908525,0.00007923382,0.00004195422,0.00007936451,0.00014040626,0.89596206,0.00352985,0.048811194,0.0020091152,0.04870781],"study_design_scores_gemma":[0.000004543129,0.000010883817,0.00003229776,0.000004388796,0.0000017628589,0.0000072582243,0.000004233414,0.9857428,0.0003904701,0.01356022,0.0002376332,0.0000035216297],"about_ca_topic_score_codex":0.0038809355,"about_ca_topic_score_gemma":0.0052975537,"teacher_disagreement_score":0.0038809355,"about_ca_system_score_codex":0.0010490712,"about_ca_system_score_gemma":0.00090898975,"threshold_uncertainty_score":0.009821296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009725791,0.00033381896,0.98377824,0.0020561863,0.00013432578,0.00006131611,0.00023302408,0.00013482553,0.0035424945],"genre_scores_gemma":[0.8605252,0.0013522893,0.12556376,0.0009509528,0.00052589976,0.0007740841,0.00045513484,0.00014662866,0.009705968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995748,0.002324781,0.00019908964,0.00088625617,0.00053314015,0.00030879187],"domain_scores_gemma":[0.9720353,0.023209913,0.00201368,0.0012164601,0.0010370822,0.00048762758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009671796,0.0013033436,0.0016341435,0.0014780161,0.0014776558,0.0025206867,0.0023360304,0.0026617658,0.00693833],"category_scores_gemma":[0.036369495,0.0008175802,0.0015238088,0.0011752588,0.0044711893,0.0044998555,0.0031168407,0.0036773032,0.00046535657],"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.000022158889,0.00002529307,0.0014029841,0.00006299339,0.000037587357,0.00006402745,0.00015892064,0.23212677,0.00014513989,0.76118374,0.0007026946,0.004067565],"study_design_scores_gemma":[0.000014186356,0.0000144587775,0.00016694512,0.000015421836,0.000010813912,0.000014197738,0.000029187902,0.50253105,0.000060959534,0.49599758,0.0011315619,0.000013625409],"about_ca_topic_score_codex":0.01023328,"about_ca_topic_score_gemma":0.0062872707,"teacher_disagreement_score":0.01023328,"about_ca_system_score_codex":0.0036093448,"about_ca_system_score_gemma":0.002421636,"threshold_uncertainty_score":0.051149964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10679314,0.00025966737,0.86689097,0.0012028399,0.00010206252,0.00010977186,0.0006163757,0.0020185239,0.022006746],"genre_scores_gemma":[0.92465734,0.0001186165,0.06923925,0.00017767212,0.000038189937,0.00015552032,0.0002895649,0.00015563738,0.0051681953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.00020046454,0.000030341973,0.00011479096,0.00009597969,0.00010235544],"domain_scores_gemma":[0.9961196,0.0028383771,0.00016586583,0.00043691118,0.00022672037,0.00021249715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054214,0.00063295045,0.0011066889,0.0005563396,0.0007476389,0.0011652652,0.0015563049,0.00079472316,0.005651046],"category_scores_gemma":[0.0051332633,0.0007719977,0.00070416403,0.0008099878,0.00127524,0.0018394286,0.0022465899,0.0014249526,0.00048065928],"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.00025789998,0.00004777477,0.00047196724,0.000105321684,0.00004586973,0.00009855474,0.00009668668,0.9118842,0.0011768026,0.061890706,0.0022162758,0.021708012],"study_design_scores_gemma":[0.000017504286,0.000012722173,0.000040142175,0.0000027244532,0.000005359717,0.000006927409,0.00000866678,0.96805197,0.00025194383,0.031406187,0.00019254541,0.0000032476719],"about_ca_topic_score_codex":0.007778545,"about_ca_topic_score_gemma":0.012446266,"teacher_disagreement_score":0.007778545,"about_ca_system_score_codex":0.0011233825,"about_ca_system_score_gemma":0.0023519448,"threshold_uncertainty_score":0.018904686},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016282557,0.0010955051,0.94914705,0.0023380006,0.00015403237,0.00011474999,0.00024432252,0.0003513795,0.030272515],"genre_scores_gemma":[0.7623182,0.0029510974,0.20841435,0.0019298348,0.0006528756,0.0012538534,0.0006083856,0.0007622828,0.021109218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949039,0.0021684645,0.00019669603,0.00088055496,0.0011789539,0.00067150843],"domain_scores_gemma":[0.9601896,0.032810207,0.0019832116,0.0018990649,0.0021164499,0.0010015293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073143193,0.0021773984,0.0016730728,0.0018814085,0.0011780406,0.0043768184,0.0025851363,0.0021433767,0.012435374],"category_scores_gemma":[0.045448687,0.00079315633,0.001428788,0.0014201994,0.005412675,0.008344068,0.003568623,0.007547845,0.001578262],"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.00007250297,0.000066198416,0.00038974674,0.00014522496,0.000023658806,0.00005186379,0.0001439444,0.09947602,0.0010274845,0.883565,0.0029507307,0.012087708],"study_design_scores_gemma":[0.000014465852,0.00003597981,0.00013687552,0.00006241525,0.000009480027,0.000026745269,0.000025327032,0.4779672,0.0008735776,0.51910543,0.0017200869,0.000022448909],"about_ca_topic_score_codex":0.0016385838,"about_ca_topic_score_gemma":0.0017459508,"teacher_disagreement_score":0.012435374,"about_ca_system_score_codex":0.0048388354,"about_ca_system_score_gemma":0.002574283,"threshold_uncertainty_score":0.041600466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037266284,0.00075929594,0.94212973,0.00031829075,0.00020807506,0.0001665631,0.00034185656,0.012233888,0.0065760394],"genre_scores_gemma":[0.5466963,0.00043028264,0.43971932,0.00089908106,0.00013683153,0.00041145465,0.0021322567,0.0020939168,0.007480537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948275,0.00015334353,0.000024176868,0.000118542615,0.0001520823,0.00006906812],"domain_scores_gemma":[0.9988772,0.0005926773,0.00004747483,0.0002743523,0.00015232973,0.00005594809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381637,0.0015031742,0.00094729994,0.00050948083,0.00030760054,0.00063758274,0.0018506452,0.0007750058,0.0060561323],"category_scores_gemma":[0.0043176534,0.0006318267,0.00071713293,0.00035503492,0.00053835625,0.0013570691,0.0013099294,0.002498246,0.0020130512],"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.00048323654,0.00026041843,0.0030031104,0.00018112264,0.00016747751,0.00021937337,0.00013500734,0.6476471,0.01754746,0.013180918,0.026701258,0.29047352],"study_design_scores_gemma":[0.00001571091,0.000022433804,0.00013657239,0.0000067263873,0.000005720055,0.000027554159,0.000005003792,0.993432,0.0021379231,0.0030038236,0.0012020261,0.000004583132],"about_ca_topic_score_codex":0.0034174738,"about_ca_topic_score_gemma":0.008100949,"teacher_disagreement_score":0.0060561323,"about_ca_system_score_codex":0.0006593968,"about_ca_system_score_gemma":0.0007319772,"threshold_uncertainty_score":0.020259798},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025942312,0.00019410107,0.99613464,0.00013993461,0.000031256222,0.000021731063,0.000017509909,0.00027738806,0.0005892293],"genre_scores_gemma":[0.33004063,0.00059922604,0.6635331,0.0003824903,0.00015427441,0.00043286273,0.00025071987,0.0005098011,0.0040967497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986058,0.0006615659,0.00006943589,0.00026809098,0.00031399436,0.00008108508],"domain_scores_gemma":[0.99595475,0.0025451458,0.00026405588,0.0005559997,0.00050132425,0.00017879528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038034208,0.0014093133,0.0019908936,0.00087156455,0.00063922344,0.0015819526,0.0022188977,0.002048092,0.002718745],"category_scores_gemma":[0.010836476,0.0006722663,0.00095751975,0.0010133316,0.0019821245,0.0019142649,0.0031670656,0.0031804678,0.0010218575],"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.00011232735,0.00006862826,0.0005510669,0.0001308589,0.000066968576,0.0000662447,0.00010336747,0.88887334,0.0011051671,0.04755024,0.0019885101,0.059383307],"study_design_scores_gemma":[0.000011151497,0.000021436588,0.000029632325,0.000010134244,0.0000037804168,0.000008051502,0.000007820733,0.9747167,0.0002750527,0.024389198,0.0005228007,0.000004323923],"about_ca_topic_score_codex":0.0026002403,"about_ca_topic_score_gemma":0.002731251,"teacher_disagreement_score":0.0038034208,"about_ca_system_score_codex":0.0012253141,"about_ca_system_score_gemma":0.001583523,"threshold_uncertainty_score":0.02011466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031261515,0.00044695722,0.93761796,0.0011387576,0.00025903026,0.00026721708,0.0008712048,0.0042693433,0.023868144],"genre_scores_gemma":[0.48886773,0.00021582225,0.49460572,0.0007458105,0.00017961978,0.00037603558,0.00195884,0.00082625094,0.012224309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782807,0.0008085073,0.00009773446,0.00042741944,0.00050192437,0.00033627122],"domain_scores_gemma":[0.994253,0.0041389703,0.00028167551,0.00057499955,0.00054511713,0.00020619185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449405,0.0011939023,0.001972318,0.0021419586,0.001110414,0.001976595,0.0034037833,0.0024745408,0.040967803],"category_scores_gemma":[0.0097906785,0.0013000155,0.0015113034,0.0027290129,0.0009001168,0.0038133818,0.002596759,0.0025002847,0.00368375],"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.001307922,0.00062126346,0.0016625,0.0002663729,0.00016768939,0.0001859203,0.00015412041,0.54937094,0.0033575625,0.08844645,0.028785333,0.3256739],"study_design_scores_gemma":[0.000118908356,0.000049922426,0.0001546061,0.000013050532,0.000026545304,0.000028547585,0.000021740487,0.96622425,0.00075986475,0.031064287,0.0015261126,0.000012175948],"about_ca_topic_score_codex":0.0063119265,"about_ca_topic_score_gemma":0.013850734,"teacher_disagreement_score":0.040967803,"about_ca_system_score_codex":0.0018664055,"about_ca_system_score_gemma":0.0035590543,"threshold_uncertainty_score":0.13705093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004824522,0.00016099363,0.99373066,0.0002686101,0.000025118827,0.000020395071,0.00007169001,0.000098442055,0.0007996009],"genre_scores_gemma":[0.6522573,0.0014488648,0.33298168,0.000528892,0.00022422004,0.00045764973,0.0008540899,0.0003746309,0.010872556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984798,0.00054540334,0.0000914677,0.0003301955,0.00043385214,0.000119384684],"domain_scores_gemma":[0.9930548,0.0052257692,0.0005086668,0.0007002151,0.00036006878,0.00015038255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00366964,0.0010473815,0.0013522054,0.0011242598,0.0006296866,0.001897062,0.0026654631,0.0021728736,0.0037376955],"category_scores_gemma":[0.010758599,0.00087057066,0.00160367,0.0012975977,0.0027920988,0.0047663497,0.003890816,0.0047108913,0.0006478056],"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.000043646043,0.000026964379,0.00040301777,0.000054881675,0.000027328786,0.0000775494,0.000076792174,0.77968395,0.001043091,0.2074097,0.00055973785,0.010593379],"study_design_scores_gemma":[0.0000031150896,0.000005792356,0.000036148962,0.000005359261,0.0000021820872,0.000012124539,0.000004903178,0.94504184,0.00024338206,0.0542475,0.00039313812,0.0000045196866],"about_ca_topic_score_codex":0.0025369616,"about_ca_topic_score_gemma":0.0020275493,"teacher_disagreement_score":0.0037376955,"about_ca_system_score_codex":0.0015413733,"about_ca_system_score_gemma":0.00082805386,"threshold_uncertainty_score":0.019407094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066025187,0.00016213108,0.990445,0.00022522596,0.000026281645,0.00002307011,0.00025997226,0.00040774437,0.0018479767],"genre_scores_gemma":[0.60518914,0.0011498646,0.37416852,0.0005908426,0.00016093877,0.00041247133,0.0022699155,0.00076031894,0.015298009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990312,0.00044478956,0.000033593547,0.00023029782,0.00018008541,0.00008009201],"domain_scores_gemma":[0.99709094,0.0021578022,0.00018232128,0.00028684884,0.00020038574,0.00008167002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014385374,0.0009163927,0.0008904079,0.0010185073,0.00038040223,0.0016229284,0.0016619256,0.0015460993,0.005992238],"category_scores_gemma":[0.008499609,0.0009769934,0.0010776375,0.0008651797,0.0014814283,0.0026039504,0.0015827889,0.0027046623,0.0014347025],"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.000038569677,0.000016953181,0.00043874368,0.000058540674,0.000030410554,0.000063237465,0.00008452744,0.83404887,0.00090556627,0.13902001,0.0017017546,0.02359293],"study_design_scores_gemma":[0.000005643339,0.000005736332,0.00006934449,0.000014514215,0.0000058838064,0.000020435651,0.0000062282734,0.9088419,0.00020027066,0.08972504,0.0010988741,0.0000062060685],"about_ca_topic_score_codex":0.004859513,"about_ca_topic_score_gemma":0.008190857,"teacher_disagreement_score":0.005992238,"about_ca_system_score_codex":0.0012173292,"about_ca_system_score_gemma":0.0008775757,"threshold_uncertainty_score":0.020045996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027269881,0.00027286788,0.963923,0.0003304598,0.0001429722,0.000036213216,0.000091996044,0.0031856934,0.0047469274],"genre_scores_gemma":[0.54807234,0.00019483322,0.44168246,0.0003679732,0.000094634925,0.00009049853,0.00069221563,0.0012209881,0.007584141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996178,0.00015337054,0.000025710917,0.000084161475,0.000075927324,0.000043035267],"domain_scores_gemma":[0.9993043,0.00031659842,0.000050507075,0.00015602325,0.00014330883,0.000029262852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008492885,0.0012494583,0.00095603376,0.0005390692,0.00038321048,0.0010921562,0.0006967647,0.0012501469,0.0053432],"category_scores_gemma":[0.0036049746,0.0007183032,0.0006563325,0.00045728454,0.0003897307,0.0016464847,0.0008777447,0.0017157586,0.0015458667],"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.0002539342,0.0001348457,0.0012953802,0.000079882695,0.00007912691,0.000078459045,0.000058326,0.7722101,0.012741203,0.004918465,0.0073913396,0.20075893],"study_design_scores_gemma":[0.000009605436,0.000011786833,0.00012883237,0.0000041041317,0.0000056719177,0.000011683669,0.0000033511164,0.9961598,0.00243297,0.0006958169,0.0005329829,0.0000034059542],"about_ca_topic_score_codex":0.00407753,"about_ca_topic_score_gemma":0.0055007115,"teacher_disagreement_score":0.0053432,"about_ca_system_score_codex":0.0004966898,"about_ca_system_score_gemma":0.00081462506,"threshold_uncertainty_score":0.017874777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026261909,0.0013235192,0.7350302,0.0005507581,0.0014806901,0.0006257761,0.018781938,0.21104534,0.0048999083],"genre_scores_gemma":[0.109294504,0.000480355,0.82320815,0.00072652596,0.0002853524,0.0008905327,0.05011077,0.006275239,0.008728491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975318,0.00055488915,0.0004012438,0.0009336634,0.0004564605,0.000121893856],"domain_scores_gemma":[0.9964489,0.0013285342,0.00025780234,0.00075510214,0.00096939324,0.00024029499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021048486,0.0024772836,0.0018991864,0.004446163,0.002075815,0.0024149145,0.0025069725,0.001973465,0.011932032],"category_scores_gemma":[0.006883409,0.001194317,0.0014022592,0.002644866,0.0007674924,0.0053881337,0.005019866,0.001754738,0.014214392],"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.0017653665,0.00059082377,0.003470843,0.0021804452,0.0005514509,0.0011391488,0.0008710874,0.003902398,0.071710676,0.008693431,0.1985875,0.70653677],"study_design_scores_gemma":[0.0008732226,0.0009079398,0.007759606,0.00041840837,0.000602035,0.0027843514,0.0013699171,0.44269574,0.16488071,0.07621975,0.30092055,0.00056784105],"about_ca_topic_score_codex":0.002551638,"about_ca_topic_score_gemma":0.0053536384,"teacher_disagreement_score":0.011932032,"about_ca_system_score_codex":0.0005809327,"about_ca_system_score_gemma":0.0024367024,"threshold_uncertainty_score":0.039916694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007936827,0.00020845376,0.9874637,0.00032242195,0.00021080377,0.00005260047,0.000058038804,0.0007288954,0.0030182255],"genre_scores_gemma":[0.3838463,0.00027767188,0.60102046,0.0003634265,0.00027337964,0.0003469062,0.0003973415,0.00048053093,0.012993912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993741,0.0001774531,0.000028083452,0.00008458522,0.00025185116,0.00008391505],"domain_scores_gemma":[0.9985191,0.0007994347,0.000057318517,0.00021768534,0.0003140336,0.00009243301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870689,0.0010797298,0.0010913959,0.0004813427,0.00050166826,0.0007305368,0.0013685739,0.0014240505,0.007990088],"category_scores_gemma":[0.0049538347,0.0004509709,0.0005149382,0.00067133445,0.00094182236,0.0012078622,0.00196699,0.0023629733,0.0015317848],"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.0005874361,0.00027547166,0.0006964908,0.00022659604,0.00007708196,0.000187077,0.00016575669,0.64483935,0.0075762584,0.08032183,0.018334739,0.2467119],"study_design_scores_gemma":[0.00001990095,0.000021072621,0.00003655252,0.0000039184533,0.0000020636492,0.000011288099,0.0000050182916,0.9942965,0.00036877327,0.0046018674,0.0006302968,0.000002715916],"about_ca_topic_score_codex":0.0066316854,"about_ca_topic_score_gemma":0.0094195595,"teacher_disagreement_score":0.007990088,"about_ca_system_score_codex":0.00070115767,"about_ca_system_score_gemma":0.001667807,"threshold_uncertainty_score":0.026729524},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012691993,0.00023881962,0.9945075,0.0003083416,0.00023697194,0.000026967064,0.000019915236,0.00012796423,0.0032642945],"genre_scores_gemma":[0.14436415,0.00082208804,0.83659214,0.00070768566,0.0012733175,0.0003132677,0.00014866535,0.0007363122,0.015042436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969043,0.0012263505,0.00017750174,0.0004367565,0.0010533568,0.00020157557],"domain_scores_gemma":[0.99689084,0.0013088993,0.00015591725,0.0007634279,0.0007452732,0.00013566818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851099,0.001998225,0.003002143,0.0014995541,0.0010321027,0.0024690023,0.0034138188,0.0030740292,0.007831895],"category_scores_gemma":[0.013452939,0.0009346419,0.002273454,0.001475865,0.0020793898,0.0043421863,0.0038497366,0.0050899424,0.0019396133],"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.0001781077,0.00015553951,0.00037845975,0.00033589618,0.00021905887,0.0001222722,0.00018060548,0.24458943,0.0057774736,0.62039053,0.009343829,0.11832886],"study_design_scores_gemma":[0.000026205189,0.00007290001,0.000115663075,0.000019820143,0.000028492215,0.00006965647,0.000011979202,0.858978,0.0012805966,0.13383773,0.005526369,0.000032574462],"about_ca_topic_score_codex":0.0024694977,"about_ca_topic_score_gemma":0.0029449528,"teacher_disagreement_score":0.007831895,"about_ca_system_score_codex":0.001134847,"about_ca_system_score_gemma":0.0020738156,"threshold_uncertainty_score":0.026200294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021660103,0.0002423229,0.97526914,0.00052884565,0.000041020103,0.00003577748,0.00015944843,0.0006813155,0.0013820151],"genre_scores_gemma":[0.6781766,0.000566071,0.3142166,0.000569475,0.00019484089,0.00018175843,0.0012766813,0.000438745,0.0043792543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989779,0.0003770753,0.000039646613,0.00027455925,0.00024218355,0.000088579334],"domain_scores_gemma":[0.99800533,0.0011012545,0.00018169121,0.00028716694,0.000316938,0.00010763197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012588006,0.0011162817,0.0013522936,0.0017920451,0.0005503194,0.0015760567,0.0018694069,0.0022015832,0.0025489111],"category_scores_gemma":[0.0062387097,0.0006523003,0.0012630137,0.0016674132,0.0009737441,0.0032841815,0.0019249665,0.0017338828,0.0010691044],"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.00047454063,0.00034368903,0.0022919206,0.00032561214,0.00035772004,0.00016690716,0.00022751518,0.46061465,0.017771674,0.06289901,0.015898138,0.43862858],"study_design_scores_gemma":[0.000013792323,0.000044413177,0.00015512518,0.0000097399825,0.000029057317,0.000038444945,0.000020776886,0.9764832,0.0011766755,0.021546517,0.0004718549,0.000010438809],"about_ca_topic_score_codex":0.0026650375,"about_ca_topic_score_gemma":0.0037306054,"teacher_disagreement_score":0.0026650375,"about_ca_system_score_codex":0.0007876941,"about_ca_system_score_gemma":0.0010071995,"threshold_uncertainty_score":0.008526921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045438077,0.00076805265,0.93379176,0.0015651957,0.00012202655,0.00014461785,0.00022960812,0.0007040644,0.017236656],"genre_scores_gemma":[0.8279089,0.0007444768,0.15449029,0.0005883949,0.00019788975,0.00045441277,0.00026596134,0.0001940872,0.015155568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577147,0.0019377447,0.0002262809,0.00086597766,0.00067990815,0.0005186481],"domain_scores_gemma":[0.9872111,0.008400509,0.0012100431,0.0018120145,0.0009335528,0.00043271776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047036577,0.0015250215,0.002799682,0.00088273035,0.0013284202,0.0031900227,0.002553753,0.0035830305,0.005087982],"category_scores_gemma":[0.027818516,0.0008528181,0.0010182924,0.0011150877,0.0031419843,0.0040536486,0.0025936142,0.0035533074,0.0017600474],"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.00045696163,0.00014454982,0.0014603512,0.0002857968,0.00012951974,0.00018625123,0.0002995722,0.45299953,0.0024265784,0.47863448,0.008096405,0.054879997],"study_design_scores_gemma":[0.00006687687,0.000055504668,0.00019308309,0.000046471916,0.000020305484,0.00008135722,0.000031740696,0.79898006,0.00066606747,0.19789074,0.001942627,0.000025184212],"about_ca_topic_score_codex":0.00240722,"about_ca_topic_score_gemma":0.0021928414,"teacher_disagreement_score":0.005087982,"about_ca_system_score_codex":0.0021110233,"about_ca_system_score_gemma":0.0018167754,"threshold_uncertainty_score":0.024875581},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033196967,0.0005716514,0.95570916,0.00037065306,0.000094278366,0.00008926037,0.00080153235,0.0064007663,0.0027658457],"genre_scores_gemma":[0.5703318,0.00040231572,0.41865766,0.0005371282,0.00015474625,0.00018348255,0.0049434905,0.0007529247,0.0040364163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988772,0.00034683134,0.000035546967,0.0003797416,0.00025481786,0.000105773535],"domain_scores_gemma":[0.9975769,0.0008449022,0.00023062322,0.0008775051,0.0003459259,0.00012422871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426455,0.0012799687,0.0011026427,0.0016299582,0.000352859,0.0016111342,0.0025188758,0.0015026432,0.0031232194],"category_scores_gemma":[0.006365045,0.00043696622,0.0012462515,0.0012658072,0.0008276078,0.0032795244,0.0019651842,0.002514923,0.0014864992],"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.00046625533,0.00035631267,0.0030971114,0.00034215904,0.00024005164,0.00019157723,0.00021765927,0.28754097,0.02889353,0.028110798,0.023539511,0.627004],"study_design_scores_gemma":[0.000014121251,0.000055010343,0.00029850603,0.000013864613,0.000012810302,0.00005576138,0.000022382745,0.9739699,0.005123452,0.018997865,0.0014264645,0.000009823676],"about_ca_topic_score_codex":0.0027526335,"about_ca_topic_score_gemma":0.004921378,"teacher_disagreement_score":0.0031232194,"about_ca_system_score_codex":0.0010146942,"about_ca_system_score_gemma":0.0005174544,"threshold_uncertainty_score":0.010448217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009616638,0.00013080303,0.9888243,0.00014293652,0.000023625778,0.000032024567,0.00003853363,0.0005712544,0.0006198384],"genre_scores_gemma":[0.4605633,0.00029733375,0.5340109,0.000430449,0.00009854039,0.0003924169,0.0006745735,0.000806965,0.0027255334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695265,0.0015182825,0.00017461521,0.00042751755,0.00077327166,0.00015362461],"domain_scores_gemma":[0.98767686,0.008433718,0.0007726018,0.0015782086,0.0011423042,0.0003963492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010183141,0.0021492674,0.0019542768,0.0018542222,0.0007561784,0.0018111892,0.0032365695,0.0028933685,0.0025596896],"category_scores_gemma":[0.036337916,0.0013174679,0.0012473483,0.00089578074,0.0029655981,0.0035717983,0.004496584,0.0034221984,0.0009525887],"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.00013619354,0.000065550725,0.0015565864,0.000083146806,0.00007731324,0.00005415726,0.000065038876,0.9307723,0.0018775783,0.021951506,0.0010134707,0.04234715],"study_design_scores_gemma":[0.0000041283793,0.000020449797,0.000047592348,0.000006426474,0.0000024062258,0.000011047062,0.0000035850778,0.9934729,0.00053010555,0.0057678586,0.00012847838,0.0000051136544],"about_ca_topic_score_codex":0.0048967893,"about_ca_topic_score_gemma":0.004991476,"teacher_disagreement_score":0.010183141,"about_ca_system_score_codex":0.0023562168,"about_ca_system_score_gemma":0.0022432874,"threshold_uncertainty_score":0.053854227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014590909,0.0005436443,0.97524273,0.0037699935,0.00020552964,0.000029531659,0.0002052188,0.00088587037,0.004526575],"genre_scores_gemma":[0.35416955,0.0015040616,0.6281974,0.0012965543,0.00023959849,0.00022982532,0.0004608608,0.0013723739,0.012529743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.00010247087,0.000018153145,0.000071646595,0.00007199364,0.00002541385],"domain_scores_gemma":[0.9987457,0.0007534302,0.00009914345,0.00019081734,0.00013130628,0.0000795832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910361,0.0005624608,0.0006689089,0.0003531237,0.00054188713,0.0012627448,0.000997008,0.0015916289,0.0040640538],"category_scores_gemma":[0.008885714,0.0006031236,0.0006086041,0.00035321424,0.0015723222,0.0032989052,0.0014390361,0.0032337152,0.0012682774],"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.000048978924,0.0000360489,0.0013057946,0.00018100122,0.000062253246,0.00010590129,0.00011798142,0.7791281,0.0033058773,0.14436044,0.009837835,0.061509788],"study_design_scores_gemma":[0.0000086936525,0.000009077505,0.00009839486,0.000022377935,0.0000053250683,0.000024637524,0.000013125046,0.93809754,0.0008438751,0.058202233,0.0026636252,0.00001110102],"about_ca_topic_score_codex":0.0056495112,"about_ca_topic_score_gemma":0.0058218385,"teacher_disagreement_score":0.0056495112,"about_ca_system_score_codex":0.000771934,"about_ca_system_score_gemma":0.0011731493,"threshold_uncertainty_score":0.013595641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053258274,0.00024749237,0.9413869,0.0005680874,0.0001664386,0.000086106345,0.00009003925,0.0009989326,0.0031978192],"genre_scores_gemma":[0.8627351,0.00010148163,0.13114339,0.00017176819,0.00012323177,0.00015254244,0.0001806151,0.00011741511,0.0052744946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998995,0.00029603727,0.00005154443,0.00031739028,0.0001831198,0.00015685041],"domain_scores_gemma":[0.9980446,0.0009041306,0.00013094359,0.00046232183,0.0002944599,0.00016350695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017397859,0.00097034016,0.0019263048,0.00040476423,0.0011651492,0.0016977392,0.0028611857,0.0015895019,0.003465676],"category_scores_gemma":[0.0044817803,0.0006442432,0.00063951226,0.0007141686,0.0011248137,0.0023208319,0.0025338575,0.0016271693,0.00068046583],"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.0009778227,0.00023372484,0.0007591275,0.00007135932,0.000094864656,0.00019165015,0.00008053209,0.91729313,0.004540986,0.012071257,0.0037036298,0.059981976],"study_design_scores_gemma":[0.000017076918,0.000013759036,0.000026326872,6.3387125e-7,0.0000032115818,0.00000457195,0.0000040782566,0.9978543,0.0002363517,0.0017624093,0.000075619944,0.0000016765712],"about_ca_topic_score_codex":0.005899743,"about_ca_topic_score_gemma":0.008223783,"teacher_disagreement_score":0.005899743,"about_ca_system_score_codex":0.0011454074,"about_ca_system_score_gemma":0.0019844405,"threshold_uncertainty_score":0.01173085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057571437,0.00072768884,0.9882776,0.0006697209,0.000063644264,0.000023924937,0.0000576973,0.000083218765,0.004339332],"genre_scores_gemma":[0.56419915,0.0029306319,0.4108572,0.0012195943,0.00044051916,0.00041203565,0.00042724723,0.0007761526,0.018737497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985391,0.0007050947,0.00005147062,0.00024382604,0.00035049822,0.000110142326],"domain_scores_gemma":[0.99642783,0.002438708,0.0002736764,0.00031139655,0.00033636877,0.00021199687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059743803,0.000938028,0.0010490628,0.0012680304,0.0010035363,0.0018102445,0.0020245537,0.0016532541,0.0047578295],"category_scores_gemma":[0.017117266,0.00076273206,0.0011807234,0.0009968019,0.0031435948,0.004262017,0.0031415515,0.0036892688,0.00080135785],"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.000024808089,0.000022187049,0.0005111248,0.000067943736,0.000028025215,0.00005658313,0.00010253016,0.10016103,0.00051524857,0.8794478,0.0016889896,0.017373698],"study_design_scores_gemma":[0.0000057157163,0.000018722356,0.00013352431,0.00002751659,0.0000071002028,0.000032711836,0.000018376453,0.54388016,0.00029533778,0.45321596,0.0023524363,0.000012391372],"about_ca_topic_score_codex":0.0031804405,"about_ca_topic_score_gemma":0.0033225731,"teacher_disagreement_score":0.0059743803,"about_ca_system_score_codex":0.0019963023,"about_ca_system_score_gemma":0.0017788071,"threshold_uncertainty_score":0.031595945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04488745,0.0014733047,0.93200004,0.0002914493,0.00024323327,0.00015165898,0.0007058232,0.013360204,0.0068868618],"genre_scores_gemma":[0.3644328,0.0010970685,0.61010575,0.0004702445,0.00013184013,0.000331165,0.004492506,0.0010896226,0.017849023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970466,0.000044594915,0.000017999477,0.000061949584,0.000117255535,0.000053522523],"domain_scores_gemma":[0.99972206,0.00007600523,0.00003897462,0.000050483923,0.000088096676,0.000024390927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057496125,0.001316018,0.0007031816,0.00067675614,0.0002457436,0.00057825324,0.0019401624,0.0007159536,0.004123387],"category_scores_gemma":[0.0011988214,0.0003954645,0.0005562519,0.00047795134,0.00039144442,0.0014970995,0.00095570873,0.0009355057,0.0018137599],"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.0005216149,0.00032026067,0.0014988879,0.00047672985,0.0002364689,0.00039096613,0.00007177384,0.35283047,0.042071763,0.022315918,0.027882624,0.55138254],"study_design_scores_gemma":[0.000041635794,0.0001722505,0.00031253955,0.000027059126,0.00003568887,0.00011556843,0.000015308337,0.9720366,0.0141222775,0.0043535223,0.008744929,0.000022633945],"about_ca_topic_score_codex":0.004459848,"about_ca_topic_score_gemma":0.010435411,"teacher_disagreement_score":0.004459848,"about_ca_system_score_codex":0.000507865,"about_ca_system_score_gemma":0.0010879962,"threshold_uncertainty_score":0.013794124},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03289085,0.0036178252,0.9443096,0.0066204607,0.00068314635,0.00025195323,0.00053752173,0.0031788624,0.00790977],"genre_scores_gemma":[0.25358117,0.0029814744,0.72023654,0.0015847181,0.000650823,0.00029652403,0.00089326815,0.0008948373,0.018880613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665594,0.0012533912,0.0001476289,0.00033729564,0.0014553522,0.00015033159],"domain_scores_gemma":[0.98203194,0.013194162,0.00066203467,0.0021154564,0.001691092,0.00030539057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035969317,0.0013258765,0.0018644,0.0015194467,0.0010751095,0.0027880417,0.003140953,0.0032304358,0.017880514],"category_scores_gemma":[0.016860787,0.001360748,0.001338029,0.0022925232,0.0013066648,0.0038406716,0.0033454865,0.0029198201,0.005843417],"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.00083734305,0.00030428125,0.0021180266,0.00087665097,0.00022272459,0.0003655256,0.00027335383,0.053781003,0.0293895,0.018174827,0.026873529,0.86678326],"study_design_scores_gemma":[0.00017618037,0.0005400111,0.0034424048,0.00019494157,0.00021022839,0.002740919,0.00068183517,0.8579447,0.023859477,0.07141418,0.03869153,0.00010350287],"about_ca_topic_score_codex":0.0057850606,"about_ca_topic_score_gemma":0.014188477,"teacher_disagreement_score":0.017880514,"about_ca_system_score_codex":0.0012313501,"about_ca_system_score_gemma":0.0017167145,"threshold_uncertainty_score":0.0598163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007920052,0.00007753014,0.99064845,0.00018447233,0.000022009881,0.00003686429,0.00001949047,0.00031080423,0.0007802336],"genre_scores_gemma":[0.66103405,0.0001567147,0.33478862,0.00040053588,0.00010437318,0.00032669125,0.00017042624,0.00031495286,0.0027036432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981766,0.000674391,0.000086366344,0.00038952447,0.000513034,0.000160088],"domain_scores_gemma":[0.9912424,0.0061943075,0.0006494965,0.0009898276,0.00068596186,0.00023798084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004051093,0.0009791417,0.0016404962,0.00037908973,0.00048391524,0.001129911,0.0015123218,0.0012925011,0.0023949633],"category_scores_gemma":[0.018810036,0.00067611085,0.00060487824,0.00039774072,0.001954983,0.0021390193,0.0018588073,0.0027767362,0.0005918536],"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.00021742308,0.00015241123,0.0009786143,0.00008564788,0.000049367227,0.00006185281,0.0000725378,0.904862,0.0044059865,0.033182137,0.0016561637,0.054275885],"study_design_scores_gemma":[0.000011450589,0.000030165607,0.00008144597,0.0000046523214,0.0000039337797,0.000008192198,0.000003467366,0.9912151,0.0006456783,0.007745363,0.00024636058,0.0000041800336],"about_ca_topic_score_codex":0.0026825594,"about_ca_topic_score_gemma":0.0023158102,"teacher_disagreement_score":0.004051093,"about_ca_system_score_codex":0.0011958259,"about_ca_system_score_gemma":0.001957601,"threshold_uncertainty_score":0.021424472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14643668,0.002662103,0.82737607,0.0051474874,0.00020604297,0.00014615359,0.00025828375,0.0010087478,0.016758373],"genre_scores_gemma":[0.94944227,0.0005534137,0.04729109,0.00053536944,0.000101491794,0.00011834424,0.0001387403,0.00025935483,0.0015598322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935628,0.0034099692,0.00025414955,0.0011696455,0.001076774,0.00052659755],"domain_scores_gemma":[0.95784277,0.032199524,0.0027672634,0.0047889734,0.0014705686,0.00093087606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014995936,0.0011911659,0.0023736942,0.0012076659,0.0012137931,0.0047244774,0.0017264689,0.0026655584,0.0031329335],"category_scores_gemma":[0.1018435,0.00076927675,0.00090156874,0.0009444395,0.0032719232,0.009420582,0.0033343674,0.0050250487,0.0005655211],"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.0004572823,0.00023868734,0.0055368724,0.00023801585,0.00018974794,0.00015159958,0.00033857665,0.5708395,0.0022095453,0.3543149,0.0027266438,0.062758535],"study_design_scores_gemma":[0.000027652404,0.00017840891,0.0011922991,0.000048789407,0.00002230438,0.000039265724,0.00005705539,0.78576154,0.00084468565,0.2108904,0.0009128501,0.000024744939],"about_ca_topic_score_codex":0.0029585923,"about_ca_topic_score_gemma":0.00213221,"teacher_disagreement_score":0.014995936,"about_ca_system_score_codex":0.002425235,"about_ca_system_score_gemma":0.002137601,"threshold_uncertainty_score":0.07930702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009475557,0.00047856875,0.91813296,0.0006091434,0.00013101645,0.00031829,0.004808764,0.063027285,0.0030183268],"genre_scores_gemma":[0.20330645,0.00036178302,0.77036446,0.0005279301,0.00010337942,0.00040320132,0.01658212,0.0032865193,0.0050641503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982174,0.0005863425,0.00011016009,0.0004786583,0.0004403316,0.00016704164],"domain_scores_gemma":[0.9959777,0.0026364403,0.0001557459,0.00081732287,0.00026733012,0.00014542112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017812711,0.0019679994,0.0013323729,0.0025516404,0.0011243814,0.0032984554,0.0033121142,0.002236361,0.014659976],"category_scores_gemma":[0.009394085,0.0010130556,0.002844297,0.0015103854,0.0010967541,0.0059547145,0.0050665177,0.0030607414,0.004039806],"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.0016125895,0.00093728624,0.0041897255,0.0017492394,0.0006011173,0.0008021699,0.0014748056,0.12433371,0.015719617,0.091834106,0.10571478,0.6510309],"study_design_scores_gemma":[0.00014594938,0.00007671155,0.0003496112,0.000083844374,0.00010205538,0.00007383711,0.00018691705,0.8627472,0.0042833523,0.11988882,0.012022374,0.000039410486],"about_ca_topic_score_codex":0.010565244,"about_ca_topic_score_gemma":0.023124263,"teacher_disagreement_score":0.014659976,"about_ca_system_score_codex":0.0014021238,"about_ca_system_score_gemma":0.002015936,"threshold_uncertainty_score":0.049042463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033120703,0.0003729427,0.96246797,0.00046519516,0.000058366266,0.0000659592,0.000045242825,0.0007020306,0.0027015365],"genre_scores_gemma":[0.76641196,0.00025454623,0.22866881,0.00037754953,0.00008734703,0.00027532564,0.00016406206,0.00027208816,0.0034883462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677867,0.0014916449,0.00013684794,0.00057108357,0.0006219655,0.0003997748],"domain_scores_gemma":[0.9886207,0.008223229,0.0006222662,0.0013580166,0.00083484733,0.00034085862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048288167,0.0012314111,0.0019850621,0.0005385713,0.00067277113,0.0016482953,0.0025293722,0.0017840331,0.00343134],"category_scores_gemma":[0.028140055,0.0007238632,0.000926053,0.00060029235,0.0022473156,0.0041250223,0.0024883589,0.0035226,0.00063207065],"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.00045237222,0.00014384362,0.0010702019,0.0000996635,0.00007135309,0.000098845485,0.00012301483,0.91836494,0.0012256008,0.045947514,0.0012093068,0.03119329],"study_design_scores_gemma":[0.000015193513,0.0000481677,0.000039206476,0.0000060042908,0.0000041801413,0.000011924263,0.000005144678,0.98976433,0.0003832482,0.009585139,0.0001337072,0.0000038323556],"about_ca_topic_score_codex":0.0036095455,"about_ca_topic_score_gemma":0.0021161153,"teacher_disagreement_score":0.0048288167,"about_ca_system_score_codex":0.0018017867,"about_ca_system_score_gemma":0.0025012053,"threshold_uncertainty_score":0.02553749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004854197,0.00028644872,0.99028987,0.00019025414,0.00011739967,0.00007226338,0.000079867146,0.0011517185,0.0029579422],"genre_scores_gemma":[0.117829174,0.00022144135,0.87684274,0.00020554234,0.00011362714,0.0004281544,0.0003982521,0.00043066475,0.0035304506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991334,0.0002254867,0.0000443729,0.00017078237,0.00033942112,0.00008643628],"domain_scores_gemma":[0.9987288,0.000654108,0.00007710874,0.00018166416,0.0002952519,0.00006301065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014777129,0.0014191092,0.0018684026,0.0010390566,0.0009952697,0.0012095141,0.0022557501,0.0019726867,0.005402384],"category_scores_gemma":[0.0037022387,0.0009018419,0.0011095507,0.0016809136,0.0007311887,0.0013499755,0.0022128841,0.0016540728,0.0014574246],"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.0001375295,0.00006608625,0.0002013796,0.00008537585,0.00006445368,0.000047333422,0.000034759374,0.85811186,0.0017249102,0.01011324,0.0060672183,0.12334589],"study_design_scores_gemma":[0.000024497398,0.000013290645,0.00003198307,0.0000030260849,0.000005213345,0.000007965862,0.0000033385777,0.99655724,0.00018428887,0.0025448669,0.0006203803,0.0000038200365],"about_ca_topic_score_codex":0.007041632,"about_ca_topic_score_gemma":0.009271416,"teacher_disagreement_score":0.007041632,"about_ca_system_score_codex":0.0012037473,"about_ca_system_score_gemma":0.0022830737,"threshold_uncertainty_score":0.018072784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021632982,0.0024845202,0.95022583,0.0033627292,0.0006109559,0.00012442864,0.00024527533,0.00037078193,0.02094256],"genre_scores_gemma":[0.6235541,0.0044893855,0.3431971,0.002223785,0.0023369954,0.00063878414,0.0010127939,0.0013241724,0.021222856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99235255,0.0048894887,0.00031768664,0.00071646797,0.0011689579,0.0005549622],"domain_scores_gemma":[0.91137797,0.081327215,0.0012828658,0.0025163456,0.0027173876,0.00077821873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017014753,0.002273708,0.0034970834,0.0019623907,0.0015345773,0.0029596218,0.0031051787,0.0032790503,0.007901675],"category_scores_gemma":[0.07217482,0.0020113124,0.0014745179,0.0025002358,0.005403196,0.0067388806,0.0036104373,0.007912062,0.0012053474],"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.0009214405,0.00022578974,0.0008515262,0.00026783807,0.0001322582,0.000058774862,0.00016646247,0.68970114,0.0008145398,0.25612858,0.010118428,0.040613256],"study_design_scores_gemma":[0.00006481317,0.00005451355,0.00018005274,0.000039052633,0.00001671136,0.000010966227,0.000014224089,0.8890676,0.00026117964,0.10950562,0.0007733624,0.000011954374],"about_ca_topic_score_codex":0.008510724,"about_ca_topic_score_gemma":0.004582785,"teacher_disagreement_score":0.017014753,"about_ca_system_score_codex":0.003204926,"about_ca_system_score_gemma":0.004095757,"threshold_uncertainty_score":0.0899837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004980204,0.00028222875,0.9847217,0.00012980733,0.0003112313,0.00004418494,0.000023753388,0.0006047267,0.00890221],"genre_scores_gemma":[0.3429375,0.00060493354,0.61099684,0.00022227704,0.00024887107,0.00031105115,0.00025339486,0.00030566505,0.044119395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.00011001108,0.000013953511,0.0000705025,0.0001965721,0.000036292684],"domain_scores_gemma":[0.99960774,0.00009925287,0.000020936133,0.00006311063,0.00018920688,0.0000196574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074937183,0.00052780507,0.00092035223,0.00041415048,0.0003909777,0.00097204366,0.00094327045,0.0008220115,0.006689675],"category_scores_gemma":[0.0017615183,0.0003555725,0.00045062733,0.0004180438,0.00043389614,0.0005372095,0.00093191204,0.0013057018,0.0020145099],"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.00030929793,0.00012710279,0.00073644455,0.00020349154,0.000079602025,0.00008799284,0.00007681235,0.4246421,0.0073598856,0.053236526,0.011583212,0.5015576],"study_design_scores_gemma":[0.000029856948,0.000056753226,0.00015609483,0.000010314655,0.000008784124,0.000035127083,0.000004450906,0.98540974,0.002233499,0.0047246614,0.007323641,0.0000070143965],"about_ca_topic_score_codex":0.001319095,"about_ca_topic_score_gemma":0.0011019643,"teacher_disagreement_score":0.006689675,"about_ca_system_score_codex":0.0003296033,"about_ca_system_score_gemma":0.001248406,"threshold_uncertainty_score":0.02237916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15930018,0.002345047,0.7920054,0.0007435644,0.00065400597,0.0005470927,0.0061262627,0.026766766,0.011511625],"genre_scores_gemma":[0.5085325,0.001013223,0.46206555,0.00047923857,0.00011535548,0.00044787422,0.012993477,0.00085058005,0.013502162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.00004658385,0.000011117998,0.00015290463,0.00006355112,0.000029191378],"domain_scores_gemma":[0.9994368,0.00021026719,0.00004849627,0.00019393144,0.000061768646,0.000048835347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055300235,0.0017720552,0.0006658797,0.0009398275,0.00025098975,0.0010526151,0.002439371,0.0014522708,0.008038901],"category_scores_gemma":[0.0022952831,0.0005686694,0.0012410057,0.00080126995,0.0006054833,0.0030255602,0.0012428559,0.0017479481,0.0021073923],"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.00046124303,0.00034444666,0.003713794,0.00075485854,0.00027494802,0.00049946824,0.00023351901,0.19382466,0.023600696,0.011914854,0.034374963,0.7300025],"study_design_scores_gemma":[0.000037039874,0.0001517585,0.0005799288,0.0000388751,0.00003275145,0.00022708377,0.000057158013,0.9736269,0.008981283,0.008185139,0.008063701,0.000018396582],"about_ca_topic_score_codex":0.00260085,"about_ca_topic_score_gemma":0.0065635997,"teacher_disagreement_score":0.008038901,"about_ca_system_score_codex":0.00076286984,"about_ca_system_score_gemma":0.00049735856,"threshold_uncertainty_score":0.02689284},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00203276,0.000110071305,0.99495137,0.0002073676,0.00004496626,0.000077403565,0.00004327358,0.0009606149,0.0015722048],"genre_scores_gemma":[0.26727504,0.00025837685,0.7238627,0.0007274397,0.00014811278,0.0006653057,0.0003626652,0.0007105201,0.005989853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972796,0.001078184,0.0001622859,0.0005566647,0.0006657904,0.00025750496],"domain_scores_gemma":[0.9943389,0.00382862,0.00029162207,0.00069430034,0.00056693464,0.00027960952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00519968,0.0017845333,0.0016479384,0.00062826736,0.00061173254,0.0015887809,0.0040137726,0.00255204,0.011852087],"category_scores_gemma":[0.01789861,0.0006401663,0.0008578414,0.0007644854,0.0021209195,0.0024344574,0.004369552,0.004751676,0.0029205687],"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.00043901827,0.0002848199,0.0009984175,0.0003378948,0.000059271933,0.00015362684,0.00023660324,0.5414227,0.0029206432,0.11230149,0.011718981,0.32912657],"study_design_scores_gemma":[0.000030575276,0.00005913452,0.000043630844,0.000015923644,0.0000038879552,0.000028108923,0.000012269157,0.9673505,0.00069554005,0.0302862,0.0014665058,0.000007798892],"about_ca_topic_score_codex":0.0027130109,"about_ca_topic_score_gemma":0.0027706048,"teacher_disagreement_score":0.011852087,"about_ca_system_score_codex":0.0013413841,"about_ca_system_score_gemma":0.002941414,"threshold_uncertainty_score":0.03964919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09592212,0.002209033,0.81253123,0.0012613811,0.00059847836,0.00023390708,0.00020856889,0.00038287786,0.086652525],"genre_scores_gemma":[0.74949706,0.00038898538,0.22567476,0.000612023,0.0001678775,0.00039400248,0.0001555432,0.0001931059,0.022916574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967873,0.00012233036,0.000014394623,0.0000354197,0.00010949447,0.00003957923],"domain_scores_gemma":[0.99911267,0.00057440775,0.00008444109,0.000067201254,0.000106206375,0.00005498838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087259867,0.00076770963,0.0010411151,0.0012460354,0.00090905075,0.0012397334,0.0013615465,0.002305633,0.011999263],"category_scores_gemma":[0.004004907,0.0005293152,0.00056813576,0.00080299744,0.0007100804,0.0010932882,0.0024841442,0.00092807267,0.0008286234],"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.0002702011,0.000117688716,0.0011379991,0.00024094393,0.00010106523,0.00014446046,0.00010859459,0.8310927,0.0021964293,0.07592417,0.0034129934,0.085252754],"study_design_scores_gemma":[0.000020532754,0.000054085514,0.00011737079,0.000022612843,0.000009267972,0.000040802883,0.000017209442,0.9919951,0.00028796698,0.0060500223,0.0013793075,0.0000057654415],"about_ca_topic_score_codex":0.0017992998,"about_ca_topic_score_gemma":0.0029136534,"teacher_disagreement_score":0.011999263,"about_ca_system_score_codex":0.0008360955,"about_ca_system_score_gemma":0.00074346445,"threshold_uncertainty_score":0.040141463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002495824,0.000059111986,0.99659985,0.00006495563,0.000015992393,0.000011558327,0.000039303202,0.00020307495,0.0005103692],"genre_scores_gemma":[0.3347436,0.0005059542,0.65687406,0.00023442433,0.00013088538,0.00018216227,0.0007868154,0.00057201245,0.0059701065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993395,0.00016540366,0.000023722767,0.00012123067,0.00027186394,0.00007821688],"domain_scores_gemma":[0.99924767,0.0003151463,0.000062618135,0.00016848018,0.00013907382,0.00006694315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011760762,0.00084783434,0.0012462941,0.0006943975,0.00039219618,0.0011165858,0.0021530697,0.0012263042,0.0024773604],"category_scores_gemma":[0.003457392,0.00056774844,0.001067618,0.0008626148,0.0009388143,0.0018480741,0.002031305,0.002194333,0.0010790182],"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.0000788926,0.00006102915,0.00070537644,0.00008304477,0.00008273899,0.000098284414,0.00007570078,0.74729294,0.006904583,0.14247583,0.0040833484,0.098058365],"study_design_scores_gemma":[0.0000022064928,0.0000035378184,0.000018727753,0.0000012416565,0.0000016982702,0.000007245493,0.0000018959962,0.9912134,0.00024725765,0.008158499,0.00034206785,0.0000023219334],"about_ca_topic_score_codex":0.005323909,"about_ca_topic_score_gemma":0.0053974977,"teacher_disagreement_score":0.005323909,"about_ca_system_score_codex":0.0009150099,"about_ca_system_score_gemma":0.0013341715,"threshold_uncertainty_score":0.0105858445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023812945,0.0001942407,0.99319696,0.000074772215,0.0002143119,0.000043014177,0.000029850255,0.00028227942,0.0035832638],"genre_scores_gemma":[0.056242563,0.00035414647,0.9300868,0.00014114905,0.00020682353,0.00024828647,0.00014251137,0.00022586808,0.012351835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961925,0.00006529394,0.00002030245,0.000055380853,0.00020785426,0.000031948646],"domain_scores_gemma":[0.9995172,0.0001860789,0.00003907325,0.00005009445,0.00017212408,0.0000353194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056643225,0.00088412646,0.0008825744,0.0009976602,0.00066284963,0.0007129319,0.0015277199,0.0012756215,0.00614977],"category_scores_gemma":[0.0013406115,0.0005387946,0.00083615043,0.0010817441,0.00047390492,0.001057002,0.0012435368,0.0014122981,0.0014184228],"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.00017874756,0.00028520596,0.0005226336,0.0004609283,0.00013425208,0.00019500786,0.00009700692,0.39713016,0.022144277,0.052923467,0.012096257,0.513832],"study_design_scores_gemma":[0.000019974057,0.000033391767,0.00006811355,0.000011536937,0.0000099974395,0.000059850812,0.0000068715917,0.98800683,0.0014635244,0.00592507,0.0043838057,0.000010955762],"about_ca_topic_score_codex":0.0025540483,"about_ca_topic_score_gemma":0.004217612,"teacher_disagreement_score":0.00614977,"about_ca_system_score_codex":0.00040408372,"about_ca_system_score_gemma":0.0008472472,"threshold_uncertainty_score":0.02057302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008740771,0.00017174827,0.988818,0.00030528658,0.000035963407,0.000027867409,0.00010104951,0.00052893267,0.0012703611],"genre_scores_gemma":[0.6921069,0.0003304487,0.30033684,0.0010592031,0.0002325529,0.0002462264,0.00095359015,0.0005196651,0.004214547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944728,0.0024065895,0.00020746127,0.0016799973,0.0007757035,0.00045749883],"domain_scores_gemma":[0.98692524,0.0064035133,0.0010263899,0.004295898,0.0008364457,0.0005124689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008183206,0.0011951113,0.0017748305,0.001330662,0.0014710256,0.0026701235,0.0034817131,0.0017850761,0.0038591528],"category_scores_gemma":[0.029245377,0.00069538056,0.001233681,0.001192651,0.0036860644,0.006377815,0.0053169746,0.004552646,0.0008371335],"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.00028283292,0.00018877082,0.0040886896,0.000116245326,0.000118359574,0.00011820718,0.00027688697,0.6437113,0.002026298,0.24129511,0.0048641264,0.10291314],"study_design_scores_gemma":[0.000013323907,0.000027401373,0.00019006197,0.0000124401595,0.000008586947,0.000020625377,0.000019720683,0.7861734,0.00088942266,0.21167248,0.00096038514,0.000012142737],"about_ca_topic_score_codex":0.0026102865,"about_ca_topic_score_gemma":0.0032663064,"teacher_disagreement_score":0.008183206,"about_ca_system_score_codex":0.0020834913,"about_ca_system_score_gemma":0.0023645577,"threshold_uncertainty_score":0.043277502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02272899,0.00026891602,0.9731501,0.000558177,0.000062283725,0.00006825072,0.00015068214,0.00028206976,0.0027306085],"genre_scores_gemma":[0.86214375,0.00033527258,0.13092715,0.00030910017,0.000122015685,0.0003019297,0.00057363434,0.00030206286,0.0049850717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945374,0.0023759562,0.0003486157,0.0010877703,0.0010031781,0.0006471148],"domain_scores_gemma":[0.9683223,0.0256281,0.0017923743,0.0020235537,0.0013524211,0.00088132644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009162381,0.0015377743,0.0038302885,0.0013031357,0.0013103068,0.003171154,0.003436309,0.0028025857,0.005437557],"category_scores_gemma":[0.03977596,0.002094497,0.0017164652,0.0013628983,0.0033999083,0.005932827,0.007208692,0.0053727236,0.0005052653],"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.00026516078,0.000078105724,0.0006472963,0.00013892232,0.000079967715,0.00007451991,0.00008265808,0.8515866,0.00041504946,0.123972535,0.0011861777,0.02147306],"study_design_scores_gemma":[0.000016625598,0.000019634519,0.000048980357,0.000010414098,0.000006723104,0.0000070346473,0.000009628858,0.9287459,0.00013093841,0.0708485,0.00014970731,0.0000058139512],"about_ca_topic_score_codex":0.006122465,"about_ca_topic_score_gemma":0.004765924,"teacher_disagreement_score":0.009162381,"about_ca_system_score_codex":0.0033723032,"about_ca_system_score_gemma":0.0032095632,"threshold_uncertainty_score":0.048455894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065829586,0.00005223094,0.98814154,0.00019641587,0.0000468987,0.00008360773,0.000084391824,0.0027262676,0.0020856732],"genre_scores_gemma":[0.4981858,0.0001709485,0.4943732,0.00062603725,0.00006155716,0.0005845864,0.00043091874,0.0007823563,0.004784563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994055,0.00017247748,0.0000460401,0.00013527846,0.00017118914,0.00006958527],"domain_scores_gemma":[0.9986639,0.0005949424,0.00012185309,0.00034250665,0.00017442304,0.000102281636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013981794,0.0009527731,0.0005501271,0.00030686706,0.000319811,0.00095388206,0.0022512504,0.0010934033,0.0043117306],"category_scores_gemma":[0.0047989483,0.00039407192,0.000671536,0.00028292174,0.0013586442,0.0017182408,0.0018968742,0.0025999586,0.0011041389],"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.00021926186,0.00020339145,0.001058137,0.00020892324,0.000060591403,0.00021896849,0.00029093222,0.7392447,0.011395651,0.06233893,0.003573049,0.18118747],"study_design_scores_gemma":[0.000017734958,0.00004237684,0.000042516458,0.00000977856,0.0000056150707,0.000015132712,0.0000070846563,0.9717156,0.0023017258,0.02431438,0.001520864,0.0000072355797],"about_ca_topic_score_codex":0.0031192652,"about_ca_topic_score_gemma":0.005143838,"teacher_disagreement_score":0.0043117306,"about_ca_system_score_codex":0.0007491369,"about_ca_system_score_gemma":0.0016555152,"threshold_uncertainty_score":0.014424205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009140187,0.00064215023,0.98627603,0.00014944948,0.00007169339,0.00003821248,0.00006328506,0.00029454392,0.0033244381],"genre_scores_gemma":[0.3017598,0.001362786,0.6834914,0.00030396183,0.00023229896,0.00024815943,0.00046928742,0.0006490817,0.011483199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997895,0.0011187659,0.000112156,0.000334972,0.00040967917,0.0001294068],"domain_scores_gemma":[0.9920204,0.0058129574,0.0003207834,0.00093328604,0.00078179827,0.00013075076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053794472,0.0011236282,0.0012973542,0.0010669389,0.000519486,0.0012636689,0.0023474758,0.0013168663,0.0055011497],"category_scores_gemma":[0.019235544,0.00082372356,0.000921348,0.0013079765,0.0014618718,0.003474362,0.0029542095,0.003180988,0.0011602145],"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.00069611875,0.00012682893,0.0010231882,0.00044469142,0.00008941172,0.00016502426,0.00027400564,0.49349135,0.00834625,0.16888852,0.0043784305,0.32207623],"study_design_scores_gemma":[0.000009533668,0.000048818547,0.00012675255,0.000035804744,0.000011442028,0.00002918538,0.000017616896,0.96954614,0.0014538032,0.027406864,0.0013026452,0.000011408642],"about_ca_topic_score_codex":0.004450228,"about_ca_topic_score_gemma":0.0039232224,"teacher_disagreement_score":0.0055011497,"about_ca_system_score_codex":0.0010416463,"about_ca_system_score_gemma":0.001108179,"threshold_uncertainty_score":0.028449595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062873648,0.0002098629,0.9911078,0.000112745365,0.000061661354,0.000038274753,0.00012357869,0.001320925,0.00073764846],"genre_scores_gemma":[0.2282217,0.000786025,0.75882494,0.0002957147,0.00018496781,0.00019456117,0.0016915185,0.0012729005,0.008527622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940205,0.00013236956,0.000033314172,0.00019388326,0.00015293568,0.00008533195],"domain_scores_gemma":[0.99920744,0.00021018687,0.000071990384,0.00028537662,0.00015761303,0.00006752057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010474289,0.0015007141,0.0016211198,0.0024956283,0.0006682278,0.0021921364,0.0014936258,0.0018631003,0.0057328935],"category_scores_gemma":[0.0020140219,0.0010635615,0.002129987,0.002295651,0.0010489983,0.0024653256,0.0023445385,0.0015033873,0.0023448686],"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.00071432383,0.00015220743,0.0009346868,0.00018964158,0.00015412107,0.00019382876,0.000095110736,0.12376332,0.063695595,0.020594247,0.009302019,0.7802109],"study_design_scores_gemma":[0.000020752177,0.00006274998,0.00039970534,0.000017757455,0.000031295487,0.000093316106,0.000017166527,0.96997154,0.015871579,0.009796032,0.003696661,0.000021494105],"about_ca_topic_score_codex":0.003461367,"about_ca_topic_score_gemma":0.0027981754,"teacher_disagreement_score":0.0057328935,"about_ca_system_score_codex":0.0007168821,"about_ca_system_score_gemma":0.0013969649,"threshold_uncertainty_score":0.01917845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010043449,0.0006446638,0.98593706,0.0002004257,0.000109980814,0.000076479795,0.0002719244,0.0020028078,0.0007131768],"genre_scores_gemma":[0.58527684,0.0008136289,0.3954784,0.0008640138,0.00029691766,0.000564555,0.0046660663,0.00072832854,0.011311162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859744,0.00038683056,0.00008092017,0.00050695834,0.00027756754,0.00015018796],"domain_scores_gemma":[0.99756145,0.0009536828,0.000118011616,0.0008772309,0.00038791285,0.00010173935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016045979,0.0013890358,0.0025295815,0.0011312574,0.00067238003,0.0012330959,0.0033536255,0.0025789973,0.0046493956],"category_scores_gemma":[0.0066145402,0.00058437604,0.0011786703,0.0013903421,0.0010414881,0.0038339056,0.0027521506,0.0034276813,0.0026688525],"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.00050204823,0.00052626745,0.0009151775,0.00028882216,0.00015750893,0.00016548958,0.00016577674,0.15784769,0.017198863,0.014863846,0.016199343,0.7911691],"study_design_scores_gemma":[0.000013534318,0.00009158743,0.00021217443,0.00001773542,0.000018234696,0.000070677976,0.000028126065,0.97514516,0.0037466926,0.019292912,0.001342089,0.00002110267],"about_ca_topic_score_codex":0.0033522265,"about_ca_topic_score_gemma":0.003765006,"teacher_disagreement_score":0.0046493956,"about_ca_system_score_codex":0.00090911007,"about_ca_system_score_gemma":0.0010576834,"threshold_uncertainty_score":0.015553772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007155219,0.00027887855,0.9894929,0.0004938723,0.000060896265,0.000031242103,0.000034575492,0.00039260273,0.0020599437],"genre_scores_gemma":[0.6931135,0.00083305663,0.2953692,0.00076224556,0.00036074856,0.00017533638,0.00023093756,0.00023795334,0.008916943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992132,0.00027206325,0.000029210893,0.00019310857,0.00022639596,0.000065912194],"domain_scores_gemma":[0.997945,0.0013249469,0.00020621595,0.0003211724,0.00013237903,0.00007034595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017215271,0.0010264086,0.0008330175,0.00031937376,0.0003409027,0.00092472695,0.0010478752,0.0017098197,0.0029164846],"category_scores_gemma":[0.004771104,0.00043065456,0.0006079835,0.00028291636,0.0013708345,0.0013591839,0.0017785844,0.0028790995,0.00060354685],"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.00011782586,0.00007366437,0.00083737465,0.00016208844,0.00007327753,0.00020807964,0.0001368605,0.8279427,0.012123488,0.072179355,0.003990784,0.082154535],"study_design_scores_gemma":[0.00000665161,0.00003374798,0.000075635915,0.0000073762603,0.00000527239,0.0000537891,0.000005634853,0.97967666,0.0024670332,0.016371937,0.0012905458,0.000005753914],"about_ca_topic_score_codex":0.0008344969,"about_ca_topic_score_gemma":0.0006967391,"teacher_disagreement_score":0.0029164846,"about_ca_system_score_codex":0.00066087215,"about_ca_system_score_gemma":0.00044796278,"threshold_uncertainty_score":0.009756625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015905457,0.00040065328,0.97673756,0.0013288601,0.00007715186,0.00013903728,0.0003860239,0.0017865837,0.0032386691],"genre_scores_gemma":[0.6286121,0.0006265665,0.35232916,0.0008277804,0.00031737107,0.0007940082,0.0019945502,0.000499165,0.013999326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983296,0.0007720788,0.000080581456,0.00048410238,0.00020645541,0.00012721618],"domain_scores_gemma":[0.99474156,0.0038111121,0.0002432752,0.0005298797,0.0004946989,0.00017937424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030777904,0.0009631861,0.001082689,0.0016041175,0.00068072916,0.0022332177,0.0029320645,0.0027597058,0.0055998606],"category_scores_gemma":[0.010638429,0.0009407821,0.0021655457,0.0012438992,0.0015378351,0.004706353,0.0020392733,0.0030700427,0.0023631689],"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.00056483573,0.00044038708,0.007075779,0.0005062467,0.00034253596,0.00063319446,0.0029384575,0.4236778,0.014166462,0.29665768,0.013262873,0.2397337],"study_design_scores_gemma":[0.00002591389,0.000046518,0.00027039283,0.000014250418,0.000040807445,0.000120911805,0.00003526575,0.92421275,0.001150052,0.07180949,0.0022525536,0.000021014166],"about_ca_topic_score_codex":0.004984634,"about_ca_topic_score_gemma":0.0053216317,"teacher_disagreement_score":0.0055998606,"about_ca_system_score_codex":0.0013447918,"about_ca_system_score_gemma":0.0018656009,"threshold_uncertainty_score":0.018733382},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016902657,0.000500291,0.9800181,0.0004054369,0.000065737084,0.000033548844,0.00003128483,0.00018423327,0.0018586735],"genre_scores_gemma":[0.8632681,0.00041321432,0.13049988,0.00024754243,0.00008139807,0.00024085023,0.00011407216,0.00012173064,0.0050132363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990627,0.00054911827,0.000041002848,0.00012757917,0.00013305082,0.000086599466],"domain_scores_gemma":[0.9951717,0.0039010672,0.00017411455,0.0002197694,0.00038914467,0.00014414532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028760538,0.00059396366,0.001413371,0.00047037244,0.00039658524,0.0010638823,0.0016991696,0.0016170694,0.003295768],"category_scores_gemma":[0.009238759,0.00067117193,0.0005677511,0.00061796437,0.0015631744,0.0020809518,0.0021377993,0.0023055968,0.0003331587],"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.00013284014,0.00008668648,0.0005919084,0.00010546299,0.000054642245,0.00004582067,0.0000826308,0.8887298,0.0008470824,0.05299797,0.0012833009,0.05504181],"study_design_scores_gemma":[0.000009212011,0.000018489422,0.000022406559,0.000004238905,0.0000028872382,0.0000042262996,0.000002590736,0.9889577,0.00011507874,0.0107265385,0.00013414233,0.0000025051818],"about_ca_topic_score_codex":0.0036428268,"about_ca_topic_score_gemma":0.002481311,"teacher_disagreement_score":0.0036428268,"about_ca_system_score_codex":0.0011068643,"about_ca_system_score_gemma":0.0012429482,"threshold_uncertainty_score":0.015210211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024377592,0.0005353938,0.9680858,0.00048432357,0.00008724781,0.000101777594,0.0009324036,0.0023683314,0.003027112],"genre_scores_gemma":[0.48250064,0.0011319199,0.4983452,0.0010154181,0.00016365666,0.000482255,0.004434337,0.00042926986,0.011497208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948764,0.00018377935,0.00002232967,0.00015835551,0.000098517114,0.00004937145],"domain_scores_gemma":[0.99923134,0.00029889398,0.000086151675,0.00018782796,0.00014179066,0.00005406923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000804966,0.00076649396,0.00055645313,0.0012437103,0.000420382,0.0010012076,0.001689064,0.0011873664,0.002578351],"category_scores_gemma":[0.0031327012,0.00043267294,0.0006932704,0.0016772122,0.0007770053,0.0028108226,0.0014043709,0.0015123262,0.0009551197],"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.00025790336,0.00016197814,0.003118657,0.00033866585,0.00020048245,0.0002058665,0.00020827442,0.46081936,0.013485877,0.0711098,0.020046903,0.43004626],"study_design_scores_gemma":[0.000009969901,0.00003314877,0.00044882682,0.000018792502,0.000017083456,0.000049081853,0.000023776029,0.9513888,0.002729002,0.04141374,0.0038530377,0.000014830349],"about_ca_topic_score_codex":0.004714233,"about_ca_topic_score_gemma":0.009026483,"teacher_disagreement_score":0.004714233,"about_ca_system_score_codex":0.0010802848,"about_ca_system_score_gemma":0.0007504402,"threshold_uncertainty_score":0.009373546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006254701,0.00027406306,0.9908015,0.00006347275,0.00008608978,0.000027278602,0.000049840957,0.0016015875,0.00084142963],"genre_scores_gemma":[0.09890463,0.0003740024,0.8957016,0.00010537649,0.00009518393,0.00006872429,0.00029359764,0.00089115876,0.0035657862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848455,0.00030659485,0.00007992454,0.00038191024,0.00057364575,0.00017355237],"domain_scores_gemma":[0.9978224,0.000750581,0.00016287174,0.0005567324,0.0005677371,0.00013971007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023271414,0.0018194597,0.0019323518,0.0024526978,0.0010372625,0.002694114,0.0022661348,0.0020489634,0.008019752],"category_scores_gemma":[0.005634397,0.000871614,0.001379716,0.0020413238,0.0010451279,0.003842697,0.002846846,0.0035216997,0.0022144841],"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.00054700725,0.0004229505,0.001055814,0.00027087153,0.0001367389,0.00018016878,0.00019700508,0.16711229,0.056510366,0.048037726,0.008020303,0.7175087],"study_design_scores_gemma":[0.000023244856,0.000053632888,0.00016456019,0.000015962327,0.000027908836,0.00007684513,0.000022462986,0.9760634,0.012455528,0.0075399904,0.0035349152,0.000021525797],"about_ca_topic_score_codex":0.004717572,"about_ca_topic_score_gemma":0.0047992896,"teacher_disagreement_score":0.008019752,"about_ca_system_score_codex":0.0007367072,"about_ca_system_score_gemma":0.0016272964,"threshold_uncertainty_score":0.026828706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393918,0.0005799817,0.24048275,0.0029327436,0.00007232259,0.00003788245,0.0004555262,0.00019846034,0.015848441],"genre_scores_gemma":[0.9938891,0.00010681833,0.0045496714,0.000040689578,0.000008217353,0.0000064167198,0.000060271832,0.00001576424,0.0013230392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997539,0.00007625189,0.0000075461585,0.00005392063,0.000036866742,0.000071652044],"domain_scores_gemma":[0.9988306,0.0005765902,0.00019410404,0.00008752443,0.00019771016,0.000113589434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010435838,0.0004678966,0.0005264078,0.00044458502,0.00068363786,0.0014899068,0.0009760127,0.000553497,0.0014312875],"category_scores_gemma":[0.004454102,0.00029503307,0.00041265984,0.00040317146,0.0012798023,0.0010499476,0.0007327229,0.00095699617,0.00008362489],"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.00002498459,0.000013367193,0.003987956,0.000008561842,0.000022987577,0.000016343032,0.000051332172,0.98013157,0.00023029212,0.010991281,0.00031471768,0.0042065447],"study_design_scores_gemma":[0.0000044671197,0.0000073274346,0.0009778657,0.000004116387,0.0000101784435,0.0000039634424,0.000027967093,0.9910443,0.000063612424,0.0075758277,0.00027557657,0.000004701976],"about_ca_topic_score_codex":0.5579245,"about_ca_topic_score_gemma":0.5758097,"teacher_disagreement_score":0.4420755,"about_ca_system_score_codex":0.0047093667,"about_ca_system_score_gemma":0.0059882435,"threshold_uncertainty_score":0.8893579},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34704265,0.000855629,0.6409188,0.0012019329,0.00040165905,0.000038442486,0.00040279524,0.00042072838,0.008717296],"genre_scores_gemma":[0.9815808,0.00029970353,0.013909578,0.000047382055,0.000042494798,0.000017406916,0.00015006593,0.00003288529,0.00391968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998166,0.00006181617,0.0000127561825,0.000041592306,0.00003510549,0.000032083204],"domain_scores_gemma":[0.9981345,0.0013513988,0.00014974286,0.00009056709,0.00017327291,0.0001005277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011505833,0.000453747,0.0008204084,0.0007023528,0.00043422965,0.0013851059,0.00064523093,0.001222468,0.0017148154],"category_scores_gemma":[0.00615941,0.0004959393,0.0005936847,0.0005903221,0.00062372466,0.0023468651,0.0006671132,0.0013306589,0.00020008175],"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.000038166938,0.000015735095,0.00085601816,0.000012196094,0.000013153384,0.000038989478,0.000016394399,0.9796274,0.0003398225,0.013602068,0.00022957912,0.005210507],"study_design_scores_gemma":[0.0000010788923,0.0000018427535,0.0000515468,0.0000010435265,9.004318e-7,0.0000017928465,0.000001158882,0.9978478,0.000045315526,0.0019907965,0.000055469136,0.0000012414091],"about_ca_topic_score_codex":0.014515839,"about_ca_topic_score_gemma":0.0062614763,"teacher_disagreement_score":0.014515839,"about_ca_system_score_codex":0.00096427463,"about_ca_system_score_gemma":0.0007184648,"threshold_uncertainty_score":0.028862715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29363894,0.0009753487,0.6949496,0.0011476738,0.00009639396,0.00014042476,0.00009924396,0.002013919,0.006938367],"genre_scores_gemma":[0.8999754,0.00019514022,0.09764245,0.0002880525,0.000022022683,0.000091120935,0.00007506777,0.00014525134,0.00156552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986092,0.00060943316,0.000087996,0.00020950504,0.00033440904,0.00014951061],"domain_scores_gemma":[0.9951676,0.0025803116,0.00051707885,0.0013209407,0.00029754813,0.000116472525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028824513,0.0007230658,0.0006913346,0.00055326516,0.0004734236,0.0008727238,0.0011650793,0.0012624045,0.0017643883],"category_scores_gemma":[0.010800318,0.0004768696,0.00065402314,0.00045258668,0.0021275238,0.0023424234,0.0019863758,0.0022108802,0.00042343524],"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.00036205296,0.00011304416,0.0033598382,0.00011765341,0.00013527434,0.00023794336,0.0002118519,0.8567016,0.0154172005,0.04263506,0.0023230652,0.078385316],"study_design_scores_gemma":[0.00004410784,0.00020752406,0.000291479,0.000022979397,0.000028440056,0.00014525212,0.00004639222,0.9567513,0.009174563,0.031685088,0.0015900804,0.0000127553785],"about_ca_topic_score_codex":0.0006502204,"about_ca_topic_score_gemma":0.0012173309,"teacher_disagreement_score":0.0028824513,"about_ca_system_score_codex":0.0007846779,"about_ca_system_score_gemma":0.0009465444,"threshold_uncertainty_score":0.015244067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014470274,0.00038001582,0.9823412,0.0005001215,0.000054630687,0.00004660816,0.00014926305,0.00038042883,0.0016775649],"genre_scores_gemma":[0.61684877,0.0014059333,0.36875907,0.00051597494,0.00038703214,0.00033657489,0.0011877042,0.00068807584,0.009870816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904066,0.0004339365,0.00004365496,0.00021265983,0.00019757228,0.000071465845],"domain_scores_gemma":[0.99240315,0.0058672377,0.00034327107,0.0007032833,0.0004280258,0.00025500084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025834586,0.0014329412,0.0018167807,0.0012985131,0.0007098138,0.0020805546,0.0023195622,0.0027627253,0.004451802],"category_scores_gemma":[0.022592897,0.0015548866,0.0009744314,0.001325268,0.0018934861,0.0053120893,0.0048906147,0.0040806876,0.00076176744],"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.00017230613,0.000106438376,0.00148412,0.0002867821,0.00007255027,0.00017986716,0.00021349959,0.49915177,0.001837175,0.39478782,0.008899678,0.092807904],"study_design_scores_gemma":[0.000007711456,0.00000775627,0.000058131372,0.000007031425,0.0000032803202,0.000013797435,0.000008053961,0.8994314,0.00013823519,0.099918135,0.00040172608,0.0000047466874],"about_ca_topic_score_codex":0.004749611,"about_ca_topic_score_gemma":0.0036346156,"teacher_disagreement_score":0.004749611,"about_ca_system_score_codex":0.0015136832,"about_ca_system_score_gemma":0.0011504473,"threshold_uncertainty_score":0.014892817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937311,0.00041079434,0.0028830343,0.0002865264,0.000026854092,0.00001528299,0.0019848798,0.000097583565,0.0005639224],"genre_scores_gemma":[0.996507,0.00012928562,0.0015476567,0.000015517653,0.000006623492,0.000006337164,0.0012191607,0.000008565577,0.0005598502],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979895,0.00002693361,0.000016056983,0.00005792735,0.00004212693,0.000058059868],"domain_scores_gemma":[0.99877125,0.00044517644,0.00013895726,0.000048157133,0.00044268175,0.000153725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094422,0.00043800802,0.0002743011,0.00094096805,0.0008367893,0.0011239911,0.0008511113,0.00046819818,0.00075201545],"category_scores_gemma":[0.0024092796,0.0002635163,0.0005358313,0.0008649671,0.0003758784,0.00045341774,0.00036317957,0.00058956834,0.00012863491],"study_design_candidate":"simulation_or_modeling","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.00038199197,0.00020109204,0.52236503,0.000067911395,0.00029673232,0.00017089165,0.00011525103,0.44797152,0.0012098454,0.00082700676,0.0024679564,0.023924833],"study_design_scores_gemma":[0.000016315871,0.000013016336,0.118806,0.000016572681,0.00003251837,0.000022736838,0.00017730966,0.87962204,0.00039714135,0.0003477887,0.0005327771,0.000015719486],"about_ca_topic_score_codex":0.9587181,"about_ca_topic_score_gemma":0.9704122,"teacher_disagreement_score":0.04128188,"about_ca_system_score_codex":0.0069979383,"about_ca_system_score_gemma":0.007927843,"threshold_uncertainty_score":0.08304995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901934,0.0002665965,0.003578765,0.00019802533,0.00016764124,0.000012176605,0.004242033,0.00030573457,0.0010356359],"genre_scores_gemma":[0.9898488,0.00006226154,0.0028121048,0.000031986438,0.00003363239,0.000007100918,0.0064299717,0.000015458621,0.00075873086],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999889,0.000014626054,0.000008494524,0.000046015786,0.0000171307,0.000024719286],"domain_scores_gemma":[0.99965346,0.00010011435,0.000027562524,0.000029476541,0.00013013018,0.00005934493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047473458,0.0004590687,0.00035701675,0.0007043966,0.00025609237,0.00040070887,0.00050643244,0.00033797152,0.0011266276],"category_scores_gemma":[0.0008317857,0.00019247821,0.00036006153,0.0006057186,0.00014860861,0.00038125392,0.00037588124,0.00038216345,0.0004255926],"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.0012650924,0.00043340985,0.49720204,0.0001121563,0.0002516581,0.00055157376,0.00021753057,0.34763125,0.011170334,0.0003749816,0.01767164,0.12311832],"study_design_scores_gemma":[0.000023831712,0.000045648907,0.07634089,0.000007843629,0.000032364856,0.00002532058,0.00009769921,0.92118853,0.0013026908,0.00012724177,0.00079538126,0.0000125680635],"about_ca_topic_score_codex":0.07170095,"about_ca_topic_score_gemma":0.09761306,"teacher_disagreement_score":0.92829907,"about_ca_system_score_codex":0.00036778953,"about_ca_system_score_gemma":0.0006541967,"threshold_uncertainty_score":0.14256722},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007633956,0.000092996575,0.9864162,0.00010059577,0.00006164962,0.0001408372,0.000050311628,0.003474684,0.0020287316],"genre_scores_gemma":[0.34012812,0.000066572444,0.65317154,0.000201275,0.00005074558,0.0005002867,0.00028403715,0.000461523,0.0051358147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980544,0.0007337182,0.00009418186,0.0003152897,0.0006455557,0.00015686195],"domain_scores_gemma":[0.99695754,0.0013714159,0.00022587173,0.00036395405,0.00087662874,0.00020453661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003495364,0.0015247014,0.0012873342,0.0008654398,0.0008815264,0.0009030444,0.002641384,0.0013052872,0.006046774],"category_scores_gemma":[0.008879366,0.00051901315,0.00076532003,0.00046901742,0.00081158517,0.0014035212,0.0038685934,0.00208374,0.0011273088],"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.0005055499,0.0005114389,0.0017573774,0.00025273286,0.00017066467,0.0001611816,0.00039031234,0.48438397,0.007757111,0.01174991,0.009038102,0.48332173],"study_design_scores_gemma":[0.000030228774,0.00008884027,0.00015418518,0.000011408888,0.000014186626,0.000015749505,0.000018691164,0.9928948,0.0016988312,0.0038421224,0.0012219814,0.000008917425],"about_ca_topic_score_codex":0.0040292256,"about_ca_topic_score_gemma":0.0068062777,"teacher_disagreement_score":0.006046774,"about_ca_system_score_codex":0.00082067976,"about_ca_system_score_gemma":0.0017111159,"threshold_uncertainty_score":0.020228446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022519708,0.00040863475,0.8910832,0.0027487907,0.0017644345,0.00016110518,0.0038317237,0.03509402,0.04238834],"genre_scores_gemma":[0.46900886,0.00029585836,0.42298886,0.002712505,0.000688547,0.00032017907,0.0055858144,0.007177689,0.09122171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961008,0.00073516916,0.00023244802,0.0010399333,0.0011932802,0.000698378],"domain_scores_gemma":[0.98953235,0.0032768834,0.00026179902,0.0042032804,0.0022335504,0.00049211644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029384298,0.0011328894,0.0011608734,0.0009524667,0.0014356066,0.0045142714,0.0037050731,0.0022419451,0.06546439],"category_scores_gemma":[0.01425935,0.00077606144,0.0011587434,0.0009846404,0.0014219093,0.007520533,0.0055102827,0.0036968463,0.021425331],"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.003096503,0.00070796016,0.0043180618,0.000904103,0.00017300586,0.0006922617,0.00047761365,0.010856082,0.016599013,0.16922939,0.17950068,0.6134454],"study_design_scores_gemma":[0.0004066948,0.0003696866,0.0015964255,0.00012478464,0.00020577,0.0012451689,0.00046633082,0.22782761,0.03627081,0.6288717,0.10247521,0.00013989858],"about_ca_topic_score_codex":0.003407289,"about_ca_topic_score_gemma":0.005920179,"teacher_disagreement_score":0.06546439,"about_ca_system_score_codex":0.0014766222,"about_ca_system_score_gemma":0.003981268,"threshold_uncertainty_score":0.21900022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001560814,0.00057270244,0.9963864,0.00018098748,0.00005669846,0.000014811907,0.000052067655,0.00008887772,0.0010867604],"genre_scores_gemma":[0.2966092,0.004945212,0.68938,0.0005001212,0.0008486762,0.00032451106,0.00064877555,0.00020911067,0.0065343813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706703,0.0010414992,0.00012564335,0.00064291025,0.0009203061,0.0002026523],"domain_scores_gemma":[0.9935422,0.0041472623,0.0005870522,0.0009139326,0.00072146906,0.00008805224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022155282,0.0015034454,0.0013737096,0.0011249525,0.0006075873,0.0018502489,0.0019134232,0.00162221,0.0018701204],"category_scores_gemma":[0.014084695,0.0007695082,0.0010804891,0.002216262,0.0020350195,0.0022138867,0.0020443352,0.0027549148,0.0011952246],"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.000102230784,0.00004325097,0.0011253837,0.00039069148,0.00022108019,0.00014984021,0.00009786126,0.48775333,0.005309504,0.40976468,0.005141617,0.08990055],"study_design_scores_gemma":[0.000011642943,0.000022196577,0.00020432899,0.000025381727,0.000020003105,0.0000760463,0.00000966835,0.8917022,0.0019013481,0.10153369,0.0044739884,0.000019625957],"about_ca_topic_score_codex":0.0024136684,"about_ca_topic_score_gemma":0.001443485,"teacher_disagreement_score":0.0024136684,"about_ca_system_score_codex":0.0011537655,"about_ca_system_score_gemma":0.0014206851,"threshold_uncertainty_score":0.011717021},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018792897,0.00027436414,0.9791661,0.00029377258,0.000050688457,0.00002780159,0.00007411163,0.00026058874,0.0010596545],"genre_scores_gemma":[0.5211476,0.0008205532,0.47075495,0.00043264992,0.0003009391,0.00014406645,0.00059877656,0.00035284556,0.0054475446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610704,0.0011081606,0.00014360445,0.0010804221,0.001238547,0.0003223372],"domain_scores_gemma":[0.9908144,0.0048779747,0.000959158,0.0016034192,0.0014527536,0.0002922715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041297437,0.0010315375,0.0016371578,0.0020031768,0.0012721749,0.0024050327,0.002741913,0.0032901887,0.00085459923],"category_scores_gemma":[0.018792924,0.0006234635,0.0010511286,0.0022393398,0.0025426452,0.0028188091,0.0025577536,0.0021147584,0.0008906404],"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.00032242175,0.00006073327,0.0017260485,0.00027430672,0.00015815994,0.00044042972,0.00040156007,0.8401367,0.022064447,0.08893355,0.0022311604,0.043250516],"study_design_scores_gemma":[0.000010099025,0.00003542747,0.00048097572,0.000013439829,0.000017777124,0.000083516716,0.000039623985,0.9554898,0.006364023,0.03571974,0.0017247326,0.000020870399],"about_ca_topic_score_codex":0.002632922,"about_ca_topic_score_gemma":0.001687512,"teacher_disagreement_score":0.0041297437,"about_ca_system_score_codex":0.0014481249,"about_ca_system_score_gemma":0.000981695,"threshold_uncertainty_score":0.021840394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017217663,0.000105067294,0.9925323,0.00030779967,0.00010194256,0.000037123955,0.000055661778,0.0001096484,0.0050287833],"genre_scores_gemma":[0.15022542,0.00048080378,0.8360615,0.0009286797,0.00041127505,0.00033647323,0.00020158812,0.0004968784,0.0108574135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997184,0.00062437734,0.00019798901,0.00067891506,0.0010650726,0.0002495894],"domain_scores_gemma":[0.9951552,0.0020657014,0.00031503625,0.00070684694,0.0013432403,0.0004139411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040338608,0.0009085628,0.0010278344,0.0012357362,0.00090972317,0.0023494186,0.0031877295,0.0022551548,0.008540301],"category_scores_gemma":[0.015651155,0.0007992766,0.0016591643,0.0011781803,0.0035825898,0.0051007764,0.00490481,0.006115992,0.0016224579],"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.000028831319,0.000065859036,0.0005647421,0.00010088333,0.000029340918,0.000106835476,0.00015462589,0.054196812,0.001751577,0.89922476,0.0033794083,0.040396303],"study_design_scores_gemma":[0.000027206517,0.00007208112,0.00019143755,0.000044793807,0.000016476019,0.0001402528,0.000019921348,0.5310973,0.0011676246,0.45638606,0.010801957,0.000034920504],"about_ca_topic_score_codex":0.0028633033,"about_ca_topic_score_gemma":0.0024439434,"teacher_disagreement_score":0.008540301,"about_ca_system_score_codex":0.0022420827,"about_ca_system_score_gemma":0.004008454,"threshold_uncertainty_score":0.028570175},"labels":[],"label_agreement":null}]}