{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053639216,0.0002552696,0.99314225,0.00010118437,0.00003440846,0.000035358185,0.000036670466,0.0005054148,0.0005255668],"genre_scores_gemma":[0.45609963,0.00045415573,0.5371703,0.0002948514,0.00013649082,0.0007423394,0.0006205658,0.00066072936,0.0038209734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984836,0.0009024758,0.00008126675,0.00019964384,0.00020779265,0.00012518401],"domain_scores_gemma":[0.99021393,0.008127678,0.00027346518,0.00057004066,0.0005910483,0.00022378276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034068744,0.0009277733,0.0021016232,0.00087192253,0.0007096873,0.0012189286,0.0029351222,0.0024307636,0.0056547313],"category_scores_gemma":[0.018084079,0.001580331,0.0010691055,0.0010971,0.0017782156,0.0020025317,0.0026278256,0.004225873,0.0015335169],"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.000073668285,0.000020317038,0.00021533351,0.00003957812,0.00003084588,0.000015028422,0.000029527897,0.97032344,0.0003833233,0.012056583,0.00040284864,0.016409459],"study_design_scores_gemma":[0.0000049041864,0.0000039201846,0.000011847816,0.0000033912042,0.0000017636879,0.0000019747622,9.880578e-7,0.9958379,0.00009200556,0.003958816,0.00008047622,0.0000020576738],"about_ca_topic_score_codex":0.0072348695,"about_ca_topic_score_gemma":0.0076550436,"teacher_disagreement_score":0.0072348695,"about_ca_system_score_codex":0.0014769982,"about_ca_system_score_gemma":0.0016679801,"threshold_uncertainty_score":0.018916905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017145795,0.0009525932,0.98278606,0.00152486,0.00015610592,0.00004882368,0.00018493783,0.0001697114,0.012462167],"genre_scores_gemma":[0.42455068,0.006000541,0.5387126,0.005992797,0.0030588198,0.0012895064,0.0010958835,0.00072573737,0.018573277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99316686,0.0027831995,0.00023636088,0.0011200693,0.0022940594,0.00039959245],"domain_scores_gemma":[0.9873465,0.008183383,0.0007172873,0.0013943972,0.0019040938,0.00045443725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066085123,0.0023450693,0.0024585344,0.0033709435,0.0021004626,0.0060293316,0.004635679,0.003854212,0.009769985],"category_scores_gemma":[0.024845418,0.0013306963,0.0022226495,0.0034368886,0.006238237,0.0102866115,0.0048826085,0.009067939,0.0027146332],"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.000018588327,0.000023037383,0.00011286725,0.000104921295,0.00003462472,0.000043858916,0.00007500711,0.012860168,0.00024136165,0.9690263,0.0033125447,0.014146725],"study_design_scores_gemma":[0.0000049753808,0.000015335676,0.00006205638,0.000033128443,0.00001054819,0.000039465904,0.000009100275,0.07877116,0.00022342525,0.91777456,0.0030417915,0.000014427654],"about_ca_topic_score_codex":0.0024303764,"about_ca_topic_score_gemma":0.0015796046,"teacher_disagreement_score":0.009769985,"about_ca_system_score_codex":0.0033573282,"about_ca_system_score_gemma":0.0018529139,"threshold_uncertainty_score":0.0349496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2548288,0.0026337106,0.7292233,0.003176136,0.00019014499,0.00028055187,0.00036545895,0.0011976882,0.00810423],"genre_scores_gemma":[0.8360043,0.0013346797,0.15742528,0.00077787426,0.00014507657,0.00032232847,0.00038954793,0.0003643034,0.00323657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980217,0.0010852397,0.000112361566,0.00031183253,0.00029471834,0.00017426949],"domain_scores_gemma":[0.974034,0.020312976,0.001376273,0.0032897338,0.00066035497,0.000326675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045706155,0.0016916477,0.0010564518,0.00033097304,0.0007126205,0.0009829716,0.0015451491,0.0022131316,0.0024515442],"category_scores_gemma":[0.041405767,0.001007346,0.00060967146,0.0005230665,0.0022897,0.003816698,0.0020020609,0.004173051,0.0004233043],"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.0007030441,0.00028754203,0.0054549216,0.0005775477,0.0001673369,0.00023379788,0.00021866157,0.85982966,0.016327742,0.014649527,0.0025942859,0.09895599],"study_design_scores_gemma":[0.00012841875,0.00053834374,0.004377194,0.00012591654,0.00007464471,0.0002957596,0.00010714727,0.9396941,0.020309636,0.03210635,0.002186078,0.000056292956],"about_ca_topic_score_codex":0.0024827938,"about_ca_topic_score_gemma":0.005429824,"teacher_disagreement_score":0.0045706155,"about_ca_system_score_codex":0.0007688448,"about_ca_system_score_gemma":0.0008239233,"threshold_uncertainty_score":0.024172008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005858368,0.00031082,0.99281645,0.000119656725,0.000017366925,0.000015954183,0.000049386654,0.00015651682,0.0006555347],"genre_scores_gemma":[0.5440267,0.0014344425,0.4478938,0.00047640782,0.00028773127,0.00019185453,0.0006109679,0.00032540952,0.0047526974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997663,0.0011548654,0.00010734558,0.0004890912,0.0004563332,0.00012927917],"domain_scores_gemma":[0.99476177,0.0035632818,0.0005347946,0.0005313499,0.00047975546,0.00012903137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038831832,0.0013916383,0.0014532108,0.00075595005,0.00039088863,0.0015520754,0.0012309491,0.0012778686,0.002169376],"category_scores_gemma":[0.017219892,0.0007220505,0.0007782428,0.0009202847,0.0018735281,0.00293407,0.0018690715,0.0019505435,0.0010325551],"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.00042478097,0.00012649626,0.0018789105,0.0004221121,0.00016535728,0.00013299141,0.00013177701,0.6000233,0.013039442,0.21146195,0.0030875094,0.16910535],"study_design_scores_gemma":[0.000011867124,0.0000643029,0.00028601324,0.000021599617,0.000011724797,0.000054279684,0.000010860846,0.9616091,0.003892424,0.03302921,0.0009922255,0.000016398028],"about_ca_topic_score_codex":0.0009235783,"about_ca_topic_score_gemma":0.000696148,"teacher_disagreement_score":0.0038831832,"about_ca_system_score_codex":0.0008744777,"about_ca_system_score_gemma":0.00077424693,"threshold_uncertainty_score":0.020536482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00471531,0.00016500252,0.99204504,0.0002166602,0.000042673335,0.000040315397,0.00007956547,0.0009596476,0.0017357719],"genre_scores_gemma":[0.45026067,0.00065105926,0.5374981,0.0003840909,0.00021472451,0.00042069235,0.0005382459,0.00061268784,0.009419716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980715,0.00089348655,0.00008895453,0.00023126781,0.00053527986,0.00017951206],"domain_scores_gemma":[0.9951142,0.0035237537,0.00022134362,0.0006598541,0.00030309276,0.00017773897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002633686,0.0009183143,0.0013232764,0.0012218131,0.0010701596,0.0025312726,0.0032568488,0.0020702188,0.006809212],"category_scores_gemma":[0.01282268,0.0007631021,0.0011809511,0.0013216233,0.0016937121,0.0049920706,0.0042069573,0.0028439087,0.001455352],"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.0002944027,0.00008447474,0.00055480254,0.0001732344,0.00010028104,0.00020744697,0.00026235162,0.46474567,0.0019276538,0.43764424,0.006090412,0.08791509],"study_design_scores_gemma":[0.000023392024,0.00001651071,0.00002110566,0.000007253217,0.000008966809,0.00001989996,0.000010703594,0.85446,0.0008368119,0.14302348,0.0015616232,0.0000102394315],"about_ca_topic_score_codex":0.0029569834,"about_ca_topic_score_gemma":0.0025665164,"teacher_disagreement_score":0.006809212,"about_ca_system_score_codex":0.0012201733,"about_ca_system_score_gemma":0.001652697,"threshold_uncertainty_score":0.022779047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07460673,0.0008307214,0.9165198,0.0031508699,0.000116104486,0.00015759595,0.00044583098,0.00033622424,0.0038360371],"genre_scores_gemma":[0.8376469,0.000548395,0.15451033,0.0009221679,0.00048260184,0.0005160993,0.00097307493,0.0002558932,0.004144591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97597617,0.012045542,0.0010126892,0.0073770294,0.0026532032,0.0009353411],"domain_scores_gemma":[0.8608054,0.10935316,0.010838792,0.010571277,0.006495407,0.0019359402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031102175,0.0015635407,0.0027455296,0.0028580325,0.0025139542,0.0038218996,0.0042868885,0.00508608,0.002260016],"category_scores_gemma":[0.12105707,0.0016358692,0.0013888301,0.0031079813,0.004258732,0.011288164,0.0065704626,0.0043849526,0.00090739015],"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.0030680182,0.0006519858,0.13486396,0.0016002327,0.0014608805,0.0028296676,0.017019514,0.3396285,0.0113492785,0.15850785,0.019037327,0.30998284],"study_design_scores_gemma":[0.00010014191,0.00014803825,0.01061812,0.00020216028,0.00020017962,0.00076952594,0.0009835392,0.7049601,0.0034646422,0.27144212,0.0069660344,0.00014542241],"about_ca_topic_score_codex":0.0056404746,"about_ca_topic_score_gemma":0.0064825267,"teacher_disagreement_score":0.031102175,"about_ca_system_score_codex":0.0024136386,"about_ca_system_score_gemma":0.0017430957,"threshold_uncertainty_score":0.16448599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073376847,0.00064919685,0.9889731,0.00057433307,0.000031212232,0.000037845835,0.000043691554,0.0001244671,0.0022283928],"genre_scores_gemma":[0.6324829,0.0024756468,0.35676435,0.00077670795,0.00033389803,0.0008702309,0.00029056633,0.0003961169,0.005609708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943281,0.0041272053,0.00017958341,0.00036129146,0.0006885232,0.0003152719],"domain_scores_gemma":[0.96774924,0.02836379,0.0017696576,0.00092250796,0.0008928834,0.00030190533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012589779,0.0018710366,0.0032834138,0.0012456154,0.0010630863,0.002910195,0.001951497,0.0026837857,0.0031895996],"category_scores_gemma":[0.047816798,0.0016584774,0.0011545361,0.0024682472,0.0028252834,0.004776639,0.0029523997,0.0032648458,0.00051862915],"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.0000637394,0.000035022364,0.0002828123,0.0000772104,0.00003900244,0.000046358527,0.00006248183,0.9014193,0.0002117823,0.08611374,0.00075181364,0.010896625],"study_design_scores_gemma":[0.000009216778,0.000014042305,0.00005504857,0.000021894011,0.0000060864713,0.000009310244,0.0000068182017,0.96845925,0.00009840572,0.031032866,0.00027790022,0.000009125981],"about_ca_topic_score_codex":0.0076996097,"about_ca_topic_score_gemma":0.005589286,"teacher_disagreement_score":0.012589779,"about_ca_system_score_codex":0.002441917,"about_ca_system_score_gemma":0.0034592755,"threshold_uncertainty_score":0.066581905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01043186,0.0009439281,0.9831335,0.00089509715,0.0000705591,0.000037373586,0.00015553937,0.0003302017,0.0040020016],"genre_scores_gemma":[0.70838696,0.004824789,0.2625533,0.0017818381,0.001354069,0.0010583553,0.0019050706,0.00080562814,0.017329928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955903,0.002081749,0.00019737384,0.000673836,0.001057172,0.00039956256],"domain_scores_gemma":[0.9264682,0.061816514,0.003483666,0.0028543228,0.004556951,0.0008204898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014480643,0.0011918515,0.0017392144,0.0031935377,0.001122702,0.0023443107,0.0029342277,0.0023641123,0.006339276],"category_scores_gemma":[0.08057269,0.0011519311,0.0017138525,0.0017378086,0.0050933943,0.006695556,0.0027548715,0.0047216327,0.0010159865],"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.00003293573,0.00003091893,0.0016303958,0.00017180845,0.000068032256,0.00014812777,0.00019999073,0.103266895,0.0006147167,0.8824044,0.0017644399,0.009667389],"study_design_scores_gemma":[0.00001215847,0.000025016463,0.0005170473,0.000062290645,0.000013676473,0.000086855594,0.000042573796,0.48242486,0.00027927783,0.5151711,0.0013306908,0.00003457316],"about_ca_topic_score_codex":0.005437372,"about_ca_topic_score_gemma":0.0035332476,"teacher_disagreement_score":0.014480643,"about_ca_system_score_codex":0.0036123542,"about_ca_system_score_gemma":0.0019037131,"threshold_uncertainty_score":0.076581836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063417345,0.0003717299,0.9307538,0.002083668,0.000045959696,0.000095352574,0.0002278198,0.00045410197,0.0025502138],"genre_scores_gemma":[0.7586411,0.00048064807,0.23002702,0.001160611,0.0002628742,0.00048800054,0.0011323997,0.00020799405,0.007599379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928437,0.0033930806,0.00029640348,0.0018842359,0.0011894482,0.000393131],"domain_scores_gemma":[0.9503491,0.036601078,0.002803766,0.005969176,0.0029841182,0.0012929066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010516962,0.0013382719,0.0026185438,0.001608778,0.0013896339,0.0033240214,0.0038038,0.0034485434,0.003759255],"category_scores_gemma":[0.081139475,0.0012047677,0.0012879162,0.0013997622,0.004165202,0.009719865,0.0074942377,0.0049407813,0.0016065615],"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.0015485566,0.0005113286,0.029041542,0.0008647543,0.00037551144,0.00062620343,0.0027245525,0.33069918,0.0059735063,0.36337557,0.014766487,0.24949293],"study_design_scores_gemma":[0.000107328844,0.00018449836,0.0010028252,0.00006208992,0.000041223724,0.00017433439,0.0002513359,0.71112704,0.0028731618,0.28107625,0.003067045,0.00003288429],"about_ca_topic_score_codex":0.0010900379,"about_ca_topic_score_gemma":0.001317203,"teacher_disagreement_score":0.010516962,"about_ca_system_score_codex":0.0017207782,"about_ca_system_score_gemma":0.0015757199,"threshold_uncertainty_score":0.055619657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010068007,0.0001536711,0.9887561,0.00018497372,0.000026277043,0.0000697471,0.000023635777,0.00025152107,0.0004659808],"genre_scores_gemma":[0.5806179,0.0004619085,0.41371793,0.0006924925,0.00033161213,0.0006002956,0.0003643127,0.0002896459,0.0029240227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967919,0.0017611979,0.00010491334,0.0006794674,0.00055473647,0.00010779553],"domain_scores_gemma":[0.97308064,0.021866497,0.0009959079,0.0025275496,0.0011467757,0.00038271706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009643534,0.00092479965,0.001554279,0.0013247246,0.00064282486,0.0011500267,0.0027544193,0.0017022168,0.0015445078],"category_scores_gemma":[0.03794868,0.0006769871,0.0013309182,0.001126773,0.0022856863,0.002259946,0.002125565,0.0028724393,0.0004321486],"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.0004480079,0.0004903407,0.009410111,0.00028955235,0.0005538034,0.0006345622,0.00040299166,0.6777333,0.008890086,0.062114142,0.0038333433,0.23519969],"study_design_scores_gemma":[0.000017087114,0.000085020394,0.00059744157,0.000008401076,0.000022013057,0.000093325536,0.000026241763,0.97947156,0.0012536062,0.017815,0.0005959691,0.000014228239],"about_ca_topic_score_codex":0.0017935777,"about_ca_topic_score_gemma":0.0012553888,"teacher_disagreement_score":0.009643534,"about_ca_system_score_codex":0.00086275616,"about_ca_system_score_gemma":0.0008934759,"threshold_uncertainty_score":0.051000535},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011784445,0.033750545,0.8918221,0.025690855,0.0062043695,0.000071570095,0.0005184056,0.00032111973,0.040442586],"genre_scores_gemma":[0.13563897,0.08366352,0.6343604,0.044273596,0.03893005,0.0011700424,0.0012077756,0.001230796,0.05952483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697065,0.0016382334,0.00020107653,0.00047990066,0.00060350035,0.000106571075],"domain_scores_gemma":[0.9971942,0.002037453,0.00017907652,0.00025162078,0.00027826393,0.000059376867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067409244,0.001436127,0.0010050845,0.0013746658,0.0009102139,0.0029073264,0.0030993845,0.004383639,0.007246747],"category_scores_gemma":[0.011469797,0.000756969,0.0013554636,0.002295758,0.003963094,0.0050196443,0.0022413947,0.0070814155,0.004226798],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010067824,0.000012693699,0.00017459922,0.00013712647,0.000024711888,0.00006026218,0.000049831247,0.0040888283,0.00022324192,0.9552134,0.014666528,0.025338715],"study_design_scores_gemma":[0.000009964078,0.000039295133,0.00023734546,0.00022538724,0.00002111851,0.0002849204,0.00002141976,0.032811537,0.0006512805,0.74758905,0.21806973,0.000038937535],"about_ca_topic_score_codex":0.0019916773,"about_ca_topic_score_gemma":0.0012511517,"teacher_disagreement_score":0.007246747,"about_ca_system_score_codex":0.001449506,"about_ca_system_score_gemma":0.0010795842,"threshold_uncertainty_score":0.035649836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009905297,0.00040791003,0.9826781,0.0007100162,0.00015843405,0.000032505315,0.00022670638,0.00078003085,0.005101047],"genre_scores_gemma":[0.5234786,0.0009874165,0.44929478,0.0009583488,0.00026349892,0.00024472328,0.00082390115,0.00036700757,0.023581687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994697,0.00016713288,0.000021070942,0.000100626574,0.00015827248,0.00008320005],"domain_scores_gemma":[0.9994204,0.00024391254,0.00003465911,0.00010823316,0.00012152827,0.00007123949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950015,0.0005369482,0.00095556484,0.00032018925,0.00035857575,0.001043069,0.0021120603,0.0015811311,0.005318876],"category_scores_gemma":[0.0028122305,0.0003737094,0.00075246673,0.0006202946,0.00104826,0.0018592611,0.0018030489,0.0021093334,0.0015478728],"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.00024576223,0.00007675912,0.0009250104,0.00013622777,0.000091779664,0.00017472151,0.00011715825,0.550682,0.009014343,0.31915274,0.010666746,0.108716756],"study_design_scores_gemma":[0.000012102618,0.000025641579,0.0000776973,0.000006814095,0.000006603628,0.00005416661,0.000007111316,0.9234629,0.000996371,0.07250821,0.0028305766,0.000011795053],"about_ca_topic_score_codex":0.0017544449,"about_ca_topic_score_gemma":0.002063407,"teacher_disagreement_score":0.005318876,"about_ca_system_score_codex":0.00062549807,"about_ca_system_score_gemma":0.0011101981,"threshold_uncertainty_score":0.017793417},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008155867,0.00038269823,0.98996514,0.00042618893,0.000074121475,0.000027031943,0.0001051766,0.00027911278,0.00058477354],"genre_scores_gemma":[0.51297843,0.0014184002,0.46990165,0.0007062839,0.0005971861,0.00040614925,0.0015890253,0.0005826218,0.01182016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797636,0.0007680492,0.00015300585,0.00050955475,0.00038150462,0.00021151832],"domain_scores_gemma":[0.9812236,0.015540845,0.00062826957,0.0010176973,0.001137396,0.0004521628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007861573,0.001546376,0.0033033972,0.0015996037,0.001139444,0.002069169,0.0035347051,0.002318736,0.006913843],"category_scores_gemma":[0.027951717,0.0026770653,0.0022084466,0.0016912105,0.0022516137,0.004472518,0.0032663718,0.0058452645,0.00090105046],"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.00041442542,0.00016222261,0.0018999527,0.00024772433,0.00031415542,0.00011586718,0.00017787774,0.6986884,0.0013138747,0.18676521,0.0044414187,0.10545886],"study_design_scores_gemma":[0.00002139096,0.000011024056,0.00010502143,0.00000900815,0.000014650929,0.000008374479,0.0000048184334,0.9247795,0.00018243628,0.0745348,0.0003209522,0.00000808848],"about_ca_topic_score_codex":0.024984581,"about_ca_topic_score_gemma":0.029830413,"teacher_disagreement_score":0.024984581,"about_ca_system_score_codex":0.0025910507,"about_ca_system_score_gemma":0.004842194,"threshold_uncertainty_score":0.049678266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022170164,0.00027396265,0.99417275,0.00033780804,0.0000719062,0.000029623343,0.00008860739,0.00048910064,0.0023191683],"genre_scores_gemma":[0.1949602,0.0006244809,0.78706807,0.0010359078,0.0005659943,0.00030761867,0.0011409546,0.00094038,0.013356416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784374,0.00070311024,0.00008791891,0.00035991258,0.0008000998,0.00020526384],"domain_scores_gemma":[0.9957967,0.0022954182,0.00020005331,0.0008335801,0.00070179696,0.00017247877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095859,0.0019885227,0.0019875085,0.0013762638,0.00084623345,0.0022866228,0.0031954148,0.0025689919,0.011442192],"category_scores_gemma":[0.009336486,0.0011054155,0.0012901366,0.0025175654,0.0011526764,0.003225975,0.0033365407,0.0040815403,0.0029206213],"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.0003267306,0.00032828588,0.0005043493,0.00024215473,0.00015411503,0.00014986697,0.00009652802,0.5726121,0.005083156,0.09917882,0.028572071,0.29275176],"study_design_scores_gemma":[0.000012407165,0.000024747533,0.00005629212,0.000010737302,0.000011340612,0.00003095035,0.0000056713798,0.9739942,0.0008770943,0.024063889,0.00090402795,0.000008688924],"about_ca_topic_score_codex":0.0029816662,"about_ca_topic_score_gemma":0.0042813052,"teacher_disagreement_score":0.011442192,"about_ca_system_score_codex":0.0009739437,"about_ca_system_score_gemma":0.0019257509,"threshold_uncertainty_score":0.038277924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050272294,0.0005057336,0.98614746,0.00079360045,0.00034080746,0.00008968164,0.0005028035,0.0038515907,0.0027410686],"genre_scores_gemma":[0.10133288,0.0005985901,0.8839797,0.00043861291,0.00046836754,0.00019028352,0.0021068123,0.0009841709,0.009900625],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996298,0.0009296437,0.00026223453,0.00062607875,0.0015680013,0.00031602668],"domain_scores_gemma":[0.99099344,0.0024185374,0.00037384234,0.003573787,0.0021948018,0.00044553104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027082711,0.0024851179,0.0020929617,0.0012265508,0.0012350596,0.0032270995,0.0032796334,0.0021769365,0.011850775],"category_scores_gemma":[0.018617898,0.0010902757,0.0012938943,0.0016559559,0.0019086655,0.0065661618,0.0050349594,0.0045297625,0.008419193],"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.00079050445,0.00034758437,0.0011982041,0.0005573572,0.00019908705,0.00025155323,0.00020842228,0.086754836,0.026821261,0.097785264,0.065377206,0.71970874],"study_design_scores_gemma":[0.00009012584,0.00010300098,0.00024123641,0.00003785178,0.000037054582,0.00015867103,0.000069131806,0.86268127,0.008512012,0.11777917,0.010246522,0.000043987544],"about_ca_topic_score_codex":0.005034133,"about_ca_topic_score_gemma":0.012737324,"teacher_disagreement_score":0.011850775,"about_ca_system_score_codex":0.0009312273,"about_ca_system_score_gemma":0.004289699,"threshold_uncertainty_score":0.039644778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02939042,0.0005372458,0.9665867,0.0005906295,0.00011261681,0.000056228317,0.00005242825,0.00050356257,0.0021701094],"genre_scores_gemma":[0.8324967,0.00035206764,0.1619821,0.00029099855,0.00017478381,0.00019762451,0.00022208462,0.00023282415,0.004050846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978504,0.0010462593,0.00014089965,0.00031533925,0.00044993815,0.00019728082],"domain_scores_gemma":[0.98898673,0.008926229,0.00046779745,0.0006689948,0.000558146,0.00039207778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080823,0.0010303883,0.0038222335,0.0014736882,0.00079538004,0.0023379582,0.0019732127,0.0030345588,0.0055741547],"category_scores_gemma":[0.015636316,0.0011432682,0.0012275225,0.0012916125,0.001807357,0.005065352,0.003497396,0.0029438722,0.00087213324],"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.0005648447,0.00042185117,0.00083038036,0.0001961127,0.00014050794,0.00012420138,0.00012388565,0.80884784,0.0012974663,0.08967202,0.0025905734,0.09519029],"study_design_scores_gemma":[0.000021642734,0.000036165762,0.0000315995,0.0000053013077,0.000006164762,0.000010088755,0.000005616395,0.98808795,0.00014274579,0.011533753,0.00011263984,0.000006376633],"about_ca_topic_score_codex":0.0024949992,"about_ca_topic_score_gemma":0.0018097794,"teacher_disagreement_score":0.0055741547,"about_ca_system_score_codex":0.0013165057,"about_ca_system_score_gemma":0.002179405,"threshold_uncertainty_score":0.02158171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006510377,0.0031464808,0.962955,0.0039921342,0.0004899127,0.00025888885,0.0017431672,0.0008993509,0.02000465],"genre_scores_gemma":[0.27806634,0.0046424526,0.6746991,0.0030347388,0.0013379715,0.0009990837,0.0074083065,0.0012321105,0.028579863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452895,0.003220089,0.00022357721,0.0006832011,0.0010083341,0.00033578713],"domain_scores_gemma":[0.9632564,0.02862293,0.0012042776,0.0031768577,0.0030463096,0.00069322047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259127,0.001258251,0.0016933816,0.0028958514,0.001737113,0.0029654824,0.0033662461,0.002179374,0.017933924],"category_scores_gemma":[0.049038734,0.001059151,0.0015910767,0.0054572583,0.0017531342,0.0077173137,0.003815652,0.004027693,0.0027927388],"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.00023782422,0.00017993298,0.0020946222,0.0009867882,0.00032979017,0.0001924027,0.00028127228,0.074087694,0.00057966425,0.56002164,0.103642486,0.25736597],"study_design_scores_gemma":[0.00005130061,0.00004239125,0.00039550257,0.00017458608,0.00007033769,0.000093613664,0.00010434618,0.31972075,0.00075844873,0.6441889,0.034375086,0.000024656189],"about_ca_topic_score_codex":0.00938533,"about_ca_topic_score_gemma":0.015438303,"teacher_disagreement_score":0.017933924,"about_ca_system_score_codex":0.0020410274,"about_ca_system_score_gemma":0.003003272,"threshold_uncertainty_score":0.059994996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004743313,0.00014654807,0.99422556,0.00017166784,0.000029202503,0.000028727725,0.000058384485,0.00017793608,0.0004186332],"genre_scores_gemma":[0.44962364,0.00080636074,0.53802603,0.00043266988,0.00039026205,0.0004694565,0.0010100439,0.00052196893,0.00871962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964456,0.001683521,0.00020185208,0.0008396487,0.00056056393,0.00026888738],"domain_scores_gemma":[0.9715982,0.022834135,0.0012566681,0.002294913,0.0012600282,0.00075598486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00898067,0.001895191,0.0041420483,0.0022075577,0.0014633558,0.0027600164,0.0063506817,0.0046184156,0.00716654],"category_scores_gemma":[0.04776167,0.0028218813,0.0020430856,0.0026973074,0.0035639363,0.008170526,0.006219055,0.005416604,0.0016026213],"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.00031603492,0.00017875926,0.00084834563,0.00016942562,0.00014659755,0.000102761056,0.00015220868,0.8042635,0.00095205026,0.11809049,0.0022039716,0.07257583],"study_design_scores_gemma":[0.000012459706,0.000012185815,0.00005711919,0.0000074042064,0.000009663503,0.000012914361,0.0000060644993,0.94540334,0.00017213337,0.05408339,0.0002118654,0.000011495255],"about_ca_topic_score_codex":0.0058441176,"about_ca_topic_score_gemma":0.0061491034,"teacher_disagreement_score":0.00898067,"about_ca_system_score_codex":0.0023159876,"about_ca_system_score_gemma":0.002979514,"threshold_uncertainty_score":0.047494948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048425198,0.00017994776,0.9942932,0.00017676168,0.000013643402,0.000014086723,0.000025442576,0.00010482495,0.00034951064],"genre_scores_gemma":[0.298718,0.0007254606,0.697022,0.0003147929,0.00018280277,0.00019221436,0.00038686913,0.000230659,0.0022271965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968581,0.001750075,0.00020271614,0.0004165962,0.00059906667,0.00017343415],"domain_scores_gemma":[0.9783079,0.018598352,0.00076205615,0.0010940208,0.00092523627,0.00031243154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067475904,0.0014269997,0.0025832276,0.0023369873,0.0009225053,0.0022474816,0.0027786,0.0023754407,0.0022314694],"category_scores_gemma":[0.037280805,0.0027858326,0.0023904478,0.0017559822,0.002436262,0.004702394,0.003943884,0.0041712625,0.00054430426],"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.00016191398,0.00015553249,0.0014166607,0.0001949492,0.00028721118,0.000066382614,0.00024185909,0.7127374,0.0013129595,0.15741085,0.00207352,0.12394084],"study_design_scores_gemma":[0.000010495687,0.000014971195,0.0000891351,0.000011193334,0.000015267495,0.0000071632685,0.000007673947,0.9250748,0.00019894545,0.07425996,0.00029996267,0.000010445959],"about_ca_topic_score_codex":0.0064603454,"about_ca_topic_score_gemma":0.008034138,"teacher_disagreement_score":0.0067475904,"about_ca_system_score_codex":0.0012766066,"about_ca_system_score_gemma":0.0024756347,"threshold_uncertainty_score":0.035685062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010743706,0.00041317978,0.9836135,0.00014540841,0.00018393059,0.000047419315,0.00021828574,0.00072909036,0.003905462],"genre_scores_gemma":[0.40643352,0.0012029628,0.55928546,0.00021791329,0.0002879016,0.00015408911,0.0020794058,0.0002767041,0.030062048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954456,0.00006492124,0.000024206742,0.00016814753,0.00015973313,0.000038420276],"domain_scores_gemma":[0.9994313,0.0001242719,0.000040314364,0.00020553515,0.00017316645,0.000025511159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055796065,0.00083269336,0.00080457376,0.0005899216,0.0003765201,0.00083555514,0.0005712144,0.0005450316,0.0036319846],"category_scores_gemma":[0.0012721386,0.00054941163,0.0005469413,0.00084537466,0.0005590434,0.0010965938,0.0009942818,0.0008078807,0.0015411839],"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.00038955882,0.00013559508,0.0017600545,0.00015056878,0.00011436843,0.00012701673,0.000094191906,0.084563956,0.07550633,0.016020717,0.010026324,0.8111114],"study_design_scores_gemma":[0.000016459326,0.000084592495,0.0034349242,0.000015753105,0.00003385289,0.0002549393,0.000026039617,0.93792313,0.03053954,0.010351361,0.017293476,0.000025911197],"about_ca_topic_score_codex":0.0028971266,"about_ca_topic_score_gemma":0.0061281105,"teacher_disagreement_score":0.0036319846,"about_ca_system_score_codex":0.00035953638,"about_ca_system_score_gemma":0.0011493958,"threshold_uncertainty_score":0.012150168},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010533436,0.00044810734,0.98411924,0.00027695193,0.00014519764,0.0002341181,0.00027158562,0.0011748034,0.0027965887],"genre_scores_gemma":[0.38318384,0.00043673202,0.6054027,0.00043007414,0.00026447437,0.0008090346,0.0012688972,0.00055248605,0.0076517435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952943,0.0026434725,0.0001706243,0.00083612103,0.0007286287,0.0003268913],"domain_scores_gemma":[0.97812325,0.016057655,0.0009509528,0.00322776,0.0009679088,0.0006723853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006842057,0.0012051293,0.0024537656,0.0019954275,0.0011899871,0.0017434118,0.0036425223,0.0025466052,0.010587558],"category_scores_gemma":[0.033024255,0.0016432162,0.0018371282,0.0028314863,0.001862165,0.004556014,0.0027291118,0.0024747541,0.0022120527],"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.0014277791,0.00048330083,0.003613725,0.0004579747,0.0004566892,0.0002800399,0.0002085238,0.6634895,0.0019116688,0.1739114,0.010259414,0.14349993],"study_design_scores_gemma":[0.00007580241,0.0000458356,0.00019950829,0.000016153492,0.000040583043,0.000054130574,0.00001426675,0.9025744,0.00069175847,0.094615996,0.001658826,0.0000127245685],"about_ca_topic_score_codex":0.007480386,"about_ca_topic_score_gemma":0.012888621,"teacher_disagreement_score":0.010587558,"about_ca_system_score_codex":0.0016581772,"about_ca_system_score_gemma":0.0029948514,"threshold_uncertainty_score":0.03618473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040143155,0.00029607172,0.9953452,0.0000691837,0.000014046208,0.000010377697,0.000010616424,0.00008596381,0.00015437331],"genre_scores_gemma":[0.5615265,0.0018075241,0.4335874,0.00018593115,0.00037579634,0.000243915,0.0003042942,0.00029645933,0.0016722078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924211,0.004255753,0.00033200515,0.0011782036,0.0015341649,0.00027885073],"domain_scores_gemma":[0.977091,0.017366776,0.00229216,0.0013074796,0.0017497888,0.0001928215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009460581,0.001461212,0.0023152914,0.0019658706,0.00053755863,0.001547715,0.0022631828,0.0022800039,0.0004926217],"category_scores_gemma":[0.04987258,0.0008563778,0.0014535582,0.0021863263,0.0026503217,0.0026114215,0.0022096762,0.0023168381,0.00026606634],"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.00013269375,0.000054215718,0.002338567,0.00034575196,0.00021957344,0.00019273492,0.00014822368,0.84502536,0.004319576,0.061948843,0.0007560691,0.084518306],"study_design_scores_gemma":[0.0000062870677,0.000028106715,0.00031323163,0.0000145507465,0.000011641297,0.000043038577,0.000009682927,0.98223144,0.0010906064,0.015787784,0.00044664758,0.00001694432],"about_ca_topic_score_codex":0.0018970355,"about_ca_topic_score_gemma":0.0006848962,"teacher_disagreement_score":0.009460581,"about_ca_system_score_codex":0.0009040431,"about_ca_system_score_gemma":0.0010073852,"threshold_uncertainty_score":0.050032973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063139996,0.0016230157,0.98768425,0.001952278,0.00012610211,0.000023361832,0.00010480026,0.00022735902,0.0019448532],"genre_scores_gemma":[0.57758576,0.00641144,0.3932167,0.0010968723,0.0014593469,0.00025118646,0.00091840856,0.0004471593,0.018613132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987715,0.0006315145,0.00005741672,0.0001539605,0.0002890669,0.000096486714],"domain_scores_gemma":[0.9863452,0.010426099,0.000734345,0.001044333,0.0011468835,0.00030328124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037963071,0.00090915686,0.0013995437,0.0011873834,0.000391348,0.0014254948,0.0024606357,0.002112782,0.0023416393],"category_scores_gemma":[0.029405678,0.0008115747,0.0006189216,0.0019701857,0.0015500484,0.0039633806,0.0017714512,0.003408476,0.0006584546],"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.00014334908,0.0001294014,0.0022051,0.00028183247,0.00019421171,0.00019421634,0.00016769853,0.4419657,0.0021639087,0.43805605,0.014099394,0.10039913],"study_design_scores_gemma":[0.000006914522,0.000010265418,0.00011331372,0.000012301595,0.0000100639,0.000026554068,0.000009181357,0.9443605,0.00024047749,0.05410525,0.0010990654,0.000005999826],"about_ca_topic_score_codex":0.005705653,"about_ca_topic_score_gemma":0.00561953,"teacher_disagreement_score":0.005705653,"about_ca_system_score_codex":0.0010037659,"about_ca_system_score_gemma":0.0010281223,"threshold_uncertainty_score":0.02007705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09333232,0.0016023244,0.8077467,0.0022033716,0.0012601605,0.000091113296,0.00066794216,0.0009518448,0.09214414],"genre_scores_gemma":[0.7327438,0.0013508648,0.12780371,0.00036148168,0.00038116088,0.00020780135,0.0011367196,0.00035972372,0.13565467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964476,0.00007255139,0.000027737002,0.00012725251,0.00009553879,0.00003208326],"domain_scores_gemma":[0.99903536,0.00030588117,0.00005005965,0.00021459699,0.00030690007,0.00008726596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051516475,0.00050629413,0.0005283582,0.0006725621,0.00084755453,0.001663621,0.0006054461,0.0006116938,0.010879434],"category_scores_gemma":[0.0024272455,0.00024348088,0.0006786896,0.00056500774,0.0009962602,0.002167138,0.0013329097,0.0011867519,0.0021181966],"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.000084106745,0.000042052914,0.0006029949,0.00009914309,0.00003165276,0.00012618299,0.00024918796,0.018253349,0.01056819,0.89688176,0.004840552,0.06822086],"study_design_scores_gemma":[0.000010006034,0.000030441817,0.00040847834,0.000028676779,0.000030422083,0.00012607848,0.000080180565,0.14842786,0.0057069324,0.8077,0.03742573,0.000025259114],"about_ca_topic_score_codex":0.001476068,"about_ca_topic_score_gemma":0.0014138477,"teacher_disagreement_score":0.010879434,"about_ca_system_score_codex":0.0011590923,"about_ca_system_score_gemma":0.0008182267,"threshold_uncertainty_score":0.03639531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0188351,0.012400749,0.9358034,0.016040633,0.0018980602,0.00006676114,0.00014227579,0.0019173376,0.012895759],"genre_scores_gemma":[0.50512683,0.00843999,0.46124014,0.0052997977,0.0025549093,0.00021605259,0.00037833527,0.0022490923,0.014494847],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582267,0.002089638,0.00029015914,0.0006570551,0.0008919717,0.00024848586],"domain_scores_gemma":[0.97577286,0.018073011,0.0006119612,0.0027362714,0.002257371,0.00054855266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011908798,0.0016047086,0.0027213283,0.0010881828,0.0010508246,0.0027580224,0.0027766584,0.0048057283,0.00663754],"category_scores_gemma":[0.07838089,0.00084111776,0.0011833193,0.0011005454,0.0025853785,0.011378566,0.0026528651,0.0058195186,0.0019709554],"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.0011994102,0.00039184376,0.004124762,0.0008264009,0.000658955,0.00018447833,0.0003330613,0.15446049,0.0020688504,0.26727167,0.031952113,0.53652793],"study_design_scores_gemma":[0.000083388964,0.00008952629,0.00075833424,0.00028932988,0.00014364692,0.00008124283,0.00009643961,0.84000385,0.0015785679,0.15131561,0.0054854685,0.000074491065],"about_ca_topic_score_codex":0.0067637553,"about_ca_topic_score_gemma":0.006251047,"teacher_disagreement_score":0.011908798,"about_ca_system_score_codex":0.0011905517,"about_ca_system_score_gemma":0.0028740854,"threshold_uncertainty_score":0.06298053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004441172,0.00019840774,0.991679,0.00016327706,0.000042727093,0.000041948657,0.00016827906,0.002657094,0.00060810585],"genre_scores_gemma":[0.29816186,0.00039984414,0.6895238,0.0007015178,0.0003202425,0.00045558545,0.0033136632,0.0012412847,0.005882243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958734,0.0017182427,0.00016788261,0.0011497191,0.0008684235,0.00022236166],"domain_scores_gemma":[0.99165994,0.0033862293,0.0007134634,0.0024073573,0.0015543125,0.00027881894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030717447,0.002179322,0.0025010528,0.0029303422,0.0010806039,0.0019096778,0.0055466862,0.0028987387,0.0027661566],"category_scores_gemma":[0.011697056,0.0011710876,0.0022175952,0.0026527757,0.0016326358,0.0043670507,0.0032237298,0.0033925567,0.0024000178],"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.00017636483,0.00027122145,0.0015911065,0.00020860876,0.00032499895,0.00015949899,0.00022825906,0.5841533,0.0030160788,0.025784897,0.015404278,0.36868137],"study_design_scores_gemma":[0.0000060405982,0.0000104272685,0.000058260168,0.0000052728155,0.0000060274206,0.000014152861,0.0000064642218,0.98697865,0.00038479996,0.01201749,0.0005062499,0.00000617201],"about_ca_topic_score_codex":0.007801721,"about_ca_topic_score_gemma":0.012391222,"teacher_disagreement_score":0.007801721,"about_ca_system_score_codex":0.0013986543,"about_ca_system_score_gemma":0.0020697028,"threshold_uncertainty_score":0.016245127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001286284,0.0013857048,0.9956246,0.0005090599,0.000057888356,0.000036622678,0.000043329423,0.000117269825,0.0009392342],"genre_scores_gemma":[0.21491283,0.0051525175,0.7714204,0.0008864141,0.0010046321,0.0010612174,0.0006766842,0.00032349888,0.0045617544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966695,0.0017314446,0.00019861931,0.00062646327,0.0006130293,0.00016092723],"domain_scores_gemma":[0.9899733,0.0073299287,0.0005212786,0.000882451,0.0010046576,0.00028834722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060099075,0.0016876182,0.0020894282,0.0016684732,0.00079220574,0.0023604836,0.00269302,0.0025137067,0.0027081154],"category_scores_gemma":[0.023066837,0.0007874003,0.0010876867,0.0030670874,0.0024648153,0.003891692,0.0048011052,0.004009623,0.0012940889],"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.00010604409,0.0001421546,0.0014905655,0.00062803196,0.00014877529,0.00016415528,0.00023287277,0.30687484,0.0010063131,0.4301027,0.014890375,0.24421313],"study_design_scores_gemma":[0.000012195254,0.000045048942,0.00014512839,0.000027289943,0.000009618054,0.0000677656,0.00002047387,0.7503044,0.00020866448,0.24568942,0.0034529024,0.000017034505],"about_ca_topic_score_codex":0.002493673,"about_ca_topic_score_gemma":0.0015686541,"teacher_disagreement_score":0.0060099075,"about_ca_system_score_codex":0.0021808832,"about_ca_system_score_gemma":0.001687382,"threshold_uncertainty_score":0.03178382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013196078,0.000506704,0.9837316,0.00022785398,0.000038467235,0.000069802125,0.00008342166,0.0005931076,0.0015529225],"genre_scores_gemma":[0.51656127,0.0005979082,0.47722408,0.00048003686,0.000112198766,0.00039002477,0.0007839735,0.0003350502,0.0035154712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989889,0.00044853578,0.000045554818,0.00020896901,0.00018832275,0.00011964839],"domain_scores_gemma":[0.9941843,0.0044787214,0.00030463695,0.00031144213,0.00051501876,0.00020587914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021307059,0.0011616594,0.002290659,0.001534641,0.0007589155,0.0011508683,0.0017971309,0.0017120595,0.004424837],"category_scores_gemma":[0.009852847,0.0009804608,0.0012120295,0.0016329956,0.0009959575,0.0019721612,0.0015806705,0.0025290705,0.0008025835],"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.000063393076,0.000065010805,0.0010700459,0.00006372597,0.000066034954,0.000050527917,0.00004250201,0.92174757,0.00036080918,0.015116756,0.0025500443,0.058803566],"study_design_scores_gemma":[0.0000050491576,0.0000051397114,0.00002917599,0.0000026011417,0.00000249818,0.000004366737,0.0000019659105,0.9969777,0.00004764383,0.002794228,0.00012797904,0.0000017021166],"about_ca_topic_score_codex":0.011261257,"about_ca_topic_score_gemma":0.013784619,"teacher_disagreement_score":0.011261257,"about_ca_system_score_codex":0.0012693125,"about_ca_system_score_gemma":0.00269041,"threshold_uncertainty_score":0.022391438},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010539144,0.00005998309,0.9983669,0.000078992445,0.000015090573,0.000022571037,0.00001674617,0.00013460603,0.0002512075],"genre_scores_gemma":[0.14216788,0.00030428043,0.8535613,0.00031309345,0.00013155781,0.00024905524,0.00029747863,0.0005413104,0.0024340833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978198,0.0011558578,0.00010090454,0.0004607348,0.00035576505,0.000107026324],"domain_scores_gemma":[0.9940263,0.00436844,0.00030812717,0.00072298147,0.00041511908,0.0001591248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050255517,0.001400335,0.0018371686,0.0015379229,0.0010073023,0.0024219044,0.00387117,0.0020699361,0.0031514422],"category_scores_gemma":[0.018603183,0.0013825531,0.0018120791,0.0015505567,0.0024335505,0.0037223115,0.004171195,0.0045921565,0.00085762935],"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.000121552985,0.000100682984,0.0013792326,0.0002153994,0.00025489694,0.00013069941,0.0002097464,0.5971611,0.0024585275,0.2197072,0.0046061226,0.1736548],"study_design_scores_gemma":[0.0000070499705,0.000008932861,0.00005935575,0.000009174259,0.000007935775,0.000016011547,0.0000068964905,0.9385165,0.00061110855,0.060034007,0.0007141939,0.000008810942],"about_ca_topic_score_codex":0.0068719285,"about_ca_topic_score_gemma":0.00775411,"teacher_disagreement_score":0.0068719285,"about_ca_system_score_codex":0.0017860458,"about_ca_system_score_gemma":0.0031019284,"threshold_uncertainty_score":0.02657795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013374245,0.00025960655,0.98478717,0.00040957416,0.000024033976,0.00005362656,0.00007094493,0.00030285012,0.000718007],"genre_scores_gemma":[0.57053417,0.00034698014,0.42361504,0.0005126413,0.00027359556,0.00049922365,0.0006399414,0.00017405525,0.003404437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982639,0.0008531419,0.000046375517,0.00033925188,0.00033094906,0.00016633548],"domain_scores_gemma":[0.9949517,0.0037037686,0.00035483245,0.00035050994,0.00047211137,0.00016709276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038143147,0.001215982,0.00217921,0.00077403703,0.000797946,0.0011259865,0.0018355893,0.0017084675,0.0019618324],"category_scores_gemma":[0.00704412,0.0005119257,0.0008652164,0.0016921198,0.0011425877,0.0020372372,0.0015098009,0.0016102361,0.00052633457],"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.00023891547,0.00019807884,0.0007658927,0.00013699783,0.00008433851,0.000110789646,0.00008399056,0.8548027,0.0031376812,0.010679232,0.005122012,0.124639355],"study_design_scores_gemma":[0.000024925139,0.000036253205,0.00013332313,0.000003569556,0.000005464669,0.000017941453,0.000010706886,0.990409,0.00042171852,0.008691688,0.000240697,0.0000047380613],"about_ca_topic_score_codex":0.0018963838,"about_ca_topic_score_gemma":0.0028123201,"teacher_disagreement_score":0.0038143147,"about_ca_system_score_codex":0.0015613389,"about_ca_system_score_gemma":0.0013417387,"threshold_uncertainty_score":0.020172238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007707395,0.00014950182,0.9878483,0.00022251715,0.00009753844,0.00007659707,0.00007457942,0.00056615274,0.0032574765],"genre_scores_gemma":[0.34949154,0.00029796557,0.6405022,0.00028139513,0.0002357813,0.00060888997,0.0005394152,0.0006752559,0.0073675658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971136,0.0014321945,0.00012526156,0.000377599,0.0007687553,0.00018259304],"domain_scores_gemma":[0.9869091,0.00904566,0.0004842419,0.0019040928,0.0012553573,0.0004015791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045531583,0.0011311802,0.0024726642,0.0019985891,0.0019535683,0.0025007117,0.0029332694,0.0025441502,0.008815766],"category_scores_gemma":[0.0190989,0.0017323904,0.0018209049,0.0025206604,0.0023941828,0.0038152838,0.003824224,0.0026728243,0.0019423965],"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.0002027366,0.00013154357,0.0005304007,0.000093678,0.000097126125,0.00007213851,0.00009184551,0.7834888,0.0006049244,0.17953469,0.002188981,0.03296318],"study_design_scores_gemma":[0.000012429997,0.000004983969,0.00002695254,0.0000041343587,0.0000052482,0.0000085461415,0.0000036457518,0.9600933,0.00015616891,0.03933747,0.00034131386,0.000005822717],"about_ca_topic_score_codex":0.006813547,"about_ca_topic_score_gemma":0.0071360767,"teacher_disagreement_score":0.008815766,"about_ca_system_score_codex":0.001866433,"about_ca_system_score_gemma":0.0033315273,"threshold_uncertainty_score":0.029491663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03772695,0.0008146892,0.9534394,0.00057080906,0.00011491594,0.00003475412,0.00011029605,0.0002274301,0.006960708],"genre_scores_gemma":[0.89851415,0.001353825,0.09098522,0.0006306399,0.0004550094,0.0001251628,0.00025262465,0.00019991823,0.0074834186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980427,0.0007293897,0.000073296935,0.0004109939,0.00057283934,0.00017074372],"domain_scores_gemma":[0.9863311,0.009618232,0.0009407068,0.0014879872,0.0011183853,0.0005034879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040769414,0.0014986579,0.0017779777,0.0011380976,0.0010190207,0.0017409264,0.0021104089,0.0019307691,0.004962975],"category_scores_gemma":[0.01732224,0.00091317034,0.0015597726,0.0010347067,0.0023064942,0.0049510268,0.0037279956,0.003053074,0.0006118862],"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.00025483346,0.00009909475,0.0028955701,0.00027260976,0.00021775217,0.000705799,0.0003272974,0.38588458,0.008796091,0.5678537,0.0023684949,0.030324135],"study_design_scores_gemma":[0.000021533946,0.00009541157,0.00057578966,0.000022373617,0.000045358083,0.00017804094,0.000060613744,0.8022104,0.0010761403,0.19403088,0.0016464447,0.000037025664],"about_ca_topic_score_codex":0.0019613544,"about_ca_topic_score_gemma":0.0013067605,"teacher_disagreement_score":0.004962975,"about_ca_system_score_codex":0.00077127817,"about_ca_system_score_gemma":0.0010584616,"threshold_uncertainty_score":0.021561205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015910858,0.00014229515,0.98207134,0.00010317461,0.00003582074,0.000018799365,0.000026897023,0.000246956,0.0014437328],"genre_scores_gemma":[0.71622795,0.00039508523,0.27930322,0.00017900085,0.00009583894,0.00019447082,0.00013976118,0.00015856752,0.0033061174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.00046302826,0.000059593793,0.00025467976,0.00020959719,0.00006972538],"domain_scores_gemma":[0.99581784,0.0029659295,0.00035046967,0.00037944707,0.000381697,0.00010473548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016001894,0.0006717799,0.00067565835,0.0007753371,0.0005233804,0.0012596516,0.0013462515,0.0010973462,0.0027058122],"category_scores_gemma":[0.009936062,0.00050238054,0.0006014354,0.00059223425,0.0019937113,0.0037220959,0.0019579607,0.0014583867,0.0004836918],"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.00007933295,0.00004690435,0.00082234055,0.00015805781,0.000054947985,0.00017329464,0.0003348507,0.50936884,0.0041974336,0.4283153,0.0006939429,0.055754762],"study_design_scores_gemma":[0.000004007353,0.000026181515,0.000048334565,0.000009490548,0.0000050965295,0.000026278443,0.000017928018,0.83857113,0.0007293883,0.1599055,0.0006481516,0.000008454039],"about_ca_topic_score_codex":0.001288053,"about_ca_topic_score_gemma":0.0013958426,"teacher_disagreement_score":0.0027058122,"about_ca_system_score_codex":0.00066811434,"about_ca_system_score_gemma":0.00059327175,"threshold_uncertainty_score":0.009051859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031479977,0.00009039245,0.9949195,0.000095722884,0.00001834517,0.000022880218,0.000027134549,0.000103269624,0.0015746691],"genre_scores_gemma":[0.2257364,0.00030595905,0.7663004,0.00017737213,0.00007900539,0.00024075771,0.00021314129,0.00017099407,0.006776082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934787,0.00023261004,0.000029397836,0.00008744307,0.00024230144,0.00006034858],"domain_scores_gemma":[0.99909556,0.00044987237,0.000083572966,0.00012787462,0.0001823164,0.00006078202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014252451,0.0008187848,0.0010787479,0.0006706617,0.0003743225,0.0009830485,0.0009366076,0.0012457798,0.0028663953],"category_scores_gemma":[0.0029756294,0.0004894515,0.0006630819,0.00053365336,0.0011345451,0.0015480939,0.0016943695,0.0016511031,0.0010402342],"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.00013858054,0.00006835965,0.0005597865,0.00018585268,0.000054680157,0.00023142838,0.00016559886,0.65955615,0.0076048747,0.21653706,0.005221856,0.109675825],"study_design_scores_gemma":[0.000007829411,0.00002079574,0.000028779963,0.000007255039,0.000002287886,0.000026607926,0.0000058330133,0.9811002,0.0005873105,0.017236602,0.00097144884,0.0000050302615],"about_ca_topic_score_codex":0.0011863573,"about_ca_topic_score_gemma":0.0012312152,"teacher_disagreement_score":0.0028663953,"about_ca_system_score_codex":0.0005877519,"about_ca_system_score_gemma":0.0010396735,"threshold_uncertainty_score":0.009589016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039758906,0.0010910962,0.95132965,0.0008245729,0.000059329996,0.0001227974,0.00014122252,0.00045212373,0.006220358],"genre_scores_gemma":[0.67155784,0.0021643373,0.32106805,0.0004841597,0.00028219598,0.00039565683,0.0005086724,0.00033224357,0.003206907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683374,0.0016050731,0.00010672476,0.0004611336,0.00076836476,0.00022502028],"domain_scores_gemma":[0.98830765,0.008849032,0.0005313492,0.0016188916,0.00045472028,0.000238354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056293095,0.0018366947,0.0017305689,0.0012341611,0.0006779995,0.002104349,0.0010893969,0.0008908377,0.0027309798],"category_scores_gemma":[0.02304803,0.0005370841,0.0013962334,0.0011281698,0.0030179806,0.004285924,0.0028172426,0.0044266717,0.0005006247],"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.00026305593,0.00017092313,0.0013619749,0.00028024506,0.0000972721,0.00015537502,0.00021868969,0.61894584,0.004880059,0.28025952,0.003080126,0.09028691],"study_design_scores_gemma":[0.000022932905,0.00011800835,0.00024386111,0.000042941414,0.000021716767,0.00007956476,0.000032404638,0.77577853,0.0017803815,0.22007385,0.0017927067,0.00001320728],"about_ca_topic_score_codex":0.0009671011,"about_ca_topic_score_gemma":0.0006462276,"teacher_disagreement_score":0.0056293095,"about_ca_system_score_codex":0.0013188124,"about_ca_system_score_gemma":0.0011260456,"threshold_uncertainty_score":0.02977103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007115305,0.00020336805,0.98921996,0.00016659504,0.0000397186,0.000046972145,0.00013018807,0.0013089557,0.0017688354],"genre_scores_gemma":[0.22926103,0.00033470572,0.762542,0.00047966032,0.00011440157,0.0004089734,0.0013265425,0.001344659,0.004188051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955389,0.0021009822,0.00019760887,0.0006475385,0.0012906711,0.00022432671],"domain_scores_gemma":[0.98430485,0.010072875,0.0009546579,0.0025239782,0.0018515511,0.0002920955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069856653,0.0015763337,0.0017865859,0.0017588363,0.0011030466,0.0029690473,0.0032495076,0.0022306184,0.006497873],"category_scores_gemma":[0.041226417,0.0011752397,0.001480038,0.0010864892,0.0019840836,0.0035960656,0.00293557,0.0043034623,0.0031770153],"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.00046997517,0.00020499862,0.005573772,0.0005369461,0.00023981697,0.00024794866,0.0003462174,0.5432349,0.011883916,0.17598248,0.012180006,0.24909902],"study_design_scores_gemma":[0.000015374715,0.000030977706,0.00048605158,0.000043881817,0.000019023535,0.00007842761,0.000020701256,0.95522135,0.0043805446,0.03706124,0.00261162,0.00003082067],"about_ca_topic_score_codex":0.0042750346,"about_ca_topic_score_gemma":0.0066988487,"teacher_disagreement_score":0.0069856653,"about_ca_system_score_codex":0.0018033604,"about_ca_system_score_gemma":0.0019982555,"threshold_uncertainty_score":0.03694415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018205114,0.00009771715,0.9750251,0.00021710119,0.000063193904,0.000071432914,0.000023248229,0.00016153483,0.006135519],"genre_scores_gemma":[0.6687952,0.00030470366,0.31802732,0.00024084903,0.00008256344,0.00032919957,0.00007192004,0.00024381778,0.011904373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918395,0.00031784535,0.000033314558,0.00011910655,0.00023157704,0.00011419245],"domain_scores_gemma":[0.9975777,0.0013002584,0.00028518683,0.00032414796,0.00028082673,0.00023188443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016284828,0.001059089,0.00073707657,0.0007534659,0.00066401524,0.0012855987,0.0010371478,0.0011310822,0.0044591795],"category_scores_gemma":[0.0072703594,0.00046730842,0.00079471833,0.0004068844,0.0018569344,0.0024002462,0.0022967008,0.0017344095,0.0007916345],"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.00010699283,0.00009415324,0.0005065905,0.00008949054,0.00004342408,0.00010680301,0.00023766766,0.47361767,0.0067729168,0.4849119,0.0016665221,0.03184583],"study_design_scores_gemma":[0.000015006523,0.0000555914,0.000058837297,0.000010410012,0.000005600137,0.000025480671,0.000024870575,0.87635744,0.0008713048,0.121218815,0.0013469418,0.000009780701],"about_ca_topic_score_codex":0.0015075067,"about_ca_topic_score_gemma":0.0013949841,"teacher_disagreement_score":0.0044591795,"about_ca_system_score_codex":0.0009827034,"about_ca_system_score_gemma":0.0011915244,"threshold_uncertainty_score":0.014917433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00740631,0.00004949765,0.99148995,0.00009626046,0.00000829021,0.000018881488,0.000011504964,0.00015855342,0.00076084887],"genre_scores_gemma":[0.6436853,0.00015389925,0.35403052,0.00011791473,0.000042713953,0.00018829606,0.00009593479,0.00011521312,0.0015702291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987765,0.00056560093,0.000058695998,0.00021337382,0.00027306678,0.000112763984],"domain_scores_gemma":[0.99506617,0.003540054,0.00046105424,0.00045217117,0.00031283038,0.00016770813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025108939,0.00080220285,0.0009370579,0.00064058707,0.00046504816,0.0010358656,0.001326261,0.0011518185,0.0019016204],"category_scores_gemma":[0.009926554,0.00049357227,0.0005258848,0.0006821807,0.0024188568,0.0029208364,0.0018931194,0.0013551441,0.00027485794],"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.0000925702,0.00007247399,0.00039358865,0.00008474328,0.000026381018,0.000044679364,0.000094278934,0.8102442,0.0012171755,0.12693937,0.0006857804,0.060104784],"study_design_scores_gemma":[0.000008626215,0.00001934479,0.00004241148,0.0000056049853,0.000002109092,0.000008928393,0.0000065480313,0.9540047,0.00038715487,0.04533071,0.00017992806,0.0000039671527],"about_ca_topic_score_codex":0.0032193887,"about_ca_topic_score_gemma":0.0024723234,"teacher_disagreement_score":0.0032193887,"about_ca_system_score_codex":0.0012373698,"about_ca_system_score_gemma":0.002518277,"threshold_uncertainty_score":0.013279021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19809873,0.002765742,0.78313273,0.0058170203,0.00014493274,0.00022806514,0.0012782065,0.001772617,0.006761866],"genre_scores_gemma":[0.8397913,0.0017649449,0.14716479,0.0013371572,0.00040601398,0.0007707448,0.0035276555,0.00061439024,0.0046229083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582565,0.0016593974,0.00024782892,0.00094709796,0.0009811064,0.0003389076],"domain_scores_gemma":[0.9352644,0.05787707,0.0015997724,0.0029712163,0.0014871327,0.0008004516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005219311,0.0017296391,0.0025384135,0.0010967995,0.0010812347,0.0029407917,0.0031271249,0.0027140677,0.0047664875],"category_scores_gemma":[0.048297588,0.0011414209,0.0014764175,0.0014341604,0.0033490816,0.009690925,0.0041171727,0.006384684,0.0006306869],"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.0009994666,0.00021882601,0.00659292,0.00046926373,0.0002186168,0.0002512854,0.0003246678,0.8320899,0.0025740226,0.09163853,0.0050126025,0.05960988],"study_design_scores_gemma":[0.00002503677,0.000050145056,0.00029491232,0.000017792612,0.000015268079,0.000040267678,0.000020347454,0.93673134,0.00043771576,0.06209785,0.00025835502,0.00001095569],"about_ca_topic_score_codex":0.0037134627,"about_ca_topic_score_gemma":0.0039944137,"teacher_disagreement_score":0.005219311,"about_ca_system_score_codex":0.0035889614,"about_ca_system_score_gemma":0.0020524627,"threshold_uncertainty_score":0.027602673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091721123,0.000029827055,0.9980925,0.000037539885,0.0000068315617,0.000023325545,0.000037586706,0.00076368987,0.00009146553],"genre_scores_gemma":[0.024470864,0.000059650356,0.9737177,0.0000716106,0.000027760369,0.00026688245,0.00041261635,0.00045657987,0.00051641744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971495,0.0014370369,0.00018288005,0.00051143294,0.00051837106,0.00020075121],"domain_scores_gemma":[0.99094397,0.006573088,0.00034909672,0.0012163218,0.0007796302,0.00013794073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073018163,0.0025029727,0.0016687893,0.002945048,0.0009989691,0.0016327945,0.0026604736,0.0018612044,0.005328211],"category_scores_gemma":[0.020949116,0.0011025108,0.0029254714,0.0020054127,0.0017710658,0.0026301462,0.0030690737,0.0038429599,0.0030616564],"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.00034085772,0.00020044262,0.0033835517,0.00037410663,0.00038020278,0.0003001863,0.00070049166,0.10491106,0.012278464,0.06984249,0.010366997,0.79692113],"study_design_scores_gemma":[0.0000676976,0.00010837768,0.00079721713,0.000040414987,0.00007080385,0.00018412928,0.00010147234,0.86771566,0.003909223,0.11991981,0.0070286132,0.0000566454],"about_ca_topic_score_codex":0.0052562677,"about_ca_topic_score_gemma":0.0078024184,"teacher_disagreement_score":0.0073018163,"about_ca_system_score_codex":0.0010712633,"about_ca_system_score_gemma":0.0036263862,"threshold_uncertainty_score":0.03861618},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24406728,0.0048563387,0.7394854,0.0030804141,0.00023125438,0.00014247576,0.00022233176,0.0003051302,0.0076094544],"genre_scores_gemma":[0.9293525,0.0016472049,0.062021635,0.00033131154,0.00031097373,0.00012535845,0.00053652684,0.00035611074,0.005318401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752706,0.0015574404,0.000094829506,0.0002914518,0.00037402354,0.00015527],"domain_scores_gemma":[0.9160459,0.07383517,0.002908594,0.00267658,0.0036305694,0.00090310676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011574941,0.0010311091,0.0014055021,0.001516982,0.00075443083,0.001796663,0.0028451262,0.002316109,0.003630437],"category_scores_gemma":[0.09702546,0.0010429134,0.0009586452,0.001525474,0.0033279478,0.0050235614,0.0019925912,0.0026981889,0.0002505281],"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.0002694834,0.00029132853,0.0155802835,0.00044409942,0.00023088185,0.0004245761,0.00048595745,0.5649873,0.0017134249,0.380117,0.0050201546,0.030435545],"study_design_scores_gemma":[0.000018380551,0.000049520266,0.0019323408,0.00005113574,0.000017043336,0.00009183487,0.000060885355,0.9671764,0.0001881526,0.029607441,0.0007883412,0.000018451594],"about_ca_topic_score_codex":0.0068860436,"about_ca_topic_score_gemma":0.005110152,"teacher_disagreement_score":0.011574941,"about_ca_system_score_codex":0.0014203165,"about_ca_system_score_gemma":0.001928835,"threshold_uncertainty_score":0.061214864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028259924,0.0002052287,0.9960168,0.00011216194,0.00002311156,0.000024989647,0.0000146343045,0.000084670086,0.0006924346],"genre_scores_gemma":[0.36872625,0.0005487055,0.625159,0.00016376484,0.00011366878,0.0004660086,0.00016925085,0.0003251865,0.0043280846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906105,0.00054748065,0.000061294784,0.00010775178,0.00015903918,0.00006335475],"domain_scores_gemma":[0.99508506,0.004109002,0.00018529742,0.00012545148,0.00040067363,0.00009442944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031652253,0.000993378,0.0016288798,0.00088770856,0.00046421788,0.0013571661,0.0014814545,0.0019443738,0.003655325],"category_scores_gemma":[0.01087652,0.00085888297,0.0010038667,0.00080189214,0.0011712728,0.0012806241,0.0016636155,0.003037168,0.00048065424],"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.00003175816,0.000036490277,0.00019431223,0.00006399811,0.000028222086,0.00003202224,0.000069271875,0.9185212,0.00034739482,0.044373784,0.00053276273,0.035768766],"study_design_scores_gemma":[0.0000039215006,0.000004412381,0.000011430643,0.000004594219,0.0000017481744,0.0000014319249,0.0000017870611,0.99226016,0.000030725238,0.00757459,0.00010391865,0.000001355303],"about_ca_topic_score_codex":0.0065346295,"about_ca_topic_score_gemma":0.0055460758,"teacher_disagreement_score":0.0065346295,"about_ca_system_score_codex":0.0014962329,"about_ca_system_score_gemma":0.0016908741,"threshold_uncertainty_score":0.016739547},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024775142,0.00030213373,0.9704497,0.0014152494,0.00002917349,0.00007896247,0.00016581459,0.000248968,0.0025349176],"genre_scores_gemma":[0.6674877,0.00042581963,0.3292096,0.0008377054,0.00019631277,0.00034937492,0.00033809207,0.00011691154,0.0010385643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96723205,0.017282646,0.0018286242,0.007988005,0.0044521764,0.0012165154],"domain_scores_gemma":[0.6551909,0.3090055,0.014393743,0.014748238,0.0045027942,0.0021588649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.041354474,0.0011813263,0.0033904198,0.005333356,0.0027648546,0.003730391,0.003110095,0.004447457,0.003910022],"category_scores_gemma":[0.19481486,0.0020717601,0.0032664712,0.0029633415,0.011907641,0.011899235,0.0067198793,0.007048744,0.00042712787],"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.00015554762,0.00007539854,0.006154589,0.00029488013,0.00025706927,0.00061515113,0.0008439542,0.12459484,0.0007778182,0.84491754,0.0013328918,0.019980364],"study_design_scores_gemma":[0.00002164534,0.000017581702,0.00035954843,0.00004620267,0.000031009775,0.00019790832,0.000047414404,0.2050724,0.00030875465,0.7933426,0.0005276873,0.000027262646],"about_ca_topic_score_codex":0.002386544,"about_ca_topic_score_gemma":0.0015156514,"teacher_disagreement_score":0.041354474,"about_ca_system_score_codex":0.0028321391,"about_ca_system_score_gemma":0.0022253024,"threshold_uncertainty_score":0.21870601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006751448,0.00008771121,0.98788935,0.00016660831,0.00005748206,0.000046610672,0.00014347106,0.00079042435,0.0040669465],"genre_scores_gemma":[0.55993116,0.00036854736,0.42448342,0.00030162593,0.00007328342,0.00023366176,0.00055621006,0.000378942,0.013673147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988556,0.00027743177,0.00009480288,0.00022814867,0.00039359022,0.00015052779],"domain_scores_gemma":[0.998218,0.0007403555,0.00011940496,0.00060357,0.00018172423,0.00013703392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017892383,0.0008924238,0.00075511914,0.0006508761,0.00059531315,0.0019415478,0.0016619508,0.0010191668,0.0067228526],"category_scores_gemma":[0.004625426,0.000615711,0.0015661347,0.0006931228,0.0015101942,0.0031873719,0.004262074,0.0033693577,0.0010432567],"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.00021931536,0.00012245706,0.0005583838,0.00017838989,0.00008169668,0.00024249573,0.00034662627,0.16097806,0.0058069746,0.7132933,0.002668574,0.11550374],"study_design_scores_gemma":[0.00003139029,0.00006846241,0.00012066489,0.000030718104,0.00004248289,0.00006115897,0.000045756835,0.41120642,0.004880922,0.5767396,0.0067554736,0.000016878845],"about_ca_topic_score_codex":0.001380471,"about_ca_topic_score_gemma":0.0020995461,"teacher_disagreement_score":0.0067228526,"about_ca_system_score_codex":0.0008753447,"about_ca_system_score_gemma":0.0013267279,"threshold_uncertainty_score":0.022490144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015440369,0.00033116012,0.9888903,0.0002767606,0.00010083615,0.00012296143,0.00033003674,0.0012155897,0.0071882317],"genre_scores_gemma":[0.11822953,0.0009773751,0.86443084,0.00056984293,0.00035345304,0.0006820189,0.0016184644,0.0010277182,0.012110807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969399,0.0015977054,0.00009378556,0.0005305339,0.0006846148,0.00015340712],"domain_scores_gemma":[0.99402136,0.0040039974,0.00030168914,0.00095260586,0.0005194434,0.00020080623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034472782,0.001151001,0.0011801673,0.0013031493,0.0011348174,0.0024390544,0.0025047471,0.0015859493,0.014581262],"category_scores_gemma":[0.015621445,0.0008350469,0.0011538677,0.0017670786,0.0014449367,0.0027605598,0.0023177168,0.0022706166,0.0043896576],"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.00017270788,0.00013619986,0.0024278108,0.0004010947,0.00013662122,0.00020385586,0.00029701655,0.13602495,0.0025883599,0.6274148,0.033008605,0.19718787],"study_design_scores_gemma":[0.0000627417,0.000027726413,0.0003599242,0.000059912185,0.000038390048,0.00018557018,0.000037344707,0.63059163,0.002041211,0.32371292,0.042848323,0.000034286822],"about_ca_topic_score_codex":0.0040949695,"about_ca_topic_score_gemma":0.0058484273,"teacher_disagreement_score":0.014581262,"about_ca_system_score_codex":0.0011352007,"about_ca_system_score_gemma":0.0021184667,"threshold_uncertainty_score":0.04877919},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004845308,0.0012044167,0.9903848,0.0005095751,0.00012008915,0.000030710777,0.00012150183,0.00032126677,0.002462263],"genre_scores_gemma":[0.4983419,0.0029074869,0.48183444,0.0017430279,0.0010481761,0.00055771007,0.0015969682,0.0011381664,0.010832077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675363,0.0018135963,0.00017745038,0.00055285543,0.0004915845,0.00021088074],"domain_scores_gemma":[0.9807648,0.016922297,0.0004870067,0.00073404616,0.00083669205,0.00025521475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008480635,0.0020838312,0.0031792207,0.0010938112,0.0005855938,0.0018127149,0.0031158866,0.0029589732,0.005043351],"category_scores_gemma":[0.031527672,0.0017529657,0.0017213492,0.0010044953,0.003008432,0.0036896737,0.0033425193,0.005407231,0.0011483326],"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.00035737027,0.000084838284,0.0007703732,0.00036439789,0.00029957521,0.00009771813,0.00015256932,0.7350326,0.0021008865,0.1796335,0.009783839,0.071322255],"study_design_scores_gemma":[0.000020549718,0.00004695151,0.00014477402,0.00003388008,0.000015770673,0.000023151406,0.000008587639,0.9455171,0.00038549837,0.053164415,0.00062554365,0.000013853424],"about_ca_topic_score_codex":0.0038054015,"about_ca_topic_score_gemma":0.0045867846,"teacher_disagreement_score":0.008480635,"about_ca_system_score_codex":0.0015382569,"about_ca_system_score_gemma":0.0018413459,"threshold_uncertainty_score":0.04485041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026306903,0.0011309291,0.99026114,0.0004962054,0.00013235974,0.00007492295,0.000042069914,0.00009451623,0.0051371567],"genre_scores_gemma":[0.33732337,0.004049433,0.6269045,0.0012819938,0.00097381405,0.0010678209,0.0003941266,0.0011136493,0.02689122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964412,0.0019368007,0.0001386602,0.00035220548,0.0008432955,0.00028793517],"domain_scores_gemma":[0.9865155,0.009934863,0.0005130233,0.00069264777,0.0015947567,0.0007492273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007907452,0.0026518663,0.0024795118,0.0022686094,0.0011830048,0.0030045672,0.003933966,0.0033116876,0.006955343],"category_scores_gemma":[0.032729294,0.0012802839,0.0022836362,0.0014250429,0.0033144904,0.0055948016,0.0057518883,0.0065082917,0.0012085382],"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.00012770445,0.00017501133,0.0006438888,0.0003794299,0.00016356657,0.00013738449,0.00023816232,0.20282272,0.0015272107,0.7425998,0.009154691,0.042030353],"study_design_scores_gemma":[0.000012442705,0.000050710514,0.00015264945,0.000063869404,0.000026024094,0.000034286906,0.000023846278,0.84851617,0.00020059689,0.14882138,0.0020799094,0.00001815443],"about_ca_topic_score_codex":0.005744274,"about_ca_topic_score_gemma":0.0053843404,"teacher_disagreement_score":0.007907452,"about_ca_system_score_codex":0.0024643615,"about_ca_system_score_gemma":0.0031708542,"threshold_uncertainty_score":0.041819096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003122391,0.00031059157,0.9937571,0.0003186239,0.00007249198,0.00009666625,0.00030169295,0.0013538856,0.0006665088],"genre_scores_gemma":[0.10884741,0.0003503182,0.88293654,0.00046490112,0.00030006282,0.00081686577,0.0020698253,0.000752868,0.0034612296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940044,0.0038419855,0.00031907542,0.00068090745,0.0007493009,0.0004042121],"domain_scores_gemma":[0.96321106,0.02994498,0.00087191677,0.0037823766,0.001473766,0.00071586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011819367,0.0022394592,0.0028112987,0.0024713546,0.0014195917,0.003063153,0.0056936145,0.0032191272,0.012017253],"category_scores_gemma":[0.05194046,0.002083995,0.0023944995,0.0029556241,0.0033349746,0.0067851297,0.005227091,0.00661775,0.002655598],"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.0010136883,0.00045989858,0.0019536838,0.00043157375,0.00032783073,0.00022724071,0.00028864818,0.35430035,0.0017256951,0.41200173,0.0185292,0.20874044],"study_design_scores_gemma":[0.00006279882,0.000027735143,0.000099522,0.000028657554,0.000025464504,0.000026224894,0.000015993528,0.79948753,0.00055876514,0.19830425,0.0013493564,0.000013646086],"about_ca_topic_score_codex":0.009548254,"about_ca_topic_score_gemma":0.01595769,"teacher_disagreement_score":0.012017253,"about_ca_system_score_codex":0.002788531,"about_ca_system_score_gemma":0.0061107716,"threshold_uncertainty_score":0.06250751},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033730557,0.00057517615,0.9935354,0.0004745027,0.00007207245,0.000023656214,0.00006403779,0.00024863586,0.0016333907],"genre_scores_gemma":[0.25721094,0.0019613001,0.73062795,0.0007790696,0.00059025345,0.00030270658,0.0007049169,0.00076952914,0.007053308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983734,0.0009227452,0.00006841077,0.00018127164,0.00034614664,0.00010800301],"domain_scores_gemma":[0.9931973,0.0049935826,0.0002924647,0.00056614063,0.00075699063,0.00019345823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033547366,0.0014009138,0.0016336443,0.00083501317,0.00049965625,0.0017281043,0.0018746814,0.0019300028,0.0031006564],"category_scores_gemma":[0.022473725,0.0008857293,0.00080215774,0.001201045,0.001926057,0.003215023,0.0024624832,0.0035678246,0.0010979354],"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.0002443535,0.0001296459,0.0015008058,0.0003490282,0.00014272191,0.0001914515,0.0002471075,0.5521987,0.0025473319,0.31380475,0.02331962,0.1053245],"study_design_scores_gemma":[0.000020399926,0.000042700238,0.00009464793,0.00001892121,0.00001000401,0.000022720658,0.0000147246565,0.92665344,0.00044072038,0.07098819,0.0016861527,0.000007420076],"about_ca_topic_score_codex":0.0053240177,"about_ca_topic_score_gemma":0.006277763,"teacher_disagreement_score":0.0053240177,"about_ca_system_score_codex":0.00080394646,"about_ca_system_score_gemma":0.0016603864,"threshold_uncertainty_score":0.0177418},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06383695,0.0020202724,0.92439365,0.00094225886,0.00011426498,0.0006174627,0.00053753325,0.0033630757,0.0041745426],"genre_scores_gemma":[0.60365874,0.00061439903,0.38692257,0.0007765336,0.00037217914,0.000881794,0.0027284927,0.0007970965,0.0032481414],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9939878,0.0027588906,0.0003075293,0.0010946589,0.0014632556,0.00038783933],"domain_scores_gemma":[0.9756919,0.01962775,0.0010479705,0.0015583831,0.0015806304,0.00049332913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009727998,0.0030387307,0.0034500512,0.0063831406,0.0015001241,0.0032158545,0.004073816,0.0042280527,0.005398038],"category_scores_gemma":[0.04886378,0.00089428155,0.002431291,0.0026231185,0.0022617264,0.0036585233,0.0030388373,0.0035284262,0.0018392211],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014641325,0.00078947836,0.02565873,0.0010851104,0.00063187006,0.0009765691,0.00094730174,0.3709819,0.0060655903,0.02418375,0.014679045,0.55253655],"study_design_scores_gemma":[0.000095230454,0.00023390181,0.0015715642,0.00012782204,0.000089615554,0.00019816468,0.00013978427,0.96987027,0.0032926684,0.021519946,0.002816926,0.00004408599],"about_ca_topic_score_codex":0.0035512368,"about_ca_topic_score_gemma":0.0042290846,"teacher_disagreement_score":0.009727998,"about_ca_system_score_codex":0.0014565879,"about_ca_system_score_gemma":0.002214762,"threshold_uncertainty_score":0.051447213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035937035,0.00022427738,0.9931809,0.00023214558,0.000055393342,0.00004212376,0.0001327305,0.00093517295,0.0016037067],"genre_scores_gemma":[0.27228463,0.0005411066,0.7158501,0.00040371745,0.00019142819,0.00036070746,0.0008333847,0.0014458905,0.008088994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995347,0.000133449,0.000030152501,0.00008416154,0.00017261614,0.00004487348],"domain_scores_gemma":[0.9984837,0.0009180461,0.00009785652,0.00015086101,0.00027462761,0.0000749356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204077,0.0011113305,0.0010552955,0.00067510805,0.00050384726,0.0013857419,0.0012423694,0.0012120894,0.004838579],"category_scores_gemma":[0.00576324,0.0006545419,0.001021966,0.0005528806,0.0010210726,0.0015395083,0.0018207593,0.002751983,0.0013106769],"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.00009531799,0.00006746069,0.0009922428,0.00026648265,0.00009866171,0.00015460518,0.00010395521,0.73312736,0.007830826,0.1623934,0.0075733215,0.087296344],"study_design_scores_gemma":[0.0000041486983,0.000003127462,0.000033758686,0.000004354263,0.0000016483349,0.000007177446,0.0000023172183,0.9838934,0.00045388823,0.014880989,0.00071168254,0.0000035180947],"about_ca_topic_score_codex":0.0068531604,"about_ca_topic_score_gemma":0.0075342124,"teacher_disagreement_score":0.0068531604,"about_ca_system_score_codex":0.0013290086,"about_ca_system_score_gemma":0.0018789753,"threshold_uncertainty_score":0.016186655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011878989,0.00040892055,0.9590244,0.0006787429,0.00058759464,0.000051114162,0.00008868678,0.0008398318,0.026441576],"genre_scores_gemma":[0.43083918,0.000520118,0.5109951,0.0005361858,0.00048583056,0.0002662887,0.000356872,0.0009091154,0.055091325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918586,0.00027158196,0.000027769573,0.000106969645,0.0003375772,0.00007025016],"domain_scores_gemma":[0.9985128,0.00067295844,0.0000586711,0.00032540094,0.00033520782,0.000094929645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011698746,0.00081118813,0.0010306131,0.0006773804,0.000477311,0.0014575849,0.0010047398,0.0009935295,0.014472288],"category_scores_gemma":[0.0056107948,0.00044835216,0.00079932425,0.00073520985,0.0009472174,0.00092230056,0.0018062021,0.0017812245,0.0026382667],"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.00028406273,0.00011936419,0.00072185526,0.00011825709,0.00011422487,0.00013863189,0.000096231306,0.46980563,0.0035419792,0.3231404,0.01823547,0.18368386],"study_design_scores_gemma":[0.000028337621,0.000023236935,0.000065799286,0.000008091285,0.000008085955,0.000027681417,0.0000041803014,0.9472063,0.0008918645,0.047498584,0.004231716,0.0000059868635],"about_ca_topic_score_codex":0.0013674215,"about_ca_topic_score_gemma":0.0025220132,"teacher_disagreement_score":0.014472288,"about_ca_system_score_codex":0.000760634,"about_ca_system_score_gemma":0.001512836,"threshold_uncertainty_score":0.048414588},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012257755,0.000294383,0.9865507,0.00014606395,0.00002629601,0.000023276674,0.00007441614,0.00029177024,0.0003352786],"genre_scores_gemma":[0.62218624,0.0008817654,0.3711603,0.00053262064,0.00013642487,0.0002026384,0.0014135174,0.00019593262,0.0032906176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999405,0.0002299849,0.000029949651,0.00017143102,0.00010968864,0.000053984073],"domain_scores_gemma":[0.99875593,0.00079660676,0.00008778454,0.00017223213,0.00014192825,0.0000455926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016558353,0.0008796913,0.0010910217,0.00043115387,0.0002554118,0.0006545497,0.0017386168,0.0010019963,0.0007675454],"category_scores_gemma":[0.0040437505,0.00062682026,0.00089485216,0.00069572456,0.0008545191,0.0014521913,0.0012752496,0.0019098832,0.00026650022],"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.00010161193,0.000079898025,0.0015996606,0.0001053079,0.00018758864,0.00010473011,0.000106041465,0.857723,0.004251192,0.013689585,0.002305555,0.11974588],"study_design_scores_gemma":[0.0000032911073,0.000008826178,0.000081791695,0.0000042090887,0.000004972088,0.000009758281,0.0000038902926,0.9960019,0.00040834994,0.0032718598,0.00019819876,0.0000029226637],"about_ca_topic_score_codex":0.0060199224,"about_ca_topic_score_gemma":0.007026808,"teacher_disagreement_score":0.0060199224,"about_ca_system_score_codex":0.0005514798,"about_ca_system_score_gemma":0.0011454413,"threshold_uncertainty_score":0.011969745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03441267,0.00061410136,0.9618943,0.0005666404,0.000053398977,0.000053530624,0.000068548776,0.00026666382,0.0020700826],"genre_scores_gemma":[0.8323093,0.0008874481,0.15985624,0.00038921495,0.00022162632,0.00033370915,0.00027760098,0.00016306766,0.0055618268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797493,0.00052070833,0.000120899684,0.00046986254,0.00066692784,0.00024674193],"domain_scores_gemma":[0.9865341,0.008244654,0.0014894194,0.0015054321,0.001467317,0.00075896154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039696405,0.0009864081,0.0013538154,0.0012446791,0.0011526286,0.0014970432,0.002809747,0.0016232034,0.0028871368],"category_scores_gemma":[0.025072731,0.0006269054,0.0007627215,0.0011888705,0.0035679177,0.0045863516,0.0030951207,0.0027852233,0.00048055482],"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.0003250063,0.00023180591,0.0075741434,0.00038978946,0.00015946745,0.0005348237,0.0007453031,0.52273387,0.005233311,0.33652157,0.0039141374,0.12163685],"study_design_scores_gemma":[0.000013419535,0.00009280528,0.0008319917,0.000026219657,0.000014976257,0.00013699509,0.000038530514,0.9017296,0.0008994603,0.095322534,0.0008687185,0.000024836301],"about_ca_topic_score_codex":0.00383996,"about_ca_topic_score_gemma":0.0035431213,"teacher_disagreement_score":0.0039696405,"about_ca_system_score_codex":0.0016242347,"about_ca_system_score_gemma":0.0017879902,"threshold_uncertainty_score":0.02099371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151432445,0.004451425,0.96121633,0.007916621,0.00066809205,0.00008286833,0.0001978593,0.00026556358,0.010057922],"genre_scores_gemma":[0.5435516,0.0036589305,0.4350756,0.003985448,0.00255561,0.0002861151,0.00041082437,0.00038869685,0.010087189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98535895,0.009616403,0.0006816193,0.0011428721,0.0027387124,0.00046146667],"domain_scores_gemma":[0.79631144,0.18492162,0.0019752255,0.008309747,0.007029615,0.0014523774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03489062,0.0013661934,0.0029359134,0.002034,0.0020603861,0.0057445024,0.0045773303,0.0034989964,0.0053579314],"category_scores_gemma":[0.14818278,0.0016223822,0.0010531894,0.002053381,0.006636003,0.01753328,0.004517928,0.00795818,0.00086878234],"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.0005147565,0.00009029557,0.0030428963,0.0002735379,0.00010181904,0.00016233548,0.00042130554,0.080625966,0.00028224083,0.8180159,0.0074741365,0.0889948],"study_design_scores_gemma":[0.000044004468,0.000032185268,0.00014435446,0.00007789136,0.000025736086,0.00007220536,0.000049610164,0.4259282,0.00036995907,0.57088816,0.0023464204,0.00002127627],"about_ca_topic_score_codex":0.007511761,"about_ca_topic_score_gemma":0.005523397,"teacher_disagreement_score":0.03489062,"about_ca_system_score_codex":0.0019576196,"about_ca_system_score_gemma":0.0025827584,"threshold_uncertainty_score":0.18452144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062783174,0.0006849523,0.92910117,0.0014442083,0.00011723932,0.00009825698,0.0002402032,0.0005905677,0.0049401866],"genre_scores_gemma":[0.92852265,0.00027032022,0.06671134,0.0003585426,0.00014185875,0.00018031852,0.00029498985,0.00006624899,0.0034537392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.0005971172,0.0000527514,0.0003317843,0.00023597205,0.00020233098],"domain_scores_gemma":[0.9909383,0.0070606996,0.0006908505,0.0005719895,0.00035465945,0.00038350082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023309416,0.0010740514,0.0018827583,0.00036169728,0.00040825302,0.0010159086,0.001606502,0.0016028121,0.0031039696],"category_scores_gemma":[0.014279899,0.0005043797,0.00048786664,0.0004411484,0.001662245,0.0019727882,0.0016477478,0.002282195,0.00037519477],"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.00024007827,0.00014987522,0.0011901335,0.00012672367,0.000060671253,0.00010503748,0.000053142805,0.93955517,0.00054693094,0.035165407,0.0017266261,0.021080319],"study_design_scores_gemma":[0.000019147352,0.000025335223,0.00006955346,0.000005376287,0.0000034399573,0.0000075193498,0.0000032925757,0.9848232,0.00009993629,0.01478128,0.00015912931,0.0000027124752],"about_ca_topic_score_codex":0.0032746398,"about_ca_topic_score_gemma":0.0028343848,"teacher_disagreement_score":0.0032746398,"about_ca_system_score_codex":0.0012784037,"about_ca_system_score_gemma":0.0014094616,"threshold_uncertainty_score":0.012327373},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36154455,0.00049487804,0.62567973,0.0015749675,0.00017048707,0.00013791934,0.00025247902,0.0013336767,0.008811262],"genre_scores_gemma":[0.98272,0.00012604782,0.015751125,0.00009411572,0.000036796508,0.000022969114,0.00012771765,0.000024531144,0.0010966222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882156,0.0004082619,0.00003392072,0.000175767,0.0003672789,0.00019313896],"domain_scores_gemma":[0.9953571,0.0026007048,0.00060166855,0.0008290983,0.0003863804,0.00022507642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012305711,0.00074659014,0.0006754086,0.0011728191,0.000455556,0.0010704105,0.0010303083,0.0013506261,0.0010590542],"category_scores_gemma":[0.008650489,0.00031456866,0.00052946684,0.0005812415,0.0011448795,0.0016474397,0.0022460297,0.0013378896,0.00025918594],"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.0006261679,0.00014234685,0.003981572,0.00011341631,0.00013274312,0.00030966653,0.0001598853,0.7725815,0.026339872,0.105364695,0.00567133,0.08457682],"study_design_scores_gemma":[0.000006855747,0.00004585685,0.0003540067,0.0000048453035,0.0000072027083,0.000075875236,0.00001988665,0.9819334,0.0024834278,0.0147062335,0.00035782816,0.0000045443726],"about_ca_topic_score_codex":0.0006134818,"about_ca_topic_score_gemma":0.00059622846,"teacher_disagreement_score":0.0013506261,"about_ca_system_score_codex":0.00070956897,"about_ca_system_score_gemma":0.0004659515,"threshold_uncertainty_score":0.006507933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028602833,0.0012538804,0.95280886,0.0018539266,0.00021336743,0.0000784881,0.000052662668,0.00022418793,0.014911772],"genre_scores_gemma":[0.8377011,0.0017852276,0.14910701,0.0011137999,0.0002325383,0.00037260776,0.00010560435,0.00043744166,0.00914468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777395,0.001160042,0.00007541524,0.0002920106,0.00041539807,0.00028326912],"domain_scores_gemma":[0.9821675,0.014770106,0.0007654498,0.0008063582,0.0009552345,0.0005352302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064441417,0.00169606,0.0015500647,0.0010887609,0.0012451397,0.0021852425,0.0013631313,0.0017651141,0.0034695116],"category_scores_gemma":[0.039996557,0.0007333848,0.0009708465,0.0006415041,0.005113989,0.0037840374,0.0030944438,0.004169783,0.0005661581],"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.00025429588,0.00008810157,0.0012054185,0.00026360256,0.00007224459,0.00026141625,0.00025246965,0.39059606,0.002904053,0.57955694,0.00410141,0.02044401],"study_design_scores_gemma":[0.000020013886,0.000056115507,0.00014944084,0.000059854854,0.000009370485,0.000043979457,0.0000262707,0.88522124,0.00056264986,0.112910636,0.00092471985,0.000015717322],"about_ca_topic_score_codex":0.0029579098,"about_ca_topic_score_gemma":0.0021194355,"teacher_disagreement_score":0.0064441417,"about_ca_system_score_codex":0.0017810074,"about_ca_system_score_gemma":0.0025630947,"threshold_uncertainty_score":0.034080267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13479565,0.0039026814,0.84046245,0.0033395782,0.00049337995,0.000057850404,0.0003246096,0.00023157138,0.016392194],"genre_scores_gemma":[0.89598197,0.0025673124,0.09150701,0.0003321869,0.00052315235,0.00012472272,0.00021123867,0.00009355102,0.00865886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896455,0.00045081612,0.00006292798,0.00019943184,0.00019892506,0.000123426],"domain_scores_gemma":[0.99580896,0.0022102098,0.00064146065,0.00044701295,0.0005729992,0.00031932627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002142818,0.00058066455,0.001065934,0.0017381103,0.0013096768,0.0027935305,0.0012118886,0.0013929848,0.003694069],"category_scores_gemma":[0.0076131183,0.0004986625,0.0008551388,0.0016666022,0.0034967528,0.005429644,0.0015215143,0.0017042974,0.0003016657],"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.000018044184,0.000015083051,0.0002859959,0.000029990026,0.000015169909,0.000016856924,0.000059403355,0.02270182,0.00034388143,0.97152317,0.00044285518,0.004547687],"study_design_scores_gemma":[0.0000031779985,0.000007758001,0.00009789265,0.000008245097,0.0000055565733,0.000011000463,0.000015444866,0.12990741,0.000093576906,0.8692053,0.0006348146,0.000009846468],"about_ca_topic_score_codex":0.0054180096,"about_ca_topic_score_gemma":0.0050747977,"teacher_disagreement_score":0.0054180096,"about_ca_system_score_codex":0.0018313166,"about_ca_system_score_gemma":0.0012822823,"threshold_uncertainty_score":0.013287246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0224633,0.00017872883,0.97385466,0.00033359145,0.000042904492,0.000015722566,0.000033669374,0.00015814243,0.0029192434],"genre_scores_gemma":[0.7858134,0.00038797248,0.20440227,0.00036483206,0.00025819938,0.00014984378,0.00018681842,0.00033105814,0.008105666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992643,0.0002241455,0.000032673168,0.00017999297,0.00022524843,0.000073648305],"domain_scores_gemma":[0.99716955,0.0012435832,0.00054607715,0.00067204866,0.00020076422,0.00016792261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010817127,0.00076723023,0.00076876604,0.00081549457,0.00045212812,0.0013485517,0.0014967232,0.0015856224,0.0023463885],"category_scores_gemma":[0.008074516,0.0004454933,0.0005324066,0.00084356946,0.0019741368,0.003668427,0.0032873722,0.002495265,0.00048895256],"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.00008412864,0.000060324244,0.00093318353,0.00011528163,0.000053497453,0.00012357692,0.00017071726,0.3004599,0.009996509,0.6320867,0.0018797382,0.054036405],"study_design_scores_gemma":[0.0000069009398,0.000039509614,0.00021271998,0.000009999451,0.000005161807,0.00003599128,0.00000913989,0.83194625,0.0014367434,0.16523686,0.0010494076,0.000011297952],"about_ca_topic_score_codex":0.00073438353,"about_ca_topic_score_gemma":0.0009299656,"teacher_disagreement_score":0.0023463885,"about_ca_system_score_codex":0.0009964007,"about_ca_system_score_gemma":0.00062237435,"threshold_uncertainty_score":0.007849455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027015964,0.00022363679,0.9706354,0.00035420523,0.000038546874,0.000073221294,0.00020633356,0.0008624726,0.0005901186],"genre_scores_gemma":[0.5329668,0.00024278318,0.46063843,0.00029003064,0.00018267606,0.0004400692,0.0018427621,0.00020485262,0.0031916199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831855,0.00045158667,0.0001167728,0.00042032715,0.0005248303,0.00016804333],"domain_scores_gemma":[0.99327326,0.0046047973,0.00037814595,0.00057952164,0.0009854253,0.00017877552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022449573,0.00088628486,0.0022230293,0.001369962,0.0007240415,0.0020280802,0.0028039974,0.002037467,0.00272533],"category_scores_gemma":[0.010589466,0.0007750364,0.0012902686,0.0011369691,0.0010531072,0.0021972437,0.0028254609,0.0021420626,0.0009693063],"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.0010825263,0.00046028564,0.0059282854,0.00028257436,0.00016570599,0.0002143714,0.00017148827,0.3267467,0.012166061,0.020059368,0.0055799005,0.62714267],"study_design_scores_gemma":[0.000029618932,0.00004080519,0.00032039863,0.00000767049,0.000017497201,0.00003765447,0.000010431706,0.989365,0.0019712436,0.007852224,0.00034041153,0.0000069119496],"about_ca_topic_score_codex":0.002995303,"about_ca_topic_score_gemma":0.0039296206,"teacher_disagreement_score":0.002995303,"about_ca_system_score_codex":0.0012892766,"about_ca_system_score_gemma":0.0020574038,"threshold_uncertainty_score":0.011872649},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010197744,0.00021610045,0.9856376,0.0001479768,0.00005007291,0.000049710212,0.000029186054,0.00043652448,0.003235134],"genre_scores_gemma":[0.7129414,0.00024649155,0.28133783,0.00023167556,0.00007539516,0.00031802332,0.0001497414,0.00014169878,0.004557762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986993,0.00046382938,0.00006313414,0.00023169396,0.00039051127,0.00015155005],"domain_scores_gemma":[0.9966659,0.0021158766,0.0002580986,0.00038585524,0.0004205177,0.00015383605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001922425,0.000904548,0.0015063938,0.0005628992,0.00045492177,0.0011484108,0.0017532787,0.0012838452,0.0028093155],"category_scores_gemma":[0.00905413,0.0005088448,0.0005976161,0.0006327258,0.0012886525,0.0013122658,0.0017756772,0.0017711552,0.0005629229],"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.00013253544,0.000068234585,0.0005937805,0.000067042056,0.000038389793,0.000051879553,0.0000657777,0.90023994,0.00079923763,0.0366219,0.0012757787,0.060045525],"study_design_scores_gemma":[0.0000071352874,0.0000158301,0.000021521157,0.0000038727126,0.0000023258167,0.000009556359,0.0000023281293,0.9938167,0.00021595242,0.005627007,0.00027531266,0.0000024223725],"about_ca_topic_score_codex":0.0031686618,"about_ca_topic_score_gemma":0.0024141395,"teacher_disagreement_score":0.0031686618,"about_ca_system_score_codex":0.001199381,"about_ca_system_score_gemma":0.0021018733,"threshold_uncertainty_score":0.0101668835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088224765,0.0017008372,0.94342357,0.0057999515,0.0003992537,0.00012408069,0.00033283327,0.00025162753,0.0391455],"genre_scores_gemma":[0.66578126,0.005135547,0.27244335,0.005712948,0.001275977,0.0015057822,0.00054333254,0.00085004803,0.046751752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983089,0.0007524201,0.000067702305,0.0003973024,0.00029361772,0.00018012346],"domain_scores_gemma":[0.99180603,0.0064268373,0.00045133574,0.00051289616,0.00048418765,0.00031880365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046225996,0.0021386743,0.0017712648,0.00097331416,0.001266527,0.0031190873,0.0022961916,0.0027937058,0.013197698],"category_scores_gemma":[0.021867957,0.00077212567,0.0018498721,0.0009071917,0.004976314,0.009314742,0.0037497268,0.0070886244,0.001500913],"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.00005802869,0.000038243077,0.00027548333,0.00020541961,0.00006627672,0.00007133254,0.00014177596,0.054161754,0.00057782367,0.92191017,0.010183955,0.012309748],"study_design_scores_gemma":[0.000021623211,0.000043257085,0.000119650285,0.00009419633,0.000018662518,0.000049872862,0.000026159669,0.18371749,0.00031304712,0.8112245,0.0043454356,0.000026201467],"about_ca_topic_score_codex":0.0021403306,"about_ca_topic_score_gemma":0.001831674,"teacher_disagreement_score":0.013197698,"about_ca_system_score_codex":0.002609964,"about_ca_system_score_gemma":0.002099438,"threshold_uncertainty_score":0.04415065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06891219,0.0017407868,0.919474,0.0021834401,0.00011437516,0.000070132104,0.0009751533,0.0018611854,0.0046686763],"genre_scores_gemma":[0.8381957,0.0010852339,0.15593284,0.0006090891,0.00021065302,0.00016992466,0.0017566711,0.00080825674,0.0012317486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99146783,0.0044097705,0.0004797743,0.0013165218,0.0019481978,0.00037802794],"domain_scores_gemma":[0.93815523,0.046054643,0.003797666,0.00651987,0.0045241914,0.00094835286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021367528,0.0024134365,0.0023540165,0.0027128947,0.00079405104,0.0056269555,0.0030800076,0.0035312742,0.002304031],"category_scores_gemma":[0.13013369,0.0011283557,0.0013130353,0.0023445862,0.0025863426,0.011984298,0.0040501733,0.0045579304,0.001146372],"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.00037518845,0.00011722996,0.013650206,0.00027256028,0.00038874635,0.00008457748,0.0002539606,0.857094,0.001327779,0.037491202,0.0033790155,0.085565545],"study_design_scores_gemma":[0.000017187383,0.000059930448,0.0013532041,0.000086167194,0.000032494376,0.00005408418,0.000053227912,0.9447827,0.0017757796,0.050844748,0.0008951101,0.000045375018],"about_ca_topic_score_codex":0.008246153,"about_ca_topic_score_gemma":0.006553962,"teacher_disagreement_score":0.021367528,"about_ca_system_score_codex":0.0018088802,"about_ca_system_score_gemma":0.0023895418,"threshold_uncertainty_score":0.11300367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06557621,0.0008797791,0.9132244,0.005442001,0.0001917894,0.000041614338,0.0002832445,0.0003767914,0.0139842145],"genre_scores_gemma":[0.90764385,0.00090207043,0.08325652,0.0020235395,0.0004915785,0.000107258806,0.0005140982,0.00053551415,0.0045255404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582845,0.0015769551,0.0001818839,0.001369418,0.0005711739,0.0004721855],"domain_scores_gemma":[0.9833786,0.009806916,0.0023752796,0.0030099745,0.0008925317,0.000536697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061937645,0.0009773239,0.0018227415,0.000792436,0.0005264512,0.0028435048,0.0017058273,0.002151764,0.0038659037],"category_scores_gemma":[0.041263904,0.0006552978,0.0012059308,0.0005677934,0.003509525,0.0065805637,0.0033379414,0.0034972613,0.001128975],"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.00014714134,0.00013470114,0.008615974,0.0003023557,0.0003324424,0.00024369151,0.00045026062,0.19213769,0.0022877532,0.6855067,0.008197002,0.10164429],"study_design_scores_gemma":[0.000024442867,0.00007985196,0.0022085344,0.00006277852,0.00003386366,0.000105010884,0.00008683386,0.350998,0.000594232,0.6426109,0.0031592986,0.000036273002],"about_ca_topic_score_codex":0.003077638,"about_ca_topic_score_gemma":0.001757566,"teacher_disagreement_score":0.0061937645,"about_ca_system_score_codex":0.001022432,"about_ca_system_score_gemma":0.0012699413,"threshold_uncertainty_score":0.03275621},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03328876,0.00042335666,0.960657,0.00024416397,0.00008651672,0.00008133387,0.00017480459,0.0029898242,0.0020542226],"genre_scores_gemma":[0.70141697,0.0002592043,0.28897333,0.0005548405,0.00020216483,0.00021260772,0.0010460743,0.00038415307,0.006950619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924135,0.00023165795,0.000025796364,0.00028484387,0.00014261133,0.0000737728],"domain_scores_gemma":[0.99785125,0.0010849984,0.00020790695,0.00042162577,0.00033596216,0.00009833049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018516768,0.0012249717,0.0008240847,0.00071897265,0.0003036269,0.00088323234,0.0023192447,0.001446684,0.0027968439],"category_scores_gemma":[0.0052637425,0.0004417769,0.00075104216,0.00047312403,0.0008837045,0.0018135019,0.0016806673,0.0025732338,0.0010358834],"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.00042610735,0.0005078647,0.0023006846,0.00022283915,0.00017835056,0.00012507335,0.00015189007,0.3935792,0.023855126,0.0106205335,0.009058293,0.55897397],"study_design_scores_gemma":[0.000012998792,0.00007089737,0.0001970831,0.000008324576,0.000008210535,0.000023402225,0.00000755313,0.99340546,0.002711916,0.0030837338,0.00046367856,0.0000067374235],"about_ca_topic_score_codex":0.0019525003,"about_ca_topic_score_gemma":0.0032941347,"teacher_disagreement_score":0.0027968439,"about_ca_system_score_codex":0.0005241156,"about_ca_system_score_gemma":0.0006479112,"threshold_uncertainty_score":0.009792745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017879883,0.0027619698,0.9696311,0.0023785362,0.000095422314,0.00004164857,0.00018396675,0.00027865818,0.0067488584],"genre_scores_gemma":[0.6944119,0.007449926,0.28733957,0.0020750777,0.0011264103,0.00071221904,0.0007905199,0.00075461075,0.0053398176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98888457,0.004908401,0.0005799577,0.0014991816,0.0034479743,0.00067981717],"domain_scores_gemma":[0.91133815,0.07331554,0.0037421556,0.006474309,0.0041526007,0.0009772903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018730428,0.0022749407,0.0019723536,0.001961825,0.0009131952,0.004071752,0.0027296958,0.0031249896,0.002075005],"category_scores_gemma":[0.099743016,0.0012635033,0.0011648888,0.001358273,0.0068830345,0.008899196,0.005971637,0.0075865444,0.0008248813],"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.00014985017,0.000069352915,0.0011406704,0.0003084235,0.00008893497,0.00018143635,0.00027012156,0.28287348,0.0029378885,0.68663627,0.0025930065,0.022750456],"study_design_scores_gemma":[0.000010499129,0.00005026305,0.0003858673,0.0000779754,0.000009129598,0.00006726151,0.000030461988,0.66779983,0.0010104865,0.3294512,0.001078065,0.000028912873],"about_ca_topic_score_codex":0.0012441,"about_ca_topic_score_gemma":0.00077460264,"teacher_disagreement_score":0.018730428,"about_ca_system_score_codex":0.0021912698,"about_ca_system_score_gemma":0.0013196793,"threshold_uncertainty_score":0.0990572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014922515,0.004231634,0.940626,0.0040014205,0.00064633467,0.00036156562,0.010717679,0.0069753216,0.017517649],"genre_scores_gemma":[0.5465831,0.0035725185,0.3872391,0.0016856828,0.00060963206,0.0016515101,0.018091343,0.00097638805,0.03959071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882823,0.00043267652,0.000076406555,0.000334791,0.0001770589,0.00015078041],"domain_scores_gemma":[0.996842,0.0023295556,0.00017488145,0.00018273263,0.0003912897,0.00007940917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019775538,0.0013484361,0.0018157656,0.0017241291,0.0008701258,0.0018760095,0.0025384778,0.0020075992,0.020254672],"category_scores_gemma":[0.00674375,0.00081790675,0.0021098033,0.0017512193,0.00082487345,0.0027780952,0.0015914077,0.0027392064,0.0074202875],"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.00027318046,0.00019700793,0.003107936,0.00038798232,0.00028541067,0.0002804672,0.00018388186,0.69001555,0.00046890537,0.068959475,0.03389309,0.20194711],"study_design_scores_gemma":[0.000016811375,0.000013660853,0.000137465,0.000016965865,0.00001862465,0.00003164914,0.000013381892,0.96176505,0.000077027595,0.03472379,0.003176377,0.000009245978],"about_ca_topic_score_codex":0.028210966,"about_ca_topic_score_gemma":0.025649654,"teacher_disagreement_score":0.028210966,"about_ca_system_score_codex":0.0016869258,"about_ca_system_score_gemma":0.0021677539,"threshold_uncertainty_score":0.06775862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014707056,0.0001530097,0.99732214,0.000050621602,0.000033957225,0.0000740304,0.00008114707,0.00060396304,0.0002104273],"genre_scores_gemma":[0.06878362,0.0003345243,0.9280542,0.0000893787,0.0001216797,0.00038822784,0.0005579421,0.00015844226,0.0015119835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863714,0.00028867624,0.00013849081,0.00027983572,0.0005858008,0.00007003489],"domain_scores_gemma":[0.99580705,0.0020060984,0.00033081026,0.001095067,0.0005718912,0.0001890005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022901315,0.001155068,0.0013589367,0.0018317875,0.0005406319,0.0017047777,0.0020342031,0.0012479103,0.0045536314],"category_scores_gemma":[0.018325772,0.00064182945,0.0010012568,0.001960008,0.0008482747,0.0032438089,0.0032494967,0.002271709,0.0020694723],"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.00037224288,0.00008995598,0.0019349915,0.00037525364,0.0001519562,0.00022303508,0.00036830298,0.12695496,0.01725757,0.058541954,0.0064017097,0.78732806],"study_design_scores_gemma":[0.000058550635,0.00008156184,0.00034669254,0.00004023539,0.00002718138,0.00025527546,0.000051858104,0.9306257,0.005751018,0.056420904,0.006306062,0.000035010264],"about_ca_topic_score_codex":0.0012452969,"about_ca_topic_score_gemma":0.0016018616,"teacher_disagreement_score":0.0045536314,"about_ca_system_score_codex":0.0006983415,"about_ca_system_score_gemma":0.0014446554,"threshold_uncertainty_score":0.015233457},"labels":[],"label_agreement":null}]}