{"meta":{"query_hash":"9cb4c79e07f9","filters":{"venue":"International Conference on Artificial Intelligence and Statistics"},"cohort_total":69,"direct_labels_cover":0,"predictions_cover":69,"exported":69,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9cb4c79e07f9","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Artificial+Intelligence+and+Statistics"},"results":[{"id":"W193851967","doi":"","title":"Tempered Markov Chain Monte Carlo for training of Restricted Boltzmann Machines","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov chain Monte Carlo; Boltzmann machine; Monte Carlo method; Computer science; Statistical physics; Markov chain; Markov chain mixing time; Parallel tempering; Boltzmann constant; Direct simulation Monte Carlo; Monte Carlo molecular modeling; Markov model; Markov property; Artificial intelligence; Dynamic Monte Carlo method; Mathematics; Physics; Machine learning; Artificial neural network; Statistics; Thermodynamics","score_opus":0.0921970941412643,"score_gpt":0.3253742672901905,"score_spread":0.23317717314892616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193851967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007162992,0.000009414968,0.9887243,0.0012310679,0.001134171,0.00019052644,0.00028949504,0.000025877443,0.0012321612],"genre_scores_gemma":[0.82714665,0.00004065939,0.17235461,0.00009320805,0.00016306285,0.00001883371,0.000014644182,0.0000070622773,0.00016126674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987757,0.000051809002,0.00040629855,0.00032770095,0.0002462465,0.00019220349],"domain_scores_gemma":[0.9984714,0.00054167496,0.00017207587,0.0002031046,0.00053169276,0.00008004659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027656328,0.00015339679,0.00019890234,0.00013191169,0.000118666496,0.00019045247,0.0005074232,0.00006807501,0.000072440576],"category_scores_gemma":[0.0007862357,0.00013984124,0.0000453419,0.00011565081,0.0001496784,0.0001767307,0.00007343703,0.00016401727,0.0000046488735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006749313,0.00004484468,0.00002979235,0.000005369207,0.000024928837,0.0000035609228,0.0006487055,0.00043256267,0.013915536,0.61577743,0.00021023721,0.3688395],"study_design_scores_gemma":[0.00005242021,0.00017379185,0.00031809122,0.00002424936,0.00000754367,0.0000039448532,0.0002682314,0.9033294,0.007051245,0.088175945,0.00043588007,0.00015926856],"about_ca_topic_score_codex":0.00011378768,"about_ca_topic_score_gemma":0.00035479714,"teacher_disagreement_score":0.9028968,"about_ca_system_score_codex":0.000009849319,"about_ca_system_score_gemma":0.00009242984,"threshold_uncertainty_score":0.570256},"labels":[],"label_agreement":null},{"id":"W2101806650","doi":"","title":"{PAC-Bayesian Theory for Transductive Learning}","year":2014,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Moncton","funders":"","keywords":"Artificial intelligence; Bayesian probability; Generalization; Computer science; Generalization error; Machine learning; Probably approximately correct learning; Inductive bias; Multi-task learning; Stability (learning theory); Mathematics","score_opus":0.053925697791907215,"score_gpt":0.3345362810595931,"score_spread":0.2806105832676859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101806650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022535691,0.0000064581563,0.9900933,0.002041268,0.00060963293,0.00010968323,0.000038092778,0.000074616466,0.006801603],"genre_scores_gemma":[0.86625636,0.000026859925,0.13218294,0.00034497277,0.00022017703,0.000014569302,0.00002727015,0.000009764636,0.0009170908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998777,0.00016003143,0.0002548973,0.0003678689,0.00024131511,0.00019891352],"domain_scores_gemma":[0.9985589,0.0008491662,0.00009717409,0.00014756634,0.00026149256,0.00008569567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000617075,0.00014676459,0.00014172282,0.0001081206,0.00018967946,0.00029853295,0.00045782398,0.00005124329,0.00011936735],"category_scores_gemma":[0.00079329615,0.00013511714,0.00003784299,0.00007547474,0.00011913906,0.00013474925,0.00004254268,0.00022090673,0.000046252255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035336685,0.000025805359,0.0000075800963,0.0000030349347,0.000010789006,0.000001139403,0.00053580856,0.00033078244,0.000086198284,0.605359,0.00004716298,0.39355734],"study_design_scores_gemma":[0.000026179525,0.00025252695,0.000027432003,0.0000114442,0.0000034858372,0.0000035508451,0.00016706249,0.51465577,0.00060646684,0.48222008,0.0019180136,0.000107988795],"about_ca_topic_score_codex":0.000016390271,"about_ca_topic_score_gemma":0.000017859167,"teacher_disagreement_score":0.866031,"about_ca_system_score_codex":0.000016915945,"about_ca_system_score_gemma":0.000039752435,"threshold_uncertainty_score":0.55099165},"labels":[],"label_agreement":null},{"id":"W2117499988","doi":"","title":"The Difficulty of Training Deep Architectures and the Effect of Unsupervised Pre-Training","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":323,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Artificial intelligence; Computer science; Initialization; Robustness (evolution); Deep learning; Training (meteorology); Machine learning; Deep neural networks; Unsupervised learning; Training set","score_opus":0.051975758152895186,"score_gpt":0.3078173894272081,"score_spread":0.2558416312743129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117499988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02852775,0.0000779141,0.9686359,0.0016015804,0.00019374759,0.00016077604,0.000020570702,0.000009007502,0.00077276526],"genre_scores_gemma":[0.9907714,0.00012861313,0.008945464,0.00007481471,0.000052375817,0.0000052892583,0.0000024558826,0.0000025427348,0.000017038768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887705,0.00021496441,0.00033090368,0.00018473009,0.0002554294,0.0001369002],"domain_scores_gemma":[0.99743176,0.0020752088,0.00015208121,0.00015087731,0.00015241951,0.00003765902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059365045,0.00011891731,0.00019588236,0.000041664476,0.00016896806,0.00015665287,0.0004354919,0.000028919061,0.000009269998],"category_scores_gemma":[0.0007153387,0.00006370814,0.00003697781,0.00008065949,0.00045948505,0.000053908738,0.000055695335,0.000117940755,6.4817647e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001662374,0.0000071258796,0.000011166026,0.0000022125826,0.000019331093,8.856098e-7,0.0036807284,0.0013723038,0.0008520117,0.43898973,0.0000048090947,0.5548935],"study_design_scores_gemma":[0.00011211324,0.00045723448,0.0011427732,0.00004265944,0.000012887913,0.000004723776,0.00065351115,0.80071,0.008951396,0.1878019,0.00002558819,0.000085186926],"about_ca_topic_score_codex":0.000025941235,"about_ca_topic_score_gemma":0.000056119577,"teacher_disagreement_score":0.9622437,"about_ca_system_score_codex":0.000005448499,"about_ca_system_score_gemma":0.000028466102,"threshold_uncertainty_score":0.25979424},"labels":[],"label_agreement":null},{"id":"W213438331","doi":"","title":"{Near-optimal max-affine estimators for convex regression}","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Affine transformation; Estimator; Applied mathematics; Logarithm; Lipschitz continuity; Mathematical optimization; Nonlinear regression; Convex function; Affine combination; Rate of convergence; Regular polygon; Regression analysis; Statistics; Computer science; Mathematical analysis","score_opus":0.17412430085091807,"score_gpt":0.36123885276550244,"score_spread":0.18711455191458437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213438331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011620566,0.000026310998,0.9803724,0.00032990368,0.00082820276,0.00016116888,0.00020846627,0.00021095807,0.006241991],"genre_scores_gemma":[0.9040152,0.000068101646,0.09545384,0.00009419806,0.00012109918,0.0000209083,0.00006586169,0.000019880263,0.00014092456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915534,0.00001559341,0.00026482786,0.0001869633,0.00020990544,0.00016737363],"domain_scores_gemma":[0.99920225,0.0001588773,0.00004671699,0.000120592435,0.0003602473,0.00011129123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012852805,0.00015724511,0.00015738359,0.000072462346,0.00006252304,0.00017311034,0.00016860523,0.000068331996,0.00015014908],"category_scores_gemma":[0.00025519516,0.0001451571,0.000023641875,0.000048474554,0.00012776683,0.000078141355,0.00003088213,0.000117000454,0.000048420614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020095619,0.000055409382,0.00005010748,0.000011163498,0.000050342962,0.000025928419,0.0005171562,0.0138638625,0.001385941,0.7571323,0.012177509,0.2145293],"study_design_scores_gemma":[0.000041884654,0.00015064118,0.000018070026,0.000056568948,0.000009300771,0.0000096373415,0.00027202404,0.86090696,0.014445245,0.120110154,0.0038015035,0.00017798808],"about_ca_topic_score_codex":0.000017847891,"about_ca_topic_score_gemma":0.000017193594,"teacher_disagreement_score":0.8923946,"about_ca_system_score_codex":0.000037368845,"about_ca_system_score_gemma":0.000047023426,"threshold_uncertainty_score":0.5919335},"labels":[],"label_agreement":null},{"id":"W2144414892","doi":"","title":"HOP-MAP: Efficient Message Passing with High Order Potentials","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Message passing; Inference; Computer science; Hop (telecommunications); Probabilistic logic; Maximum a posteriori estimation; A priori and a posteriori; Class (philosophy); Theoretical computer science; Representation (politics); Exponential function; Algorithm; Artificial intelligence; Distributed computing; Mathematics; Computer network; Maximum likelihood","score_opus":0.05460748480378558,"score_gpt":0.31069884011952786,"score_spread":0.2560913553157423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144414892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127303265,0.000006503464,0.98086274,0.0028596276,0.0011781174,0.000111760804,0.000073475465,0.00008984827,0.002087595],"genre_scores_gemma":[0.8261513,0.000021890604,0.17326948,0.00026655814,0.00010177621,0.000011541371,0.000018882716,0.000010316895,0.0001482479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981597,0.00005819529,0.0003917781,0.00053290406,0.00055529835,0.00030213333],"domain_scores_gemma":[0.9983953,0.00023272377,0.00015378614,0.00033921265,0.0007198287,0.00015912851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034560892,0.0002301272,0.00019301305,0.00015089859,0.0002181952,0.00081807113,0.0007185209,0.000095821095,0.00028129926],"category_scores_gemma":[0.00018255775,0.0001905365,0.000023639808,0.00018479019,0.00025414117,0.00019401302,0.00013343403,0.00040955524,0.00014039774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028774413,0.000091883965,0.000018486056,0.0000044977023,0.000018024613,0.000032864136,0.00023630787,0.0010772798,0.0049272585,0.85273504,0.000055975674,0.1407736],"study_design_scores_gemma":[0.00005629953,0.00019623485,0.00018000958,0.00006478725,0.000011194544,0.000027989634,0.00015744609,0.710277,0.009386385,0.27904338,0.00025538792,0.00034384333],"about_ca_topic_score_codex":0.00011713395,"about_ca_topic_score_gemma":0.00017814233,"teacher_disagreement_score":0.813421,"about_ca_system_score_codex":0.000019910436,"about_ca_system_score_gemma":0.00017535697,"threshold_uncertainty_score":0.7888679},"labels":[],"label_agreement":null},{"id":"W2154096410","doi":"","title":"Modeling annotator expertise: Learning when everybody knows a bit of something","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Artificial intelligence; Machine learning; Domain (mathematical analysis); Task (project management); Space (punctuation); Agreement; Natural language processing; Training set; Variable (mathematics)","score_opus":0.0815228368451885,"score_gpt":0.32873891522444226,"score_spread":0.24721607837925375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154096410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067146294,0.000016767633,0.929545,0.000477826,0.0007904036,0.00007441006,0.000017379178,0.00006014245,0.0018718052],"genre_scores_gemma":[0.9049788,0.00003858923,0.09464713,0.0000950042,0.00010063996,0.000006277339,0.00000753983,0.000009971207,0.00011605019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984047,0.000071897564,0.0004866121,0.00038866734,0.00041989598,0.00022827071],"domain_scores_gemma":[0.9986982,0.0002899808,0.00014518635,0.00024711163,0.00051230745,0.00010721291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900097,0.00016777257,0.00019601722,0.00020577594,0.00017423357,0.00035998132,0.0005176828,0.00008827969,0.000121859244],"category_scores_gemma":[0.00078398804,0.00016557163,0.000040113333,0.00011461416,0.000136202,0.00027387243,0.00014652082,0.00046745723,0.000031745665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023223043,0.0000483832,0.000050492366,0.000008000456,0.000015308062,0.000011202712,0.0025245445,0.0053027933,0.02497779,0.7165547,0.00002183716,0.2504617],"study_design_scores_gemma":[0.000026190963,0.00009163652,0.000015068728,0.00006272485,0.0000043409073,0.000013803178,0.00054408057,0.8817701,0.010069325,0.107105635,0.00013336053,0.00016378841],"about_ca_topic_score_codex":0.00018033771,"about_ca_topic_score_gemma":0.00010573355,"teacher_disagreement_score":0.8764672,"about_ca_system_score_codex":0.000020266521,"about_ca_system_score_gemma":0.000105288396,"threshold_uncertainty_score":0.6751815},"labels":[],"label_agreement":null},{"id":"W2170307371","doi":"","title":"On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning","year":2014,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Frequentist inference; Bayesian optimization; Computer science; Machine learning; Bayesian probability; Artificial intelligence; Constraint (computer-aided design); Feature (linguistics); Function (biology); Mathematical optimization; Bayesian inference; Mathematics","score_opus":0.100663809997761,"score_gpt":0.4084052332996377,"score_spread":0.3077414233018767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170307371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043891757,0.0000020236896,0.99346817,0.0007588559,0.0000719133,0.0002859669,0.00008504647,0.000023220864,0.00091564725],"genre_scores_gemma":[0.92349505,0.000010258358,0.076064885,0.00019335811,0.000021249994,0.000033258075,0.00006847082,0.000010215233,0.00010322788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977874,0.00015948899,0.00048304832,0.00047079148,0.0009197857,0.00017944683],"domain_scores_gemma":[0.99717706,0.0018686106,0.00016816777,0.00016380541,0.0005014008,0.00012094323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010276891,0.00015270595,0.00018720885,0.000474108,0.00012923041,0.00029270176,0.00023320837,0.00005968089,0.00025147529],"category_scores_gemma":[0.0035452023,0.00012468472,0.000011502423,0.0002898249,0.00022618358,0.00015000036,0.000038839084,0.0002407994,0.00007836451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012849986,0.00003647511,0.00027560288,0.000002016048,0.0000023077935,0.0000017264441,0.00012891678,0.6343229,0.000031540294,0.13092735,0.000007707282,0.23413499],"study_design_scores_gemma":[0.000093291485,0.00035114243,0.00029891953,0.000044829314,0.0000024347353,0.0000022253053,0.00015951911,0.8606589,0.00017014281,0.13807252,0.000022293629,0.00012379888],"about_ca_topic_score_codex":0.000026896105,"about_ca_topic_score_gemma":0.0002606476,"teacher_disagreement_score":0.9191059,"about_ca_system_score_codex":0.000063124644,"about_ca_system_score_gemma":0.00007198884,"threshold_uncertainty_score":0.50844955},"labels":[],"label_agreement":null},{"id":"W2182753936","doi":"","title":"Asymptotic Theory for Linear-Chain Conditional Random Fields","year":2011,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; CRFS; Conditional random field; Sequence (biology); Hessian matrix; Ergodicity; Applied mathematics; Feature (linguistics); Consistency (knowledge bases); Exponential family; Ergodic theory; Inference; Discrete mathematics; Statistics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.15941988105138544,"score_gpt":0.35806462897219055,"score_spread":0.1986447479208051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182753936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086961474,0.00001378429,0.99021125,0.00069657754,0.0006906343,0.00019536061,0.00017671994,0.000039468465,0.007889267],"genre_scores_gemma":[0.47730908,0.00004308033,0.5214559,0.00061542355,0.00010561963,0.00003251324,0.000028953295,0.0000062371873,0.00040320455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881226,0.000111321795,0.00033098832,0.0003360445,0.00021821738,0.00019118325],"domain_scores_gemma":[0.9984843,0.00079917506,0.00010107193,0.0001810642,0.00033992852,0.000094425675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006152891,0.00014784312,0.00016007217,0.00010315579,0.000121032426,0.000119350945,0.00047117283,0.00008195821,0.00032225047],"category_scores_gemma":[0.0004277975,0.00013244762,0.000048467842,0.000060851202,0.00013780138,0.00016068216,0.00006638273,0.00014019472,0.00003724506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015128197,0.00005721356,0.000003991589,0.0000045809807,0.000022042132,0.0000069530647,0.0005955414,0.00001389183,0.00005895451,0.8003384,0.00013878346,0.19860838],"study_design_scores_gemma":[0.0000681511,0.0001613405,0.0000310489,0.000015856644,0.0000064643114,0.00000763156,0.00005621826,0.2600607,0.001885226,0.737448,0.0001376341,0.00012172469],"about_ca_topic_score_codex":0.000012137817,"about_ca_topic_score_gemma":0.000018392439,"teacher_disagreement_score":0.4772221,"about_ca_system_score_codex":0.000015609156,"about_ca_system_score_gemma":0.0000756301,"threshold_uncertainty_score":0.5401057},"labels":[],"label_agreement":null},{"id":"W2183286887","doi":"","title":"Learning from Weak Teachers","year":2012,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sample complexity; Intuition; Crowdsourcing; Machine learning; Artificial intelligence; Sample (material); Homogeneous; Parametric statistics; Probably approximately correct learning; Quality (philosophy); Generality; Active learning (machine learning); Algorithmic learning theory; Mathematics","score_opus":0.09309872800627544,"score_gpt":0.34262361586816775,"score_spread":0.2495248878618923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183286887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005018708,0.00003128225,0.9786525,0.0013058116,0.0010456583,0.000045355962,0.000024097808,0.000088092784,0.013788503],"genre_scores_gemma":[0.92221624,0.00007509137,0.07637784,0.0001826978,0.00031724785,0.00000545722,0.0000331979,0.000007296912,0.0007849185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988082,0.00011112568,0.00024627303,0.0002614428,0.00032368655,0.0002492411],"domain_scores_gemma":[0.9991454,0.0003489241,0.00009791403,0.00014996299,0.00011622316,0.00014156736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030941202,0.00013942881,0.00011800025,0.00008906594,0.00014588644,0.00031117286,0.0004378357,0.00005276934,0.00040587486],"category_scores_gemma":[0.00039164344,0.00013070973,0.000024321911,0.00008303591,0.00007785568,0.00028967956,0.00011740229,0.0003433905,0.00036883412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063237185,0.0000404002,0.0008025734,6.677058e-7,0.000012101481,0.0000024930798,0.0014109362,0.00017447356,0.00017533297,0.6024501,0.00011663862,0.394808],"study_design_scores_gemma":[0.000035320096,0.00016132358,0.0022651367,0.00003251733,0.000007078364,0.000008269565,0.0012789082,0.8263167,0.0010957548,0.16255777,0.0059477766,0.00029345852],"about_ca_topic_score_codex":0.00018956237,"about_ca_topic_score_gemma":0.00001664805,"teacher_disagreement_score":0.9171975,"about_ca_system_score_codex":0.000026513635,"about_ca_system_score_gemma":0.000031190808,"threshold_uncertainty_score":0.53301877},"labels":[],"label_agreement":null},{"id":"W2185249064","doi":"","title":"Domain Adaptation: A Small Sample Statistical Approach","year":2012,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overfitting; Similarity (geometry); Artificial intelligence; Computer science; Sample (material); Pattern recognition (psychology); Domain (mathematical analysis); Statistic; Feature (linguistics); Greedy algorithm; Set (abstract data type); Machine learning; Variance (accounting); Feature selection; Selection (genetic algorithm); Object (grammar); Domain adaptation; Mathematics; Algorithm; Statistics; Artificial neural network; Image (mathematics)","score_opus":0.2080192309043449,"score_gpt":0.34113617773857846,"score_spread":0.13311694683423356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185249064","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035613234,0.000025101746,0.98279166,0.00072781113,0.00067166466,0.0001359315,0.00015300013,0.000079747806,0.015058966],"genre_scores_gemma":[0.44326988,0.000038290324,0.5559889,0.00036173692,0.00012684811,0.000017640168,0.00007961968,0.000007958953,0.00010908441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819815,0.0001571742,0.00043475165,0.00037033533,0.0004645594,0.0003750389],"domain_scores_gemma":[0.9982941,0.0008371444,0.00013829362,0.0002241186,0.00025393657,0.0002523886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057633955,0.00019818344,0.00017417016,0.00015743487,0.00019473437,0.00044348187,0.00050054345,0.000071817085,0.0003380588],"category_scores_gemma":[0.00046659895,0.00019315115,0.000029627114,0.00016684471,0.0001698371,0.00035642792,0.00011909544,0.00024321873,0.00021724257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003279807,0.00014670691,0.00011772015,0.0000051372317,0.000016562773,0.0000044947237,0.0023090048,0.0002152723,0.00006208075,0.8282491,0.0000826969,0.1687584],"study_design_scores_gemma":[0.000061393344,0.00013898697,0.0007529105,0.000016703047,0.000006660925,0.00002496165,0.002764399,0.55612254,0.00012623971,0.4337788,0.0059103444,0.00029605677],"about_ca_topic_score_codex":0.00006584656,"about_ca_topic_score_gemma":0.00002829332,"teacher_disagreement_score":0.55590725,"about_ca_system_score_codex":0.000050122322,"about_ca_system_score_gemma":0.00008692009,"threshold_uncertainty_score":0.78764755},"labels":[],"label_agreement":null},{"id":"W2187650160","doi":"","title":"Discussion of \\The Neural Autoregressive Distribution Estimator\"","year":2011,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"MNIST database; Boltzmann machine; Latent variable; Estimator; Restricted Boltzmann machine; Graphical model; Computer science; Inference; Block (permutation group theory); Gibbs sampling; Artificial intelligence; Autoregressive model; Algorithm; Mathematics; Applied mathematics; Machine learning; Artificial neural network; Statistics; Combinatorics","score_opus":0.107768844503171,"score_gpt":0.30808845568070176,"score_spread":0.20031961117753078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187650160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007719834,0.0000061463716,0.9954892,0.0011502823,0.0008699491,0.00008239046,0.00013029411,0.000014708059,0.0014850438],"genre_scores_gemma":[0.9750043,0.000018031074,0.024751011,0.00006065106,0.000043263703,0.000004950076,0.000011542957,0.000003288037,0.00010297337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990613,0.00007972882,0.00027032028,0.00021465417,0.00025164834,0.00012234661],"domain_scores_gemma":[0.99923325,0.00008898712,0.0001638177,0.00019754858,0.00026666524,0.000049754934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012469139,0.00010750912,0.000105935054,0.00003174331,0.00012735065,0.00008368474,0.00052493374,0.00003659326,0.00010808521],"category_scores_gemma":[0.00025458704,0.000062551204,0.000034823686,0.00008442772,0.00020700139,0.00018343136,0.00015267005,0.000100002435,0.0000119163105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024526233,0.00005199709,0.00013415843,0.000002111059,0.000010074818,0.0000034442007,0.00045634934,0.00023123143,0.0004528033,0.82318366,0.00017704122,0.17527258],"study_design_scores_gemma":[0.000018326591,0.00009152132,0.002870646,0.000041725085,0.000006475264,0.0000042129623,0.00016148391,0.77546275,0.018090287,0.20306134,0.00008946783,0.00010179065],"about_ca_topic_score_codex":0.00004957494,"about_ca_topic_score_gemma":0.000030962205,"teacher_disagreement_score":0.9742323,"about_ca_system_score_codex":0.000018704503,"about_ca_system_score_gemma":0.000045262885,"threshold_uncertainty_score":0.2550764},"labels":[],"label_agreement":null},{"id":"W2289330286","doi":"","title":"A Spike and Slab Restricted Boltzmann Machine","year":2011,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Boltzmann machine; Spike (software development); Slab; Restricted Boltzmann machine; Computer science; Block (permutation group theory); Boltzmann equation; Boltzmann constant; Lattice Boltzmann methods; Support vector machine; Artificial intelligence; Pattern recognition (psychology); Algorithm; Mathematics; Physics; Artificial neural network; Geometry; Mechanics; Thermodynamics","score_opus":0.12679983297307296,"score_gpt":0.3056727456217436,"score_spread":0.17887291264867067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289330286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011334809,0.000038193444,0.987921,0.0006483101,0.0004627723,0.00009211621,0.00007481554,0.000037869602,0.009591462],"genre_scores_gemma":[0.88334286,0.00034013853,0.11574403,0.00027154488,0.00007086504,0.000007126473,0.000011198335,0.000006025498,0.00020617885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988884,0.00006846244,0.00028272028,0.00035944622,0.00022126657,0.0001797162],"domain_scores_gemma":[0.9992199,0.0001544573,0.000093996496,0.00018063777,0.00024464878,0.00010637897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014751479,0.00015271857,0.00013769846,0.000115993585,0.0001256163,0.00023944139,0.00037757677,0.00004909129,0.00021982737],"category_scores_gemma":[0.00021411563,0.00013724339,0.000018738901,0.000114927905,0.00015398521,0.00024454843,0.00014827398,0.00013338882,0.000051047035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038889237,0.00004752314,0.00007938935,0.0000018859516,0.000016382126,0.000023639881,0.0005764265,0.000016932549,0.00047833705,0.77403253,0.00014468814,0.22454338],"study_design_scores_gemma":[0.000043944237,0.00027702318,0.0016386484,0.00002740237,0.000009180082,0.000016095002,0.00018272694,0.6229757,0.0049384576,0.3690056,0.00064934307,0.00023587703],"about_ca_topic_score_codex":0.00020507562,"about_ca_topic_score_gemma":0.0001246891,"teacher_disagreement_score":0.8822094,"about_ca_system_score_codex":0.000014236024,"about_ca_system_score_gemma":0.00004055802,"threshold_uncertainty_score":0.5596623},"labels":[],"label_agreement":null},{"id":"W2390241580","doi":"","title":"Sequential Inference for Deep Gaussian Process","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; University of Toronto","funders":"","keywords":"Gaussian process; Inference; Computer science; Process (computing); Artificial intelligence; Machine learning; Gaussian","score_opus":0.08939333074622631,"score_gpt":0.3665205894727141,"score_spread":0.2771272587264878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2390241580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004118804,0.000010065239,0.98910993,0.005535972,0.0006685597,0.00022116778,0.00019277282,0.00008429998,0.0037653677],"genre_scores_gemma":[0.93305737,0.00012828525,0.065991975,0.00032656238,0.00014149351,0.000071782146,0.000013567564,0.000011708219,0.00025725938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981113,0.000039546427,0.00047552303,0.00060204975,0.000405266,0.00036632983],"domain_scores_gemma":[0.9981811,0.000510369,0.00018915332,0.00028335824,0.0006664972,0.00016950746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024158388,0.00024014042,0.0002004783,0.00016373945,0.00018116547,0.0005128012,0.000990836,0.000092358074,0.00028855162],"category_scores_gemma":[0.0006426385,0.00017366953,0.00004320716,0.00015179702,0.00021904985,0.0005438414,0.000117050346,0.000110848574,0.0001184573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004360295,0.00004425968,0.00003745598,0.000012684713,0.000012553577,0.000006594724,0.0002191021,0.0000100156285,0.00062263716,0.6529816,0.000044788125,0.34596473],"study_design_scores_gemma":[0.0000807853,0.00029328582,0.00011628163,0.00010945,0.00000696549,0.000013220476,0.0001346913,0.1174789,0.007513685,0.8735382,0.00041555654,0.00029899937],"about_ca_topic_score_codex":0.000011199855,"about_ca_topic_score_gemma":0.000068337016,"teacher_disagreement_score":0.9326455,"about_ca_system_score_codex":0.000048894468,"about_ca_system_score_gemma":0.00022516884,"threshold_uncertainty_score":0.7082038},"labels":[],"label_agreement":null},{"id":"W2410679624","doi":"","title":"A Column Generation Bound Minimization Approach with PAC-Bayesian Generalization Guarantees","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Generalization; Column (typography); Computer science; Minification; Bayesian probability; Column generation; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.2157938118567386,"score_gpt":0.3608432622986248,"score_spread":0.1450494504418862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410679624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035250126,0.000012168225,0.99227536,0.0011021112,0.00041004046,0.00020002465,0.00018527085,0.000038678845,0.002251308],"genre_scores_gemma":[0.9374583,0.00009364321,0.060751602,0.00013449536,0.00021654936,0.000019762754,0.00007057962,0.000014597385,0.0012405171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762046,0.0001360415,0.0006004495,0.00051981315,0.00092232955,0.00020090576],"domain_scores_gemma":[0.9979913,0.0005539868,0.00020897019,0.00024957285,0.00089579256,0.00010037848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006481912,0.00019031393,0.0001991135,0.00023113198,0.00017508869,0.00053118344,0.00034725462,0.000085172396,0.0005073851],"category_scores_gemma":[0.001601484,0.000117298354,0.00002601893,0.00024378911,0.00026004927,0.00027901848,0.000035717036,0.00007585336,0.00007549411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012576507,0.000083300314,0.00018117217,0.000003189326,0.000022109902,0.0000064616256,0.00033121198,0.008332569,0.0024041208,0.856364,0.0012465131,0.1308996],"study_design_scores_gemma":[0.00008515993,0.00023011098,0.00020635994,0.000042003474,0.000013371319,0.00001670641,0.00037722036,0.79123545,0.0016186867,0.20542535,0.0005092438,0.00024034399],"about_ca_topic_score_codex":0.000022521162,"about_ca_topic_score_gemma":0.00010519121,"teacher_disagreement_score":0.93393326,"about_ca_system_score_codex":0.000060763843,"about_ca_system_score_gemma":0.00011407011,"threshold_uncertainty_score":0.5555511},"labels":[],"label_agreement":null},{"id":"W2411304668","doi":"","title":"Scalable and Sound Low-Rank Tensor Learning","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scalability; Computer science; Tensor (intrinsic definition); Rank (graph theory); Sound (geography); Mathematics; Acoustics; Physics","score_opus":0.14412932921451255,"score_gpt":0.3819043419830679,"score_spread":0.23777501276855534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411304668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06778777,0.0000082960305,0.92123276,0.0032566045,0.00016327326,0.00015176806,0.00021334112,0.000073875206,0.007112337],"genre_scores_gemma":[0.9812475,0.00016664287,0.016723035,0.00014810146,0.000078013276,0.000019399422,0.00001166957,0.000012621248,0.001593037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990198,0.00004545668,0.00030654971,0.00025939368,0.00021358894,0.00015518062],"domain_scores_gemma":[0.9986176,0.0008132345,0.00010213788,0.00010895427,0.00026398097,0.00009408915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016859674,0.0001285016,0.00013509844,0.00008249983,0.00015768406,0.00014772857,0.00012360516,0.000053069947,0.0009145663],"category_scores_gemma":[0.0005571115,0.000096702264,0.000019615372,0.000050313552,0.00021093167,0.00009165807,0.00004204472,0.00011470698,0.00018801788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041405096,0.000061907434,0.00023013666,0.000007194541,0.000015253592,0.000003989274,0.00012693559,0.0000032901278,0.0029301632,0.9157333,0.00027737662,0.080569096],"study_design_scores_gemma":[0.000057959074,0.00008431005,0.00030909808,0.00007016282,0.000011614165,0.000015392607,0.0003794305,0.011020147,0.0022372762,0.98493403,0.00071968255,0.00016090678],"about_ca_topic_score_codex":0.000009976489,"about_ca_topic_score_gemma":0.000042371328,"teacher_disagreement_score":0.9134597,"about_ca_system_score_codex":0.000024079258,"about_ca_system_score_gemma":0.000018392704,"threshold_uncertainty_score":0.99999875},"labels":[],"label_agreement":null},{"id":"W2411727234","doi":"","title":"Online Relative Entropy Policy Search using Reproducing Kernel Hilbert Space Embeddings","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reproducing kernel Hilbert space; Hilbert space; Computer science; Entropy (arrow of time); Kernel (algebra); Mathematics; Theoretical computer science; Pure mathematics; Physics","score_opus":0.10725564927045814,"score_gpt":0.37334982183748744,"score_spread":0.2660941725670293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411727234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066405204,0.000014561559,0.9776376,0.013003775,0.00037202344,0.00012242215,0.00017186445,0.00006259464,0.0019746586],"genre_scores_gemma":[0.8613233,0.0002456202,0.13712344,0.00027267187,0.0002516068,0.0000042397405,0.000009090921,0.000012857081,0.00075719116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775606,0.00008358886,0.00047808018,0.0007633106,0.0005321434,0.00038679613],"domain_scores_gemma":[0.99819076,0.00041532083,0.0001901195,0.00039514265,0.00063670526,0.00017198056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033013805,0.00023722938,0.00021140257,0.00028604275,0.00018932602,0.00042354144,0.0007722195,0.00008254641,0.00019466186],"category_scores_gemma":[0.0010607267,0.00017958753,0.00003991724,0.00030676552,0.0002572993,0.00066954177,0.00027813858,0.0002149069,0.00011372122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034678684,0.00008598246,0.00012363988,0.000006917324,0.000021118265,0.000023676048,0.00063218025,0.000051354327,0.004665838,0.8368392,0.000043219316,0.15747221],"study_design_scores_gemma":[0.000065280976,0.00019383758,0.0003847573,0.00024608796,0.0000072873863,0.000044592674,0.0002630328,0.27679697,0.011243169,0.7101678,0.00026685296,0.00032030282],"about_ca_topic_score_codex":0.00028259138,"about_ca_topic_score_gemma":0.000050828792,"teacher_disagreement_score":0.85468274,"about_ca_system_score_codex":0.00016541357,"about_ca_system_score_gemma":0.00039828432,"threshold_uncertainty_score":0.73233664},"labels":[],"label_agreement":null},{"id":"W2414396530","doi":"","title":"Survey Propagation beyond Constraint Satisfaction Problems.","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Local consistency; Computer science; Constraint satisfaction problem; Constraint (computer-aided design); Mathematical optimization; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.08947312638678116,"score_gpt":0.33039098031030933,"score_spread":0.24091785392352816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414396530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024849123,0.000006285558,0.99086994,0.0029872572,0.00071806327,0.00012470825,0.00016789696,0.000072672316,0.0025682661],"genre_scores_gemma":[0.97680306,0.00009857378,0.022494089,0.00014804189,0.00007940064,0.000012815214,0.000024475254,0.000006608307,0.0003329101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857044,0.00015611776,0.00034423394,0.00037795358,0.0003669936,0.00018426987],"domain_scores_gemma":[0.99870414,0.0004741996,0.00014679342,0.00017881271,0.0004063273,0.00008974952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055296643,0.00014513159,0.00012175719,0.00012186492,0.00012210256,0.00029457247,0.00031007334,0.00005381813,0.00025808133],"category_scores_gemma":[0.0006108319,0.00010553416,0.000019171808,0.00010610499,0.00015908868,0.0002701724,0.00007314398,0.00013221032,0.00018112353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096040485,0.000018322262,0.0007082957,0.0000020281668,0.0000071951927,0.0000031044572,0.000091939364,0.00002953976,0.0006001345,0.5096681,0.00006721785,0.4887945],"study_design_scores_gemma":[0.00008901334,0.00036706397,0.022722505,0.00010649492,0.0000047718895,0.000023935987,0.00008048103,0.4571303,0.002550877,0.5161907,0.00037065175,0.0003631715],"about_ca_topic_score_codex":0.00020256678,"about_ca_topic_score_gemma":0.00038074257,"teacher_disagreement_score":0.97431815,"about_ca_system_score_codex":0.00004394283,"about_ca_system_score_gemma":0.00008640424,"threshold_uncertainty_score":0.43035582},"labels":[],"label_agreement":null},{"id":"W2416891345","doi":"","title":"Online and distributed Bayesian moment matching for parameter learning in sum-product networks","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Moment (physics); Matching (statistics); Computer science; Bayesian network; Bayesian probability; Product (mathematics); Artificial intelligence; Machine learning; Mathematics; Statistics; Physics","score_opus":0.09218863346414675,"score_gpt":0.33822808184624725,"score_spread":0.2460394483821005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416891345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008538837,0.000026278109,0.9870208,0.0037097137,0.00029316024,0.00014108008,0.00015643862,0.000043372227,0.000070354705],"genre_scores_gemma":[0.93570906,0.00031436107,0.06359411,0.00015387175,0.00007360541,0.000020771678,0.00004145404,0.0000074994314,0.00008526871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858946,0.000068718895,0.00040153225,0.0004735551,0.00019899016,0.00026772992],"domain_scores_gemma":[0.9987927,0.0006454353,0.0001073957,0.000151089,0.0002061893,0.00009717863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035993967,0.00016811946,0.00017496207,0.00011754529,0.00009901765,0.00027351335,0.00032590792,0.000056567416,0.000020905572],"category_scores_gemma":[0.0003382007,0.00013236895,0.000021197193,0.000093861054,0.00010762501,0.0002131745,0.000107751854,0.00017369745,0.000004890437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039709215,0.000057097906,0.00028225285,0.0000045716174,0.000008751076,0.000005638088,0.00015386665,0.0016180687,0.00028277296,0.5960744,0.000023826105,0.40144902],"study_design_scores_gemma":[0.000053426054,0.00013198753,0.00054951344,0.00009890134,0.000002904044,0.0000049610358,0.00009602913,0.68057996,0.0002799817,0.3179552,0.00009258957,0.00015454605],"about_ca_topic_score_codex":0.000048291877,"about_ca_topic_score_gemma":0.00014727908,"teacher_disagreement_score":0.9271702,"about_ca_system_score_codex":0.000044432716,"about_ca_system_score_gemma":0.000049476694,"threshold_uncertainty_score":0.5397849},"labels":[],"label_agreement":null},{"id":"W2622730215","doi":"","title":"Discovering and Exploiting Additive Structure for Bayesian Optimization","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Bayesian probability; Bayesian optimization; Artificial intelligence; Data mining; Machine learning","score_opus":0.074198638650729,"score_gpt":0.3368367995968381,"score_spread":0.2626381609461091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622730215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068251503,0.0000072145567,0.99500865,0.0016611901,0.00038008497,0.00014022074,0.0003908032,0.000025101357,0.0017042451],"genre_scores_gemma":[0.7770833,0.00011529057,0.22251877,0.00009786808,0.00008976611,0.000013376032,0.00002573492,0.0000062357462,0.000049692982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989836,0.00001644947,0.00024592175,0.00038247544,0.00019006542,0.00018147944],"domain_scores_gemma":[0.99900454,0.00018684274,0.00021783682,0.000228529,0.00027840535,0.00008382262],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00010994665,0.0001489277,0.00013366062,0.00007199556,0.00051897473,0.0016444223,0.00056234753,0.000053731692,0.000065711436],"category_scores_gemma":[0.00053840614,0.0001393455,0.000017403408,0.000029235962,0.00016491806,0.00068067235,0.00016800479,0.00010531138,0.0000026173093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002033594,0.000011260704,0.000045166904,0.000009853128,0.000009537784,0.0000042722204,0.0003255765,0.00038104912,0.00011191536,0.75006866,0.000019650843,0.24899274],"study_design_scores_gemma":[0.000032271917,0.00008702507,0.00021506434,0.000058543854,0.000004043278,0.0000069729213,0.00023590121,0.64188623,0.0014977809,0.35578427,0.00005530527,0.00013656935],"about_ca_topic_score_codex":0.000029800776,"about_ca_topic_score_gemma":0.000075915515,"teacher_disagreement_score":0.77640074,"about_ca_system_score_codex":0.000020021524,"about_ca_system_score_gemma":0.00006416276,"threshold_uncertainty_score":0.999392},"labels":[],"label_agreement":null},{"id":"W2644693190","doi":"","title":"Unsupervised Sequential Sensor Acquisition","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Computer vision","score_opus":0.14159581063554977,"score_gpt":0.35861553909957905,"score_spread":0.21701972846402928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2644693190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030935686,0.0000070118153,0.98226243,0.0030532442,0.0018489301,0.00008903315,0.00021433261,0.00007392597,0.00935754],"genre_scores_gemma":[0.9371673,0.00017206323,0.061654557,0.0003694067,0.00027561726,0.0000065536674,0.000059064405,0.000007810241,0.00028764622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861574,0.00005745664,0.00031336126,0.00041523727,0.0003836744,0.00021455045],"domain_scores_gemma":[0.99866116,0.00016812823,0.00017496679,0.00056143507,0.00032326666,0.000111020156],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002459243,0.00015540638,0.00013597381,0.000087645305,0.00055477733,0.0015646323,0.00107315,0.00007656037,0.00038799876],"category_scores_gemma":[0.00024868693,0.00014903702,0.000031603497,0.00003629941,0.0002085411,0.0004470165,0.00024965318,0.00015519878,0.00016457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037809208,0.000040899722,0.00007856797,0.0000026122793,0.000011829788,0.000041527488,0.0001460819,0.00009399719,0.0005997788,0.8055378,0.0004959137,0.19291313],"study_design_scores_gemma":[0.000067696776,0.00014012554,0.0011822872,0.000060778035,0.0000075349753,0.000027931628,0.00015626433,0.62271845,0.0032750333,0.3704912,0.0015782374,0.0002944677],"about_ca_topic_score_codex":0.0000710976,"about_ca_topic_score_gemma":0.000045788795,"teacher_disagreement_score":0.9340737,"about_ca_system_score_codex":0.000022965049,"about_ca_system_score_gemma":0.000045571862,"threshold_uncertainty_score":0.99947184},"labels":[],"label_agreement":null},{"id":"W2730004797","doi":"","title":"Sequential Graph Matching with Sequential Monte Carlo.","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Monte Carlo method; Matching (statistics); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Statistics","score_opus":0.10435547367041688,"score_gpt":0.34068691526000244,"score_spread":0.23633144158958558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730004797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013352236,0.000007311546,0.9792838,0.00116271,0.0010960787,0.000111180925,0.00013075415,0.000056682526,0.004799245],"genre_scores_gemma":[0.9538495,0.000058333517,0.045511477,0.0001627209,0.00013844941,0.000011126774,0.000008991617,0.000009683926,0.00024972463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846035,0.000068844456,0.00030113992,0.00045786463,0.0004480131,0.0002638089],"domain_scores_gemma":[0.9987346,0.00011153506,0.00023067242,0.00047817072,0.00031841308,0.0001266091],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031450932,0.0002069788,0.00017289403,0.00013451793,0.00063815684,0.0015992384,0.0012391511,0.000060124185,0.00010679894],"category_scores_gemma":[0.00009753989,0.0001786121,0.00004162448,0.000056358975,0.00039097847,0.00061864126,0.0002248015,0.00023435848,0.000058114503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072763636,0.000046806428,0.000045604538,0.0000041856797,0.000039906237,0.000106470754,0.0005743417,0.0004728353,0.00043229904,0.9019616,0.000025291105,0.096217886],"study_design_scores_gemma":[0.000069470785,0.00022159211,0.00028855455,0.00007006201,0.000011964884,0.000043374006,0.00030980277,0.13221222,0.0029699407,0.8634265,0.00008821336,0.00028827714],"about_ca_topic_score_codex":0.00022926564,"about_ca_topic_score_gemma":0.00027650542,"teacher_disagreement_score":0.9404973,"about_ca_system_score_codex":0.000022344982,"about_ca_system_score_gemma":0.000082502,"threshold_uncertainty_score":0.9994372},"labels":[],"label_agreement":null},{"id":"W2798452101","doi":"","title":"Outlier Detection and Robust Estimation in Nonparametric Regression","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Outlier; Minimax; Robust regression; Nonparametric regression; Mathematics; Nonparametric statistics; Regularization (linguistics); Robust statistics; Regression; Regression analysis; Anomaly detection; Mathematical optimization; Computer science; Statistics; Algorithm; Artificial intelligence","score_opus":0.29131331454898,"score_gpt":0.4677994120640337,"score_spread":0.17648609751505367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798452101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011837087,0.000007667514,0.9851059,0.00021532342,0.00031623873,0.00015770845,0.00006790546,0.00002312245,0.0022690706],"genre_scores_gemma":[0.6215607,0.00006632575,0.37817526,0.000046091234,0.00004729321,0.000010332837,0.0000051780307,0.000008037645,0.00008078068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878466,0.000089020534,0.00039786403,0.0003118862,0.00024858577,0.00016798459],"domain_scores_gemma":[0.9983869,0.0010385318,0.00012228642,0.00010959145,0.00026482146,0.00007786311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039810894,0.00014741506,0.00017640823,0.00022542168,0.0001022628,0.00010041748,0.00009348697,0.000079446516,0.00015198874],"category_scores_gemma":[0.0029796918,0.00012851928,0.000012450806,0.00014956639,0.00024366981,0.00012824469,0.0000456512,0.00017374118,0.000022048016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009680782,0.000044250508,0.00001833829,0.000007830306,0.00000432056,0.0000046108166,0.00020909595,0.000071468785,0.00032802235,0.57506764,0.000013055544,0.42413458],"study_design_scores_gemma":[0.000030913405,0.00015630412,0.00015535975,0.000052610576,0.000005335315,0.0000049042105,0.00017805681,0.42573422,0.0014472309,0.57212794,0.0000186783,0.000088425084],"about_ca_topic_score_codex":0.00003528626,"about_ca_topic_score_gemma":0.00026692764,"teacher_disagreement_score":0.6097236,"about_ca_system_score_codex":0.00004456901,"about_ca_system_score_gemma":0.00002207236,"threshold_uncertainty_score":0.5240864},"labels":[],"label_agreement":null},{"id":"W2798463223","doi":"","title":"Statistical Sparse Online Regression: A Diffusion Approximation Perspective.","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Perspective (graphical); Diffusion; Computer science; Regression; Regression analysis; Statistics; Artificial intelligence; Machine learning; Econometrics; Mathematics; Physics","score_opus":0.10497208174241074,"score_gpt":0.38124927849675944,"score_spread":0.2762771967543487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798463223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042281607,0.000009034055,0.9829151,0.0041125887,0.0006883318,0.000092305,0.00012220192,0.000085047344,0.0077472073],"genre_scores_gemma":[0.8630796,0.000066131004,0.13569665,0.00037489968,0.0003001564,0.000005600218,0.000057663,0.000007929149,0.00041135558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984485,0.00011084189,0.00032488533,0.00045620918,0.00044849346,0.0002111066],"domain_scores_gemma":[0.99863404,0.00026488633,0.00012559824,0.00024171092,0.0006105783,0.00012318956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024766094,0.00017184525,0.00014979458,0.00014796587,0.00022260485,0.00033223422,0.00047382788,0.000064458145,0.0004812311],"category_scores_gemma":[0.00070826174,0.00014417236,0.000020756495,0.0001410288,0.00026272197,0.00019020769,0.00016390749,0.00018862255,0.00024370373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005177185,0.00013891798,0.00003669328,0.0000027923243,0.000007715224,0.000012806023,0.00076737045,0.000015207251,0.00022507427,0.71913177,0.00036209507,0.27924776],"study_design_scores_gemma":[0.000037665937,0.00030322702,0.00074799603,0.00004502963,0.0000038339867,0.0000148082445,0.00053185393,0.62468654,0.00038838698,0.37221667,0.0008796909,0.00014426239],"about_ca_topic_score_codex":0.00013278582,"about_ca_topic_score_gemma":0.00013428774,"teacher_disagreement_score":0.85885143,"about_ca_system_score_codex":0.000053293978,"about_ca_system_score_gemma":0.000074788084,"threshold_uncertainty_score":0.5879178},"labels":[],"label_agreement":null},{"id":"W2798578734","doi":"","title":"Nonlinear Weighted Finite Automata","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nonlinear system; Computer science; Automaton; Finite-state machine; Algorithm; Theoretical computer science; Physics","score_opus":0.08505758686459591,"score_gpt":0.3371786691107923,"score_spread":0.2521210822461964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798578734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023721773,0.0000071919694,0.98240834,0.0019844498,0.0010640514,0.00007760475,0.0001479081,0.00014000839,0.011798256],"genre_scores_gemma":[0.82646567,0.0000988329,0.17181796,0.0008978982,0.00032078163,0.0000071056797,0.000036661404,0.0000094444995,0.00034565025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986274,0.0000574044,0.00034143325,0.0003939731,0.0003554032,0.00022436463],"domain_scores_gemma":[0.9987021,0.00037239917,0.000106655185,0.00032293057,0.00039267933,0.000103240214],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002779769,0.00016117463,0.00013582928,0.00014375117,0.00016072663,0.00043512482,0.0008037296,0.000060835315,0.00052692916],"category_scores_gemma":[0.00024861383,0.00014623706,0.000025179044,0.00015947054,0.00027662478,0.00026333722,0.00019186185,0.00013490678,0.0007799483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022999528,0.00006175852,0.000010801903,0.0000018419928,0.000011351535,0.000014808898,0.0002559392,0.0000032631483,0.00030753744,0.729224,0.00029623366,0.26978943],"study_design_scores_gemma":[0.000022632383,0.00019267436,0.000054091346,0.000024190807,0.0000024377055,0.000008284365,0.000070222115,0.6192563,0.0043505654,0.37432644,0.001562574,0.00012958508],"about_ca_topic_score_codex":0.000028332772,"about_ca_topic_score_gemma":0.000038314978,"teacher_disagreement_score":0.8240935,"about_ca_system_score_codex":0.000022737819,"about_ca_system_score_gemma":0.000071363604,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W2798888671","doi":"","title":"Linear Stochastic Approximation: How Far Does Constant Step-Size and Iterate Averaging Go?","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Constant (computer programming); Applied mathematics; Computer science","score_opus":0.06654015255569296,"score_gpt":0.3147389566761767,"score_spread":0.24819880412048373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798888671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052965333,0.000011400716,0.9943765,0.0024453797,0.00072922866,0.00022691417,0.000115306546,0.00012803233,0.0014375966],"genre_scores_gemma":[0.69769967,0.000054227996,0.30153742,0.00034082407,0.000118031065,0.00001908534,0.000012987212,0.000009031702,0.00020873289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845994,0.00006295521,0.0003585904,0.0004942582,0.00039190464,0.00023237504],"domain_scores_gemma":[0.9982053,0.00050780026,0.0001800627,0.00023633863,0.0007482029,0.00012228733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027907005,0.00021287506,0.00018282002,0.00016933962,0.00022028708,0.0007357004,0.00043223248,0.00006523228,0.0001235996],"category_scores_gemma":[0.0007130423,0.00018029491,0.000019754481,0.00016484373,0.00045050678,0.0003654795,0.00017458953,0.00015399454,0.00003476945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032175867,0.000034804187,0.0000142677845,0.0000066228367,0.000017548811,0.0000074406425,0.00077454007,0.00008187721,0.00032781204,0.92907655,0.00008335652,0.06954303],"study_design_scores_gemma":[0.000042123913,0.00019539167,0.00003071262,0.000062108375,0.000006176498,0.000019398132,0.00024401277,0.7577154,0.0015895653,0.2397873,0.00011630413,0.0001915195],"about_ca_topic_score_codex":0.0000137735115,"about_ca_topic_score_gemma":0.000028213575,"teacher_disagreement_score":0.7576335,"about_ca_system_score_codex":0.000039700935,"about_ca_system_score_gemma":0.000071513125,"threshold_uncertainty_score":0.7352213},"labels":[],"label_agreement":null},{"id":"W2921234600","doi":"","title":"Improved Semi-Supervised Learning with Multiple Graphs","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hyperparameter; Computer science; Artificial intelligence; Benchmark (surveying); Covariance matrix; Covariance; Laplacian matrix; Machine learning; Gaussian; Algorithm; TRACE (psycholinguistics); Graph; Maximum cut; Stochastic gradient descent; Inverse; Gradient descent; Pattern recognition (psychology); Mathematics; Artificial neural network; Theoretical computer science; Statistics","score_opus":0.054614506757747906,"score_gpt":0.29294117695397487,"score_spread":0.23832667019622697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921234600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050954122,0.000006373502,0.9434326,0.00062048197,0.00042225613,0.00017141562,0.000036762423,0.00007643065,0.004279549],"genre_scores_gemma":[0.96635497,0.000079897036,0.03278451,0.0002517766,0.000025920732,0.000013945882,0.000040362745,0.000007845854,0.0004407954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988477,0.000052681567,0.00023729916,0.00037468693,0.0002983529,0.0001892391],"domain_scores_gemma":[0.99906284,0.00027411437,0.00009442102,0.00017033692,0.0003135279,0.00008478402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014673303,0.00014683297,0.00013065219,0.00012318838,0.00010302814,0.00032595865,0.00036575133,0.00005471746,0.0003175808],"category_scores_gemma":[0.00012157151,0.00012131283,0.00002244321,0.000119787386,0.000064974476,0.00030061865,0.000081857506,0.00021528418,0.0002650896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016915002,0.00009034007,0.001768114,0.000012056068,0.000028211543,0.000013793565,0.00068318256,0.00057557586,0.014524854,0.73795897,0.00008761875,0.24408814],"study_design_scores_gemma":[0.00008766483,0.00040104595,0.00026439494,0.00007572695,0.0000035842854,0.000008278028,0.0006393849,0.9309301,0.009581428,0.057505235,0.0002958601,0.00020734315],"about_ca_topic_score_codex":0.000054495613,"about_ca_topic_score_gemma":0.00005845939,"teacher_disagreement_score":0.9303545,"about_ca_system_score_codex":0.00001672214,"about_ca_system_score_gemma":0.000052534422,"threshold_uncertainty_score":0.49469933},"labels":[],"label_agreement":null},{"id":"W2922025696","doi":"","title":"Multitask Metric Learning: Theory and Algorithm","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Boosting (machine learning); Generalization; Multi-task learning; Stability (learning theory); Metric (unit); Benchmark (surveying); Algorithm; Artificial intelligence; Machine learning; Learning to rank; Task (project management); Mathematics; Ranking (information retrieval)","score_opus":0.05850819405852739,"score_gpt":0.3255875308177551,"score_spread":0.2670793367592277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922025696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045777382,0.000032998214,0.98857605,0.00046371284,0.00054545316,0.000105792074,0.00003980528,0.000046604964,0.0056118355],"genre_scores_gemma":[0.9191342,0.00052307075,0.07847373,0.0003699538,0.00005008027,0.000009050855,0.000029037783,0.000007350418,0.0014035475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892515,0.00011218107,0.00021829562,0.0003265448,0.0002714903,0.00014634345],"domain_scores_gemma":[0.9989158,0.0005923696,0.000080962585,0.00012164383,0.00020968329,0.00007953601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037285863,0.00011931212,0.00011591917,0.00018143472,0.00008856838,0.00029550094,0.00026575653,0.000054499807,0.000347794],"category_scores_gemma":[0.0003126327,0.00010680033,0.000017248516,0.00012066499,0.00007344256,0.00024566535,0.00011994706,0.00018376943,0.0004266645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001712254,0.000022622999,0.00004876897,0.000002581498,0.00000781114,0.000004292192,0.00018147696,0.000032210486,0.00030169456,0.5340808,0.00005093093,0.46524966],"study_design_scores_gemma":[0.000049418304,0.0002302382,0.0002474302,0.0000424244,0.000004605707,0.000011490841,0.0007340767,0.55666393,0.0027671163,0.43782005,0.0012433733,0.00018586732],"about_ca_topic_score_codex":0.000020345855,"about_ca_topic_score_gemma":0.000004743732,"teacher_disagreement_score":0.91455644,"about_ca_system_score_codex":0.0000144331325,"about_ca_system_score_gemma":0.0000308116,"threshold_uncertainty_score":0.5484052},"labels":[],"label_agreement":null},{"id":"W2922253549","doi":"","title":"Vine copula structure learning via Monte Carlo tree search","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Vine copula; Monte Carlo tree search; Computer science; Copula (linguistics); Monte Carlo method; Tree structure; Tree (set theory); Sampling (signal processing); Artificial intelligence; Bivariate analysis; Vine; Machine learning; Mathematics; Algorithm; Statistics; Econometrics; Binary tree","score_opus":0.07554591244505358,"score_gpt":0.3394016780820889,"score_spread":0.2638557656370353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922253549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045494445,0.000036266072,0.9457437,0.0015899211,0.0015626834,0.00030672108,0.00009513558,0.0001381907,0.005032955],"genre_scores_gemma":[0.96786916,0.00011585793,0.030262766,0.0002554175,0.00015661749,0.00000859105,0.000024533145,0.000021166197,0.0012858632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714744,0.00016522144,0.0006333325,0.00075662986,0.00084018597,0.00045717473],"domain_scores_gemma":[0.9980197,0.00050753844,0.00017922111,0.00044355952,0.00066422427,0.00018578257],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003744833,0.00031788304,0.000306467,0.00027263773,0.00019621522,0.0006473095,0.0012040811,0.00014189702,0.0010806674],"category_scores_gemma":[0.0003216542,0.00030545352,0.000059718943,0.00027573027,0.00022509412,0.0004655813,0.00031834305,0.0006031527,0.00079043687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005857829,0.00005071121,0.00053870666,0.0000084737685,0.000029389745,0.000028806438,0.001161148,0.005309527,0.006246651,0.629402,0.00007586517,0.35709015],"study_design_scores_gemma":[0.00003200939,0.00040204648,0.0004034629,0.000055179717,0.0000067468545,0.00002626469,0.00080808916,0.83821535,0.01664785,0.14236796,0.0006663666,0.00036866099],"about_ca_topic_score_codex":0.0002796276,"about_ca_topic_score_gemma":0.00033306715,"teacher_disagreement_score":0.9223747,"about_ca_system_score_codex":0.00009553673,"about_ca_system_score_gemma":0.00012543345,"threshold_uncertainty_score":0.99998754},"labels":[],"label_agreement":null},{"id":"W2962791800","doi":"","title":"Conjugate-Computation Variational Inference : Converting Variational Inference in Non-Conjugate Models to Inferences in Conjugate Models","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjugate gradient method; Conjugate residual method; Gradient descent; Conjugate; Derivation of the conjugate gradient method; Convergence (economics); Mathematics; Inference; Computation; Stochastic gradient descent; Nonlinear conjugate gradient method; Biconjugate gradient method; Computer science; Mathematical optimization; Applied mathematics; Algorithm; Artificial intelligence; Artificial neural network; Mathematical analysis","score_opus":0.1595042624709313,"score_gpt":0.3705196349275402,"score_spread":0.2110153724566089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962791800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010592317,0.000008222618,0.97620875,0.002909504,0.0008494092,0.00046099885,0.0001289592,0.000062520856,0.008779327],"genre_scores_gemma":[0.9270052,0.000114730465,0.071754195,0.0007452224,0.00008344939,0.00008423846,0.00008135126,0.000018259781,0.00011336413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592847,0.00023160031,0.0013061583,0.0009995756,0.0009574031,0.00057678873],"domain_scores_gemma":[0.9961138,0.001555294,0.0006485477,0.0004698263,0.0009434969,0.00026905144],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012805627,0.00043206365,0.00047898875,0.00068205735,0.00046904985,0.0018544265,0.0015292029,0.00018441159,0.0001549024],"category_scores_gemma":[0.0019044033,0.0004693875,0.00005272078,0.00031010548,0.0002617839,0.0023275677,0.00046584738,0.00057457574,0.00016229173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101214544,0.000111324975,0.00086534745,0.000010269839,0.000017871655,0.00002988677,0.0031938315,0.22345348,0.00022929869,0.717582,0.0000105861845,0.05439488],"study_design_scores_gemma":[0.00017007222,0.00010155599,0.0050969846,0.00014062882,0.0000033128824,0.0000023998016,0.000293275,0.5685103,0.00011832442,0.4252475,0.000014101124,0.00030154127],"about_ca_topic_score_codex":0.0013185608,"about_ca_topic_score_gemma":0.0019553276,"teacher_disagreement_score":0.9164129,"about_ca_system_score_codex":0.00018114358,"about_ca_system_score_gemma":0.0005387301,"threshold_uncertainty_score":0.99977577},"labels":[],"label_agreement":null},{"id":"W2962851649","doi":"","title":"Distributed Maximization of \"Submodular plus Diversity\" Functions for Multi-label Feature Selection on Huge Datasets","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Feature selection; Computer science; Redundancy (engineering); Automatic summarization; Feature (linguistics); Greedy algorithm; Maximization; Optimization problem; Mathematical optimization; Data mining; Function (biology); Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.14797393125353175,"score_gpt":0.3478739285134115,"score_spread":0.19989999725987972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962851649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002328874,0.00000537548,0.9934265,0.0012160207,0.00048773858,0.00029004295,0.0019990732,0.00007749857,0.00016889637],"genre_scores_gemma":[0.90915847,0.00005293087,0.08908912,0.00009781445,0.000023034776,0.000021597865,0.0010642097,0.000005809698,0.000487002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989989,0.000027261158,0.00023346103,0.00033643108,0.00027185102,0.00013208853],"domain_scores_gemma":[0.99902904,0.00016664331,0.00017674085,0.0002135584,0.00037570667,0.000038337224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013138787,0.00012374284,0.00013160855,0.00017318735,0.00016484619,0.00013983023,0.00045690653,0.00008474519,0.00006288245],"category_scores_gemma":[0.0002475445,0.0001200874,0.000024010698,0.0001828932,0.000075787895,0.0002562959,0.000159653,0.00011971899,0.00004970618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010014782,0.00013474646,0.00022937775,0.000010569652,0.000022587472,6.274144e-7,0.00010330128,0.00068870484,0.0009577684,0.9185342,0.0011629183,0.07805504],"study_design_scores_gemma":[0.0001516387,0.00037946558,0.000767373,0.000029828372,0.0000096021595,0.0000015338479,0.0002725579,0.9255025,0.0054557114,0.066637106,0.0006433763,0.00014933498],"about_ca_topic_score_codex":0.000024335706,"about_ca_topic_score_gemma":0.00003895972,"teacher_disagreement_score":0.92481375,"about_ca_system_score_codex":0.0000677104,"about_ca_system_score_gemma":0.000055066528,"threshold_uncertainty_score":0.48970222},"labels":[],"label_agreement":null},{"id":"W2962860063","doi":"","title":"Parallel Markov Chain Monte Carlo via Spectral Clustering","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Monte Carlo method; Cluster analysis; Markov chain; Statistical physics; Hybrid Monte Carlo; Parallel tempering; Markov chain mixing time; Markov model; Markov property; Artificial intelligence; Mathematics; Machine learning; Statistics; Physics; Bayesian probability","score_opus":0.17240422264786448,"score_gpt":0.38940796997489474,"score_spread":0.21700374732703026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962860063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007025442,0.000014100769,0.98005235,0.0019982378,0.00079486176,0.0002005389,0.00024363362,0.000058603193,0.009612243],"genre_scores_gemma":[0.8261276,0.00029206972,0.1700667,0.00019878263,0.00028978076,0.000029304187,0.0000062053164,0.000028194921,0.00296138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981895,0.00013721296,0.0005461602,0.0004060484,0.0003938568,0.00032723387],"domain_scores_gemma":[0.99817497,0.0009654203,0.00017218168,0.0002468795,0.00028738828,0.00015319153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896642,0.00025195937,0.00027245114,0.00013653,0.00010658234,0.0001225187,0.00030383968,0.000097103795,0.0004908919],"category_scores_gemma":[0.0009352561,0.00018740624,0.000062788815,0.00006444607,0.00019096749,0.00011395736,0.00010269883,0.00016090299,0.0000067456226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020472307,0.00006380432,0.00005023821,0.000014036827,0.000037202015,0.000036136316,0.0003013433,0.00001628951,0.0019419107,0.66972214,0.0004404352,0.32717177],"study_design_scores_gemma":[0.00018653307,0.00036478945,0.000102252,0.00025549156,0.000033243436,0.00004590145,0.0007936272,0.20070106,0.0033627034,0.7922979,0.0012733107,0.0005831714],"about_ca_topic_score_codex":0.000070300615,"about_ca_topic_score_gemma":0.0006758674,"teacher_disagreement_score":0.81910217,"about_ca_system_score_codex":0.000082258324,"about_ca_system_score_gemma":0.00004704132,"threshold_uncertainty_score":0.7642205},"labels":[],"label_agreement":null},{"id":"W2962865366","doi":"","title":"Benefits from Superposed Hawkes Processes","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Superposition principle; Point process; Computer science; Process (computing); Class (philosophy); Point (geometry); Upper and lower bounds; Algorithm; Mathematical optimization; Artificial intelligence; Econometrics; Mathematics; Statistics; Mathematical analysis","score_opus":0.32777790552844743,"score_gpt":0.4107638946153611,"score_spread":0.08298598908691368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962865366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26518503,0.0001693185,0.634592,0.00635142,0.0024359422,0.0004855319,0.0053821085,0.00018473857,0.08521389],"genre_scores_gemma":[0.9807401,0.0006000463,0.017508814,0.00013898253,0.00024976867,0.000015615884,0.00007229771,0.00001485463,0.00065954454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986467,0.000025397881,0.00040749536,0.00031207417,0.0004024916,0.00020589144],"domain_scores_gemma":[0.99760324,0.0010449305,0.0002506248,0.0002968344,0.0007188091,0.000085587395],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022201988,0.00018601259,0.00021908506,0.00011500965,0.00039047515,0.0007839721,0.00054961623,0.00007619669,0.0011645388],"category_scores_gemma":[0.0061392975,0.00016558758,0.000026350266,0.000053835938,0.00022621045,0.0002778481,0.0001387069,0.00014582295,0.00008989499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007622227,0.000084063315,0.00025561976,0.000032752247,0.000033873024,0.000008312333,0.000565681,0.0000051561256,0.000044673747,0.8765079,0.00022394433,0.12216185],"study_design_scores_gemma":[0.000043460404,0.00010677307,0.00081248506,0.00011627165,0.000018626299,0.0000031299207,0.001178943,0.004165849,0.004132754,0.9889008,0.00030217523,0.00021874032],"about_ca_topic_score_codex":0.0004087432,"about_ca_topic_score_gemma":0.0010398219,"teacher_disagreement_score":0.715555,"about_ca_system_score_codex":0.0000208476,"about_ca_system_score_gemma":0.0001078147,"threshold_uncertainty_score":0.9997485},"labels":[],"label_agreement":null},{"id":"W2962994149","doi":"","title":"Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Recurrent neural network; Computer science; Connection (principal bundle); Automaton; Algorithm; Extension (predicate logic); Rank (graph theory); Artificial neural network; Artificial intelligence; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.08167116604847909,"score_gpt":0.3369207155138802,"score_spread":0.2552495494654011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962994149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029086443,0.00003445041,0.96593636,0.0009158768,0.001100984,0.00008327499,0.000021554997,0.00013672885,0.0026843355],"genre_scores_gemma":[0.95923424,0.00019361294,0.03995382,0.00025539077,0.00028836803,0.000003879351,0.00001910971,0.000009032746,0.000042522668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986177,0.00009900077,0.00033358965,0.00043338415,0.0002521818,0.00026413135],"domain_scores_gemma":[0.99899125,0.0003931607,0.00013926881,0.0001699513,0.00022182653,0.00008451606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002899765,0.00017587401,0.00015601436,0.000076166834,0.00029152082,0.00058081053,0.00042763582,0.000059715498,0.00016129501],"category_scores_gemma":[0.000220378,0.00016339705,0.000021343623,0.00012310724,0.00020526045,0.00034085405,0.00020678976,0.0002640775,0.00003587899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024858608,0.000025304784,0.0000403767,0.0000022625422,0.000011144312,0.000011775436,0.00068302755,0.00008331128,0.00009918405,0.66401017,0.000040564388,0.33496803],"study_design_scores_gemma":[0.00003242551,0.0002943363,0.000112723,0.000037217236,0.0000040717855,0.00003177964,0.00037923208,0.7864067,0.00072774745,0.21153076,0.00028561425,0.00015740363],"about_ca_topic_score_codex":0.000045314784,"about_ca_topic_score_gemma":0.00007083135,"teacher_disagreement_score":0.9301478,"about_ca_system_score_codex":0.00002402604,"about_ca_system_score_gemma":0.000023782188,"threshold_uncertainty_score":0.6663138},"labels":[],"label_agreement":null},{"id":"W2963026695","doi":"","title":"Frank-Wolfe Splitting via Augmented Lagrangian Method","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Augmented Lagrangian method; Sublinear function; Intersection (aeronautics); Rate of convergence; Polytope; Mathematical optimization; Oracle; Mathematics; Convex function; Quadratic equation; Penalty method; Quadratic programming; Feasible region; Computer science; Regular polygon; Combinatorics","score_opus":0.08781745070840186,"score_gpt":0.35371382272008633,"score_spread":0.2658963720116845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963026695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003140606,0.000016351183,0.9780384,0.00018072285,0.00066325226,0.00008630213,0.000075634765,0.00021875957,0.017580029],"genre_scores_gemma":[0.90113807,0.00009081651,0.09822306,0.00017749883,0.00024129865,0.0000059365334,0.000026122518,0.000017444481,0.00007972698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905264,0.000036653462,0.00029446202,0.00021168827,0.00021528319,0.00018924047],"domain_scores_gemma":[0.9992926,0.00015850093,0.000048392507,0.0001386215,0.00029240362,0.000069472255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016633939,0.00015728947,0.00013789989,0.00011997744,0.00009470388,0.0001308966,0.00018675254,0.000056803157,0.00050733914],"category_scores_gemma":[0.00009282116,0.00015815951,0.000024366942,0.000086919055,0.00013206092,0.00007497558,0.000035840534,0.00015524987,0.00014476283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050678736,0.00003158859,0.000021276497,0.000005882836,0.00005499803,0.000020597752,0.0004544008,0.0002990568,0.019181846,0.43725523,0.001110046,0.5415144],"study_design_scores_gemma":[0.000021121514,0.00012246403,0.00008122988,0.00006903274,0.000011365339,0.0000134816755,0.0002132214,0.77330416,0.09063496,0.13378547,0.0015415763,0.00020191933],"about_ca_topic_score_codex":0.00006445742,"about_ca_topic_score_gemma":0.00008661671,"teacher_disagreement_score":0.8979975,"about_ca_system_score_codex":0.000029010876,"about_ca_system_score_gemma":0.000014014366,"threshold_uncertainty_score":0.6449558},"labels":[],"label_agreement":null},{"id":"W2963521484","doi":"","title":"On the Reducibility of Submodular Functions","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Submodular set function; Scalability; Mathematical optimization; Usability; Computer science; Perturbation (astronomy); Optimization problem; Mathematics","score_opus":0.1532288713078988,"score_gpt":0.3317812565828719,"score_spread":0.17855238527497308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963521484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007306006,0.000004383073,0.9804753,0.007422011,0.0006339787,0.00008644837,0.00018455413,0.000023558856,0.003863768],"genre_scores_gemma":[0.9909254,0.000050207622,0.008521056,0.00019812844,0.00004334339,0.0000089720215,0.0000030558842,0.0000030432955,0.00024684405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.0000809977,0.00028775734,0.0002982993,0.00033008662,0.00012656096],"domain_scores_gemma":[0.99805,0.0011214287,0.00009889346,0.00037551325,0.0003066368,0.000047538913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038938204,0.00010067509,0.00009927182,0.00008549402,0.00012020831,0.00009297356,0.0005972759,0.00003146265,0.00042436484],"category_scores_gemma":[0.0007304926,0.000059270547,0.000034778925,0.00012195433,0.0003343026,0.00011077611,0.00009998847,0.0000977831,0.00008166711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022682294,0.000065140746,0.000017679598,0.0000012302355,0.000010611856,0.0000016918733,0.00009806718,0.000012367337,0.00070141646,0.7749533,0.00025196798,0.22386386],"study_design_scores_gemma":[0.000018195791,0.00018478966,0.0003690553,0.000045061628,0.0000024781764,0.0000029229468,0.00010197117,0.04886131,0.0064358814,0.9436188,0.00027313814,0.00008641237],"about_ca_topic_score_codex":0.000026545726,"about_ca_topic_score_gemma":0.00003429215,"teacher_disagreement_score":0.98361933,"about_ca_system_score_codex":0.000021306318,"about_ca_system_score_gemma":0.00005180224,"threshold_uncertainty_score":0.46464974},"labels":[],"label_agreement":null},{"id":"W2963848397","doi":"","title":"{Accurate and conservative estimates of MRF log-likelihood using reverse annealing}","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Estimator; Markov chain Monte Carlo; Mathematics; Markov chain; Markov random field; Statistics; Partition (number theory); Upper and lower bounds; Algorithm; Simulated annealing; Computer science; Artificial intelligence; Combinatorics; Bayesian probability","score_opus":0.25884058999423964,"score_gpt":0.4020975121392004,"score_spread":0.14325692214496077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963848397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046070246,0.00004644236,0.9928189,0.0007576594,0.00036387818,0.00009290557,0.0001332286,0.000019444797,0.0011605438],"genre_scores_gemma":[0.42407215,0.00007645805,0.5755867,0.00020453097,0.000028091941,0.000002172124,0.000007334832,0.0000044361227,0.000018138608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882716,0.000089921254,0.0003677613,0.00029702712,0.00025576702,0.0001623934],"domain_scores_gemma":[0.99851155,0.00034725675,0.00018997185,0.00015354055,0.00065898534,0.00013866476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049507484,0.00014311794,0.00019819986,0.00010438819,0.000060278948,0.00016436457,0.00029090382,0.000057581507,0.000017627912],"category_scores_gemma":[0.00059492025,0.00013126153,0.000017163207,0.000108389155,0.00022565556,0.00024499203,0.00012339427,0.000119100834,0.0000060764287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044039305,0.0000315844,0.00008411931,0.000008166104,0.000018407865,0.000015143884,0.0011081796,0.00009499122,0.0007164133,0.89037186,0.0000934821,0.10741362],"study_design_scores_gemma":[0.000029708779,0.000103343256,0.000036373687,0.00004162163,0.0000060799084,0.000012242241,0.0002213217,0.49933705,0.003136988,0.49695054,0.0000357334,0.00008902761],"about_ca_topic_score_codex":0.00017817602,"about_ca_topic_score_gemma":0.000037087193,"teacher_disagreement_score":0.49924204,"about_ca_system_score_codex":0.000023012915,"about_ca_system_score_gemma":0.00016302674,"threshold_uncertainty_score":0.535269},"labels":[],"label_agreement":null},{"id":"W3037083547","doi":"","title":"Accelerating Smooth Games by Manipulating Spectral Shapes.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Monotone polygon; Eigenvalues and eigenvectors; Acceleration; Regularization (linguistics); Mathematical optimization; Gradient descent; Mathematics; Computer science; Applied mathematics; Algorithm; Geometry; Artificial intelligence","score_opus":0.1591484155708708,"score_gpt":0.3326122698059081,"score_spread":0.17346385423503727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037083547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043633918,0.000011296938,0.9806642,0.012356649,0.00014065814,0.000067946,0.00009038863,0.00006876467,0.006163765],"genre_scores_gemma":[0.8770982,0.000071168244,0.120288365,0.002221159,0.00012851594,0.0000052920645,0.00006033887,0.0000074133723,0.000119568926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985749,0.00005010974,0.0004151387,0.00039653268,0.0003908951,0.00017242077],"domain_scores_gemma":[0.9991835,0.0001850645,0.00014597908,0.00008871946,0.00025655646,0.00014018103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013211725,0.00015141275,0.00014848012,0.000071835064,0.00015060199,0.00066930155,0.00048037808,0.000043724864,0.00076929154],"category_scores_gemma":[0.00031463432,0.00014870096,0.00003395782,0.00020006287,0.0000517995,0.00032288753,0.00010747466,0.00015309542,0.00010832053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013274377,0.000034073382,0.00010179204,0.0000032307444,0.000021978944,0.0000059538947,0.00043281485,0.0026940089,0.0007522607,0.92173666,0.0006557845,0.07354819],"study_design_scores_gemma":[0.00002706443,0.00008206126,0.00017850898,0.0000096199565,0.0000049575474,0.0000018064911,0.00020401848,0.94877297,0.0007047731,0.049452476,0.00039573613,0.00016601606],"about_ca_topic_score_codex":0.000031262498,"about_ca_topic_score_gemma":0.00001735881,"teacher_disagreement_score":0.94607896,"about_ca_system_score_codex":0.000025504996,"about_ca_system_score_gemma":0.000053098454,"threshold_uncertainty_score":0.8423203},"labels":[],"label_agreement":null},{"id":"W3037098147","doi":"","title":"Efficient Planning under Partial Observability with Unnormalized Q Functions and Spectral Learning","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Observability; Sample complexity; Reinforcement learning; Computer science; Observable; Artificial intelligence; Sample (material); Plan (archaeology); Mathematical optimization; Algorithm; Machine learning; Mathematics","score_opus":0.09226570585973484,"score_gpt":0.3228543093033689,"score_spread":0.23058860344363405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037098147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109572,0.0000070500905,0.8862106,0.00044977618,0.00039132632,0.00014326822,0.000009033293,0.000062048304,0.0031549],"genre_scores_gemma":[0.97965795,0.000013722637,0.019559382,0.00010601401,0.000041747782,0.0000066385655,0.000017100072,0.000007836894,0.00058959966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855083,0.000079596786,0.00030991767,0.00040479726,0.00041234627,0.00024250899],"domain_scores_gemma":[0.9990212,0.00034368687,0.0001324221,0.0001882476,0.00021747834,0.00009701591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028345778,0.0001668376,0.00015707947,0.000098718774,0.00016892607,0.00043096044,0.00027480235,0.000050249313,0.00019129491],"category_scores_gemma":[0.00013078099,0.00014628438,0.000018327873,0.00012466432,0.00015281727,0.00014101877,0.00012170226,0.00030260914,0.00007784873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777837,0.000021949658,0.0028507481,0.00000527925,0.000017455886,0.0000055779556,0.00034764202,0.5224936,0.0001866392,0.4695868,0.0000055971054,0.0044109323],"study_design_scores_gemma":[0.00007719956,0.00043646514,0.0025257303,0.00004891422,0.000007684236,0.00001365979,0.0008986883,0.9867063,0.0002249702,0.008710685,0.00015985957,0.00018985156],"about_ca_topic_score_codex":0.000033298133,"about_ca_topic_score_gemma":0.0000129313285,"teacher_disagreement_score":0.87008595,"about_ca_system_score_codex":0.00004427375,"about_ca_system_score_gemma":0.00007781546,"threshold_uncertainty_score":0.5965304},"labels":[],"label_agreement":null},{"id":"W3037151599","doi":"","title":"On the Sample Complexity of Learning Sum-Product Networks","year":2019,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Gaussian; Combinatorics; Tree (set theory); Logarithm; Product (mathematics); Sample complexity; Distribution (mathematics); Discrete mathematics; Set (abstract data type); Base (topology); Total variation; Probability distribution; Class (philosophy); Graphical model; Computer science; Statistics; Artificial intelligence; Mathematical analysis; Geometry","score_opus":0.1729185896493233,"score_gpt":0.3376602831783427,"score_spread":0.16474169352901938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037151599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010868868,0.000010541328,0.98210686,0.0018841907,0.0005351457,0.000116689014,0.00004336912,0.000033126238,0.0044012307],"genre_scores_gemma":[0.9842651,0.00007820769,0.015173231,0.00027889662,0.000048370082,0.000005014667,0.000016211015,0.000005580786,0.00012937594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986308,0.00012139613,0.0003427907,0.0003481522,0.00036923832,0.00018757339],"domain_scores_gemma":[0.99801713,0.0011295684,0.00015802961,0.00029571456,0.0003445655,0.000054980585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045814473,0.00014286504,0.00016130581,0.00007399857,0.000116682706,0.0002103965,0.00070514187,0.00004118804,0.00031927452],"category_scores_gemma":[0.0005515351,0.00010858044,0.000031819927,0.00013302045,0.00023018276,0.000105713996,0.00012336051,0.0003244542,0.00010672234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035632027,0.000045119,0.0001727578,0.0000037291272,0.000013489538,0.0000013406524,0.00020639808,0.007785946,0.00020031398,0.9360939,0.000087392924,0.055353962],"study_design_scores_gemma":[0.000011091054,0.00014528353,0.00014039717,0.00003296905,0.0000016661282,0.0000014020036,0.000101406426,0.5744182,0.00081630354,0.42420322,0.000047471534,0.0000806071],"about_ca_topic_score_codex":0.00010279837,"about_ca_topic_score_gemma":0.00003453053,"teacher_disagreement_score":0.97339624,"about_ca_system_score_codex":0.000019092555,"about_ca_system_score_gemma":0.00005715758,"threshold_uncertainty_score":0.4427782},"labels":[],"label_agreement":null},{"id":"W3037201993","doi":"","title":"Purifying Interaction Effects with the Functional ANOVA: An Efficient Algorithm for Recovering Identifiable Additive Models","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Identifiability; Interpretability; Representation (politics); Piecewise; Equivalence (formal languages); Computer science; Decomposition; Algorithm; Additive model; Mathematics; Generalized additive model; Function (biology); Variance (accounting); Artificial intelligence; Machine learning; Discrete mathematics","score_opus":0.14353834344966945,"score_gpt":0.3268560395712488,"score_spread":0.18331769612157936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037201993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018939285,0.000015394753,0.9919799,0.0034539413,0.00088219513,0.0005424264,0.00017168903,0.00010211761,0.00095842744],"genre_scores_gemma":[0.8687044,0.000052060343,0.12915331,0.0013109569,0.0003754653,0.00018126336,0.00009276494,0.000026624388,0.00010316404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777514,0.00011467401,0.00043398104,0.0007323374,0.00057914545,0.00036471433],"domain_scores_gemma":[0.99751097,0.00096277037,0.00022600325,0.00026870013,0.000844119,0.00018745183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040284978,0.00027505882,0.00021914665,0.0001275944,0.00047072192,0.0009824126,0.00072513206,0.00007283016,0.00007987482],"category_scores_gemma":[0.00028070653,0.00021920429,0.000051002637,0.00028764055,0.00018460865,0.0009374534,0.00014596073,0.00030524938,0.00006740236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015485966,0.00008677662,0.0000013021264,0.00001142232,0.000040455787,0.00001612679,0.0014913463,0.0411347,0.00070810557,0.6192497,0.00024160853,0.3368636],"study_design_scores_gemma":[0.000052746847,0.00063490955,0.000012094106,0.000055101285,0.0000154907,0.0000130291255,0.0020727057,0.8983718,0.01758007,0.08050831,0.0004300656,0.0002536547],"about_ca_topic_score_codex":0.000073030096,"about_ca_topic_score_gemma":0.000096516815,"teacher_disagreement_score":0.86681044,"about_ca_system_score_codex":0.0000922828,"about_ca_system_score_gemma":0.00013526884,"threshold_uncertainty_score":0.94734275},"labels":[],"label_agreement":null},{"id":"W3037273417","doi":"","title":"An Empirical Study of Stochastic Gradient Descent with Structured Covariance Noise","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Covariance; Computer science; Stochastic gradient descent; Noise (video); Mathematics; Artificial intelligence; Statistics; Artificial neural network","score_opus":0.12200836348456308,"score_gpt":0.35059324104909745,"score_spread":0.22858487756453438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037273417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054964613,0.000004697234,0.9435865,0.00071994343,0.000290546,0.0001855638,0.00012550438,0.000045451317,0.00007714881],"genre_scores_gemma":[0.9548172,0.00000904113,0.04473028,0.00032483914,0.000075791075,0.000006583064,0.000025418665,0.0000073567053,0.0000035228534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983751,0.00009627341,0.00039248148,0.00046885398,0.0004980257,0.00016923444],"domain_scores_gemma":[0.9988332,0.00018315046,0.00015655381,0.0002712163,0.00036880153,0.000187102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011984969,0.00016403203,0.00019601703,0.00006805049,0.000095083655,0.00021205774,0.0006673845,0.00004146102,0.0000768281],"category_scores_gemma":[0.00013051419,0.00013484797,0.000014349872,0.00018430297,0.00011922633,0.00017683979,0.00008813927,0.00019602169,0.000010347877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069067435,0.000927569,0.001008466,0.000012033846,0.00006112973,0.00008745843,0.0087250145,0.049105596,0.00058340473,0.8057716,0.00020438734,0.13282268],"study_design_scores_gemma":[0.0001183079,0.0022543084,0.001768037,0.000033370914,0.00001302895,0.000009986901,0.0015434927,0.97277087,0.00042319324,0.02083068,0.00002936352,0.00020534766],"about_ca_topic_score_codex":0.00004231461,"about_ca_topic_score_gemma":0.00009880811,"teacher_disagreement_score":0.9236653,"about_ca_system_score_codex":0.000016298447,"about_ca_system_score_gemma":0.00006471562,"threshold_uncertainty_score":0.5498941},"labels":[],"label_agreement":null},{"id":"W3037467471","doi":"","title":"Optimization Methods for Interpretable Differentiable Decision Trees Applied to Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Differentiable function; Artificial intelligence; Computer science; Decision tree; Machine learning; Mathematical optimization; Mathematics","score_opus":0.11948672140957296,"score_gpt":0.38912509464424233,"score_spread":0.2696383732346694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037467471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001309084,0.000010593565,0.99269545,0.0024769048,0.00046052405,0.00056027033,0.000022376213,0.00012461872,0.0035183402],"genre_scores_gemma":[0.4270589,0.000063121886,0.57148075,0.0010144113,0.00008501841,0.0000863987,0.000034362725,0.00001539456,0.00016164467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976686,0.00009265255,0.00071377214,0.00073002087,0.00040018396,0.00039475813],"domain_scores_gemma":[0.9976984,0.0009778774,0.00019080908,0.00025889723,0.00057329866,0.00030069178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053331954,0.00027774094,0.0003048142,0.00021073427,0.00028281022,0.00080019183,0.00094803976,0.000088485176,0.00035564604],"category_scores_gemma":[0.0016692198,0.0002769208,0.000056171237,0.0003408766,0.00007679058,0.00036105773,0.00033200142,0.00022143069,0.0001444947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018941938,0.000030766198,0.0000034804982,0.0000068972313,0.000017290413,0.0000014476235,0.0009758162,0.23897114,0.0024299077,0.505233,0.00018459959,0.25195622],"study_design_scores_gemma":[0.00004207273,0.00053563964,0.000004470387,0.000042625685,0.000009797623,0.0000013492912,0.0006850243,0.8677044,0.024634844,0.10415313,0.0019160123,0.00027067712],"about_ca_topic_score_codex":0.000028522612,"about_ca_topic_score_gemma":0.00002941455,"teacher_disagreement_score":0.6287332,"about_ca_system_score_codex":0.00007642848,"about_ca_system_score_gemma":0.00008293344,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W3037549864","doi":"","title":"Causal inference in degenerate systems: An impossibility result","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Directed acyclic graph; Impossibility; Degenerate energy levels; Causal inference; Causal model; Computer science; Directed graph; Theoretical computer science; Inference; Mathematics; Algorithm; Artificial intelligence; Econometrics; Statistics","score_opus":0.21076806855309826,"score_gpt":0.37708931540970275,"score_spread":0.1663212468566045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037549864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018336305,0.000025272953,0.9769783,0.0022138462,0.00047978072,0.00015749551,0.00015646286,0.000093842966,0.0015586844],"genre_scores_gemma":[0.9737106,0.00012235978,0.02530805,0.0006461674,0.00012325299,0.000018847282,0.00003436311,0.000009167575,0.000027169106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975892,0.00021379245,0.00069359073,0.0007429927,0.00044696045,0.00031350573],"domain_scores_gemma":[0.9984555,0.00034143438,0.00014994784,0.00031321734,0.00044670547,0.0002931591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048702213,0.00023930265,0.00025321756,0.00012549924,0.00010253148,0.00077798555,0.0009367859,0.0001071487,0.000059244114],"category_scores_gemma":[0.00079345255,0.00023204632,0.000023225677,0.00026467044,0.0001471095,0.00053764693,0.0001652694,0.00035648487,0.000095697615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078647376,0.00008802391,0.0002797481,0.000010914432,0.000007932672,0.000045052675,0.0011853119,0.0049794125,0.0012883524,0.92313755,0.000030766678,0.068868265],"study_design_scores_gemma":[0.000044923996,0.00032119066,0.00030177413,0.00004252808,0.0000027355725,0.0000042172774,0.000336377,0.86988086,0.0011188395,0.12765911,0.00004342851,0.00024400746],"about_ca_topic_score_codex":0.00030439722,"about_ca_topic_score_gemma":0.0002732095,"teacher_disagreement_score":0.9553743,"about_ca_system_score_codex":0.000052456875,"about_ca_system_score_gemma":0.00022243656,"threshold_uncertainty_score":0.9462574},"labels":[],"label_agreement":null},{"id":"W3037571487","doi":"","title":"Value Preserving State-Action Abstractions","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Value (mathematics); State (computer science); Action (physics); Programming language; Machine learning","score_opus":0.23789144969792853,"score_gpt":0.3741205699300081,"score_spread":0.13622912023207956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037571487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045895242,0.0000041590097,0.9844529,0.0057595014,0.00062669814,0.000104616876,0.000034079207,0.000101426784,0.0084576765],"genre_scores_gemma":[0.9311973,0.0001494539,0.0673078,0.0008695347,0.00011987141,0.000008015429,0.000022242695,0.000009185019,0.000316607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864423,0.00005265069,0.0003645326,0.00033326162,0.00042043376,0.0001848655],"domain_scores_gemma":[0.9990258,0.00025015272,0.00014646995,0.00017086495,0.00026365186,0.00014305608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001442417,0.00013869964,0.000113731236,0.00007962517,0.00014601345,0.00053624925,0.00056719553,0.00004300163,0.0003368287],"category_scores_gemma":[0.0004273273,0.00014337021,0.000024663055,0.000118376774,0.00007549416,0.0004266227,0.00014996395,0.00025542098,0.00036605637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025579198,0.000021411079,0.000034426947,0.000007740223,0.000018669194,0.00001222256,0.00070641516,0.12787585,0.0008141842,0.80146074,0.00033162616,0.06869115],"study_design_scores_gemma":[0.000020251782,0.00016739749,0.0002276003,0.000015841924,0.0000037435768,0.000004462065,0.00026213285,0.92397344,0.0020682507,0.07173079,0.0013803872,0.00014571256],"about_ca_topic_score_codex":0.000051409577,"about_ca_topic_score_gemma":0.000018255516,"teacher_disagreement_score":0.93073833,"about_ca_system_score_codex":0.000037368096,"about_ca_system_score_gemma":0.000074777025,"threshold_uncertainty_score":0.58464676},"labels":[],"label_agreement":null},{"id":"W3037668816","doi":"","title":"Asynchronous Gibbs Sampling.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gibbs sampling; Markov chain Monte Carlo; Asynchronous communication; Computer science; Markov chain; Algorithm; Bayesian probability; Sampling (signal processing); Set (abstract data type); Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.2058612348148112,"score_gpt":0.3747995126403912,"score_spread":0.16893827782558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037668816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010698532,0.00002166932,0.98039263,0.009260232,0.00044871104,0.000088453366,0.00007223639,0.00007083626,0.009538243],"genre_scores_gemma":[0.4093853,0.000112634945,0.58817303,0.0021176639,0.00015091944,0.0000054771112,0.000009479066,0.0000063422626,0.00003913379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987229,0.00006596562,0.0003114767,0.0004138093,0.00029430076,0.00019153961],"domain_scores_gemma":[0.9991125,0.00022573222,0.000088295834,0.0001707348,0.00021956986,0.00018320854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018978187,0.0001528423,0.00015528704,0.000060496375,0.00009612187,0.00036613405,0.00061876874,0.000057767422,0.00021180774],"category_scores_gemma":[0.0003137346,0.00014383778,0.000029777935,0.00011759749,0.000094860196,0.0001806057,0.00013724455,0.00019158146,0.00016791362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016183352,0.000018496696,0.0000044605954,0.0000028994089,0.000007831053,0.000011104125,0.00040760805,0.000023722312,0.00035547797,0.60322523,0.00013815373,0.39578885],"study_design_scores_gemma":[0.000019093633,0.00016233786,0.000031695294,0.000013166753,0.00000326271,0.0000068116587,0.000055260254,0.4031604,0.0015515054,0.5937707,0.0010780765,0.00014769056],"about_ca_topic_score_codex":0.000014683814,"about_ca_topic_score_gemma":0.000009301994,"teacher_disagreement_score":0.40927833,"about_ca_system_score_codex":0.00001878724,"about_ca_system_score_gemma":0.0000892508,"threshold_uncertainty_score":0.5865534},"labels":[],"label_agreement":null},{"id":"W3037675535","doi":"","title":"On Minimax Optimality of GANs for Robust Mean Estimation.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Control Systems and Identification","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Simon Fraser University; University of Waterloo","funders":"","keywords":"Minimax; Estimation; Mathematical optimization; Computer science; Robustness (evolution); Mathematics; Applied mathematics; Economics","score_opus":0.1417360051587558,"score_gpt":0.3205866555247586,"score_spread":0.1788506503660028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037675535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005064114,0.000010886539,0.9910836,0.0007033409,0.00033726875,0.0002024959,0.0006819964,0.000037703197,0.0018785888],"genre_scores_gemma":[0.98172706,0.000032138112,0.017937385,0.000073802796,0.00007623425,0.000022116497,0.00008352953,0.000010378259,0.000037344456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991692,0.000015608604,0.00037901755,0.00016297794,0.00018048358,0.000092712726],"domain_scores_gemma":[0.9993062,0.00023693014,0.00007413185,0.00008122555,0.00024008959,0.00006143053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120282355,0.00010248767,0.00014357708,0.00005224894,0.00003759632,0.00007513416,0.00012696399,0.000039596256,0.00014249007],"category_scores_gemma":[0.00032625694,0.00010441236,0.000028852695,0.00005074821,0.000049280028,0.00006464901,0.00000924336,0.0000678213,0.000032174117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012562511,0.000033439977,0.000008443446,0.000053731295,0.000033115022,9.234385e-7,0.000579875,0.07944252,0.0025386454,0.8267657,0.0008239554,0.089593984],"study_design_scores_gemma":[0.000042370662,0.00014867976,0.000093571085,0.000035405337,0.000010019043,4.9573526e-7,0.00026969714,0.9557461,0.004040791,0.039385974,0.00012923556,0.000097619544],"about_ca_topic_score_codex":0.00002188918,"about_ca_topic_score_gemma":0.00004385806,"teacher_disagreement_score":0.97666293,"about_ca_system_score_codex":0.000022010607,"about_ca_system_score_gemma":0.000018932233,"threshold_uncertainty_score":0.42578125},"labels":[],"label_agreement":null},{"id":"W3037721576","doi":"","title":"A Tight and Unified Analysis of Gradient-Based Methods for a Whole Spectrum of Differentiable Games.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Differentiable function; Computer science; Spectrum (functional analysis); Mathematical optimization; Mathematics; Physics; Mathematical analysis","score_opus":0.1016578330645837,"score_gpt":0.3708106973623068,"score_spread":0.2691528642977231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037721576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030744916,0.000020023668,0.99471134,0.0013769527,0.00010170011,0.00011526391,0.00034549282,0.000013144461,0.0002415654],"genre_scores_gemma":[0.75840145,0.000028830265,0.24135001,0.00012060129,0.000016741731,0.000006638856,0.00003132392,0.0000034593152,0.000040974137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998967,0.00008620006,0.0003849834,0.00027944695,0.00016315874,0.000119199416],"domain_scores_gemma":[0.9987391,0.00062852213,0.00019434796,0.00013661076,0.00021607275,0.00008533469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002861764,0.000110757945,0.0002803839,0.00020072579,0.000042504096,0.00008187929,0.00034143782,0.00003552119,0.000089856796],"category_scores_gemma":[0.00026940968,0.000100731566,0.000057811798,0.0003184533,0.00014932646,0.00007708731,0.00006516626,0.00006773847,0.0000015038612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009701211,0.00006216561,0.000044904507,0.0000248288,0.00015325691,0.0000011642687,0.00047832148,0.00031084937,0.0028692312,0.91505015,0.000015878772,0.08089225],"study_design_scores_gemma":[0.00004449851,0.00023859327,0.00013044689,0.000014027336,0.00007343678,2.879266e-7,0.000106556974,0.7719403,0.027948296,0.19928688,0.00013465482,0.00008202227],"about_ca_topic_score_codex":0.000025510815,"about_ca_topic_score_gemma":0.000020412093,"teacher_disagreement_score":0.77162945,"about_ca_system_score_codex":0.0000073815313,"about_ca_system_score_gemma":0.000049248265,"threshold_uncertainty_score":0.4107714},"labels":[],"label_agreement":null},{"id":"W3037834087","doi":"","title":"Structured Conditional Continuous Normalizing Flows for Efficient Amortized Inference in Graphical Models.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Graphical model; Computer science; Inference; Amortized analysis; Theoretical computer science; Programming language; Data structure; Artificial intelligence","score_opus":0.11644873757317396,"score_gpt":0.34251640125676824,"score_spread":0.22606766368359427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037834087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073792376,0.000012822387,0.986497,0.0048580775,0.00021234147,0.00032206118,0.00032114462,0.00004932939,0.0003479977],"genre_scores_gemma":[0.94393706,0.0000528346,0.054811534,0.0009266777,0.00009549993,0.000069755064,0.00009195265,0.0000071384075,0.0000075165835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984695,0.000041145282,0.0004809261,0.0004578092,0.0003116913,0.0002389373],"domain_scores_gemma":[0.9987129,0.0005745549,0.0001245441,0.00013793749,0.00030343677,0.00014664966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406835,0.00016911502,0.00020307214,0.000099044075,0.0001181538,0.00028363074,0.0005381268,0.00006456249,0.000052282976],"category_scores_gemma":[0.0002713662,0.00016337958,0.000041785283,0.00021368689,0.000108774286,0.00016635218,0.00010564105,0.00020502192,0.00001295774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073824565,0.000050548333,0.000028820912,0.0000056676577,0.000008753158,0.00000797004,0.00030703822,0.046895657,0.00073748827,0.91657215,0.000082986786,0.03522907],"study_design_scores_gemma":[0.0000643106,0.00008061301,0.00008468115,0.000013701721,0.0000026028672,0.000001752535,0.00006926053,0.63524765,0.00039569053,0.363822,0.000099199366,0.00011850887],"about_ca_topic_score_codex":0.000025300818,"about_ca_topic_score_gemma":0.00009195997,"teacher_disagreement_score":0.9365578,"about_ca_system_score_codex":0.000022068714,"about_ca_system_score_gemma":0.00007334047,"threshold_uncertainty_score":0.6662426},"labels":[],"label_agreement":null},{"id":"W3037853175","doi":"","title":"Greed Meets Sparsity: Understanding and Improving Greedy Coordinate Descent for Sparse Optimization.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Coordinate descent; Greedy algorithm; Computer science; Mathematical optimization; Descent (aeronautics); Artificial intelligence; Algorithm; Mathematics; Engineering","score_opus":0.25451475130093054,"score_gpt":0.32385380956479615,"score_spread":0.0693390582638656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037853175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008022389,0.000011926556,0.9922473,0.006407197,0.00029448004,0.00033923596,0.00010850938,0.000114925475,0.00039622895],"genre_scores_gemma":[0.58456415,0.00007366334,0.41476735,0.00048579602,0.000044319604,0.000016042568,0.000022615597,0.00000899543,0.000017090402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866873,0.000034210476,0.0003581752,0.00046007553,0.00027430552,0.00020447593],"domain_scores_gemma":[0.99891233,0.00029153543,0.00016561088,0.00012605329,0.00033938122,0.00016505917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020437484,0.00017436927,0.00017013759,0.0001325345,0.0001952646,0.00047596465,0.0003848333,0.000059036705,0.00003944391],"category_scores_gemma":[0.0005866662,0.00018293031,0.000023503262,0.0001490656,0.00014332678,0.00028265172,0.00016866151,0.00010781438,0.0000048745187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057183293,0.000028204619,0.000024329916,0.000015537196,0.000017517392,0.0000062392396,0.0006282382,0.007087733,0.00017501632,0.96388507,0.000121215024,0.027953722],"study_design_scores_gemma":[0.00006405614,0.00024857328,0.000010395706,0.000029984616,0.000010093057,0.00000551979,0.0003389606,0.840924,0.00081091403,0.15735687,0.000032364107,0.00016825405],"about_ca_topic_score_codex":0.000019294012,"about_ca_topic_score_gemma":0.000012862308,"teacher_disagreement_score":0.83383626,"about_ca_system_score_codex":0.00006842691,"about_ca_system_score_gemma":0.00006018559,"threshold_uncertainty_score":0.74596816},"labels":[],"label_agreement":null},{"id":"W3037881973","doi":"","title":"RelatIF: Identifying Explanatory Training Samples via Relative Influence","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Outlier; Computer science; Machine learning; Constraint (computer-aided design); Class (philosophy); Training (meteorology); Artificial intelligence; Econometrics; Mathematics; Geography","score_opus":0.26809332033682753,"score_gpt":0.37037197020667495,"score_spread":0.10227864986984742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037881973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015130219,0.000020951868,0.9887015,0.005533937,0.00026366196,0.00009048685,0.000086158056,0.00010817424,0.0036821077],"genre_scores_gemma":[0.91463965,0.00009388525,0.08412224,0.00091293064,0.000081625796,0.000009782701,0.00006909127,0.000008229452,0.00006256165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834144,0.000121400335,0.00043246002,0.00049733766,0.00041423657,0.00019309539],"domain_scores_gemma":[0.9986769,0.0005056251,0.0002027601,0.00020423764,0.00024831027,0.00016214182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029287863,0.00016671559,0.00015834084,0.000108559034,0.0001913696,0.0004154711,0.0006455621,0.00006494222,0.00012305376],"category_scores_gemma":[0.0012158168,0.00016786937,0.000026570044,0.00018037316,0.00013132041,0.0007023285,0.00013805793,0.00034874797,0.00023935531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021132802,0.000014494864,0.00015173957,0.000005881813,0.000014455785,0.000012858936,0.0033998194,0.00030506286,0.001048617,0.7731393,0.000055105058,0.22183156],"study_design_scores_gemma":[0.00003577042,0.00014026412,0.0017606427,0.000052103784,0.0000071664394,0.000009859763,0.00097388966,0.659647,0.0007052916,0.3350254,0.0014009251,0.00024169695],"about_ca_topic_score_codex":0.000053613927,"about_ca_topic_score_gemma":0.00002924796,"teacher_disagreement_score":0.91312665,"about_ca_system_score_codex":0.0000308419,"about_ca_system_score_gemma":0.0000846248,"threshold_uncertainty_score":0.6845514},"labels":[],"label_agreement":null},{"id":"W3037971676","doi":"","title":"Scalable Gradients for Stochastic Differential Equations","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stochastic differential equation; Stochastic partial differential equation; Computer science; Applied mathematics; Ordinary differential equation; Differential equation; Mathematics; Scalability; Sensitivity (control systems); Mathematical optimization; Mathematical analysis","score_opus":0.15830360329223048,"score_gpt":0.34996379081900825,"score_spread":0.19166018752677777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037971676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023253548,0.000002537374,0.9933671,0.0016097811,0.00049883587,0.0001840596,0.0005738411,0.000018590983,0.0014199269],"genre_scores_gemma":[0.99640864,0.0000050919375,0.0023971817,0.00020040148,0.00048018032,0.000035536,0.00019883578,0.000009241055,0.00026487184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919134,0.000019174287,0.0002438723,0.00023734612,0.00015879901,0.0001494675],"domain_scores_gemma":[0.99937636,0.0001850069,0.00007526729,0.00005845785,0.00018015684,0.00012476022],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000037015016,0.00011727544,0.00011532342,0.000036421123,0.00012793829,0.0001342106,0.000130904,0.000024768242,0.001585283],"category_scores_gemma":[0.00007025038,0.00011278707,0.000036670688,0.000051739116,0.00007463908,0.00006925733,0.000027589502,0.00010841185,0.000066743865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104922285,0.000060233288,0.000014400795,0.000002849799,0.000025666415,3.4681304e-7,0.00018278364,0.002591059,0.00038505162,0.90476733,0.0005734587,0.0912919],"study_design_scores_gemma":[0.000051433526,0.00011130106,0.000010970537,0.000010688918,0.000013370887,2.6937892e-7,0.00025899292,0.8096203,0.00062272215,0.18899514,0.00019208874,0.000112728],"about_ca_topic_score_codex":0.000014977953,"about_ca_topic_score_gemma":0.000003264383,"teacher_disagreement_score":0.9940833,"about_ca_system_score_codex":0.000008500246,"about_ca_system_score_gemma":0.000028886037,"threshold_uncertainty_score":0.9993274},"labels":[],"label_agreement":null},{"id":"W3090986099","doi":"","title":"Accelerated Stochastic Power Iteration","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Power (physics); Mathematical optimization; Mathematics; Physics","score_opus":0.09359267841454008,"score_gpt":0.3200912996233732,"score_spread":0.2264986212088331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090986099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023370849,0.000010911209,0.96291155,0.00016701921,0.0015069433,0.00013030985,0.00014276843,0.000138695,0.011620982],"genre_scores_gemma":[0.9963441,0.000043931326,0.0029793256,0.00013477006,0.00022130455,0.000013663615,0.000053854677,0.000020455078,0.00018861849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989574,0.000021089974,0.00033231304,0.00021362207,0.00026781636,0.0002077407],"domain_scores_gemma":[0.99925345,0.00010247591,0.000043043976,0.00013100989,0.00038947025,0.00008055482],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001269339,0.00017517687,0.00012458263,0.0001581783,0.00010275302,0.00026370902,0.00019399272,0.00007107656,0.0016675199],"category_scores_gemma":[0.000108814966,0.00017292374,0.000015609681,0.00012430103,0.00016854824,0.00021987653,0.000023573957,0.00015474015,0.0007899513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012730077,0.000063038045,0.000024729805,0.000010317029,0.000060150913,0.000013494994,0.0012931491,0.006609265,0.012107524,0.8787088,0.002200416,0.09878183],"study_design_scores_gemma":[0.000039419807,0.00025349043,0.00020683504,0.000046882808,0.000007891603,0.000008190093,0.00021832959,0.9486388,0.015621135,0.034301404,0.00040364914,0.0002539895],"about_ca_topic_score_codex":0.00000872386,"about_ca_topic_score_gemma":0.00003309771,"teacher_disagreement_score":0.9729732,"about_ca_system_score_codex":0.000053277676,"about_ca_system_score_gemma":0.00003285346,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W3157199058","doi":"","title":"Variational Selective Autoencoder: Learning from Partially-Observed Heterogeneous Data","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Autoencoder; Imputation (statistics); Computer science; Missing data; Data modeling; Data mining; Machine learning; Artificial intelligence; Deep learning; Pattern recognition (psychology)","score_opus":0.25313555036735474,"score_gpt":0.3503186380782304,"score_spread":0.09718308771087564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157199058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055725075,0.00004166507,0.993211,0.0018942963,0.00073099986,0.00006937726,0.00022234778,0.00009280738,0.003180302],"genre_scores_gemma":[0.7973918,0.00018273185,0.20041333,0.0006256014,0.00017167868,0.000008846954,0.0007803625,0.000011969463,0.00041371782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977529,0.00025549898,0.00045533155,0.00073196617,0.0005628992,0.00024142323],"domain_scores_gemma":[0.9978842,0.0007394187,0.00018284394,0.0004077744,0.00065413147,0.00013162481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033184254,0.0001849547,0.00018409148,0.00008482543,0.0002526068,0.00079079234,0.0008799004,0.00007733596,0.00078868016],"category_scores_gemma":[0.0012037298,0.00020055908,0.000029677018,0.00018963021,0.00008684776,0.0004324808,0.00041256577,0.00033244223,0.00019765183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038672904,0.000096071744,0.0001706796,0.0000022339823,0.00007086214,0.00009923303,0.0007972411,0.015655305,0.0007396492,0.8175689,0.00014775254,0.16461343],"study_design_scores_gemma":[0.000048273912,0.00006554298,0.0005587664,0.000022105987,0.000008775829,0.000015717858,0.00028009378,0.82482547,0.0013397265,0.17084283,0.0018036979,0.00018901107],"about_ca_topic_score_codex":0.00009898943,"about_ca_topic_score_gemma":0.00033731456,"teacher_disagreement_score":0.8091701,"about_ca_system_score_codex":0.00004946092,"about_ca_system_score_gemma":0.00032874136,"threshold_uncertainty_score":0.8635495},"labels":[],"label_agreement":null},{"id":"W3157424867","doi":"","title":"A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrix","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Forgetting; Computer science; Gradient descent; Principal component analysis; Similarity (geometry); Task (project management); Matrix (chemical analysis); Stochastic gradient descent; Field (mathematics); Measure (data warehouse); Artificial intelligence; Algorithm; Data mining; Mathematics; Image (mathematics); Chemistry; Engineering; Psychology","score_opus":0.08335431458207082,"score_gpt":0.3645647301400853,"score_spread":0.28121041555801446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157424867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021157083,0.00003455588,0.98857886,0.0031220606,0.00027136426,0.000053170777,0.00010223986,0.000020286692,0.005701751],"genre_scores_gemma":[0.9342164,0.000098313234,0.06509928,0.0003805061,0.000035827874,0.0000047139656,0.00004525225,0.000004431529,0.00011527985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985271,0.00013996793,0.00042024467,0.00029902614,0.00044694563,0.00016669364],"domain_scores_gemma":[0.9982678,0.00075978774,0.00016730253,0.0002667577,0.00048816006,0.00005014247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003146793,0.00011555988,0.00018679259,0.00011250605,0.00013704957,0.0002904222,0.00048048265,0.000040978655,0.00059511885],"category_scores_gemma":[0.0006957582,0.00009173646,0.000069362824,0.0005014312,0.00028595625,0.00015238191,0.0001447192,0.00018134956,0.00002494767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019147004,0.000045500365,0.000080644844,0.0000031664745,0.00013714719,0.000018806219,0.0013025741,0.0021990445,0.00043170177,0.94790864,0.000026643982,0.047827013],"study_design_scores_gemma":[0.00001808207,0.00004197673,0.00031384997,0.000014938466,0.000047144746,0.000006220052,0.0014564067,0.62599826,0.0011464223,0.37063012,0.00024288452,0.00008368298],"about_ca_topic_score_codex":0.000031488682,"about_ca_topic_score_gemma":0.00004885207,"teacher_disagreement_score":0.9321007,"about_ca_system_score_codex":0.00001996626,"about_ca_system_score_gemma":0.00010886833,"threshold_uncertainty_score":0.6516134},"labels":[],"label_agreement":null},{"id":"W3157563060","doi":"","title":"On the role of data in PAC-Bayes","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bayes' theorem; Artificial intelligence; Data mining; Bayesian probability","score_opus":0.08857393213513721,"score_gpt":0.3235185906190126,"score_spread":0.2349446584838754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157563060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15156287,0.00056856853,0.69277877,0.0035748724,0.0032319594,0.00054562435,0.003559278,0.00015759234,0.14402048],"genre_scores_gemma":[0.9992976,0.00014629032,0.0003446102,0.000064264445,0.000037324833,0.00000603674,0.00003674571,0.0000055791293,0.00006155589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931914,0.000039480816,0.00024508056,0.00013556275,0.00017953757,0.000081175094],"domain_scores_gemma":[0.9992942,0.00036435566,0.000030243307,0.0001946479,0.000093663824,0.0000228558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015335786,0.00007293256,0.00009432222,0.0000510233,0.000022806407,0.00006010672,0.00020974198,0.000031318556,0.00037797925],"category_scores_gemma":[0.00028307945,0.00005920353,0.000010522001,0.000073026415,0.000046100562,0.00005137752,0.000030741496,0.00011855598,0.00004194865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024037816,0.000027066519,0.00003797232,0.000004503373,0.000016401402,0.0000070828187,0.00015460537,0.00094337587,0.003386756,0.8474246,0.000088943045,0.14788462],"study_design_scores_gemma":[0.000019944866,0.000033108558,0.0001012076,0.000053330175,0.0000027486963,0.0000034040133,0.0016603551,0.796124,0.01248362,0.18824172,0.0012038407,0.00007274858],"about_ca_topic_score_codex":0.00005582629,"about_ca_topic_score_gemma":0.0006061166,"teacher_disagreement_score":0.8477347,"about_ca_system_score_codex":0.000015035176,"about_ca_system_score_gemma":0.000025027068,"threshold_uncertainty_score":0.41386077},"labels":[],"label_agreement":null},{"id":"W3157613611","doi":"","title":"Online Sparse Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Markov decision process; Reinforcement learning; Dimension (graph theory); Upper and lower bounds; Time horizon; Q-learning; Oracle; Mathematics; Lasso (programming language); Mathematical optimization; Computer science; Markov process; Combinatorics; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.40048191254290866,"score_gpt":0.49729921246262404,"score_spread":0.09681729991971538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157613611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024951494,0.00002423779,0.9870315,0.001999762,0.00060095143,0.00008122922,0.000150016,0.000023687784,0.007593464],"genre_scores_gemma":[0.96811193,0.00044556105,0.020336296,0.00031868156,0.00020867001,0.000007851381,0.000153691,0.000011536032,0.010405786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967614,0.00017084515,0.0006843545,0.00050544186,0.0016163564,0.0002616357],"domain_scores_gemma":[0.99615526,0.0014761115,0.00016740357,0.00025696447,0.0017949227,0.00014934831],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077064073,0.0001498582,0.00020343164,0.0002096347,0.00018676628,0.0005560044,0.00045583525,0.000058567308,0.0054442734],"category_scores_gemma":[0.008803629,0.00012972594,0.000040491046,0.00030660012,0.00022076217,0.0001965958,0.00021325155,0.00036002594,0.0006861209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008131028,0.00012572749,0.00013384646,0.0000018494947,0.000019146231,0.00014412138,0.00024827287,0.020063894,0.0005229427,0.50864875,0.0004327381,0.46957737],"study_design_scores_gemma":[0.000039820326,0.0001505419,0.00028590203,0.000024331717,0.000003644799,0.000020115827,0.0032257736,0.545452,0.003981931,0.4394213,0.007235308,0.00015934714],"about_ca_topic_score_codex":0.000022998096,"about_ca_topic_score_gemma":0.00024356102,"teacher_disagreement_score":0.9666952,"about_ca_system_score_codex":0.00005514658,"about_ca_system_score_gemma":0.0001852285,"threshold_uncertainty_score":0.99954563},"labels":[],"label_agreement":null},{"id":"W3158338018","doi":"","title":"Detection and Defense of Topological Adversarial Attacks on Graphs","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Adversarial system; Computer science; Computer security; Topology (electrical circuits); Mathematics; Artificial intelligence; Combinatorics","score_opus":0.09422810246771066,"score_gpt":0.33925757296241404,"score_spread":0.2450294704947034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158338018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025589982,0.000021904993,0.9709618,0.0006501557,0.0007731209,0.0000679698,0.00004953415,0.000027399881,0.0018581066],"genre_scores_gemma":[0.9774288,0.00029245653,0.021918133,0.00025815386,0.000046501238,0.0000041443113,0.0000073556967,0.0000039285574,0.000040506842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988712,0.00007667414,0.00028823662,0.00035537995,0.00026661457,0.00014188736],"domain_scores_gemma":[0.9988974,0.00045847587,0.000106636486,0.00016248821,0.00030262663,0.00007240912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011143831,0.00012308668,0.00014365872,0.00009373807,0.000084953375,0.00010287416,0.0002108987,0.0000688406,0.000059062266],"category_scores_gemma":[0.00033506707,0.00011510682,0.000028857077,0.00014827153,0.00020433805,0.00012741148,0.000106494976,0.00018009129,0.000009344441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000771873,0.000049778937,0.00007707339,0.0000027171423,0.0000110386,0.000036078793,0.000103493985,0.0002452097,0.0014449361,0.82987714,0.000012422077,0.1680629],"study_design_scores_gemma":[0.000054266548,0.00041693868,0.0007010786,0.000033882334,0.0000057707466,0.000031422984,0.00017452284,0.17070872,0.01925171,0.80837375,0.000097476026,0.00015049717],"about_ca_topic_score_codex":0.000011647017,"about_ca_topic_score_gemma":0.000085080384,"teacher_disagreement_score":0.95183885,"about_ca_system_score_codex":0.000014327143,"about_ca_system_score_gemma":0.000032597105,"threshold_uncertainty_score":0.46939197},"labels":[],"label_agreement":null},{"id":"W3158392704","doi":"","title":"On the Suboptimality of Negative Momentum for Minimax Optimization","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Momentum (technical analysis); Minimax; Convergence (economics); Mathematical optimization; Mathematics; Rate of convergence; Simple (philosophy); Applied mathematics; Computer science; Economics; Key (lock)","score_opus":0.47666892159196084,"score_gpt":0.4878975526146724,"score_spread":0.011228631022711544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158392704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001281908,0.000003684052,0.9846703,0.010936055,0.00019614813,0.0003307421,0.0009739091,0.00000885308,0.0015983959],"genre_scores_gemma":[0.9631561,0.00004531416,0.03594643,0.00051134505,0.00008620172,0.00003363411,0.000027413924,0.000008252024,0.00018529333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770045,0.00013342987,0.0005871176,0.00036646143,0.0010555972,0.00015695757],"domain_scores_gemma":[0.99191666,0.0061887586,0.00025733988,0.0001727121,0.001372377,0.00009215467],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008409644,0.00012232138,0.00018650516,0.000101271784,0.0001292821,0.00020719584,0.00057974504,0.00004130648,0.001292315],"category_scores_gemma":[0.01604395,0.00008185102,0.0000438139,0.00024031085,0.00034937356,0.0001240588,0.00007915507,0.00014642972,0.00006073702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068982,0.000067673944,0.000015250815,0.0000037247514,0.00002080044,0.000002087957,0.00080414576,0.053480964,0.00019397205,0.8894948,0.0011388193,0.05408794],"study_design_scores_gemma":[0.00003283263,0.00032582486,0.000024902654,0.000008618651,0.0000025266252,2.7664248e-7,0.0013342474,0.5953615,0.004806139,0.39791626,0.00012959591,0.000057319958],"about_ca_topic_score_codex":0.000012769548,"about_ca_topic_score_gemma":0.0000119604265,"teacher_disagreement_score":0.9618742,"about_ca_system_score_codex":0.000026640206,"about_ca_system_score_gemma":0.00008281524,"threshold_uncertainty_score":0.9996206},"labels":[],"label_agreement":null},{"id":"W3158452757","doi":"","title":"Quantum Tensor Networks, Stochastic Processes, and Weighted Automata","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Quantum; Automaton; Tensor (intrinsic definition); Theoretical computer science; Mathematics; Physics; Quantum mechanics; Pure mathematics","score_opus":0.051067220768320785,"score_gpt":0.30450299784057544,"score_spread":0.2534357770722547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158452757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025593722,0.00012359637,0.99337703,0.0027382956,0.0006414247,0.00007673455,0.00007312464,0.00009150254,0.00031893427],"genre_scores_gemma":[0.9055713,0.0002220259,0.09344657,0.0004172981,0.00016283104,0.0000070790747,0.00004012436,0.000010693036,0.00012207105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985381,0.00006656429,0.0003266093,0.000503506,0.00032125748,0.00024398896],"domain_scores_gemma":[0.9985175,0.0004880034,0.00010494108,0.00022403963,0.0005382592,0.00012723776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017155269,0.00018484329,0.00017808258,0.00009216658,0.00018798377,0.000596464,0.0003943782,0.0000616633,0.000049458245],"category_scores_gemma":[0.00040713974,0.0001687225,0.000018304785,0.00022446326,0.00014208333,0.00013554678,0.00023169453,0.00022793596,0.000020512563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014899109,0.000063982676,0.000006859074,0.00001192454,0.000017842447,0.000069316804,0.00024956066,0.0016503441,0.00005914039,0.75676405,0.000095305535,0.24099675],"study_design_scores_gemma":[0.00003100885,0.00009090041,0.00009480108,0.00007131253,0.0000049195733,0.000080467544,0.00009500596,0.7678317,0.0001750332,0.23123439,0.00013007123,0.00016042496],"about_ca_topic_score_codex":0.000020089255,"about_ca_topic_score_gemma":0.000045124667,"teacher_disagreement_score":0.9030119,"about_ca_system_score_codex":0.000015913643,"about_ca_system_score_gemma":0.0001770424,"threshold_uncertainty_score":0.6880304},"labels":[],"label_agreement":null},{"id":"W3158469333","doi":"","title":"Implicit Regularization via Neural Feature Alignment","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Topology Optimization in Engineering","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal","funders":"","keywords":"Regularization (linguistics); Tangent; Heuristic; Computer science; Artificial intelligence; Algorithm; Feature selection; Kernel (algebra); Artificial neural network; Mathematics; Pattern recognition (psychology); Discrete mathematics; Geometry","score_opus":0.03631847140534972,"score_gpt":0.2869032862195527,"score_spread":0.25058481481420297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158469333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010091756,0.000044047934,0.99150276,0.0009643854,0.0011637477,0.000062248764,0.00012514216,0.00011008625,0.0050184107],"genre_scores_gemma":[0.9632009,0.0002636162,0.035424903,0.00017935097,0.00013671123,0.000013377321,0.0002133187,0.00002278464,0.00054498075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992123,0.000021753327,0.00023034627,0.00019487261,0.00018525284,0.00015546178],"domain_scores_gemma":[0.9994922,0.00008126372,0.00003052186,0.000123529,0.00020784818,0.000064588734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057544523,0.00013912296,0.000114089824,0.000077782664,0.00005846807,0.000110998015,0.000112817026,0.00008355394,0.00047531878],"category_scores_gemma":[0.00009300536,0.00015606648,0.00001881221,0.000100639,0.000060174076,0.00008857384,0.000029780571,0.00015622869,0.000037096885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011168708,0.00002208584,0.000032247834,0.000011003948,0.000037736852,0.00003189988,0.00017188046,0.21799779,0.0066558784,0.7133565,0.0005324823,0.061139323],"study_design_scores_gemma":[0.000023288265,0.000025470034,0.0001311832,0.000017314991,0.000008377754,0.00003412127,0.00017537014,0.9285051,0.013591521,0.056828354,0.00050044473,0.00015941897],"about_ca_topic_score_codex":0.0000029169905,"about_ca_topic_score_gemma":0.000019125935,"teacher_disagreement_score":0.96219176,"about_ca_system_score_codex":0.000048370875,"about_ca_system_score_gemma":0.0000187997,"threshold_uncertainty_score":0.6364206},"labels":[],"label_agreement":null},{"id":"W3158621754","doi":"","title":"Sample efficient learning of image-based diagnostic classifiers via probabilistic labels","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Digital Imaging for Blood Diseases","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial intelligence; Computer science; Probabilistic logic; Pattern recognition (psychology); Sample (material); Contextual image classification; Computer vision; Machine learning; Image (mathematics)","score_opus":0.06632889934044713,"score_gpt":0.3197781341464683,"score_spread":0.25344923480602116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158621754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042692106,0.00002729352,0.9919649,0.00085756317,0.00038131134,0.000104961764,0.00024869744,0.00005644214,0.0020896674],"genre_scores_gemma":[0.912813,0.000020031144,0.08682873,0.00015951744,0.000025007663,0.000013031503,0.0000751382,0.000008931787,0.000056590252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837255,0.00009284576,0.0004240327,0.00041359258,0.00047739976,0.00021956439],"domain_scores_gemma":[0.99637675,0.0022150557,0.0001622991,0.00024334111,0.00087485876,0.00012769527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017617077,0.00016216112,0.00018308328,0.00012205625,0.00008984767,0.00042174986,0.0004360313,0.00003609431,0.00014568723],"category_scores_gemma":[0.006003373,0.0001667954,0.000046840385,0.00022223359,0.00029449706,0.00016578755,0.00014094755,0.00014891097,0.00005039257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002077899,0.00031962045,0.00019359346,0.000026406715,0.000019218925,0.000055745142,0.00013382923,0.0071017835,0.0011513242,0.88383013,0.00004267738,0.107104905],"study_design_scores_gemma":[0.000044303946,0.00012780291,0.0002750299,0.000085520514,0.000012497318,0.0000062600866,0.00013271216,0.7861948,0.012899726,0.19998072,0.000081764156,0.00015886976],"about_ca_topic_score_codex":0.000044000375,"about_ca_topic_score_gemma":0.000011409223,"teacher_disagreement_score":0.9085438,"about_ca_system_score_codex":0.00004100385,"about_ca_system_score_gemma":0.00028373318,"threshold_uncertainty_score":0.71870315},"labels":[],"label_agreement":null},{"id":"W3158744994","doi":"","title":"Adaptive Approximate Policy Iteration","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Reinforcement learning; Markov decision process; Computer science; Ergodic theory; Tilde; Q-learning; Bellman equation; Mathematical optimization; Novelty; Function (biology); Upper and lower bounds; Function approximation; Scheme (mathematics); Adaptive learning; Online learning; Markov process; Artificial intelligence; Mathematics; Machine learning; Discrete mathematics; Statistics","score_opus":0.12021544814826839,"score_gpt":0.3511960815700123,"score_spread":0.2309806334217439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158744994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008508697,0.000008749351,0.98135227,0.0028589198,0.0004974633,0.00007111095,0.000035069395,0.00005395017,0.015037394],"genre_scores_gemma":[0.8424873,0.00015984153,0.15530764,0.0007249446,0.00015284416,0.000009368199,0.000053884483,0.000007843561,0.0010963891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864715,0.00007656644,0.00033511597,0.0003460521,0.00039953124,0.00019556332],"domain_scores_gemma":[0.9987803,0.00020632753,0.00011633941,0.00023399475,0.00057960424,0.0000834514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016539128,0.00013955445,0.000121223864,0.000141355,0.00012729106,0.00064157083,0.00038892587,0.000052413692,0.00016738952],"category_scores_gemma":[0.0005157425,0.00014307199,0.000024860585,0.00020452964,0.00008975077,0.00030151842,0.00016345923,0.00016744527,0.0001424571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014157055,0.000030506182,0.00001054938,0.0000031639377,0.000015975294,0.00003319847,0.000436227,0.014712465,0.0005218173,0.87718695,0.00007788377,0.1069571],"study_design_scores_gemma":[0.000019944508,0.000092125956,0.000049112732,0.000024681849,0.0000025320742,0.000016336066,0.00020883752,0.7741322,0.0041827084,0.22088665,0.00025998312,0.00012491088],"about_ca_topic_score_codex":0.000023050074,"about_ca_topic_score_gemma":0.00001693015,"teacher_disagreement_score":0.84240216,"about_ca_system_score_codex":0.000059839957,"about_ca_system_score_gemma":0.00022177721,"threshold_uncertainty_score":0.6186682},"labels":[],"label_agreement":null},{"id":"W3158885076","doi":"","title":"A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I Learned to Stop Worrying about Mixed-Nash and Love Neural Nets.","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Nash equilibrium; Minimax; Artificial neural network; Minimax theorem; Stochastic game; Computer science; Mathematical economics; Reinforcement learning; Game theory; Regular polygon; Mathematical optimization; Class (philosophy); Artificial intelligence; Mathematics","score_opus":0.13272251734304122,"score_gpt":0.3522322219739912,"score_spread":0.21950970463094996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158885076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017972028,0.000019596117,0.9708611,0.00882578,0.0010625743,0.00024902314,0.00011697039,0.000044198503,0.0008487703],"genre_scores_gemma":[0.8283788,0.00007325955,0.1697009,0.000934434,0.00015209448,0.000017847253,0.000024543291,0.000016325348,0.0007018228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998017,0.00013396644,0.00038171047,0.00070619147,0.00040551374,0.0003556295],"domain_scores_gemma":[0.99739736,0.001347949,0.00017835485,0.000287455,0.0006012403,0.00018761095],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003939552,0.00026365713,0.00029978578,0.00015912642,0.00018879885,0.0010381062,0.00057714107,0.000098342054,0.00011320591],"category_scores_gemma":[0.0026093877,0.00024626407,0.00004791854,0.00022304777,0.00019908971,0.00035611054,0.00034191264,0.00032820064,0.000032165386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020979704,0.00004861552,0.00011499637,0.000017802739,0.00003177011,0.000046693876,0.0022646533,0.0014329299,0.0007913921,0.64575535,0.00024832503,0.34903768],"study_design_scores_gemma":[0.000111909634,0.00029181107,0.00055790617,0.000102536535,0.000014031726,0.00003542638,0.0017721993,0.88233256,0.003308175,0.11003323,0.0011071401,0.00033304887],"about_ca_topic_score_codex":0.000024733628,"about_ca_topic_score_gemma":0.0001625418,"teacher_disagreement_score":0.88089967,"about_ca_system_score_codex":0.000050608367,"about_ca_system_score_gemma":0.00014931399,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W3159062657","doi":"","title":"Beyond Marginal Uncertainty: How Accurately can Bayesian Regression Models Estimate Posterior Predictive Correlations?","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Machine learning; Bayesian probability; Benchmark (surveying); Artificial intelligence; Gaussian process; Regression; Consistency (knowledge bases); Benchmarking; Marginal likelihood; Statistics; Mathematics; Gaussian","score_opus":0.08572084720730128,"score_gpt":0.3550802520154215,"score_spread":0.2693594048081202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159062657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012790125,0.000033436376,0.98175716,0.011080693,0.001001138,0.000103825805,0.00035085512,0.00007901502,0.0043148454],"genre_scores_gemma":[0.90659314,0.00010163476,0.091633536,0.00037001463,0.00012814051,0.000015012277,0.0001814853,0.000011763808,0.0009652841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981817,0.00015339389,0.00032998557,0.0005527885,0.00051584764,0.0002662938],"domain_scores_gemma":[0.9983075,0.00034007215,0.00018403376,0.0002759027,0.00073247624,0.0001599785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021815165,0.00022965776,0.00020653516,0.00013907396,0.00026770792,0.0008802247,0.00047576125,0.00008471689,0.00016084842],"category_scores_gemma":[0.00040075896,0.00020928589,0.0000399389,0.00019840419,0.00013454283,0.00039036208,0.00019748049,0.00033489242,0.000025956371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048917427,0.000056572997,0.000046360637,0.000005994243,0.000023021074,0.00011294997,0.0006875971,0.009800689,0.00026192446,0.72891784,0.00022991357,0.2598082],"study_design_scores_gemma":[0.000038477,0.00012707783,0.00012756963,0.00007658726,0.0000071136474,0.000057372556,0.00028078153,0.6956477,0.0006063792,0.30276766,0.00010068966,0.00016258564],"about_ca_topic_score_codex":0.00007061971,"about_ca_topic_score_gemma":0.00019111551,"teacher_disagreement_score":0.90531415,"about_ca_system_score_codex":0.000062272935,"about_ca_system_score_gemma":0.0002668548,"threshold_uncertainty_score":0.8534431},"labels":[],"label_agreement":null},{"id":"W3159134962","doi":"","title":"Does Invariant Risk Minimization Capture Invariance","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Invariant (physics); Minification; Generalization; Computer science; Population; Applied mathematics; Mathematical optimization; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.0740804629402809,"score_gpt":0.3117591392564938,"score_spread":0.2376786763162129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159134962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006674938,0.00002709307,0.98962,0.0038942017,0.0011697094,0.000071518705,0.0002029613,0.000068892594,0.004278146],"genre_scores_gemma":[0.83077127,0.00072854426,0.1669772,0.00075546914,0.00011598122,0.000011582813,0.000056149147,0.000009005121,0.0005747975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982072,0.00016311657,0.00042786205,0.00056931033,0.00040183507,0.0002306726],"domain_scores_gemma":[0.99829906,0.00031915127,0.00017517833,0.0003380255,0.00073745014,0.0001311458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026952385,0.00019309827,0.00017692172,0.000092061295,0.00018676372,0.00069923885,0.00055812683,0.00010387524,0.00030970603],"category_scores_gemma":[0.00078609417,0.00014722742,0.000032689073,0.00020884754,0.00011417327,0.0003162513,0.0001662592,0.00029189725,0.00011242191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018322318,0.00007094749,0.00009449782,0.0000050585722,0.000020289654,0.00007246886,0.0004893827,0.00052322,0.00047965642,0.888025,0.00018398462,0.11001716],"study_design_scores_gemma":[0.00002595256,0.000041500363,0.00016958221,0.000042962765,0.0000064389587,0.000014902317,0.00027424473,0.5054625,0.003777462,0.4897236,0.00027757284,0.0001832496],"about_ca_topic_score_codex":0.00009951791,"about_ca_topic_score_gemma":0.00027023608,"teacher_disagreement_score":0.83010375,"about_ca_system_score_codex":0.000034780995,"about_ca_system_score_gemma":0.0002387725,"threshold_uncertainty_score":0.67427766},"labels":[],"label_agreement":null},{"id":"W3159394092","doi":"","title":"CLAR: Contrastive Learning of Auditory Representations","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Music and Audio Processing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Supervised learning; Representation (politics); Machine learning; Speech recognition; Quality (philosophy); Raw data; Labeled data; Training set; Natural language processing; Artificial neural network","score_opus":0.10281748735148484,"score_gpt":0.3563111225016691,"score_spread":0.25349363515018425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159394092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001478564,0.000027482029,0.9833483,0.0016306073,0.00059422635,0.00003667431,0.00003531698,0.000024553143,0.012824285],"genre_scores_gemma":[0.9493397,0.00013585383,0.049623292,0.00025557438,0.00009983134,0.0000044345097,0.000020674834,0.0000040207497,0.000516627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893165,0.00007543496,0.00031047163,0.00027382252,0.00028891087,0.00011968958],"domain_scores_gemma":[0.99858505,0.0003876911,0.0001521231,0.00012504669,0.0006950709,0.00005501002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015784863,0.00008911954,0.00012668053,0.00007122126,0.0001121495,0.00018273457,0.0002489491,0.000039181137,0.00025068654],"category_scores_gemma":[0.000676765,0.0000912804,0.000024098763,0.00012943792,0.00013843316,0.000187334,0.00009677031,0.0001660012,0.00002818344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010687793,0.000046200403,0.00007777783,0.000005962039,0.000016820384,0.000024667022,0.000613279,0.00037322292,0.0033300815,0.8199154,0.00023764565,0.17534822],"study_design_scores_gemma":[0.000053582906,0.0001222475,0.00093756977,0.000114940056,0.00001066111,0.000022803972,0.0017747183,0.41068086,0.04131344,0.5435926,0.0011658053,0.00021079538],"about_ca_topic_score_codex":0.000016662856,"about_ca_topic_score_gemma":0.000019519284,"teacher_disagreement_score":0.94786114,"about_ca_system_score_codex":0.000016786315,"about_ca_system_score_gemma":0.00017595806,"threshold_uncertainty_score":0.37223068},"labels":[],"label_agreement":null},{"id":"W3159706683","doi":"","title":"Fundamental Limits of Ridge-Regularized Empirical Risk Minimization in High Dimensions","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Empirical risk minimization; Regularization (linguistics); Mathematics; Mathematical optimization; Minification; Inference; Computer science; Applied mathematics; Algorithm; Artificial intelligence","score_opus":0.10870192798397085,"score_gpt":0.3430290848900288,"score_spread":0.23432715690605796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159706683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49209455,0.00004632909,0.5048064,0.00026270287,0.0005549456,0.000099488745,0.0004573304,0.00007466136,0.0016036183],"genre_scores_gemma":[0.97586495,0.00058727915,0.023328563,0.000047309455,0.000031311014,0.0000043449595,0.00010078316,0.000009429158,0.000026062065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.000053472606,0.00032841676,0.00016145824,0.00018100209,0.00010758744],"domain_scores_gemma":[0.9993855,0.00020118774,0.00005667816,0.00010467031,0.00021309695,0.00003889005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006976262,0.00010452828,0.00015188208,0.00010683933,0.000030820276,0.00004687879,0.00008353762,0.00006006798,0.0001586265],"category_scores_gemma":[0.00020611376,0.00011059651,0.000020591551,0.00010909548,0.00008035666,0.000051101142,0.000027552991,0.00013867942,0.000010339375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018869032,0.00035377985,0.003910294,0.000018644021,0.00010559723,0.00012508777,0.00095203205,0.022398999,0.052134216,0.7861358,0.0010915712,0.13258527],"study_design_scores_gemma":[0.00007088953,0.00008355913,0.0035859162,0.000121624464,0.000016197935,0.000008464931,0.00043209048,0.6903389,0.15143423,0.15360035,0.00012772321,0.00018006975],"about_ca_topic_score_codex":0.00005044217,"about_ca_topic_score_gemma":0.00019151538,"teacher_disagreement_score":0.6679399,"about_ca_system_score_codex":0.000030287252,"about_ca_system_score_gemma":0.00003447343,"threshold_uncertainty_score":0.4509995},"labels":[],"label_agreement":null},{"id":"W36903255","doi":"10.3390/molecules28052010","title":"Hierarchical Probabilistic Neural Network Language Model.","year":2005,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":840,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Center for Advancing Translational Sciences","keywords":"Computer science; Language model; Artificial intelligence; Cluster analysis; Hierarchy; Probabilistic logic; Embedding; Generalization; Artificial neural network; Hierarchical clustering; Hierarchical database model; Natural language processing; Machine learning; Data mining; Mathematics","score_opus":0.07106443107823439,"score_gpt":0.3506428053863268,"score_spread":0.2795783743080924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36903255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009547558,0.00010587987,0.99218833,0.004080359,0.00022975124,0.00012257935,0.000045329267,0.00019838937,0.002074638],"genre_scores_gemma":[0.5620671,0.000025366464,0.43695414,0.000606036,0.0001609528,0.000010469883,0.000012936825,0.000005913506,0.00015707323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985691,0.00005645359,0.000338266,0.00039121255,0.00037441764,0.0002706054],"domain_scores_gemma":[0.99911296,0.00022327148,0.000095300864,0.00024091073,0.00022162862,0.00010593811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025617343,0.00017024366,0.00014379364,0.00009275549,0.000122018624,0.00041336694,0.00077629066,0.000070630595,0.00008577844],"category_scores_gemma":[0.00032767758,0.00015158675,0.000027273432,0.00012944208,0.0001494441,0.0003038131,0.00019355571,0.00030540323,0.000050138613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019522604,0.000033252803,0.0000032438495,0.0000032424045,0.000004545173,0.000013006918,0.00035509095,0.0044842907,0.00022161976,0.67199963,0.0002502573,0.3226123],"study_design_scores_gemma":[0.000010093143,0.000046835867,0.0000039267948,0.000017924407,0.00000206748,0.000010241036,0.000021912136,0.5661093,0.0006826984,0.4329358,0.000054302633,0.00010489306],"about_ca_topic_score_codex":0.000015461474,"about_ca_topic_score_gemma":0.00007974545,"teacher_disagreement_score":0.561625,"about_ca_system_score_codex":0.00004906621,"about_ca_system_score_gemma":0.00007451949,"threshold_uncertainty_score":0.6181528},"labels":[],"label_agreement":null},{"id":"W39904068","doi":"","title":"A simple sketching algorithm for entropy estimation over streaming data.","year":2013,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Rényi entropy; Estimator; Mathematics; Entropy (arrow of time); Maximum entropy probability distribution; Min entropy; Joint entropy; Entropy estimation; Shannon's source coding theorem; Streaming algorithm; Computation; Upper and lower bounds; Entropy rate; Applied mathematics; Algorithm; Principle of maximum entropy; Statistics; Joint quantum entropy; Maximum entropy thermodynamics; Mathematical analysis","score_opus":0.11883870147564245,"score_gpt":0.3807147191308058,"score_spread":0.26187601765516333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39904068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007041552,0.0000041144785,0.9964786,0.0006440799,0.0002951734,0.00029459983,0.0010965432,0.000117544834,0.0003651971],"genre_scores_gemma":[0.27279705,0.000031225754,0.7262564,0.00015333151,0.000072402516,0.000047918213,0.0005889151,0.000008444783,0.000044337976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860466,0.000036991503,0.0003354569,0.0004909613,0.0003114235,0.00022052262],"domain_scores_gemma":[0.9984549,0.0005224516,0.00015372549,0.00048923393,0.00029820658,0.0000814324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025783764,0.00016126533,0.00013972024,0.00013119493,0.00013307517,0.0008885598,0.0011636949,0.000051936862,0.00015561882],"category_scores_gemma":[0.00050122436,0.00015741681,0.000017965407,0.00008338628,0.00007857991,0.00097555766,0.00036760437,0.00011634583,0.000061684776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002874065,0.000033450317,0.000008795458,0.000002495448,0.000008815592,0.0000017238617,0.00008325766,0.000017251574,0.0001342856,0.4560744,0.0011290738,0.5425036],"study_design_scores_gemma":[0.00001921262,0.00008036389,0.000102677885,0.000022646489,0.000003808596,0.0000030318795,0.00007954017,0.6555883,0.0009859368,0.3426429,0.00035713185,0.00011444464],"about_ca_topic_score_codex":0.00028425545,"about_ca_topic_score_gemma":0.000035478024,"teacher_disagreement_score":0.65557104,"about_ca_system_score_codex":0.000039533996,"about_ca_system_score_gemma":0.00006538631,"threshold_uncertainty_score":0.85684025},"labels":[],"label_agreement":null}]}