{"meta":{"query_hash":"0738d2126206","filters":{"venue":"International Conference on Learning Representations"},"cohort_total":80,"direct_labels_cover":0,"predictions_cover":80,"exported":80,"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/0738d2126206","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Learning+Representations"},"results":[{"id":"W2750933313","doi":"","title":"Distributed Second-Order Optimization using Kronecker-Factored Approximations","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":72,"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":"Stochastic gradient descent; Computer science; Computation; Overhead (engineering); Artificial neural network; Curvature; Algorithm; Machine learning; Scaling; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.08007162583441403,"score_gpt":0.35911400772572205,"score_spread":0.27904238189130803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750933313","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.0045284866,0.00015735198,0.99175113,0.00017750525,0.000070349415,0.000027678452,0.00008620641,0.0009390658,0.002262292],"genre_scores_gemma":[0.2591709,0.0003385366,0.7262094,0.00031290622,0.00014269698,0.00024353387,0.0006843308,0.0012130695,0.011684626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993919,0.00013747824,0.00003593198,0.00013878381,0.00022256517,0.00007327985],"domain_scores_gemma":[0.99833375,0.0007625262,0.00011333009,0.00031378254,0.0003663312,0.00011035148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012597818,0.0014910323,0.0014013154,0.00069539476,0.0005292895,0.0013688306,0.0018348842,0.0015510899,0.0055482592],"category_scores_gemma":[0.005070476,0.0006754549,0.0012154318,0.0007404721,0.0012432146,0.0015952763,0.0014026527,0.0023107445,0.0024098975],"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.000053308126,0.000036264755,0.000501837,0.000066009874,0.00003314402,0.0000606196,0.000051545067,0.939988,0.0011999622,0.025358347,0.0037949022,0.028855998],"study_design_scores_gemma":[0.000003713293,0.0000031252425,0.000016379256,0.0000022171985,9.4743837e-7,0.000003656665,0.0000018100424,0.9960103,0.00011047592,0.003513877,0.000331305,0.0000021323037],"about_ca_topic_score_codex":0.015262984,"about_ca_topic_score_gemma":0.02361878,"teacher_disagreement_score":0.015262984,"about_ca_system_score_codex":0.0015707024,"about_ca_system_score_gemma":0.0026440597,"threshold_uncertainty_score":0.030348301},"labels":[],"label_agreement":null},{"id":"W2751220357","doi":"","title":"Recurrent Normalization Propagation","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","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":"Normalization (sociology); Initialization; Computer science; Computation; Parametrization (atmospheric modeling); Artificial intelligence; Generative grammar; Machine learning; Algorithm","score_opus":0.08877434203423155,"score_gpt":0.3726418993060283,"score_spread":0.28386755727179674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751220357","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.0065724845,0.00026715014,0.9791981,0.0003009608,0.00028593017,0.000077931516,0.00037319792,0.008247156,0.0046770955],"genre_scores_gemma":[0.40304533,0.00079065294,0.553899,0.0008890788,0.00040981505,0.00054111175,0.0023165143,0.0029943676,0.03511405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992586,0.00010845182,0.000040800118,0.00026038755,0.0002282296,0.000103434635],"domain_scores_gemma":[0.9987509,0.00035006157,0.000098251476,0.00032960737,0.00042223255,0.000049035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011919768,0.0019842254,0.00110913,0.0008259313,0.00065931893,0.00177165,0.0028849274,0.001371375,0.012897773],"category_scores_gemma":[0.006130673,0.0007913237,0.0011460821,0.001098674,0.0008452949,0.0038128798,0.0017292564,0.0024438063,0.0063873674],"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.00029295575,0.00019279492,0.001427271,0.00024517564,0.00018578857,0.00027601127,0.00028358144,0.23618203,0.038707748,0.053496186,0.032332245,0.6363781],"study_design_scores_gemma":[0.000021507942,0.000046686466,0.00026261053,0.000024383036,0.00004781512,0.00010111307,0.000027050348,0.9441276,0.019651122,0.026023267,0.009636305,0.000030504068],"about_ca_topic_score_codex":0.007774104,"about_ca_topic_score_gemma":0.012401976,"teacher_disagreement_score":0.012897773,"about_ca_system_score_codex":0.0010008175,"about_ca_system_score_gemma":0.001606196,"threshold_uncertainty_score":0.043147326},"labels":[],"label_agreement":null},{"id":"W2751842161","doi":"","title":"Improving Generative Adversarial Networks with Denoising Feature Matching","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":160,"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":"Discriminator; Generator (circuit theory); Computer science; Artificial intelligence; Generative grammar; Set (abstract data type); Adversarial system; Pattern recognition (psychology); Feature (linguistics); Matching (statistics); Task (project management); Noise reduction; Encoder; Image (mathematics); Feature extraction; Machine learning; Mathematics; Power (physics); Engineering","score_opus":0.027347600635553772,"score_gpt":0.2982712933071036,"score_spread":0.27092369267154987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751842161","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.013618769,0.00017072546,0.9840059,0.00014106985,0.000024656512,0.000021625923,0.000037084756,0.0005225442,0.0014576904],"genre_scores_gemma":[0.6921742,0.00026391898,0.2987906,0.00050364155,0.00008825551,0.00015869488,0.00049421075,0.00044174033,0.0070847264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922025,0.00026662872,0.000028637362,0.00016378418,0.0002357858,0.00008496801],"domain_scores_gemma":[0.99797004,0.0012875858,0.0001686965,0.00030299765,0.00019639399,0.00007420717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024071431,0.0013499806,0.0011666535,0.0007421623,0.00032660764,0.00089143583,0.0017846903,0.0016261853,0.001896475],"category_scores_gemma":[0.0060184365,0.00061923673,0.00078478,0.0005463114,0.0012081515,0.0015888226,0.0023441545,0.0019462968,0.0008145723],"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.00008296089,0.000039934577,0.0005319241,0.000035069508,0.000042262025,0.00004526104,0.00004324844,0.9384275,0.0048937923,0.012265973,0.00089357985,0.042698577],"study_design_scores_gemma":[0.0000032090493,0.00001311681,0.000032728803,0.0000025414495,0.0000030106694,0.000010542166,0.0000019214353,0.99533445,0.0008608238,0.003568968,0.00016607116,0.000002641593],"about_ca_topic_score_codex":0.002144806,"about_ca_topic_score_gemma":0.0023492298,"teacher_disagreement_score":0.0024071431,"about_ca_system_score_codex":0.00092259236,"about_ca_system_score_gemma":0.0006687686,"threshold_uncertainty_score":0.01273036},"labels":[],"label_agreement":null},{"id":"W2753160622","doi":"","title":"Optimization as a Model for Few-Shot Learning","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":2447,"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 Sherbrooke","funders":"","keywords":"Computer science; Initialization; Artificial intelligence; Meta learning (computer science); Convergence (economics); Deep learning; Metric (unit); Artificial neural network; Machine learning; Set (abstract data type); Parametrization (atmospheric modeling); Competitive learning; Class (philosophy); Domain (mathematical analysis); Learning to learn; Mathematics; Task (project management)","score_opus":0.1464190826716082,"score_gpt":0.4031299499396052,"score_spread":0.256710867267997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753160622","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.0071795764,0.00030052342,0.99086726,0.0003162681,0.000028729864,0.00002963173,0.000069990936,0.00029427293,0.00091370655],"genre_scores_gemma":[0.66534585,0.00084501976,0.31901863,0.000605992,0.0001861584,0.0005774629,0.00063366664,0.00039147335,0.012395817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992717,0.0002874014,0.00003836458,0.00021257596,0.00013686495,0.00005313938],"domain_scores_gemma":[0.9984187,0.00097216817,0.000149404,0.00020681419,0.00017686786,0.000076070064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019014421,0.0008942978,0.0013186077,0.0006107751,0.0003196266,0.0011719452,0.0025557165,0.0021536322,0.0029136075],"category_scores_gemma":[0.007025933,0.00077287364,0.00085845107,0.0007377417,0.0012665989,0.003090303,0.0016242686,0.0029814355,0.00084672385],"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.0000462469,0.000049161776,0.00034274807,0.00008383829,0.00004078158,0.000056527308,0.00007226926,0.90911937,0.0012849842,0.058948237,0.0016932271,0.028262611],"study_design_scores_gemma":[0.0000025769104,0.0000108474605,0.00002769922,0.00000397814,0.0000023929729,0.000010113538,0.000002427483,0.9815996,0.0001928304,0.017884312,0.00025961435,0.0000036745844],"about_ca_topic_score_codex":0.0025382084,"about_ca_topic_score_gemma":0.0026737906,"teacher_disagreement_score":0.0029136075,"about_ca_system_score_codex":0.0011911483,"about_ca_system_score_gemma":0.0007870852,"threshold_uncertainty_score":0.010055959},"labels":[],"label_agreement":null},{"id":"W2753228334","doi":"","title":"Online Bayesian Transfer Learning for Sequential Data Modeling","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":14,"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":"Hidden Markov model; Computer science; Artificial intelligence; Sequence (biology); Population; Context (archaeology); Machine learning; Sequence learning; Bayesian probability; Pattern recognition (psychology)","score_opus":0.2214864104494036,"score_gpt":0.4322454878549099,"score_spread":0.2107590774055063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753228334","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.0046999874,0.00040125664,0.9931242,0.00047548494,0.000046824876,0.000060526236,0.00014079644,0.0005002994,0.0005507089],"genre_scores_gemma":[0.6164488,0.0014272865,0.3684823,0.00077630865,0.00054523646,0.0013775348,0.0015826732,0.00038335405,0.00897634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969362,0.0014766612,0.00016764207,0.00072021066,0.00048419635,0.0002151122],"domain_scores_gemma":[0.9841232,0.013114684,0.0007377313,0.000937207,0.0007982743,0.00028899946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00747863,0.0018370575,0.0027378104,0.0018246172,0.0008320981,0.0018651924,0.00390738,0.0032343087,0.0056773056],"category_scores_gemma":[0.029681707,0.0012456089,0.0017933564,0.0026389444,0.0019593895,0.0039162836,0.0030190614,0.004901827,0.0015517288],"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.00016780468,0.00018073121,0.0013269084,0.00018592097,0.00015696256,0.00017987283,0.00019129369,0.8470299,0.00054032117,0.056338385,0.0021676177,0.091534354],"study_design_scores_gemma":[0.0000057430584,0.000010883921,0.000051053354,0.000006359812,0.0000045210686,0.000008724192,0.000005488255,0.9701882,0.000082686434,0.029399622,0.000231505,0.0000052553055],"about_ca_topic_score_codex":0.0100437505,"about_ca_topic_score_gemma":0.0066520083,"teacher_disagreement_score":0.0100437505,"about_ca_system_score_codex":0.002824052,"about_ca_system_score_gemma":0.0022551075,"threshold_uncertainty_score":0.0395512},"labels":[],"label_agreement":null},{"id":"W2785948534","doi":"","title":"NerveNet: Learning Structured Policy with Graph Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Concatenation (mathematics); Computer science; Transfer of learning; Artificial intelligence; Graph; Benchmarking; Machine learning; Artificial neural network; Control (management); Theoretical computer science; Mathematics","score_opus":0.031554453052495206,"score_gpt":0.32419013458969764,"score_spread":0.29263568153720243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785948534","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.032740634,0.00034727834,0.9600867,0.00048180955,0.00016867921,0.00007158482,0.00019355922,0.0024932988,0.0034164481],"genre_scores_gemma":[0.7861734,0.00030074967,0.20808122,0.0004578753,0.000076106575,0.00022769622,0.0004892196,0.00025078256,0.0039429544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997265,0.00008783876,0.000012912957,0.00006914877,0.00006718761,0.000036475172],"domain_scores_gemma":[0.99900466,0.0005756516,0.00010357851,0.00012102638,0.00012694723,0.00006810696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008886644,0.0007510662,0.0007149902,0.00050936424,0.00027666995,0.0005849849,0.0011917482,0.0011066562,0.0025606735],"category_scores_gemma":[0.0035730852,0.00037503976,0.00040340231,0.0004310197,0.0008421114,0.0012505923,0.0008722362,0.0014437492,0.000490779],"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.00004468929,0.000046543708,0.0003578648,0.000035179804,0.000021903486,0.000034555702,0.00001687485,0.9576289,0.00058873446,0.007076573,0.001427115,0.03272104],"study_design_scores_gemma":[0.0000045075085,0.0000143057205,0.000021747232,0.0000024530282,0.0000015889651,0.000004024357,0.0000012296136,0.99560463,0.00021779373,0.0038965833,0.00022943724,0.0000016861508],"about_ca_topic_score_codex":0.0054361625,"about_ca_topic_score_gemma":0.0068445303,"teacher_disagreement_score":0.0054361625,"about_ca_system_score_codex":0.0008313048,"about_ca_system_score_gemma":0.0013094348,"threshold_uncertainty_score":0.010809004},"labels":[],"label_agreement":null},{"id":"W2786263712","doi":"","title":"Kronecker-factored Curvature Approximations for Recurrent Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","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":"Kronecker delta; Recurrent neural network; Parameterized complexity; Computer science; Algorithm; Covariance; Gaussian; Inverse; Artificial neural network; Applied mathematics; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.060654942516671785,"score_gpt":0.3641504852356096,"score_spread":0.3034955427189378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786263712","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.0074269683,0.00030040034,0.99041325,0.00010039539,0.00003061989,0.000017211882,0.00008077035,0.0006711352,0.00095924025],"genre_scores_gemma":[0.466459,0.0006895682,0.5233035,0.0001759344,0.00009776734,0.0001733137,0.0008874765,0.0009629682,0.0072505223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958915,0.0001436394,0.00002974976,0.00007386296,0.00012551976,0.000038039965],"domain_scores_gemma":[0.9988877,0.00049074943,0.00012015514,0.00018672322,0.00024905842,0.000065556764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012265595,0.0011936675,0.0008959702,0.0006890151,0.00032240577,0.0010583028,0.0012829169,0.0012958278,0.0024380835],"category_scores_gemma":[0.0053926078,0.00062559976,0.0008748865,0.0006084624,0.0007647215,0.0017277523,0.0009610013,0.0018013307,0.001265152],"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.000050073966,0.000020586369,0.000427359,0.00005155039,0.000030282257,0.000042358195,0.0000454503,0.9364405,0.0018343662,0.0236565,0.0017364408,0.03566454],"study_design_scores_gemma":[9.980854e-7,0.0000035147218,0.000025700736,0.000002732469,0.0000010970452,0.000005233031,0.0000014037565,0.9959967,0.00015973762,0.003583909,0.00021681534,0.00000217326],"about_ca_topic_score_codex":0.006359992,"about_ca_topic_score_gemma":0.008861822,"teacher_disagreement_score":0.006359992,"about_ca_system_score_codex":0.0013674977,"about_ca_system_score_gemma":0.0011711261,"threshold_uncertainty_score":0.01264596},"labels":[],"label_agreement":null},{"id":"W2786406308","doi":"","title":"Espresso: Efficient Forward Propagation for Binary Deep Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":13,"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 Victoria","funders":"","keywords":"Computer science; CUDA; Convolutional neural network; Memory footprint; Parallel computing; Binary number; Deep learning; Artificial neural network; Matrix multiplication; Artificial intelligence; Operating system; Arithmetic","score_opus":0.0384290167936386,"score_gpt":0.3438460892558937,"score_spread":0.30541707246225513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786406308","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.021009719,0.0010006127,0.8614811,0.00032017758,0.00034078924,0.00015448956,0.0024095182,0.09921192,0.0140716685],"genre_scores_gemma":[0.20202672,0.00081791397,0.7535855,0.000549641,0.00011425721,0.0005585788,0.010113717,0.010268249,0.021965379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995408,0.00006577196,0.000045028253,0.0000713664,0.00019943825,0.00007751937],"domain_scores_gemma":[0.99944466,0.00020244493,0.000059563332,0.00011280918,0.00014722889,0.000033203498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872264,0.001272044,0.00046093465,0.00074133277,0.00039686353,0.0011245715,0.0025317795,0.000824743,0.01764983],"category_scores_gemma":[0.002621573,0.00069887144,0.0006905721,0.0008378772,0.0004299179,0.0020403417,0.0014645626,0.0013350004,0.006633596],"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.0012854384,0.00033529423,0.0020008076,0.0013692814,0.00019870848,0.00042605377,0.0002327191,0.111021765,0.038415458,0.044336088,0.16071683,0.6396616],"study_design_scores_gemma":[0.00019676625,0.00013201736,0.0005626509,0.00010751139,0.000038980103,0.0001925562,0.000034057757,0.8854188,0.045595065,0.02052299,0.047151532,0.000047088713],"about_ca_topic_score_codex":0.0040186,"about_ca_topic_score_gemma":0.005349453,"teacher_disagreement_score":0.01764983,"about_ca_system_score_codex":0.00074966036,"about_ca_system_score_gemma":0.0013340095,"threshold_uncertainty_score":0.05904454},"labels":[],"label_agreement":null},{"id":"W2786478526","doi":"","title":"Adversarial Policy Gradient for Alternating Markov Games","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Artificial neural network; Computer science; Markov decision process; Markov chain; Gradient descent; Mathematical optimization; Temporal difference learning; Artificial intelligence; Markov process; Machine learning; Mathematics; Statistics","score_opus":0.05030579220343445,"score_gpt":0.3677090667664834,"score_spread":0.31740327456304895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786478526","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.02031145,0.0002300542,0.9742187,0.00038562244,0.00006183327,0.000069901085,0.000053189055,0.00033449294,0.0043347436],"genre_scores_gemma":[0.8357289,0.00030651336,0.15341434,0.00035601997,0.00007336227,0.00041076008,0.00017690587,0.00017963897,0.009353611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911314,0.00046415703,0.00003379303,0.00014442434,0.00015233185,0.00009210389],"domain_scores_gemma":[0.9965191,0.0027393636,0.00021774339,0.000127071,0.00023333583,0.00016335514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018283668,0.0012050403,0.0012533559,0.0005399686,0.00039849317,0.0008780608,0.0010631426,0.0012129257,0.0036926093],"category_scores_gemma":[0.007792008,0.000496726,0.000555927,0.00035300135,0.0016717671,0.0011627283,0.0013799334,0.0019036671,0.00045380648],"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.00006494252,0.000031257387,0.00029837684,0.00004999825,0.000019521796,0.000042715306,0.000041912816,0.93521893,0.0004969276,0.05240951,0.00076145766,0.010564385],"study_design_scores_gemma":[0.000005016308,0.0000087153785,0.000018987872,0.0000031197922,0.0000015537679,0.0000036815568,0.0000021622661,0.9887982,0.000090499896,0.010894276,0.00017149361,0.0000022526872],"about_ca_topic_score_codex":0.004118285,"about_ca_topic_score_gemma":0.0033296468,"teacher_disagreement_score":0.004118285,"about_ca_system_score_codex":0.0016766997,"about_ca_system_score_gemma":0.0015499096,"threshold_uncertainty_score":0.012352943},"labels":[],"label_agreement":null},{"id":"W2787038193","doi":"","title":"Boundary Seeking GANs","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","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":"Université de Montréal; University of Waterloo","funders":"","keywords":"Discriminator; Generator (circuit theory); Boundary (topology); Measure (data warehouse); Computer science; Decision boundary; Image (mathematics); Differentiable function; Stability (learning theory); Generative grammar; Scale (ratio); Artificial intelligence; Character (mathematics); Pattern recognition (psychology); Algorithm; Mathematics; Machine learning; Data mining; Mathematical analysis; Geometry; Power (physics)","score_opus":0.04253164387224141,"score_gpt":0.32565739840824387,"score_spread":0.28312575453600247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787038193","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.0114622945,0.00026470382,0.9812191,0.00023622233,0.00006724251,0.000055872617,0.00016366606,0.000941597,0.0055893376],"genre_scores_gemma":[0.66819257,0.00041363534,0.31492683,0.0007106976,0.00011676276,0.00028668318,0.0010074176,0.00063483365,0.013710465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996055,0.00013664365,0.000013841946,0.00011117433,0.000089906454,0.00004308085],"domain_scores_gemma":[0.99933845,0.00039037882,0.000046268,0.00009805898,0.00008876676,0.000038070557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319003,0.00081677345,0.0007452843,0.00043258365,0.0002759363,0.00071198883,0.0011082777,0.0009667676,0.0052389633],"category_scores_gemma":[0.0028936754,0.00033449472,0.0005771052,0.00033470494,0.0008307192,0.0010771557,0.0011936312,0.0017363828,0.0011510075],"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.00012345423,0.000058874957,0.00074242195,0.000103410384,0.000041512205,0.00013752967,0.000113589034,0.79557,0.008342671,0.094433546,0.008331484,0.09200147],"study_design_scores_gemma":[0.000008405067,0.00001636263,0.000064484666,0.000008968992,0.0000036414822,0.00003444802,0.0000060149414,0.9713201,0.0012285357,0.02567627,0.0016277131,0.000005034028],"about_ca_topic_score_codex":0.0010791206,"about_ca_topic_score_gemma":0.001737916,"teacher_disagreement_score":0.0052389633,"about_ca_system_score_codex":0.0006477652,"about_ca_system_score_gemma":0.0004387069,"threshold_uncertainty_score":0.01752603},"labels":[],"label_agreement":null},{"id":"W2787217782","doi":"","title":"Decoupling the Layers in Residual Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","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":"York University","funders":"","keywords":"Residual; Computer science; Algorithm; Parallelizable manifold; Decoupling (probability); Scaling; Perturbation (astronomy); Mathematical optimization; Mathematics; Geometry; Physics; Engineering","score_opus":0.050020908066392776,"score_gpt":0.3584311460717074,"score_spread":0.30841023800531464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787217782","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.018683089,0.00012247059,0.9785202,0.00013761573,0.00005176842,0.000033835586,0.000037315105,0.0011193636,0.0012943365],"genre_scores_gemma":[0.53526306,0.0003141313,0.4558601,0.000292871,0.00009822747,0.00019138692,0.00031920595,0.0005672879,0.007093771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951255,0.00010998537,0.000023485494,0.00013534677,0.00014551892,0.000073199146],"domain_scores_gemma":[0.9992478,0.00029806144,0.000080225356,0.00018029426,0.00014287375,0.00005092232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074549986,0.0012638206,0.0006845219,0.00041154042,0.00041792588,0.0007993178,0.0020313235,0.0011938342,0.0027564073],"category_scores_gemma":[0.0037605695,0.0007325728,0.0006542846,0.0004951995,0.00093036355,0.0028919037,0.0016529511,0.0023355437,0.0011056646],"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.00016315468,0.00006538887,0.0004202645,0.000089644105,0.000055439104,0.00013473122,0.00011108805,0.83694845,0.020411663,0.018786874,0.001702978,0.121110335],"study_design_scores_gemma":[0.0000049771,0.00002514976,0.000032473225,0.0000028563293,0.000004412386,0.0000138929245,0.000005772029,0.98951614,0.003985987,0.005837944,0.0005662629,0.0000041880508],"about_ca_topic_score_codex":0.0039448556,"about_ca_topic_score_gemma":0.004078897,"teacher_disagreement_score":0.0039448556,"about_ca_system_score_codex":0.0006040426,"about_ca_system_score_gemma":0.0009935535,"threshold_uncertainty_score":0.009221137},"labels":[],"label_agreement":null},{"id":"W2787849668","doi":"","title":"Extending the Framework of Equilibrium Propagation to General Dynamics","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural dynamics and brain function","field":"Neuroscience","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","funders":"","keywords":"Computer science; Backpropagation; Feed forward; Generalization; Function (biology); Learning rule; Artificial neural network; Simple (philosophy); Degree (music); Algorithm; Point (geometry); Symmetry (geometry); Artificial intelligence; Mathematics; Physics","score_opus":0.061416145007651614,"score_gpt":0.36368154145194365,"score_spread":0.302265396444292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787849668","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.0037196164,0.00008314349,0.9945074,0.0001116275,0.000019489367,0.000011256541,0.000012973434,0.0000968042,0.0014378378],"genre_scores_gemma":[0.43525818,0.00087472843,0.5559901,0.0001771162,0.0001494089,0.00020621416,0.00010398203,0.00025781034,0.0069823447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957687,0.00015642267,0.00002068661,0.00008264052,0.00012367444,0.00003959611],"domain_scores_gemma":[0.99917006,0.00042259993,0.00007472939,0.000108240725,0.00018843092,0.000035947513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013222578,0.00080434146,0.00054070895,0.0006483958,0.0004192505,0.0010116001,0.0013064276,0.0011397663,0.0021146666],"category_scores_gemma":[0.004678624,0.00039580924,0.0006585565,0.0004740682,0.0012928932,0.002054547,0.0014893338,0.001388001,0.00046735097],"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.000020953521,0.000020544092,0.00026740262,0.000061592225,0.000026502212,0.000081535225,0.000086777,0.608792,0.0027033235,0.3570876,0.00067970814,0.03017209],"study_design_scores_gemma":[0.0000038747808,0.000008572777,0.00003200532,0.00000343263,0.0000023379878,0.00001326445,0.0000028605712,0.92891943,0.00023861545,0.069871694,0.00089971407,0.0000040766404],"about_ca_topic_score_codex":0.0038516915,"about_ca_topic_score_gemma":0.00253827,"teacher_disagreement_score":0.0038516915,"about_ca_system_score_codex":0.0008871361,"about_ca_system_score_gemma":0.0009201374,"threshold_uncertainty_score":0.007658541},"labels":[],"label_agreement":null},{"id":"W2901997113","doi":"","title":"Char2Wav: End-to-End Speech Synthesis","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":335,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université de Montréal","funders":"","keywords":"End-to-end principle; Computer science; Speech synthesis; Speech recognition; Artificial intelligence","score_opus":0.09295328918588806,"score_gpt":0.3624233461629727,"score_spread":0.26947005697708465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901997113","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.0062849456,0.0002746154,0.7827226,0.00009152506,0.00052884733,0.0002219966,0.0032209035,0.19864504,0.008009537],"genre_scores_gemma":[0.17060706,0.00030335886,0.7261784,0.00056750915,0.0002184688,0.0010551543,0.023474334,0.026199438,0.05139634],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912673,0.00010224807,0.00004285313,0.0002398504,0.00035748514,0.00013091105],"domain_scores_gemma":[0.999571,0.00011981541,0.000015340924,0.0001375682,0.000119197466,0.000037039543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076969847,0.0023806307,0.0013448182,0.0009871474,0.0005950771,0.0018389716,0.002063848,0.0016784926,0.052971486],"category_scores_gemma":[0.0016561317,0.0007843404,0.0010277325,0.0005160046,0.00041587002,0.0012264234,0.0032413863,0.0016867982,0.03085852],"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.0025565126,0.00036314412,0.00070320285,0.00052925665,0.00030348045,0.00076769025,0.00020959681,0.017372686,0.12909526,0.007819952,0.12413717,0.716142],"study_design_scores_gemma":[0.0005033736,0.00051825994,0.0012992636,0.00008177346,0.00009213998,0.00080943917,0.00015588048,0.52064806,0.3414293,0.015427114,0.11885332,0.00018199437],"about_ca_topic_score_codex":0.0017858342,"about_ca_topic_score_gemma":0.0036821663,"teacher_disagreement_score":0.052971486,"about_ca_system_score_codex":0.00046708132,"about_ca_system_score_gemma":0.0007758544,"threshold_uncertainty_score":0.17720729},"labels":[],"label_agreement":null},{"id":"W2903153676","doi":"","title":"Leveraging Constraint Logic Programming for Neural Guided Program Synthesis.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","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":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Logic programming; Programming language; Constraint programming; Concurrent constraint logic programming; Constraint logic programming; Logic program; Constraint satisfaction; Constraint (computer-aided design); Inductive programming; Theoretical computer science; Artificial intelligence; Functional logic programming; Programming paradigm; Mathematical optimization; Mathematics","score_opus":0.12365227752669244,"score_gpt":0.3885364596589281,"score_spread":0.26488418213223563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903153676","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.013889489,0.00033534583,0.9763525,0.00032878845,0.00005464397,0.00011409578,0.00021471057,0.0013622869,0.007348033],"genre_scores_gemma":[0.378216,0.00032962675,0.61590445,0.00035810348,0.000036369038,0.00031169096,0.0006812328,0.0004147929,0.0037477221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942577,0.00016883564,0.000039216528,0.00012957268,0.0001588168,0.00007784989],"domain_scores_gemma":[0.99842715,0.0011283823,0.0000927398,0.0001495123,0.00015641031,0.000045815974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793537,0.00078809354,0.0005463319,0.00065924536,0.00040683034,0.0011155668,0.0014783011,0.0009289826,0.005522368],"category_scores_gemma":[0.00450811,0.0004524004,0.0008259738,0.00079898036,0.0009076907,0.0016213498,0.0013579663,0.0018671037,0.00082158076],"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.0001504207,0.00018394148,0.00061904156,0.0003042453,0.000092541326,0.00016312496,0.00011656926,0.6733792,0.007826538,0.064188324,0.0057371873,0.24723892],"study_design_scores_gemma":[0.000011508546,0.000019425794,0.000027514965,0.000015145036,0.000011538667,0.000013435748,0.000014714264,0.96596354,0.0014648299,0.03124493,0.0012098465,0.0000036486445],"about_ca_topic_score_codex":0.0058314153,"about_ca_topic_score_gemma":0.016260672,"teacher_disagreement_score":0.0058314153,"about_ca_system_score_codex":0.0008192378,"about_ca_system_score_gemma":0.0016845281,"threshold_uncertainty_score":0.018474162},"labels":[],"label_agreement":null},{"id":"W2903934645","doi":"","title":"Online variance-reducing optimization","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Metaheuristic Optimization Algorithms Research","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; Variance (accounting); Business","score_opus":0.074319189957712,"score_gpt":0.38425176134099914,"score_spread":0.3099325713832871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903934645","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.013476317,0.00087131077,0.9715389,0.000930052,0.00047491043,0.000054737047,0.0000861519,0.0006458852,0.011921691],"genre_scores_gemma":[0.50168324,0.0008136636,0.4659577,0.001040633,0.00070689985,0.00028391185,0.0005544239,0.00075511954,0.028204432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839157,0.0006683226,0.0000665473,0.00027211037,0.0004413494,0.00016009208],"domain_scores_gemma":[0.997922,0.0012102253,0.00012285446,0.00032758125,0.00032004993,0.00009734802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955318,0.0014488519,0.0020625943,0.00091114145,0.0006760918,0.0020996202,0.0017850796,0.0022684918,0.0067054415],"category_scores_gemma":[0.006133486,0.00076100155,0.0013485658,0.001360606,0.0011008804,0.0018749617,0.0026330473,0.0035288385,0.0014074825],"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.00025326968,0.00044196448,0.00046027385,0.00018439052,0.00016255313,0.000083374725,0.00007986992,0.6001364,0.0029783682,0.07471131,0.018373577,0.30213472],"study_design_scores_gemma":[0.000013591878,0.000026224056,0.000055998775,0.0000077559935,0.00001106061,0.000013435592,0.000004668165,0.9859871,0.0004398495,0.012484225,0.0009511334,0.0000049428004],"about_ca_topic_score_codex":0.0023076402,"about_ca_topic_score_gemma":0.0027147725,"teacher_disagreement_score":0.0067054415,"about_ca_system_score_codex":0.0010655522,"about_ca_system_score_gemma":0.0016180674,"threshold_uncertainty_score":0.02243191},"labels":[],"label_agreement":null},{"id":"W2904014149","doi":"","title":"Finding Flatter Minima with SGD","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"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":"Maxima and minima; Computer science; Artificial intelligence; Mathematics; Mathematical analysis","score_opus":0.0514478710076336,"score_gpt":0.3483785570925074,"score_spread":0.29693068608487383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904014149","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.021374738,0.00044561792,0.9703159,0.00041489082,0.00015029762,0.000086104934,0.00013457309,0.00245077,0.0046271468],"genre_scores_gemma":[0.21977481,0.00018526401,0.76994956,0.00053858914,0.000099819554,0.00028040068,0.00065253896,0.0019717172,0.0065473826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.00034207225,0.0000777255,0.00025267858,0.00021509727,0.00010394404],"domain_scores_gemma":[0.99754983,0.0015613113,0.0001345495,0.00036489946,0.00026654094,0.00012300484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023364327,0.0022980792,0.0029567415,0.0023897681,0.0010382101,0.0020679997,0.0018097527,0.0029958112,0.014636203],"category_scores_gemma":[0.010290098,0.0016672679,0.0016067147,0.0015426787,0.0014417514,0.002770636,0.002986094,0.0033081782,0.0030712308],"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.0006436342,0.0002504713,0.0013736873,0.00035148874,0.00019539792,0.00023757607,0.00022721072,0.5764237,0.005313766,0.04689321,0.018826375,0.34926355],"study_design_scores_gemma":[0.00007117677,0.00006738495,0.00012063123,0.000025301768,0.000016505017,0.0000326065,0.000030647217,0.9612436,0.0009239032,0.0363182,0.001138879,0.000011181196],"about_ca_topic_score_codex":0.0027831818,"about_ca_topic_score_gemma":0.0045451084,"teacher_disagreement_score":0.014636203,"about_ca_system_score_codex":0.0010257263,"about_ca_system_score_gemma":0.001604368,"threshold_uncertainty_score":0.04896295},"labels":[],"label_agreement":null},{"id":"W2907134525","doi":"","title":"Gradient-based Optimization of Neural Network Architecture.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Artificial neural network; Architecture; Artificial intelligence","score_opus":0.03574961797958973,"score_gpt":0.31452632339352865,"score_spread":0.2787767054139389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907134525","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.017386151,0.0013247592,0.9720078,0.0007498192,0.00021369499,0.00008136482,0.00013000648,0.00077929423,0.007327026],"genre_scores_gemma":[0.612082,0.00083925424,0.37046456,0.0004207963,0.00017234319,0.00039188634,0.0005383296,0.00064136577,0.014449439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999706,0.00013518294,0.000013501112,0.00004364335,0.00006448691,0.00003719027],"domain_scores_gemma":[0.9991516,0.0004738728,0.00005897878,0.000058319125,0.00021468909,0.00004263277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012906631,0.0010167307,0.0008961043,0.00054532394,0.00032563973,0.0007387256,0.001150145,0.0015312517,0.004199507],"category_scores_gemma":[0.0062371404,0.0006798024,0.0003764261,0.00065362523,0.0005978571,0.0014458961,0.0008597854,0.0016882296,0.0011406438],"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.000102434096,0.000049102786,0.00039998768,0.00010204282,0.000050785457,0.000031057647,0.000037376027,0.90696746,0.0011317447,0.014057302,0.0076643983,0.069406375],"study_design_scores_gemma":[0.000007719022,0.000010657361,0.000037985516,0.000006628567,0.0000037014695,0.00000443634,0.000003092962,0.99510926,0.00017179371,0.0042914124,0.00035161548,0.0000016394187],"about_ca_topic_score_codex":0.0054463395,"about_ca_topic_score_gemma":0.007393405,"teacher_disagreement_score":0.0054463395,"about_ca_system_score_codex":0.00090118445,"about_ca_system_score_gemma":0.0012588899,"threshold_uncertainty_score":0.014048755},"labels":[],"label_agreement":null},{"id":"W2907257898","doi":"","title":"Transferring Knowledge to Smaller Network with Class-Distance Loss","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":22,"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; Class (philosophy); Computer network; Artificial intelligence","score_opus":0.049546841950115175,"score_gpt":0.3549417961186118,"score_spread":0.30539495416849666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907257898","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.06490374,0.00026214664,0.927277,0.00095628714,0.00019437159,0.00012878532,0.00025485078,0.0018725998,0.004150113],"genre_scores_gemma":[0.7581601,0.00026293145,0.22251359,0.0005953877,0.00021902671,0.00029958182,0.0011916854,0.00039998832,0.016357727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993363,0.00015661126,0.000040410574,0.00025061663,0.00013563402,0.00008039339],"domain_scores_gemma":[0.9977715,0.0009057116,0.00010306985,0.0008189823,0.00029875233,0.00010198209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001509944,0.0011771584,0.0012528456,0.0010276082,0.00066346367,0.0012158835,0.0022710348,0.0024242534,0.0069922116],"category_scores_gemma":[0.0058755735,0.00045703136,0.00085036195,0.001098911,0.0009510543,0.00398823,0.003001251,0.0031457024,0.0015333454],"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.0004313497,0.00050797284,0.0010362667,0.0001354675,0.00013732602,0.00018994597,0.00013439765,0.43659642,0.015052154,0.019975165,0.0101378895,0.51566565],"study_design_scores_gemma":[0.000012547337,0.000049826514,0.00012764848,0.0000066350062,0.000016680562,0.00002477417,0.000015749583,0.9821597,0.0026275555,0.0142385075,0.0007162439,0.000004174872],"about_ca_topic_score_codex":0.0066142646,"about_ca_topic_score_gemma":0.0066628344,"teacher_disagreement_score":0.0069922116,"about_ca_system_score_codex":0.0013678402,"about_ca_system_score_gemma":0.0012203831,"threshold_uncertainty_score":0.023391306},"labels":[],"label_agreement":null},{"id":"W2907502844","doi":"","title":"Deep reinforcement learning with relational inductive biases","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":136,"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":"Inductive bias; Statistical relational learning; Reinforcement learning; Computer science; Artificial intelligence; Inductive logic programming; Machine learning; Relational database; Multi-task learning; Data mining; Engineering","score_opus":0.11598024182902084,"score_gpt":0.3604810611844719,"score_spread":0.24450081935545104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907502844","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.06718229,0.0004852491,0.9260755,0.0010978124,0.00016556552,0.00006243877,0.00011201494,0.00068406365,0.004134982],"genre_scores_gemma":[0.8996946,0.00019303088,0.09483505,0.0002798404,0.000079455785,0.000092750255,0.00012853528,0.00008494221,0.004611741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994079,0.00024568258,0.000033263637,0.00013508374,0.00010657395,0.00007151012],"domain_scores_gemma":[0.9969313,0.0020010266,0.00018004053,0.00037965408,0.00036355804,0.0001444119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017218105,0.0006083814,0.00078626024,0.0003431814,0.00035359178,0.00096976216,0.001477694,0.0012380022,0.004598733],"category_scores_gemma":[0.008113764,0.00046961088,0.00044941652,0.00041630832,0.0009528093,0.0021457113,0.0022024696,0.0023796968,0.00051210774],"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.0003237913,0.00030785965,0.0023234587,0.00016895527,0.00013775808,0.0001446955,0.00019409743,0.6110065,0.006846521,0.08573563,0.003585159,0.2892256],"study_design_scores_gemma":[0.000013562797,0.000035755947,0.00007934893,0.000010268499,0.000010858405,0.000014349658,0.000006942278,0.97093326,0.0010599019,0.027408158,0.00042263043,0.000004977949],"about_ca_topic_score_codex":0.0017160696,"about_ca_topic_score_gemma":0.0027435343,"teacher_disagreement_score":0.004598733,"about_ca_system_score_codex":0.0008325787,"about_ca_system_score_gemma":0.0009268863,"threshold_uncertainty_score":0.015384316},"labels":[],"label_agreement":null},{"id":"W2908074561","doi":"","title":"An Evaluation of Fisher Approximations Beyond Kronecker Factorization","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Kronecker delta; Factorization; Approximations of π; Computer science; Mathematics; Algorithm; Applied mathematics; Physics","score_opus":0.08524321913795825,"score_gpt":0.3911625733095208,"score_spread":0.3059193541715626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908074561","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.19560121,0.007331418,0.76724094,0.002313644,0.0008881685,0.0001677914,0.0012357605,0.0031343587,0.022086723],"genre_scores_gemma":[0.7313046,0.0016073233,0.25736952,0.00041653114,0.00021511581,0.00007585198,0.0026574256,0.000489532,0.0058641327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983089,0.0007930597,0.00007092327,0.00018875553,0.00052189647,0.00011651481],"domain_scores_gemma":[0.99014413,0.006682599,0.00024336838,0.0012699432,0.0014091766,0.00025076538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052201506,0.0010262257,0.0010023644,0.0012069673,0.0006389073,0.0018421743,0.0013286378,0.001728802,0.0064264797],"category_scores_gemma":[0.028171604,0.00026711635,0.00053245283,0.0010590734,0.0007829264,0.004621959,0.0016809554,0.0012848111,0.0010085381],"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.0027729995,0.00049742963,0.0034682234,0.00066896784,0.00030327926,0.00017849752,0.00021089209,0.43456474,0.0049958164,0.11566989,0.023235917,0.41343346],"study_design_scores_gemma":[0.000043157812,0.0001580277,0.00040242932,0.00005544676,0.00003257036,0.00006292139,0.000050551913,0.9692774,0.0015345812,0.02669273,0.0016758033,0.000014453562],"about_ca_topic_score_codex":0.0062884474,"about_ca_topic_score_gemma":0.00846199,"teacher_disagreement_score":0.0064264797,"about_ca_system_score_codex":0.0010405335,"about_ca_system_score_gemma":0.0012108191,"threshold_uncertainty_score":0.027607083},"labels":[],"label_agreement":null},{"id":"W2908176537","doi":"","title":"STOCHASTIC GRADIENT LANGEVIN DYNAMICS THAT EXPLOIT NEURAL NETWORK STRUCTURE","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and Applications","field":"Computer Science","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":"Langevin dynamics; Exploit; Computer science; Artificial neural network; Dynamics (music); Statistical physics; Langevin equation; Artificial intelligence; Physics","score_opus":0.04822018521992996,"score_gpt":0.31713474569678946,"score_spread":0.26891456047685947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908176537","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.04843853,0.0003553477,0.93990016,0.00081023166,0.00039108083,0.000046653367,0.000074714146,0.00025580262,0.009727491],"genre_scores_gemma":[0.8449886,0.00065804255,0.13267174,0.00030892596,0.00019837875,0.00015016658,0.00018339512,0.00029526287,0.020545468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998536,0.000047453577,0.0000062467952,0.000022402703,0.00005031867,0.000020053712],"domain_scores_gemma":[0.99941707,0.00029615726,0.00005985711,0.00006327201,0.00009607019,0.00006772771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006904783,0.0005660939,0.0008443032,0.00040012712,0.0004002794,0.0009884142,0.0011593987,0.0014182181,0.002772211],"category_scores_gemma":[0.0026523883,0.00047777232,0.0005413236,0.00042717453,0.0010097332,0.0016994923,0.0013907341,0.0015952368,0.00039745038],"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.000047151043,0.00006544252,0.0004042109,0.00005209811,0.00004574405,0.00007129319,0.00005431013,0.68732214,0.0031016215,0.29302004,0.0017350684,0.014080802],"study_design_scores_gemma":[0.0000034453078,0.0000049969844,0.000021392903,0.0000018171432,0.000001810556,0.0000057781194,0.0000022613892,0.9834714,0.00011439297,0.01612896,0.00024036442,0.0000033860044],"about_ca_topic_score_codex":0.0017432576,"about_ca_topic_score_gemma":0.0024865745,"teacher_disagreement_score":0.002772211,"about_ca_system_score_codex":0.0006603465,"about_ca_system_score_gemma":0.0008072309,"threshold_uncertainty_score":0.009273946},"labels":[],"label_agreement":null},{"id":"W2908509829","doi":"","title":"Reconstructing evolutionary trajectories of mutations in cancer","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Cancer Genomics and Diagnostics","field":"Biochemistry, Genetics and Molecular Biology","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; Mutation; Genetics; Computational biology; Evolutionary biology; Biology; Gene","score_opus":0.036413581597422716,"score_gpt":0.35180776098204875,"score_spread":0.31539417938462605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908509829","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.8638054,0.0010744086,0.12726186,0.0021919804,0.00011360397,0.00004152733,0.0021703287,0.00088320504,0.002457646],"genre_scores_gemma":[0.97755665,0.00027951706,0.018371074,0.000120429235,0.000031714764,0.000028017854,0.0018383944,0.000090877285,0.001683506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.00012150936,0.000020142828,0.00010367616,0.000039902545,0.0000599303],"domain_scores_gemma":[0.99602747,0.003060404,0.00022385623,0.0002912744,0.00023715766,0.00015998923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012450462,0.00044978427,0.0005415267,0.002204257,0.0005428678,0.0013307673,0.0011700195,0.0013922077,0.0033420427],"category_scores_gemma":[0.008757218,0.0005298202,0.00097436405,0.001572049,0.0006850055,0.001605761,0.00096736423,0.0016300877,0.00050326914],"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.0003026283,0.00013941409,0.041982822,0.00012542644,0.00018872278,0.0003513283,0.00039759983,0.8421104,0.0020527537,0.023813654,0.004704903,0.0838303],"study_design_scores_gemma":[0.000016427355,0.00002370885,0.0019502323,0.000018177496,0.000022909799,0.00005744991,0.00008174916,0.9763376,0.00031321973,0.020489167,0.0006810625,0.000008366788],"about_ca_topic_score_codex":0.0107082855,"about_ca_topic_score_gemma":0.012023596,"teacher_disagreement_score":0.0107082855,"about_ca_system_score_codex":0.0012067695,"about_ca_system_score_gemma":0.0007416748,"threshold_uncertainty_score":0.021291912},"labels":[],"label_agreement":null},{"id":"W2910279493","doi":"","title":"Designing Efficient Neural Attention Systems Towards Achieving Human-level Sharp Vision","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Machine vision; Computer vision","score_opus":0.10085423005369301,"score_gpt":0.3803689614535364,"score_spread":0.2795147313998434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910279493","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.018350812,0.00027561994,0.97763914,0.0001933406,0.000074123614,0.0000807741,0.000038302165,0.0013411433,0.0020066793],"genre_scores_gemma":[0.57761896,0.00037319903,0.41191792,0.00046328155,0.000079688674,0.00017950483,0.00016281313,0.0003500952,0.0088545205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995752,0.00007497917,0.000019994739,0.00014891366,0.000087006236,0.00009388552],"domain_scores_gemma":[0.99960035,0.000112959184,0.00003440559,0.00006719163,0.00014418903,0.00004094627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009293871,0.0009702736,0.0006819749,0.00037594468,0.00047026126,0.001354134,0.0013250376,0.0015664457,0.0048374697],"category_scores_gemma":[0.002374958,0.00060820574,0.000518201,0.00037621194,0.00048502377,0.0017379962,0.0015839512,0.0017147315,0.0015398638],"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.00035681773,0.00030748468,0.0011683799,0.00026971364,0.00015448213,0.00020648487,0.0002981719,0.2714758,0.20698997,0.02099172,0.008236345,0.48954466],"study_design_scores_gemma":[0.000017870289,0.000113101814,0.0003821437,0.000011518115,0.00003102183,0.00005242441,0.000047273832,0.95673627,0.03139345,0.008616323,0.002587712,0.0000108927825],"about_ca_topic_score_codex":0.004159843,"about_ca_topic_score_gemma":0.007266017,"teacher_disagreement_score":0.0048374697,"about_ca_system_score_codex":0.00096604857,"about_ca_system_score_gemma":0.0012312627,"threshold_uncertainty_score":0.016183019},"labels":[],"label_agreement":null},{"id":"W2911248322","doi":"","title":"Learning to Learn with Conditional Class Dependencies","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":55,"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; Université de Sherbrooke; Dalhousie University","funders":"","keywords":"Computer science; Class (philosophy); Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.030354844997369082,"score_gpt":0.3326982328008643,"score_spread":0.30234338780349523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911248322","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.04842542,0.0006465808,0.9442568,0.0017603575,0.00018681076,0.00008439645,0.00066200783,0.0016581294,0.002319618],"genre_scores_gemma":[0.7622771,0.0009484813,0.22037874,0.0013808195,0.00047350064,0.00042973345,0.0042335456,0.00031918788,0.009558821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872833,0.00038837144,0.00007931783,0.00044069145,0.00022710719,0.00013617825],"domain_scores_gemma":[0.99385816,0.004026298,0.0002873745,0.0012099796,0.000456203,0.00016187695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021314947,0.0011276932,0.0013601143,0.0011267145,0.0006107151,0.001425078,0.0022126483,0.0023785853,0.0046918876],"category_scores_gemma":[0.012238502,0.0008557086,0.0013799499,0.0016528284,0.0012983109,0.0062183803,0.0029212406,0.00501928,0.0012192456],"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.00062525977,0.00054335425,0.0059904642,0.00033881242,0.0003574176,0.00022627208,0.0002305695,0.24817966,0.003812747,0.09968732,0.029404523,0.61060363],"study_design_scores_gemma":[0.00004450895,0.000059626338,0.00031521087,0.00002451657,0.00003817727,0.000055584962,0.00002203313,0.9125011,0.0009964675,0.084748,0.00118365,0.000011136984],"about_ca_topic_score_codex":0.0033207703,"about_ca_topic_score_gemma":0.0045208954,"teacher_disagreement_score":0.0046918876,"about_ca_system_score_codex":0.0010803419,"about_ca_system_score_gemma":0.0018476318,"threshold_uncertainty_score":0.01569599},"labels":[],"label_agreement":null},{"id":"W2914442349","doi":"","title":"Multiple-Attribute Text Rewriting.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":192,"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":"Rewriting; Computer science; Programming language; Natural language processing; Information retrieval","score_opus":0.046905022059950514,"score_gpt":0.360655210535885,"score_spread":0.3137501884759345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914442349","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.01230159,0.0014550546,0.94049037,0.0018626414,0.0010479128,0.00031747358,0.0036345369,0.014416498,0.024473904],"genre_scores_gemma":[0.27073085,0.0009528874,0.6695504,0.001020769,0.00048271063,0.0002162384,0.011110617,0.0036845994,0.042250857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661714,0.0011086835,0.00039061913,0.000799555,0.0008811556,0.00020287908],"domain_scores_gemma":[0.9933149,0.0024662728,0.00026177798,0.002632218,0.0011418724,0.00018289326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967766,0.0007864202,0.0009265008,0.0012169651,0.0008655207,0.0021218765,0.0018434674,0.0009564161,0.013955842],"category_scores_gemma":[0.010768398,0.00041975814,0.0013493006,0.0014039215,0.0008746064,0.0037467303,0.0028459572,0.0023750125,0.0076757655],"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.00024638543,0.00039257618,0.0012685962,0.0011795305,0.00027068198,0.00067144993,0.00092506374,0.012806173,0.027623769,0.24766038,0.1201694,0.58678603],"study_design_scores_gemma":[0.00008240078,0.0001402808,0.00078140706,0.00018205159,0.00030166935,0.0010796712,0.00046399204,0.15612927,0.070242554,0.4956906,0.27481192,0.000094109855],"about_ca_topic_score_codex":0.0013343355,"about_ca_topic_score_gemma":0.0028274823,"teacher_disagreement_score":0.013955842,"about_ca_system_score_codex":0.00082212745,"about_ca_system_score_gemma":0.00116045,"threshold_uncertainty_score":0.046686888},"labels":[],"label_agreement":null},{"id":"W2923023063","doi":"","title":"Modeling the Long Term Future in Model-Based Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":18,"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; Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Term (time); Computer science; Artificial intelligence","score_opus":0.05336023462993137,"score_gpt":0.3395181485785783,"score_spread":0.2861579139486469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923023063","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.08642178,0.0007325049,0.90768874,0.0010022697,0.00009572246,0.00003256849,0.00016907745,0.00024714464,0.0036101865],"genre_scores_gemma":[0.96633667,0.0003112814,0.030400256,0.00008139247,0.0000318125,0.00008269882,0.00010697818,0.000032166103,0.0026167687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995641,0.00020412485,0.000020877858,0.000093699426,0.000060948645,0.00005635479],"domain_scores_gemma":[0.99785197,0.0015201746,0.00021298896,0.00010464161,0.00019532182,0.0001148597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015156094,0.0005987287,0.00095210056,0.00042878193,0.00035371535,0.0012816265,0.0012628008,0.0011486515,0.0026144835],"category_scores_gemma":[0.006533797,0.0005099331,0.00045607673,0.00051269826,0.0010309039,0.0023575402,0.0010672596,0.0018679508,0.0002447881],"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.00004797834,0.000023015717,0.00052175875,0.000029881026,0.000020905167,0.00003467367,0.000042402928,0.9583411,0.00020896866,0.032673415,0.00031934158,0.007736503],"study_design_scores_gemma":[0.000006006694,0.000009444351,0.00003693736,0.0000034463158,0.000004091029,0.000004182461,0.00000364058,0.98543996,0.000039621653,0.01435796,0.00009193231,0.000002745026],"about_ca_topic_score_codex":0.0086563965,"about_ca_topic_score_gemma":0.008916649,"teacher_disagreement_score":0.0086563965,"about_ca_system_score_codex":0.0012342923,"about_ca_system_score_gemma":0.000968948,"threshold_uncertainty_score":0.017211974},"labels":[],"label_agreement":null},{"id":"W2923289556","doi":"","title":"A new dog learns old tricks: RL finds classic optimization algorithms","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"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; Optimization algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.04493808541385731,"score_gpt":0.3381104561314346,"score_spread":0.2931723707175773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923289556","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.048512407,0.0014246234,0.9331961,0.0021596164,0.00048630295,0.000083258055,0.000082665225,0.0016756544,0.012379462],"genre_scores_gemma":[0.662826,0.0006090869,0.31544378,0.0010921197,0.000483449,0.00018805522,0.00016412046,0.00058036787,0.018613094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993144,0.00023023882,0.000041867068,0.0002089211,0.0001412006,0.00006338714],"domain_scores_gemma":[0.99745053,0.0014461104,0.00015224771,0.00057089765,0.0002581336,0.00012209752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002395501,0.0012072639,0.0016233635,0.00088584755,0.0005813155,0.0017341807,0.0020747248,0.0036118787,0.0067179725],"category_scores_gemma":[0.010002784,0.0008027235,0.0007612329,0.0006584379,0.0024347014,0.0048299255,0.0024503036,0.0026872824,0.0013833308],"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.00045876368,0.00028233117,0.0025787638,0.00039829206,0.00028165602,0.00018508156,0.00027369094,0.47095832,0.004040535,0.11025961,0.014289633,0.3959934],"study_design_scores_gemma":[0.00006663352,0.00009826341,0.00015726291,0.00003513219,0.000032453936,0.00008162545,0.000028108188,0.93972915,0.0008650038,0.056401905,0.0024892362,0.000015265754],"about_ca_topic_score_codex":0.0015183375,"about_ca_topic_score_gemma":0.0016723091,"teacher_disagreement_score":0.0067179725,"about_ca_system_score_codex":0.0007839406,"about_ca_system_score_gemma":0.0010029433,"threshold_uncertainty_score":0.022473872},"labels":[],"label_agreement":null},{"id":"W2934497975","doi":"","title":"Classifier with Hierarchical Topographical Maps as Internal Representation.","year":2015,"lang":"en","type":"article","venue":"International Conference on Learning Representations","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":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Classifier (UML); Pattern recognition (psychology); Machine learning; Data mining","score_opus":0.07523832574978477,"score_gpt":0.35001370036302765,"score_spread":0.27477537461324286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934497975","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.05843187,0.0014018641,0.91862935,0.0008145627,0.00040201942,0.00020945871,0.0019070614,0.004029466,0.014174302],"genre_scores_gemma":[0.74056286,0.00062968757,0.239806,0.00043103413,0.00025700586,0.00024405484,0.004366242,0.0002239569,0.013479289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999703,0.000056966455,0.000016854321,0.000074283525,0.00008862486,0.000060272403],"domain_scores_gemma":[0.9994165,0.00017682221,0.00004096944,0.00013918288,0.00019062473,0.000035965506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048028099,0.0004590144,0.00067955203,0.00087163056,0.0003864182,0.0012976236,0.0012540473,0.0011900977,0.0047264015],"category_scores_gemma":[0.0024962907,0.00021559803,0.0006764157,0.0010659731,0.00027765587,0.0016961118,0.00095351133,0.0009039704,0.0026050787],"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.0003734777,0.0001897902,0.0024589784,0.00021038213,0.00016403808,0.00019333277,0.0001001022,0.08804378,0.018331015,0.020656848,0.040386457,0.8288918],"study_design_scores_gemma":[0.000027830105,0.00008780116,0.000994657,0.000028638735,0.000053262174,0.00012442257,0.00006116341,0.966575,0.0061141867,0.02134438,0.0045740283,0.000014588031],"about_ca_topic_score_codex":0.003633959,"about_ca_topic_score_gemma":0.004548136,"teacher_disagreement_score":0.0047264015,"about_ca_system_score_codex":0.00044565002,"about_ca_system_score_gemma":0.00077323127,"threshold_uncertainty_score":0.015811443},"labels":[],"label_agreement":null},{"id":"W2941011530","doi":"","title":"Reward Estimation for Variance Reduction in Deep Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","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":"McGill University","funders":"","keywords":"Reinforcement learning; Variance reduction; Reduction (mathematics); Computer science; Variance (accounting); Estimation; Artificial intelligence; Reinforcement; Machine learning; Statistics; Econometrics; Psychology; Mathematics; Engineering; Economics; Social psychology","score_opus":0.050061910459263996,"score_gpt":0.3514664291660533,"score_spread":0.3014045187067893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941011530","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.01240243,0.00022381908,0.9860772,0.00019185952,0.00004150278,0.000032927543,0.00003308846,0.00032204998,0.0006751623],"genre_scores_gemma":[0.8297433,0.00017739904,0.16629362,0.00021852128,0.000071182505,0.00020104398,0.00014918821,0.00019791274,0.0029478313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910563,0.00035871452,0.000049421677,0.00016258289,0.00019937176,0.00012420745],"domain_scores_gemma":[0.9969207,0.002177949,0.0001786062,0.00018059957,0.00043165236,0.00011055908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025791873,0.00092977023,0.0015190844,0.00051068707,0.00036331706,0.00091552874,0.001321208,0.001285382,0.0025169428],"category_scores_gemma":[0.00972312,0.00074545795,0.0005431139,0.0004297151,0.000930149,0.0012221227,0.0016563904,0.0026558873,0.00037220013],"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.0002384946,0.00015650017,0.0007556694,0.00011418948,0.000074379306,0.000040070594,0.00006098998,0.8548338,0.003151075,0.020109175,0.0020622534,0.11840348],"study_design_scores_gemma":[0.0000066961584,0.000014136576,0.000041486317,0.000004169227,0.0000033705323,0.0000030853294,0.0000013666319,0.995622,0.00029792025,0.0039321748,0.00007091211,0.000002669598],"about_ca_topic_score_codex":0.0036557694,"about_ca_topic_score_gemma":0.0041019507,"teacher_disagreement_score":0.0036557694,"about_ca_system_score_codex":0.0010921587,"about_ca_system_score_gemma":0.0015437132,"threshold_uncertainty_score":0.013640165},"labels":[],"label_agreement":null},{"id":"W2941951382","doi":"","title":"Jointly Learning \"What\" and \"How\" from Instructions and Goal-States.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Complex Systems and Decision Making","field":"Decision Sciences","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":"Computer science; Goal orientation; Human–computer interaction; Psychology","score_opus":0.1641833945764254,"score_gpt":0.4275655808461489,"score_spread":0.2633821862697235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941951382","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.23396377,0.0011218822,0.7476788,0.0039238622,0.00030456117,0.0003296073,0.0017729144,0.001791803,0.00911277],"genre_scores_gemma":[0.9160888,0.00038824775,0.078839004,0.00039038298,0.000042297565,0.0002312045,0.0015022362,0.00008541329,0.0024324742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991365,0.00040886799,0.000048063277,0.00023626031,0.00007596882,0.00009423957],"domain_scores_gemma":[0.9942778,0.0044413656,0.00035078215,0.0004161295,0.00027828987,0.0002356571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018360898,0.00085633586,0.00095068564,0.0005002789,0.00027980228,0.0014853496,0.0009825601,0.00129383,0.0033867403],"category_scores_gemma":[0.018623736,0.00048258467,0.0007202866,0.00055710133,0.0006545428,0.0034408302,0.0015988232,0.0035538631,0.0006702199],"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.0021105423,0.0012459108,0.018538209,0.00078928104,0.00056133926,0.00017162957,0.0007838946,0.25597373,0.008600392,0.04458825,0.013953143,0.6526837],"study_design_scores_gemma":[0.00013075679,0.0003085703,0.004087663,0.00014051843,0.00017113726,0.000047000758,0.0002285974,0.83226484,0.006809406,0.15282053,0.002926394,0.00006451502],"about_ca_topic_score_codex":0.004674305,"about_ca_topic_score_gemma":0.0066175773,"teacher_disagreement_score":0.004674305,"about_ca_system_score_codex":0.0007704708,"about_ca_system_score_gemma":0.0025784343,"threshold_uncertainty_score":0.01132977},"labels":[],"label_agreement":null},{"id":"W2942197587","doi":"","title":"Evaluating visual \"common sense\" using fine-grained classification and captioning tasks.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Human Pose and Action Recognition","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":"Université de Montréal; University of Toronto; University of British Columbia","funders":"","keywords":"Closed captioning; Computer science; Natural language processing; Artificial intelligence; Image (mathematics)","score_opus":0.20220410973093644,"score_gpt":0.46163012006877796,"score_spread":0.2594260103378415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942197587","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.6753653,0.011937531,0.24397819,0.0014576638,0.0022651283,0.0014208577,0.011718194,0.016138839,0.035718292],"genre_scores_gemma":[0.9102537,0.0009222656,0.06849702,0.00035477604,0.0003456546,0.00023286292,0.015556246,0.0004723583,0.0033651805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947807,0.0014645843,0.0004400813,0.0019218753,0.0010019055,0.00039078476],"domain_scores_gemma":[0.98848385,0.0052306843,0.0010561713,0.0024300236,0.0020614653,0.00073788816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046049473,0.0026743487,0.0014256142,0.0050657606,0.0010879397,0.004313113,0.0022655872,0.004269321,0.007236435],"category_scores_gemma":[0.0266822,0.00040671573,0.0014362569,0.0027447022,0.0011781013,0.007572825,0.0033344214,0.0017973123,0.0026132553],"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.0044183247,0.0012808625,0.019958368,0.0019059887,0.0011663737,0.00073148607,0.0007101825,0.021399222,0.055488925,0.005156048,0.050842967,0.8369413],"study_design_scores_gemma":[0.00071064284,0.0038457753,0.062155478,0.0006178354,0.0012089722,0.0025919639,0.0029859862,0.8076524,0.060793318,0.03634918,0.020782873,0.00030565765],"about_ca_topic_score_codex":0.0072709103,"about_ca_topic_score_gemma":0.0072156535,"teacher_disagreement_score":0.0072709103,"about_ca_system_score_codex":0.0011712639,"about_ca_system_score_gemma":0.0010584212,"threshold_uncertainty_score":0.024353623},"labels":[],"label_agreement":null},{"id":"W2943085977","doi":"","title":"Brief Report: Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Natural Language Processing 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":"Université de Montréal","funders":"","keywords":"Computer science; Parsing; Artificial intelligence; Language model; Syntax; Tree structure; Tree (set theory); Recurrent neural network; Natural language processing; Artificial neural network; Machine learning; Algorithm; Binary tree; Mathematics","score_opus":0.024539682217917903,"score_gpt":0.3385625186261699,"score_spread":0.31402283640825196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943085977","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.010509123,0.00828914,0.9541781,0.006498829,0.0042559197,0.00018268319,0.0011871975,0.0056194854,0.00927952],"genre_scores_gemma":[0.21922538,0.016641518,0.6895276,0.0023401624,0.00784137,0.0006383728,0.0066240104,0.0027900892,0.054371506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00015961789,0.000033524477,0.00013636927,0.00012340103,0.000037607133],"domain_scores_gemma":[0.9985386,0.0005917597,0.00007602944,0.00016337131,0.00047719633,0.00015295953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016584488,0.0009426411,0.0005741089,0.00041615934,0.00030892537,0.001765604,0.0020482088,0.0016476661,0.012259628],"category_scores_gemma":[0.005938718,0.0005749714,0.00080955453,0.00083453144,0.0005057819,0.0030927071,0.0011551776,0.0028124496,0.0065994244],"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.00037045073,0.00019476611,0.0028497633,0.0007383519,0.00038735825,0.00043947579,0.0003129715,0.16321978,0.009265589,0.06760303,0.1788181,0.5758004],"study_design_scores_gemma":[0.00008673592,0.00018245251,0.0007715387,0.00012529723,0.0001488427,0.00018315979,0.00004161222,0.8435679,0.005999983,0.08034243,0.068455316,0.00009473332],"about_ca_topic_score_codex":0.0047739013,"about_ca_topic_score_gemma":0.004541619,"teacher_disagreement_score":0.012259628,"about_ca_system_score_codex":0.00071379094,"about_ca_system_score_gemma":0.0008009113,"threshold_uncertainty_score":0.041012585},"labels":[],"label_agreement":null},{"id":"W2962719937","doi":"","title":"SELF-INFORMED NEURAL NETWORK STRUCTURE LEARNING","year":2015,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and Data Classification","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":"Computer science; Artificial intelligence; Classifier (UML); Artificial neural network; Cognitive neuroscience of visual object recognition; Visualization; Pattern recognition (psychology); Machine learning; Task (project management); Similarity (geometry); Object (grammar); Image (mathematics)","score_opus":0.06063609321300034,"score_gpt":0.35074877230090973,"score_spread":0.2901126790879094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962719937","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.17156115,0.00043289922,0.82238233,0.001002016,0.0000831367,0.000060153972,0.0001661473,0.0012709827,0.0030411186],"genre_scores_gemma":[0.8873229,0.0001251352,0.10733295,0.00028001177,0.00011002081,0.00011817747,0.00039786883,0.00009774561,0.004215215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943703,0.00016844351,0.000017978431,0.0002020794,0.00010959397,0.00006483148],"domain_scores_gemma":[0.9966192,0.0021394137,0.00033822813,0.00044561634,0.00035365307,0.00010383875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016422123,0.00096736604,0.0011608999,0.00063054083,0.0006202736,0.0011607524,0.0027801793,0.0023283793,0.0020208096],"category_scores_gemma":[0.0059633153,0.0007778795,0.0006462042,0.00078416365,0.0014680751,0.0031394497,0.001815496,0.0020859027,0.00055092265],"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.00008554048,0.00006841032,0.0010479654,0.00004808262,0.000038030536,0.00007542817,0.000047470352,0.95321625,0.0018019475,0.005962466,0.0012104292,0.036397927],"study_design_scores_gemma":[0.0000025675045,0.000006967397,0.000030573017,8.953839e-7,0.0000013480188,0.0000035009089,0.000001711278,0.9973435,0.00021831023,0.0023494523,0.00004002415,0.0000011904599],"about_ca_topic_score_codex":0.0037023847,"about_ca_topic_score_gemma":0.0051013622,"teacher_disagreement_score":0.0037023847,"about_ca_system_score_codex":0.001207704,"about_ca_system_score_gemma":0.0007524073,"threshold_uncertainty_score":0.008762598},"labels":[],"label_agreement":null},{"id":"W2962876041","doi":"","title":"An Exploration of Softmax Alternatives Belonging to the Spherical Loss Family","year":2016,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":30,"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":"Softmax function; Probabilistic logic; Function (biology); Categorical variable; MNIST database; Computer science; Range (aeronautics); Mathematics; Algorithm; Artificial neural network; Artificial intelligence; Pattern recognition (psychology); Discrete mathematics; Machine learning; Engineering","score_opus":0.10429671052686768,"score_gpt":0.37495094648723215,"score_spread":0.2706542359603645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962876041","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.026206324,0.0013991396,0.9643712,0.0014856552,0.00006074282,0.000058397974,0.00009479252,0.00059051684,0.0057331547],"genre_scores_gemma":[0.7324584,0.002283612,0.2556267,0.0013948715,0.00022007209,0.0003368707,0.0005112169,0.00068506366,0.006483323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969199,0.0018819305,0.00016631823,0.0003123545,0.0005415376,0.00017798186],"domain_scores_gemma":[0.99450064,0.003863962,0.00030847624,0.0005327034,0.0005707045,0.00022352862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007464447,0.0016352456,0.0011225989,0.0012305962,0.00053175085,0.0024032714,0.002021552,0.0017757685,0.0031889235],"category_scores_gemma":[0.017089667,0.00051039923,0.0012908378,0.0012411582,0.001624844,0.004285737,0.003324156,0.003243951,0.001385185],"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.00074717664,0.00033011258,0.0019182204,0.00038532726,0.00018108207,0.00025051748,0.00029626497,0.5057165,0.0057495707,0.22384587,0.008905797,0.25167367],"study_design_scores_gemma":[0.000028625489,0.000126225,0.00027628534,0.00006327845,0.000021171601,0.000107273794,0.000055542678,0.9342073,0.0017338791,0.061275203,0.0020837118,0.000021560762],"about_ca_topic_score_codex":0.0015684456,"about_ca_topic_score_gemma":0.0016462784,"teacher_disagreement_score":0.007464447,"about_ca_system_score_codex":0.0015902641,"about_ca_system_score_gemma":0.001124616,"threshold_uncertainty_score":0.039476275},"labels":[],"label_agreement":null},{"id":"W2962985403","doi":"","title":"Universal Successor Representations for Transfer Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Initialization; Successor cardinal; Artificial intelligence; Set (abstract data type); Transfer of learning; Focus (optics); Function (biology); Machine learning; Reinforcement; Value (mathematics); Mathematics; Programming language","score_opus":0.057285571163360936,"score_gpt":0.34720038236061634,"score_spread":0.28991481119725543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962985403","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.024776345,0.0003484821,0.9707762,0.00027115596,0.000056698136,0.000048753664,0.000065386674,0.00074205,0.0029149747],"genre_scores_gemma":[0.8784943,0.00029742578,0.11664903,0.00019692627,0.00003879576,0.0002539477,0.00018516454,0.00010830671,0.003776105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950695,0.00019190062,0.000029338373,0.000117438016,0.00009533032,0.000059132923],"domain_scores_gemma":[0.9985262,0.0007918054,0.00014902448,0.0002620974,0.00017771001,0.00009309008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015603653,0.0007799943,0.0009175434,0.0004774175,0.00029276538,0.0008244071,0.0011304531,0.001103663,0.0036814706],"category_scores_gemma":[0.006114143,0.00033014014,0.0005086372,0.00038234328,0.0011982545,0.0021629331,0.0013924284,0.001996082,0.0005133658],"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.00013433432,0.00012717342,0.00073440856,0.00015519475,0.000055817334,0.00012464708,0.00019967122,0.75987417,0.0026822116,0.113068335,0.0021882732,0.12065583],"study_design_scores_gemma":[0.000012171304,0.00004215223,0.00005505778,0.000012627292,0.000006018766,0.000017950833,0.00000837243,0.95071477,0.00049500354,0.048018727,0.0006098914,0.000007313164],"about_ca_topic_score_codex":0.0013193475,"about_ca_topic_score_gemma":0.001420355,"teacher_disagreement_score":0.0036814706,"about_ca_system_score_codex":0.00095114636,"about_ca_system_score_gemma":0.0009395495,"threshold_uncertainty_score":0.01231581},"labels":[],"label_agreement":null},{"id":"W2963117168","doi":"","title":"Negative eigenvalues of the Hessian in deep neural networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Hessian matrix; Eigenvalues and eigenvectors; Deep learning; Artificial neural network; Deep neural networks; Function (biology); Computer science; Hessian equation; Artificial intelligence; Matrix (chemical analysis); Work (physics); Applied mathematics; Mathematical optimization; Mathematics; Engineering; Mathematical analysis; Physics","score_opus":0.03369257548278821,"score_gpt":0.3082430648912333,"score_spread":0.2745504894084451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963117168","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.22615848,0.0018984334,0.75995964,0.0017906461,0.00007732054,0.000034978126,0.00018023486,0.00039050792,0.009509754],"genre_scores_gemma":[0.94989043,0.0012320648,0.042043354,0.0001738196,0.00009297844,0.0000736603,0.00014895976,0.00017736304,0.0061673876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963,0.00014915137,0.0000137028765,0.00005522128,0.000108931185,0.00004306014],"domain_scores_gemma":[0.9974584,0.0017600686,0.00024670616,0.00013493522,0.0002593185,0.00014060515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012570358,0.0006195534,0.00047991233,0.00060229586,0.00037604966,0.0011535266,0.00050020043,0.00079080433,0.001863847],"category_scores_gemma":[0.007006197,0.00052127097,0.00026770963,0.00037452005,0.0020507816,0.001948011,0.00096650375,0.0013242591,0.00024256171],"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.00013877137,0.00006695759,0.0022597357,0.0001968695,0.00003509232,0.0002891582,0.00023396107,0.60268134,0.009521049,0.35123828,0.004445792,0.028892992],"study_design_scores_gemma":[0.0000076192146,0.0000240153,0.0006697435,0.00002413149,0.0000031556424,0.000051325263,0.000042527052,0.8260779,0.0009053441,0.17168899,0.00048834365,0.000016897906],"about_ca_topic_score_codex":0.002178755,"about_ca_topic_score_gemma":0.0020435085,"teacher_disagreement_score":0.002178755,"about_ca_system_score_codex":0.0006441609,"about_ca_system_score_gemma":0.00049338717,"threshold_uncertainty_score":0.006647885},"labels":[],"label_agreement":null},{"id":"W2963200642","doi":"","title":"Sparsely-Connected Neural Networks: Towards Efficient VLSI Implementation of Deep Neural Networks","year":2016,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","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":"McGill University","funders":"","keywords":"MNIST database; Computer science; Artificial neural network; Deep learning; Convolutional neural network; Artificial intelligence; Energy consumption","score_opus":0.05047194812276975,"score_gpt":0.3403865215796997,"score_spread":0.28991457345692995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963200642","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.047078133,0.0022472534,0.9373922,0.0004895764,0.00015356368,0.00009506222,0.0002023209,0.0039137364,0.008428113],"genre_scores_gemma":[0.5642166,0.0013409,0.42775947,0.00032085253,0.00007991892,0.0001527691,0.00055325316,0.00014734583,0.0054289727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998042,0.000033288,0.000012912926,0.000027992515,0.00009633626,0.000025382686],"domain_scores_gemma":[0.9997936,0.00006203964,0.000022908765,0.000039978633,0.00007097674,0.000010489427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025420848,0.0005460451,0.0002641449,0.000386537,0.00015670912,0.00052520825,0.0013401239,0.00045303867,0.0034684238],"category_scores_gemma":[0.00077022857,0.0002591617,0.00021017608,0.00050677813,0.00025860264,0.0009850365,0.00037814712,0.000588636,0.00075435],"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.0003432179,0.00015306224,0.0009622047,0.00070799317,0.000118546086,0.00024253313,0.0001368827,0.20865506,0.11627701,0.04586663,0.014291072,0.6122458],"study_design_scores_gemma":[0.00004099083,0.00019052139,0.0002959158,0.0000376181,0.00003399731,0.00011592463,0.00002279852,0.94096184,0.034063734,0.011204411,0.013017609,0.00001464235],"about_ca_topic_score_codex":0.0022206022,"about_ca_topic_score_gemma":0.0050928383,"teacher_disagreement_score":0.0034684238,"about_ca_system_score_codex":0.0005052689,"about_ca_system_score_gemma":0.00061751483,"threshold_uncertainty_score":0.011603057},"labels":[],"label_agreement":null},{"id":"W2963202404","doi":"","title":"FigureQA: An Annotated Figure Dataset for Visual Reasoning","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":16,"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; Polytechnique Montréal","funders":"","keywords":"Computer science; Plot (graphics); Visual reasoning; Artificial intelligence; Task (project management); Intersection (aeronautics); Bar chart; Scatter plot; Bounding overwatch; Minimum bounding box; Natural language processing; Smoothness; Baseline (sea); Machine learning; Line (geometry); Image (mathematics); Mathematics","score_opus":0.07102971897405239,"score_gpt":0.44039492234294464,"score_spread":0.3693652033688922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963202404","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020272039,0.0035670933,0.027735077,0.0015299884,0.00053711794,0.0009825759,0.88375705,0.039788935,0.02183005],"genre_scores_gemma":[0.03110679,0.0005694341,0.049956262,0.0005693065,0.0000579706,0.00084085425,0.9091921,0.0016312818,0.0060759075],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985121,0.0003153567,0.00016310561,0.0004886497,0.0004116543,0.0001092068],"domain_scores_gemma":[0.9968162,0.0015438223,0.000179866,0.0006713833,0.00058972865,0.00019890864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000887662,0.002859113,0.00086360914,0.00413312,0.000972986,0.0020639729,0.0035360325,0.003981805,0.052810386],"category_scores_gemma":[0.009019935,0.0006298453,0.0018177312,0.0032333082,0.0008155882,0.0031556725,0.002465477,0.0021736524,0.027491922],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044934495,0.00027775823,0.0029234488,0.003242444,0.00011587037,0.0009652507,0.00052553747,0.0043058144,0.004877331,0.0054303203,0.91365856,0.0632283],"study_design_scores_gemma":[0.0004486044,0.00018594164,0.010878204,0.0008809539,0.00008508272,0.0013777225,0.0011094688,0.042451795,0.0075393994,0.015679345,0.9192148,0.0001486458],"about_ca_topic_score_codex":0.023210132,"about_ca_topic_score_gemma":0.049342487,"teacher_disagreement_score":0.052810386,"about_ca_system_score_codex":0.0020678835,"about_ca_system_score_gemma":0.0012806132,"threshold_uncertainty_score":0.17666835},"labels":[],"label_agreement":null},{"id":"W2963285940","doi":"","title":"Graph HyperNetworks for Neural Architecture Search.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":53,"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; Inference; Architecture; Artificial neural network; Network topology; Graph; Network architecture; Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.05905441561582941,"score_gpt":0.3606030764095502,"score_spread":0.3015486607937208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963285940","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.015947558,0.0031966735,0.9635879,0.0010508031,0.00023746623,0.00019292449,0.0012052247,0.004726764,0.009854648],"genre_scores_gemma":[0.34938473,0.0024195793,0.6286605,0.0010033733,0.0002700809,0.0009684924,0.0045426427,0.0012003196,0.011550292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940085,0.00020971693,0.000037997597,0.00016601782,0.00013697366,0.00004840369],"domain_scores_gemma":[0.9982804,0.0010166026,0.0001648786,0.00029976052,0.00016919244,0.00006918526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011930418,0.0016040838,0.0008319978,0.0020007133,0.00070298964,0.001310878,0.002299222,0.0019282803,0.010990633],"category_scores_gemma":[0.008123529,0.0008549719,0.0012699328,0.0015881358,0.0009339654,0.003177151,0.0014068512,0.0026227415,0.0024722926],"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.00014667147,0.00011320445,0.0018976149,0.00048110262,0.00020496624,0.00014635947,0.00009531725,0.63071805,0.0020357466,0.10114713,0.021446612,0.24156722],"study_design_scores_gemma":[0.000025482104,0.00002994273,0.0001312608,0.000036539426,0.000020132644,0.000040463245,0.000016641943,0.90710217,0.0006451942,0.086964756,0.0049770735,0.000010270547],"about_ca_topic_score_codex":0.004810816,"about_ca_topic_score_gemma":0.013023879,"teacher_disagreement_score":0.010990633,"about_ca_system_score_codex":0.0016158159,"about_ca_system_score_gemma":0.0013472423,"threshold_uncertainty_score":0.036767304},"labels":[],"label_agreement":null},{"id":"W2963359059","doi":"","title":"Variational Message Passing with Structured Inference Networks.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Inference; Graphical model; Computer science; Message passing; Theoretical computer science; Approximate inference; Variable elimination; Probabilistic logic; Algorithm; Artificial intelligence; Programming language","score_opus":0.028791537379196184,"score_gpt":0.3079606261640736,"score_spread":0.2791690887848774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963359059","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.00137434,0.00016590444,0.99717844,0.00021420383,0.000030925155,0.00003343673,0.000063682244,0.00022798443,0.0007110005],"genre_scores_gemma":[0.2563048,0.0007288526,0.7331628,0.00068807986,0.0003291746,0.00059040013,0.000755826,0.00047091304,0.0069691776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981281,0.0009805523,0.00008834814,0.00035711162,0.0003232917,0.0001225158],"domain_scores_gemma":[0.9938508,0.0047997576,0.00034082145,0.0005307423,0.00029938563,0.00017841009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042506433,0.0017260219,0.0014833729,0.0013182893,0.0006896806,0.001674892,0.0035099618,0.0027146174,0.005148088],"category_scores_gemma":[0.015396798,0.0014603204,0.0017298771,0.001289437,0.0022713363,0.0040026214,0.0032110664,0.0045900973,0.0009937203],"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.00007646004,0.000053170883,0.00041977337,0.00012467205,0.0001168108,0.00007604489,0.00011253614,0.662225,0.00080711325,0.29016688,0.0025574858,0.043264013],"study_design_scores_gemma":[0.000008385926,0.000008975977,0.000020555643,0.000007480252,0.00000814022,0.0000116844285,0.0000034627426,0.9048937,0.00024232792,0.09409431,0.00069602,0.0000049512887],"about_ca_topic_score_codex":0.0053345934,"about_ca_topic_score_gemma":0.007839497,"teacher_disagreement_score":0.0053345934,"about_ca_system_score_codex":0.002541747,"about_ca_system_score_gemma":0.0022302512,"threshold_uncertainty_score":0.022479832},"labels":[],"label_agreement":null},{"id":"W2963386218","doi":"","title":"A Structured Self-Attentive Sentence Embedding.","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":365,"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":"Embedding; Sentence; Computer science; Natural language processing; Artificial intelligence; Logical consequence; Regularization (linguistics)","score_opus":0.05458417324847135,"score_gpt":0.3661503131841141,"score_spread":0.31156613993564275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963386218","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.0269405,0.0008884918,0.9651569,0.00058559567,0.00038660684,0.00013061582,0.0009334377,0.0017715411,0.0032063294],"genre_scores_gemma":[0.5320228,0.0010985476,0.44544572,0.00061754714,0.00040204608,0.00029680436,0.003976705,0.00034639108,0.01579355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974674,0.00008131277,0.000015302248,0.00009648712,0.000043541444,0.000016654007],"domain_scores_gemma":[0.9995179,0.00019600929,0.00006180477,0.00008805542,0.00010644845,0.000029737033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038450974,0.00067327364,0.00028888558,0.0006852043,0.00015726266,0.00054339715,0.0007281756,0.00067735463,0.0031482023],"category_scores_gemma":[0.002068233,0.00025170078,0.0006085125,0.0004781448,0.00026133755,0.0018561205,0.00064956327,0.00090409606,0.0013714952],"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.00035737306,0.00037777558,0.0033694443,0.0006048552,0.00022358846,0.00034373344,0.0007884331,0.063860774,0.07697031,0.039438844,0.029190587,0.7844743],"study_design_scores_gemma":[0.000015049276,0.00017462988,0.0015821961,0.000054336742,0.00006841644,0.00023391919,0.00007608756,0.9481597,0.012092609,0.023553086,0.013960749,0.000029140752],"about_ca_topic_score_codex":0.0011365489,"about_ca_topic_score_gemma":0.0021110123,"teacher_disagreement_score":0.0031482023,"about_ca_system_score_codex":0.0003150561,"about_ca_system_score_gemma":0.00034844043,"threshold_uncertainty_score":0.010531783},"labels":[],"label_agreement":null},{"id":"W2963487749","doi":"","title":"Selecting the Best in GANs Family: a Post Selection Inference Framework","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Technology and Data Analysis","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; Selection (genetic algorithm); Inference; Artificial intelligence","score_opus":0.041525398226821275,"score_gpt":0.3655370502695997,"score_spread":0.32401165204277843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963487749","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.006944682,0.00055776996,0.98882294,0.0004146501,0.00011829118,0.00008089608,0.00022259378,0.0014752165,0.0013629282],"genre_scores_gemma":[0.34778067,0.0007458091,0.63313156,0.0012082892,0.0006717123,0.0004829694,0.0026625914,0.0013207246,0.011995668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766254,0.0012306839,0.00009539955,0.00050902326,0.0003348828,0.00016751798],"domain_scores_gemma":[0.99566203,0.0028589442,0.00012697456,0.00064335513,0.0005563761,0.00015219447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052324915,0.0017209519,0.0023865895,0.0014159234,0.0007380128,0.0015880096,0.0037347297,0.0027706388,0.006657686],"category_scores_gemma":[0.010787554,0.0011123128,0.001461567,0.0011411449,0.0008753756,0.0030243103,0.0017262313,0.004494478,0.0021258157],"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.0007657056,0.00052023504,0.003587445,0.00023545344,0.00047768073,0.00022535019,0.00016675572,0.37701213,0.0046896567,0.03978358,0.032287285,0.54024875],"study_design_scores_gemma":[0.000020827049,0.00005110909,0.00013248045,0.000016140573,0.000031108808,0.000033957083,0.00000923724,0.98459953,0.00091139483,0.013142968,0.001043245,0.000008063291],"about_ca_topic_score_codex":0.0026482278,"about_ca_topic_score_gemma":0.0052061984,"teacher_disagreement_score":0.006657686,"about_ca_system_score_codex":0.0007091181,"about_ca_system_score_gemma":0.0012961149,"threshold_uncertainty_score":0.02767241},"labels":[],"label_agreement":null},{"id":"W2963633076","doi":"","title":"Learning to encode motion using spatio-temporal synchrony","year":2014,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; ENCODE; Motion (physics); Motion estimation; Margin (machine learning); Task (project management); Sequence (biology); Machine learning; Pattern recognition (psychology); Computer vision; Fraction (chemistry)","score_opus":0.047976242014673355,"score_gpt":0.3647122563108589,"score_spread":0.31673601429618553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963633076","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.1411099,0.00024262663,0.8566272,0.00039065228,0.000052640647,0.000029251749,0.00008745561,0.000330857,0.0011293441],"genre_scores_gemma":[0.9540981,0.00018217902,0.044102024,0.0000844847,0.000055650922,0.00002581833,0.0001281071,0.000041829746,0.0012818323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997423,0.000068110785,0.000014862702,0.00009383033,0.00004450788,0.000036410063],"domain_scores_gemma":[0.9990133,0.0005220553,0.00019380952,0.00011628499,0.0000750904,0.000079476034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007849363,0.00057071325,0.00045882326,0.00040597047,0.00019367207,0.0005534329,0.00066205167,0.0006292513,0.0014340981],"category_scores_gemma":[0.003918289,0.00027816778,0.00034689857,0.0005062478,0.0006761865,0.0017262561,0.0011317364,0.0011376955,0.00032318712],"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.0004930427,0.00021425684,0.0056878086,0.000116318966,0.000096656455,0.00020567175,0.00016324106,0.6123445,0.055938475,0.029409217,0.0020170514,0.29331383],"study_design_scores_gemma":[0.000007882385,0.000046814563,0.00050976156,0.0000058201495,0.000006106961,0.000025292837,0.000009574888,0.98526037,0.003972413,0.009922896,0.00022782752,0.0000052821256],"about_ca_topic_score_codex":0.0014326853,"about_ca_topic_score_gemma":0.0013216069,"teacher_disagreement_score":0.0014340981,"about_ca_system_score_codex":0.0004364157,"about_ca_system_score_gemma":0.0004553684,"threshold_uncertainty_score":0.0047975183},"labels":[],"label_agreement":null},{"id":"W2963682248","doi":"","title":"Reinterpreting Importance-Weighted Autoencoders","year":2017,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Adversarial Robustness in Machine Learning","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":"University of Toronto","funders":"","keywords":"Upper and lower bounds; Interpretation (philosophy); Computer science; Marginal distribution; Artificial intelligence; Distribution (mathematics); Algorithm; Mathematics; Pattern recognition (psychology); Statistics; Random variable","score_opus":0.04670941002473038,"score_gpt":0.3662012404771157,"score_spread":0.31949183045238533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963682248","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.006738915,0.00018447192,0.98935086,0.00026261812,0.0000686601,0.000015787877,0.000034692464,0.00010415002,0.0032398594],"genre_scores_gemma":[0.60883147,0.00085235114,0.37683627,0.0005100702,0.00033602904,0.00014452994,0.00024041769,0.00044834326,0.011800517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864227,0.00044841095,0.00007432475,0.00025621982,0.0004487104,0.0001301474],"domain_scores_gemma":[0.99684334,0.0017483091,0.0002735024,0.0005307128,0.0004816942,0.00012236173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031273137,0.0011955468,0.0007647404,0.0010203287,0.00038166466,0.0018109736,0.0016959397,0.0015993835,0.0032047294],"category_scores_gemma":[0.011908533,0.00068870455,0.00062027626,0.0007149316,0.0019781422,0.003371305,0.0030203264,0.0031047713,0.0006458681],"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.000052104926,0.000045720426,0.0005308836,0.00011123766,0.000054079836,0.00020079323,0.00012765508,0.35830978,0.0053682355,0.5853602,0.0017269829,0.048112266],"study_design_scores_gemma":[0.000008286458,0.000021148875,0.00013444896,0.000027499336,0.000012615041,0.000050814913,0.000011222339,0.7692196,0.0015593711,0.22741166,0.0015324987,0.0000109542225],"about_ca_topic_score_codex":0.0015205931,"about_ca_topic_score_gemma":0.0027087631,"teacher_disagreement_score":0.0032047294,"about_ca_system_score_codex":0.0009877862,"about_ca_system_score_gemma":0.0008854298,"threshold_uncertainty_score":0.016538978},"labels":[],"label_agreement":null},{"id":"W2963742410","doi":"","title":"DOM-Q-NET: Grounded RL on Structured Language","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Multimodal Machine Learning 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; Reinforcement learning; Artificial intelligence; Task (project management); Machine learning; The Internet; String (physics); Graph; Natural language processing; Theoretical computer science; World Wide Web","score_opus":0.021628009855171406,"score_gpt":0.34219214213863863,"score_spread":0.32056413228346725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963742410","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.014629272,0.00013257562,0.9782696,0.00026018062,0.00006742907,0.000052885825,0.00016773805,0.0030707903,0.0033495969],"genre_scores_gemma":[0.6955812,0.00020482749,0.29443246,0.00051852816,0.000042239768,0.00026955744,0.0006407877,0.00052634935,0.007784131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971384,0.000104587794,0.000012128828,0.00007521633,0.00005296361,0.000041236064],"domain_scores_gemma":[0.9992791,0.0004417508,0.000038579383,0.000089193825,0.00009337445,0.00005802536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564518,0.0008285326,0.0006302873,0.00031090205,0.00038841955,0.00086991553,0.0017078853,0.0012527251,0.004470039],"category_scores_gemma":[0.0032929466,0.00056009623,0.00053745025,0.00027193362,0.001049613,0.0015870446,0.0015639263,0.0018369752,0.0011255909],"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.00013008129,0.0000602173,0.00045259367,0.00005113189,0.000024452622,0.00008480411,0.00005772074,0.93478155,0.0019225556,0.0145398555,0.002216841,0.045678146],"study_design_scores_gemma":[0.000007202314,0.000009002368,0.000015689498,0.000003177802,0.0000014823759,0.0000033603033,0.0000022793006,0.9940783,0.00028291627,0.0053361338,0.00025855514,0.0000019559245],"about_ca_topic_score_codex":0.00942892,"about_ca_topic_score_gemma":0.013238012,"teacher_disagreement_score":0.00942892,"about_ca_system_score_codex":0.0009876103,"about_ca_system_score_gemma":0.0012570017,"threshold_uncertainty_score":0.018748045},"labels":[],"label_agreement":null},{"id":"W2964191424","doi":"","title":"Multimodal Transitions for Generative Stochastic Networks","year":2013,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Bayesian Modeling and Causal 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":"Université de Montréal","funders":"","keywords":"Markov chain; Estimator; Autoregressive model; Computer science; Hidden Markov model; Consistency (knowledge bases); Operator (biology); Probabilistic logic; Artificial intelligence; Probability distribution; Markov model; Cumulative distribution function; Algorithm; Probability density function; Machine learning; Mathematics; Statistics","score_opus":0.05055424772446704,"score_gpt":0.3297161774337315,"score_spread":0.27916192970926446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964191424","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.013717741,0.00020815239,0.98346287,0.00031937295,0.00001943387,0.000027674756,0.00017271223,0.00033217864,0.0017398901],"genre_scores_gemma":[0.7445319,0.00080326427,0.24681792,0.00040623394,0.00013039677,0.00032976337,0.00089297007,0.00046523384,0.0056222454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986425,0.0006415288,0.000056639376,0.00034945877,0.00021982969,0.00008998746],"domain_scores_gemma":[0.9916871,0.006706434,0.00053586013,0.00047538863,0.00037627254,0.00021884014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029411076,0.0007769972,0.000882894,0.0013728942,0.0006297712,0.0015303632,0.0012119038,0.001380619,0.005322154],"category_scores_gemma":[0.016846208,0.00064869464,0.0011900011,0.0009361481,0.0021583675,0.002695188,0.0021515235,0.002791994,0.0005979514],"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.000060754053,0.000029401024,0.0012455187,0.000071123985,0.000040653744,0.000109340515,0.0002289039,0.45578066,0.00088368944,0.51574093,0.0009952041,0.024813836],"study_design_scores_gemma":[0.000004619133,0.0000067194337,0.000115220915,0.000010852309,0.000004743519,0.000020755268,0.000009307593,0.736105,0.00013161855,0.26298857,0.00059441116,0.000008060307],"about_ca_topic_score_codex":0.0047838143,"about_ca_topic_score_gemma":0.0051915273,"teacher_disagreement_score":0.005322154,"about_ca_system_score_codex":0.0022389083,"about_ca_system_score_gemma":0.00091226376,"threshold_uncertainty_score":0.017804384},"labels":[],"label_agreement":null},{"id":"W2964335273","doi":"","title":"How to Construct Deep Recurrent Neural Networks","year":2014,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Music and Audio Processing","field":"Computer Science","cited_by":582,"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":"Recurrent neural network; Computer science; Deep learning; Artificial intelligence; Construct (python library); Feedforward neural network; Feed forward; Function (biology); Artificial neural network; Engineering","score_opus":0.03925941227028947,"score_gpt":0.3147329136198822,"score_spread":0.27547350134959275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964335273","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.011537554,0.0002303031,0.98489153,0.0002966361,0.0000651156,0.000029512916,0.00007707856,0.0009579756,0.0019141732],"genre_scores_gemma":[0.3857969,0.0004550605,0.60731333,0.00036038578,0.00007968955,0.0001317726,0.00041127467,0.0003028155,0.0051487233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996511,0.00009173994,0.000029598048,0.000085720705,0.00009134743,0.000050529998],"domain_scores_gemma":[0.99929404,0.00028451195,0.00007163855,0.00010698817,0.00020385436,0.000039038005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009555257,0.0007502528,0.00053080235,0.0004996305,0.00027979532,0.0008316292,0.0009771748,0.00085589703,0.0035229784],"category_scores_gemma":[0.0035079329,0.00046686188,0.0006068601,0.0003782953,0.00044771706,0.0020411655,0.0010954749,0.001319597,0.0012342692],"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.00015262267,0.00008483396,0.0019861236,0.0002485861,0.00013569531,0.00025783942,0.00018212723,0.5345149,0.01976183,0.0723472,0.007049818,0.36327845],"study_design_scores_gemma":[0.000006741291,0.000023889812,0.000102693404,0.000022623575,0.000013408014,0.0000251038,0.000013192716,0.9756703,0.0033364636,0.018926116,0.0018527576,0.0000068229474],"about_ca_topic_score_codex":0.0025138536,"about_ca_topic_score_gemma":0.0038244617,"teacher_disagreement_score":0.0035229784,"about_ca_system_score_codex":0.00062355085,"about_ca_system_score_gemma":0.0006437092,"threshold_uncertainty_score":0.011785567},"labels":[],"label_agreement":null},{"id":"W2964469479","doi":"","title":"Understanding the Relation Between Maximum-Entropy Inverse Reinforcement Learning and Behaviour Cloning.","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Principle of maximum entropy; Cloning (programming); Artificial intelligence; Computer science; Relation (database); Inverse; Entropy (arrow of time); Mathematics; Machine learning; Data mining; Physics; Thermodynamics","score_opus":0.0945946462711303,"score_gpt":0.3266313768676395,"score_spread":0.2320367305965092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964469479","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.053229,0.00064983784,0.93418616,0.0013381786,0.00007746276,0.000038412876,0.00006988194,0.00015591958,0.0102550415],"genre_scores_gemma":[0.9333039,0.00033418907,0.062095318,0.00021851185,0.000050846214,0.00007349517,0.00008371508,0.000060232644,0.0037797522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992329,0.0003098939,0.000040437615,0.00017573008,0.00015662942,0.00008449442],"domain_scores_gemma":[0.9930681,0.004860662,0.00075286895,0.0006064227,0.00043697905,0.0002749385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014230154,0.0003764164,0.0005857456,0.00049569755,0.00041306266,0.0014669886,0.0015092813,0.0013724674,0.003745248],"category_scores_gemma":[0.014884394,0.00051129813,0.00055554823,0.00037660825,0.0024310749,0.00373569,0.0015809903,0.0022033656,0.00033482845],"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.00012229919,0.00012413583,0.0028785788,0.000169793,0.000091964066,0.00014628294,0.00032357866,0.27294496,0.0046889535,0.6668865,0.0013042123,0.050318804],"study_design_scores_gemma":[0.00000820924,0.00003634731,0.0006175287,0.00001546159,0.000010511159,0.000044491495,0.000023209159,0.5136353,0.0006543813,0.48449287,0.000450441,0.000011368439],"about_ca_topic_score_codex":0.002052657,"about_ca_topic_score_gemma":0.0018385856,"teacher_disagreement_score":0.003745248,"about_ca_system_score_codex":0.0010883678,"about_ca_system_score_gemma":0.0008043373,"threshold_uncertainty_score":0.012529135},"labels":[],"label_agreement":null},{"id":"W2965212561","doi":"","title":"Neural Graph Evolution: Towards Efficient Automatic Robot Design","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Robot; Graph; Artificial intelligence; Artificial neural network; Theoretical computer science; Machine learning","score_opus":0.05089747332137666,"score_gpt":0.3173870093774977,"score_spread":0.266489536056121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965212561","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.0123368185,0.00028451515,0.9837779,0.0001877398,0.000029422417,0.000051790394,0.000041978834,0.0006454199,0.0026444467],"genre_scores_gemma":[0.38192153,0.00043888838,0.61238277,0.0003225056,0.000038784157,0.00031326612,0.00025037196,0.00032890818,0.0040028812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995654,0.0001064259,0.000018349076,0.0000946976,0.00016965743,0.00004544776],"domain_scores_gemma":[0.99924785,0.00040051944,0.00009405468,0.000087994864,0.00013440911,0.000035154382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006796625,0.0009866758,0.0007902243,0.00086592487,0.00037116086,0.00056045456,0.0012878776,0.0010873667,0.0024254909],"category_scores_gemma":[0.002234018,0.00060017727,0.00083968876,0.0006374503,0.0009861783,0.0008744169,0.0009811224,0.0011761497,0.00049158663],"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.000026864984,0.00003387823,0.00043282783,0.000085187654,0.000026829652,0.00005514682,0.000043956483,0.8910605,0.003788872,0.015021123,0.0014992934,0.087925546],"study_design_scores_gemma":[0.0000060337443,0.000014153771,0.00003803579,0.0000048362426,0.0000035734229,0.000010849114,0.0000041277117,0.99285203,0.00040736163,0.005891312,0.0007652099,0.0000025151426],"about_ca_topic_score_codex":0.003939097,"about_ca_topic_score_gemma":0.005183486,"teacher_disagreement_score":0.003939097,"about_ca_system_score_codex":0.0009223709,"about_ca_system_score_gemma":0.0013464687,"threshold_uncertainty_score":0.0081140995},"labels":[],"label_agreement":null},{"id":"W2965465046","doi":"","title":"Learning proposals for sequential importance samplers using reinforced variational inference.","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and Algorithms","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":"McGill University","funders":"","keywords":"Inference; Computer science; Artificial intelligence; Machine learning","score_opus":0.05752040479871633,"score_gpt":0.3716738520567237,"score_spread":0.31415344725800737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965465046","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.008638158,0.0004400722,0.9893523,0.00027098102,0.0001146322,0.00008178483,0.00008651745,0.0003602753,0.00065523986],"genre_scores_gemma":[0.44211584,0.00056727725,0.54778683,0.0005625978,0.00048799353,0.00079042703,0.0011332289,0.00051116996,0.006044552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977252,0.0013397177,0.000096445314,0.00034236227,0.00029290584,0.00020329223],"domain_scores_gemma":[0.9722268,0.024105372,0.0006656387,0.0012135549,0.0010902777,0.0006983842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008636348,0.0013902375,0.0026023176,0.001531719,0.00074352394,0.0018844743,0.004215426,0.0031002436,0.0058848895],"category_scores_gemma":[0.0464287,0.0022681798,0.0014493999,0.0014713662,0.0024463197,0.0041126646,0.003230775,0.0052924,0.0013011248],"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.0010141507,0.00031589283,0.0034951416,0.00038888014,0.00032195792,0.00016555616,0.00036973233,0.6247612,0.0017205207,0.214579,0.009970718,0.14289716],"study_design_scores_gemma":[0.00007654202,0.000030359215,0.000063664076,0.000021862646,0.000017922308,0.00001373771,0.000009225895,0.95443606,0.00020827539,0.04459978,0.0005144307,0.000008162379],"about_ca_topic_score_codex":0.00573525,"about_ca_topic_score_gemma":0.0097742295,"teacher_disagreement_score":0.008636348,"about_ca_system_score_codex":0.0013825223,"about_ca_system_score_gemma":0.0023021891,"threshold_uncertainty_score":0.045673907},"labels":[],"label_agreement":null},{"id":"W2966262171","doi":"","title":"Reproducibility in Machine Learning for Health","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Explainable Artificial Intelligence (XAI)","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; Field (mathematics); Reproducibility; Machine learning; Scale (ratio); Artificial intelligence; Data science; Human health; Medicine","score_opus":0.088447391195338,"score_gpt":0.3988270749660196,"score_spread":0.3103796837706816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966262171","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046867132,0.086713605,0.66011083,0.11259829,0.013903597,0.0029096606,0.006030561,0.0053939596,0.06547231],"genre_scores_gemma":[0.64418316,0.013789275,0.28823242,0.020925425,0.010114238,0.0055563683,0.0053222883,0.003079429,0.008797452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.48799485,0.35657433,0.04082423,0.03209327,0.07976238,0.0027509287],"domain_scores_gemma":[0.076767534,0.69814485,0.02725886,0.15773527,0.038172994,0.0019205447],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.46093076,0.0013602037,0.003361754,0.008808844,0.0042300005,0.02047279,0.0069457525,0.005893373,0.010258556],"category_scores_gemma":[0.8098052,0.0015403375,0.0039793923,0.009165728,0.02012133,0.018481847,0.012796891,0.008120709,0.0037265155],"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.0017361583,0.0003718343,0.052991502,0.015074686,0.0042427224,0.00061105716,0.009603457,0.010594227,0.0023090402,0.28390074,0.04954547,0.56901914],"study_design_scores_gemma":[0.0006588788,0.0011418024,0.025772978,0.01055612,0.001687618,0.0011273985,0.0024099061,0.021453924,0.013046085,0.68747765,0.23419823,0.00046932598],"about_ca_topic_score_codex":0.0019737347,"about_ca_topic_score_gemma":0.001443039,"teacher_disagreement_score":0.53906924,"about_ca_system_score_codex":0.005418624,"about_ca_system_score_gemma":0.016118672,"threshold_uncertainty_score":0.66476834},"labels":[],"label_agreement":null},{"id":"W2966574105","doi":"","title":"Understanding Posterior Collapse in Generative Latent Variable Models","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":78,"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":"Latent variable; Generative grammar; Computer science; Latent variable model; Variable (mathematics); Artificial intelligence; Mathematics","score_opus":0.17610585578987872,"score_gpt":0.3340231839156236,"score_spread":0.15791732812574485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966574105","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.026293816,0.00042612743,0.9696721,0.0009639701,0.00005246225,0.00002852198,0.00029652976,0.0006284046,0.0016380522],"genre_scores_gemma":[0.79550093,0.0011477546,0.19313419,0.00048489266,0.0003263286,0.00021785426,0.0026999863,0.0009345081,0.0055535967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806124,0.0010970305,0.000088504974,0.00032691815,0.00026905147,0.00015728471],"domain_scores_gemma":[0.9714516,0.025526332,0.0007290779,0.0011792216,0.00074367394,0.00036996332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005669981,0.00092152884,0.0014810051,0.0017521456,0.00092208746,0.003908772,0.0021567107,0.0024667273,0.0052564545],"category_scores_gemma":[0.041136336,0.0015761872,0.0017677887,0.0015280872,0.0018711595,0.0054640328,0.003965156,0.0048292265,0.0008923541],"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.00020082282,0.000109780834,0.003949687,0.0002600152,0.00016646988,0.00032094363,0.001566466,0.2964935,0.0016998299,0.62887394,0.006453747,0.05990483],"study_design_scores_gemma":[0.000013573969,0.000008339178,0.0003346339,0.000027562432,0.000017138696,0.00003420374,0.000053069885,0.7263889,0.00022925307,0.27205533,0.00082567986,0.000012356141],"about_ca_topic_score_codex":0.007598369,"about_ca_topic_score_gemma":0.0074245064,"teacher_disagreement_score":0.007598369,"about_ca_system_score_codex":0.0016139031,"about_ca_system_score_gemma":0.0011505581,"threshold_uncertainty_score":0.029986084},"labels":[],"label_agreement":null},{"id":"W2966697812","doi":"","title":"Reproducibility and Stability Analysis in Metric-Based Few-Shot Learning.","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot Learning","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":"Université de Montréal; HEC Montréal","funders":"","keywords":"Reproducibility; Metric (unit); Computer science; Stability (learning theory); Artificial intelligence; Mathematics; Machine learning; Statistics; Engineering","score_opus":0.07488014056526597,"score_gpt":0.34860978593865394,"score_spread":0.27372964537338795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966697812","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.055833526,0.001908354,0.93818253,0.00048576988,0.00024394291,0.00011359804,0.00040188196,0.0014422283,0.0013881684],"genre_scores_gemma":[0.8191258,0.00047101473,0.17353845,0.00031358306,0.00034975083,0.0003279876,0.0027370187,0.001081726,0.002054696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98141676,0.008559635,0.0013373436,0.0049702865,0.0031533162,0.00056256546],"domain_scores_gemma":[0.82711786,0.12362503,0.006814529,0.024956994,0.015265984,0.0022196067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.034734067,0.0012118621,0.002372307,0.0030064918,0.0019971128,0.0034412176,0.0055777715,0.0030754984,0.0017272761],"category_scores_gemma":[0.19347377,0.0009987607,0.0014377745,0.0024400337,0.003942666,0.0067113773,0.004908528,0.004289088,0.0008469405],"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.0032785544,0.0006354977,0.035434958,0.0016750089,0.002043364,0.00053058536,0.0016018051,0.44594553,0.024066512,0.096001156,0.016175477,0.37261155],"study_design_scores_gemma":[0.00003402537,0.00013792436,0.0038545553,0.000049389717,0.00008036629,0.00014017052,0.00009894645,0.9379247,0.006501077,0.050233815,0.00089165935,0.000053374908],"about_ca_topic_score_codex":0.00455617,"about_ca_topic_score_gemma":0.0039027503,"teacher_disagreement_score":0.034734067,"about_ca_system_score_codex":0.0020649622,"about_ca_system_score_gemma":0.00221395,"threshold_uncertainty_score":0.18369353},"labels":[],"label_agreement":null},{"id":"W2994886105","doi":"","title":"Progressive Memory Banks for Incremental Domain Adaptation","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Computer science; Recurrent neural network; Domain adaptation; Parameterized complexity; Domain (mathematical analysis); Artificial intelligence; Artificial neural network; Adaptation (eye); Machine learning; Algorithm","score_opus":0.09777329092838097,"score_gpt":0.3433704679106314,"score_spread":0.24559717698225045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994886105","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.02886549,0.000967464,0.96485436,0.00023447264,0.00009692126,0.00009901079,0.00013195843,0.0027711568,0.001979181],"genre_scores_gemma":[0.7043431,0.0008431091,0.287635,0.00059826684,0.00012068408,0.00036641382,0.0006538995,0.00027366084,0.0051658493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999582,0.000092485,0.00002964179,0.00017387272,0.00007029054,0.000051666975],"domain_scores_gemma":[0.9988728,0.00053546886,0.0000742906,0.00031915976,0.00014650013,0.000051779432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094351225,0.001018469,0.0009135128,0.0007924926,0.0004594618,0.00074315525,0.0024081017,0.0011515701,0.0027722663],"category_scores_gemma":[0.004024582,0.0005767486,0.0008373325,0.0008388838,0.00080901745,0.0034201154,0.0017020273,0.0021789696,0.0012283787],"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.00031223492,0.00032626896,0.0016851892,0.00018061441,0.00012074377,0.00030968306,0.0003367018,0.34571445,0.014080541,0.019560155,0.006245875,0.6111276],"study_design_scores_gemma":[0.000015647776,0.000043566517,0.00016182216,0.000012183874,0.000023278857,0.000063780695,0.000020883179,0.9816913,0.0037773752,0.012285812,0.001891911,0.000012468298],"about_ca_topic_score_codex":0.0048602144,"about_ca_topic_score_gemma":0.005527752,"teacher_disagreement_score":0.0048602144,"about_ca_system_score_codex":0.0007234056,"about_ca_system_score_gemma":0.0009433383,"threshold_uncertainty_score":0.00966388},"labels":[],"label_agreement":null},{"id":"W2995040055","doi":"","title":"Reinforcement Learning with Competitive Ensembles of Information-Constrained Primitives","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","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":"Université de Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Context (archaeology); Generalization; Artificial intelligence; Decomposition; State (computer science); Machine learning; Mathematics","score_opus":0.035859797675240924,"score_gpt":0.28773296694383693,"score_spread":0.251873169268596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995040055","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.2262359,0.00023409443,0.7651577,0.0006098082,0.00007493919,0.0001411488,0.000070871676,0.0008173859,0.006658184],"genre_scores_gemma":[0.96618974,0.000042679156,0.0321318,0.00009137716,0.000015769661,0.0000784876,0.00004150745,0.00002352323,0.0013849831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.00037212085,0.00006275684,0.00023566281,0.0002723764,0.0001819181],"domain_scores_gemma":[0.99698454,0.0014553461,0.00039341985,0.00043739565,0.00036120554,0.00036818287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020807607,0.00079659827,0.0011494237,0.00037480297,0.0004258653,0.0009927446,0.0016709722,0.0010090504,0.0021912812],"category_scores_gemma":[0.006785824,0.00047883755,0.00050670205,0.00033406226,0.0014625682,0.0016961568,0.0016352097,0.0015536249,0.00031184484],"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.00020356945,0.0001322902,0.0009853044,0.000041651576,0.000049378486,0.000066473265,0.00008453937,0.9475821,0.0028116896,0.02088561,0.00055882527,0.026598603],"study_design_scores_gemma":[0.00001801032,0.00003935879,0.000076488875,0.000002341392,0.0000045800625,0.0000061846745,0.0000046367873,0.9928604,0.00034686876,0.0065162624,0.00012066208,0.0000043315963],"about_ca_topic_score_codex":0.004258293,"about_ca_topic_score_gemma":0.0039788634,"teacher_disagreement_score":0.004258293,"about_ca_system_score_codex":0.0013824366,"about_ca_system_score_gemma":0.0014591612,"threshold_uncertainty_score":0.0110042095},"labels":[],"label_agreement":null},{"id":"W2995122033","doi":"","title":"Learning Disentangled Representations for CounterFactual Regression","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Causal Inference Techniques","field":"Mathematics","cited_by":40,"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":"Counterfactual thinking; Leverage (statistics); Computer science; Observational study; Selection bias; Covariate; Machine learning; Selection (genetic algorithm); Econometrics; Population; Model selection; Regression; Artificial intelligence; Statistics; Mathematics; Psychology","score_opus":0.279971621243436,"score_gpt":0.48483052989203934,"score_spread":0.20485890864860334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995122033","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.0081157675,0.0006762504,0.9893189,0.00056567136,0.00004458834,0.000076745935,0.00027304637,0.0003946022,0.0005344184],"genre_scores_gemma":[0.4508722,0.0013976453,0.5392421,0.0009603118,0.00041102196,0.000873602,0.0034283793,0.00020224505,0.0026124825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908924,0.006774746,0.00035456123,0.0010365924,0.0006968404,0.00024478647],"domain_scores_gemma":[0.95002484,0.041008532,0.002395305,0.005133995,0.0010187948,0.00041861684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019216161,0.001696005,0.002600135,0.0022472418,0.0006242189,0.003091718,0.0035422763,0.0027403997,0.0035170622],"category_scores_gemma":[0.06536238,0.00085121795,0.0020360558,0.00300602,0.0017981259,0.004726478,0.003652858,0.0057523325,0.0009987858],"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.0005602501,0.00045873257,0.0066690063,0.0005568768,0.0006243375,0.0001942646,0.00044801692,0.3890463,0.0008707336,0.20928161,0.0061796186,0.38511023],"study_design_scores_gemma":[0.000046769004,0.000056056157,0.00037609637,0.00006870915,0.00004428579,0.000046045152,0.000024343171,0.8266334,0.00038834408,0.17084894,0.001447382,0.000019656087],"about_ca_topic_score_codex":0.002224409,"about_ca_topic_score_gemma":0.0022877064,"teacher_disagreement_score":0.019216161,"about_ca_system_score_codex":0.0016490874,"about_ca_system_score_gemma":0.001963866,"threshold_uncertainty_score":0.10162598},"labels":[],"label_agreement":null},{"id":"W2995128076","doi":"","title":"A Closer Look at the Optimization Landscapes of Generative Adversarial Networks","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Concatenation (mathematics); Computer science; Adversarial system; Generative grammar; Generator (circuit theory); Saddle point; Point (geometry); Visualization; Artificial intelligence; Field (mathematics); Deep learning; Bridge (graph theory); Machine learning; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.0342901584745485,"score_gpt":0.28078537204376,"score_spread":0.24649521356921147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995128076","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.11868618,0.0036523158,0.82370216,0.0055993465,0.00016546286,0.00009154528,0.00031190747,0.0005829511,0.047208223],"genre_scores_gemma":[0.9203123,0.0018994957,0.06734965,0.00064827455,0.00011557708,0.0001365269,0.00025411966,0.0004558411,0.008828393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958557,0.00023840716,0.000011550247,0.000053884516,0.00006933586,0.000041203337],"domain_scores_gemma":[0.9986614,0.0009904881,0.00008770292,0.00008887835,0.00009436828,0.00007706965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013370648,0.00083772035,0.0006761324,0.0008418008,0.00045324294,0.0015729496,0.0005243624,0.0010900799,0.0056558577],"category_scores_gemma":[0.0051791673,0.0004255806,0.0004797374,0.00036240846,0.0013348603,0.002070949,0.0011732666,0.0023490319,0.000488629],"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.00006019635,0.000035996138,0.0010926228,0.00008258431,0.00003515095,0.0001716343,0.00022405923,0.755788,0.0030780993,0.2197618,0.0036378566,0.016031878],"study_design_scores_gemma":[0.000009307613,0.00003287309,0.00053795695,0.00003688465,0.000004600736,0.0000659851,0.000054463133,0.8792903,0.00050332636,0.11697868,0.00247009,0.00001550888],"about_ca_topic_score_codex":0.0017723292,"about_ca_topic_score_gemma":0.0014502808,"teacher_disagreement_score":0.0056558577,"about_ca_system_score_codex":0.00097350666,"about_ca_system_score_gemma":0.0003557454,"threshold_uncertainty_score":0.01892072},"labels":[],"label_agreement":null},{"id":"W2995291884","doi":"","title":"On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":38,"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":"Minimax; Mathematical optimization; Convergence (economics); Gradient descent; Optimization problem; Computer science; Mathematics; Artificial intelligence; Artificial neural network","score_opus":0.06320326867818603,"score_gpt":0.3032700120988561,"score_spread":0.24006674342067008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995291884","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.006154044,0.00039131325,0.98974425,0.0003806731,0.000043646465,0.00003978227,0.000015809059,0.00032454127,0.0029058836],"genre_scores_gemma":[0.4170362,0.00092722685,0.56835407,0.0011164689,0.00021243477,0.00057288405,0.00015435353,0.00078123115,0.010845176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991731,0.00041436768,0.000033444874,0.00013853883,0.00016483932,0.00007567622],"domain_scores_gemma":[0.99761754,0.0016640638,0.00016168423,0.00024839895,0.00020915734,0.00009902862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002471987,0.0013019057,0.0020533204,0.00064186985,0.0007054039,0.0009383641,0.0016379264,0.002090576,0.0037703272],"category_scores_gemma":[0.0069496995,0.0007704822,0.0009347555,0.0006045498,0.0020476163,0.0022437347,0.0025779991,0.0030729393,0.0011524315],"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.00012094122,0.00011278038,0.0008519823,0.00021472915,0.0000898106,0.00016074315,0.0001902709,0.7750995,0.0031295067,0.14077498,0.004915725,0.074339114],"study_design_scores_gemma":[0.000015544152,0.000055135468,0.000044972883,0.000019129211,0.0000060021343,0.000030742456,0.0000116019555,0.9674944,0.0003765194,0.031115254,0.0008230974,0.00000749947],"about_ca_topic_score_codex":0.0014729861,"about_ca_topic_score_gemma":0.002066458,"teacher_disagreement_score":0.0037703272,"about_ca_system_score_codex":0.0006792238,"about_ca_system_score_gemma":0.0013420673,"threshold_uncertainty_score":0.013073266},"labels":[],"label_agreement":null},{"id":"W2995372087","doi":"","title":"Learning the Arrow of Time for Problems in Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","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":"Université de Montréal","funders":"","keywords":"Arrow; Arrow of time; Computer science; Reinforcement learning; Markov decision process; Reachability; Artificial intelligence; Machine learning; Class (philosophy); Function (biology); Markov process; Selection (genetic algorithm); Process (computing); Theoretical computer science; Mathematics","score_opus":0.05955057235187068,"score_gpt":0.3172682931974696,"score_spread":0.2577177208455989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995372087","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.017267097,0.00052513916,0.9798452,0.0008020037,0.000038062295,0.00002315368,0.00004201003,0.000115416085,0.0013418765],"genre_scores_gemma":[0.6324654,0.0012950257,0.3617703,0.00027528196,0.00018418425,0.00020694984,0.00019830784,0.00012396622,0.0034805734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905425,0.0004534036,0.00005860139,0.00023951712,0.00012537376,0.00006882441],"domain_scores_gemma":[0.99496585,0.003940517,0.00041599697,0.0002753604,0.00019657551,0.00020580433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025535454,0.00082421815,0.0008684381,0.00061711064,0.0006274078,0.0017808591,0.0011012885,0.0016217922,0.0035505889],"category_scores_gemma":[0.013876712,0.00041205937,0.0008505912,0.00062356505,0.0027047666,0.005086039,0.0018074982,0.00458183,0.00033410208],"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.00017996978,0.00009638528,0.0014966726,0.00023187054,0.00006269703,0.000071768045,0.0002536391,0.47762123,0.0018029877,0.46125603,0.0014264098,0.055500425],"study_design_scores_gemma":[0.0000148126055,0.000039565315,0.00013896807,0.00002447399,0.0000069241732,0.000012455372,0.000023380922,0.6537325,0.00038823427,0.3446155,0.0009920171,0.000011225374],"about_ca_topic_score_codex":0.0024104628,"about_ca_topic_score_gemma":0.0022557194,"teacher_disagreement_score":0.0035505889,"about_ca_system_score_codex":0.0018671615,"about_ca_system_score_gemma":0.0011765256,"threshold_uncertainty_score":0.013547242},"labels":[],"label_agreement":null},{"id":"W2996067004","doi":"","title":"Generalization of Two-layer Neural Networks: An Asymptotic Viewpoint","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Stochastic Gradient Optimization Techniques","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":"University of Toronto","funders":"","keywords":"Initialization; Generalization; Gradient descent; Layer (electronics); Artificial neural network; Population; Mathematics; Computer science; Flow (mathematics); Applied mathematics; Mathematical analysis; Artificial intelligence; Geometry; Chemistry","score_opus":0.08250555733982355,"score_gpt":0.3510375405511749,"score_spread":0.26853198321135135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996067004","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.048692923,0.00092282164,0.9398533,0.0016862196,0.000093815885,0.000052532174,0.000104658684,0.00039276754,0.008201012],"genre_scores_gemma":[0.8704663,0.0015344784,0.11507168,0.0012969518,0.00040345482,0.00036468927,0.00037071606,0.00038232264,0.010109422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982773,0.00077479176,0.000079197525,0.00033959452,0.00036998533,0.00015903146],"domain_scores_gemma":[0.98980206,0.0061789835,0.0009585062,0.0016706588,0.0009851652,0.0004046933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075998395,0.0013908214,0.0010660808,0.0008918666,0.00058396184,0.0013312084,0.0022722029,0.001883862,0.0027117676],"category_scores_gemma":[0.035369985,0.0007264858,0.0013364041,0.0004957762,0.0028673946,0.0055640857,0.004509371,0.004391959,0.00043023855],"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.0001375122,0.00006594446,0.0024423015,0.00023542327,0.000122262,0.00030757385,0.00026434017,0.52359116,0.0032833542,0.44607577,0.002185014,0.02128946],"study_design_scores_gemma":[0.000008639508,0.00004176541,0.00033184717,0.000028414657,0.000011446254,0.00006755155,0.000018327712,0.87801635,0.0004768461,0.12044589,0.000541192,0.000011678525],"about_ca_topic_score_codex":0.0022486944,"about_ca_topic_score_gemma":0.0013539387,"teacher_disagreement_score":0.0075998395,"about_ca_system_score_codex":0.0019012656,"about_ca_system_score_gemma":0.000819693,"threshold_uncertainty_score":0.040192306},"labels":[],"label_agreement":null},{"id":"W2996068536","doi":"","title":"Language GANs Falling Short","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Topic Modeling","field":"Computer Science","cited_by":89,"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; McGill University","funders":"","keywords":"Softmax function; Computer science; Sample (material); Inference; Metric (unit); Natural language generation; Quality (philosophy); Artificial intelligence; Diversity (politics); Machine learning; Ground truth; Fallacy; Sampling bias; Sample size determination; Statistics; Mathematics; Artificial neural network; Natural language","score_opus":0.09059197135597538,"score_gpt":0.3557337931421951,"score_spread":0.2651418217862197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996068536","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.023175271,0.0018397301,0.95188665,0.001507418,0.00041469143,0.00007170703,0.00070303096,0.0038049794,0.016596366],"genre_scores_gemma":[0.7756114,0.0020342558,0.1863676,0.0025856188,0.0004952698,0.0003153138,0.0028722193,0.0016697226,0.028048638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991036,0.00031588407,0.000036878235,0.00024037359,0.00020204937,0.00010123044],"domain_scores_gemma":[0.9978853,0.001295704,0.000103420025,0.0004374586,0.00019764212,0.00008061722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013926069,0.0009105079,0.00081318367,0.00039708003,0.00029860312,0.001317119,0.0011722283,0.0009872721,0.007294648],"category_scores_gemma":[0.006190041,0.00049282104,0.00074789044,0.00036660617,0.0009094697,0.002724502,0.0017490134,0.0028023713,0.0026293034],"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.0002772564,0.000084975596,0.0016721712,0.00025350985,0.00014729406,0.00023379044,0.00022417582,0.52835166,0.009202289,0.20096654,0.026598502,0.23198786],"study_design_scores_gemma":[0.000019018384,0.00005118941,0.00033382775,0.00003230915,0.000015845359,0.00011710469,0.00002176469,0.89556485,0.002078778,0.09015306,0.011597142,0.000015207294],"about_ca_topic_score_codex":0.0016566851,"about_ca_topic_score_gemma":0.0031437834,"teacher_disagreement_score":0.007294648,"about_ca_system_score_codex":0.0008162557,"about_ca_system_score_gemma":0.00082641625,"threshold_uncertainty_score":0.024403036},"labels":[],"label_agreement":null},{"id":"W2996091952","doi":"","title":"Augmenting Genetic Algorithms with Deep Neural Networks for Exploring the Chemical Space","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning in Materials Science","field":"Materials 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":"Chemical space; Interpretability; Computer science; Genetic algorithm; Discriminator; Artificial neural network; Artificial intelligence; Space (punctuation); Quality control and genetic algorithms; Machine learning; Algorithm; Meta-optimization; Bioinformatics; Drug discovery","score_opus":0.07105698301146753,"score_gpt":0.32163291283718065,"score_spread":0.25057592982571314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996091952","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.027521405,0.0003161245,0.9665412,0.0003073366,0.00006224089,0.00004620439,0.00002714983,0.0005277676,0.0046504643],"genre_scores_gemma":[0.42573768,0.00048229305,0.5697337,0.00033575497,0.00006386094,0.00021951187,0.000107830165,0.0001690338,0.003150283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976283,0.00008068084,0.000012642878,0.000044442837,0.00007795223,0.000021517299],"domain_scores_gemma":[0.9991592,0.000559905,0.00007283074,0.00007482114,0.00011098914,0.000022296143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008097076,0.00081794796,0.0005360117,0.0006679323,0.00033792225,0.00067536155,0.00097478286,0.0012562572,0.0016654704],"category_scores_gemma":[0.0026297972,0.0004113351,0.00046356168,0.0006796521,0.0008039683,0.0010118845,0.0008220518,0.001401196,0.00034180155],"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.000017957207,0.00003824939,0.00037756842,0.00003288018,0.000022411474,0.000031611726,0.000027900867,0.9315053,0.0021499952,0.015488338,0.0004203679,0.04988746],"study_design_scores_gemma":[0.0000053607487,0.000009974202,0.000020643467,0.0000037085044,0.0000037943278,0.0000060213915,0.0000026892014,0.99301034,0.00046330894,0.006030662,0.00044106433,0.000002416311],"about_ca_topic_score_codex":0.0028142128,"about_ca_topic_score_gemma":0.005101171,"teacher_disagreement_score":0.0028142128,"about_ca_system_score_codex":0.0008734076,"about_ca_system_score_gemma":0.0007504437,"threshold_uncertainty_score":0.006336987},"labels":[],"label_agreement":null},{"id":"W2996151541","doi":"","title":"A Constructive Prediction of the Generalization Error Across Scales","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Generalization; Dependency (UML); Computer science; Constructive; Construct (python library); Artificial neural network; Artificial intelligence; Functional dependency; Scale (ratio); Range (aeronautics); Scaling; Generalization error; Machine learning; Algorithm; Theoretical computer science; Data mining; Mathematics; Process (computing)","score_opus":0.0703062179486579,"score_gpt":0.34140394478371966,"score_spread":0.2710977268350617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996151541","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.028192107,0.0005747124,0.9646341,0.0020390912,0.000102250764,0.00005607204,0.00014351883,0.0005713632,0.0036868423],"genre_scores_gemma":[0.73647887,0.0013784865,0.25349998,0.0015366612,0.00047501008,0.0004991515,0.00047018557,0.00091945997,0.004742248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953755,0.0020219914,0.0002208025,0.0011984868,0.0009179999,0.00026510606],"domain_scores_gemma":[0.9258045,0.05629306,0.0041190796,0.0079106875,0.0047848574,0.0010878259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01608292,0.0018845855,0.0015223671,0.0021390906,0.00090444635,0.0020319363,0.0024137844,0.0027103298,0.0032556914],"category_scores_gemma":[0.11276769,0.0011236233,0.0012991225,0.0012205394,0.0049907705,0.007708398,0.0046281517,0.0050853468,0.00065326685],"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.00016112185,0.00012433254,0.0072597167,0.00050680264,0.00018276423,0.00041695306,0.00074348634,0.5305266,0.008375833,0.37210447,0.006638741,0.07295918],"study_design_scores_gemma":[0.000012020423,0.000054709097,0.0014231782,0.000078226185,0.000018524013,0.000115545445,0.000051973042,0.859309,0.0011869109,0.13688007,0.00084245246,0.00002736393],"about_ca_topic_score_codex":0.0024749457,"about_ca_topic_score_gemma":0.0019067463,"teacher_disagreement_score":0.01608292,"about_ca_system_score_codex":0.0017559965,"about_ca_system_score_gemma":0.0015205808,"threshold_uncertainty_score":0.08505565},"labels":[],"label_agreement":null},{"id":"W2996170846","doi":"","title":"Training Recurrent Neural Networks Online by Learning Explicit State Variables","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot Learning","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 Alberta","funders":"","keywords":"Recurrent neural network; Computer science; Truncation (statistics); Computation; Focus (optics); Machine learning; Artificial intelligence; Variety (cybernetics); Artificial neural network; Online learning; Algorithm; Mathematical optimization; Mathematics","score_opus":0.11405124960379914,"score_gpt":0.3407093050386591,"score_spread":0.22665805543485995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996170846","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.027069893,0.0002176239,0.9696548,0.0001781394,0.000044561442,0.000033264365,0.000053702275,0.0017264783,0.0010213879],"genre_scores_gemma":[0.5829067,0.00026103578,0.41179726,0.00025871987,0.000070235896,0.00018791617,0.00052011607,0.0003651809,0.0036328586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993818,0.00015873788,0.0000381537,0.00017919778,0.0001694363,0.00007270253],"domain_scores_gemma":[0.9962478,0.0026526311,0.0002465245,0.00033025045,0.0004399752,0.000082725914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017837274,0.0013156496,0.0011310338,0.00048817674,0.00037942757,0.0008536011,0.0019050328,0.0014027735,0.0025239056],"category_scores_gemma":[0.010184659,0.0008495293,0.0005946621,0.00052418275,0.000802947,0.0026805536,0.0012263055,0.002705505,0.0008873123],"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.00008892546,0.00008028286,0.00067354226,0.000060898117,0.000041183568,0.00006646409,0.000058176043,0.8773697,0.0030283094,0.006195743,0.0014809644,0.110855766],"study_design_scores_gemma":[0.000003028447,0.000008240955,0.000026181957,0.000003016879,0.0000020375765,0.00000465257,0.0000017222739,0.9980496,0.0004772932,0.0013437315,0.00007853775,0.0000019426398],"about_ca_topic_score_codex":0.0064484477,"about_ca_topic_score_gemma":0.010228405,"teacher_disagreement_score":0.0064484477,"about_ca_system_score_codex":0.00079521857,"about_ca_system_score_gemma":0.0013908056,"threshold_uncertainty_score":0.012821853},"labels":[],"label_agreement":null},{"id":"W2996680032","doi":"","title":"Efficient and Information-Preserving Future Frame Prediction and Beyond","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":72,"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; MNIST database; Autoencoder; Bottleneck; Artificial intelligence; Frame (networking); Machine learning; Feature extraction; Information bottleneck method; Margin (machine learning); Feature (linguistics); High memory; Key (lock); Deep learning; State (computer science); Algorithm; Mutual information","score_opus":0.019646100709941154,"score_gpt":0.2979189959929102,"score_spread":0.27827289528296906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996680032","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.033320203,0.0003160225,0.9609013,0.00017389536,0.000049284587,0.000036111956,0.00018065002,0.0016878805,0.0033346508],"genre_scores_gemma":[0.7616254,0.00043586912,0.22972436,0.00015275601,0.000059056918,0.00007671223,0.0007210146,0.0002816113,0.00692316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983096,0.000023916407,0.000007893635,0.0000634475,0.00004498732,0.000028808638],"domain_scores_gemma":[0.99963856,0.00011926568,0.000046462857,0.00011681474,0.00005817242,0.000020712938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043646086,0.00061553845,0.00047011132,0.00035597032,0.00029263005,0.0005597883,0.0014386997,0.0006192001,0.0027922168],"category_scores_gemma":[0.0016941145,0.00032867197,0.00046208265,0.0003641137,0.0005211448,0.0014147689,0.0008543179,0.0011048838,0.00095305307],"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.00024522844,0.00011807206,0.0014448436,0.000120430115,0.000056800036,0.00024696023,0.00014135014,0.3487969,0.0465334,0.031271122,0.004929008,0.5660959],"study_design_scores_gemma":[0.000004610367,0.0000382484,0.00025514077,0.000013259148,0.000010842586,0.00007512786,0.000009671484,0.9720666,0.016956503,0.008574023,0.0019865122,0.000009549167],"about_ca_topic_score_codex":0.0041730553,"about_ca_topic_score_gemma":0.006247553,"teacher_disagreement_score":0.0041730553,"about_ca_system_score_codex":0.00039272633,"about_ca_system_score_gemma":0.0007492669,"threshold_uncertainty_score":0.009340882},"labels":[],"label_agreement":null},{"id":"W3012851896","doi":"","title":"Convergence of Gradient Methods on Bilinear Zero-Sum Games","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":13,"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":"Convergence (economics); Bilinear interpolation; Zero (linguistics); Applied mathematics; Adversarial system; Computer science; Mathematical optimization; Generative grammar; Zero-sum game; Mathematics; Algorithm; Artificial intelligence; Nash equilibrium","score_opus":0.35221709293036835,"score_gpt":0.5526990798639185,"score_spread":0.20048198693355018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012851896","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.018833358,0.00087351265,0.9678403,0.0008402973,0.00013399686,0.00013157015,0.00011527833,0.00019935943,0.011032324],"genre_scores_gemma":[0.6800381,0.0023286438,0.28658888,0.0011384785,0.00034461264,0.001033155,0.00043416943,0.0008622916,0.027231626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780446,0.0012365411,0.00009517493,0.0002929009,0.00033213387,0.0002387785],"domain_scores_gemma":[0.9873784,0.01031341,0.0004674549,0.00047804174,0.00087376474,0.0004889847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005609209,0.0022608968,0.001804334,0.0011938051,0.00074960035,0.0022923683,0.0020174426,0.001890107,0.0069489037],"category_scores_gemma":[0.029234182,0.00080793886,0.0011932509,0.0007412642,0.003203561,0.004297947,0.004583231,0.004341471,0.0011584129],"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.00021614064,0.00012729541,0.0007964975,0.0003436111,0.00008406398,0.00010797199,0.0002677524,0.3030055,0.001439838,0.65894675,0.0043822154,0.030282263],"study_design_scores_gemma":[0.000022652916,0.000041313968,0.00007145225,0.00004380131,0.0000097156835,0.000022536364,0.000032629036,0.76987576,0.00038903023,0.22859326,0.0008839746,0.000013945812],"about_ca_topic_score_codex":0.0021110715,"about_ca_topic_score_gemma":0.0019063097,"teacher_disagreement_score":0.0069489037,"about_ca_system_score_codex":0.0018985423,"about_ca_system_score_gemma":0.0018368862,"threshold_uncertainty_score":0.029664695},"labels":[],"label_agreement":null},{"id":"W3041421878","doi":"","title":"Solving ODE with Universal Flows: Approximation Theory for Flow-Based Models","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Ode; Computer science; Flow (mathematics); Applied mathematics; Mathematical optimization; Mathematical economics; Mathematics; Geometry","score_opus":0.22818065280292232,"score_gpt":0.42082505278815807,"score_spread":0.19264439998523575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041421878","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.005252313,0.00023144396,0.99254084,0.00019374711,0.00003923439,0.000014798765,0.000034349734,0.00006791843,0.0016252793],"genre_scores_gemma":[0.6128586,0.0017462984,0.37244153,0.00041432542,0.00029003964,0.00031228532,0.00043529517,0.00024425346,0.011257347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00029924,0.000054703254,0.0001311157,0.0001856332,0.00007492638],"domain_scores_gemma":[0.9975419,0.001548705,0.00020702627,0.00023137269,0.0003287798,0.0001422069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020699785,0.0010159924,0.0017116243,0.0012916666,0.00066816533,0.0019054227,0.0015482907,0.0017852834,0.002153166],"category_scores_gemma":[0.008822869,0.0006769926,0.0015301701,0.001085374,0.0017908777,0.0034994823,0.0032789581,0.0026912533,0.00027477488],"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.000029550842,0.000039204693,0.00039745364,0.00010899306,0.000041810945,0.000031562784,0.000084449064,0.57629657,0.0006113126,0.40016967,0.0010404625,0.021148885],"study_design_scores_gemma":[0.0000021822896,0.0000051458437,0.00001787839,0.0000072790103,0.0000041430035,0.0000052892383,0.0000051624284,0.9400667,0.00009072289,0.059475515,0.000316941,0.0000030053739],"about_ca_topic_score_codex":0.0056601604,"about_ca_topic_score_gemma":0.0035018057,"teacher_disagreement_score":0.0056601604,"about_ca_system_score_codex":0.0014173357,"about_ca_system_score_gemma":0.0017712294,"threshold_uncertainty_score":0.01125443},"labels":[],"label_agreement":null},{"id":"W3122339903","doi":"","title":"Fast convergence of stochastic subgradient method under interpolation","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"Subgradient method; Interpolation (computer graphics); Mathematical optimization; Parameterized complexity; Mathematics; Stochastic gradient descent; Rate of convergence; Applied mathematics; Convergence (economics); Convex optimization; Convex function; Minification; Regular polygon; Computer science; Algorithm; Artificial intelligence; Artificial neural network; Geometry","score_opus":0.04650407779978084,"score_gpt":0.341509292915698,"score_spread":0.29500521511591715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122339903","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.013564673,0.0005391845,0.9835739,0.00029366833,0.00006203795,0.00003868819,0.000027717715,0.0002433152,0.0016568557],"genre_scores_gemma":[0.5455841,0.0013267,0.44466585,0.00048510553,0.00019913496,0.000298492,0.00028902266,0.0005387618,0.0066128145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980913,0.0010642741,0.000076587254,0.00016319024,0.00046286054,0.00014178606],"domain_scores_gemma":[0.99303985,0.0052263034,0.00034905295,0.00046198585,0.00070012634,0.00022264308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059108697,0.0013073537,0.0017097399,0.0007457749,0.0004741261,0.00094202615,0.0011876124,0.0014647229,0.0017990909],"category_scores_gemma":[0.018613813,0.0006148284,0.00096390815,0.00066489674,0.0018144612,0.0018918773,0.0021715756,0.0024698796,0.00052745553],"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.00023233223,0.00004966686,0.0011815729,0.00025250425,0.00008199059,0.00014520148,0.00014265184,0.8691009,0.0048795347,0.08922384,0.0019904284,0.032719355],"study_design_scores_gemma":[0.0000058811456,0.000023081351,0.000057562585,0.000008236104,0.0000021299895,0.000013149338,0.0000038820135,0.9926311,0.00039670168,0.0065600015,0.00029503583,0.0000032406404],"about_ca_topic_score_codex":0.0038252177,"about_ca_topic_score_gemma":0.0023434456,"teacher_disagreement_score":0.0059108697,"about_ca_system_score_codex":0.001270516,"about_ca_system_score_gemma":0.0018433242,"threshold_uncertainty_score":0.031260073},"labels":[],"label_agreement":null},{"id":"W3125085017","doi":"","title":"Leaky Tiling Activations: A Simple Approach to Learning Sparse Representations Online","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot 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 Alberta","funders":"","keywords":"Computer science; Reinforcement learning; Regularization (linguistics); Simple (philosophy); Artificial neural network; Online algorithm; Artificial intelligence; Algorithm; Deep learning; Function (biology); Pattern recognition (psychology)","score_opus":0.1131943599475023,"score_gpt":0.3721155278946628,"score_spread":0.25892116794716047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125085017","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.0055700378,0.000058212274,0.9930274,0.00012684257,0.000025652722,0.000023991506,0.000020368241,0.0004240944,0.0007234572],"genre_scores_gemma":[0.51077163,0.00025147767,0.48215538,0.00035763343,0.000110518835,0.0002780272,0.00014973147,0.00031190264,0.005613683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961853,0.00011981528,0.000020937357,0.00010541714,0.00008838147,0.000046865956],"domain_scores_gemma":[0.9992017,0.00037408233,0.00008136919,0.00018589835,0.00008774837,0.000069125854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008766413,0.0007663793,0.00081566133,0.00039290925,0.0003234362,0.0007026865,0.0015686875,0.0011852342,0.004043927],"category_scores_gemma":[0.003923325,0.0004475871,0.0004886341,0.00054033415,0.0012595496,0.0021183568,0.0018184157,0.002219791,0.00076198345],"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.00024692382,0.00015819483,0.00073653954,0.00013635935,0.00007350417,0.00014643096,0.0002087696,0.651787,0.023048379,0.0902773,0.0030785191,0.23010206],"study_design_scores_gemma":[0.00000989263,0.00003975867,0.000043692395,0.0000054210864,0.0000044970766,0.000024793862,0.000006579413,0.97256225,0.0026093903,0.023822093,0.0008654499,0.0000061153296],"about_ca_topic_score_codex":0.0010036267,"about_ca_topic_score_gemma":0.0011685888,"teacher_disagreement_score":0.004043927,"about_ca_system_score_codex":0.0004859519,"about_ca_system_score_gemma":0.00069604395,"threshold_uncertainty_score":0.013528287},"labels":[],"label_agreement":null},{"id":"W3127129507","doi":"","title":"Incremental few-shot learning via vector quantization in deep embedded space","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Domain Adaptation and Few-Shot 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":"University of Toronto","funders":"","keywords":"Forgetting; Overfitting; Learning vector quantization; Computer science; Artificial intelligence; Regularization (linguistics); Machine learning; Quantization (signal processing); Incremental learning; Support vector machine; Deep learning; Reproducing kernel Hilbert space; Vector quantization; Kernel (algebra); Pattern recognition (psychology); Artificial neural network; Algorithm; Mathematics; Hilbert space","score_opus":0.05821540092947535,"score_gpt":0.34313833311950254,"score_spread":0.2849229321900272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127129507","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.02441413,0.00072982896,0.97295797,0.00014018516,0.00007408906,0.000055543725,0.00009673068,0.0010630612,0.0004684974],"genre_scores_gemma":[0.7403956,0.00069440913,0.25409728,0.00031566338,0.00010325274,0.000193772,0.00088670076,0.0001598001,0.0031534776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992711,0.00015702339,0.000049497132,0.00025259465,0.00019866318,0.00007104113],"domain_scores_gemma":[0.9988961,0.00044651772,0.00010516308,0.00026123732,0.00021650047,0.00007449376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001072807,0.0008815868,0.0014402515,0.0005369193,0.0003608342,0.00081130874,0.0022344794,0.0009061279,0.0012583499],"category_scores_gemma":[0.0038511923,0.0004898931,0.0006238614,0.0007715303,0.0007881862,0.0030151142,0.0015056711,0.002285868,0.000444524],"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.00026191305,0.0002556368,0.0019125865,0.00023154891,0.00010397377,0.00012409379,0.00027394303,0.3360319,0.0112807695,0.011533493,0.004496409,0.6334937],"study_design_scores_gemma":[0.000008873083,0.000046554767,0.00017616095,0.0000068262293,0.000008240751,0.000024679632,0.000014701128,0.99152,0.0019985547,0.0057703,0.00041510732,0.000010030233],"about_ca_topic_score_codex":0.005951458,"about_ca_topic_score_gemma":0.0067097526,"teacher_disagreement_score":0.005951458,"about_ca_system_score_codex":0.0008207439,"about_ca_system_score_gemma":0.0010132369,"threshold_uncertainty_score":0.011833668},"labels":[],"label_agreement":null},{"id":"W3127501635","doi":"","title":"Universal approximation power of deep residual neural networks via nonlinear control theory","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"Queen's University","funders":"","keywords":"Controllability; Residual; Uniform norm; Artificial neural network; Function approximation; Mathematics; Applied mathematics; Monotonic function; Mathematical optimization; Computer science; Nonlinear system; Discrete mathematics; Algorithm; Artificial intelligence; Mathematical analysis","score_opus":0.01787769868776137,"score_gpt":0.2882457914256486,"score_spread":0.27036809273788726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127501635","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.056606118,0.00032210385,0.93724185,0.0002992516,0.000023516623,0.000015718739,0.000039725444,0.00016456902,0.005287092],"genre_scores_gemma":[0.9684664,0.00029412884,0.029036751,0.00008280555,0.000037977585,0.000036175894,0.000047575904,0.000046419504,0.0019518078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961746,0.00010201965,0.000018604867,0.000102412305,0.000105283194,0.000054180884],"domain_scores_gemma":[0.99938405,0.00031062373,0.00010376568,0.00009191657,0.00007105689,0.00003859967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093033165,0.0005382613,0.00047409016,0.00037050666,0.00023908408,0.0005568561,0.0006314107,0.00047164463,0.0013724909],"category_scores_gemma":[0.002208622,0.00022595731,0.00052467664,0.00019442844,0.0016881283,0.001633246,0.0013925205,0.0009733425,0.00012108207],"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.000046645004,0.000022991015,0.0006919785,0.00009793043,0.000029865756,0.00013001257,0.00018930851,0.37556654,0.01079846,0.5941505,0.00041342038,0.017862268],"study_design_scores_gemma":[0.0000033622093,0.000033208224,0.00012800378,0.0000073589677,0.00000431368,0.000023351451,0.00001306903,0.90268475,0.0011395582,0.09551578,0.00044158378,0.0000056518597],"about_ca_topic_score_codex":0.0013143559,"about_ca_topic_score_gemma":0.00088436954,"teacher_disagreement_score":0.0013724909,"about_ca_system_score_codex":0.0005770711,"about_ca_system_score_gemma":0.00032746035,"threshold_uncertainty_score":0.0049200654},"labels":[],"label_agreement":null},{"id":"W3128624754","doi":"","title":"Neural representation and generation for RNA secondary structures","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; RNA; Computational biology; Theoretical computer science; Folding (DSP implementation); Graph; Encoding (memory); Artificial intelligence; Biology; Engineering; Genetics; Gene","score_opus":0.05482078782626408,"score_gpt":0.34202032152011785,"score_spread":0.28719953369385376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128624754","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.06427244,0.0004394822,0.93052506,0.00043008596,0.00006719843,0.00004964413,0.00023416292,0.0010922761,0.002889725],"genre_scores_gemma":[0.8051807,0.000397996,0.18777016,0.00027127913,0.00007381413,0.00018291488,0.0009635908,0.00021386467,0.004945725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997874,0.00005844423,0.000008970076,0.0000702517,0.000042698648,0.000032335123],"domain_scores_gemma":[0.99950004,0.00028837484,0.000047058576,0.00006424346,0.00007612515,0.000024127812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047677962,0.00052120636,0.0004766213,0.0005301969,0.00024291858,0.0006358075,0.0010179451,0.0008698894,0.0018971793],"category_scores_gemma":[0.0017408817,0.0003298331,0.00065530493,0.0004341744,0.0006382932,0.0010552835,0.00081508164,0.0011282762,0.0004565859],"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.00009398946,0.00006581331,0.0005775954,0.00010964677,0.000037227317,0.00010159999,0.000090415764,0.7972494,0.013293977,0.040892098,0.002560462,0.14492777],"study_design_scores_gemma":[0.0000029377184,0.000011882542,0.000032802058,0.0000031378438,0.0000022445165,0.0000069115663,0.000003873349,0.9893706,0.0010567695,0.009308549,0.00019825951,0.0000020859193],"about_ca_topic_score_codex":0.0015586591,"about_ca_topic_score_gemma":0.002766121,"teacher_disagreement_score":0.0018971793,"about_ca_system_score_codex":0.00080785295,"about_ca_system_score_gemma":0.0005113264,"threshold_uncertainty_score":0.0063467026},"labels":[],"label_agreement":null},{"id":"W3130843035","doi":"","title":"Conservative Safety Critics for Exploration","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Convergence (economics); Task (project management); Suite; Upper and lower bounds; Artificial intelligence; Machine learning; Mathematical optimization; Engineering; Mathematics; Law","score_opus":0.11749702201540502,"score_gpt":0.379141317792146,"score_spread":0.261644295776741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130843035","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.012740063,0.00018156301,0.98320353,0.00037872855,0.000045867062,0.000044180648,0.00004437142,0.00054183585,0.0028198424],"genre_scores_gemma":[0.8612038,0.0002989043,0.13127355,0.00048542809,0.00011281724,0.00038659055,0.00018916049,0.00027794216,0.005771711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981446,0.0006519448,0.000089491434,0.00033468183,0.00058926846,0.00019006703],"domain_scores_gemma":[0.9866975,0.009744322,0.0010062671,0.0011624573,0.0009308944,0.00045856615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034274259,0.0015237812,0.0012648767,0.0008666893,0.0007102448,0.0014982783,0.0018138998,0.0016763764,0.0032601508],"category_scores_gemma":[0.021400947,0.00075005664,0.0007847692,0.00035627605,0.0031859162,0.002227191,0.0031328248,0.0044276672,0.0006799951],"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.00014473865,0.000043720895,0.0010805686,0.00011413781,0.00003647535,0.00012213849,0.00014876656,0.88915306,0.0020653128,0.08092644,0.0015884724,0.024576066],"study_design_scores_gemma":[0.000019769432,0.00004340584,0.00007399048,0.000022379494,0.000007249618,0.00003090813,0.000010621013,0.9561567,0.00071065786,0.042286925,0.0006281428,0.000009310877],"about_ca_topic_score_codex":0.0015100676,"about_ca_topic_score_gemma":0.001651699,"teacher_disagreement_score":0.0034274259,"about_ca_system_score_codex":0.0012905974,"about_ca_system_score_gemma":0.0020003982,"threshold_uncertainty_score":0.01812619},"labels":[],"label_agreement":null},{"id":"W3131453904","doi":"","title":"HalentNet: Multimodal Trajectory Forecasting with Hallucinative Intents","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Trajectory; Computer science; Discriminative model; Artificial intelligence; Machine learning; Motion (physics); Feature learning; Robot; Key (lock); Representation (politics)","score_opus":0.04119373225655152,"score_gpt":0.2768955204699636,"score_spread":0.23570178821341206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131453904","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.16369529,0.0012998986,0.80169344,0.001357694,0.0004474489,0.00020898097,0.0028786836,0.020947399,0.007471213],"genre_scores_gemma":[0.83412105,0.000319285,0.14966065,0.0006493387,0.00014470628,0.00017427416,0.0057152244,0.00045621788,0.008759257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997881,0.000034355,0.000009782026,0.00007982399,0.00004677571,0.000041197818],"domain_scores_gemma":[0.9996697,0.00011508758,0.000030644325,0.00006184931,0.00008772636,0.0000350644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000488666,0.0013100179,0.0006578505,0.0006096732,0.0003330215,0.0005909799,0.001732816,0.0010322296,0.0035139734],"category_scores_gemma":[0.0018571748,0.00039420003,0.0007610523,0.00051282486,0.0004390807,0.0012549895,0.0009354433,0.0013634333,0.0009851102],"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.00040749944,0.00020662237,0.003229788,0.00011026408,0.00009604893,0.00030290225,0.00012289555,0.71639663,0.0050967997,0.0031508554,0.016137706,0.2547419],"study_design_scores_gemma":[0.000006755645,0.000018100607,0.000103353086,0.0000043058362,0.000003981063,0.000012819962,0.000008101302,0.9977597,0.00070324814,0.00095239613,0.00042344423,0.0000037290854],"about_ca_topic_score_codex":0.018734192,"about_ca_topic_score_gemma":0.02454988,"teacher_disagreement_score":0.018734192,"about_ca_system_score_codex":0.0009616388,"about_ca_system_score_gemma":0.0007576824,"threshold_uncertainty_score":0.03725028},"labels":[],"label_agreement":null},{"id":"W3132255199","doi":"","title":"C-Learning: Horizon-Aware Cumulative Accessibility Estimation","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reachability; Reinforcement learning; Computer science; Motion planning; Time horizon; Generalization; Sample (material); Reliability (semiconductor); Set (abstract data type); Path (computing); Code (set theory); Field (mathematics); Machine learning; Artificial intelligence; Mathematical optimization; Robot; Theoretical computer science; Mathematics","score_opus":0.06374053049019669,"score_gpt":0.3772116194799136,"score_spread":0.31347108898971693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132255199","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.0060521197,0.00015833261,0.9905992,0.00010042794,0.000027063914,0.000056924768,0.000098307566,0.0017258298,0.0011818015],"genre_scores_gemma":[0.5669572,0.00029470216,0.4266716,0.00031363673,0.000095181626,0.000392812,0.0006985349,0.00075465924,0.0038217776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991186,0.00018572022,0.00004609963,0.00023704306,0.00027202375,0.00014050954],"domain_scores_gemma":[0.9955445,0.0027698022,0.0003366297,0.0005164863,0.00055062847,0.00028200078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013644099,0.0011856774,0.0015232633,0.0011766148,0.00060328486,0.0011209298,0.0027601963,0.0015709036,0.0059993914],"category_scores_gemma":[0.008942839,0.00059396005,0.0008401045,0.0009341883,0.0011806885,0.0019375188,0.0024481788,0.002578844,0.0009219241],"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.00016530354,0.00011105186,0.0010518226,0.00014034654,0.000043906846,0.000075119664,0.00007619515,0.7847274,0.0016505676,0.012352512,0.0044203303,0.19518544],"study_design_scores_gemma":[0.000012548845,0.000018454299,0.000065872504,0.000008425112,0.000004449879,0.000013211528,0.000004977605,0.9919872,0.0005358824,0.00692613,0.0004175201,0.000005343176],"about_ca_topic_score_codex":0.011520865,"about_ca_topic_score_gemma":0.013147348,"teacher_disagreement_score":0.011520865,"about_ca_system_score_codex":0.0014351611,"about_ca_system_score_gemma":0.0029892002,"threshold_uncertainty_score":0.022907615},"labels":[],"label_agreement":null},{"id":"W3138602767","doi":"","title":"Isolating Sources of Disentanglement in Variational Autoencoders.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":35,"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":"Autoencoder; Hyperparameter; Mutual information; Correlation; Classifier (UML); Latent variable; Artificial intelligence; Total correlation; Computer science; Pattern recognition (psychology); Machine learning; Mathematics; Deep learning","score_opus":0.03819528323690188,"score_gpt":0.31948798933381134,"score_spread":0.2812927060969095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138602767","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.015531237,0.00032443783,0.9820034,0.00024471455,0.000017876957,0.000024224179,0.000061161496,0.00014941664,0.0016436349],"genre_scores_gemma":[0.7830971,0.00066991255,0.21071897,0.00035300394,0.00010855564,0.00024211842,0.00045269236,0.00042940097,0.0039283154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971418,0.0012669474,0.00014648201,0.0004848757,0.0007507825,0.00020912418],"domain_scores_gemma":[0.97962624,0.015834816,0.00164078,0.0017380507,0.0007470182,0.00041312334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061345035,0.0016045949,0.0013228573,0.0012522199,0.00070297456,0.0023954725,0.0021646523,0.0020149453,0.0025521454],"category_scores_gemma":[0.036451954,0.0013893003,0.0011840943,0.001061267,0.003009545,0.0046914737,0.00671372,0.0055954726,0.0004540295],"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.00037315613,0.00012063447,0.0038387731,0.00036788822,0.00025665842,0.00043634465,0.00069824234,0.5339596,0.010473339,0.36865547,0.0018518112,0.07896816],"study_design_scores_gemma":[0.00001489089,0.000050425413,0.00054105074,0.000061292005,0.000025768515,0.00011694334,0.000044368397,0.8574758,0.0028741607,0.13771902,0.0010547241,0.000021505795],"about_ca_topic_score_codex":0.0016468616,"about_ca_topic_score_gemma":0.002236697,"teacher_disagreement_score":0.0061345035,"about_ca_system_score_codex":0.0011243043,"about_ca_system_score_gemma":0.0014156643,"threshold_uncertainty_score":0.03244275},"labels":[],"label_agreement":null},{"id":"W3153191490","doi":"","title":"I❤LA: Compilable Markdown for Linear Algebra","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Mathematics, Computing, and Information Processing","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":"Linear algebra; Algebra over a field; Mathematics; Computer science; Pure mathematics; Applied mathematics; Mathematical optimization; Geometry","score_opus":0.05767489961279243,"score_gpt":0.3520611637380513,"score_spread":0.29438626412525887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153191490","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028608623,0.0002885263,0.60131556,0.00020176785,0.00020970094,0.00010534521,0.0039426903,0.38452905,0.0065464713],"genre_scores_gemma":[0.15202141,0.0006239527,0.67749757,0.0013796668,0.00042307,0.0010656919,0.027729934,0.11139392,0.027864823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986387,0.00024419662,0.00017762397,0.00037948298,0.0003820721,0.00017795933],"domain_scores_gemma":[0.996929,0.0011553474,0.00015883666,0.001224525,0.00041291927,0.00011943948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010692338,0.0019123817,0.0010482606,0.0011863676,0.0007290599,0.002521411,0.0028525763,0.0010937597,0.05417068],"category_scores_gemma":[0.0059697777,0.0015343686,0.0018586656,0.0014658218,0.0009885111,0.0048690992,0.0033399041,0.0035217197,0.024395877],"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.0011320971,0.00029890455,0.0020645175,0.0019514469,0.00022311317,0.00033763994,0.00069000176,0.01143828,0.030884292,0.10978874,0.3029926,0.5381984],"study_design_scores_gemma":[0.00044703105,0.0003278659,0.0010320694,0.000400674,0.00021681676,0.00036333402,0.0002101999,0.14751217,0.1500626,0.26566792,0.4334731,0.0002862098],"about_ca_topic_score_codex":0.002231183,"about_ca_topic_score_gemma":0.002891152,"teacher_disagreement_score":0.05417068,"about_ca_system_score_codex":0.000974312,"about_ca_system_score_gemma":0.0012370929,"threshold_uncertainty_score":0.18121898},"labels":[],"label_agreement":null},{"id":"W3165914412","doi":"","title":"Pretraining Reward-Free Representations for Data-Efficient Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Artificial intelligence; Cognitive psychology; Machine learning; Human–computer interaction; Psychology; Social psychology","score_opus":0.12765188971660188,"score_gpt":0.378776401532506,"score_spread":0.2511245118159041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165914412","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.02430886,0.00018033192,0.9714717,0.00028466294,0.00007441799,0.00007238128,0.00014933453,0.002066538,0.0013917047],"genre_scores_gemma":[0.7672386,0.00013320919,0.22836173,0.0002683761,0.000048523365,0.0003248257,0.00056215236,0.00024915108,0.0028133984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940085,0.00015340293,0.000039041657,0.0001412357,0.00015590608,0.00010953034],"domain_scores_gemma":[0.99707294,0.0017261792,0.00016997925,0.00047513456,0.00043992177,0.00011586581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779441,0.0010139418,0.0011583484,0.00051342696,0.00038011384,0.0009448378,0.0019280445,0.0016558936,0.0052073495],"category_scores_gemma":[0.008243588,0.00076832034,0.0005442366,0.0005792119,0.00083278626,0.0021350028,0.0018754463,0.00404458,0.0011637527],"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.00037618767,0.00035368287,0.001110588,0.00015262091,0.00006206656,0.00009968751,0.00008512425,0.6467198,0.007822943,0.01610433,0.0056011807,0.32151172],"study_design_scores_gemma":[0.000018022505,0.00003168353,0.000053994478,0.0000067837136,0.000004329706,0.000011417715,0.000004878778,0.9916238,0.0016284819,0.0063295937,0.00028269828,0.0000041981953],"about_ca_topic_score_codex":0.0038885986,"about_ca_topic_score_gemma":0.0058513,"teacher_disagreement_score":0.0052073495,"about_ca_system_score_codex":0.0009174573,"about_ca_system_score_gemma":0.0018295534,"threshold_uncertainty_score":0.017420352},"labels":[],"label_agreement":null},{"id":"W3204811657","doi":"","title":"LOCO: Adaptive exploration in reinforcement learning via local estimation of contraction coefficients","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","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":"Université de Montréal","funders":"","keywords":"Reinforcement learning; Contraction (grammar); Computer science; Reinforcement; Artificial intelligence; Control theory (sociology); Mathematics; Mathematical optimization; Engineering; Structural engineering","score_opus":0.053273948608731185,"score_gpt":0.33253110950232107,"score_spread":0.2792571608935899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204811657","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.012319522,0.00017457332,0.9832496,0.00012634062,0.00007483478,0.000055431185,0.000057298304,0.0024439362,0.001498313],"genre_scores_gemma":[0.67833817,0.00015581098,0.31404257,0.00024248958,0.0000816809,0.00048724964,0.00022307615,0.0008891205,0.005539875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996768,0.000100600395,0.000014257507,0.00007497714,0.000090816786,0.00004247815],"domain_scores_gemma":[0.9990753,0.0004978036,0.0000757314,0.00013389683,0.00011961766,0.00009769336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012267078,0.0007911137,0.0011569175,0.00046702076,0.00035917156,0.00086746627,0.0017544375,0.0013636461,0.0051996335],"category_scores_gemma":[0.0039471146,0.0004943167,0.00039948017,0.00039456828,0.0009939972,0.0015003041,0.0024805428,0.0016245464,0.00094831357],"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.0006252609,0.00028122606,0.0013622965,0.0002771499,0.00009247206,0.00019524501,0.00018460024,0.5905268,0.011293349,0.03340147,0.008827946,0.35293218],"study_design_scores_gemma":[0.00002491328,0.000038206537,0.000051117127,0.000005715662,0.0000035316118,0.00001362734,0.000004604035,0.99568033,0.0008137893,0.0029353693,0.0004236074,0.0000051770585],"about_ca_topic_score_codex":0.0021249873,"about_ca_topic_score_gemma":0.0025998645,"teacher_disagreement_score":0.0051996335,"about_ca_system_score_codex":0.00048746876,"about_ca_system_score_gemma":0.0008720825,"threshold_uncertainty_score":0.017394543},"labels":[],"label_agreement":null},{"id":"W3205221690","doi":"","title":"How Chaotic Are Recurrent Neural Networks","year":2020,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Neural Networks and 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 Alberta","funders":"","keywords":"Recurrent neural network; Computer science; Chaotic; CHAOS (operating system); Work (physics); Process (computing); Artificial neural network; Artificial intelligence; Engineering","score_opus":0.07907329506073459,"score_gpt":0.3174880274877981,"score_spread":0.2384147324270635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205221690","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.6794097,0.007409147,0.23268925,0.015026548,0.00066927314,0.00006595672,0.0011247471,0.0012294232,0.062376004],"genre_scores_gemma":[0.990209,0.0011192801,0.0055488315,0.00032981124,0.00011603617,0.000015835953,0.0001730392,0.000129633,0.0023586233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992229,0.0002481972,0.000049529306,0.00020311507,0.00019684673,0.00007932526],"domain_scores_gemma":[0.9950836,0.0025208117,0.00091198453,0.00053637865,0.0007750334,0.00017218868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011934589,0.00028603507,0.00044330064,0.00062776037,0.0005332957,0.0025717744,0.00054232863,0.0011708775,0.0025240497],"category_scores_gemma":[0.023144638,0.00038568198,0.0003229552,0.00059491326,0.0013760928,0.005403719,0.00071010843,0.0007563845,0.0006004554],"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.00068835955,0.00008314841,0.06899139,0.0008807146,0.0005872981,0.0012042247,0.0040491936,0.20171921,0.015368741,0.5094661,0.020405298,0.17655641],"study_design_scores_gemma":[0.000058218808,0.000084436855,0.016979342,0.00019387585,0.00014327037,0.0008554869,0.0012745836,0.2950324,0.006229771,0.65903974,0.019971466,0.00013744226],"about_ca_topic_score_codex":0.0027004608,"about_ca_topic_score_gemma":0.0014539582,"teacher_disagreement_score":0.0027004608,"about_ca_system_score_codex":0.0007191741,"about_ca_system_score_gemma":0.0005207969,"threshold_uncertainty_score":0.008443773},"labels":[],"label_agreement":null}]}