{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":127,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":127,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a4b9ff0d8edb","filters":{"venue":"International Conference on Machine Learning"}},"results":[{"id":"W1665214252","doi":"","title":"Rectified Linear Units Improve Restricted Boltzmann Machines","year":2010,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":13244,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Boltzmann machine; Binary number; Sigmoid function; Computer science; Object (grammar); Restricted Boltzmann machine; Artificial intelligence; Inference; Pattern recognition (psychology); Feature (linguistics); Cognitive neuroscience of visual object recognition; Algorithm; Mathematics; Computer vision; Deep learning; Arithmetic; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.03053323629475789,"gpt":0.2802265611432088,"spread":0.2496933248484509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740815,0.0002227108,0.0001759784,0.0002067379,0.0002447224,0.0003454382,0.001088244,0.00009961436,0.0004208186],"category_scores_gemma":[0.0009773418,0.0001942205,0.00006261079,0.0003581141,0.00005108504,0.0004365119,0.0002574299,0.001087475,0.0001512234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000236073,"about_ca_system_score_gemma":0.0001013737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003264335,"about_ca_topic_score_gemma":0.0001386816,"domain_scores_codex":[0.9984215,0.0001583835,0.0002669985,0.0005001671,0.0003954138,0.0002574635],"domain_scores_gemma":[0.9986144,0.0001871024,0.0001851649,0.0003522319,0.0005506591,0.0001104651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001517561,0.0001794527,0.005260977,0.000008153805,0.0001690517,0.00007258736,0.0006958654,0.01241137,0.3219064,0.3174737,0.0009564979,0.3407141],"study_design_scores_gemma":[0.0003722703,0.0001338696,0.002194811,0.00001802524,0.00000494069,0.00001039932,0.00001507466,0.970197,0.005083253,0.001797459,0.01992706,0.0002458467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1044088,0.00004428881,0.7450849,0.01518962,0.009762648,0.0004232972,0.00003929313,0.0008622767,0.1241849],"genre_scores_gemma":[0.978038,0.00002627783,0.01651204,0.0003397272,0.0005923749,0.00001359958,0.00004411861,0.00001737927,0.004416505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9577856,"threshold_uncertainty_score":0.7920082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964212410","doi":"","title":"On calibration of modern neural networks","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":1185,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Normalization (sociology); Computer science; Artificial neural network; Correctness; Calibration; Scaling; Deep neural networks; Artificial intelligence; Machine learning; Simple (philosophy); Deep learning; Pattern recognition (psychology); Data mining; Algorithm; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03526583321291214,"gpt":0.3120534779422832,"spread":0.276787644729371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112065,0.00008732355,0.00008597664,0.00007825252,0.0002678724,0.0002464548,0.0009363792,0.00004351353,0.00007741734],"category_scores_gemma":[0.0000597059,0.00008086432,0.0000492567,0.00003355946,0.0000385169,0.0002955308,0.0001487578,0.0002706188,0.000006331112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001898098,"about_ca_system_score_gemma":0.00001336501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006325945,"about_ca_topic_score_gemma":0.000009126119,"domain_scores_codex":[0.9992843,0.00003303991,0.0001583918,0.0002228696,0.000211185,0.00009026213],"domain_scores_gemma":[0.9991807,0.00004273229,0.0002688504,0.0003714435,0.0001020917,0.0000341598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001625396,0.00003500897,0.001591315,0.000001230505,0.0000091963,0.00000159769,0.00003813208,0.0375682,0.0006951758,0.8622808,0.00003506221,0.09772804],"study_design_scores_gemma":[0.0001137879,0.0001195351,0.002620645,0.00001632098,0.000001152063,0.000002365043,0.000002183393,0.9769416,0.0008270384,0.01907802,0.0002029623,0.00007438334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01713523,0.000005412916,0.9618363,0.002525287,0.0001728534,0.00006941536,0.000002550612,0.0001207393,0.0181322],"genre_scores_gemma":[0.9968289,0.00001221382,0.0022181,0.0001655951,0.00005570887,0.00001596075,0.000008767826,0.00000602589,0.0006887113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9796937,"threshold_uncertainty_score":0.3297551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2803832867","doi":"","title":"Mutual Information Neural Estimation.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":598,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Mutual information; Estimation; Artificial intelligence; Artificial neural network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02579097961051308,"gpt":0.2971756273448126,"spread":0.2713846477342995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001176967,0.0001043602,0.00007001746,0.0001182535,0.0002103021,0.0003859146,0.0006847103,0.00003267532,0.0002986764],"category_scores_gemma":[0.00007911021,0.00009444339,0.00003404731,0.0001730396,0.00004651835,0.001028248,0.0001469127,0.0002530058,0.0009597951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000027722,"about_ca_system_score_gemma":0.00002546349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002934475,"about_ca_topic_score_gemma":0.000006884477,"domain_scores_codex":[0.9991432,0.0000375602,0.0001998024,0.0001785026,0.0002963802,0.0001444945],"domain_scores_gemma":[0.9993494,0.00005122311,0.0001256545,0.0001829647,0.0002346567,0.00005613281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001179897,0.00001975319,0.0005908247,0.000001375915,0.00000948362,0.000001278277,0.0002752223,0.007351965,0.0001992953,0.7554101,0.0007401569,0.2353887],"study_design_scores_gemma":[0.0001571386,0.000105036,0.001299344,0.00001082041,0.000001190173,0.00001049954,0.00001027319,0.9711389,0.0001609706,0.004739468,0.02226378,0.0001025798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01976282,0.000006215474,0.8918799,0.01301356,0.0007739369,0.0001362483,0.000006214522,0.0003705493,0.07405051],"genre_scores_gemma":[0.9884647,0.000005915842,0.009562886,0.001073694,0.000189444,0.00001599719,0.00004940679,0.000004182319,0.0006337367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9687019,"threshold_uncertainty_score":0.9998181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963371670","doi":"","title":"Learning to Reweight Examples for Robust Deep Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":418,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hyperparameter; Overfitting; Computer science; Artificial intelligence; Machine learning; Regularization (linguistics); Deep learning; Gradient descent; Artificial neural network; Set (abstract data type); Deep neural networks; Supervised learning","retraction":null,"screen_n_in":null,"score":{"opus":0.06198251208780124,"gpt":0.3196849676050122,"spread":0.257702455517211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001104122,0.0003417186,0.000283324,0.0004921886,0.0008578479,0.0007642539,0.001607317,0.0001224979,0.0005259847],"category_scores_gemma":[0.002578889,0.0003335354,0.0001183507,0.000404149,0.00007584934,0.0005426779,0.0004260685,0.001086325,0.0007732463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000122681,"about_ca_system_score_gemma":0.00007525834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001557361,"about_ca_topic_score_gemma":0.00009606967,"domain_scores_codex":[0.9969825,0.0003782009,0.0004632231,0.001005114,0.0006498792,0.0005210653],"domain_scores_gemma":[0.9978133,0.0004762481,0.0003456253,0.0004376739,0.0007050349,0.0002221146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002463089,0.0001225345,0.01958715,0.00002736876,0.0001035929,0.00001371009,0.003924772,0.04834091,0.00546048,0.3564731,0.0005340254,0.565166],"study_design_scores_gemma":[0.0004597359,0.0009559785,0.003699543,0.00007376661,0.000007271814,0.000015706,0.0002015639,0.7772194,0.0002924732,0.0009472693,0.2157677,0.0003596274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01150482,0.0000333766,0.9407945,0.00775772,0.0008638629,0.0003139963,0.000006682665,0.0007742177,0.03795082],"genre_scores_gemma":[0.9147466,0.00004221943,0.07410017,0.0005946079,0.0007036721,0.0000881712,0.0002622531,0.00004621994,0.009416101],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9032418,"threshold_uncertainty_score":0.9999117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963540976","doi":"","title":"Invertible Residual Networks","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":193,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Invertible matrix; Jacobian matrix and determinant; Normalization (sociology); Residual; Computer science; Generative grammar; Block (permutation group theory); Algorithm; Simple (philosophy); Theoretical computer science; Artificial intelligence; Mathematics; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02215808535166284,"gpt":0.2573328756627397,"spread":0.2351747903110769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002553888,0.0001452638,0.0001375806,0.0001123918,0.00009793119,0.0003028316,0.0008258873,0.00005315095,0.001081757],"category_scores_gemma":[0.00008004016,0.0001300121,0.00005625221,0.0001401491,0.0000209288,0.0004147406,0.0002375946,0.0004061224,0.0005361688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003734236,"about_ca_system_score_gemma":0.00003944443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007843553,"about_ca_topic_score_gemma":0.00001410891,"domain_scores_codex":[0.9987563,0.0001364762,0.0001776795,0.000379316,0.0003328263,0.0002173482],"domain_scores_gemma":[0.9993428,0.0001018886,0.0001027469,0.0002461011,0.0001436244,0.00006281681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006130378,0.00006782883,0.02632096,0.000004067026,0.00009355356,0.00002074953,0.0002606671,0.5050935,0.003242242,0.4029536,0.001312508,0.06056908],"study_design_scores_gemma":[0.0002675635,0.000117211,0.002025651,0.00002961423,0.000001867531,0.000003937116,0.00001684886,0.9860976,0.0004267733,0.001228204,0.009626904,0.0001578584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01341015,0.00006759267,0.8316879,0.006084707,0.00187817,0.0001581974,0.000002336408,0.0002191079,0.1464918],"genre_scores_gemma":[0.9880362,0.00004279866,0.004874552,0.0007430258,0.0002324486,0.000005305606,0.00001708347,0.00001016507,0.006038483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.974626,"threshold_uncertainty_score":0.9998314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W13294968","doi":"10.1016/0021-8707(56)90033-8","title":"Toward Off-Policy Learning Control with Function Approximation","year":2010,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Temporal difference learning; Function approximation; Approximation algorithm; Function (biology); Computer science; Linear approximation; Bellman equation; Optimal control; Extension (predicate logic); Mathematical optimization; Control (management); Artificial intelligence; Mathematics; Reinforcement learning; Artificial neural network; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.02266731972468504,"gpt":0.2706007747695721,"spread":0.247933455044887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005058447,0.0002650122,0.0002032879,0.0004177853,0.0002742498,0.0006056678,0.0009147468,0.0001129475,0.0003406384],"category_scores_gemma":[0.0006329065,0.0002305235,0.00006914238,0.000303596,0.0000715315,0.0007366529,0.000141652,0.001760627,0.0002702002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000818189,"about_ca_system_score_gemma":0.0001684062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008420838,"about_ca_topic_score_gemma":0.00001520498,"domain_scores_codex":[0.9978631,0.0001563385,0.0003251315,0.000490737,0.0008307642,0.0003339077],"domain_scores_gemma":[0.9986272,0.000168478,0.0003697274,0.0003038158,0.0004149482,0.0001158616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001057528,0.00003190959,0.009701381,0.000008544373,0.00006762356,0.00000943245,0.0003967693,0.5157424,0.003923931,0.4264555,0.00001624982,0.04354053],"study_design_scores_gemma":[0.001065407,0.0005315858,0.003423867,0.00004001716,0.000009685872,0.00003256329,0.00004897326,0.9786261,0.0001885119,0.0009824905,0.01478053,0.0002702108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0106375,0.000006076412,0.9326913,0.004855052,0.0006330823,0.0001860045,0.000001122295,0.0004629931,0.05052684],"genre_scores_gemma":[0.9877251,0.00001586709,0.007810126,0.000462858,0.0003230211,0.00002878056,0.00005251193,0.00002618901,0.003555513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9770876,"threshold_uncertainty_score":0.9400476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2186489521","doi":"","title":"Unsupervised and Transfer Learning Challenge: a Deep Learning Approach","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Transfer of learning; Artificial intelligence; Computer science; Unsupervised learning; Machine learning; Deep learning; Classifier (UML); Competitive learning; Semi-supervised learning; Task (project management)","retraction":null,"screen_n_in":null,"score":{"opus":0.0682199232260771,"gpt":0.275857866333464,"spread":0.2076379431073869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000774865,0.0003529362,0.000288451,0.0003710363,0.0004618626,0.0003683118,0.001074781,0.0001470572,0.0004336042],"category_scores_gemma":[0.0003459674,0.000335998,0.00009186747,0.0002487408,0.00008940664,0.0006760344,0.0002684541,0.001887527,0.0001337852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004985772,"about_ca_system_score_gemma":0.00004413457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002091321,"about_ca_topic_score_gemma":0.0000182809,"domain_scores_codex":[0.9971542,0.0005618029,0.0003966071,0.0009030992,0.0005834399,0.0004008299],"domain_scores_gemma":[0.998988,0.0001360428,0.0001495576,0.0003325549,0.0002073864,0.0001864113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001326101,0.0002777015,0.03456064,0.00004656762,0.0001166468,0.0000298896,0.01122034,0.005042204,0.001137524,0.6160211,0.00000688067,0.3314079],"study_design_scores_gemma":[0.0008469226,0.0004778662,0.01439621,0.00005553887,0.00001364269,0.00004396171,0.000521393,0.9717566,0.00007772142,0.00134136,0.01001877,0.0004499635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04580575,0.0003440423,0.6802667,0.002091788,0.0003423129,0.0002678312,0.000003207546,0.001038839,0.2698395],"genre_scores_gemma":[0.9862804,0.0005298889,0.01084093,0.0001347591,0.00009749596,0.00003988918,0.0001280226,0.00003608911,0.001912533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9667144,"threshold_uncertainty_score":0.9999092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2804948070","doi":"","title":"Using Reward Machines for High-Level Task Specification and Decomposition in Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Decomposition; Artificial intelligence; Human–computer interaction; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09333430035172953,"gpt":0.3548435333796292,"spread":0.2615092330278997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974613,0.000226202,0.0002000981,0.0004187428,0.0003053882,0.0003731153,0.0005681012,0.00008287372,0.00008011689],"category_scores_gemma":[0.000330457,0.0002333267,0.0000381215,0.000201728,0.00007441393,0.0005368039,0.0002301561,0.0004673228,0.00003255062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000188603,"about_ca_system_score_gemma":0.00005438289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002162561,"about_ca_topic_score_gemma":0.00003057971,"domain_scores_codex":[0.9981607,0.0001355366,0.0004595779,0.0005091034,0.0004370407,0.0002979974],"domain_scores_gemma":[0.9988728,0.0001722133,0.0003412985,0.0002151773,0.0003283149,0.00007024964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001252948,0.00002815578,0.01054913,0.0000191087,0.00003666681,0.000004320693,0.0008235468,0.6796286,0.01381133,0.2791476,0.00002038995,0.01580594],"study_design_scores_gemma":[0.0008115113,0.0004897515,0.005755191,0.0001301114,0.000006088211,0.00001191976,0.00003789358,0.9876899,0.0006453297,0.003197852,0.0009762649,0.0002482276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03878467,0.00001254822,0.9538448,0.001216866,0.000495991,0.0002713375,0.000002157976,0.0001187153,0.005252841],"genre_scores_gemma":[0.9404784,0.00003459271,0.05795851,0.0001652802,0.0002059745,0.00002163337,0.00009358234,0.00002031875,0.001021693],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9016938,"threshold_uncertainty_score":0.9514787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2740643007","doi":"","title":"Deep Spectral Clustering Learning.","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Artificial intelligence; Computer science; Deep learning; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.0414787561868741,"gpt":0.3124472869121453,"spread":0.2709685307252712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002259944,0.0001517463,0.0001254084,0.0001252499,0.0006683317,0.001071469,0.001411374,0.00005909393,0.000670843],"category_scores_gemma":[0.0003406496,0.0001417297,0.00007093009,0.00002743843,0.00004169036,0.0007302368,0.0004443361,0.0006470701,0.0005944654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003937172,"about_ca_system_score_gemma":0.00002627995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001260021,"about_ca_topic_score_gemma":0.00004778314,"domain_scores_codex":[0.9987642,0.00007835308,0.0001757263,0.0003733989,0.0003813409,0.0002269695],"domain_scores_gemma":[0.9991737,0.00005034258,0.0002367077,0.00032823,0.0001283546,0.00008266364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001639773,0.0001857446,0.05226444,0.00002488062,0.0001282844,0.0002184458,0.001875025,0.04202206,0.01535086,0.235964,0.0003373988,0.6514649],"study_design_scores_gemma":[0.0003922176,0.0001143921,0.008352347,0.00008260497,0.000002198789,0.00001752664,0.00003677626,0.9800685,0.0007591231,0.003233257,0.00674951,0.0001915671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06046029,0.00002984974,0.6153849,0.0109534,0.001895358,0.0001342961,0.000002052202,0.0004655784,0.3106743],"genre_scores_gemma":[0.9897862,0.00005794819,0.005190434,0.000201174,0.0001693317,0.000009265249,0.00001752978,0.00001094776,0.004557151],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9380464,"threshold_uncertainty_score":0.9999655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081963674","doi":"","title":"Contrastive Multi-View Representation Learning on Graphs","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Graph; Artificial intelligence; Node (physics); Binary classification; Theoretical computer science; Representation (politics); Machine learning; Binary number; Feature learning; Mathematics; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.0770792012378027,"gpt":0.3372805158083014,"spread":0.2602013145704987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522118,0.0002445394,0.0002257642,0.0001535464,0.0002095139,0.0002338881,0.0008605075,0.00006341645,0.0001535984],"category_scores_gemma":[0.0006670758,0.0002326806,0.0001123928,0.0003890457,0.00005172377,0.000474949,0.0001995629,0.00119807,0.0002194052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004097548,"about_ca_system_score_gemma":0.00002700934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002390996,"about_ca_topic_score_gemma":0.000006278411,"domain_scores_codex":[0.9979013,0.0002855075,0.0003062326,0.0006966816,0.0005412354,0.0002690123],"domain_scores_gemma":[0.9988784,0.0002999784,0.0002682701,0.0001790637,0.0002167252,0.0001575597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002292611,0.0001084401,0.02034041,0.00001079763,0.0001044555,0.0001244421,0.001433963,0.2469853,0.003115409,0.5278226,0.00009991682,0.199625],"study_design_scores_gemma":[0.0008034695,0.0004578842,0.00434363,0.00008603114,0.000004458516,0.000007104474,0.00006856927,0.9870999,0.0004398571,0.002757545,0.003670356,0.0002611371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01559951,0.0001261289,0.9499592,0.01729796,0.0007490451,0.0003538746,0.000006462586,0.000821946,0.01508591],"genre_scores_gemma":[0.9900829,0.0001542669,0.006856175,0.0022562,0.0001107278,0.00002051155,0.00004290639,0.00002030975,0.0004560052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9744834,"threshold_uncertainty_score":0.9488441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034607397","doi":"","title":"An Optimistic Perspective on Offline Deep Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada); University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Perspective (graphical); Artificial intelligence; Reinforcement; Machine learning; Psychology; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.04466082375581626,"gpt":0.3204855486435333,"spread":0.275824724887717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003573012,0.0003404088,0.0002611411,0.0002165696,0.0003052919,0.0005476592,0.001700358,0.00008654805,0.0008736206],"category_scores_gemma":[0.001299779,0.0003351975,0.0001033555,0.0002624735,0.00005704588,0.0005289417,0.0002948053,0.00145189,0.000592829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002519226,"about_ca_system_score_gemma":0.0001022186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006817735,"about_ca_topic_score_gemma":0.00000241486,"domain_scores_codex":[0.9970936,0.0002444345,0.0004201387,0.0008665926,0.0009925388,0.0003826787],"domain_scores_gemma":[0.9983172,0.0001768491,0.0003343216,0.0004445173,0.0004491105,0.0002780254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007535339,0.00002918729,0.0004847692,0.000004593856,0.00004354318,0.0000273464,0.001612067,0.7441074,0.0004759383,0.2499907,0.00002037152,0.003128778],"study_design_scores_gemma":[0.0006569013,0.002055463,0.000238869,0.00004920723,0.000008156555,0.000006508388,0.0004741486,0.9927591,0.0002347711,0.0003573168,0.002810416,0.000349149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00100888,0.00001119464,0.8987529,0.008804753,0.0003144306,0.0001679049,7.591048e-7,0.0004824117,0.09045677],"genre_scores_gemma":[0.987827,0.00003211284,0.00730916,0.002323998,0.0002710194,0.00001440463,0.00008131791,0.00003269032,0.002108312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9868181,"threshold_uncertainty_score":0.99991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964271895","doi":"","title":"Augmented CycleGAN: Learning Many-to-Many Mappings from Unpaired Data","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Domain (mathematical analysis); Image (mathematics); Artificial intelligence; Segmentation; Image segmentation; Pattern recognition (psychology); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07715892650561458,"gpt":0.3242514679354985,"spread":0.247092541429884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009097802,0.0003387793,0.000283234,0.0004282529,0.0005055742,0.0009049326,0.003348314,0.0001019832,0.001849284],"category_scores_gemma":[0.0007988482,0.0003494881,0.00007374685,0.0004481708,0.00009595695,0.0009517297,0.001490927,0.001017473,0.002416035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000116287,"about_ca_system_score_gemma":0.0001044996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000644004,"about_ca_topic_score_gemma":0.00007534555,"domain_scores_codex":[0.9965659,0.0003568544,0.000491172,0.001165368,0.0009506622,0.0004699898],"domain_scores_gemma":[0.9979652,0.0002236074,0.0003299528,0.000831179,0.0003938898,0.0002561755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003910566,0.0003380291,0.0354224,0.00001915454,0.0005587362,0.0001961505,0.01049158,0.01305051,0.02442195,0.4418803,0.003886314,0.4693438],"study_design_scores_gemma":[0.0006390338,0.0002245953,0.009174067,0.0001234154,0.000007427985,0.000008559222,0.0002578558,0.8212873,0.0002302167,0.001101819,0.1665845,0.0003611942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0336136,0.0000306861,0.8924617,0.0120994,0.001426301,0.0002264525,0.00003478671,0.0008623964,0.05924473],"genre_scores_gemma":[0.9640467,0.00002094274,0.02564526,0.001766521,0.0004931621,0.00001389396,0.0004751955,0.00003716401,0.007501218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.930433,"threshold_uncertainty_score":0.9998957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964304579","doi":"","title":"On orthogonality and learning recurrent networks with long term dependencies","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Orthogonality; Backpropagation; Artificial neural network; Computer science; Convergence (economics); Term (time); Stability (learning theory); Property (philosophy); Matrix (chemical analysis); Norm (philosophy); Applied mathematics; Mathematical optimization; Gradient method; Mathematics; Algorithm; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0326125001541815,"gpt":0.2885483512715729,"spread":0.2559358511173914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001649899,0.0001859829,0.0001489699,0.00007822597,0.0003712286,0.0003521306,0.0002736021,0.00006020164,0.0001036719],"category_scores_gemma":[0.0001329871,0.000159396,0.00003069193,0.00001882398,0.0000704089,0.000145966,0.00008647233,0.0009521249,0.000009312996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003591231,"about_ca_system_score_gemma":0.000009890719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005597006,"about_ca_topic_score_gemma":0.0001118499,"domain_scores_codex":[0.9991512,0.00005795662,0.0001318724,0.0002358092,0.0002513874,0.0001717221],"domain_scores_gemma":[0.9994639,0.00008660552,0.0001097789,0.0001927479,0.00009027609,0.000056661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003768749,0.00006179783,0.4424607,0.00002651339,0.0002628612,0.0001855605,0.0003233241,0.2527148,0.001167858,0.03403238,0.00009076093,0.2682965],"study_design_scores_gemma":[0.0003802687,0.0003003916,0.2348757,0.0005608885,0.00001412687,0.00003250476,0.00002406827,0.761909,0.0004861047,0.0005748292,0.0005209588,0.000321134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9385608,0.0001168224,0.02188507,0.0002561799,0.0002957488,0.0000981503,0.000002765625,0.0004666147,0.03831783],"genre_scores_gemma":[0.998873,0.0002106262,0.0003425752,0.0000396252,0.00009821677,0.000007794613,0.00002407454,0.00002529,0.0003787889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5091943,"threshold_uncertainty_score":0.6499982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160142299","doi":"","title":"Unsupervised Models of Images by Spike-and-Slab RBMs","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Spike (software development); Slab; Computer science; Feature (linguistics); Pattern recognition (psychology); Variable (mathematics); Artificial intelligence; Binary number; Boltzmann machine; Latent variable; Algorithm; Mathematics; Artificial neural network; Physics; Mathematical analysis; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.05242372225847681,"gpt":0.2522785329033527,"spread":0.1998548106448759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001946311,0.0001342887,0.0001532822,0.00009145455,0.00006972663,0.00008252784,0.0005786429,0.00003838184,0.0003113208],"category_scores_gemma":[0.00006020465,0.0001175807,0.00004725908,0.0000800624,0.00006041352,0.0004635441,0.0001862429,0.0002040261,0.000015408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001252499,"about_ca_system_score_gemma":0.00002365085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003421766,"about_ca_topic_score_gemma":0.000005957261,"domain_scores_codex":[0.999015,0.0001014267,0.0002013487,0.0002945313,0.0002471265,0.0001405462],"domain_scores_gemma":[0.9994254,0.00005777407,0.0001219665,0.0001608962,0.0001776183,0.00005631435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001456829,0.0003100952,0.00931099,0.00002124111,0.0002314081,0.00002309845,0.003998969,0.01191464,0.07563404,0.6820582,0.0009259607,0.2154257],"study_design_scores_gemma":[0.0003151338,0.0001531009,0.001009108,0.00003606187,0.000005206787,0.00000354299,0.00004738686,0.9725039,0.01489356,0.01038082,0.0004937896,0.0001583765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0116737,0.0001430424,0.9236388,0.0009805403,0.000234503,0.00007975804,0.00001394189,0.00006649819,0.06316923],"genre_scores_gemma":[0.97993,0.0001305009,0.01886864,0.0001366432,0.00003202166,0.000005127274,0.00000963408,0.000007972974,0.0008793994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9682564,"threshold_uncertainty_score":0.4794804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034370310","doi":"","title":"Detecting Out-of-Distribution Examples with Gram Matrices","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; Dalhousie University","funders":"","keywords":"Gram; Computer science; n-gram; Distribution (mathematics); Mathematics; Artificial intelligence; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.05855191741722271,"gpt":0.2959750540034805,"spread":0.2374231365862577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000846539,0.0000956927,0.00009849961,0.00003132459,0.00009776289,0.0001289715,0.0005374691,0.00002314821,0.0000495813],"category_scores_gemma":[0.00006355473,0.00007830212,0.0000318707,0.0001774349,0.00002378505,0.0001808105,0.0001080618,0.0002639608,0.00002709105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001423553,"about_ca_system_score_gemma":0.00002360428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003972368,"about_ca_topic_score_gemma":0.00001269096,"domain_scores_codex":[0.9991776,0.00004033472,0.0001625261,0.000251965,0.0002550634,0.0001124827],"domain_scores_gemma":[0.9994386,0.00009087189,0.0001744342,0.0001040441,0.0001338455,0.00005818575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009292171,0.00008669547,0.01256874,0.00002627375,0.00007439657,0.00001758256,0.001056441,0.02923629,0.0147649,0.7302577,0.0002000505,0.211618],"study_design_scores_gemma":[0.0002529261,0.0002945378,0.001892589,0.00005140345,0.000005036506,0.00000492845,0.00005893744,0.9840202,0.001895796,0.001262531,0.01010592,0.0001551717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07263299,0.00003339056,0.9148051,0.008328484,0.0001297942,0.0001099836,0.00001336866,0.0002044429,0.003742489],"genre_scores_gemma":[0.9937578,0.00002352422,0.0058326,0.0001917586,0.00008984605,0.00000940721,0.00003633676,0.000005501812,0.00005317314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9547839,"threshold_uncertainty_score":0.3193068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963723885","doi":"","title":"Understanding the Origins of Bias in Word Embeddings","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Word (group theory); Word embedding; Natural language processing; Embedding; Artificial intelligence; TRACE (psycholinguistics); Harm; Machine learning; Linguistics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1021607067859051,"gpt":0.341356417713073,"spread":0.2391957109271678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004814647,0.00009943401,0.0001167081,0.0002191396,0.00004086605,0.0001415154,0.001059983,0.00003967813,0.0001360728],"category_scores_gemma":[0.000202513,0.00006958447,0.00003815636,0.0002552242,0.00003100031,0.0002869657,0.0001980793,0.0005054864,0.00002636856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002258279,"about_ca_system_score_gemma":0.00004925599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001868276,"about_ca_topic_score_gemma":0.00003156546,"domain_scores_codex":[0.9990063,0.00008470783,0.0001920466,0.00022082,0.0003641515,0.0001319327],"domain_scores_gemma":[0.9993303,0.0002153007,0.0001709272,0.0001837385,0.00008125187,0.00001851802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001243342,0.00001330868,0.01729636,0.00000612516,0.000007335012,0.000004496337,0.0006132139,0.0005096245,0.002001495,0.9747549,0.000008413047,0.004772237],"study_design_scores_gemma":[0.0004347606,0.0001299197,0.001468622,0.0004056588,0.000002261109,0.00001411582,0.0003304123,0.8239937,0.00343866,0.1682843,0.001266747,0.0002308921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2328357,0.0002018027,0.7185431,0.009197863,0.0007855084,0.0003194141,0.000003651765,0.0004074719,0.03770554],"genre_scores_gemma":[0.9864337,0.00001325963,0.01292911,0.000174605,0.00001856909,0.000003634293,0.000003248478,0.000006297004,0.0004175359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8234841,"threshold_uncertainty_score":0.2837572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2946506331","doi":"","title":"Unreproducible Research is Reproducible","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.4724560828290626,"gpt":0.5226980919648335,"spread":0.05024200913577093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01861296,0.0001383984,0.0001917989,0.0009332252,0.0002858285,0.00129426,0.002191073,0.00004401937,0.02051268],"category_scores_gemma":[0.008532193,0.0001089198,0.00008414331,0.0010779,0.00008251693,0.0003283952,0.000994087,0.0007433065,0.02327214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007057881,"about_ca_system_score_gemma":0.00008584415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002732041,"about_ca_topic_score_gemma":0.00001476184,"domain_scores_codex":[0.9930608,0.0004727447,0.0005105408,0.002019789,0.003577763,0.0003583769],"domain_scores_gemma":[0.9955863,0.0008159848,0.000195974,0.002094479,0.001214275,0.00009292646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002499044,0.0003078083,0.232913,0.00001227011,0.00008846552,0.00003140987,0.002443715,0.01340742,0.004537428,0.3058331,0.1631552,0.2770203],"study_design_scores_gemma":[0.000374977,0.0001915728,0.009028423,0.00006059491,0.000002204941,0.000006068308,0.001022635,0.2567964,0.0009329895,0.04005526,0.6913149,0.000213937],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3287466,0.00004232678,0.001105739,0.02483306,0.003279746,0.0002733441,0.00001866099,0.0001321535,0.6415684],"genre_scores_gemma":[0.7851908,0.0000100268,0.0004103735,0.0003359949,0.0001663448,0.000005373976,0.00002575633,0.000009576467,0.2138458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5281597,"threshold_uncertainty_score":0.9998193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2804682296","doi":"","title":"Spotlight: Optimizing Device Placement for Training Deep Neural Networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial neural network; Training (meteorology); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06539351812044211,"gpt":0.3354566578305311,"spread":0.270063139710089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002569348,0.0002154832,0.0001690907,0.0001369606,0.0004172554,0.0002533586,0.001095074,0.00005093175,0.0001164553],"category_scores_gemma":[0.0001154711,0.0002110228,0.00007726144,0.000232874,0.00006367364,0.0004708196,0.0002301929,0.0004011495,0.00003996157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007996264,"about_ca_system_score_gemma":0.00002597082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007850728,"about_ca_topic_score_gemma":0.0000288287,"domain_scores_codex":[0.9983739,0.00006610631,0.0003062407,0.0005591974,0.0003097847,0.0003847658],"domain_scores_gemma":[0.9988084,0.0002837137,0.0002138029,0.0002788994,0.0003075863,0.0001075549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007930863,0.00003723112,0.0002791253,0.000003382586,0.00003975934,0.000004772284,0.0008218033,0.4728996,0.0005599742,0.3226863,0.00006065502,0.2025281],"study_design_scores_gemma":[0.0004073191,0.0002343729,0.0001543893,0.00002622048,0.000004943297,0.0000137575,0.00007202035,0.9874833,0.0001771079,0.001917752,0.009287211,0.000221628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003976538,0.00003105908,0.9841475,0.003938471,0.0007386177,0.0002696709,0.000003062427,0.0002991573,0.006595851],"genre_scores_gemma":[0.9034415,0.00001794919,0.0944009,0.00101127,0.0005806795,0.0001531154,0.00003776797,0.00002307382,0.0003336869],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.899465,"threshold_uncertainty_score":0.8605259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034360859","doi":"","title":"Learning with Good Feature Representations in Bandits and in RL with a Generative Model","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Feature (linguistics); Generative model; Generative grammar; Computer science; Artificial intelligence; Feature learning; Machine learning; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03676985648599293,"gpt":0.3016793059080322,"spread":0.2649094494220393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001396669,0.0001553088,0.0001533308,0.0001963088,0.00006383585,0.0002301274,0.000452266,0.00004346145,0.0000147455],"category_scores_gemma":[0.0001466169,0.0001272661,0.00001156448,0.0002871142,0.00004081209,0.000503702,0.0001968386,0.0007994889,0.000003871478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004215606,"about_ca_system_score_gemma":0.00008214632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001090176,"about_ca_topic_score_gemma":0.000352205,"domain_scores_codex":[0.9987976,0.0001169535,0.0001422503,0.0004875796,0.0002999755,0.0001556275],"domain_scores_gemma":[0.9995325,0.00008081152,0.0001085777,0.0001276811,0.00008617042,0.00006426317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004541698,0.0001201021,0.3867161,0.00001929194,0.00006406941,0.0003392762,0.01305251,0.3971556,0.00232004,0.1753837,0.0001294842,0.0242456],"study_design_scores_gemma":[0.0006227838,0.000390454,0.009510461,0.0001282283,0.000002106011,0.00001787546,0.0001655002,0.9878534,0.0003470824,0.0006155302,0.0001831125,0.0001634667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.305977,0.00003492242,0.6438507,0.02425132,0.00003225096,0.0003419724,0.00001930018,0.0003920832,0.02510046],"genre_scores_gemma":[0.9239329,0.00002264084,0.07527363,0.00028884,0.00001875973,0.00003010893,0.00004868552,0.00001110798,0.0003733231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6179559,"threshold_uncertainty_score":0.5189759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963789586","doi":"","title":"Training deep neural networks via direct loss minimization","year":2016,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Minification; Machine learning; Deep neural networks; Entropy (arrow of time); Context (archaeology); Cross entropy; Ranking (information retrieval); Deep learning; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.03707372032486093,"gpt":0.2969850488209083,"spread":0.2599113284960473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001551179,0.0002041561,0.0001632598,0.0001390048,0.0001988178,0.0001450666,0.0009883615,0.00006314666,0.0002098397],"category_scores_gemma":[0.000154109,0.000157545,0.00006933644,0.0002541315,0.00006227908,0.0005817963,0.0002017684,0.0003110419,0.00007638281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007709866,"about_ca_system_score_gemma":0.0000183462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000860107,"about_ca_topic_score_gemma":0.00001740305,"domain_scores_codex":[0.9983779,0.0001277522,0.0002894163,0.0005350242,0.000356534,0.0003133786],"domain_scores_gemma":[0.9988525,0.0003448645,0.0002197507,0.0003011528,0.0001755429,0.0001062269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002658596,0.00002946885,0.002456548,0.000001127247,0.00002276085,0.0000153562,0.0001926615,0.1559985,0.001042656,0.1127259,0.00002270865,0.7274657],"study_design_scores_gemma":[0.0003199411,0.00007013627,0.001013305,0.00002947662,0.000002927914,0.00002550375,0.00000739254,0.9906861,0.0001166467,0.004046128,0.003472648,0.0002097957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00199572,0.00003178687,0.9793006,0.006293365,0.0004990451,0.0001188862,0.000002585572,0.0003631872,0.01139481],"genre_scores_gemma":[0.9897085,0.00006377894,0.008593721,0.0004794838,0.0002559817,0.00004166,0.00002310773,0.00002081869,0.0008129415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9877128,"threshold_uncertainty_score":0.6424497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W18175453","doi":"10.1525/tph.2007.29.3.87","title":"Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs","year":2002,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Oracle; Computer science; Planner; Mathematical optimization; Linear programming; Artificial intelligence; Machine learning; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08004596865886063,"gpt":0.3027935798906811,"spread":0.2227476112318204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000438578,0.0002939538,0.0002492985,0.0005202671,0.0002189153,0.0003912879,0.000911106,0.0001116512,0.0002661272],"category_scores_gemma":[0.0005468033,0.0003073795,0.0001063157,0.0002961423,0.00003431998,0.0008108103,0.0001379966,0.0007696535,0.00009174106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002577042,"about_ca_system_score_gemma":0.00006896994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004275498,"about_ca_topic_score_gemma":0.00000992181,"domain_scores_codex":[0.9976214,0.000149161,0.0005450438,0.0005547928,0.0007178633,0.0004117136],"domain_scores_gemma":[0.9987054,0.0002293574,0.0003478339,0.0002801006,0.0003419766,0.00009530284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002388758,0.0000402911,0.0007095393,0.0000086507,0.00001967703,0.000004901631,0.0006396675,0.9488567,0.0002906632,0.01577782,0.00004980162,0.03357848],"study_design_scores_gemma":[0.001297845,0.0003495623,0.0001110787,0.00009177523,0.000004354752,0.000001369399,0.00004047594,0.9944002,0.0003158694,0.0007590117,0.002307345,0.0003211006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005714335,0.00001472754,0.987839,0.002149628,0.0003596194,0.000363702,0.000002186419,0.0005254503,0.008174283],"genre_scores_gemma":[0.9196168,0.00004237641,0.07337959,0.0003114474,0.00007037633,0.0001160488,0.000169501,0.00003005661,0.006263813],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9190453,"threshold_uncertainty_score":0.9999378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3035618017","doi":"","title":"Improving Transformer Optimization Through Better Initialization","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Power Transformer Diagnostics and Insulation","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Initialization; Computer science; Transformer; Electrical engineering; Engineering; Voltage; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02893562775711362,"gpt":0.2536630670916855,"spread":0.2247274393345718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004875409,0.0001501152,0.0001077412,0.000060238,0.00006717869,0.0001085052,0.0001395621,0.00006462472,0.001017244],"category_scores_gemma":[0.00006570984,0.0001567958,0.00004533407,0.0001105192,0.00001528671,0.0004287148,0.000006846941,0.0003015642,0.00006613775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003878603,"about_ca_system_score_gemma":0.00001368228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002585009,"about_ca_topic_score_gemma":0.000003703167,"domain_scores_codex":[0.9991891,0.00002138141,0.0002330087,0.0001739265,0.00023777,0.0001447949],"domain_scores_gemma":[0.9997359,0.00003010635,0.00004011228,0.00004915905,0.00009016643,0.00005456432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002713969,0.00001367687,0.0009935688,0.00002661266,0.00003923261,0.000003341546,0.0009314829,0.9659685,0.005424358,0.009679059,0.00005809329,0.0168349],"study_design_scores_gemma":[0.0004083718,0.00007649721,0.0002053948,0.00003124253,0.0000105318,0.000001291407,0.0000360806,0.991457,0.002320803,0.0002319934,0.005045383,0.0001753883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007339437,0.00003202155,0.9323246,0.002620829,0.0003866554,0.0001208435,0.00002531842,0.0003092633,0.056841],"genre_scores_gemma":[0.9949431,0.0002315327,0.003210814,0.0009444894,0.0001934579,0.00001230178,0.000407455,0.00003459113,0.00002219915],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9876037,"threshold_uncertainty_score":0.999896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3170865782","doi":"","title":"Environment Inference for Invariant Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Inference; Invariant (physics); Computer science; Benchmark (surveying); Artificial intelligence; Machine learning; Generalization; Domain (mathematical analysis); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04867667267188184,"gpt":0.3042943594813409,"spread":0.2556176868094591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004480733,0.0002213695,0.0002045564,0.0001607582,0.0003213911,0.0005373575,0.0007502225,0.00007953634,0.001149699],"category_scores_gemma":[0.001076201,0.0002300981,0.0001164352,0.0001536348,0.00003941971,0.0003954193,0.0003184841,0.0007258935,0.0003268163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009904318,"about_ca_system_score_gemma":0.0001311195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002383119,"about_ca_topic_score_gemma":0.000007886951,"domain_scores_codex":[0.9979162,0.0002479907,0.0003407217,0.0006288132,0.0005442062,0.0003220757],"domain_scores_gemma":[0.9986851,0.0004466908,0.0002249054,0.0002690419,0.0002460262,0.0001283034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003928259,0.0001046553,0.003564078,0.00001171964,0.00007088757,0.00005884545,0.001085335,0.06121727,0.007545754,0.8346936,0.00005946588,0.09154909],"study_design_scores_gemma":[0.0007656515,0.0001786115,0.001154233,0.00005732675,0.000005838288,0.00002269403,0.0002062722,0.8522096,0.001067171,0.00695359,0.1370773,0.0003017301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002923856,0.00007081348,0.9520864,0.005371264,0.0004877423,0.0001382824,0.000004785062,0.0002347889,0.03868203],"genre_scores_gemma":[0.940451,0.0001530233,0.04604184,0.0007896795,0.0001206631,0.00005053015,0.0001205284,0.00002187523,0.01225093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9375271,"threshold_uncertainty_score":0.9997634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2182286517","doi":"","title":"From PAC-Bayes Bounds to Quadratic Programs for Majority Votes","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Margin (machine learning); Upper and lower bounds; AdaBoost; Bayes' theorem; Mathematics; Quadratic equation; Divergence (linguistics); Minification; Basis (linear algebra); Combinatorics; Computer science; Algorithm; Support vector machine; Mathematical optimization; Artificial intelligence; Machine learning; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.06972141086261915,"gpt":0.3134253480200855,"spread":0.2437039371574663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003967402,0.0002547241,0.0002322114,0.000189253,0.0002663249,0.0004973503,0.001316017,0.00007458041,0.0003608845],"category_scores_gemma":[0.0004147675,0.0002295368,0.0001168021,0.0001799638,0.00003725841,0.0003136933,0.000244499,0.0005040612,0.0002128797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005053839,"about_ca_system_score_gemma":0.00006611843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002250555,"about_ca_topic_score_gemma":0.0001344706,"domain_scores_codex":[0.9981223,0.0001341149,0.000310011,0.0006408662,0.0004492788,0.0003434526],"domain_scores_gemma":[0.9988821,0.0001827195,0.0001705577,0.0003363873,0.0002572632,0.0001709622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000173021,0.0004078175,0.03892098,0.00002153853,0.0001782053,0.00003063926,0.008586193,0.000525916,0.000992944,0.331547,0.000374139,0.6182417],"study_design_scores_gemma":[0.0007776839,0.001010285,0.008348304,0.000151283,0.00001345871,0.000008487855,0.0001914756,0.9140614,0.0007030532,0.05402113,0.02016057,0.0005528086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05630509,0.00003478727,0.9169764,0.005460813,0.001453082,0.0004094567,0.00002795874,0.0005904781,0.01874196],"genre_scores_gemma":[0.8879699,0.000004098717,0.109022,0.0003937655,0.0003454701,0.00009038131,0.00009203155,0.00002039106,0.00206194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9135355,"threshold_uncertainty_score":0.936024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143797877","doi":"","title":"Deep Supervised t-Distributed Embedding","year":2010,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Embedding; Computer science; Deep learning; Pairwise comparison; Scalability; Artificial intelligence; Parametric statistics; Visualization; Architecture; Class (philosophy); Machine learning; Pattern recognition (psychology); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0253908761679612,"gpt":0.2998689291950903,"spread":0.2744780530271291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001985588,0.000133676,0.0001033147,0.0001451721,0.0001622118,0.0003297091,0.0007950383,0.00007442766,0.001605722],"category_scores_gemma":[0.0002470365,0.0001218191,0.00005789212,0.0001223081,0.00002447625,0.0004182282,0.0001741923,0.0007327054,0.0004689711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001853546,"about_ca_system_score_gemma":0.00003320228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004195211,"about_ca_topic_score_gemma":0.0000287094,"domain_scores_codex":[0.998889,0.00005821056,0.000179575,0.0003227754,0.0003597666,0.0001906665],"domain_scores_gemma":[0.9993252,0.0000860778,0.00008881592,0.0002035419,0.000206967,0.00008944586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008613299,0.0002481091,0.01282968,0.00001394821,0.0000809393,0.00008454527,0.001127937,0.009942995,0.2206942,0.4813885,0.0008038251,0.2726992],"study_design_scores_gemma":[0.0003431037,0.00004771651,0.001063094,0.00002884393,0.000001767517,0.00001516062,0.0000413763,0.9849012,0.002539683,0.00372297,0.007136445,0.0001585683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1742419,0.00001151901,0.7691483,0.007726395,0.002218793,0.000131579,0.00001486964,0.0005446965,0.04596199],"genre_scores_gemma":[0.9863181,0.00001147023,0.01258635,0.0003617258,0.0001125302,0.00001231503,0.000134458,0.000008302804,0.0004547207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9749583,"threshold_uncertainty_score":0.9993069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W151435321","doi":"","title":"Gaussian Processes for Bayesian Estimation in Ordinary Differential Equations","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Ode; Ordinary differential equation; Gaussian process; Applied mathematics; Estimation theory; Consistency (knowledge bases); Computer science; Gaussian; Mathematics; Bayesian probability; Mathematical optimization; Bayes estimator; Algorithm; Differential equation; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0237363953957338,"gpt":0.2975774090199679,"spread":0.2738410136242341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002595629,0.0002147154,0.0002016839,0.0003474723,0.0001837627,0.0004503442,0.0009396891,0.0001074185,0.0001386664],"category_scores_gemma":[0.001033554,0.0001990056,0.00005529117,0.0003261188,0.00003576624,0.0006249868,0.0001258502,0.0004373523,0.00003472178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006179936,"about_ca_system_score_gemma":0.0001481508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004867083,"about_ca_topic_score_gemma":0.00009173089,"domain_scores_codex":[0.9984414,0.00009031457,0.0003579594,0.0005037563,0.0003166601,0.0002899189],"domain_scores_gemma":[0.9988862,0.0003433615,0.0002086763,0.0002237764,0.0002535436,0.00008442188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003974821,0.0001237174,0.002942201,0.00006866168,0.00001542479,0.000002544028,0.0003311229,0.00588294,0.0002837435,0.8954255,0.00003338846,0.09485099],"study_design_scores_gemma":[0.000570042,0.0002387881,0.003298302,0.0001502121,0.000004002679,0.000005513064,0.00001575845,0.9301682,0.0001528199,0.06431135,0.000858661,0.0002264072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001483974,0.00001379385,0.9813843,0.006706407,0.0003017181,0.0002005205,0.000007663622,0.0001509862,0.009750665],"genre_scores_gemma":[0.9683072,0.0000134959,0.03060976,0.0002079574,0.00008925253,0.0001027838,0.00008568916,0.00001536416,0.0005685281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9668232,"threshold_uncertainty_score":0.8115212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962725091","doi":"","title":"Structured Generative Models of Natural Source Code","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Generative grammar; Source code; Probabilistic logic; Code (set theory); Context (archaeology); Generative model; Natural language processing; Artificial intelligence; Natural language; Rule-based machine translation; Language model; Statistical model; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02337419429426449,"gpt":0.2985761800977195,"spread":0.275201985803455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002307766,0.0001492234,0.0001622798,0.0001633689,0.00007981932,0.0001439071,0.001112631,0.00005627021,0.00004729625],"category_scores_gemma":[0.0002323227,0.0001239091,0.00005311905,0.0001174163,0.00004710152,0.0003876913,0.0002349973,0.0005145136,0.000006243808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003717016,"about_ca_system_score_gemma":0.00003536528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006285613,"about_ca_topic_score_gemma":0.00002080755,"domain_scores_codex":[0.9987693,0.0001311344,0.0002127673,0.0003144201,0.0004267809,0.0001455396],"domain_scores_gemma":[0.9991246,0.00009071404,0.0002212343,0.0002121122,0.0003115578,0.00003975939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002068627,0.00001489644,0.0002298665,0.000006495604,0.00002155068,0.000002049351,0.0005815797,0.007265333,0.0208331,0.8950265,0.00003377699,0.07596417],"study_design_scores_gemma":[0.0001675368,0.00007094799,0.00004758026,0.00004372487,0.000001897355,0.000007918214,0.00001011616,0.8697361,0.01859652,0.1107294,0.0004630183,0.0001252191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008158857,0.0001475853,0.984733,0.001415031,0.0002585334,0.00006163953,0.000004014442,0.0002899668,0.004931377],"genre_scores_gemma":[0.8198657,0.000006118095,0.1790095,0.0002758902,0.00006049282,0.000004001026,0.00001664918,0.000008563632,0.0007531419],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8624708,"threshold_uncertainty_score":0.5052866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3035353486","doi":"","title":"From Local SGD to Local Fixed Point Methods for Federated Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Bottleneck; Computer science; Fixed point; Saddle point; Mathematical optimization; Context (archaeology); Computation; Operator (biology); Saddle; Convergence (economics); Theoretical computer science; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0574492059463758,"gpt":0.363646518265808,"spread":0.3061973123194321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003992518,0.0002450154,0.0002628316,0.0001763913,0.0002124345,0.0004134484,0.000956311,0.00008850271,0.0003439067],"category_scores_gemma":[0.001459432,0.0002472877,0.00009533363,0.0002891062,0.00004625535,0.0002679616,0.0003616457,0.000581141,0.00009905959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001163392,"about_ca_system_score_gemma":0.00008206874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001570004,"about_ca_topic_score_gemma":0.000005742475,"domain_scores_codex":[0.9980202,0.0002641513,0.0003771145,0.0006981961,0.0003642331,0.0002761564],"domain_scores_gemma":[0.9984888,0.0005123981,0.0001821667,0.0001577283,0.0004248221,0.0002340836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002625168,0.00006282399,0.0002845162,0.000009874116,0.0001052132,0.00001251188,0.002969939,0.3183586,0.005747294,0.2053464,0.0005521856,0.4662881],"study_design_scores_gemma":[0.0004891355,0.0005643157,0.00006120176,0.00005304481,0.000005929494,0.000003235907,0.0001953815,0.9820394,0.004326643,0.004924962,0.00707332,0.0002634432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003318938,0.00001355211,0.979477,0.01647852,0.0003497939,0.0003031723,0.000009814375,0.0006987986,0.002337446],"genre_scores_gemma":[0.5398855,0.000002653837,0.4579564,0.00170804,0.00008692869,0.00005509888,0.00008007597,0.00002003043,0.0002052543],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6636808,"threshold_uncertainty_score":0.9999979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955067198","doi":"","title":"Lorentzian Distance Learning for Hyperbolic Representations","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03603241555476244,"gpt":0.3178020778446282,"spread":0.2817696622898658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002426104,0.0001358853,0.0001736778,0.0002709771,0.0001610994,0.0002777032,0.0009742543,0.00004461401,0.0008676319],"category_scores_gemma":[0.0005272485,0.0001159336,0.0001172687,0.0004197529,0.00002920425,0.0003648775,0.0002042692,0.000364214,0.0004343585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003906212,"about_ca_system_score_gemma":0.00002527421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001110713,"about_ca_topic_score_gemma":0.00001639983,"domain_scores_codex":[0.9986081,0.00008254156,0.0002277414,0.0004952483,0.0003646359,0.0002217637],"domain_scores_gemma":[0.9990347,0.0002878677,0.0001583978,0.0002613258,0.0001848362,0.00007288781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003012227,0.00006835203,0.07094129,0.000006068112,0.00007002683,0.000004816329,0.0001666869,0.01769676,0.0004860332,0.8512849,0.0001177424,0.05912722],"study_design_scores_gemma":[0.0005182434,0.0002250713,0.01329232,0.00002314671,0.000008388783,0.000004924489,0.0001015252,0.8921545,0.0001089952,0.009468938,0.08386598,0.0002279694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03982311,0.00006392193,0.8982388,0.007968049,0.0006668631,0.0002311633,0.00002276686,0.0002732484,0.05271211],"genre_scores_gemma":[0.9803573,0.00004219963,0.004381476,0.0002388739,0.00007862233,0.00002604571,0.0001693104,0.000007537993,0.01469864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9405342,"threshold_uncertainty_score":0.9499961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963642948","doi":"","title":"Synthesizing Programs for Images using Reinforced Adversarial Learning.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Discriminator; MNIST database; Artificial intelligence; Inference; Machine learning; Graphics; Rendering (computer graphics); Adversarial system; Deep learning; Generative grammar; Generative adversarial network; Computer graphics; Reinforcement learning; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.05329083591455927,"gpt":0.3083080371160244,"spread":0.2550172012014652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300883,0.0002485721,0.0002263402,0.0001798449,0.0005287972,0.0006046513,0.0008753447,0.0000836594,0.0001884722],"category_scores_gemma":[0.0007333916,0.0002317691,0.0001415813,0.0001775719,0.000116326,0.0006332155,0.000237886,0.0003808933,0.00006229667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008427634,"about_ca_system_score_gemma":0.00009420902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001376052,"about_ca_topic_score_gemma":0.00001047912,"domain_scores_codex":[0.9981887,0.0001767975,0.0003117757,0.0005432389,0.0003973107,0.0003822035],"domain_scores_gemma":[0.9986196,0.0002197903,0.0002696244,0.0002231532,0.000574885,0.0000929849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006843416,0.0001384283,0.003240314,0.00003188481,0.0004541664,0.00002880536,0.002074343,0.1221491,0.09787249,0.2199061,0.0004465766,0.5529735],"study_design_scores_gemma":[0.000515249,0.0004224121,0.00007943692,0.00008927421,0.00001233493,0.000008254802,0.00006592879,0.9772995,0.007825404,0.0008081389,0.01259997,0.0002741322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003764433,0.00001768614,0.9810079,0.001101321,0.00112136,0.0002674897,0.000003566586,0.0002314233,0.01248483],"genre_scores_gemma":[0.9132045,0.00001249231,0.08330794,0.0001541431,0.001010512,0.00002444041,0.00002643631,0.00002358437,0.002235936],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9094401,"threshold_uncertainty_score":0.9451271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2954460650","doi":"","title":"Empirical Analysis of Beam Search Performance Degradation in Neural Sequence Models","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Degradation (telecommunications); Sequence (biology); Computer science; Artificial neural network; Artificial intelligence; Pattern recognition (psychology); Chemistry; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.1093036857200191,"gpt":0.3857356482147963,"spread":0.2764319624947772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003531174,0.0001181331,0.0002156781,0.0006672557,0.00003218229,0.00007093512,0.000751545,0.00004605621,0.0001004246],"category_scores_gemma":[0.00006584687,0.000109272,0.00007423441,0.00088414,0.0000308273,0.000951172,0.0001759296,0.000434155,0.00001625582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008013279,"about_ca_system_score_gemma":0.00005174659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000108882,"about_ca_topic_score_gemma":0.00001209929,"domain_scores_codex":[0.9986082,0.00008693388,0.0002895684,0.0003470299,0.0004976817,0.0001705888],"domain_scores_gemma":[0.9992535,0.0001140325,0.0001274196,0.0002373977,0.0002309621,0.00003674776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007625914,0.00008331132,0.4262606,0.00001492651,0.00009020739,0.000008500459,0.0005409751,0.4363675,0.007794155,0.03130681,0.000002812227,0.09745401],"study_design_scores_gemma":[0.0001503561,0.000161996,0.0284534,0.00003476455,0.000006680079,0.000002004063,0.00001799447,0.965799,0.004493976,0.0007326402,0.00003989303,0.0001073079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6629065,0.00001825951,0.3326529,0.0004224247,0.00005755664,0.00009021795,0.000003723158,0.00006729786,0.003781112],"genre_scores_gemma":[0.9932989,0.0000830592,0.005991126,0.0001266681,0.000008875547,0.000005286025,0.00003804932,0.000005689638,0.0004422965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5294315,"threshold_uncertainty_score":0.4455983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1870822514","doi":"","title":"A Deeper Look at Planning as Learning from Replay","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Bellman equation; Markov decision process; Function (biology); Temporal difference learning; Markov chain; Equivalence (formal languages); Artificial intelligence; Markov process; Machine learning; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07534542055669481,"gpt":0.3228219604417945,"spread":0.2474765398850997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006121803,0.0003173217,0.0002641012,0.0002656038,0.0002931421,0.0005763469,0.001480363,0.0001262962,0.0008789888],"category_scores_gemma":[0.001417422,0.0003121443,0.00009739104,0.0001914145,0.00006039967,0.000606096,0.0008785866,0.001234068,0.002225579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003370574,"about_ca_system_score_gemma":0.0001619256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003531452,"about_ca_topic_score_gemma":0.00001004438,"domain_scores_codex":[0.9969473,0.0002907915,0.000436358,0.0007236364,0.001187111,0.0004148158],"domain_scores_gemma":[0.9982561,0.0003149444,0.0003828006,0.0004333511,0.0003502779,0.000262551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008889432,0.00002196051,0.05406003,0.000002373339,0.0000759395,0.0001178712,0.00251459,0.8924187,0.000575754,0.04710869,0.0003243824,0.002690773],"study_design_scores_gemma":[0.0008487828,0.0003712697,0.001310515,0.0001199446,0.000008131918,0.0000408134,0.0002549645,0.9564802,0.00037146,0.002431234,0.03738575,0.0003769441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08525012,0.0001053673,0.71848,0.002377513,0.00133237,0.0001574967,0.000002010042,0.0007091971,0.1915859],"genre_scores_gemma":[0.9658251,0.00001834301,0.009287778,0.0006778809,0.0002293661,0.0000144695,0.0001283359,0.0000344765,0.02378424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.880575,"threshold_uncertainty_score":0.9999331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294277889","doi":"","title":"Tensor Analyzers","year":2013,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Multilinear map; Generalization; Tensor (intrinsic definition); Artificial intelligence; Computer science; Latent variable; Face (sociological concept); Factor (programming language); Pattern recognition (psychology); Image (mathematics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0714223381075099,"gpt":0.360528478441711,"spread":0.2891061403342011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008693984,0.0001130726,0.000111704,0.0001193992,0.0001061393,0.0001256322,0.0002501977,0.00003909749,0.01387578],"category_scores_gemma":[0.0001789748,0.00009920695,0.00006458702,0.0000786949,0.0000306371,0.0001099237,0.00003700859,0.0003038542,0.001746663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003559681,"about_ca_system_score_gemma":0.0000127333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008305275,"about_ca_topic_score_gemma":0.000008156733,"domain_scores_codex":[0.9991789,0.00004871019,0.0002007583,0.0001955674,0.0002460564,0.0001299662],"domain_scores_gemma":[0.9993193,0.0001390568,0.0001111106,0.0001421961,0.0002193258,0.00006903819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001038563,0.0001102413,0.005801389,0.000004755132,0.00005619899,0.000002700951,0.0001405447,0.0001397467,0.005779088,0.9754585,0.003766986,0.008729438],"study_design_scores_gemma":[0.001250976,0.0001782888,0.0253989,0.000113766,0.00003661265,0.00004205883,0.0006419148,0.3737107,0.001261696,0.5497018,0.04698068,0.000682606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5116428,0.00001035465,0.01484638,0.02783579,0.0002749444,0.0004196776,0.00002444129,0.0005594555,0.4443862],"genre_scores_gemma":[0.9831653,0.000009562835,0.005293561,0.0004580122,0.00007848698,0.00005912606,0.00004255143,0.00001585223,0.0108776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4715225,"threshold_uncertainty_score":0.9990306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127099514","doi":"","title":"Large-Scale Learning of Embeddings with Reconstruction Sampling","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Vocabulary; Estimator; Context (archaeology); Sampling (signal processing); Artificial neural network; Scale (ratio); Encoder; Computer vision; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05268136800075558,"gpt":0.2867230285038735,"spread":0.234041660503118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003583969,0.0001438782,0.0001644055,0.0002057377,0.0001242338,0.00007742404,0.000595931,0.00005407136,0.0003703275],"category_scores_gemma":[0.0001001725,0.0001294473,0.00004952075,0.0001378219,0.00003667433,0.0004175194,0.0001561264,0.0005539918,0.00002554159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003925078,"about_ca_system_score_gemma":0.00004862518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001055653,"about_ca_topic_score_gemma":0.00002384932,"domain_scores_codex":[0.9986982,0.0000787962,0.0002760703,0.000380463,0.000360605,0.0002058812],"domain_scores_gemma":[0.9991653,0.00005449378,0.0002760472,0.0001927083,0.0002551269,0.00005629988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001676142,0.0001434235,0.1881627,0.00003087159,0.0001219392,0.00001741065,0.01460992,0.0254453,0.005070835,0.6290587,0.00000444584,0.1371668],"study_design_scores_gemma":[0.0004402932,0.0002311332,0.002643672,0.0001775786,0.000005613534,0.00005379999,0.0006614334,0.9902681,0.001512933,0.003189974,0.0006219773,0.0001934999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2085151,0.000009490717,0.7598861,0.0001601534,0.0003086149,0.00005318958,0.000001222851,0.0001370009,0.03092911],"genre_scores_gemma":[0.8971248,0.00001425703,0.1021198,0.00004111136,0.00004635418,0.000005494262,0.000005794388,0.0000111052,0.0006313499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9648228,"threshold_uncertainty_score":0.5278708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034672496","doi":"","title":"Fundamental Tradeoffs between Invariance and Sensitivity to Adversarial Perturbations","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Adversarial system; Computer science; Invariant (physics); Sensitivity (control systems); Artificial intelligence; Robustness (evolution); Class (philosophy); Machine learning; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06015761417466957,"gpt":0.297905287486453,"spread":0.2377476733117834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000369359,0.0002462764,0.0002533445,0.0001467221,0.0002953622,0.0003896888,0.0005404652,0.00007897433,0.0001633121],"category_scores_gemma":[0.001026688,0.0002572868,0.00006209015,0.0002770537,0.000055154,0.0005797307,0.0005957093,0.0008644545,0.0001414938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008535699,"about_ca_system_score_gemma":0.00007696747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001476559,"about_ca_topic_score_gemma":0.0000141867,"domain_scores_codex":[0.9979067,0.0003081234,0.0002815272,0.0006854077,0.0005441864,0.0002740014],"domain_scores_gemma":[0.9988918,0.0003648798,0.0001508949,0.0001852975,0.00011404,0.0002931114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003283298,0.0001149278,0.1363993,0.0000344857,0.0002945494,0.0002638646,0.01317158,0.1141917,0.01104144,0.5877426,0.0004657022,0.1359516],"study_design_scores_gemma":[0.0007496294,0.0002880204,0.02210298,0.0000428126,0.00001118859,0.00001862645,0.0001279954,0.9655361,0.0001399179,0.0008804946,0.009742175,0.0003600199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04701747,0.0000100002,0.8792044,0.06474977,0.0004838726,0.0002238789,0.0000249469,0.0003328826,0.007952775],"genre_scores_gemma":[0.9727452,0.0000063073,0.02370075,0.002711721,0.0005212945,0.000008716353,0.00003980746,0.00001889825,0.0002473211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9257277,"threshold_uncertainty_score":0.999988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034917202","doi":"","title":"On Variational Learning of Controllable Representations for Text without Supervision","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Autoencoder; Computer science; Unsupervised learning; Artificial intelligence; Decoding methods; Space (punctuation); Encoding (memory); Simplex; Sequence (biology); Latent variable; Machine learning; Deep learning; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04101088640936427,"gpt":0.3026475110613343,"spread":0.26163662465197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002653917,0.0001402408,0.0002020045,0.00009895403,0.0001854939,0.0001570252,0.0005059666,0.00004364763,0.000382546],"category_scores_gemma":[0.001379233,0.0001283258,0.00009748625,0.0001484791,0.00002668342,0.0002905203,0.0001045118,0.0002880353,0.00004213218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000251384,"about_ca_system_score_gemma":0.00006678039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005951398,"about_ca_topic_score_gemma":0.00000425402,"domain_scores_codex":[0.9985998,0.0001752112,0.0002849323,0.0003907412,0.0003981958,0.0001511567],"domain_scores_gemma":[0.9986132,0.0005497526,0.0002153804,0.0001260804,0.0004209901,0.00007458988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002233889,0.00005892801,0.003347219,0.000007055471,0.00007907305,0.000001621713,0.0006243497,0.516586,0.01068494,0.4564403,0.0002229825,0.01172409],"study_design_scores_gemma":[0.000925581,0.000460513,0.0009175566,0.00003440223,0.000006998688,8.015925e-7,0.00005370583,0.9896938,0.001391871,0.003450238,0.002941443,0.0001231468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00293748,0.00001543587,0.9722952,0.01148221,0.0002423924,0.0001951989,0.00001443879,0.00007157895,0.01274604],"genre_scores_gemma":[0.9748161,0.00001414502,0.02348114,0.0006354458,0.0001761068,0.00002268686,0.00005872432,0.00001163776,0.000783989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9718786,"threshold_uncertainty_score":0.5232976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3167967639","doi":"","title":"LEGO: Latent Execution-Guided Reasoning for Multi-Hop Question Answering on Knowledge Graphs","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada); University of Alberta","funders":"","keywords":"Computer science; Question answering; Knowledge graph; Hop (telecommunications); Natural language processing; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.08323708750218646,"gpt":0.3583986716908126,"spread":0.2751615841886262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004358942,0.0002013412,0.0001765941,0.000204438,0.0002332474,0.0003232043,0.0005697081,0.00007846749,0.00006520357],"category_scores_gemma":[0.000518092,0.0002088582,0.0001158664,0.0001651156,0.00001953499,0.0003051218,0.0001842987,0.0004450798,0.00005198321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001418806,"about_ca_system_score_gemma":0.0001201859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008068407,"about_ca_topic_score_gemma":0.00005309269,"domain_scores_codex":[0.9983137,0.0001469962,0.000323873,0.0006200853,0.0003331501,0.0002622451],"domain_scores_gemma":[0.9987898,0.0001409301,0.0001538604,0.0002908448,0.000539382,0.00008512315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001942475,0.00009742856,0.003268498,0.00001397872,0.00003588141,0.0000184308,0.0005142319,0.02468551,0.003219931,0.9439581,0.00003616558,0.02413241],"study_design_scores_gemma":[0.000674614,0.00008585377,0.001736591,0.0002980365,0.000005027635,0.00001712074,0.00003491599,0.9890198,0.001792397,0.004242689,0.001872343,0.0002206022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03293076,0.0001334831,0.9568662,0.001942843,0.001312003,0.0001574516,0.000005708362,0.0002741847,0.006377372],"genre_scores_gemma":[0.9301224,0.00005685339,0.06696106,0.0002290815,0.0001305442,0.00004116145,0.00005978507,0.00001777329,0.002381315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9643343,"threshold_uncertainty_score":0.8516991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W55051199","doi":"","title":"True Online TD(lambda)","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Lambda; Computer science; Physics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.03161988976831424,"gpt":0.3009143998948404,"spread":0.2692945101265262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002463955,0.0001505422,0.0001502812,0.000123926,0.0001266168,0.0001086631,0.0006226543,0.00003826095,0.0002013825],"category_scores_gemma":[0.0002986084,0.0001314468,0.00005062791,0.0001015096,0.00003288763,0.0004386154,0.0002246851,0.0003724126,0.0001804777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003450643,"about_ca_system_score_gemma":0.00003037528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009193014,"about_ca_topic_score_gemma":0.00006628566,"domain_scores_codex":[0.9987332,0.00011486,0.0002221041,0.0003628793,0.0003835594,0.0001834095],"domain_scores_gemma":[0.9992266,0.0001039675,0.0001407617,0.0003067106,0.0001487486,0.00007318611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009858044,0.00003269607,0.001211995,0.000003879786,0.00001171927,0.000006201559,0.0001163679,0.001225041,0.0009104921,0.938625,0.00006851343,0.05777821],"study_design_scores_gemma":[0.0003504834,0.0001522779,0.001908291,0.0000704387,0.000001571359,0.00001620792,0.00004227846,0.7061751,0.0002657937,0.003747947,0.2870606,0.000209051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01142474,0.00001830609,0.9487187,0.003586628,0.0008632055,0.00005879503,0.00002048941,0.0002425283,0.03506662],"genre_scores_gemma":[0.9581975,0.00002133553,0.03749115,0.0005878677,0.0002606494,0.000008190985,0.0001134839,0.00001152452,0.003308241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9467728,"threshold_uncertainty_score":0.5360246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963827215","doi":"","title":"Differentiable Compositional Kernel Learning for Gaussian Processes","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Kernel (algebra); Extrapolation; Differentiable function; Generalization; Computer science; Artificial intelligence; Artificial neural network; Gaussian process; Mathematics; Gaussian; Algorithm; Pattern recognition (psychology); Discrete mathematics; Statistics; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02641541766885436,"gpt":0.2961644482254642,"spread":0.2697490305566098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002323055,0.0002804486,0.0002276183,0.0002324147,0.0005789913,0.0007674898,0.001301064,0.00008956126,0.0007076408],"category_scores_gemma":[0.0003417601,0.0002533354,0.00008458924,0.0002901205,0.0001164896,0.0006059737,0.0002399075,0.0004934035,0.000228766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006182768,"about_ca_system_score_gemma":0.0002178491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003232285,"about_ca_topic_score_gemma":0.00002555959,"domain_scores_codex":[0.997983,0.00007448754,0.0003385438,0.000660712,0.0005297249,0.0004135632],"domain_scores_gemma":[0.9983352,0.0001857048,0.000263918,0.0002177422,0.0008640552,0.0001333164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001402083,0.000202723,0.01044305,0.000102729,0.00009731917,0.00001002294,0.0007004408,0.0006117923,0.002576338,0.9650436,0.0004501514,0.01962161],"study_design_scores_gemma":[0.001294876,0.00130585,0.005117195,0.0003830177,0.00001653973,0.00005715833,0.0000964088,0.8960921,0.004940758,0.05652535,0.03345455,0.0007162661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009447845,0.00004169079,0.9332802,0.005216806,0.0005264421,0.000219639,0.00001444547,0.0003854927,0.05086739],"genre_scores_gemma":[0.9773408,0.0000342148,0.01661914,0.0004089843,0.0004158416,0.00006561954,0.0001071335,0.00002362974,0.004984644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9678929,"threshold_uncertainty_score":0.9999919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3094623068","doi":"","title":"How to Train Your Neural ODE: the World of Jacobian and Kinetic Regularization","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Ode; Solver; Regularization (linguistics); Jacobian matrix and determinant; Artificial neural network; Computer science; Convergence (economics); Applied mathematics; Stability (learning theory); Mathematical optimization; Mathematics; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04947007862184124,"gpt":0.2891593166532649,"spread":0.2396892380314237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005086992,0.00008706253,0.00008823979,0.00004502981,0.00006039993,0.0000987322,0.0001407917,0.00001193107,0.0004507898],"category_scores_gemma":[0.00002228373,0.00006602163,0.00003437555,0.0001081791,0.00002690324,0.0000653748,0.00004356242,0.0002515499,0.000004127026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004420895,"about_ca_system_score_gemma":0.000008553085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003013501,"about_ca_topic_score_gemma":0.000006092394,"domain_scores_codex":[0.9994333,0.00005900542,0.0001126066,0.0001600331,0.0001531671,0.00008188762],"domain_scores_gemma":[0.9997095,0.00002855487,0.0000826944,0.00005405085,0.00006151501,0.00006363544],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002307986,0.00005859771,0.02610357,0.00001311939,0.0001023806,0.000002138006,0.002088576,0.09121322,0.02498133,0.6189829,0.0007916134,0.2354318],"study_design_scores_gemma":[0.0003137943,0.000111518,0.003423053,0.00002775728,0.000009441755,0.000001014531,0.0003173393,0.9831844,0.0009822545,0.00136596,0.01014689,0.000116603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6108937,0.00003529651,0.09373313,0.2512605,0.0004826114,0.0004500046,0.0000433303,0.00007631008,0.04302514],"genre_scores_gemma":[0.9946931,0.000002017126,0.0001545535,0.0005115786,0.0002743431,0.000006020972,0.0000340335,0.000008325726,0.004316028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8919712,"threshold_uncertainty_score":0.4935831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953418083","doi":"","title":"Compositional Fairness Constraints for Graph Embeddings","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Adversarial system; Social graph; Recommender system; Theoretical computer science; Inference; Graph; Embedding; Knowledge graph; Machine learning; Artificial intelligence; World Wide Web; Social media","retraction":null,"screen_n_in":null,"score":{"opus":0.05734558416610852,"gpt":0.3996761543348702,"spread":0.3423305701687617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000770322,0.0001073269,0.000136828,0.0001063992,0.000455985,0.0003186643,0.0003344643,0.0001141877,0.003238736],"category_scores_gemma":[0.0005895185,0.0001114055,0.0001036254,0.00007420401,0.0002565122,0.0002809741,0.00003317685,0.0004276804,0.0001465958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008332078,"about_ca_system_score_gemma":0.0001878039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000536539,"about_ca_topic_score_gemma":0.0001891846,"domain_scores_codex":[0.9987172,0.0001176959,0.0001646803,0.0002211106,0.0005433485,0.0002358898],"domain_scores_gemma":[0.998679,0.0004077185,0.0001269917,0.00005930646,0.0006282653,0.00009867213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004739454,0.00003455933,0.006407054,0.000005011601,0.00003651164,0.000001293941,0.002761716,0.0001574942,0.0009625023,0.9864693,0.000136358,0.002980818],"study_design_scores_gemma":[0.004373083,0.0009537662,0.01180037,0.0005739009,0.00004602857,0.00000794978,0.01930876,0.03412803,0.0005509779,0.722622,0.2042097,0.001425503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2570849,0.00001368862,0.004249975,0.03564201,0.001505469,0.0004508626,0.00008895665,0.0001487807,0.7008153],"genre_scores_gemma":[0.9927037,0.00003656121,0.0005186803,0.000983108,0.0002482822,0.00001286553,0.00009972035,0.00001160076,0.005385418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7356188,"threshold_uncertainty_score":0.9976724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W75509695","doi":"","title":"A new Q(lambda) with interim forward view and Monte Carlo equivalence","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Monte Carlo method; Markov decision process; Algorithm; Equivalence (formal languages); Q-learning; Markov process; Mathematical optimization; Artificial intelligence; Mathematics; Discrete mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03106032801753098,"gpt":0.2875444306336761,"spread":0.2564841026161451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330419,0.0002276933,0.0002046415,0.0001633874,0.0001292004,0.0004945613,0.0009886603,0.00005276704,0.0001773677],"category_scores_gemma":[0.0002251644,0.0001937198,0.00004359488,0.0001364179,0.0000549234,0.000477913,0.0003953949,0.0005431382,0.00007747731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004696855,"about_ca_system_score_gemma":0.00007210694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001496113,"about_ca_topic_score_gemma":0.00002425812,"domain_scores_codex":[0.9982998,0.000119027,0.0002531566,0.0004691745,0.0005884228,0.0002704178],"domain_scores_gemma":[0.9990155,0.0001458243,0.0002095019,0.0003118852,0.0001628502,0.0001544155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001045232,0.00002605205,0.02129933,0.00004223515,0.0001170243,0.00002630632,0.001338486,0.3001727,0.000511555,0.4652646,0.0002074405,0.2108897],"study_design_scores_gemma":[0.0005625435,0.0007122847,0.001806736,0.0002505214,0.000007570677,0.00003886014,0.00002873256,0.9799035,0.000114495,0.0008080657,0.01550436,0.0002623498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005802064,0.00003945333,0.9613203,0.003180261,0.0002738818,0.0001015089,6.267881e-7,0.0001868754,0.02909502],"genre_scores_gemma":[0.9646347,0.00007349564,0.02952764,0.0005087558,0.00009552104,0.000008056833,0.000004363942,0.00001789247,0.005129643],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9588326,"threshold_uncertainty_score":0.7899665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963558557","doi":"","title":"A Spectral Approach to Gradient Estimation for Implicit Distributions.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Groundwater flow and contamination studies","field":"Environmental Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Estimator; Applied mathematics; Mathematics; Inference; Kernel (algebra); Computer science; Algorithm; Mathematical optimization; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02879580352621477,"gpt":0.2923980745180018,"spread":0.2636022709917871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001726596,0.0001178838,0.00009451852,0.00005717425,0.0002701636,0.00009011866,0.000219828,0.00002600218,0.0006081015],"category_scores_gemma":[0.0001043186,0.0001052659,0.00004617729,0.0001028966,0.00006984961,0.000121374,0.0001055907,0.0001074825,0.000510602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001747352,"about_ca_system_score_gemma":0.000006106851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001624705,"about_ca_topic_score_gemma":0.00006473434,"domain_scores_codex":[0.9990762,0.0000273894,0.0001592743,0.0002952016,0.0002530425,0.0001888452],"domain_scores_gemma":[0.9997031,0.00003118368,0.00006012931,0.00009087565,0.00005117734,0.00006354243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000405005,0.0005458705,0.06641003,0.0000139271,0.000141128,0.000002384158,0.004052908,0.01213526,0.0128198,0.6067488,0.00453743,0.2921875],"study_design_scores_gemma":[0.0008565224,0.0007749107,0.1252834,0.0000274374,0.00002003723,0.00001306782,0.0002221651,0.7706581,0.002013907,0.006217706,0.09349621,0.0004164733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1889231,0.000001791428,0.76294,0.002468949,0.0002260072,0.0002655817,0.00003376005,0.00006568514,0.04507509],"genre_scores_gemma":[0.9866384,0.00000121507,0.007985272,0.0002542686,0.0001069545,0.0001141683,0.0001432949,0.000008434858,0.004747998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7977152,"threshold_uncertainty_score":0.6658285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964278219","doi":"","title":"Thompson Sampling for Combinatorial Semi-Bandits.","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Regret; Thompson sampling; Matroid; Oracle; Sampling (signal processing); Mathematics; Mathematical optimization; Independence (probability theory); Computer science; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.2722630354409833,"gpt":0.5115727209194741,"spread":0.2393096854784908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002113881,0.0001987094,0.0002655023,0.0003421449,0.0004525436,0.0005660841,0.001254632,0.00009751853,0.003815005],"category_scores_gemma":[0.009208562,0.0001597294,0.0001263966,0.0003219855,0.0001887537,0.0003482532,0.0002205131,0.0005565715,0.0008005794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001156936,"about_ca_system_score_gemma":0.0001129099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002740748,"about_ca_topic_score_gemma":0.00002630027,"domain_scores_codex":[0.9963433,0.0001848431,0.0005057901,0.0006658003,0.001917236,0.0003830658],"domain_scores_gemma":[0.9956352,0.001881902,0.000279973,0.0003098725,0.001761424,0.0001316778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00301212,0.0003969056,0.01931644,0.00001495918,0.0002164804,0.00002651023,0.001865699,0.01281339,0.009623867,0.4660295,0.005327412,0.4813567],"study_design_scores_gemma":[0.001792186,0.0008651336,0.001680142,0.0000543652,0.000005380748,0.000009800691,0.0003037155,0.5374383,0.002210197,0.1996202,0.2556994,0.0003211928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0388727,0.00005643524,0.876223,0.007860162,0.009188243,0.0006977632,0.0001550353,0.0002613452,0.06668529],"genre_scores_gemma":[0.9862724,0.00001403295,0.003384513,0.0001599853,0.001883771,0.00003815724,0.00006253165,0.00002628151,0.008158306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9473997,"threshold_uncertainty_score":0.9999774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963408680","doi":"","title":"DVAE++: Discrete Variational Autoencoders with Overlapping Transformations","year":2018,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Latent variable; Prior probability; Transformation (genetics); Softmax function; Smoothing; Computer science; Artificial intelligence; Algorithm; Mathematics; Applied mathematics; Convolutional neural network; Statistics; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.02068640998251981,"gpt":0.2663003432703145,"spread":0.2456139332877947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002171691,0.0001638145,0.0001243398,0.0001501398,0.0003567387,0.0003685314,0.0005970229,0.00003878732,0.0005403825],"category_scores_gemma":[0.00007292841,0.0001328874,0.00005179869,0.0002011486,0.00008180848,0.0008465425,0.00007151841,0.0002668525,0.0001283672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005352894,"about_ca_system_score_gemma":0.0001007103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007278909,"about_ca_topic_score_gemma":0.00006438242,"domain_scores_codex":[0.9986903,0.0001030593,0.0002105417,0.0003287503,0.0004560988,0.0002112473],"domain_scores_gemma":[0.9992168,0.00008796091,0.0001276897,0.0001728912,0.0003237125,0.00007093955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008060288,0.00005816759,0.001085159,0.000003648147,0.0001576306,0.000008836001,0.001938887,0.1507157,0.001281451,0.8209771,0.000230354,0.02346241],"study_design_scores_gemma":[0.0003559931,0.0002202653,0.00178489,0.00004283572,0.0000056324,0.00001008924,0.00005086196,0.9836002,0.0002346079,0.002584863,0.01092816,0.0001816115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005310574,0.000006664967,0.9143276,0.006825495,0.0003451816,0.00008349942,0.000007702733,0.0001139453,0.07775885],"genre_scores_gemma":[0.9376459,0.00002055476,0.06067841,0.0004509002,0.0002700943,0.0000132815,0.00003461638,0.000009621408,0.0008765905],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9371149,"threshold_uncertainty_score":0.5916809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3169514089","doi":"","title":"EMaQ: Expected-Max Q-Learning Operator for Simple Yet Effective Offline and Online RL","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada); University of Alberta; University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Backup; Heuristic; Operator (biology); Online and offline; Offline learning; Simple (philosophy); Artificial intelligence; Generative grammar; Machine learning; Mathematical optimization; Theoretical computer science; Online learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02841059612818234,"gpt":0.3196032698915692,"spread":0.2911926737633869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003741838,0.0002838166,0.0003060751,0.00019077,0.0003211228,0.0005545137,0.0006336739,0.00009746385,0.0002814477],"category_scores_gemma":[0.002162023,0.0002823384,0.00009557708,0.0002334735,0.00005185902,0.000402269,0.0004903233,0.0008313278,0.00003970401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009253198,"about_ca_system_score_gemma":0.0001279484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003610417,"about_ca_topic_score_gemma":0.00002570941,"domain_scores_codex":[0.9978267,0.0002624973,0.0003843544,0.0006788222,0.0004998803,0.0003477224],"domain_scores_gemma":[0.997979,0.0006722108,0.0002370268,0.0002739126,0.0007085316,0.0001293354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001456156,0.0002075016,0.02372496,0.00007704897,0.0003261793,0.000135079,0.001893786,0.6653191,0.01118075,0.2327152,0.0003128591,0.06396199],"study_design_scores_gemma":[0.00112873,0.0004765503,0.002694733,0.0001104027,0.00001249655,0.00003676293,0.0002307774,0.9731099,0.001228838,0.0007876402,0.01986218,0.0003209967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06487779,0.000131236,0.9254411,0.003099932,0.0006934142,0.0003956419,0.000022545,0.0003496301,0.004988674],"genre_scores_gemma":[0.9710746,0.00008260257,0.02286286,0.0005726183,0.0001969263,0.00005332482,0.0004242998,0.00003416512,0.004698557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9061968,"threshold_uncertainty_score":0.9999629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034890132","doi":"","title":"Few-shot Relation Extraction via Bayesian Meta-learning on Task Graphs","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Relationship extraction; Computer science; Leverage (statistics); Parameterized complexity; Relation (database); Artificial intelligence; Bayesian probability; Graph; Machine learning; Theoretical computer science; Algorithm; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.08655251143981235,"gpt":0.3171795000600261,"spread":0.2306269886202137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003863985,0.0002554343,0.0002495403,0.000233402,0.0002490278,0.0003180549,0.000759221,0.0000985466,0.0006738086],"category_scores_gemma":[0.0003954743,0.0002412601,0.0001747546,0.0002468704,0.00002188445,0.0006278611,0.0001483845,0.001287213,0.0002340535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007793116,"about_ca_system_score_gemma":0.0000424618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007967018,"about_ca_topic_score_gemma":0.00001090589,"domain_scores_codex":[0.9976479,0.0002937448,0.0003816228,0.000692641,0.0007422528,0.0002418211],"domain_scores_gemma":[0.9989676,0.0001840739,0.0003036456,0.0002310774,0.0001680975,0.0001455233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001401649,0.0001054905,0.01000823,0.00002004863,0.0005152182,0.00007018264,0.002359704,0.3575454,0.01290821,0.5200874,0.00007464169,0.09616527],"study_design_scores_gemma":[0.000302057,0.0002601819,0.001392734,0.00002671374,0.00002919387,0.00001187103,0.00003791158,0.9875391,0.0003755149,0.004956071,0.004828164,0.0002404817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01094389,0.0000356315,0.946357,0.0144569,0.0004937249,0.0001370154,0.000002071115,0.0004418184,0.02713193],"genre_scores_gemma":[0.9904648,0.0000253228,0.007409011,0.00119977,0.0001705639,0.00001917657,0.00004239591,0.00002143302,0.000647513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9795209,"threshold_uncertainty_score":0.98383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962807943","doi":"","title":"Adaptive Consensus ADMM for Distributed Optimization","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Node (physics); Computer science; Convergence (economics); Reliability (semiconductor); Rate of convergence; Mathematical optimization; Mathematics; Key (lock); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05713070033778866,"gpt":0.328165303351882,"spread":0.2710346030140934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003631801,0.0001831995,0.0001699661,0.0001102979,0.0007948632,0.0007648279,0.001406109,0.00007041565,0.0001410987],"category_scores_gemma":[0.001218422,0.000173713,0.00008827289,0.00004413503,0.00006550115,0.0002614632,0.0002574296,0.0003237631,0.00005283605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005473527,"about_ca_system_score_gemma":0.00007121539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000139851,"about_ca_topic_score_gemma":0.00001936614,"domain_scores_codex":[0.998683,0.00009232976,0.0002206147,0.0004427151,0.0003189165,0.0002424524],"domain_scores_gemma":[0.9985272,0.0001813912,0.0003819755,0.0004458934,0.0003737248,0.00008982731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000190485,0.00009565234,0.003554873,0.000008284664,0.0000929931,0.0000196171,0.0002560344,0.3510911,0.000101796,0.5477889,0.0005770632,0.09622324],"study_design_scores_gemma":[0.0008381118,0.0002101502,0.001666131,0.0000462265,0.000005427555,0.000008955375,0.00002046565,0.982014,0.00007167527,0.002770113,0.01214946,0.0001992701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001999874,0.00001223312,0.9573048,0.01345284,0.0007255094,0.0001693116,0.00004644705,0.000229277,0.02605974],"genre_scores_gemma":[0.9528857,0.00001023782,0.04430981,0.0001852636,0.0001493463,0.00002973242,0.0001265701,0.00001437895,0.002288966],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9508858,"threshold_uncertainty_score":0.7375253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W65834064","doi":"","title":"Clustering in the Presence of Background Noise","year":2014,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Robustness (evolution); Computer science; Centroid; CURE data clustering algorithm; Data mining; Cluster (spacecraft); Correlation clustering; Noise (video); Algorithm; Constrained clustering; Canopy clustering algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05514190194778961,"gpt":0.3496198438620368,"spread":0.2944779419142471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008788844,0.0001130528,0.0001248578,0.0001839517,0.00006891834,0.0001609915,0.001916947,0.00003294586,0.00005326893],"category_scores_gemma":[0.0004309884,0.00008726597,0.00003728773,0.0002313466,0.00005870351,0.0003212574,0.0004181406,0.0005339361,0.00003445214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004217762,"about_ca_system_score_gemma":0.00002947278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001539362,"about_ca_topic_score_gemma":0.00005470949,"domain_scores_codex":[0.9983081,0.0003005073,0.0002373465,0.0002956724,0.0006465805,0.0002118177],"domain_scores_gemma":[0.9988675,0.0005044312,0.0001155253,0.0003414567,0.000136161,0.00003499704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009826154,0.0001969774,0.00987826,0.00005180586,0.00003132355,0.00004215555,0.003690375,0.2325285,0.007557661,0.4098033,0.00003089835,0.3360905],"study_design_scores_gemma":[0.0002813929,0.0001251178,0.005237179,0.0000721268,5.468239e-7,0.00001329988,0.00009921116,0.9899597,0.0001851234,0.002654627,0.001281402,0.00009023531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03359577,0.00001492442,0.9333991,0.003302906,0.0002540534,0.0001194188,0.000001489545,0.00005322482,0.02925914],"genre_scores_gemma":[0.9850756,0.0000175884,0.01420903,0.0001429581,0.00005652789,0.00001537423,0.000003471895,0.000007104697,0.0004723499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9514798,"threshold_uncertainty_score":0.3562197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3094191864","doi":"","title":"Learning the Stein Discrepancy for Training and Evaluating Energy-Based Models without Sampling","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial neural network; Sampling (signal processing); Function (biology); Artificial intelligence; Training set; Goodness of fit; Energy (signal processing); Feature (linguistics); Data modeling; Machine learning; Algorithm; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1657884621947862,"gpt":0.3439734482612751,"spread":0.1781849860664889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005813929,0.000194163,0.000197806,0.00005899052,0.0004873062,0.0004924513,0.0005680693,0.00004084672,0.00003163981],"category_scores_gemma":[0.0006461898,0.0001480191,0.00008175422,0.0001144535,0.00004591066,0.0003616203,0.0001630381,0.000393723,0.000002393877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002369067,"about_ca_system_score_gemma":0.00008889322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005542408,"about_ca_topic_score_gemma":0.00001090725,"domain_scores_codex":[0.9983894,0.0002646779,0.0002523707,0.000485983,0.0003680173,0.0002396016],"domain_scores_gemma":[0.9988747,0.0005066966,0.0002036074,0.0001245889,0.0002001448,0.00009031175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005697136,0.00001026115,0.0004337061,0.000006426517,0.00004549858,0.000001268869,0.00287167,0.668367,0.002292789,0.1266963,0.000006009805,0.1992121],"study_design_scores_gemma":[0.0004910691,0.0003395466,0.00005545532,0.00006420003,0.00001065231,0.000001677531,0.0003209356,0.990494,0.000284058,0.005648018,0.002111867,0.0001785075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005736857,0.00006905381,0.9806064,0.011281,0.0001406595,0.000132702,0.000004019802,0.0001126676,0.001916676],"genre_scores_gemma":[0.9164335,0.00001556422,0.08196206,0.00108803,0.0002455908,0.00003984381,0.00002006741,0.00001798696,0.0001773503],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9106966,"threshold_uncertainty_score":0.6036042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}