{"meta":{"query_hash":"7972bc65e4ab","filters":{"venue":"Neural Information Processing Systems"},"cohort_total":208,"direct_labels_cover":0,"predictions_cover":208,"exported":208,"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/7972bc65e4ab","api":"https://metacan.xera.ac/api/v1/cohort?venue=Neural+Information+Processing+Systems"},"results":[{"id":"W1715905486","doi":"","title":"Higgs boson discovery with boosted trees","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","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":"Simon Fraser University","funders":"","keywords":"Physics","score_opus":0.02059636200988932,"score_gpt":0.22227800264610711,"score_spread":0.2016816406362178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1715905486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8913328,0.00007640849,0.0008216696,0.00039560584,0.0007647637,0.00031523267,0.000022666562,0.00022784407,0.106043],"genre_scores_gemma":[0.99525565,0.0000013856305,0.000004703912,0.00024899543,0.00032823227,0.000025495783,0.000040290906,0.000008909338,0.004086353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910665,0.000041157382,0.00033300242,0.00008737306,0.00026025722,0.0001715858],"domain_scores_gemma":[0.9993454,0.000019556697,0.0002541286,0.00011038382,0.00022560333,0.00004490767],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016123675,0.00012952503,0.00015762055,0.00009599818,0.00044848022,0.0021471581,0.00010263507,0.000031168292,0.000039821905],"category_scores_gemma":[0.000019943653,0.00008802393,0.000027384043,0.00005324076,0.00009228556,0.004967838,0.000015463535,0.000091797185,0.00007423299],"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.00042533642,0.00026077256,0.027209241,0.0044523324,0.00017521855,0.000006205733,0.12952298,0.0061588413,0.0009442556,0.64094764,0.046833083,0.14306408],"study_design_scores_gemma":[0.0010494792,0.00040065974,0.0024109941,0.00042483618,0.000039075938,0.000020024736,0.0069540283,0.10611997,0.00062808517,0.00020661292,0.881197,0.00054924935],"about_ca_topic_score_codex":0.00025689913,"about_ca_topic_score_gemma":0.000289171,"teacher_disagreement_score":0.8343639,"about_ca_system_score_codex":0.000028729897,"about_ca_system_score_gemma":0.00003147195,"threshold_uncertainty_score":0.99888873},"labels":[],"label_agreement":null},{"id":"W2096879261","doi":"","title":"Measures of Clustering Quality: A Working Set of Axioms for Clustering","year":2008,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Axiom; Impossibility; Constrained clustering; Computer science; Correlation clustering; Theoretical computer science; Fuzzy clustering; Data mining; Mathematics; Set (abstract data type); CURE data clustering algorithm; Artificial intelligence","score_opus":0.17760896120554284,"score_gpt":0.35983169362462686,"score_spread":0.18222273241908402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096879261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015251761,0.00022664064,0.98305213,0.00007737976,0.00039992583,0.0004916431,0.000008060041,0.00015539608,0.00033707923],"genre_scores_gemma":[0.97765857,0.000009333461,0.022065684,0.00003010738,0.000077612014,0.000077598255,0.000007171937,0.000012549854,0.000061363986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974428,0.00007975425,0.0011682858,0.00019652957,0.00075520086,0.00035747423],"domain_scores_gemma":[0.99785054,0.00015601754,0.0008673548,0.00038899886,0.00065878045,0.00007828181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008386247,0.00017345208,0.00039848106,0.0003319068,0.00024931488,0.00016607672,0.0007375107,0.00008530613,4.2794284e-7],"category_scores_gemma":[0.00022711043,0.00016364871,0.00008593741,0.00060126005,0.000090670954,0.002898641,0.0002819751,0.00013932816,0.0000019225138],"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.00014885762,0.000031459334,0.00046289165,0.0067874365,0.000046011475,0.0000032481394,0.026579145,0.43813053,0.0062447167,0.00076103,0.0000431736,0.5207615],"study_design_scores_gemma":[0.0005459254,0.000091630965,0.00021162094,0.00042347424,0.0000028065858,0.000098972625,0.00077023567,0.9947432,0.0020774885,0.000022476877,0.0008380746,0.00017406497],"about_ca_topic_score_codex":0.00007649262,"about_ca_topic_score_gemma":0.0000084165595,"teacher_disagreement_score":0.9624068,"about_ca_system_score_codex":0.00008111746,"about_ca_system_score_gemma":0.00012475377,"threshold_uncertainty_score":0.6673401},"labels":[],"label_agreement":null},{"id":"W2098617596","doi":"","title":"Multi-Prediction Deep Boltzmann Machines","year":2013,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":116,"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; dBm; Restricted Boltzmann machine; Computer science; Train; Artificial intelligence; Inference; Probabilistic logic; Machine learning; Field (mathematics); Deep learning; Layer (electronics); Algorithm; Mathematics","score_opus":0.014587863853125178,"score_gpt":0.22425470366639977,"score_spread":0.20966683981327458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098617596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028999613,0.00024377625,0.9934216,0.0004444055,0.0011892151,0.00032841152,0.0000022631477,0.00032347834,0.0011468921],"genre_scores_gemma":[0.98270875,0.0000045708325,0.016388342,0.00038670024,0.00019729346,0.00008628227,0.000016273665,0.000005718877,0.00020604767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887824,0.000060909922,0.00044204795,0.00014702129,0.00024877742,0.00022300985],"domain_scores_gemma":[0.9991047,0.000020179546,0.00024587577,0.000221408,0.00032807793,0.00007975916],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001635978,0.00014455477,0.00014024286,0.00011886451,0.00030558254,0.0015462348,0.0003685717,0.00006366338,0.000012016296],"category_scores_gemma":[0.000044422042,0.00011385715,0.00004085852,0.00029249402,0.00002694879,0.010430579,0.000075060976,0.000102470665,0.00026553278],"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.0000042555057,0.00004303278,0.001313376,0.00026979973,0.000021923599,0.0000011063065,0.0036672044,0.16198123,0.002679079,0.000642927,0.008293755,0.8210823],"study_design_scores_gemma":[0.00018973435,0.000021036167,0.0027802947,0.000029520752,0.0000029904563,0.00001772703,0.0001304405,0.99336165,0.00015721687,0.00002598077,0.0031635026,0.00011990901],"about_ca_topic_score_codex":0.00015810874,"about_ca_topic_score_gemma":0.0000022598467,"teacher_disagreement_score":0.9798088,"about_ca_system_score_codex":0.000033550547,"about_ca_system_score_gemma":0.000024602274,"threshold_uncertainty_score":0.99949026},"labels":[],"label_agreement":null},{"id":"W2100002341","doi":"","title":"Replicated Softmax: an Undirected Topic Model","year":2009,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":442,"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":"Latent Dirichlet allocation; Softmax function; Computer science; Graphical model; Inference; Artificial intelligence; Topic model; Latent variable; Undirected graph; Dirichlet distribution; Theoretical computer science; Data mining; Machine learning; Algorithm; Graph; Deep learning; Mathematics","score_opus":0.03266415990600878,"score_gpt":0.2715287157289674,"score_spread":0.23886455582295862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100002341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04927099,0.00006550938,0.9446685,0.00078516366,0.00025162043,0.00022649091,0.0000010265169,0.0010038618,0.0037268517],"genre_scores_gemma":[0.987062,0.0000012480795,0.01162013,0.0010246102,0.000060982937,0.000014047786,0.000016230153,0.0000037508537,0.0001970434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986908,0.0000341144,0.0005033295,0.00020481285,0.0003051104,0.00026186137],"domain_scores_gemma":[0.99891937,0.000008337716,0.00024268273,0.0004939411,0.0002319308,0.00010375727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024581986,0.00012976074,0.00014820474,0.00013658249,0.0001994962,0.0008681432,0.0005798952,0.00008110482,8.156398e-7],"category_scores_gemma":[0.000037212387,0.000116340736,0.000026079948,0.00035287972,0.000009940114,0.0066399216,0.00003627888,0.00012674526,0.000020654394],"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.000008846892,0.00004689192,0.00012245381,0.0001649738,0.000004717107,0.0000020459256,0.004878316,0.36073604,0.0016074388,0.028055042,0.00063366466,0.60373956],"study_design_scores_gemma":[0.00015115883,0.00003798939,0.00025017268,0.000029387054,0.0000019191043,0.000029377752,0.00004052312,0.9978875,0.00024005986,0.00064627186,0.0005453687,0.00014029005],"about_ca_topic_score_codex":0.000022829585,"about_ca_topic_score_gemma":6.2880275e-7,"teacher_disagreement_score":0.937791,"about_ca_system_score_codex":0.000060591705,"about_ca_system_score_gemma":0.00009210513,"threshold_uncertainty_score":0.83715254},"labels":[],"label_agreement":null},{"id":"W2103255058","doi":"","title":"Relative Density Nets: A New Way to Combine Backpropagation with HMM's","year":2001,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hidden Markov model; Discriminative model; Computer science; Backpropagation; Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Feedforward neural network; Speech recognition; Feed forward; Point (geometry); Machine learning; Mathematics; Engineering","score_opus":0.01587924644970704,"score_gpt":0.2339953062531079,"score_spread":0.21811605980340087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103255058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057870794,0.000052610372,0.9325655,0.0054217232,0.00022389063,0.0006841433,0.0000011362663,0.0003844751,0.00279571],"genre_scores_gemma":[0.9932835,0.0000034211205,0.0045507764,0.0012955543,0.00010062229,0.000056210505,0.000018072706,0.000007289548,0.0006845258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875736,0.00003261955,0.00041309412,0.00020194713,0.00034595444,0.000249002],"domain_scores_gemma":[0.9988879,0.000030538602,0.0002937749,0.00030547977,0.00030000825,0.00018230722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014575264,0.00016008844,0.00016349164,0.00011526745,0.0003235902,0.0008077857,0.00037862035,0.000054095985,0.000002376299],"category_scores_gemma":[0.000017408658,0.00012228168,0.000024557026,0.0010554227,0.000020334826,0.005291508,0.0000739923,0.0001478246,0.00014493361],"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.00016031263,0.00011533866,0.0031896576,0.00026611742,0.000040270395,0.000015641575,0.0096089365,0.11236047,0.0011419182,0.10423432,0.047113825,0.7217532],"study_design_scores_gemma":[0.00079699006,0.00028910767,0.0046366374,0.00026879486,0.000012066244,0.00031998058,0.00020215969,0.92994434,0.00049641496,0.00070695573,0.06186639,0.00046014643],"about_ca_topic_score_codex":0.000112084876,"about_ca_topic_score_gemma":0.0000144698115,"teacher_disagreement_score":0.9354127,"about_ca_system_score_codex":0.000062596875,"about_ca_system_score_gemma":0.00006459806,"threshold_uncertainty_score":0.7789496},"labels":[],"label_agreement":null},{"id":"W2104291768","doi":"","title":"Randomized Experimental Design for Causal Graph Discovery","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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":"McGill University","funders":"","keywords":"Logarithm; Graph; Computer science; Complement (music); Comparability graph; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Line graph; Pathwidth","score_opus":0.02042628929663891,"score_gpt":0.2727784671030319,"score_spread":0.25235217780639296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104291768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030017924,0.00015184702,0.99416345,0.0001957214,0.0009562696,0.00059273985,0.0000012166503,0.0002850776,0.0006518879],"genre_scores_gemma":[0.9841264,7.901112e-7,0.014898874,0.0002734519,0.00016764703,0.00025141588,0.000014146771,0.000007026277,0.00026023888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867916,0.00021515894,0.0004749293,0.00014742339,0.00026498744,0.00021835817],"domain_scores_gemma":[0.9990907,0.00022423545,0.00033887394,0.00018108483,0.00010756589,0.000057550948],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011335941,0.00014652719,0.00028753417,0.00013021627,0.0002884091,0.0015278851,0.00035009562,0.000049520768,6.809835e-7],"category_scores_gemma":[0.0001608859,0.000109412795,0.00008746795,0.00017576273,0.00003969524,0.004650958,0.000044095093,0.000093104776,0.000012771556],"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.008211287,0.00019743113,0.00008838334,0.0021340628,0.00011460194,0.000002181797,0.023754336,0.41526842,0.0017701003,0.25753936,0.008103143,0.28281668],"study_design_scores_gemma":[0.01689305,0.00007452255,0.0000034983084,0.000047401576,0.0000045823726,0.000019792902,0.00008652284,0.97988075,0.0008195714,0.00027338986,0.0017466487,0.00015024863],"about_ca_topic_score_codex":0.000028830042,"about_ca_topic_score_gemma":7.432349e-8,"teacher_disagreement_score":0.98112464,"about_ca_system_score_codex":0.000021688053,"about_ca_system_score_gemma":0.000037206057,"threshold_uncertainty_score":0.9995086},"labels":[],"label_agreement":null},{"id":"W2105934955","doi":"","title":"An Infinite Factor Model Hierarchy Via a Noisy-Or Mechanism","year":2009,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Latent variable; Computer science; Generative model; Latent variable model; Factor analysis; Generative grammar; Factor (programming language); Conditional probability distribution; Hierarchy; Factorial; Artificial intelligence; Bayesian probability; Layer (electronics); Machine learning; Mathematics; Econometrics","score_opus":0.031398412049453414,"score_gpt":0.29528499871180036,"score_spread":0.26388658666234693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105934955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037684867,0.0000470234,0.9934989,0.00035464996,0.00032293983,0.0003115948,0.0000059186177,0.0004863841,0.0012041054],"genre_scores_gemma":[0.8153741,0.0000028378915,0.18251114,0.0018672534,0.00007632085,0.00002032431,0.000008694994,0.0000067134347,0.00013267009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982871,0.00009483152,0.00060581364,0.00023102925,0.00043420884,0.00034704473],"domain_scores_gemma":[0.9987591,0.00002115161,0.0003376668,0.00044898107,0.0002448793,0.0001882375],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035709993,0.00022512003,0.0002473201,0.00024886566,0.00027079723,0.0012676384,0.00072466454,0.0001382276,0.000002264059],"category_scores_gemma":[0.000024319193,0.000168113,0.000050723953,0.000441298,0.000016303668,0.0098100975,0.00004242819,0.00021279014,0.000020685278],"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.000026439997,0.00004023771,0.0000029517953,0.00016784202,0.000004585594,0.000003741764,0.007695881,0.0077065052,0.0033306598,0.08857919,0.0001306047,0.89231133],"study_design_scores_gemma":[0.0002437896,0.00017135369,0.000027808193,0.000052493517,0.0000031644688,0.00007194201,0.00002401556,0.9847783,0.0007237761,0.01331835,0.0003490588,0.00023593471],"about_ca_topic_score_codex":0.000010433759,"about_ca_topic_score_gemma":6.9045274e-7,"teacher_disagreement_score":0.9770718,"about_ca_system_score_codex":0.000048273512,"about_ca_system_score_gemma":0.00014266097,"threshold_uncertainty_score":0.99976915},"labels":[],"label_agreement":null},{"id":"W2106662462","doi":"","title":"Convex Deep Learning via Normalized Kernels","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Deep learning; Computer science; Heuristics; Parametric statistics; Range (aeronautics); Artificial intelligence; Regular polygon; Nonparametric statistics; Machine learning; Layer (electronics); Kernel (algebra); Mathematical optimization; Mathematics; Engineering","score_opus":0.007515000331167515,"score_gpt":0.2033569785074465,"score_spread":0.195841978176279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106662462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113705374,0.00054337905,0.8485052,0.000035387377,0.0010532347,0.00034439977,0.0000010620125,0.0046607875,0.031151164],"genre_scores_gemma":[0.99926084,0.000009251886,0.00035633624,0.00011384224,0.00012888499,0.000024660512,0.000022830065,0.000021110032,0.00006221567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990071,0.000043769123,0.00042709586,0.000078370285,0.00021118321,0.00023244659],"domain_scores_gemma":[0.99948126,0.00002786109,0.00014484036,0.00013686113,0.00014773473,0.00006141721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017914655,0.00016580215,0.00020883867,0.00012776302,0.00015374794,0.00033695556,0.00013630201,0.00009821476,0.000008160293],"category_scores_gemma":[0.000034904504,0.00015571114,0.0000384041,0.00016363723,0.000024049952,0.0014746902,0.000021025638,0.00021456456,0.00009460228],"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.000016355914,0.000007354819,0.0005509456,0.0005725267,0.000025598389,0.000001657613,0.0021381346,0.64811486,0.007866947,0.0004685887,0.001387825,0.3388492],"study_design_scores_gemma":[0.00019136007,0.000024387646,0.00013817512,0.00010552311,0.0000071755335,0.000042367792,0.00010645065,0.9615414,0.0038330609,0.00003714442,0.03378402,0.00018894134],"about_ca_topic_score_codex":0.000022693946,"about_ca_topic_score_gemma":6.606651e-7,"teacher_disagreement_score":0.8855555,"about_ca_system_score_codex":0.000035896115,"about_ca_system_score_gemma":0.0000060174852,"threshold_uncertainty_score":0.63497156},"labels":[],"label_agreement":null},{"id":"W2112518971","doi":"","title":"Fast Bayesian Inference for Non-Conjugate Gaussian Process Regression","year":2012,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Gaussian process; Inference; Algorithm; Mathematical optimization; Mathematics; Computer science; Ordinal regression; Convergence (economics); Approximate inference; Gaussian; Conjugate prior; Bayesian probability; Artificial intelligence; Bayes' theorem; Machine learning","score_opus":0.018701152931170816,"score_gpt":0.28794862034905533,"score_spread":0.2692474674178845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112518971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004524002,0.00023648386,0.98751587,0.00064845185,0.0012695647,0.00086839497,0.000013918126,0.00045353392,0.004469765],"genre_scores_gemma":[0.99210167,0.0000071521686,0.006532552,0.00044902577,0.00030797388,0.00035056577,0.000038891998,0.000020033212,0.00019213266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719965,0.000044983735,0.0009529512,0.0003293062,0.00058183214,0.0008912851],"domain_scores_gemma":[0.99763584,0.00007125697,0.00085895346,0.000497266,0.0005789672,0.00035769978],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0005477666,0.0004027514,0.00039501593,0.000303149,0.0006338003,0.0017322993,0.0011099677,0.00020096434,0.0000070978494],"category_scores_gemma":[0.00013540054,0.00030856737,0.000090196314,0.0008024029,0.00006651104,0.016125694,0.00013192258,0.00025850107,0.00007989523],"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.00016004534,0.00037715948,0.013859726,0.0150067005,0.000066435714,0.000005539233,0.042793818,0.003745467,0.0010506002,0.08928427,0.0049044,0.82874584],"study_design_scores_gemma":[0.0009389976,0.00018817632,0.001877863,0.0010340032,0.000020838215,0.00013755597,0.0011106561,0.9833688,0.0026537003,0.0011369059,0.006658485,0.00087402854],"about_ca_topic_score_codex":0.000015423502,"about_ca_topic_score_gemma":0.0000010986419,"teacher_disagreement_score":0.9875777,"about_ca_system_score_codex":0.00007604884,"about_ca_system_score_gemma":0.00026266274,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W2114960120","doi":"","title":"Stochastic Ratio Matching of RBMs for Sparse High-Dimensional Inputs","year":2013,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Bottleneck; Encoder; Estimator; Feature (linguistics); Algorithm; Matching (statistics); Feature vector; Sampling (signal processing); Feature matching; Artificial intelligence; Pattern recognition (psychology); Feature extraction; Mathematics","score_opus":0.0189065197988435,"score_gpt":0.23986428295482093,"score_spread":0.22095776315597743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114960120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035849664,0.000034426357,0.9623456,0.0003875298,0.00048240702,0.00052272074,0.0000030591875,0.00015198482,0.00022260446],"genre_scores_gemma":[0.97943676,1.8498312e-7,0.019704323,0.00048509074,0.00004479522,0.00010855588,0.000024664952,0.000006924693,0.00018873192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985924,0.000033774995,0.0006571658,0.00013177881,0.00037678808,0.00020810177],"domain_scores_gemma":[0.99860024,0.00008341062,0.0005844324,0.00017177853,0.00048470325,0.00007544141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031246518,0.00012944352,0.00018764051,0.00017715176,0.00021856863,0.0006134624,0.0003023179,0.000058692112,0.000005951295],"category_scores_gemma":[0.000090788104,0.000112948685,0.00004188515,0.00024132108,0.000028535811,0.0050804815,0.000056668185,0.00010170473,0.000059736092],"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.00000914469,0.000016376309,0.00001157044,0.00037085806,0.000007732143,1.3710095e-7,0.0039172107,0.93216056,0.0022542435,0.0228271,0.00070557755,0.037719492],"study_design_scores_gemma":[0.00039157315,0.0000407379,0.00016646928,0.00010378391,0.000003286898,0.000012766626,0.00015907711,0.997908,0.00023026476,0.0006650397,0.0001920992,0.00012688036],"about_ca_topic_score_codex":0.00004429453,"about_ca_topic_score_gemma":5.8352714e-7,"teacher_disagreement_score":0.94358706,"about_ca_system_score_codex":0.000033283835,"about_ca_system_score_gemma":0.000112289265,"threshold_uncertainty_score":0.5915632},"labels":[],"label_agreement":null},{"id":"W2115253045","doi":"","title":"Off-policy Learning with Options and Recognizers","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","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 Alberta; McGill University","funders":"","keywords":"Variance (accounting); Computer science; Convergence (economics); Function (biology); Temporal difference learning; Reinforcement learning; Sampling (signal processing); Filter (signal processing); Function approximation; State (computer science); Importance sampling; Artificial intelligence; Policy learning; Algorithm; Machine learning; Mathematical optimization; Mathematics; Statistics; Artificial neural network","score_opus":0.012605854074279685,"score_gpt":0.24240306836910663,"score_spread":0.22979721429482694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115253045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009853139,0.00027497616,0.9760786,0.0017163832,0.00015179915,0.00029161098,4.689744e-7,0.0005965691,0.011036415],"genre_scores_gemma":[0.98758024,0.000031052597,0.010622482,0.00036900313,0.00012225177,0.000023146391,0.000008981962,0.000007942617,0.0012348937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889547,0.0000449528,0.0003727642,0.00012940656,0.00031883531,0.00023860266],"domain_scores_gemma":[0.9991945,0.000033627366,0.00033084405,0.00016074826,0.00019391,0.00008636154],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024765666,0.00013313605,0.0001278034,0.00024974634,0.00036900103,0.0012367069,0.00025216883,0.000053680804,0.0000014413766],"category_scores_gemma":[0.000076670505,0.000109072666,0.000015711865,0.00047545662,0.000044276792,0.0062357234,0.000073164505,0.00021733782,0.000059608934],"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.0000028911961,0.0000024733367,0.00036794718,0.00009469855,0.000004680024,2.7692812e-7,0.001984689,0.86476344,0.00001762239,0.003146747,0.00010648888,0.12950803],"study_design_scores_gemma":[0.00027736792,0.000078030534,0.00024277843,0.000092991875,0.0000037237066,0.0000817227,0.0002672425,0.95159733,0.00004167815,0.0000030846193,0.04716873,0.00014531905],"about_ca_topic_score_codex":0.00002074562,"about_ca_topic_score_gemma":9.826948e-7,"teacher_disagreement_score":0.9777271,"about_ca_system_score_codex":0.00007165846,"about_ca_system_score_gemma":0.00010365218,"threshold_uncertainty_score":0.9998001},"labels":[],"label_agreement":null},{"id":"W2119200797","doi":"","title":"An Accelerated Proximal Coordinate Gradient Method","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematical optimization; Dual (grammatical number); Convergence (economics); Proximal Gradient Methods; Computer science; Convex optimization; Empirical risk minimization; Minification; Coordinate descent; Gradient method; Regular polygon; Stochastic gradient descent; Rate of convergence; Convex function; Applied mathematics; Mathematics; Artificial intelligence; Artificial neural network; Key (lock); Geometry","score_opus":0.02352433827712829,"score_gpt":0.2919534599160039,"score_spread":0.2684291216388756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119200797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002102811,0.000019957115,0.9935266,0.0002030271,0.00050488726,0.00045008128,0.0000017353989,0.0013812786,0.0018096165],"genre_scores_gemma":[0.88010657,5.2824845e-7,0.1192678,0.00037000782,0.0000561703,0.000119170356,0.000028038063,0.000009885726,0.00004181172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830264,0.00015889067,0.0006036137,0.00023937656,0.00039704193,0.00029846837],"domain_scores_gemma":[0.99841803,0.00003922756,0.00045099572,0.00041588003,0.00053940795,0.00013644635],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076052,0.00018983304,0.00020829654,0.00030107595,0.0002847428,0.0014921457,0.0007632442,0.000087705965,0.000002449939],"category_scores_gemma":[0.00009459895,0.00016479938,0.000032353037,0.0007069946,0.000028005903,0.007238344,0.000071994604,0.00013712741,0.000023646327],"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.000027951579,0.00012373047,0.0003372301,0.00061544497,0.000017862047,0.0000017175516,0.00711765,0.16165121,0.0012795974,0.29263395,0.0017143199,0.5344793],"study_design_scores_gemma":[0.00024668564,0.00016595448,0.00013885579,0.000049231367,0.000003845661,0.00005569261,0.000068202105,0.99536383,0.001340981,0.00041877077,0.001944933,0.00020299961],"about_ca_topic_score_codex":0.000026230251,"about_ca_topic_score_gemma":2.757803e-7,"teacher_disagreement_score":0.8780038,"about_ca_system_score_codex":0.00006400134,"about_ca_system_score_gemma":0.00005162963,"threshold_uncertainty_score":0.9995444},"labels":[],"label_agreement":null},{"id":"W2119985666","doi":"","title":"Inferring Motor Programs from Images of Handwritten Digits","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Robot Manipulation and Learning","field":"Engineering","cited_by":32,"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":"MNIST database; Overfitting; Computer science; Digit recognition; Artificial intelligence; Classifier (UML); Set (abstract data type); Pattern recognition (psychology); Class (philosophy); Numerical digit; Machine learning; Speech recognition; Artificial neural network; Mathematics","score_opus":0.016445956046660642,"score_gpt":0.2193960317840821,"score_spread":0.20295007573742146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119985666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89542705,0.0012754673,0.08548619,0.00010908075,0.0007709008,0.00067459006,0.00000822656,0.001734406,0.014514112],"genre_scores_gemma":[0.99906975,0.0000048386505,0.0005353488,0.000027303522,0.00016046458,0.000023882923,0.00006448807,0.000014395997,0.00009951482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990399,0.000013102097,0.00051981746,0.00006160043,0.00021099084,0.00015461964],"domain_scores_gemma":[0.9995728,0.000015435844,0.0001578393,0.00009956751,0.00010534174,0.00004897701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082935614,0.000120913945,0.00016273225,0.00011838011,0.000067789806,0.00032382642,0.000102201724,0.00006390108,0.000010603296],"category_scores_gemma":[0.000022867145,0.00011322799,0.00003440302,0.00015455222,0.00001642057,0.0028578623,0.000014600648,0.00012189956,0.000050745493],"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.0000052111404,0.000006971934,0.0028443004,0.00041891166,0.000011972746,2.287467e-7,0.0016953103,0.75796705,0.0016278245,0.00003313439,0.00016716353,0.23522192],"study_design_scores_gemma":[0.00023996735,0.000014543545,0.0036107956,0.00018743798,0.000006320271,0.00000550551,0.0002954076,0.9856609,0.0011781097,0.0000026949413,0.008658101,0.00014018672],"about_ca_topic_score_codex":0.00003123598,"about_ca_topic_score_gemma":0.0000015270036,"teacher_disagreement_score":0.23508173,"about_ca_system_score_codex":0.00003858403,"about_ca_system_score_gemma":0.000010871495,"threshold_uncertainty_score":0.46173033},"labels":[],"label_agreement":null},{"id":"W2121328774","doi":"","title":"Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions","year":2012,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Counterfactual thinking; Computer science; Monte Carlo tree search; Regret; Monte Carlo method; Mathematical optimization; Game tree; Thompson sampling; Limit (mathematics); Minification; Tree (set theory); Algorithm; Mathematics; Game theory; Repeated game; Machine learning; Mathematical economics; Statistics","score_opus":0.03613825230177032,"score_gpt":0.27688978012022736,"score_spread":0.24075152781845705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121328774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5994927,0.00029467035,0.39650413,0.00029533936,0.0010445707,0.0004798117,0.0000046169616,0.00029199655,0.0015921197],"genre_scores_gemma":[0.9985308,0.000002324427,0.0010478948,0.00014634918,0.00008326397,0.00006677184,0.0000041090375,0.000008438375,0.000110031055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983499,0.00005812383,0.00058902445,0.00015278195,0.00046840854,0.00038177078],"domain_scores_gemma":[0.99898124,0.000054244592,0.0003667512,0.00026140115,0.00024319494,0.000093170136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003018792,0.00017463411,0.00017381081,0.00028237407,0.00018485694,0.0006319874,0.00034795387,0.000084412575,0.000004374629],"category_scores_gemma":[0.00005433799,0.00013869724,0.00002938258,0.0005879015,0.000052316736,0.0046495614,0.00005704898,0.0001709925,0.000076494296],"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.000036391393,0.00007355898,0.0076111387,0.00018348558,0.000010048412,0.0000018243321,0.03354396,0.92466813,0.0000664827,0.0022257145,0.000533551,0.031045724],"study_design_scores_gemma":[0.000111712805,0.00004089285,0.0019311005,0.00014744548,0.0000044813683,0.00006809832,0.0026907674,0.9916565,0.00061422173,0.0000032901162,0.0025460648,0.00018544261],"about_ca_topic_score_codex":0.00013268917,"about_ca_topic_score_gemma":0.000013715649,"teacher_disagreement_score":0.39903808,"about_ca_system_score_codex":0.00015695338,"about_ca_system_score_gemma":0.00007887545,"threshold_uncertainty_score":0.6094269},"labels":[],"label_agreement":null},{"id":"W2121331909","doi":"","title":"Generating more realistic images using gated MRF's","year":2010,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":63,"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":"Artificial intelligence; Computer science; Inpainting; Pixel; Probabilistic logic; Pattern recognition (psychology); Set (abstract data type); Statistical model; Latent variable; Image (mathematics); Computer vision; Generative model; Image resolution; Generative grammar","score_opus":0.01859920218874686,"score_gpt":0.26075077497891375,"score_spread":0.24215157279016689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121331909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040064506,0.00008330918,0.956621,0.00029690802,0.0016411731,0.0002251445,0.0000062572794,0.00028085455,0.0007808462],"genre_scores_gemma":[0.9540377,0.000001302426,0.045154132,0.00032718142,0.00037990318,0.000010374482,0.000017576891,0.000009048377,0.00006273183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985948,0.00006383815,0.00053409394,0.00019171185,0.0003209272,0.0002945889],"domain_scores_gemma":[0.9987279,0.000037604612,0.00040292778,0.00030918975,0.00042717438,0.000095160525],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035024816,0.00018447179,0.0001912383,0.00013457949,0.0005229588,0.0018753775,0.00043954307,0.00009049612,0.0000049934274],"category_scores_gemma":[0.00014236945,0.0001557925,0.00004416139,0.00042425998,0.00005490374,0.005645065,0.000096998825,0.00023682171,0.00001670272],"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.000008625717,0.000027446436,0.00027351588,0.00034551605,0.00002261335,0.000009298166,0.0032923848,0.6970004,0.13040076,0.002118555,0.0027735056,0.16372736],"study_design_scores_gemma":[0.00013793737,0.000012209554,0.0000857714,0.000046494242,0.0000066454695,0.00007323861,0.00011879038,0.9941469,0.003357136,0.000017992581,0.0018072603,0.00018966124],"about_ca_topic_score_codex":0.00018366093,"about_ca_topic_score_gemma":0.0000036754616,"teacher_disagreement_score":0.9139732,"about_ca_system_score_codex":0.000030024476,"about_ca_system_score_gemma":0.000097519995,"threshold_uncertainty_score":0.99916077},"labels":[],"label_agreement":null},{"id":"W2123094878","doi":"","title":"Tree-Structured Stick Breaking for Hierarchical Data","year":2010,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":137,"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; Markov chain Monte Carlo; Hierarchical database model; Tree structure; Cluster analysis; Tree (set theory); Hierarchical clustering; Bayesian inference; Data mining; Algorithm; Bayesian probability; Theoretical computer science; Mathematics; Artificial intelligence; Binary tree","score_opus":0.037330696542404354,"score_gpt":0.3100610288616286,"score_spread":0.2727303323192243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123094878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014673691,0.000044103326,0.9944399,0.0005430471,0.0017299937,0.00036991143,0.000026850095,0.00023137711,0.0011474658],"genre_scores_gemma":[0.60355043,5.0269267e-7,0.39561713,0.00037597885,0.00028778872,0.00003141219,0.000071290924,0.0000074815753,0.000057994588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986669,0.000045310277,0.00048371145,0.00024851476,0.00027976005,0.00027579226],"domain_scores_gemma":[0.99857795,0.00009548951,0.00028665035,0.0007376051,0.00019700605,0.00010531085],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00066921965,0.00015045748,0.00018948785,0.00011974561,0.00027214267,0.0012033855,0.0013459979,0.00012581272,0.0000016562446],"category_scores_gemma":[0.00019869137,0.00011869318,0.000034563807,0.000234063,0.0000387472,0.0052841324,0.00021484007,0.00028829178,0.0000055662676],"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.000008552557,0.0000062452455,0.000016647244,0.00025167273,0.0000046287523,5.2392886e-7,0.0010006508,0.00005574284,0.0012700028,0.046111964,0.0013686792,0.9499047],"study_design_scores_gemma":[0.00029661617,0.000022480786,0.00013264421,0.000034029294,0.000006430737,0.000105632455,0.000019047337,0.9771347,0.00023193208,0.003097704,0.01875703,0.00016172322],"about_ca_topic_score_codex":0.000016504384,"about_ca_topic_score_gemma":0.000008229025,"teacher_disagreement_score":0.977079,"about_ca_system_score_codex":0.000010036752,"about_ca_system_score_gemma":0.00011589984,"threshold_uncertainty_score":0.99983346},"labels":[],"label_agreement":null},{"id":"W2125113755","doi":"","title":"A Better Way to Pretrain Deep Boltzmann Machines","year":2012,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":106,"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":"MNIST database; Boltzmann machine; Computer science; Restricted Boltzmann machine; Artificial intelligence; Deep belief network; Deep learning; Layer (electronics); Boltzmann constant; Generative grammar; Generative model; Pattern recognition (psychology); Machine learning; Algorithm","score_opus":0.014542773663114903,"score_gpt":0.2387916199599926,"score_spread":0.2242488462968777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125113755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009534892,0.00029973892,0.9837146,0.0011517529,0.0017896191,0.00030286636,0.0000024105273,0.0001976318,0.0030065128],"genre_scores_gemma":[0.9853023,8.1801505e-7,0.011998014,0.0018945002,0.0006150115,0.000052573097,0.000007027254,0.000006757988,0.000122967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872935,0.00007484727,0.00039586253,0.0001245014,0.00029924323,0.00037617254],"domain_scores_gemma":[0.9992371,0.00002872373,0.00017813523,0.00023633057,0.0001563525,0.0001633443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038752635,0.00015848258,0.00016028056,0.00013845353,0.00023952224,0.00088611216,0.00040360395,0.000057178662,0.000007168807],"category_scores_gemma":[0.000059281698,0.0001243911,0.000042259704,0.0003874329,0.000017099268,0.007782174,0.00010356838,0.00009913683,0.00018977019],"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.00001080536,0.00003572588,0.0019331068,0.00024603197,0.000018601397,8.6387894e-7,0.014695158,0.026740404,0.000852829,0.0018676148,0.011546652,0.9420522],"study_design_scores_gemma":[0.0001294324,0.000032001346,0.0025516779,0.000048069447,0.0000047163303,0.00002585297,0.00012334963,0.9598376,0.0005000659,0.000023893068,0.03650178,0.00022152212],"about_ca_topic_score_codex":0.000025468986,"about_ca_topic_score_gemma":0.0000015808284,"teacher_disagreement_score":0.97576743,"about_ca_system_score_codex":0.000037879534,"about_ca_system_score_gemma":0.000014829809,"threshold_uncertainty_score":0.85448},"labels":[],"label_agreement":null},{"id":"W2128274109","doi":"","title":"A PAC-Bayes approach to the Set Covering Machine","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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 Ottawa; Université Laval","funders":"","keywords":"Bayes' theorem; Computer science; Margin (machine learning); Naive Bayes classifier; Perspective (graphical); Machine learning; Set (abstract data type); Artificial intelligence; Bayesian probability; Data mining; Support vector machine","score_opus":0.014724869340385686,"score_gpt":0.24588148723495934,"score_spread":0.23115661789457365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128274109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042662006,0.0002542166,0.9815407,0.0035020686,0.00044112417,0.00031440007,0.000005549433,0.00045439455,0.009221349],"genre_scores_gemma":[0.9891345,0.0000013397439,0.008568099,0.0015212607,0.0002857346,0.00005221211,0.0000155095,0.000006310706,0.0004150674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877566,0.00006321532,0.000374897,0.00015177773,0.00038617075,0.00024829028],"domain_scores_gemma":[0.99928796,0.00002678383,0.0001997105,0.0003026044,0.00009938284,0.00008353829],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00048842846,0.00014202192,0.00013307949,0.000112149704,0.0003989533,0.0014248001,0.00069299183,0.000039352086,0.0000015326037],"category_scores_gemma":[0.000052572486,0.00009106803,0.00003510486,0.00046200608,0.0000131440165,0.0027544037,0.00013472629,0.00021489503,0.00014733615],"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.0000047817994,0.00001798494,0.00016824444,0.00021670581,0.000007030527,3.8132993e-7,0.011761708,0.45746732,0.000019962847,0.004129654,0.0039950353,0.5222112],"study_design_scores_gemma":[0.00011289921,0.000020270705,0.00014437588,0.000030920863,0.0000016730803,0.00007119329,0.00015759483,0.8655811,0.000026579195,0.000005954058,0.13373443,0.000112983806],"about_ca_topic_score_codex":0.0000920684,"about_ca_topic_score_gemma":0.0000017118269,"teacher_disagreement_score":0.9848683,"about_ca_system_score_codex":0.000040493025,"about_ca_system_score_gemma":0.000036456564,"threshold_uncertainty_score":0.9996118},"labels":[],"label_agreement":null},{"id":"W2133552775","doi":"","title":"Learning from Limited Demonstrations","year":2013,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Variety (cybernetics); Task (project management); Key (lock); Path (computing); Artificial intelligence; Machine learning; Mathematical optimization; Temporal difference learning; Mathematics","score_opus":0.01983794697850236,"score_gpt":0.22507605906335879,"score_spread":0.20523811208485643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133552775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013337124,0.0000697689,0.97600037,0.0004689774,0.0005264495,0.00032851714,4.7615495e-7,0.00071104115,0.0085572535],"genre_scores_gemma":[0.9931545,0.0000036235213,0.0057827546,0.00029487308,0.00007321599,0.00006198107,0.000049268467,0.0000066556786,0.0005730748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855167,0.00007156991,0.0005813006,0.0001402922,0.00040131685,0.000253846],"domain_scores_gemma":[0.9988053,0.00007767429,0.0004257515,0.00025445776,0.00034565965,0.00009114947],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014591245,0.00014461976,0.0001391362,0.00015932781,0.00038891882,0.0026836635,0.0005030924,0.00008430407,0.000020143767],"category_scores_gemma":[0.00012265227,0.00013072099,0.00003507361,0.0004300872,0.000028397819,0.009905141,0.00009446697,0.00026924637,0.00082338986],"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":[6.565448e-7,0.0000046622768,0.0014272155,0.00006763845,0.000007914984,4.025693e-7,0.0021737805,0.9477512,0.0002316718,0.0012354378,0.0016288587,0.045470513],"study_design_scores_gemma":[0.00015669451,0.00004010701,0.0015992495,0.000055359433,0.0000033131932,0.000009655053,0.00038651977,0.99199134,0.000092372386,0.000034484572,0.005478017,0.00015287839],"about_ca_topic_score_codex":0.00018141768,"about_ca_topic_score_gemma":4.5504657e-7,"teacher_disagreement_score":0.97981745,"about_ca_system_score_codex":0.000048863283,"about_ca_system_score_gemma":0.00006543627,"threshold_uncertainty_score":0.9999546},"labels":[],"label_agreement":null},{"id":"W2134042548","doi":"","title":"Convergent Temporal-Difference Learning with Arbitrary Smooth Function Approximation","year":2009,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":168,"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; McGill University","funders":"","keywords":"Temporal difference learning; Function approximation; Stochastic approximation; Markov decision process; Mathematics; Function (biology); Stochastic gradient descent; Bellman equation; Mathematical optimization; Convergence (economics); Nonlinear system; Approximation algorithm; Artificial neural network; Gradient descent; Approximation error; Markov process; Rate of convergence; Algorithm; Applied mathematics; Reinforcement learning; Computer science; Artificial intelligence; Key (lock)","score_opus":0.014547591731831377,"score_gpt":0.22033568944607174,"score_spread":0.20578809771424036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134042548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014030971,0.000066003995,0.98026335,0.00029328323,0.0003826908,0.0003897695,2.9524543e-7,0.00073911034,0.0038345181],"genre_scores_gemma":[0.9948147,0.0000036058846,0.004097127,0.00048790328,0.000063171705,0.000024623847,0.00005705701,0.000007337842,0.00044449922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811894,0.00007744353,0.0006156633,0.00021243721,0.00067048863,0.0003050246],"domain_scores_gemma":[0.99859214,0.00002447851,0.0007143242,0.00027076117,0.0003032678,0.00009501889],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00030861658,0.0002223608,0.00020097774,0.00022021255,0.00038045464,0.001254692,0.00039402695,0.000091192676,0.0000029558971],"category_scores_gemma":[0.00003746253,0.00017817388,0.000034208504,0.00057143037,0.000029080295,0.0058340267,0.00003667051,0.0003370327,0.000058035308],"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.000038115042,0.000021407272,0.0020646635,0.0003278746,0.000010719106,0.0000019786874,0.0025885662,0.8960687,0.0002584095,0.007980965,0.00019803701,0.09044057],"study_design_scores_gemma":[0.00038423904,0.00043890125,0.004044361,0.00015669859,0.000007907748,0.0000324485,0.00027609308,0.9909536,0.00014832344,0.00005426573,0.0032596048,0.0002435369],"about_ca_topic_score_codex":0.000016645883,"about_ca_topic_score_gemma":2.6021738e-7,"teacher_disagreement_score":0.9807837,"about_ca_system_score_codex":0.00008591708,"about_ca_system_score_gemma":0.0001059508,"threshold_uncertainty_score":0.9997821},"labels":[],"label_agreement":null},{"id":"W2134461419","doi":"","title":"Multi-Step Dyna Planning for Policy Evaluation and Control","year":2009,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Feature (linguistics); Bellman equation; Function (biology); Mathematical optimization","score_opus":0.17802018545823417,"score_gpt":0.4527883759956488,"score_spread":0.27476819053741464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134461419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040020686,0.0003861686,0.95237356,0.0025264327,0.0011497656,0.0014659115,0.00003924282,0.00016910488,0.0018691143],"genre_scores_gemma":[0.9975212,3.1809347e-7,0.0012625101,0.0006855381,0.00015526921,0.000030538555,0.000038263086,0.000002664176,0.00030365953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976006,0.00009385308,0.00079102174,0.00025135907,0.0010497007,0.00021346076],"domain_scores_gemma":[0.9981327,0.00021677536,0.0005306445,0.00028947767,0.0007542118,0.000076214455],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005408724,0.00011099596,0.00017825917,0.0004747189,0.00041765615,0.0025467966,0.0003060872,0.00004434543,0.0000027574945],"category_scores_gemma":[0.002776882,0.000082474755,0.00003456814,0.0005453424,0.000031249976,0.0026445275,0.000033742723,0.000055862984,0.00003076972],"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.000024751893,0.0000106908865,0.0003501039,0.00004071873,0.0000031161178,1.3234106e-7,0.0012194423,0.022202509,0.000053497803,0.0003808308,0.005195652,0.9705185],"study_design_scores_gemma":[0.0010219684,0.000048312,0.004925957,0.000050294744,0.000010060976,0.000008382541,0.0012459059,0.968052,0.0000057130637,0.00028767236,0.024247823,0.00009590589],"about_ca_topic_score_codex":0.00002369717,"about_ca_topic_score_gemma":9.394486e-7,"teacher_disagreement_score":0.9704226,"about_ca_system_score_codex":0.00005972008,"about_ca_system_score_gemma":0.00008411223,"threshold_uncertainty_score":0.99848866},"labels":[],"label_agreement":null},{"id":"W2137245235","doi":"","title":"Probabilistic Matrix Factorization","year":2007,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3578,"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; Collaborative filtering; Probabilistic logic; Matrix decomposition; Recommender system; Factorization; Statistical model; Restricted Boltzmann machine; Artificial intelligence; Machine learning; Algorithm; Deep learning","score_opus":0.018643012887590238,"score_gpt":0.27884050832867574,"score_spread":0.2601974954410855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137245235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027415683,0.00011357374,0.98921937,0.00015101641,0.0010100028,0.00041273254,0.000001288179,0.0008554342,0.005495022],"genre_scores_gemma":[0.99636173,0.0000014159232,0.0032369567,0.000102944236,0.0001049736,0.000027201651,0.000012322446,0.000005704755,0.00014673651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856275,0.000032188378,0.00066719245,0.0001368752,0.00035001533,0.00025095267],"domain_scores_gemma":[0.9989583,0.00003473028,0.00039464977,0.00025902482,0.0002765818,0.00007671397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070531794,0.00013289269,0.00014669128,0.00021170941,0.00018718687,0.0009865295,0.00041297503,0.0000882186,0.0000013863685],"category_scores_gemma":[0.000043457854,0.00010977476,0.00003264619,0.00046983958,0.000013944927,0.005152111,0.00005973685,0.00010427959,0.00003551446],"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.000019530258,0.000081025035,0.002829414,0.0026658326,0.00002179144,0.000008837572,0.009678922,0.0025118545,0.0008562928,0.29964876,0.0068751425,0.6748026],"study_design_scores_gemma":[0.00047420122,0.00015759547,0.002509893,0.00029032578,0.000007227478,0.00025890177,0.00051448046,0.87611586,0.0018953502,0.0014837524,0.115662724,0.0006296663],"about_ca_topic_score_codex":0.000052504154,"about_ca_topic_score_gemma":0.0000018564912,"teacher_disagreement_score":0.99362016,"about_ca_system_score_codex":0.00009314541,"about_ca_system_score_gemma":0.00004683565,"threshold_uncertainty_score":0.95131266},"labels":[],"label_agreement":null},{"id":"W2137312721","doi":"","title":"On-line Reinforcement Learning Using Incremental Kernel-Based Stochastic Factorization","year":2012,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Markov decision process; Computer science; Kernel (algebra); Factorization; Q-learning; Markov process; Algorithm; State space; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.045062490513218506,"score_gpt":0.28652545567702453,"score_spread":0.24146296516380603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137312721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111564975,0.00004103796,0.98591006,0.00003984713,0.0013205545,0.00043502895,6.2035593e-7,0.0004168892,0.0006794616],"genre_scores_gemma":[0.9974749,4.81468e-7,0.0018030494,0.0003163316,0.00016789374,0.000025158213,0.00007863174,0.000016418619,0.00011715381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748516,0.000096430274,0.00081333116,0.00016650763,0.00090924295,0.0005293011],"domain_scores_gemma":[0.99839085,0.000084819716,0.00081923313,0.00028816628,0.00025277745,0.00016417031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055918505,0.00026867833,0.00021556683,0.0003423405,0.00052190595,0.0008869543,0.00043112304,0.00010397096,0.000009272318],"category_scores_gemma":[0.00019521559,0.0002490108,0.000053854117,0.00052763615,0.000032064636,0.0063838596,0.000110318906,0.0003180756,0.00011277619],"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.000009596092,0.000012722172,0.00038309905,0.00014785453,0.0000069172324,2.0677555e-7,0.0010044669,0.99468833,0.00019223262,0.0020749348,0.000038222686,0.0014414442],"study_design_scores_gemma":[0.00051475153,0.00016924372,0.0000588558,0.00019085279,0.000010182851,0.000012683555,0.00016360318,0.997706,0.000524611,0.000004546228,0.0003742172,0.00027046047],"about_ca_topic_score_codex":0.000026937532,"about_ca_topic_score_gemma":6.808772e-8,"teacher_disagreement_score":0.9863184,"about_ca_system_score_codex":0.00036527507,"about_ca_system_score_gemma":0.00011438056,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W2138448681","doi":"","title":"Learning Sparse Topographic Representations with Products of Student-t Distributions","year":2002,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":129,"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":"Iterated function; Computer science; Filter (signal processing); Artificial intelligence; Pattern recognition (psychology); Product (mathematics); Wiener filter; Orientation (vector space); Algorithm; Computer vision; Mathematics","score_opus":0.03812047916899464,"score_gpt":0.2898028860270126,"score_spread":0.25168240685801796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138448681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0902554,0.00038154752,0.90413624,0.00058305264,0.00032739787,0.00040147422,0.000003632754,0.0003063394,0.0036048943],"genre_scores_gemma":[0.99328476,0.0000063246957,0.0062792194,0.00003488234,0.000037021364,0.00002823849,0.0000127999465,0.0000042163756,0.0003125342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986729,0.0001278017,0.00045239547,0.00014918161,0.00041326476,0.00018446417],"domain_scores_gemma":[0.998689,0.000045333014,0.0003939019,0.0002710047,0.0005529312,0.000047855643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032496,0.000109646324,0.00015701883,0.00020089431,0.00031512466,0.0005606598,0.0003405968,0.000035475194,0.0000031496133],"category_scores_gemma":[0.00009258146,0.00008741608,0.00002968019,0.00115951,0.000060310635,0.0038703028,0.00005247913,0.00015644568,0.000014367068],"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.000093904564,0.00077523367,0.055977385,0.004069605,0.00021504296,0.00005059624,0.09026983,0.14768264,0.008425799,0.039761893,0.0057957754,0.6468823],"study_design_scores_gemma":[0.0018457748,0.00057214074,0.017144553,0.0005223106,0.000055045963,0.00039368778,0.002251915,0.96265,0.0071581993,0.00013268362,0.0066446825,0.00062898506],"about_ca_topic_score_codex":0.000022110686,"about_ca_topic_score_gemma":4.2279717e-7,"teacher_disagreement_score":0.9030294,"about_ca_system_score_codex":0.000019695097,"about_ca_system_score_gemma":0.000029723247,"threshold_uncertainty_score":0.54064554},"labels":[],"label_agreement":null},{"id":"W2138972044","doi":"","title":"Better Approximation and Faster Algorithm Using the Proximal Average","year":2013,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":57,"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":"Smoothing; Lasso (programming language); Overhead (engineering); Regular polygon; Algorithm; Computer science; Convex function; Approximation algorithm; Graph; Point (geometry); Proximal Gradient Methods; Mathematical optimization; Smoothness; Mathematics; Theoretical computer science; Geometry","score_opus":0.014777664856310664,"score_gpt":0.2135759926542853,"score_spread":0.19879832779797466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138972044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53107876,0.0003225395,0.4648901,0.00014558445,0.00037775422,0.0008597362,0.0000033985916,0.00081948657,0.0015026527],"genre_scores_gemma":[0.99586666,0.0000033441002,0.0037103537,0.00020904884,0.000111453024,0.000056925706,0.000009571407,0.000013933149,0.000018741108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926984,0.000022475006,0.00030550556,0.00006823236,0.0001663557,0.00016757415],"domain_scores_gemma":[0.999612,0.000012588482,0.00009646988,0.00012624146,0.00012084362,0.00003186697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085376196,0.00013463612,0.000114130875,0.00007924357,0.00016225791,0.00075076654,0.00008789777,0.00006578114,0.0000044220415],"category_scores_gemma":[0.00000556426,0.00009345568,0.000018560728,0.00011241718,0.00003395602,0.0025363625,0.000026363055,0.00013571754,0.000015491836],"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.0000042394886,0.000010532284,0.00037246305,0.0006224651,0.00003682884,0.0000014172684,0.005180342,0.07373077,0.014155786,0.00012394588,0.0035014153,0.90225977],"study_design_scores_gemma":[0.00008803217,0.000008367141,0.00021578425,0.00009040521,0.0000059589393,0.00006690754,0.00024715738,0.99553823,0.0024222198,0.00006037812,0.0011339531,0.00012260796],"about_ca_topic_score_codex":0.000035483732,"about_ca_topic_score_gemma":1.617864e-7,"teacher_disagreement_score":0.92180747,"about_ca_system_score_codex":0.000028470324,"about_ca_system_score_gemma":0.00000673776,"threshold_uncertainty_score":0.72396594},"labels":[],"label_agreement":null},{"id":"W2139047169","doi":"","title":"Saliency Based on Information Maximization","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":1100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Maximization; Computer science; Measure (data warehouse); Artificial intelligence; Domain (mathematical analysis); Software deployment; Computer vision; Visual attention; Artificial neural network; Pattern recognition (psychology); Machine learning; Data mining; Cognition; Mathematics; Neuroscience; Psychology","score_opus":0.013685377700788525,"score_gpt":0.2489936841638926,"score_spread":0.23530830646310405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139047169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046592304,0.000015086427,0.9811482,0.0013289008,0.0008936291,0.00033676057,0.0000030875055,0.00072147266,0.010893673],"genre_scores_gemma":[0.9952655,0.0000014554391,0.002049647,0.0024027391,0.00008810643,0.00005016832,0.00005422576,0.000004390134,0.000083758954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833214,0.000059533308,0.00066861615,0.0001238592,0.0005980868,0.0002177331],"domain_scores_gemma":[0.998874,0.000017090017,0.00043403858,0.00025705248,0.00033813762,0.00007968293],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0003320136,0.00015493357,0.00012039464,0.00043921004,0.00032693625,0.0012905165,0.00034389106,0.00008932085,0.000010437363],"category_scores_gemma":[0.00006334373,0.00013703076,0.000048435202,0.0006836528,0.000017078444,0.016286016,0.000029841773,0.0001313438,0.00056286505],"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.000019299734,0.00004565973,0.00012396053,0.00019370967,0.000002339017,2.1039487e-7,0.0013412402,0.3093445,0.000049093953,0.010260669,0.0014938363,0.67712545],"study_design_scores_gemma":[0.00038980172,0.00009383802,0.0005923165,0.000052278894,0.0000021640856,0.000012992427,0.00008889434,0.9617987,0.00030674474,0.000023146498,0.036478665,0.000160429],"about_ca_topic_score_codex":0.000011118133,"about_ca_topic_score_gemma":7.551297e-7,"teacher_disagreement_score":0.9906063,"about_ca_system_score_codex":0.00012169831,"about_ca_system_score_gemma":0.00006843275,"threshold_uncertainty_score":0.99974626},"labels":[],"label_agreement":null},{"id":"W2141742840","doi":"","title":"The Gaussian Process Density Sampler","year":2008,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Density estimation; Gaussian process; Markov chain Monte Carlo; Probability density function; Prior probability; Gaussian; Computer science; Hyperparameter; Statistical physics; Mathematics; Bayesian probability; Algorithm; Artificial intelligence; Statistics; Physics","score_opus":0.021284168092133002,"score_gpt":0.2440894353219804,"score_spread":0.2228052672298474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141742840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05186611,0.0006437511,0.9309296,0.0037768688,0.0014910434,0.00064997084,0.000004243909,0.00095116324,0.0096872235],"genre_scores_gemma":[0.9982122,0.000023598916,0.00082048104,0.0005711128,0.00009467729,0.000058539794,0.0000054747275,0.0000071079335,0.00020679412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807906,0.000048731654,0.0006195687,0.00021564285,0.0006030728,0.00043393078],"domain_scores_gemma":[0.99841386,0.000056541685,0.00045623851,0.000442871,0.00049956207,0.00013093224],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00030212523,0.00020745363,0.00018492233,0.00009852849,0.0017299686,0.0015003196,0.0011224882,0.0000856109,0.0000022883175],"category_scores_gemma":[0.00009229948,0.00013215771,0.000049760176,0.0007000806,0.00012676611,0.0060974066,0.00010759925,0.00022836984,0.00011619054],"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.00009689452,0.00015710568,0.01509216,0.0028550504,0.000072259136,0.000069611924,0.03731124,0.0047083967,0.00017204483,0.18952198,0.023049906,0.72689337],"study_design_scores_gemma":[0.00080730004,0.00015867232,0.016790688,0.00023859098,0.000012326097,0.0024774296,0.0016283399,0.9181859,0.001029493,0.0032982996,0.054396257,0.0009766953],"about_ca_topic_score_codex":0.000042657077,"about_ca_topic_score_gemma":0.000004660129,"teacher_disagreement_score":0.9463461,"about_ca_system_score_codex":0.00004533248,"about_ca_system_score_gemma":0.00028722716,"threshold_uncertainty_score":0.99956965},"labels":[],"label_agreement":null},{"id":"W2142650989","doi":"","title":"A computational model of hippocampal function in trace conditioning","year":2008,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Memory and Neural Mechanisms","field":"Neuroscience","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":"Contiguity; Conditioning; Classical conditioning; Engram; Computer science; Hippocampal formation; Fear conditioning; Latency (audio); Stimulus (psychology); Operant conditioning; Neuroscience; Reinforcement learning; Reinforcement; Psychology; Artificial intelligence; Cognitive psychology; Mathematics","score_opus":0.10112153915296666,"score_gpt":0.29172957000027466,"score_spread":0.19060803084730799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142650989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582646,0.00002081008,0.04004849,0.000052235748,0.0002701916,0.0002551611,0.00001466047,0.0000881048,0.0009857735],"genre_scores_gemma":[0.99932796,0.0000020804016,0.00022320515,0.0002955869,0.000019908526,0.0000319336,0.000014678407,0.0000062579734,0.00007837181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986401,0.000072623494,0.00060692406,0.00013229233,0.00038471355,0.00016335462],"domain_scores_gemma":[0.9993351,0.00007319308,0.00037256128,0.00007703648,0.000096943135,0.000045179822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015776542,0.00011231392,0.00016825621,0.00021738636,0.00021881818,0.000057818725,0.0001084391,0.00006330313,0.000009092675],"category_scores_gemma":[0.00011969466,0.00010608329,0.00003237202,0.00035360936,0.00006265838,0.0026836009,0.000015031587,0.00014833838,0.000022665536],"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.00007386546,0.00002798057,0.00011128018,0.00022130164,7.181133e-7,0.0000023995049,0.0016725451,0.92930394,0.064649746,0.0023808142,0.000063346655,0.0014920364],"study_design_scores_gemma":[0.00046061142,0.0000634847,0.00019777541,0.000073523166,0.0000024460082,0.00013174409,0.00018237912,0.95119786,0.04687854,0.0006888338,0.000019497114,0.00010330716],"about_ca_topic_score_codex":0.0000038643743,"about_ca_topic_score_gemma":3.353021e-7,"teacher_disagreement_score":0.041063406,"about_ca_system_score_codex":0.00003337023,"about_ca_system_score_gemma":0.00007905738,"threshold_uncertainty_score":0.43259507},"labels":[],"label_agreement":null},{"id":"W2146412174","doi":"","title":"Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets","year":2010,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Submodular set function; Query optimization; Mathematical optimization; Set (abstract data type); Multinomial logistic regression; Greedy algorithm; Bayesian probability; Data mining; Algorithm; Machine learning; Artificial intelligence; Mathematics","score_opus":0.059531194792093976,"score_gpt":0.4010226266591596,"score_spread":0.34149143186706565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146412174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6994618,0.00008454847,0.29157153,0.0030295525,0.0021845698,0.0009544429,0.000066755674,0.00031728152,0.0023295188],"genre_scores_gemma":[0.9910201,0.000004388096,0.008039988,0.00024242455,0.00020644511,0.00005797422,0.00007586862,0.000015506148,0.00033733775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649936,0.00015109166,0.0011895534,0.00035784667,0.0013656103,0.00043655073],"domain_scores_gemma":[0.9972197,0.0005730354,0.00063892687,0.000348937,0.00096224697,0.00025716287],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019399659,0.00022763664,0.0003118643,0.00047413327,0.00055610645,0.0025114452,0.000515435,0.00019982024,0.00011873261],"category_scores_gemma":[0.0024909305,0.00017640094,0.0000500529,0.00071147416,0.0001544467,0.0087402435,0.00017022055,0.00062605954,0.00015542633],"study_design_candidate":"design_other","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.000076326294,0.000036168003,0.0029242486,0.000171176,0.000011085968,0.0000035474566,0.0020199823,0.018814303,0.00068890635,0.00011040183,0.0041509564,0.9709929],"study_design_scores_gemma":[0.00055703084,0.00010188911,0.0063994457,0.000037461396,0.000004586907,0.0001528346,0.0010292083,0.94024765,0.00018292853,0.0001071204,0.0509233,0.00025651505],"about_ca_topic_score_codex":0.000048065067,"about_ca_topic_score_gemma":0.000016532984,"teacher_disagreement_score":0.9707364,"about_ca_system_score_codex":0.00005295148,"about_ca_system_score_gemma":0.0001485167,"threshold_uncertainty_score":0.99852407},"labels":[],"label_agreement":null},{"id":"W2148186262","doi":"","title":"Wormholes Improve Contrastive Divergence","year":2003,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Range (aeronautics); Statistical physics; Computer science; Markov chain; Divergence (linguistics); Markov chain mixing time; Distribution (mathematics); Sample (material); Monte Carlo method; Algorithm; Markov property; Artificial intelligence; Applied mathematics; Markov model; Mathematics; Statistics; Bayesian probability; Machine learning; Physics; Engineering; Mathematical analysis","score_opus":0.010685311518134401,"score_gpt":0.22173733759841793,"score_spread":0.21105202608028353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148186262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037963646,0.0005470279,0.9829984,0.00020180104,0.0011775754,0.00028355676,0.0000056849885,0.0003217053,0.010667897],"genre_scores_gemma":[0.9965524,0.000007709911,0.002842475,0.0002575226,0.000037296075,0.000046443565,0.0000035232588,0.0000049717946,0.00024767313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985024,0.00004942388,0.00052057975,0.00021257832,0.00036968046,0.00034538496],"domain_scores_gemma":[0.99882716,0.00003144151,0.00039351042,0.0002621312,0.0003669732,0.00011879607],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00026221556,0.00018816128,0.0001858964,0.00012228377,0.00030954677,0.0013164593,0.0005674329,0.00007849432,0.000007890718],"category_scores_gemma":[0.000120196455,0.00015331306,0.000040664003,0.00052710675,0.00004874237,0.0069372826,0.00006171633,0.00015857344,0.00012531223],"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.00001623977,0.000067669745,0.002704238,0.0011176164,0.000025071762,0.0000105852805,0.005675781,0.0019540587,0.0008709718,0.7020362,0.0015354088,0.28398615],"study_design_scores_gemma":[0.001649518,0.00033269235,0.0036799419,0.0005671159,0.000024918834,0.000391535,0.0020604867,0.9195918,0.007304101,0.006954368,0.05590727,0.0015362365],"about_ca_topic_score_codex":0.000015603626,"about_ca_topic_score_gemma":6.558931e-7,"teacher_disagreement_score":0.992756,"about_ca_system_score_codex":0.00004544295,"about_ca_system_score_gemma":0.00017199514,"threshold_uncertainty_score":0.9997203},"labels":[],"label_agreement":null},{"id":"W2149951699","doi":"","title":"Latent Maximum Margin Clustering","year":2013,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cluster analysis; Margin (machine learning); Computer science; Latent variable; Artificial intelligence; Probabilistic latent semantic analysis; Correlation clustering; Data mining; Pattern recognition (psychology); Machine learning","score_opus":0.02517951356659484,"score_gpt":0.25911974721805403,"score_spread":0.2339402336514592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149951699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019690393,0.00018090561,0.97288984,0.0008350837,0.0013205806,0.00036499833,8.638665e-7,0.00055230083,0.0041650147],"genre_scores_gemma":[0.98714954,0.0000034313205,0.012036497,0.00049539324,0.00007850902,0.000070137394,0.00000523995,0.000006190858,0.00015508557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987391,0.00007263644,0.00047095245,0.00013909502,0.0002998514,0.00027833704],"domain_scores_gemma":[0.9991284,0.0000326013,0.0002512808,0.00027993033,0.00023055905,0.00007721299],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042306085,0.00013345321,0.00015800259,0.00013585878,0.00018264259,0.001736121,0.00046139004,0.00006107217,0.0000075991315],"category_scores_gemma":[0.00003457979,0.000109928646,0.000037870235,0.00033153282,0.000016672015,0.007287689,0.00011005579,0.00012433513,0.0003617589],"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.0000030054725,0.000012943865,0.0025094463,0.0005469213,0.000008805781,0.0000023380803,0.0018686709,0.0141654955,0.00031219728,0.0010615853,0.0016502471,0.97785836],"study_design_scores_gemma":[0.00019974221,0.000024088575,0.007244955,0.00008555789,0.0000013295964,0.00007269301,0.00007662204,0.9858579,0.00013075673,0.00027459094,0.0058507156,0.00018107131],"about_ca_topic_score_codex":0.00011282185,"about_ca_topic_score_gemma":0.0000012861209,"teacher_disagreement_score":0.9776773,"about_ca_system_score_codex":0.00003958447,"about_ca_system_score_gemma":0.00003452284,"threshold_uncertainty_score":0.9993002},"labels":[],"label_agreement":null},{"id":"W2151976295","doi":"","title":"Relaxed Clipping: A Global Training Method for Robust Regression and Classification","year":2010,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":39,"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":"Robustness (evolution); Outlier; Robust regression; Clipping (morphology); Computer science; Regression; Robust statistics; Artificial intelligence; Scalability; Training set; Pattern recognition (psychology); Mathematics; Mathematical optimization; Machine learning; Algorithm; Statistics","score_opus":0.24973564273232565,"score_gpt":0.461763917946068,"score_spread":0.21202827521374237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151976295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042740065,0.00003522435,0.99275994,0.0002502324,0.00048670865,0.0005916511,0.000036737223,0.00016740896,0.0013980694],"genre_scores_gemma":[0.21859704,0.0000018685596,0.78095376,0.000081691134,0.000109890396,0.00013465261,0.00002326954,0.000012124917,0.00008570094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864024,0.00007595185,0.00065159873,0.000180569,0.00021627694,0.0002353348],"domain_scores_gemma":[0.99841124,0.00048850675,0.0005328124,0.0001607748,0.0002968226,0.000109861656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010067001,0.00016600249,0.0002766496,0.000058383615,0.0003055489,0.0002566351,0.000098289085,0.00016375683,0.000001974449],"category_scores_gemma":[0.0019140468,0.00012850588,0.00003822052,0.00014904856,0.00004764411,0.0013102134,0.000023187795,0.00021164966,0.0000015355467],"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.000064426844,0.000015892545,0.00003856423,0.0012000515,0.000007887122,2.9659037e-7,0.0020006264,0.0003359569,0.0021518257,0.26114643,0.0005215204,0.7325165],"study_design_scores_gemma":[0.0005222564,0.000046621768,0.0001139287,0.00018081383,0.000027241273,0.000066984205,0.001282732,0.9363313,0.000050392366,0.0561048,0.005094323,0.00017864724],"about_ca_topic_score_codex":0.0000053957383,"about_ca_topic_score_gemma":0.0000036548327,"teacher_disagreement_score":0.9359953,"about_ca_system_score_codex":0.0000353965,"about_ca_system_score_gemma":0.000054650965,"threshold_uncertainty_score":0.52403176},"labels":[],"label_agreement":null},{"id":"W2159008857","doi":"","title":"Learning to Control an Octopus Arm with Gaussian Process Temporal Difference Methods","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":57,"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":"octopus (software); Gaussian process; Robotic arm; Reinforcement learning; Temporal difference learning; Computer science; Artificial intelligence; Process (computing); Domain (mathematical analysis); Bayesian optimization; Bayesian probability; State space; Trajectory; Machine learning; Computer vision; Gaussian; Mathematics","score_opus":0.020160526124716367,"score_gpt":0.3137583755310238,"score_spread":0.29359784940630745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159008857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028591136,0.000030065037,0.96767163,0.000600391,0.00025002274,0.00058658246,7.5801387e-7,0.0006732757,0.0015961657],"genre_scores_gemma":[0.94615877,5.590228e-7,0.052372146,0.0007577442,0.00013476291,0.00009679658,0.000014835605,0.00001683829,0.00044757282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744964,0.00022205863,0.00078269496,0.000317184,0.0007189612,0.00050944585],"domain_scores_gemma":[0.99811417,0.00006351039,0.0006660353,0.00041267503,0.00046254767,0.00028104457],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007647283,0.00030568658,0.00034127093,0.00030612486,0.00046906632,0.0020997173,0.0009455087,0.00010140648,0.0000038117846],"category_scores_gemma":[0.000120636876,0.00023576156,0.00003447767,0.0007447276,0.000042756958,0.0071433196,0.00007197191,0.00040925303,0.00006452866],"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.00002128273,0.000016529884,0.0012754579,0.00018089627,0.00000758873,0.0000011393112,0.0072933836,0.8867991,0.000106216445,0.0005555853,0.000018979754,0.10372387],"study_design_scores_gemma":[0.00058863056,0.0006137023,0.00076435175,0.00016700663,0.000008962836,0.00008004194,0.00089896703,0.99288934,0.00043356416,0.000008906447,0.003192978,0.00035355703],"about_ca_topic_score_codex":0.000030212756,"about_ca_topic_score_gemma":0.0000028099473,"teacher_disagreement_score":0.9175676,"about_ca_system_score_codex":0.00011191508,"about_ca_system_score_gemma":0.0001716455,"threshold_uncertainty_score":0.9989362},"labels":[],"label_agreement":null},{"id":"W2159323669","doi":"","title":"Inferring State Sequences for Non-linear Systems with Embedded Hidden Markov Models","year":2003,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hidden Markov model; Sequence (biology); Hidden semi-Markov model; Discretization; Computer science; Forward algorithm; Markov chain; State space; Algorithm; State (computer science); Markov process; Markov model; Variable-order Markov model; Dynamic programming; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.024856138944886287,"score_gpt":0.2634598090419021,"score_spread":0.2386036700970158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159323669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00938539,0.00007226496,0.9858512,0.000059113845,0.00021403434,0.0010474669,0.000008849531,0.0005244661,0.0028371846],"genre_scores_gemma":[0.96474653,0.000005105309,0.033962436,0.00009328313,0.00003755761,0.00078355294,0.000010403052,0.000011937169,0.00034916817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855185,0.000037191254,0.0005947542,0.00021718876,0.00031102885,0.00028797728],"domain_scores_gemma":[0.9985942,0.00003606422,0.00049385347,0.00031756787,0.00046808895,0.00009021418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003898641,0.00018685653,0.00021983728,0.00017351445,0.0004181646,0.0010151631,0.00039242927,0.00007191289,5.824095e-7],"category_scores_gemma":[0.000015692282,0.0001480255,0.000040806157,0.0004870526,0.000034318156,0.0052453578,0.000031416977,0.00011540757,0.000009452253],"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.00008239162,0.000109254,0.0004592944,0.0047201184,0.00009909837,0.000004719165,0.011937226,0.7108535,0.0011644238,0.12608987,0.002325328,0.14215474],"study_design_scores_gemma":[0.00024691405,0.000092845214,0.000010114519,0.0001292102,0.000005482332,0.00008347337,0.0004618935,0.99440366,0.0010247839,0.00040596697,0.0029179032,0.00021777063],"about_ca_topic_score_codex":0.00006369426,"about_ca_topic_score_gemma":0.0000016381844,"teacher_disagreement_score":0.9553612,"about_ca_system_score_codex":0.000073676456,"about_ca_system_score_gemma":0.00015230611,"threshold_uncertainty_score":0.97892416},"labels":[],"label_agreement":null},{"id":"W2160163723","doi":"","title":"Parametric Bandits: The Generalized Linear Case","year":2010,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":261,"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; Parameterized complexity; Generalized linear model; Parametric statistics; Computer science; Mathematical optimization; Linear model; Applied mathematics; Mathematics; Algorithm; Machine learning; Statistics","score_opus":0.1076079387823779,"score_gpt":0.4263062865630172,"score_spread":0.3186983477806393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160163723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8072849,0.00059091515,0.17741,0.0023835842,0.005350001,0.0018799794,0.00007737861,0.00045915664,0.00456406],"genre_scores_gemma":[0.9973146,0.000003452257,0.00081327837,0.00025414937,0.00043708752,0.000080941296,0.0000120316545,0.000010799661,0.0010736751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960746,0.0001934967,0.0011396946,0.00023150694,0.0019723459,0.00038834594],"domain_scores_gemma":[0.99640954,0.0008644827,0.00063248264,0.00064805825,0.0012917251,0.0001537166],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032462366,0.00017799386,0.0002566251,0.0005631961,0.00087331055,0.002153674,0.0008540953,0.00013043333,0.00009173872],"category_scores_gemma":[0.0050692973,0.00009459903,0.000079629055,0.0024722668,0.00018258365,0.004402479,0.00012262371,0.0006314017,0.00064460706],"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.00010568977,0.00006157581,0.0013115251,0.00016405374,0.000024784556,0.00020972577,0.0036867196,0.1124968,0.00047328157,0.0013132701,0.020449605,0.85970294],"study_design_scores_gemma":[0.00042297255,0.00003182846,0.00018487567,0.000009490534,0.0000045536276,0.002480609,0.0017245892,0.86868393,0.00024407335,0.00028958853,0.12576775,0.00015571575],"about_ca_topic_score_codex":0.000113412374,"about_ca_topic_score_gemma":0.000020642827,"teacher_disagreement_score":0.85954726,"about_ca_system_score_codex":0.000035614124,"about_ca_system_score_gemma":0.00013552631,"threshold_uncertainty_score":0.9988822},"labels":[],"label_agreement":null},{"id":"W2162572398","doi":"","title":"Using Convolutional Neural Networks to Recognize Rhythm Stimuli from Electroencephalography Recordings","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Electroencephalography; Rhythm; Convolutional neural network; Pattern recognition (psychology); Computer science; Perception; Sensorimotor rhythm; Artificial intelligence; Speech recognition; Representation (politics); Psychology; Neuroscience; Brain–computer interface; Medicine","score_opus":0.036419989598716625,"score_gpt":0.2740508930075762,"score_spread":0.23763090340885956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162572398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75000286,0.00009501264,0.24546495,0.00035339026,0.0024929917,0.00043334113,0.000023446371,0.00039283966,0.00074113696],"genre_scores_gemma":[0.99468255,0.0000025113216,0.0011492147,0.0034191343,0.0006324193,0.000027214952,0.00002949188,0.00001995413,0.000037518694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758095,0.00019735844,0.0008014678,0.00039667284,0.00046469984,0.0005588694],"domain_scores_gemma":[0.998604,0.0002617671,0.00049438246,0.0002165273,0.00022798475,0.00019532882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031416898,0.00029532122,0.00032383337,0.00029142696,0.00049903954,0.0010288485,0.00039204708,0.0001273159,0.0000150710675],"category_scores_gemma":[0.00030387798,0.00026587173,0.00009370412,0.00076276355,0.00008883888,0.0029936193,0.000090192756,0.00033151705,0.00004783583],"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.0003163863,0.00007334946,0.002755602,0.0003477554,0.000026608808,0.0000078251,0.0034724746,0.73635477,0.051734585,0.00081071304,0.00580189,0.19829805],"study_design_scores_gemma":[0.0003370545,0.00013220371,0.00031291865,0.00016806676,0.00001064607,0.00014746342,0.0001060209,0.9913836,0.003148346,0.0000849937,0.003857299,0.0003113513],"about_ca_topic_score_codex":0.0001440016,"about_ca_topic_score_gemma":0.0000031516531,"teacher_disagreement_score":0.25502887,"about_ca_system_score_codex":0.000075149226,"about_ca_system_score_gemma":0.00003641424,"threshold_uncertainty_score":0.9999794},"labels":[],"label_agreement":null},{"id":"W2162724919","doi":"","title":"Using Deep Belief Nets to Learn Covariance Kernels for Gaussian Processes","year":2007,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Gaussian Processes and Bayesian Inference","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 Toronto","funders":"","keywords":"Deep belief network; Artificial intelligence; Covariance; Kernel (algebra); Computer science; Gaussian process; Pattern recognition (psychology); Backpropagation; Deep learning; Gaussian; Machine learning; Mathematics; Artificial neural network; Statistics","score_opus":0.04064166434881589,"score_gpt":0.3030173763764282,"score_spread":0.26237571202761234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162724919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028021017,0.00030897022,0.99206257,0.00068569323,0.00072846137,0.0008580205,0.0000071981212,0.00037834098,0.0021686547],"genre_scores_gemma":[0.9316623,0.0000035950877,0.06649751,0.0013765201,0.00018151964,0.000081996586,0.000012890994,0.000019782181,0.00016384735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973454,0.000023896378,0.00097034127,0.0003835323,0.0005411431,0.00073567167],"domain_scores_gemma":[0.99764776,0.00009103277,0.0006152576,0.0003746953,0.0009925665,0.0002787045],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074933603,0.00030925416,0.0003208689,0.00034721673,0.00058993086,0.002023931,0.0009897468,0.00014865134,0.000004992873],"category_scores_gemma":[0.00027974969,0.00027566912,0.00005492568,0.0014897522,0.00004060818,0.0066677043,0.00013018705,0.00017216193,0.000061126986],"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.00024653706,0.00020234135,0.0012195624,0.013680792,0.000061567116,0.000033249467,0.02167593,0.084418066,0.002421032,0.10068915,0.0022453011,0.77310646],"study_design_scores_gemma":[0.0008987463,0.00032376713,0.0009413256,0.0008189244,0.000020242278,0.00033344494,0.0010000373,0.94542515,0.0029666086,0.0011369085,0.04513914,0.0009957175],"about_ca_topic_score_codex":0.000050547085,"about_ca_topic_score_gemma":0.000017006256,"teacher_disagreement_score":0.92886025,"about_ca_system_score_codex":0.00013654228,"about_ca_system_score_gemma":0.00038732798,"threshold_uncertainty_score":0.99996954},"labels":[],"label_agreement":null},{"id":"W2163097311","doi":"","title":"Proximity Graphs for Clustering and Manifold Learning","year":2004,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":120,"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":"Cluster analysis; Lattice graph; Dimensionality reduction; Computer science; Line graph; Mathematics; Graph; Pattern recognition (psychology); Voltage graph; Theoretical computer science; Artificial intelligence","score_opus":0.022688260320615685,"score_gpt":0.28182495072565483,"score_spread":0.25913669040503917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163097311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012334722,0.00014022188,0.98582673,0.0002813896,0.0002473138,0.0005218023,0.000001375167,0.00037209658,0.00027436184],"genre_scores_gemma":[0.9677492,0.000006619242,0.031877995,0.00008369782,0.000043849308,0.00013389705,0.0000055566848,0.000009353646,0.00008986994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988008,0.000023862745,0.0003595758,0.00019001415,0.00030548,0.0003202414],"domain_scores_gemma":[0.9992769,0.0000367033,0.00020221405,0.00016297169,0.00023050205,0.00009075604],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034932664,0.00013427871,0.00014564353,0.00017858489,0.00044713993,0.001061691,0.0003265833,0.000059987953,1.8163468e-7],"category_scores_gemma":[0.00009078638,0.00012371951,0.000027947583,0.00029857105,0.000026877737,0.0064119697,0.00018037694,0.00018373004,0.000005738258],"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.000039945848,0.000027428185,0.00026757404,0.003547616,0.00001678365,0.0000053466233,0.0073811864,0.4327811,0.0008751774,0.02505668,0.000024515777,0.52997667],"study_design_scores_gemma":[0.0006390283,0.00010927764,0.00018145893,0.00014177304,0.0000018568047,0.00012944333,0.0002708816,0.9956893,0.0002519228,0.0008621284,0.0015559036,0.00016704625],"about_ca_topic_score_codex":0.000026904858,"about_ca_topic_score_gemma":0.0000021850144,"teacher_disagreement_score":0.9554144,"about_ca_system_score_codex":0.0000833964,"about_ca_system_score_gemma":0.000056853154,"threshold_uncertainty_score":0.9999753},"labels":[],"label_agreement":null},{"id":"W2165897119","doi":"","title":"Mixing Properties of Conditional Markov Chains with Unbounded Feature Functions","year":2012,"lang":"en","type":"article","venue":"Neural Information Processing Systems","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":"Discriminative model; Identifiability; Markov chain; Conditional probability distribution; Variable-order Markov model; Chain rule (probability); Markov property; Conditional probability; Mathematics; Mixing (physics); Balance equation; Conditional variance; Regular conditional probability; Sequence (biology); Uniqueness; Feature (linguistics); Hidden Markov model; Additive Markov chain; Markov model; Markov process; Computer science; Random variable; Artificial intelligence; Statistics; Econometrics; Probability mass function; Mathematical analysis","score_opus":0.027065799312015235,"score_gpt":0.22559226029784502,"score_spread":0.19852646098582977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165897119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050909963,0.00051228504,0.94563496,0.0004418659,0.00042087547,0.00019868698,0.000007644649,0.00021644555,0.0016572591],"genre_scores_gemma":[0.9971385,0.000001275035,0.0022283078,0.00016141904,0.00008530685,0.000038507278,0.000022497723,0.000004805282,0.00031940735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896336,0.00003832974,0.0003098188,0.0000925283,0.00035892194,0.00023704451],"domain_scores_gemma":[0.9990733,0.00001278717,0.0002934041,0.00017231333,0.00036721973,0.00008096222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023117843,0.0001266475,0.00014516927,0.0001278587,0.00025014003,0.0003741908,0.00023768109,0.00006790442,0.0000017331929],"category_scores_gemma":[0.000019525087,0.00008999302,0.000026337038,0.00033951094,0.000059505033,0.0055244197,0.000038152666,0.00014619903,0.000015453992],"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.0004811174,0.00087345217,0.020308314,0.014767742,0.00040920865,0.0000060396005,0.10755953,0.11243104,0.028129715,0.42397937,0.019052282,0.2720022],"study_design_scores_gemma":[0.0004385621,0.00010497289,0.0013329899,0.00058325805,0.000016615857,0.00024557614,0.0013496918,0.9909493,0.0021564015,0.00006209496,0.0024183968,0.0003421669],"about_ca_topic_score_codex":0.00001862036,"about_ca_topic_score_gemma":8.677323e-7,"teacher_disagreement_score":0.9462285,"about_ca_system_score_codex":0.000037384852,"about_ca_system_score_gemma":0.000118689444,"threshold_uncertainty_score":0.4005071},"labels":[],"label_agreement":null},{"id":"W2166885413","doi":"","title":"Impact of an Energy Normalization Transform on the Performance of the LF-ASD Brain Computer Interface","year":2003,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Neil Squire Society; University of British Columbia","funders":"","keywords":"Normalization (sociology); Idle; Brain–computer interface; Computer science; Electroencephalography; Artificial intelligence; Speech recognition; Pattern recognition (psychology); Psychology; Neuroscience","score_opus":0.02005060860943235,"score_gpt":0.269230002735126,"score_spread":0.24917939412569362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166885413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892199,0.000018101475,0.007993198,0.0001706658,0.0004435748,0.00026655503,0.000011975103,0.00004412754,0.00183192],"genre_scores_gemma":[0.99938583,0.0000028286584,0.000020577556,0.0004645339,0.00003136414,0.000011908562,0.000002884149,0.0000087384,0.00007136044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984195,0.0002314125,0.0006292071,0.00012780851,0.00039848615,0.00019355334],"domain_scores_gemma":[0.99886125,0.00013433628,0.0005505321,0.00026711836,0.00014967944,0.000037106274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033244284,0.00016957046,0.00018756842,0.00010073079,0.00022076567,0.00018640586,0.00046163777,0.000061867606,0.00000805699],"category_scores_gemma":[0.00006555628,0.00008704883,0.00008804959,0.0004357036,0.00010812815,0.0019628864,0.00002503619,0.00013729837,0.0000031761845],"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.0002642022,0.00029179544,0.001975905,0.0014343474,0.000034316643,5.2003446e-7,0.020344375,0.7515566,0.09847246,0.011653479,0.0017829366,0.11218906],"study_design_scores_gemma":[0.0002507659,0.0004971293,0.00081888825,0.00023748902,0.0000040194313,0.00004753693,0.0001356592,0.6495596,0.34737745,0.000012747603,0.000948655,0.00011004705],"about_ca_topic_score_codex":0.000043078187,"about_ca_topic_score_gemma":0.0000021330666,"teacher_disagreement_score":0.24890499,"about_ca_system_score_codex":0.00004457341,"about_ca_system_score_gemma":0.00007521977,"threshold_uncertainty_score":0.3549748},"labels":[],"label_agreement":null},{"id":"W2167205245","doi":"","title":"Learning Patient-Specific Cancer Survival Distributions as a Sequence of Dependent Regressors","year":2011,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Colorectal Cancer Screening and Detection","field":"Medicine","cited_by":133,"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":"Proportional hazards model; Regression; Survival analysis; Regression analysis; Cancer; Statistics; Medicine; Population; Computer science; Machine learning; Oncology; Artificial intelligence; Internal medicine; Mathematics","score_opus":0.07457355463783148,"score_gpt":0.3042221427879242,"score_spread":0.2296485881500927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167205245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858212,0.0007081097,0.003357403,0.000051838582,0.0007260163,0.0003627269,0.000028093758,0.00019432243,0.008750288],"genre_scores_gemma":[0.99950325,0.000035037705,0.00005887977,0.000020502717,0.000049398335,0.00007736989,0.000050125236,0.0000076253264,0.00019780567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988066,0.00004534298,0.00048605175,0.000111935864,0.00038125055,0.00016879573],"domain_scores_gemma":[0.99888915,0.000015965104,0.00044448627,0.00011341979,0.00045402485,0.000082947554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015273957,0.00011450194,0.00020643903,0.00012402375,0.0001394778,0.00005402017,0.000059394635,0.00007640336,0.000028878969],"category_scores_gemma":[0.00008247363,0.00009758016,0.0000510524,0.00032890856,0.00005238119,0.0007814404,0.00002191063,0.00021709809,0.00001591574],"study_design_candidate":"design_other","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.0060261064,0.00017428369,0.043151997,0.0029659884,0.00012064868,0.000023244796,0.034436364,0.00561081,0.01005416,0.0009976579,0.0004334557,0.8960053],"study_design_scores_gemma":[0.013134914,0.026430216,0.08461692,0.013203371,0.0007780534,0.003844702,0.08262518,0.48134091,0.20996766,0.00028877685,0.08035323,0.0034160635],"about_ca_topic_score_codex":0.0011798865,"about_ca_topic_score_gemma":0.000010184764,"teacher_disagreement_score":0.8925892,"about_ca_system_score_codex":0.00014222578,"about_ca_system_score_gemma":0.000114193754,"threshold_uncertainty_score":0.39792034},"labels":[],"label_agreement":null},{"id":"W2168148636","doi":"","title":"Incorporating Second-Order Functional Knowledge for Better Option Pricing","year":2000,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":273,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Generalization; Computer science; A priori and a posteriori; Class (philosophy); Task (project management); Function (biology); Order (exchange); Convex function; Artificial neural network; Machine learning; Artificial intelligence; Regular polygon; Mathematical optimization; Mathematics","score_opus":0.021756917981157455,"score_gpt":0.2499960200512804,"score_spread":0.22823910207012296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168148636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049010914,0.00014079023,0.94416696,0.0008006782,0.0005188703,0.0006577048,0.000006009032,0.00037626905,0.00432179],"genre_scores_gemma":[0.9889293,0.0000011371138,0.008539972,0.0007566896,0.00039008874,0.00029701012,0.00006485956,0.000008680183,0.0010123044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988805,0.000025189971,0.0005169565,0.00018179,0.00017692336,0.00021864573],"domain_scores_gemma":[0.9991256,0.000052486113,0.00026261678,0.00018937721,0.00030923772,0.000060703907],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022453771,0.00013838612,0.00013148838,0.00009425206,0.0006425099,0.0011312593,0.00026636542,0.00006748309,0.000019530247],"category_scores_gemma":[0.000009603209,0.00012204112,0.00004267348,0.00051277585,0.000026119591,0.0044158716,0.000032817366,0.000119520984,0.00009886877],"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.000012897115,0.000034302895,0.00010549804,0.0004118385,0.0000085620495,2.1444716e-7,0.0011267578,0.054187782,0.00052531285,0.01916197,0.0064741825,0.9179507],"study_design_scores_gemma":[0.0002623188,0.000028180208,0.0003121129,0.00005638396,0.0000033232066,0.000028032915,0.00003757791,0.93372905,0.00012387348,0.00043107528,0.06483363,0.00015444148],"about_ca_topic_score_codex":0.000004985328,"about_ca_topic_score_gemma":0.000001930434,"teacher_disagreement_score":0.93991834,"about_ca_system_score_codex":0.000044551583,"about_ca_system_score_gemma":0.00007906151,"threshold_uncertainty_score":0.99990565},"labels":[],"label_agreement":null},{"id":"W2168345951","doi":"","title":"Slow, Decorrelated Features for Pretraining Complex Cell-like Networks","year":2009,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":64,"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; Computer science; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Layer (electronics); Algorithm; Function (biology); Word error rate","score_opus":0.029110924426703162,"score_gpt":0.2613746542383049,"score_spread":0.23226372981160176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168345951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50947845,0.00059726357,0.4216293,0.003114754,0.014701177,0.0071767867,0.00014334568,0.0034930578,0.03966585],"genre_scores_gemma":[0.99546367,0.000006327044,0.00017686376,0.0033481761,0.00017728444,0.000041602114,0.00009840679,0.000013719607,0.00067394273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984719,0.00005405644,0.00056200265,0.00023234806,0.00029428618,0.00038537284],"domain_scores_gemma":[0.9990301,0.00012035048,0.00045304763,0.00015636339,0.00014736361,0.00009275318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020628312,0.00021380388,0.00021141014,0.00014803189,0.00055520143,0.00076790224,0.00022124601,0.0001441091,0.0000042106108],"category_scores_gemma":[0.0001344595,0.00018286143,0.00007746896,0.00040303878,0.000034537414,0.002088967,0.000017981842,0.0002444015,0.000012639991],"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.00052114745,0.00013314332,0.00014946013,0.0009330806,0.000009129609,0.0000073535575,0.0028272,0.41321263,0.09962649,0.005403892,0.042894498,0.43428198],"study_design_scores_gemma":[0.0005641793,0.0002047037,0.00062019477,0.00006721352,0.000009658266,0.00007546465,0.00013374291,0.99127436,0.0009020173,0.000064208034,0.00585658,0.00022765443],"about_ca_topic_score_codex":0.0000053753824,"about_ca_topic_score_gemma":5.257507e-7,"teacher_disagreement_score":0.57806176,"about_ca_system_score_codex":0.000052533305,"about_ca_system_score_gemma":0.000031697135,"threshold_uncertainty_score":0.7456873},"labels":[],"label_agreement":null},{"id":"W2168706009","doi":"","title":"\"Name That Song!\" A Probabilistic Approach to Querying on Music and Text","year":2002,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Music and Audio Processing","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lyrics; Computer science; Probabilistic logic; Maximum a posteriori estimation; Music information retrieval; Information retrieval; Statistical model; Natural language processing; Modal; Topic model; A priori and a posteriori; Artificial intelligence; Speech recognition; Maximum likelihood; Mathematics; Musical; Statistics; Literature; Art","score_opus":0.05687555581886768,"score_gpt":0.22882965073366174,"score_spread":0.17195409491479405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168706009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06936244,0.00092310825,0.8519936,0.0020063408,0.0010084289,0.0014478501,0.0000042751044,0.0010629419,0.07219097],"genre_scores_gemma":[0.9936246,0.000002211631,0.003412324,0.002472369,0.00009288483,0.00009133819,0.000003010736,0.000009822246,0.00029142215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984028,0.000046042547,0.00043158996,0.0003015272,0.00046937977,0.0003486661],"domain_scores_gemma":[0.9990964,0.000041628315,0.0002913447,0.0002846349,0.00013015639,0.00015586939],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002965793,0.00021857613,0.00022799145,0.00022734527,0.00043571857,0.0020360968,0.0004181116,0.00007826971,0.0000047193603],"category_scores_gemma":[0.000079255544,0.0001785133,0.000030244353,0.0004905496,0.000040851206,0.0041147154,0.000118583725,0.00018008151,0.00009702847],"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.000014692479,0.000101218386,0.00028576245,0.002709398,0.00001121583,0.0000030947178,0.033229567,0.026457207,0.000079134385,0.008381998,0.010251785,0.9184749],"study_design_scores_gemma":[0.00024074463,0.000075049764,0.00023496978,0.00032978007,0.0000044803014,0.00010745219,0.00042109957,0.98947585,0.000044878132,0.000080375816,0.008707134,0.00027821196],"about_ca_topic_score_codex":0.000020463745,"about_ca_topic_score_gemma":5.556549e-7,"teacher_disagreement_score":0.9630186,"about_ca_system_score_codex":0.00006474933,"about_ca_system_score_gemma":0.000030100895,"threshold_uncertainty_score":0.9989999},"labels":[],"label_agreement":null},{"id":"W217970951","doi":"","title":"Roles of Pre-Training and Fine-Tuning in Context-Dependent DBN-HMMs for Real-World Speech Recognition","year":2010,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hidden Markov model; Computer science; Artificial intelligence; Speech recognition; Context (archaeology); Deep belief network; Vocabulary; Deep learning; Pattern recognition (psychology)","score_opus":0.042077798734252304,"score_gpt":0.2835390570334626,"score_spread":0.2414612582992103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W217970951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9327809,0.00014772709,0.060340695,0.00027957963,0.0009138031,0.0010142059,0.000030070152,0.00026413135,0.0042288564],"genre_scores_gemma":[0.98935455,0.000006568281,0.010287962,0.00009001032,0.000059843,0.00008711599,0.000020713305,0.0000070240844,0.000086209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862456,0.00004144628,0.0006912945,0.00016809278,0.000268557,0.00020601698],"domain_scores_gemma":[0.99887896,0.00016595057,0.00044160886,0.00015824872,0.0002912193,0.00006403793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000763245,0.00013326955,0.00025560663,0.00040244352,0.000118686105,0.00042456674,0.00022462089,0.00008703562,0.0000047290964],"category_scores_gemma":[0.00021138343,0.00012327297,0.000042696327,0.00030225824,0.000036455494,0.003209876,0.00004246485,0.00016935222,0.0000048422303],"study_design_candidate":"design_other","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.000016154781,0.000013073427,0.00040462875,0.00030898917,0.000005102698,6.750821e-7,0.0035015903,0.000034685094,0.001725116,0.00038816774,0.000033374254,0.9935684],"study_design_scores_gemma":[0.0016556703,0.00013932836,0.0033472718,0.00095485605,0.000020432415,0.00015720473,0.0039416845,0.95328325,0.031646553,0.0010319703,0.003318684,0.00050308],"about_ca_topic_score_codex":0.00015030542,"about_ca_topic_score_gemma":0.00062751805,"teacher_disagreement_score":0.99306536,"about_ca_system_score_codex":0.00002272735,"about_ca_system_score_gemma":0.0000696218,"threshold_uncertainty_score":0.5026926},"labels":[],"label_agreement":null},{"id":"W2189148180","doi":"","title":"Linear multi-resource allocation with semi-bandit feedback","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Computer science; Task (project management); Resource allocation; Mathematical optimization; Resource (disambiguation); Hypercube; Noise (video); Resource management (computing); Distributed computing; Artificial intelligence; Machine learning; Mathematics; Engineering","score_opus":0.17021817587683175,"score_gpt":0.40578447418840363,"score_spread":0.2355662983115719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189148180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04096811,0.00041175925,0.95179576,0.0011099327,0.0006362041,0.0010650929,0.000025449577,0.00040093262,0.0035867773],"genre_scores_gemma":[0.99349004,0.0000015084615,0.002313033,0.00021103711,0.00024473894,0.000070481525,0.0000656481,0.00001927239,0.003584246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953234,0.00017044724,0.001005572,0.00029112477,0.0028163027,0.00039314356],"domain_scores_gemma":[0.99614567,0.00019666008,0.0007017625,0.00045720127,0.0022000573,0.0002986827],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021853023,0.00021394891,0.00029968968,0.00043965122,0.00029988354,0.0013549048,0.00066747394,0.000116742,0.000014241222],"category_scores_gemma":[0.0015534671,0.00013933118,0.000039860734,0.0013695594,0.0001342409,0.006230984,0.00009077727,0.0002826301,0.0008768938],"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.0002788395,0.00006842649,0.0020796428,0.00016706389,0.000016861602,0.000008047308,0.0078392895,0.8140733,0.00007270838,0.000058778776,0.015718965,0.15961808],"study_design_scores_gemma":[0.0012229267,0.00013654545,0.0004004706,0.00007905158,0.0000048002867,0.00009383946,0.00620962,0.89291954,0.0003060694,0.000043600925,0.098364264,0.00021926982],"about_ca_topic_score_codex":0.00004818053,"about_ca_topic_score_gemma":0.0000085163165,"teacher_disagreement_score":0.9525219,"about_ca_system_score_codex":0.00016892393,"about_ca_system_score_gemma":0.00029430495,"threshold_uncertainty_score":0.99990106},"labels":[],"label_agreement":null},{"id":"W2189749715","doi":"","title":"Embedding inference for structured multilabel prediction","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","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 Alberta","funders":"","keywords":"Inference; Computer science; Structured prediction; Scalability; Embedding; Machine learning; Margin (machine learning); Representation (politics); Artificial intelligence; Bottleneck; Key (lock); Theoretical computer science","score_opus":0.056424358961094934,"score_gpt":0.3103287019881856,"score_spread":0.25390434302709064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189749715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016161654,0.00008411018,0.9808924,0.00013017593,0.001505325,0.00040267268,0.000008439225,0.00041545538,0.0003997501],"genre_scores_gemma":[0.9738435,4.913273e-7,0.02571566,0.00013544198,0.00014034817,0.00007823871,0.000022939861,0.0000048582524,0.000058507696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880654,0.000023972216,0.0004788705,0.00015131656,0.00033164117,0.0002076732],"domain_scores_gemma":[0.9988368,0.000032598968,0.0002883235,0.0002288649,0.00051219855,0.00010117176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003414398,0.00011702804,0.00012980597,0.00012567561,0.0001603855,0.00084072497,0.00037968202,0.00007795416,2.7150423e-7],"category_scores_gemma":[0.00021348069,0.000102905244,0.000024928768,0.00019698092,0.000012417125,0.006248473,0.00006480332,0.00009194795,0.000008420486],"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.000021803164,0.000013322471,0.000703149,0.00070345175,0.0000101574105,5.1637414e-7,0.013684854,0.68049717,0.00042330156,0.012462827,0.0011778211,0.29030162],"study_design_scores_gemma":[0.00045802453,0.00003581525,0.000057996367,0.000053360764,0.0000027972487,0.000016925207,0.00033042507,0.9952541,0.00021039437,0.0003220525,0.0031537372,0.00010435502],"about_ca_topic_score_codex":0.000021161652,"about_ca_topic_score_gemma":6.2191623e-7,"teacher_disagreement_score":0.95768183,"about_ca_system_score_codex":0.00008669686,"about_ca_system_score_gemma":0.00013252826,"threshold_uncertainty_score":0.81071305},"labels":[],"label_agreement":null},{"id":"W2191938486","doi":"","title":"Basis refinement strategies for linear value function approximation in MDPs","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov decision process; Basis (linear algebra); Computer science; Bellman equation; Bisimulation; Basis function; Mathematical optimization; Function (biology); Value (mathematics); Markov process; Algorithm; Theoretical computer science; Mathematics; Machine learning","score_opus":0.05119097121540838,"score_gpt":0.2817875639405395,"score_spread":0.2305965927251311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191938486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032420317,0.000047492547,0.99210453,0.00030090995,0.0008692886,0.00061647047,0.0000010637556,0.00025168314,0.0025665332],"genre_scores_gemma":[0.9829067,0.0000013754212,0.016311057,0.00025787862,0.00010584483,0.00018539165,0.00006331178,0.000008319791,0.0001601373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834675,0.00005568737,0.00071499107,0.00015397869,0.00048272987,0.00024585327],"domain_scores_gemma":[0.99878865,0.00003490759,0.00045916814,0.00023153522,0.00041682052,0.000068902875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083312445,0.00014798036,0.00016399966,0.00027073734,0.00012581836,0.001001448,0.00032097753,0.00008508768,5.734701e-7],"category_scores_gemma":[0.00011068262,0.00013459299,0.0000319232,0.0004698251,0.000016537208,0.007610477,0.000056325407,0.0001226392,0.000029149915],"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.00001549355,0.000008028811,0.00009126922,0.00035207614,0.0000032982953,1.4355727e-7,0.0021683578,0.9656221,0.000023405972,0.02006149,0.00057587324,0.011078453],"study_design_scores_gemma":[0.0006495622,0.00020450992,0.00009927128,0.000095893854,0.000004690836,0.000005945661,0.0015527067,0.9903277,0.000072495524,0.00030169706,0.006537361,0.00014812428],"about_ca_topic_score_codex":0.000047947928,"about_ca_topic_score_gemma":0.0000016247534,"teacher_disagreement_score":0.9796646,"about_ca_system_score_codex":0.00017127315,"about_ca_system_score_gemma":0.00022315278,"threshold_uncertainty_score":0.96569866},"labels":[],"label_agreement":null},{"id":"W2235935298","doi":"","title":"On the Expressive Power of Restricted Boltzmann Machines.","year":2013,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","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":"Boltzmann machine; Restricted Boltzmann machine; Computer science; Generative model; Upper and lower bounds; Function (biology); Type (biology); Artificial neural network; Exponential function; Theoretical computer science; Simple (philosophy); Algorithm; Generative grammar; Artificial intelligence; Mathematics","score_opus":0.011548361567214038,"score_gpt":0.2130703337697511,"score_spread":0.20152197220253706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235935298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13604067,0.0003604831,0.835541,0.004262639,0.0017107626,0.0014926746,0.00000896712,0.00029694894,0.020285849],"genre_scores_gemma":[0.9987501,0.0000015242678,0.0005308737,0.00050059916,0.00003981883,0.000057954214,0.0000031445413,0.0000037935022,0.00011222969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892104,0.00009581432,0.00040914808,0.0001033683,0.000310454,0.0001601583],"domain_scores_gemma":[0.99873924,0.00012550477,0.00041846128,0.000300842,0.00037572155,0.000040214272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001343046,0.000118897835,0.00013697983,0.000088995715,0.00019411313,0.0006060746,0.0005031289,0.00004477956,0.000020506915],"category_scores_gemma":[0.0001435255,0.00006857131,0.00003982925,0.00035396373,0.00004242827,0.0032355394,0.000071291586,0.00010912109,0.000076030185],"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.00006716176,0.00020282337,0.00048301535,0.0006418982,0.000119250835,0.000004328499,0.027213413,0.28954172,0.016075654,0.099556796,0.24871941,0.31737453],"study_design_scores_gemma":[0.00014279378,0.000061081766,0.0011345041,0.00009104517,0.0000024503722,0.0000056165068,0.0002551169,0.9949406,0.0015855414,0.00032063722,0.0013477105,0.000112913265],"about_ca_topic_score_codex":0.00009229906,"about_ca_topic_score_gemma":2.3086596e-7,"teacher_disagreement_score":0.8627094,"about_ca_system_score_codex":0.000016631342,"about_ca_system_score_gemma":0.000034115837,"threshold_uncertainty_score":0.5844391},"labels":[],"label_agreement":null},{"id":"W2279713460","doi":"","title":"A Dimension-Independent Generalization Bound for Kernel Supervised Principal Component Analysis","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Face and Expression Recognition","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":"Principal component analysis; Dimension (graph theory); Kernel principal component analysis; Generalization; Kernel (algebra); Mathematics; Upper and lower bounds; Sample complexity; Pattern recognition (psychology); Artificial intelligence; Kernel method; Computer science; Dimensionality reduction; Sample (material); Support vector machine; Discrete mathematics; Combinatorics","score_opus":0.04234872702388897,"score_gpt":0.27453572817249733,"score_spread":0.23218700114860835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279713460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23052,0.000115795956,0.7673617,0.0002627221,0.0007179086,0.00051725586,0.00001023627,0.00024188765,0.00025251173],"genre_scores_gemma":[0.9953557,0.0000024213707,0.0036487202,0.00038298522,0.000061245075,0.00014314233,0.00029820917,0.0000064079154,0.00010114345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829465,0.000067471505,0.00060684286,0.00020682657,0.0005822767,0.00024190861],"domain_scores_gemma":[0.99845743,0.000025445153,0.0003602776,0.00025684165,0.0007347124,0.00016528762],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047988154,0.00015659751,0.00023206245,0.0003452697,0.00025622526,0.0011092012,0.00032343264,0.00009124381,0.0000023008088],"category_scores_gemma":[0.000050941435,0.00013116426,0.00009096487,0.0006762189,0.000016069387,0.004095926,0.000086869564,0.000070768554,0.000040285733],"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.00022806376,0.00031953436,0.0058570076,0.0015283527,0.00038393604,0.0000064089104,0.02758479,0.8483152,0.006331493,0.008108168,0.01597829,0.08535878],"study_design_scores_gemma":[0.0007192239,0.000051112125,0.00057993893,0.000041964184,0.000045259054,0.000011739065,0.00036888852,0.9933043,0.00058887183,0.000086858716,0.004023433,0.00017837738],"about_ca_topic_score_codex":0.00008225391,"about_ca_topic_score_gemma":0.000005215256,"teacher_disagreement_score":0.7648357,"about_ca_system_score_codex":0.00010114232,"about_ca_system_score_gemma":0.000113252856,"threshold_uncertainty_score":0.99992776},"labels":[],"label_agreement":null},{"id":"W2280728065","doi":"","title":"Stage-wise Training: An Improved Feature Learning Strategy for Deep Models","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Regularization (linguistics); Curse of dimensionality; Machine learning; Artificial neural network; Decoupling (probability); Deep learning; Feature (linguistics); Context (archaeology); Process (computing); Generalization; Feature extraction; Feature learning; Mathematics; Engineering","score_opus":0.11936911065118973,"score_gpt":0.32931629282809166,"score_spread":0.20994718217690195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280728065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035407061,0.00023577786,0.99236566,0.00012394285,0.00052155764,0.00041616382,0.000004341927,0.00043159828,0.002360237],"genre_scores_gemma":[0.9550009,9.725094e-7,0.04319633,0.000268415,0.00017259455,0.00007367236,0.000055758614,0.000015591646,0.0012157712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984204,0.00016651432,0.00045593662,0.00022354549,0.00035916892,0.0003744256],"domain_scores_gemma":[0.9983848,0.000051239444,0.0003917766,0.00025218268,0.0007064673,0.00021358956],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012532457,0.00019943868,0.00024489246,0.00013128469,0.00032292862,0.0023185029,0.00054520706,0.00013501447,4.464794e-7],"category_scores_gemma":[0.00013854675,0.00017187957,0.000052490817,0.00032786137,0.000025885793,0.013433733,0.000049255937,0.00026048833,0.000004982932],"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.000072495575,0.000017879558,0.000009167332,0.0003708185,0.000009027263,0.0000026471384,0.027015164,0.5262349,0.000574397,0.003687639,0.0003279112,0.4416779],"study_design_scores_gemma":[0.0008862584,0.00028431282,0.0000066224443,0.00003950754,0.0000057526613,0.000044492077,0.0029714054,0.9905187,0.0002691722,0.00062621397,0.004123279,0.00022432182],"about_ca_topic_score_codex":0.00003160341,"about_ca_topic_score_gemma":0.0000018149615,"teacher_disagreement_score":0.9514602,"about_ca_system_score_codex":0.000063520216,"about_ca_system_score_gemma":0.00028105968,"threshold_uncertainty_score":0.9987172},"labels":[],"label_agreement":null},{"id":"W2345990059","doi":"","title":"Bayesian n-Choose-k Models for Classification and Ranking","year":2012,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bayesian probability; Computer science; Ranking (information retrieval); Artificial intelligence; Machine learning; Data mining","score_opus":0.05986201314790345,"score_gpt":0.2787099136030391,"score_spread":0.21884790045513564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345990059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019272412,0.00051747565,0.99533254,0.00033271118,0.00041904836,0.00028776805,0.0000024784888,0.00023655525,0.00094418944],"genre_scores_gemma":[0.9822812,0.000007028244,0.01716721,0.00028413415,0.00011120899,0.000094978015,0.000011827279,0.000006105696,0.000036279594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989431,0.000031714197,0.00040087113,0.00012700437,0.00020966343,0.00028765041],"domain_scores_gemma":[0.9992139,0.000040997118,0.00024688416,0.00018116349,0.0002040018,0.00011304993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005033103,0.00012491494,0.00013213418,0.000115661096,0.0002830466,0.000829422,0.00024014406,0.00008209746,3.3556805e-7],"category_scores_gemma":[0.000028324272,0.00011063365,0.000026550659,0.00018333814,0.000020706691,0.009793091,0.000039475006,0.00009091227,0.0000053171557],"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.000014644145,0.000027567543,0.0005372883,0.0008026952,0.000010026663,9.0659825e-8,0.008484355,0.014498211,0.0003464991,0.18029054,0.00061549776,0.79437256],"study_design_scores_gemma":[0.00019415356,0.00001431418,0.00027830192,0.000066805216,0.0000046873265,0.000025463976,0.00018532856,0.9964334,0.000049933704,0.0013894899,0.0012164828,0.00014165483],"about_ca_topic_score_codex":0.00000934214,"about_ca_topic_score_gemma":1.4366829e-7,"teacher_disagreement_score":0.98193514,"about_ca_system_score_codex":0.000026514535,"about_ca_system_score_gemma":0.000034517718,"threshold_uncertainty_score":0.7998135},"labels":[],"label_agreement":null},{"id":"W2509437949","doi":"","title":"Deep learning games","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nash equilibrium; Computer science; Deep learning; Artificial intelligence; Regret; Karush–Kuhn–Tucker conditions; Artificial neural network; Game theory; Differentiable function; Equivalence (formal languages); Bijection; Mathematical optimization; Machine learning; Mathematics; Mathematical economics; Discrete mathematics","score_opus":0.07726177950359157,"score_gpt":0.39242078176238665,"score_spread":0.31515900225879506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509437949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020402761,0.0004998479,0.9705402,0.0010862057,0.0008944252,0.00036155406,0.0000047637773,0.00034263745,0.0058675627],"genre_scores_gemma":[0.99422914,0.000010331386,0.00025809903,0.00007431392,0.00015695323,0.000038202856,0.0000032306166,0.000009143352,0.0052206167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964124,0.00017271047,0.00091777596,0.00021521402,0.0019134111,0.00036850147],"domain_scores_gemma":[0.99745065,0.00059092656,0.000539568,0.0002787984,0.001011183,0.00012887153],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001684718,0.00013913805,0.00022312472,0.00042948243,0.0003602492,0.0012062123,0.0005641742,0.00007891341,0.000113969734],"category_scores_gemma":[0.0040308745,0.00007338279,0.000055076594,0.0007784728,0.00010559154,0.0077967052,0.000102298116,0.00017203987,0.0018168519],"study_design_candidate":"design_other","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.000016162756,0.0000041692124,0.0011861138,0.000025951626,0.000002375253,0.0000014058594,0.000680299,0.011334268,0.00018198793,0.000103243096,0.0007867366,0.9856773],"study_design_scores_gemma":[0.0007783263,0.000105934465,0.002604413,0.00014876768,0.0000030314714,0.000092230126,0.0033733926,0.70765746,0.0006053607,0.0010839392,0.2832368,0.00031031595],"about_ca_topic_score_codex":0.000007975512,"about_ca_topic_score_gemma":0.0000013039887,"teacher_disagreement_score":0.985367,"about_ca_system_score_codex":0.00008993807,"about_ca_system_score_gemma":0.00006313591,"threshold_uncertainty_score":0.9998306},"labels":[],"label_agreement":null},{"id":"W2523622633","doi":"","title":"Hot coupling: a particle approach to inference and normalization on pairwise undirected graphs of arbitrary topology","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","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":"University of British Columbia","funders":"","keywords":"Graphical model; Pairwise comparison; Inference; Markov chain Monte Carlo; Algorithm; Mathematics; Computer science; Normalization (sociology); Approximate inference; Monte Carlo method; Gibbs sampling; Theoretical computer science; Bayesian probability; Artificial intelligence","score_opus":0.07081159558708214,"score_gpt":0.33669400411421,"score_spread":0.26588240852712786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523622633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93837714,0.00011077262,0.056226894,0.00012233248,0.000118198725,0.0005069368,0.000006074455,0.00014198614,0.00438965],"genre_scores_gemma":[0.9930647,0.0000069347802,0.006503807,0.0002353362,0.000038528375,0.000058005568,0.00001392268,0.000009552232,0.00006921065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988266,0.00006315264,0.00059189816,0.000120060206,0.00021681731,0.00018146889],"domain_scores_gemma":[0.99906856,0.00013693015,0.00032449843,0.00015772418,0.0002213627,0.00009092074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994572,0.0001365415,0.00024816373,0.00015342927,0.00010189973,0.00009350159,0.00009228152,0.00008854476,0.0000014380496],"category_scores_gemma":[0.00034601355,0.00011498332,0.000028812494,0.00032296428,0.000042632448,0.0007135196,0.000028418177,0.00009917928,2.887317e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000972783,0.0009183681,0.012044006,0.010927672,0.00011753768,0.0000021870078,0.057392422,0.06583576,0.00762218,0.67309874,0.002656436,0.1684119],"study_design_scores_gemma":[0.0005957509,0.00018439985,0.00043267186,0.00022403864,0.000025277155,0.000020357213,0.001362096,0.99128366,0.004065497,0.000359999,0.0012099826,0.00023625715],"about_ca_topic_score_codex":0.000019020874,"about_ca_topic_score_gemma":0.000004540982,"teacher_disagreement_score":0.92544794,"about_ca_system_score_codex":0.00002878394,"about_ca_system_score_gemma":0.00003488267,"threshold_uncertainty_score":0.46888834},"labels":[],"label_agreement":null},{"id":"W2528091958","doi":"","title":"The pigeon as particle filter","year":2007,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":81,"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":"Particle filter; Bayesian inference; Bayesian probability; Monte Carlo method; Inference; Computer science; Asymptote; Artificial intelligence; Sampling (signal processing); Ensemble learning; Machine learning; Posterior probability; Importance sampling; Filter (signal processing); Algorithm; Statistics; Mathematics; Kalman filter; Computer vision","score_opus":0.011845130311055501,"score_gpt":0.26437268410548287,"score_spread":0.2525275537944274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528091958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23677522,0.00015018633,0.7179197,0.0005846095,0.0014168074,0.0004210379,0.000017245497,0.00012550817,0.042589676],"genre_scores_gemma":[0.9991806,4.1324222e-7,0.000041094016,0.00012519753,0.00017379077,0.000015381669,0.00001218542,0.000004428327,0.00044689327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.000012185503,0.00031620002,0.00005220013,0.00017670052,0.00023396501],"domain_scores_gemma":[0.9995446,0.0000671928,0.00013208794,0.000093054114,0.000098655546,0.000064360385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027358576,0.00007242071,0.00006528804,0.000014601926,0.00033842155,0.00043315344,0.00009322573,0.000017808976,0.000037632926],"category_scores_gemma":[0.000018370534,0.00004624951,0.000023473232,0.00010261084,0.00001885085,0.0005536257,0.000017368038,0.00008071459,0.00022060705],"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.000023418172,0.000010346072,0.0011847973,0.000028109016,0.000007864114,3.9922438e-7,0.00046761925,0.00015949136,0.00009918954,0.6800942,0.0013739625,0.31655064],"study_design_scores_gemma":[0.0005509997,0.00008229187,0.0013619591,0.000055834567,0.00001508163,0.000007780592,0.004087555,0.8430899,0.0024945922,0.005470637,0.14253606,0.00024734763],"about_ca_topic_score_codex":0.00009091875,"about_ca_topic_score_gemma":3.0702657e-7,"teacher_disagreement_score":0.8429304,"about_ca_system_score_codex":0.000013196382,"about_ca_system_score_gemma":0.000017448932,"threshold_uncertainty_score":0.41769084},"labels":[],"label_agreement":null},{"id":"W2533956264","doi":"","title":"Probability matching via deterministic neural networks","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Time Series Analysis and Forecasting","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":"McGill University","funders":"","keywords":"Matching (statistics); Constructive; Computer science; Artificial neural network; Representation (politics); Artificial intelligence; Probability distribution; Observable; Machine learning; Mathematics; Statistics","score_opus":0.040941888686355205,"score_gpt":0.24356883946095936,"score_spread":0.20262695077460416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533956264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036392547,0.00018220882,0.9600888,0.00018074038,0.0009103255,0.00025628117,0.0000011282266,0.00040823806,0.0015797138],"genre_scores_gemma":[0.996918,3.6154606e-7,0.0026403447,0.00019702101,0.00014730568,0.000025369009,0.000012744759,0.0000069353327,0.000051920568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998196,0.00008058694,0.00075445895,0.0002045266,0.00042035995,0.00034407768],"domain_scores_gemma":[0.9985654,0.00003312305,0.00051601516,0.00034198,0.00036455668,0.00017896642],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00066627795,0.00018480369,0.00024944474,0.000106616215,0.00029386696,0.0016714471,0.00055635517,0.00007601383,0.0000015499384],"category_scores_gemma":[0.000072493734,0.00015181256,0.00006509073,0.0005244823,0.000039206563,0.006063329,0.00017244603,0.00018590322,0.000024588799],"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.00001235201,0.000016382382,0.0005108735,0.00023319492,0.000008939115,0.0000040243367,0.003366411,0.70116127,0.000009739081,0.00083562307,0.00033322035,0.29350796],"study_design_scores_gemma":[0.00015880092,0.000055405086,0.0001483183,0.000037703438,0.0000074108107,0.00012353771,0.00022285173,0.99776983,0.0000046547,0.00019932685,0.0010935573,0.00017860644],"about_ca_topic_score_codex":0.000093537914,"about_ca_topic_score_gemma":0.0000039939423,"teacher_disagreement_score":0.96052545,"about_ca_system_score_codex":0.000082561535,"about_ca_system_score_gemma":0.00006219738,"threshold_uncertainty_score":0.9993649},"labels":[],"label_agreement":null},{"id":"W2550039418","doi":"","title":"Multi-step learning and underlying structure in statistical models","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Semi-supervised learning; Machine learning; Unsupervised learning; Joint probability distribution; Algorithmic learning theory; Intuition; Transfer of learning; Multi-task learning; Theoretical computer science; Mathematics; Task (project management); Cognitive science","score_opus":0.0290997250675863,"score_gpt":0.29282301607554506,"score_spread":0.26372329100795877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550039418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02111685,0.00012348323,0.9778658,0.00024951843,0.00017874909,0.00010849857,0.0000030579906,0.0001712222,0.00018279004],"genre_scores_gemma":[0.97739655,0.000004568223,0.022378273,0.000056992758,0.00002102654,0.00000701754,0.000003846075,0.0000049140554,0.00012682308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989775,0.000088737506,0.00034565708,0.00015527249,0.00021985143,0.00021298577],"domain_scores_gemma":[0.9995244,0.00007910643,0.00017073138,0.000090314395,0.0000704554,0.00006499007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022688898,0.00011571315,0.00013810789,0.0001465377,0.00016220335,0.0005478635,0.00017498274,0.000060957515,0.0000020110135],"category_scores_gemma":[0.00008435017,0.000076682896,0.000010066319,0.00018005603,0.000028150096,0.0034903192,0.00007148465,0.00019762604,0.000006393971],"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.0000050113417,0.0000066260122,0.0027114244,0.00026789797,0.0000029696619,0.0000036374688,0.0025813414,0.026116658,0.00040557815,0.0073925992,0.00002668652,0.96047956],"study_design_scores_gemma":[0.00043816067,0.000027332939,0.0013473197,0.00014678012,0.000001007951,0.000046627105,0.00018771351,0.9968176,0.000008390337,0.00019000251,0.00066854287,0.00012052938],"about_ca_topic_score_codex":0.00007321429,"about_ca_topic_score_gemma":0.0000044791273,"teacher_disagreement_score":0.9707009,"about_ca_system_score_codex":0.000036457517,"about_ca_system_score_gemma":0.000035459027,"threshold_uncertainty_score":0.528306},"labels":[],"label_agreement":null},{"id":"W2550969563","doi":"","title":"Online Bayesian Moment Matching for Topic Modeling with Unknown Number of Topics","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Latent Dirichlet allocation; Hierarchical Dirichlet process; Hyperparameter; Topic model; Computer science; Dirichlet distribution; Matching (statistics); Dirichlet process; Bayesian probability; Moment (physics); Parametric statistics; Simple (philosophy); Machine learning; Prior probability; Artificial intelligence; Mathematics; Statistics","score_opus":0.024477576970147533,"score_gpt":0.27090619512226605,"score_spread":0.24642861815211853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550969563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07473148,0.00002615116,0.9233799,0.00092692266,0.0002578705,0.00025911623,0.000004232719,0.00010322071,0.0003110983],"genre_scores_gemma":[0.9419568,0.0000016833752,0.057538997,0.00012261365,0.00010899549,0.00003377645,0.0000049792766,0.000005930433,0.00022620737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988252,0.000021128148,0.000542978,0.00013897498,0.00027557,0.00019617938],"domain_scores_gemma":[0.99912006,0.000028752725,0.00027796865,0.00024908048,0.00027600533,0.000048123922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020713318,0.00011623943,0.00017344025,0.000071331175,0.00011410753,0.00017822893,0.00032409446,0.00005054036,0.0000011350288],"category_scores_gemma":[0.000016079974,0.00007255767,0.00003193956,0.00012644548,0.000012143867,0.0026207985,0.000052874548,0.00006095138,0.0000020858697],"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.000025513797,0.000052108826,0.00050269143,0.0017289089,0.00002282695,8.4208585e-7,0.0055879266,0.17509745,0.00037764222,0.10388825,0.00003419912,0.71268165],"study_design_scores_gemma":[0.00042075137,0.00003096585,0.000011784517,0.0003187798,0.0000041125813,0.000021983748,0.00017524874,0.99696124,0.00015995033,0.0006660309,0.001113214,0.000115946816],"about_ca_topic_score_codex":0.00003610772,"about_ca_topic_score_gemma":0.000002681201,"teacher_disagreement_score":0.86722535,"about_ca_system_score_codex":0.00005655701,"about_ca_system_score_gemma":0.00007286629,"threshold_uncertainty_score":0.29588157},"labels":[],"label_agreement":null},{"id":"W2551156993","doi":"","title":"Supervised Learning with Tensor Networks","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"MNIST database; Tensor (intrinsic definition); Artificial intelligence; Computer science; Machine learning; Tensor product; Set (abstract data type); Kernel (algebra); Moment tensor; Interpretation (philosophy); Matrix (chemical analysis); Supervised learning; Mathematics; Algorithm; Deep learning; Artificial neural network; Pure mathematics; Physics","score_opus":0.029951562186194405,"score_gpt":0.2749004509657065,"score_spread":0.24494888877951207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551156993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31889805,0.000084434025,0.6677238,0.0020928504,0.0002263445,0.00093741843,0.000011672024,0.0014630485,0.008562432],"genre_scores_gemma":[0.99711806,0.0000033503645,0.0014946389,0.00015222048,0.00009295138,0.00010602584,0.000013378229,0.000016030315,0.0010033419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990035,0.000042160627,0.0004173829,0.00010407771,0.00022960013,0.00020326015],"domain_scores_gemma":[0.9990889,0.00011022542,0.00029193592,0.00015660988,0.000277405,0.00007492276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015517164,0.00013332893,0.00016109305,0.00008415165,0.00026832512,0.00024437156,0.000121088604,0.000065602006,0.000027729076],"category_scores_gemma":[0.000053517677,0.00007586898,0.00003067468,0.00020926872,0.000040306546,0.0013618196,0.000015474257,0.000112478105,0.0000817624],"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.0005784621,0.0003874547,0.01985731,0.003375005,0.0002052212,0.000013508361,0.009406214,0.03855144,0.008542766,0.2038516,0.03488109,0.68034995],"study_design_scores_gemma":[0.0048838714,0.00037865908,0.0033461447,0.0019012664,0.00011136593,0.0006051345,0.0034894734,0.88139266,0.0009205582,0.0017629388,0.09984813,0.001359819],"about_ca_topic_score_codex":0.000004396355,"about_ca_topic_score_gemma":7.8137305e-7,"teacher_disagreement_score":0.8428412,"about_ca_system_score_codex":0.0000399409,"about_ca_system_score_gemma":0.00002321743,"threshold_uncertainty_score":0.30938473},"labels":[],"label_agreement":null},{"id":"W2551519396","doi":"","title":"Semiparametric Differential Graph Models","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Estimator; Computer science; Graph; Applied mathematics; Regularization (linguistics); Mathematical optimization; Mathematics; Algorithm; Theoretical computer science; Artificial intelligence; Statistics","score_opus":0.10001636218842617,"score_gpt":0.34036116459088067,"score_spread":0.24034480240245448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551519396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055636153,0.000047662572,0.9388107,0.000101433856,0.0004643116,0.00023532788,0.000022869172,0.00020942543,0.0044721346],"genre_scores_gemma":[0.98914987,0.0000061432156,0.010438479,0.000061640574,0.00008122116,0.000050872128,0.0000028094469,0.0000109809325,0.00019800618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985095,0.00008209219,0.0006457999,0.000120183264,0.00038528693,0.00025711948],"domain_scores_gemma":[0.99862415,0.0004895315,0.00033957988,0.00018636008,0.00026271841,0.00009769276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027136065,0.000157733,0.0002458838,0.00020882665,0.00013019994,0.00025107808,0.00017417525,0.00009283924,0.0000399843],"category_scores_gemma":[0.00083241204,0.0000910467,0.000049811868,0.00034473435,0.000042173873,0.0015696088,0.000035012392,0.000092421,0.000045624845],"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.00003914417,0.00004784702,0.00018743666,0.0010652731,0.000019879382,0.00000117938,0.00072276744,0.00013028279,0.0009645165,0.49085283,0.0028709662,0.5030979],"study_design_scores_gemma":[0.0014084592,0.00016642881,0.00047245444,0.0008920171,0.00006019739,0.00006986183,0.0003295767,0.5132379,0.0012587402,0.47988346,0.001535591,0.00068532577],"about_ca_topic_score_codex":0.000012186597,"about_ca_topic_score_gemma":2.452099e-7,"teacher_disagreement_score":0.9335137,"about_ca_system_score_codex":0.00004125435,"about_ca_system_score_gemma":0.000032456363,"threshold_uncertainty_score":0.37127766},"labels":[],"label_agreement":null},{"id":"W2551857043","doi":"","title":"Launch and Iterate: Reducing Prediction Churn","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Machine learning; Classifier (UML); Benchmark (surveying); Artificial intelligence; Usability; Operator (biology); Markov chain; Monte Carlo method; Mathematical optimization; Mathematics; Statistics","score_opus":0.013836565528880913,"score_gpt":0.2326989134256209,"score_spread":0.21886234789674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551857043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074096456,0.00020123694,0.9182176,0.0011713926,0.0008275343,0.00036528878,0.00004043968,0.001888598,0.0031914585],"genre_scores_gemma":[0.9944967,0.0000098593655,0.0050831526,0.00010146214,0.00007057571,0.00003732686,0.000010686993,0.0000047049275,0.00018550456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902725,0.00003317079,0.00038061469,0.00015800392,0.00023007259,0.00017090607],"domain_scores_gemma":[0.99925387,0.000029341805,0.00024060873,0.00026539652,0.00015171949,0.00005904826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031367113,0.00010835768,0.000105660074,0.0001547765,0.00015713234,0.0009511455,0.0003051953,0.000059399415,0.0000014179774],"category_scores_gemma":[0.00007020209,0.00007230877,0.000012370943,0.00021881355,0.000031369644,0.010072696,0.000117142365,0.000060899853,0.000018738474],"study_design_candidate":"design_other","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.000005742025,0.000007963952,0.0010192568,0.00029216544,0.000004688232,0.0000012961438,0.002145202,0.0000320649,0.0028263016,0.00373462,0.0065549337,0.9833758],"study_design_scores_gemma":[0.0010223736,0.0003217805,0.0046423017,0.0023642478,0.000011413284,0.0007793456,0.00024442424,0.896428,0.010848529,0.00060001266,0.08209531,0.0006422832],"about_ca_topic_score_codex":0.000019876308,"about_ca_topic_score_gemma":2.0347537e-7,"teacher_disagreement_score":0.9827335,"about_ca_system_score_codex":0.000047681264,"about_ca_system_score_gemma":0.000038205315,"threshold_uncertainty_score":0.91719174},"labels":[],"label_agreement":null},{"id":"W2553665199","doi":"","title":"The Forget-me-not Process","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Piecewise; Computer science; Logarithm; Probabilistic logic; Sequence (biology); Task (project management); Partition (number theory); Range (aeronautics); Process (computing); Data mining; Parametric statistics; Bayesian probability; Algorithm; Identification (biology); Artificial intelligence; Machine learning; Mathematics; Statistics; Engineering","score_opus":0.09964141962034775,"score_gpt":0.4246329324623445,"score_spread":0.3249915128419968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553665199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1024968,0.0019170078,0.84954435,0.022235695,0.00609411,0.0032038835,0.00012793437,0.0010554254,0.01332477],"genre_scores_gemma":[0.9922076,0.000017296601,0.000054101427,0.00016930954,0.00021031225,0.00013449883,0.0000024460987,0.000011546175,0.0071929307],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950955,0.00014640059,0.0012143522,0.00024493903,0.002782738,0.00051609706],"domain_scores_gemma":[0.9956794,0.0011651301,0.0007193568,0.00051652465,0.0017761864,0.00014342407],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029824635,0.00017428008,0.00022052556,0.00024569305,0.0010287575,0.0021030267,0.0012230958,0.00008607092,0.00001371007],"category_scores_gemma":[0.004628016,0.000071318056,0.00006634726,0.0008997413,0.00022394658,0.007812628,0.00011269158,0.00016646665,0.0006845546],"study_design_candidate":"design_other","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.000059133643,0.0000060394627,0.0003393521,0.000042713535,0.0000042743472,9.197072e-7,0.0006866737,0.0011856479,0.00020909685,0.00036059247,0.0029157486,0.9941898],"study_design_scores_gemma":[0.001585638,0.00017467806,0.0014862851,0.00026230377,0.0000073562624,0.00016083094,0.0082284855,0.33149397,0.0063996906,0.008270257,0.6413179,0.0006126252],"about_ca_topic_score_codex":0.000006457011,"about_ca_topic_score_gemma":0.000003285446,"teacher_disagreement_score":0.9935772,"about_ca_system_score_codex":0.00009249312,"about_ca_system_score_gemma":0.00018592288,"threshold_uncertainty_score":0.9989329},"labels":[],"label_agreement":null},{"id":"W2553718801","doi":"","title":"Proximal Deep Structured Models","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":68,"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; ENCODE; Inference; Artificial intelligence; Image (mathematics); Deep learning; Artificial neural network; Noise reduction; Algorithm; Optical flow; Recurrent neural network; Pattern recognition (psychology)","score_opus":0.01742967120494543,"score_gpt":0.25272953551815064,"score_spread":0.2352998643132052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553718801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011547969,0.00012747024,0.995007,0.0005855741,0.00048432263,0.00017835577,0.000001459175,0.0003853823,0.0020756393],"genre_scores_gemma":[0.97898823,0.0000029739945,0.02037339,0.00040204255,0.000054127966,0.000020816895,0.0000018608757,0.0000052850214,0.00015129417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988786,0.000025531566,0.00039189743,0.0001445957,0.0003241127,0.00023529369],"domain_scores_gemma":[0.99918354,0.000019021598,0.00025104123,0.00024481647,0.00022292767,0.000078633726],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00012503722,0.00012223775,0.00012056326,0.00012398737,0.00017704513,0.0005779897,0.00044158753,0.00004083736,0.0000029911755],"category_scores_gemma":[0.000034045494,0.00007398957,0.000028065215,0.00024252073,0.000026625641,0.015210997,0.00008944084,0.000066723755,0.000048818125],"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.0000045111183,0.0000034693974,0.000034379005,0.00007197615,0.0000017111179,6.849523e-7,0.00085919985,0.0027058944,0.0008773889,0.0103277825,0.00017443493,0.98493856],"study_design_scores_gemma":[0.00030922212,0.00001748449,0.00006564472,0.000092863076,9.692516e-7,0.000051006056,0.00007298282,0.9930926,0.0006308666,0.0017014777,0.0038301507,0.0001347511],"about_ca_topic_score_codex":0.000002775913,"about_ca_topic_score_gemma":2.1648773e-7,"teacher_disagreement_score":0.99038666,"about_ca_system_score_codex":0.00004859952,"about_ca_system_score_gemma":0.000044513243,"threshold_uncertainty_score":0.99856275},"labels":[],"label_agreement":null},{"id":"W2554954837","doi":"","title":"Fast and Flexible Monotonic Functions with Ensembles of Lattices","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monotonic function; Regularization (linguistics); Computer science; Feature (linguistics); Random forest; Artificial intelligence; Base (topology); Key (lock); Algorithm; Machine learning; Mathematical optimization; Mathematics","score_opus":0.0177979369090654,"score_gpt":0.2283673053453767,"score_spread":0.2105693684363113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554954837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059180893,0.00019604384,0.938318,0.0003406857,0.00010591945,0.00009631354,0.000003173287,0.00015819736,0.0016007473],"genre_scores_gemma":[0.99775827,0.000009408133,0.0019055716,0.00004841993,0.000015363637,0.000016511856,9.4976986e-7,0.0000029259309,0.0002425536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992789,0.000019854844,0.0002822928,0.00010519748,0.0001825487,0.00013122185],"domain_scores_gemma":[0.9993106,0.000034278706,0.00023470337,0.00015774241,0.00021333035,0.00004935857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013144714,0.00008841367,0.000116222865,0.000099974975,0.00011686269,0.00028096535,0.00017508639,0.00003812609,0.000001046516],"category_scores_gemma":[0.000012023885,0.000051036917,0.000012017163,0.00020052739,0.000049887516,0.0035416926,0.00003726097,0.000043791257,0.000011435308],"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.000036241974,0.000026952675,0.002043476,0.0008315862,0.000021832562,8.2676894e-7,0.0034074446,0.006506875,0.003486308,0.029158385,0.0003313663,0.9541487],"study_design_scores_gemma":[0.00067879923,0.0002904052,0.0013450917,0.00091335876,0.000014761393,0.00013248535,0.00057152123,0.98997897,0.003693589,0.0003893391,0.0016828795,0.00030882627],"about_ca_topic_score_codex":0.000025128687,"about_ca_topic_score_gemma":0.0000016291845,"teacher_disagreement_score":0.98347205,"about_ca_system_score_codex":0.000012686195,"about_ca_system_score_gemma":0.000067269764,"threshold_uncertainty_score":0.27093554},"labels":[],"label_agreement":null},{"id":"W2556540011","doi":"","title":"Convex Two-Layer Modeling with Latent Structure","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Inference; Computer science; Artificial intelligence; Maximum a posteriori estimation; Normalization (sociology); A priori and a posteriori; Structured prediction; Latent variable; Representation (politics); Machine learning; Algorithm; Mathematical optimization; Mathematics; Maximum likelihood; Statistics","score_opus":0.020898063017602327,"score_gpt":0.23722487203319947,"score_spread":0.21632680901559714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556540011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010084499,0.000035091572,0.98787665,0.0003714748,0.00027952093,0.00028907397,0.0000039981014,0.0006531985,0.0004065171],"genre_scores_gemma":[0.9817044,0.0000010804494,0.017947275,0.0002162152,0.00003848145,0.000033118573,0.000004652375,0.000007936883,0.00004681021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878585,0.000023722023,0.00040801795,0.0001648023,0.0003962053,0.00022136973],"domain_scores_gemma":[0.99893165,0.000020211299,0.00027759382,0.0002701619,0.00042678323,0.00007360991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012015206,0.00015337374,0.00014773071,0.00017174146,0.00015035781,0.0005333885,0.00039918997,0.000055078537,0.000004048096],"category_scores_gemma":[0.000025379846,0.00008757972,0.000019449346,0.00031106954,0.000027818556,0.0049142637,0.000059831254,0.00007346408,0.000014981032],"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.000044571625,0.000023056402,0.0007911422,0.00040360412,0.000029923582,0.0000043043683,0.0041193655,0.7415978,0.0024705355,0.13103552,0.0005005286,0.11897969],"study_design_scores_gemma":[0.0004089742,0.00004854539,0.000016444483,0.00019319686,0.0000034130373,0.00007929371,0.00003354241,0.99779564,0.0008112885,0.0003374402,0.000111607624,0.0001606168],"about_ca_topic_score_codex":0.000012672121,"about_ca_topic_score_gemma":5.046486e-7,"teacher_disagreement_score":0.9716199,"about_ca_system_score_codex":0.00006639275,"about_ca_system_score_gemma":0.00006623774,"threshold_uncertainty_score":0.5143478},"labels":[],"label_agreement":null},{"id":"W2560977758","doi":"","title":"Learning Deep Parsimonious Representations","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":90,"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; University of Toronto","funders":"","keywords":"Interpretability; Cluster analysis; Conceptual clustering; Computer science; Artificial intelligence; Categorization; Machine learning; Generalization; Deep learning; Regularization (linguistics); Correlation clustering; Canopy clustering algorithm; Mathematics","score_opus":0.0174282915545141,"score_gpt":0.25559353851138034,"score_spread":0.23816524695686625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560977758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004650016,0.000080219834,0.9825344,0.0010243,0.000387341,0.00016348151,6.822206e-7,0.0006457313,0.010513833],"genre_scores_gemma":[0.9939426,0.000007952332,0.004079036,0.0002944857,0.000049418002,0.000039372517,0.000005715163,0.000007041763,0.0015743654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861634,0.000088815585,0.00048067604,0.00017024655,0.00038690816,0.00025703324],"domain_scores_gemma":[0.9989467,0.00009111809,0.00038532075,0.00022619663,0.00025209086,0.000098556455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033263065,0.0001225411,0.00012395848,0.00018318731,0.00042079017,0.000870749,0.0003887669,0.00005743322,0.0000074262334],"category_scores_gemma":[0.00024694676,0.00008787307,0.000041076135,0.00038831664,0.000035931753,0.006363098,0.00007433237,0.00012895888,0.000267893],"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.000008146092,0.000013551395,0.0016186623,0.00010015581,0.000009243411,0.0000028538084,0.008694245,0.12112725,0.00083859655,0.02054755,0.0007999907,0.84623975],"study_design_scores_gemma":[0.00035606063,0.000032215732,0.00056381815,0.00006763408,0.000002569185,0.00003505976,0.0006905243,0.9792805,0.0001088534,0.00015500517,0.018547865,0.00015994551],"about_ca_topic_score_codex":0.000008544836,"about_ca_topic_score_gemma":7.61469e-7,"teacher_disagreement_score":0.9892926,"about_ca_system_score_codex":0.00005850805,"about_ca_system_score_gemma":0.0000689448,"threshold_uncertainty_score":0.8396653},"labels":[],"label_agreement":null},{"id":"W2594924640","doi":"","title":"Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimization","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Statistical Methods and Inference","field":"Mathematics","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 Waterloo","funders":"","keywords":"Latent variable; Algorithm; Gaussian; Matrix (chemical analysis); Thresholding; Graphical model; Mathematics; Rank (graph theory); Mathematical optimization; Gradient descent; Sparse matrix; Estimator; Relaxation (psychology); Matrix decomposition; Non-negative matrix factorization; Computer science; Artificial intelligence; Statistics; Artificial neural network","score_opus":0.09611852067239748,"score_gpt":0.3640675642708825,"score_spread":0.26794904359848504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594924640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002418737,0.000012714387,0.98958975,0.0002060446,0.00069829734,0.00036075307,0.000012049082,0.00017017165,0.006531458],"genre_scores_gemma":[0.67173624,0.0000028511397,0.3279053,0.000072636605,0.00007618687,0.00004042223,0.000020760057,0.000014713634,0.00013092266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982401,0.000054063938,0.00081046706,0.00016778274,0.00044573084,0.00028182103],"domain_scores_gemma":[0.998074,0.00012396532,0.000923864,0.00035371789,0.00039969472,0.0001247837],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007303496,0.0002033554,0.0003033797,0.00013035611,0.00083485286,0.0013767314,0.0003021765,0.00016735695,0.000024317715],"category_scores_gemma":[0.0014443356,0.00017056768,0.00004337167,0.00012791243,0.000065386055,0.0032165311,0.00006637937,0.00021940106,0.000018275221],"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.000051634684,0.000049679762,0.00032171613,0.0023199262,0.000023937435,0.0000014758729,0.001447844,0.63826454,0.00025747094,0.28964692,0.0008486933,0.06676618],"study_design_scores_gemma":[0.00034946608,0.000031417978,0.000099057674,0.00029661504,0.000029288778,0.000022292299,0.000057246725,0.9658691,0.00008086377,0.032924913,0.000037784317,0.00020191594],"about_ca_topic_score_codex":0.000046373312,"about_ca_topic_score_gemma":4.8650355e-7,"teacher_disagreement_score":0.6693175,"about_ca_system_score_codex":0.00006587951,"about_ca_system_score_gemma":0.00007210701,"threshold_uncertainty_score":0.99965996},"labels":[],"label_agreement":null},{"id":"W2750673042","doi":"","title":"Inverse Filtering for Hidden Markov Models","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hidden Markov model; Sequence (biology); Viterbi algorithm; Computer science; Filter (signal processing); Algorithm; Inverse; Markov chain; Simple (philosophy); Integer (computer science); Inverse problem; Markov model; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning; Computer vision","score_opus":0.04701140439472471,"score_gpt":0.27376747057125816,"score_spread":0.22675606617653346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750673042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005483937,0.000073499636,0.9857671,0.00046864094,0.0022622119,0.00036656068,0.000021369835,0.00039210092,0.005164569],"genre_scores_gemma":[0.96636283,0.0000066211323,0.032674696,0.0003031146,0.00023114728,0.00007044137,0.000035133846,0.000008812941,0.0003072042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988604,0.00001929654,0.00042305756,0.00017423967,0.00025501204,0.00026799407],"domain_scores_gemma":[0.9984395,0.000038425835,0.0005269656,0.00068688317,0.00022533453,0.00008289015],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032140914,0.00013666994,0.00015845658,0.00008915845,0.0010608032,0.0035399217,0.0011355196,0.00008370892,0.0000016534414],"category_scores_gemma":[0.000078097066,0.00012086914,0.000049214465,0.00006592106,0.00003511521,0.011899391,0.00021697934,0.00010815838,0.00002359842],"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.000038768372,0.000020596251,0.00020824958,0.0010268533,0.000015572767,0.0000039371735,0.003318322,0.045226865,0.00018162823,0.016342701,0.037664216,0.8959523],"study_design_scores_gemma":[0.00030091303,0.000019413512,0.000088931076,0.00012413626,0.000003008269,0.000025558613,0.000076165634,0.984089,0.00007065778,0.00038575064,0.014659595,0.00015686546],"about_ca_topic_score_codex":0.000046804165,"about_ca_topic_score_gemma":0.0000019677957,"teacher_disagreement_score":0.9608789,"about_ca_system_score_codex":0.000028394596,"about_ca_system_score_gemma":0.00004013951,"threshold_uncertainty_score":0.9974945},"labels":[],"label_agreement":null},{"id":"W2750726423","doi":"","title":"Natural Value Approximators: Learning when to Trust Past Estimates","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Observability; Reinforcement learning; Bellman equation; Classification of discontinuities; Interpolation (computer graphics); Computer science; Value (mathematics); Artificial neural network; Discontinuity (linguistics); Function approximation; Inductive bias; Artificial intelligence; Function (biology); Mathematical optimization; Algorithm; Machine learning; Mathematics; Applied mathematics; Image (mathematics); Multi-task learning","score_opus":0.01702164821844596,"score_gpt":0.264931605515689,"score_spread":0.24790995729724305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750726423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011809858,0.00006900305,0.97775424,0.0010422932,0.0019001579,0.0005103405,7.210636e-7,0.00075752905,0.00615587],"genre_scores_gemma":[0.9807247,9.516551e-7,0.017910175,0.00030123722,0.00017976528,0.00004729583,0.000013722244,0.00001460195,0.0008075781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979434,0.000047799684,0.0006552893,0.00024514188,0.0006580655,0.00045030398],"domain_scores_gemma":[0.9978771,0.0000490816,0.00090450473,0.00069684396,0.0003180133,0.00015443745],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004964991,0.000253868,0.0002660428,0.00022018673,0.0015272036,0.007459884,0.0017079615,0.00009125905,0.0000021369601],"category_scores_gemma":[0.000508384,0.00022242423,0.000056256184,0.00016537512,0.00005705388,0.010412533,0.0004536705,0.0003775054,0.0002421855],"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.000008276865,0.000006888933,0.0065605063,0.0004822203,0.000014085018,0.000003133743,0.0058476576,0.9530508,0.00016333318,0.005568286,0.0014036875,0.026891159],"study_design_scores_gemma":[0.0002475296,0.000064245105,0.0017767806,0.00023320431,0.0000055362907,0.00004514326,0.00023962313,0.9867523,0.00025286814,0.00003574179,0.010068619,0.00027842453],"about_ca_topic_score_codex":0.00005532262,"about_ca_topic_score_gemma":3.0044433e-7,"teacher_disagreement_score":0.9689148,"about_ca_system_score_codex":0.00009867145,"about_ca_system_score_gemma":0.00006966023,"threshold_uncertainty_score":0.99977267},"labels":[],"label_agreement":null},{"id":"W2751109772","doi":"","title":"Min-Max Propagation","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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":"Belief propagation; Job shop scheduling; Minification; Inference; Set (abstract data type); Factor graph; Computer science; Function (biology); Propagation delay; Mathematical optimization; Combinatorics; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Schedule; Decoding methods","score_opus":0.01574268461058346,"score_gpt":0.2681194521659511,"score_spread":0.25237676755536764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751109772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018230012,0.00013393167,0.9412628,0.0035857754,0.0026617232,0.00041850662,0.0000023090208,0.0007828137,0.03292213],"genre_scores_gemma":[0.9968638,0.0000010226858,0.0020604949,0.00012914426,0.00016228374,0.000022834764,0.0000070893293,0.0000038815147,0.00074944866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990445,0.00003206794,0.00031328335,0.00012230602,0.00031247453,0.00017537756],"domain_scores_gemma":[0.9987088,0.000011373453,0.000577183,0.00045806568,0.00018693869,0.000057662328],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003068089,0.000104268336,0.00011099979,0.000084096064,0.00095271,0.0037145817,0.00079143175,0.0000489146,0.0000018124528],"category_scores_gemma":[0.00013578995,0.0000844472,0.000027328455,0.00008279401,0.00003027865,0.007859285,0.00010885132,0.00013862933,0.0001302634],"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.0000033760998,0.00001400938,0.0008826259,0.00033848386,0.000004277142,0.0000026777882,0.0020225868,0.003665173,0.0000771999,0.009386432,0.0011557863,0.9824474],"study_design_scores_gemma":[0.00017616885,0.000031880296,0.001479434,0.00007432947,0.000001659082,0.000031819032,0.00003944896,0.97984606,0.00011180778,0.00008068907,0.018005274,0.000121421945],"about_ca_topic_score_codex":0.00008053721,"about_ca_topic_score_gemma":6.6072596e-7,"teacher_disagreement_score":0.982326,"about_ca_system_score_codex":0.000024306266,"about_ca_system_score_gemma":0.000051196854,"threshold_uncertainty_score":0.99731964},"labels":[],"label_agreement":null},{"id":"W2751223050","doi":"","title":"Multitask Spectral Learning of Weighted Automata","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Representation (politics); Multi-task learning; Artificial intelligence; Automaton; Learning automata; Feature learning; Vector space; Machine learning; Theoretical computer science; Task (project management); Mathematics","score_opus":0.013211264280660433,"score_gpt":0.26776658986475527,"score_spread":0.2545553255840948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751223050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2750609,0.00026912076,0.68806523,0.0016795923,0.0031605696,0.0005359034,0.000006889196,0.0016430634,0.029578721],"genre_scores_gemma":[0.99461657,0.0000024631581,0.004866171,0.000028244434,0.00009018455,0.0000069378234,0.000007630378,0.000004902682,0.00037687752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884576,0.000051632906,0.0004337425,0.00012600113,0.0003407694,0.00020210065],"domain_scores_gemma":[0.9984267,0.000023226223,0.0008772489,0.00043804996,0.00017636154,0.000058431197],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003641944,0.00011935626,0.00018202956,0.00012082212,0.0006740984,0.001360347,0.00090496504,0.00005542431,0.000002709164],"category_scores_gemma":[0.0001459828,0.00009943918,0.00004314072,0.00010912173,0.00004765804,0.0049305325,0.00014752254,0.0002293342,0.00004368095],"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.00001579546,0.000051658782,0.010333678,0.0012484791,0.000027530092,0.000007766157,0.006479525,0.02001704,0.0007541594,0.017404249,0.00060237426,0.9430577],"study_design_scores_gemma":[0.0003234402,0.00005091902,0.004198554,0.00011292733,0.0000027707392,0.000032031392,0.000081359576,0.9907187,0.00042434625,0.000034445296,0.0039015997,0.00011886559],"about_ca_topic_score_codex":0.00016676022,"about_ca_topic_score_gemma":5.1487586e-7,"teacher_disagreement_score":0.9707017,"about_ca_system_score_codex":0.000019668421,"about_ca_system_score_gemma":0.00005080908,"threshold_uncertainty_score":0.99967635},"labels":[],"label_agreement":null},{"id":"W2751966825","doi":"","title":"Robust Estimation of Neural Signals in Calcium Imaging","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Calcium imaging; Minimax; Pattern recognition (psychology); Estimation; Convergence (economics); Machine learning; Calcium; Mathematics; Mathematical optimization; Chemistry","score_opus":0.04120609839372435,"score_gpt":0.2724019457842065,"score_spread":0.23119584739048216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751966825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8534936,0.0006400328,0.1347778,0.00015032422,0.0010423108,0.00053867884,0.000009814192,0.0009308321,0.008416622],"genre_scores_gemma":[0.9994456,0.0000030424912,0.00043950256,0.000024752335,0.000039555107,0.000015951517,0.000011313553,0.000011837834,0.000008435018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990713,0.00001611538,0.0004985869,0.00006799644,0.0001787032,0.00016727264],"domain_scores_gemma":[0.99930257,0.000014940098,0.00029759953,0.00024055573,0.00011448448,0.000029828532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001524226,0.0001257033,0.00019069308,0.00017922228,0.00013355202,0.00041004078,0.0002135268,0.000052438125,0.0000017422104],"category_scores_gemma":[0.000052748885,0.00012180436,0.000029150204,0.00007995616,0.00004107098,0.0030271863,0.00003015128,0.00012347197,0.0000046156138],"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.000004303269,0.0000034724164,0.0009441688,0.00020898256,0.000002362335,0.0000016117975,0.00036414937,0.9494467,0.0017433661,0.00003238682,0.00029653084,0.046952017],"study_design_scores_gemma":[0.0001595406,0.000007282104,0.0027895935,0.00035215766,0.0000043233454,0.00001860148,0.00011335793,0.98794925,0.0083557265,0.000031435105,0.0000982631,0.00012043768],"about_ca_topic_score_codex":0.0001431744,"about_ca_topic_score_gemma":0.0000024502845,"teacher_disagreement_score":0.14595203,"about_ca_system_score_codex":0.000040279305,"about_ca_system_score_gemma":0.00001371881,"threshold_uncertainty_score":0.49670377},"labels":[],"label_agreement":null},{"id":"W2752879962","doi":"","title":"Dualing GANs","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discriminator; Saddle point; Computer science; Generator (circuit theory); Maximization; Intuition; Generative grammar; Nonlinear system; Instability; Saddle; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Physics","score_opus":0.025384020099854365,"score_gpt":0.2835047631480933,"score_spread":0.25812074304823895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752879962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6225939,0.00018068714,0.107350014,0.0017202856,0.0057528685,0.00080087525,0.000035654626,0.0004403499,0.2611254],"genre_scores_gemma":[0.99825,8.9614133e-7,0.000044610533,0.000073556585,0.00058281654,0.000023464017,0.000025880136,0.0000066308326,0.000992124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992613,0.0000142374065,0.00030477345,0.000084095875,0.00016195387,0.00017362976],"domain_scores_gemma":[0.99915624,0.0000064702076,0.00042778163,0.00023499886,0.00010982022,0.000064695174],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000107012114,0.00010617235,0.00011886903,0.00004225729,0.0008857478,0.0012745648,0.00019994065,0.000032517837,0.00005190536],"category_scores_gemma":[0.0000066984867,0.000090273104,0.00004420973,0.0000371668,0.000037003672,0.003014711,0.000033610548,0.00012972849,0.00008406726],"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.000046237707,0.000057109435,0.018558355,0.00041467848,0.000050043294,0.0000014706147,0.0029468858,0.052626222,0.00057631603,0.03608393,0.013839168,0.8747996],"study_design_scores_gemma":[0.00060674176,0.000020956102,0.0012985219,0.00015979336,0.00001573851,0.000013800854,0.0011887216,0.935326,0.00076284545,0.00031554833,0.05995393,0.0003374076],"about_ca_topic_score_codex":0.000110556226,"about_ca_topic_score_gemma":2.6348474e-7,"teacher_disagreement_score":0.8826998,"about_ca_system_score_codex":0.000010370726,"about_ca_system_score_gemma":0.000024514784,"threshold_uncertainty_score":0.99976224},"labels":[],"label_agreement":null},{"id":"W2753305392","doi":"","title":"Multi-view Matrix Factorization for Linear Dynamical System Estimation","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Control Systems and Identification","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Maxima and minima; Subspace topology; Linear dynamical system; Mathematical optimization; Computer science; Estimation theory; Expectation–maximization algorithm; Maximization; Algorithm; Matrix decomposition; Identification (biology); Linear system; Mathematics; Artificial intelligence; Maximum likelihood; Statistics","score_opus":0.02090283911629836,"score_gpt":0.28340006036312954,"score_spread":0.26249722124683117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753305392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01670163,0.00034586914,0.97773695,0.000051895666,0.0027613943,0.0012864466,0.00005938714,0.00077335513,0.00028304974],"genre_scores_gemma":[0.99766344,0.0000050264675,0.0013866258,0.000004843594,0.00023033553,0.00027904692,0.00024684158,0.000025228523,0.00015859354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986482,0.000019893412,0.0007701509,0.00012200037,0.00023045212,0.00020927549],"domain_scores_gemma":[0.9987502,0.000020118712,0.00049317844,0.00033800807,0.0003317408,0.000066732544],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003080827,0.00018104922,0.00025572372,0.00012170198,0.00060950295,0.001371081,0.00024101467,0.00014033071,0.0000010261157],"category_scores_gemma":[0.00011736572,0.0001694028,0.000064115935,0.00007016182,0.000018927005,0.0038541846,0.000016054542,0.00008940068,0.00006515976],"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.000047975755,0.000033081913,0.0007864701,0.027223734,0.000075898104,8.592016e-7,0.0018336662,0.77590495,0.007807828,0.003541781,0.0011164178,0.18162736],"study_design_scores_gemma":[0.00058113574,0.000012942107,0.0014162527,0.00036457463,0.000021250611,0.000012243772,0.00017850134,0.9932414,0.00010147295,0.0000029874313,0.0038877854,0.00017942803],"about_ca_topic_score_codex":0.000061089566,"about_ca_topic_score_gemma":0.000005871656,"teacher_disagreement_score":0.9809618,"about_ca_system_score_codex":0.00019613662,"about_ca_system_score_gemma":0.000024361867,"threshold_uncertainty_score":0.9996656},"labels":[],"label_agreement":null},{"id":"W2753431380","doi":"","title":"Second-order Optimization for Deep Reinforcement Learning using Kronecker-factored Approximation","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","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":"Kronecker delta; Reinforcement learning; Computer science; Scalability; Curvature; Trust region; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.0371741992360738,"score_gpt":0.28445717157899536,"score_spread":0.24728297234292157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753431380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018694324,0.00003146362,0.9936087,0.0001024438,0.0009695865,0.000911873,7.2452895e-7,0.0002444733,0.0022612938],"genre_scores_gemma":[0.91380376,0.0000032187963,0.08535161,0.00009412473,0.00012348837,0.00008327051,0.00010472823,0.000019128724,0.00041667637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978343,0.000051657,0.00090353994,0.00024896328,0.0005469827,0.00041451768],"domain_scores_gemma":[0.9965259,0.000045630295,0.0019507811,0.00058840506,0.00079483184,0.000094497605],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005815895,0.00025513637,0.00026169306,0.00023060561,0.0018988175,0.0045086914,0.00088072073,0.00014675314,0.000014096291],"category_scores_gemma":[0.00042037995,0.00024885716,0.00006641103,0.00019010715,0.00005134557,0.013304263,0.00019085166,0.00021594464,0.000019763676],"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.000008880264,0.0000040311984,0.00012667512,0.00040793017,0.000011165293,1.9596641e-7,0.0013583603,0.98823947,0.00008445798,0.0009411682,0.000036445268,0.0087812245],"study_design_scores_gemma":[0.00071528147,0.000086120934,0.00006322516,0.00012792471,0.0000127516805,0.000014894957,0.00022111855,0.99582076,0.00030582782,0.000010291237,0.0023313516,0.00029042634],"about_ca_topic_score_codex":0.000019195468,"about_ca_topic_score_gemma":7.3546977e-7,"teacher_disagreement_score":0.9119343,"about_ca_system_score_codex":0.00019528739,"about_ca_system_score_gemma":0.00013154591,"threshold_uncertainty_score":0.99999636},"labels":[],"label_agreement":null},{"id":"W2753433947","doi":"","title":"A Meta-Learning Perspective on Cold-Start Recommendations for Items","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":148,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Cold start (automotive); Deep learning; Artificial intelligence; Machine learning; Artificial neural network; Matrix decomposition; Classifier (UML); Perspective (graphical); Recommender system; Architecture","score_opus":0.12000308892674987,"score_gpt":0.3450282478510309,"score_spread":0.22502515892428104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753433947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000516836,0.00030736902,0.95233274,0.01600288,0.0021180967,0.0018234422,0.000024401754,0.0011040051,0.025770223],"genre_scores_gemma":[0.9917522,0.0000076018664,0.005808703,0.00048308572,0.00014868045,0.0007588282,0.000014681001,0.000012715762,0.0010135148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855524,0.00008251398,0.0005685384,0.00024099302,0.00028465726,0.0002680692],"domain_scores_gemma":[0.9976212,0.00009736812,0.0010337832,0.0005710344,0.0005966598,0.000079974336],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076554425,0.00020177364,0.00033597232,0.00019854645,0.0017237227,0.0038355074,0.00085958216,0.00008963855,0.0000029666226],"category_scores_gemma":[0.00016425495,0.00016153378,0.00014714507,0.00011427771,0.000029314058,0.00659945,0.00010747038,0.00020079748,0.000024281557],"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.000044440883,0.00012466105,0.00027718677,0.0009392287,0.0006640643,0.0000027467747,0.018213002,0.0018676075,0.00023589085,0.7997376,0.061440967,0.11645265],"study_design_scores_gemma":[0.0006019119,0.00034726266,0.00008423983,0.00020242816,0.00008232411,0.00003299298,0.0017948133,0.45917904,0.0009792112,0.000970916,0.535298,0.0004268597],"about_ca_topic_score_codex":0.00026349936,"about_ca_topic_score_gemma":0.00000510828,"teacher_disagreement_score":0.9912354,"about_ca_system_score_codex":0.0001509621,"about_ca_system_score_gemma":0.000067598005,"threshold_uncertainty_score":0.9995759},"labels":[],"label_agreement":null},{"id":"W2753686090","doi":"","title":"DropoutNet: Addressing Cold Start in Recommender Systems","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":154,"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":"Cold start (automotive); Computer science; Recommender system; Scalability; Dropout (neural networks); Deep learning; Focus (optics); Artificial neural network; Artificial intelligence; Code (set theory); Machine learning; Deep neural networks; Database","score_opus":0.0726473000804211,"score_gpt":0.31022009474309764,"score_spread":0.23757279466267656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753686090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036222633,0.0027227288,0.85790807,0.00477258,0.0131899025,0.0038976474,0.000030363964,0.002771472,0.07848459],"genre_scores_gemma":[0.99813133,0.000011067146,0.0010421022,0.00018235302,0.0001445684,0.00018036763,0.000008007919,0.0000146901975,0.00028549487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997522,0.00014094754,0.0010883933,0.000292326,0.00049405615,0.0004622768],"domain_scores_gemma":[0.9973373,0.00004073627,0.0012352266,0.001011711,0.00025598236,0.00011906427],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010908731,0.0002667284,0.00041311784,0.00033695347,0.00084955,0.0072417296,0.0014846666,0.00017280536,0.0000018451912],"category_scores_gemma":[0.00006598898,0.0002342978,0.000057829893,0.00020789688,0.000047810106,0.012285917,0.00027384184,0.00029466557,0.00003751385],"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.000088989764,0.0004374054,0.05134796,0.012919767,0.00015357845,0.00014686598,0.028214792,0.010359134,0.0017514728,0.1890493,0.11905465,0.5864761],"study_design_scores_gemma":[0.00080261024,0.00007847313,0.001978395,0.0014488592,0.000004782539,0.00013431224,0.0007747171,0.9053835,0.0004240778,0.00011613928,0.088279754,0.0005743564],"about_ca_topic_score_codex":0.0010814848,"about_ca_topic_score_gemma":0.000017464778,"teacher_disagreement_score":0.9619087,"about_ca_system_score_codex":0.00018398032,"about_ca_system_score_gemma":0.00011035778,"threshold_uncertainty_score":0.99378884},"labels":[],"label_agreement":null},{"id":"W2753798143","doi":"","title":"Deep Sets","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":318,"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":"Anomaly detection; Computer science; Invariant (physics); Statistic; Population; Outlier; Artificial intelligence; Permutation (music); Machine learning; Data mining; Pattern recognition (psychology); Theoretical computer science; Mathematics; Statistics","score_opus":0.02175104945544126,"score_gpt":0.28259626304558094,"score_spread":0.2608452135901397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753798143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001724631,0.000036731617,0.97727203,0.00079056923,0.00028495866,0.00018959575,8.5793477e-7,0.0005227535,0.019177893],"genre_scores_gemma":[0.9945038,0.000002895382,0.004980181,0.00019612182,0.000042180218,0.000079319565,0.0000027610529,0.0000029137095,0.00018985094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933064,0.00000994133,0.00026123543,0.000098633085,0.00016988724,0.00012966522],"domain_scores_gemma":[0.9988355,0.000006158542,0.0004160778,0.00053870195,0.0001530313,0.000050522085],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00013476466,0.00007732134,0.000080375365,0.0000656129,0.0009969203,0.002350276,0.00079888833,0.000049650225,0.0000020180642],"category_scores_gemma":[0.00002392816,0.00006753228,0.000027294109,0.00008236348,0.00003050415,0.006075746,0.00011306034,0.000079337486,0.00010000892],"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.0000020553023,0.000012733192,0.00035801702,0.00013836999,0.0000038879607,8.510228e-7,0.0007411142,0.0008659214,0.00012736615,0.060194872,0.0019805927,0.93557423],"study_design_scores_gemma":[0.000089549605,0.000017223643,0.0013610151,0.000022637476,0.0000014358044,0.00004229907,0.00003779191,0.9630685,0.00045012325,0.00053829775,0.034260172,0.0001109576],"about_ca_topic_score_codex":0.000033536548,"about_ca_topic_score_gemma":0.0000010011228,"teacher_disagreement_score":0.99277914,"about_ca_system_score_codex":0.000024239778,"about_ca_system_score_gemma":0.000024997791,"threshold_uncertainty_score":0.99868536},"labels":[],"label_agreement":null},{"id":"W2773809710","doi":"","title":"A Semantic Loss Function for Deep Learning Under Weak Supervision","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Function (biology); Artificial intelligence; Deep learning; Natural language processing","score_opus":0.029817009378330657,"score_gpt":0.27512122399606287,"score_spread":0.24530421461773222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773809710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009226046,0.00010359643,0.98555344,0.0006145139,0.00087528524,0.0003236892,5.9029475e-7,0.00032733966,0.002975485],"genre_scores_gemma":[0.99597734,0.0000049831806,0.0027439585,0.0002807296,0.00009754125,0.00005292118,0.000019235591,0.000010434303,0.0008128486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866635,0.00004652676,0.0004560115,0.0001934313,0.00036098636,0.0002767136],"domain_scores_gemma":[0.998539,0.00005080156,0.00063429517,0.00034663852,0.00034579335,0.000083482984],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00056502287,0.00015264476,0.00016836576,0.00014957742,0.001796856,0.003508517,0.0005629364,0.00009200202,0.0000029205523],"category_scores_gemma":[0.00020165372,0.00013747028,0.00006288251,0.000118858115,0.000039753537,0.0084680505,0.000103389946,0.00018799076,0.00007241297],"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.00005948475,0.000024008285,0.0012661174,0.0009166966,0.00001982024,9.863223e-7,0.0052572796,0.39192152,0.00054302835,0.044027854,0.00036006482,0.55560315],"study_design_scores_gemma":[0.00054209935,0.000070379305,0.0020064276,0.00010304175,0.0000071648046,0.000022012215,0.0007768476,0.9825118,0.000029467255,0.0003198058,0.013437947,0.00017297],"about_ca_topic_score_codex":0.000016848251,"about_ca_topic_score_gemma":0.0000027044455,"teacher_disagreement_score":0.9867513,"about_ca_system_score_codex":0.000050241873,"about_ca_system_score_gemma":0.00005889742,"threshold_uncertainty_score":0.99950266},"labels":[],"label_agreement":null},{"id":"W2811124557","doi":"","title":"Hierarchical graph representation learning with differentiable pooling","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":909,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Pooling; Differentiable function; Computer science; Graph; Artificial intelligence; Theoretical computer science; Benchmark (surveying); Pattern recognition (psychology); Mathematics","score_opus":0.014365399824819249,"score_gpt":0.2542677497504681,"score_spread":0.23990234992564888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811124557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09989683,0.00006930816,0.89684165,0.00018278259,0.00038584688,0.0002489224,4.5584082e-7,0.0006126785,0.0017615304],"genre_scores_gemma":[0.9933959,0.000003703287,0.0060017486,0.00019645548,0.00018773104,0.000033944107,0.000015838936,0.000010308953,0.00015432732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983741,0.00008778108,0.00045651715,0.00024891607,0.00047565947,0.0003570017],"domain_scores_gemma":[0.998807,0.000053686876,0.00039937533,0.00027708453,0.00036084463,0.00010199864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016513458,0.00017679384,0.00018129412,0.00024238492,0.00059210556,0.0010185317,0.00042780212,0.00006966793,0.0000024775816],"category_scores_gemma":[0.00004286081,0.00013700115,0.00003596345,0.0010553834,0.000105529034,0.0067051863,0.00009762873,0.00031399704,0.000031313983],"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.00027760744,0.00008291481,0.018504923,0.0007891597,0.000071766306,0.00001929322,0.013379885,0.44614044,0.0019433856,0.030354375,0.00157034,0.4868659],"study_design_scores_gemma":[0.00036736773,0.00019369605,0.0013003871,0.00014788486,0.0000055701275,0.000112896705,0.00018887063,0.99468756,0.0006129457,0.00048387272,0.0016768101,0.00022214762],"about_ca_topic_score_codex":0.000018743074,"about_ca_topic_score_gemma":0.0000019619838,"teacher_disagreement_score":0.89349914,"about_ca_system_score_codex":0.000029001945,"about_ca_system_score_gemma":0.00003525498,"threshold_uncertainty_score":0.9821725},"labels":[],"label_agreement":null},{"id":"W2889576094","doi":"","title":"Stochastic Nested Variance Reduced Gradient Descent for Nonconvex Optimization.","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":43,"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; Variance reduction; Gradient descent; Combinatorics; Nabla symbol; Stationary point; Function (biology); Stochastic gradient descent; Applied mathematics; Mathematical analysis; Computer science; Physics; Statistics; Omega","score_opus":0.02298046378812457,"score_gpt":0.2619998012515888,"score_spread":0.2390193374634642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889576094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032609404,0.000055153374,0.9949181,0.00037202268,0.0016970802,0.0013037879,0.000007898361,0.00093718944,0.000382695],"genre_scores_gemma":[0.7961357,0.0000012997505,0.20253107,0.000469617,0.00022905071,0.00046391794,0.00005106004,0.000018969984,0.000099304794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806154,0.0000441304,0.0008001485,0.00030090948,0.00040534456,0.00038793666],"domain_scores_gemma":[0.9973581,0.00007121187,0.00064328464,0.00042201817,0.0013698081,0.00013559013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037093417,0.0002352642,0.00023732534,0.0003205022,0.00049472135,0.000979458,0.0006885989,0.000108488006,0.0000044152966],"category_scores_gemma":[0.00025702186,0.00022108339,0.00005429094,0.00083007425,0.00009180659,0.0040028943,0.00008882546,0.00009370263,0.000022950793],"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.00004590099,0.00006301144,0.000014721891,0.00038194202,0.000018854562,5.3145385e-7,0.0043021142,0.9316582,0.00014258867,0.041114368,0.0027714395,0.019486343],"study_design_scores_gemma":[0.0004851334,0.00020131994,0.000025441528,0.0001614027,0.000009879445,0.00005136108,0.000083830026,0.9976058,0.000356826,0.00019579279,0.0005703549,0.00025288112],"about_ca_topic_score_codex":0.000010767326,"about_ca_topic_score_gemma":3.278502e-7,"teacher_disagreement_score":0.7958096,"about_ca_system_score_codex":0.00015350313,"about_ca_system_score_gemma":0.00016208718,"threshold_uncertainty_score":0.94449365},"labels":[],"label_agreement":null},{"id":"W2890008096","doi":"","title":"Online Structure Learning for Feed-Forward and Recurrent Sum-Product Networks","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Recurrent neural network; Probabilistic logic; Artificial intelligence; Deep learning; Product (mathematics); Semantics (computer science); Inference; Representation (politics); Completeness (order theory); Theoretical computer science; Graphical model; Machine learning; Artificial neural network; Mathematics; Programming language","score_opus":0.024008533799148468,"score_gpt":0.2731631246584928,"score_spread":0.24915459085934433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890008096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042789582,0.0005649428,0.95452774,0.00036576125,0.0010867673,0.00027846,0.0000057912557,0.00027267958,0.0001082606],"genre_scores_gemma":[0.99399483,0.000011282845,0.0051477966,0.00022938101,0.0004796936,0.00001532857,0.000046911377,0.000006817645,0.0000679664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882394,0.000039225873,0.00043033838,0.00022302962,0.0002050404,0.00027843897],"domain_scores_gemma":[0.99890774,0.000029034578,0.00030246092,0.0001835678,0.0004889091,0.000088295325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026436918,0.00016115817,0.0001760495,0.00010033405,0.00042897894,0.000979929,0.00031062675,0.00008009218,8.2043397e-7],"category_scores_gemma":[0.00008299485,0.00013369048,0.000026231968,0.0002677343,0.000055559332,0.002468518,0.00008224821,0.00021888166,0.0000035509938],"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.00003274759,0.000018905152,0.00038141359,0.0006025441,0.000013953187,3.3035766e-7,0.0038278464,0.041871168,0.00019699037,0.004601265,0.0018117032,0.94664115],"study_design_scores_gemma":[0.00019585816,0.0001525544,0.000259556,0.00013329391,0.000005476021,0.00003646073,0.00011088687,0.99299943,0.0001024027,0.00017524399,0.0056579374,0.0001708886],"about_ca_topic_score_codex":0.000013027346,"about_ca_topic_score_gemma":0.0000038428334,"teacher_disagreement_score":0.95120525,"about_ca_system_score_codex":0.000027520347,"about_ca_system_score_gemma":0.000057309106,"threshold_uncertainty_score":0.9449478},"labels":[],"label_agreement":null},{"id":"W2890185089","doi":"","title":"Monte-Carlo Tree Search for Constrained POMDPs","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":31,"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":"Monte Carlo tree search; Computer science; Partially observable Markov decision process; Mathematical optimization; Monte Carlo method; Markov decision process; Tree (set theory); Action selection; Scale (ratio); Markov process; Machine learning; Markov model; Mathematics; Markov chain","score_opus":0.035799904152969325,"score_gpt":0.284999641127341,"score_spread":0.24919973697437167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890185089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006091552,0.000034622288,0.98289126,0.0004080106,0.0010214614,0.0006697832,0.0000028652282,0.0006285235,0.008251899],"genre_scores_gemma":[0.987573,0.0000010758059,0.011348344,0.00027604564,0.0002314483,0.00005572253,0.0000071104405,0.000009099813,0.0004981319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832845,0.00004247398,0.0005998756,0.00017144367,0.00047371234,0.00038401774],"domain_scores_gemma":[0.9984265,0.000074897005,0.00031319543,0.00032797354,0.00076057704,0.00009687597],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004897292,0.00016191344,0.00018106942,0.00019754653,0.00041080054,0.0013767533,0.0006856057,0.0000895092,0.0000023364153],"category_scores_gemma":[0.00007424262,0.00014286411,0.000053220065,0.00038835165,0.00008486136,0.0043762675,0.00009978944,0.00012999441,0.000103308805],"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.000070144015,0.0000611916,0.0008270518,0.0024195057,0.0000811324,0.0000030018564,0.02870303,0.72768444,0.0008026172,0.040226564,0.012117705,0.18700361],"study_design_scores_gemma":[0.00048546953,0.00026394543,0.000077029086,0.00007260291,0.000004670851,0.000031005264,0.00031217525,0.9863509,0.00051685155,0.00000808995,0.011710722,0.00016654006],"about_ca_topic_score_codex":0.000016932605,"about_ca_topic_score_gemma":6.462033e-7,"teacher_disagreement_score":0.9814815,"about_ca_system_score_codex":0.00007809958,"about_ca_system_score_gemma":0.00016237293,"threshold_uncertainty_score":0.9996599},"labels":[],"label_agreement":null},{"id":"W2890720247","doi":"","title":"Post: Device Placement with Cross-Entropy Minimization and Proximal Policy Optimization","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cross entropy; Minification; Reinforcement learning; Computation; Artificial neural network; Cross-entropy method; Entropy (arrow of time); Importance sampling; Deep neural networks; Machine learning; Monte Carlo method; Empirical risk minimization; Artificial intelligence; Mathematical optimization; Principle of maximum entropy; Algorithm; Optimization problem; Mathematics","score_opus":0.01255468471138568,"score_gpt":0.27848019964696974,"score_spread":0.2659255149355841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890720247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017410602,0.00005609947,0.9797602,0.0009913323,0.0001256037,0.0006626521,0.000004914085,0.0003363274,0.0006522674],"genre_scores_gemma":[0.9520732,0.0000067466294,0.046524115,0.0008500677,0.0002386355,0.00012894707,0.000048487993,0.000011907597,0.00011785175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866885,0.000035246292,0.00045372805,0.00023761558,0.00033677422,0.00026776927],"domain_scores_gemma":[0.99834263,0.000026478832,0.0004562937,0.00026377084,0.0008116128,0.000099187],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000114570925,0.00017437087,0.00013289686,0.00019409526,0.000540847,0.0012021195,0.0003001377,0.000060436552,0.0000021917267],"category_scores_gemma":[0.00004519146,0.00014252975,0.000012780377,0.0008094755,0.000114833274,0.0066621453,0.00009885753,0.0000868075,0.000018092796],"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.00009969536,0.000035789606,0.0011700084,0.0003171877,0.000011778864,8.1410957e-7,0.0030023176,0.9397981,0.00027581293,0.015010773,0.00017497304,0.04010275],"study_design_scores_gemma":[0.00046200727,0.00018700298,0.0005106956,0.000060633767,0.000004525751,0.000087006134,0.00009718146,0.9959209,0.0004955976,0.000023639495,0.0019705053,0.00018032854],"about_ca_topic_score_codex":0.000018253344,"about_ca_topic_score_gemma":0.0000019434174,"teacher_disagreement_score":0.93466264,"about_ca_system_score_codex":0.00008660879,"about_ca_system_score_gemma":0.00012683474,"threshold_uncertainty_score":0.9998347},"labels":[],"label_agreement":null},{"id":"W2890732907","doi":"","title":"Supervised autoencoders: Improving generalization performance with unsupervised regularizers","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":152,"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":"Generalization; Computer science; Regularization (linguistics); Artificial intelligence; Artificial neural network; Generalization error; Autoencoder; Stability (learning theory); Norm (philosophy); Machine learning; Encoder; Supervised learning; Unsupervised learning; Pattern recognition (psychology); Mathematics","score_opus":0.014898084041318364,"score_gpt":0.21568427080568167,"score_spread":0.2007861867643633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890732907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059673034,0.000043432083,0.9354401,0.00027582695,0.0003674131,0.00031030446,9.640265e-7,0.00061985746,0.0032690403],"genre_scores_gemma":[0.96312183,0.0000030289157,0.035510384,0.00082747027,0.00011525916,0.0000384442,0.000028639071,0.000014303074,0.00034064637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824387,0.000064320724,0.00053005386,0.0002457791,0.00056437386,0.00035162023],"domain_scores_gemma":[0.99852926,0.000015076199,0.0003765635,0.0003442078,0.00062032224,0.00011457662],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040160053,0.00020759505,0.00017747201,0.00025170666,0.0006406754,0.0014987201,0.00051745435,0.00008672436,0.000006780497],"category_scores_gemma":[0.000039429196,0.0001705665,0.00002989026,0.00078444555,0.000092182236,0.009210839,0.000067255205,0.00014456027,0.0000649656],"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.00012926776,0.000048733367,0.0025132094,0.001444653,0.000033223936,0.000003441547,0.03741369,0.48690417,0.0042948932,0.011424844,0.0009114117,0.45487845],"study_design_scores_gemma":[0.0006156793,0.00015260415,0.00044271664,0.000108694876,0.0000060000757,0.000040129744,0.00052435184,0.99515486,0.0005120579,0.000009982618,0.0021834783,0.0002494638],"about_ca_topic_score_codex":0.000024135772,"about_ca_topic_score_gemma":0.0000021441572,"teacher_disagreement_score":0.9034488,"about_ca_system_score_codex":0.0000837015,"about_ca_system_score_gemma":0.00021629801,"threshold_uncertainty_score":0.9995378},"labels":[],"label_agreement":null},{"id":"W2891236810","doi":"","title":"Reinforcement Learning with Multiple Experts: A Bayesian Model Combination Approach","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Convergence (economics); Artificial intelligence; Machine learning; Bayesian probability; Bellman equation; Domain (mathematical analysis); Function (biology); Mathematical optimization; Mathematics","score_opus":0.019661178052500883,"score_gpt":0.23828292618312835,"score_spread":0.21862174813062746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891236810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015145389,0.00002027108,0.9837318,0.00009694678,0.00021918054,0.00050207635,2.0778366e-7,0.0005929423,0.013322033],"genre_scores_gemma":[0.9780061,0.000001667494,0.020687148,0.0002746753,0.00007158335,0.0000978226,0.00004310816,0.000015084138,0.0008028018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782544,0.00006306753,0.0006654976,0.00024388675,0.000803831,0.00039825978],"domain_scores_gemma":[0.99822944,0.00003100316,0.00064464106,0.00037523647,0.0006105974,0.00010909849],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038855744,0.00024404578,0.00021112165,0.00026661888,0.0006520991,0.0014094696,0.0006064018,0.000097156175,0.0000018063236],"category_scores_gemma":[0.00008123305,0.00019858786,0.000034746317,0.0005553014,0.000086663575,0.0070580523,0.00013307843,0.00021838576,0.000034977485],"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.000013916476,0.0000111133,0.0003376985,0.00016519231,0.00000790629,3.172682e-7,0.007530181,0.985354,0.000044202603,0.002602434,0.00026014115,0.0036728897],"study_design_scores_gemma":[0.0007354796,0.0003035837,0.000029609824,0.00011402093,0.000005391278,0.000035860794,0.0006888896,0.9958278,0.000189875,0.000009552587,0.0017901707,0.00026979702],"about_ca_topic_score_codex":0.00002604243,"about_ca_topic_score_gemma":5.5567267e-7,"teacher_disagreement_score":0.9764916,"about_ca_system_score_codex":0.00014389092,"about_ca_system_score_gemma":0.000121752695,"threshold_uncertainty_score":0.9996272},"labels":[],"label_agreement":null},{"id":"W2891477799","doi":"","title":"Deep Homogeneous Mixture Models: Representation, Separation, and Approximation","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","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 Waterloo","funders":"","keywords":"Representation (politics); Connection (principal bundle); Constant (computer programming); Computer science; Mixture model; Homogeneous; Exponential function; Tree (set theory); Graphical model; Algorithm; Mathematics; Exponential growth; Latent variable; Artificial intelligence; Pattern recognition (psychology); Combinatorics; Mathematical analysis","score_opus":0.026015202243382232,"score_gpt":0.2934103046597554,"score_spread":0.2673951024163732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891477799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020133639,0.00045823448,0.99152917,0.00037761475,0.00043039216,0.00033800112,0.0000013808807,0.00025223196,0.004599635],"genre_scores_gemma":[0.85077965,0.000012473938,0.14823441,0.0005239935,0.00021726443,0.000055556866,0.00002152066,0.00000769761,0.0001474162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864215,0.00010551111,0.0005045759,0.00023077484,0.000316118,0.00020085678],"domain_scores_gemma":[0.99863535,0.000026965796,0.00033794806,0.00030769737,0.00060457556,0.00008745722],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037228063,0.00015478251,0.00016512343,0.00016039284,0.00039394153,0.0011744808,0.0002848517,0.000108526074,0.0000014889995],"category_scores_gemma":[0.00004361331,0.00013293652,0.000026266143,0.00045454508,0.000060767892,0.0074903155,0.0000695952,0.00009726616,0.000017004677],"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.00002250902,0.000025121779,0.00007027526,0.0004422502,0.000018330771,0.000001898961,0.02502991,0.010297211,0.00047883118,0.14887196,0.0026263758,0.8121153],"study_design_scores_gemma":[0.00018820184,0.000043296688,0.000042032563,0.000033742905,0.000005755654,0.00014775018,0.00010764856,0.9873626,0.00049392227,0.010133161,0.0012844978,0.000157348],"about_ca_topic_score_codex":0.000020483778,"about_ca_topic_score_gemma":0.0000026814093,"teacher_disagreement_score":0.97706544,"about_ca_system_score_codex":0.000029803174,"about_ca_system_score_gemma":0.000052011954,"threshold_uncertainty_score":0.9998624},"labels":[],"label_agreement":null},{"id":"W2891786606","doi":"","title":"Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo; McMaster University","funders":"","keywords":"Upper and lower bounds; Compression (physics); Sample complexity; Mixture model; Matching (statistics); Sample (material); Mathematics; Data compression; Combinatorics; Algorithm; Computer science; Statistics; Artificial intelligence; Physics; Mathematical analysis","score_opus":0.025119302185203602,"score_gpt":0.2861917601460713,"score_spread":0.2610724579608677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891786606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015538274,0.00012190739,0.98232496,0.00029953575,0.0006338041,0.00029299594,0.000020573176,0.0003314833,0.00043648566],"genre_scores_gemma":[0.93570554,0.000001122649,0.06364767,0.0001371689,0.00029014266,0.000030195757,0.000093986484,0.000010688021,0.00008350309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830806,0.00010393535,0.0006444057,0.00021102397,0.00041076064,0.0003218023],"domain_scores_gemma":[0.9982053,0.00022854762,0.00069083873,0.000268676,0.0005172863,0.00008936733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046036483,0.0001911003,0.0002909377,0.00017540036,0.00079819525,0.00077420793,0.0005561773,0.00009384245,0.0000093944345],"category_scores_gemma":[0.00030115808,0.00015576191,0.00007398738,0.00037998555,0.00014887073,0.0024269724,0.000115906245,0.00022392058,0.000011907523],"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.00018404373,0.0001714234,0.011180718,0.004758275,0.00008452208,9.996066e-7,0.026506947,0.015480156,0.0064689135,0.033657275,0.004841701,0.89666504],"study_design_scores_gemma":[0.00039156186,0.00024801274,0.0005877678,0.00016665738,0.000005629261,0.000014685768,0.000100251586,0.9462849,0.0018541394,0.000643988,0.049514875,0.00018751531],"about_ca_topic_score_codex":0.0005273401,"about_ca_topic_score_gemma":0.000004343495,"teacher_disagreement_score":0.9308048,"about_ca_system_score_codex":0.000030739484,"about_ca_system_score_gemma":0.000075275726,"threshold_uncertainty_score":0.74657047},"labels":[],"label_agreement":null},{"id":"W2891961001","doi":"","title":"Gradient Descent Meets Shift-and-Invert Preconditioning for Eigenvector Computation","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Gradient descent; Leverage (statistics); Eigenvalues and eigenvectors; Algorithm; Computation; Solver; Rate of convergence; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Key (lock)","score_opus":0.019729116493819976,"score_gpt":0.2599810769652536,"score_spread":0.2402519604714336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891961001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021130977,0.00009950857,0.97601753,0.00044547816,0.0011578542,0.0004917256,0.000007047423,0.00025817845,0.0003916711],"genre_scores_gemma":[0.99176204,0.0000012973354,0.0076011526,0.00028035988,0.00020830544,0.000071798415,0.000026340418,0.000005490861,0.000043240878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989761,0.000046353856,0.00041634194,0.00016364083,0.00018371273,0.00021381272],"domain_scores_gemma":[0.99921685,0.00005045686,0.00029419598,0.00011882125,0.00023813387,0.00008155383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003970576,0.00012516453,0.0001345298,0.00013013605,0.0005086145,0.00085259735,0.00021560729,0.000050406747,0.0000021146784],"category_scores_gemma":[0.0000363503,0.000110827124,0.00003196218,0.00020363709,0.00005003113,0.0035663093,0.000050038096,0.000058247973,0.000025278512],"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.000064313586,0.00006533186,0.00029694405,0.0023483143,0.000043529548,0.0000010699089,0.023963066,0.005529683,0.0002403755,0.15283337,0.0031152957,0.8114987],"study_design_scores_gemma":[0.0003394335,0.00013225342,0.00040041166,0.00011468171,0.000005801385,0.00003462402,0.000110667985,0.9911131,0.00066678744,0.0016468378,0.005275068,0.00016027749],"about_ca_topic_score_codex":0.000009698578,"about_ca_topic_score_gemma":0.0000012710055,"teacher_disagreement_score":0.9855835,"about_ca_system_score_codex":0.00004656398,"about_ca_system_score_gemma":0.000042140262,"threshold_uncertainty_score":0.8221616},"labels":[],"label_agreement":null},{"id":"W2891997758","doi":"","title":"Probabilistic Neural Programmed Networks for Scene Generation","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Rendering (computer graphics); Artificial intelligence; Generative grammar; Inpainting; Probabilistic logic; Encoder; Generative model; Semantics (computer science); Pixel; Visualization; Computer vision; Pattern recognition (psychology); Theoretical computer science; Image (mathematics); Programming language","score_opus":0.03288886030649794,"score_gpt":0.26020008877347306,"score_spread":0.22731122846697513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891997758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032527677,0.00016447323,0.9922513,0.0004825553,0.002187214,0.001099766,0.00000309677,0.00028553462,0.0002733272],"genre_scores_gemma":[0.9852617,0.0000017339668,0.01209023,0.00047799372,0.001723913,0.00029347965,0.000055106593,0.000011039166,0.00008483898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983785,0.0000848061,0.000600484,0.00025867476,0.00027091661,0.00040658854],"domain_scores_gemma":[0.9982804,0.00004451584,0.00039173296,0.00029195927,0.0008903638,0.000101048594],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004565692,0.00020385296,0.0002091775,0.00010544563,0.00060692773,0.0017322336,0.0004334073,0.00009793024,0.000002244254],"category_scores_gemma":[0.00013583274,0.00016869651,0.00006490608,0.00045239317,0.00008326995,0.0044902028,0.00006892981,0.00009404711,0.00001500837],"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.000029536599,0.000035196183,0.000052381034,0.00020913096,0.000016605662,4.856674e-7,0.0010850107,0.28683895,0.00041224057,0.0025428322,0.006159654,0.702618],"study_design_scores_gemma":[0.0003263723,0.00019183852,0.000068860005,0.00003515558,0.000009395999,0.000016413018,0.000039443195,0.99129534,0.0003507392,0.000042980817,0.00742045,0.00020301266],"about_ca_topic_score_codex":0.000023251778,"about_ca_topic_score_gemma":0.0000070476594,"teacher_disagreement_score":0.9820089,"about_ca_system_score_codex":0.00006005596,"about_ca_system_score_gemma":0.000073392795,"threshold_uncertainty_score":0.99930406},"labels":[],"label_agreement":null},{"id":"W2962705652","doi":"","title":"Stop wasting my gradients: practical SVRG","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":50,"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; Convergence (economics); Variance (accounting); Computation; Generalization; Rate of convergence; Selection (genetic algorithm); Mathematical optimization; Algorithm; Artificial intelligence; Applied mathematics; Mathematics; Channel (broadcasting)","score_opus":0.06114805913386867,"score_gpt":0.3037481648630557,"score_spread":0.24260010572918705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962705652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001601855,0.00008462458,0.9902751,0.0006812838,0.0010510096,0.00034390282,0.0000015279967,0.0010814567,0.0048792823],"genre_scores_gemma":[0.9259959,0.0000014681516,0.07315734,0.00049303955,0.00011193536,0.0000906589,0.000018728993,0.0000114122895,0.000119515425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815917,0.000068127985,0.0006315282,0.00019162489,0.00064577,0.00030376838],"domain_scores_gemma":[0.99821186,0.00005878915,0.0005000603,0.00031214053,0.0007154971,0.00020162403],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061000616,0.00016762136,0.00017606113,0.00025527712,0.00019347142,0.0011539395,0.00046938396,0.00008381435,0.0000012840305],"category_scores_gemma":[0.0006864557,0.00014897705,0.000031291274,0.000660646,0.000042030453,0.008841286,0.00014756339,0.00017582857,0.00007374894],"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.00006956046,0.000311449,0.0028372428,0.0016755465,0.000058034966,0.000037254522,0.053300746,0.14680032,0.00014427079,0.5064913,0.058678135,0.22959615],"study_design_scores_gemma":[0.0003184941,0.00007770128,0.000036294423,0.00011107238,0.0000045403567,0.00022267376,0.00064419,0.99303323,0.00011346746,0.0003524507,0.0048955223,0.00019038432],"about_ca_topic_score_codex":0.000015663509,"about_ca_topic_score_gemma":1.504029e-7,"teacher_disagreement_score":0.9243941,"about_ca_system_score_codex":0.00013884234,"about_ca_system_score_gemma":0.00018907587,"threshold_uncertainty_score":0.99988294},"labels":[],"label_agreement":null},{"id":"W2962745351","doi":"","title":"Estimating the class prior and posterior from noisy positives and unlabeled data","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Univariate; Discriminative model; Nonparametric statistics; Kernel density estimation; Pattern recognition (psychology); Noise (video); Computer science; Artificial intelligence; Kernel (algebra); False positive paradox; Class (philosophy); Density estimation; Parametric statistics; Support vector machine; Data modeling; False positives and false negatives; Data mining; Mathematics; Machine learning; Statistics; Multivariate statistics","score_opus":0.02574648480882142,"score_gpt":0.2736509987544086,"score_spread":0.2479045139455872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962745351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49631548,0.00065265654,0.49152237,0.01001992,0.00045026492,0.00036325539,0.000081920836,0.00029761367,0.00029649845],"genre_scores_gemma":[0.9939192,0.000005325198,0.0056014173,0.00028017475,0.00007402639,0.000011225622,0.00006101247,0.0000040633863,0.000043589025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990329,0.000094535804,0.00032873012,0.00021603973,0.00019674697,0.00013105352],"domain_scores_gemma":[0.9988547,0.00017670786,0.0003321527,0.00049969385,0.000087021246,0.000049729766],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040215554,0.00010695308,0.00011000707,0.000051480194,0.00036650826,0.0013752237,0.0005557036,0.000040965915,7.494752e-7],"category_scores_gemma":[0.00021270334,0.000056971978,0.0000063776242,0.00011877442,0.00006136465,0.0061755963,0.00035481146,0.00008637475,0.0000121816975],"study_design_candidate":"design_other","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.000008290684,0.000004136337,0.0024542212,0.00010785726,0.0000064094143,4.0995303e-7,0.002052246,0.000034134908,0.0019433016,0.0009098265,0.0001590039,0.9923202],"study_design_scores_gemma":[0.00029320962,0.000023791228,0.022559987,0.00020653661,0.000006832202,0.00005412024,0.00014034325,0.973951,0.000051432755,0.000047604168,0.002556735,0.00010840379],"about_ca_topic_score_codex":0.00009763871,"about_ca_topic_score_gemma":0.0000029236492,"teacher_disagreement_score":0.99221176,"about_ca_system_score_codex":0.0000138277865,"about_ca_system_score_gemma":0.000035911202,"threshold_uncertainty_score":0.99966145},"labels":[],"label_agreement":null},{"id":"W2962849532","doi":"","title":"Teaching Machines to Describe Images with Natural Language Feedback","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Closed captioning; Computer science; Natural language; Focus (optics); Artificial intelligence; Sentence; Point (geometry); Natural (archaeology); Quality (philosophy); Phrase; Natural language processing; SIGNAL (programming language); Robot; Human–computer interaction; Machine learning; Image (mathematics)","score_opus":0.010935333915803007,"score_gpt":0.28775438830282307,"score_spread":0.2768190543870201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962849532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4898584,0.00025280533,0.4823173,0.010249061,0.0008288963,0.0010901361,0.000012838252,0.0014169947,0.013973565],"genre_scores_gemma":[0.97885436,2.413934e-7,0.019974565,0.00047141887,0.00011744681,0.0000799722,0.000012376479,0.000011339768,0.00047827017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873835,0.00005429094,0.00033521728,0.00022340652,0.00037325974,0.0002754882],"domain_scores_gemma":[0.9984029,0.00003363966,0.00047663265,0.00078541826,0.00018601649,0.00011542778],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00033224458,0.00019169967,0.00017617257,0.00015340926,0.0013822416,0.0038662076,0.0013749581,0.000042881795,0.0000013281252],"category_scores_gemma":[0.00017995322,0.00014255011,0.000029939914,0.00013125285,0.000041080642,0.0064504896,0.00024518176,0.00035434705,0.00012436278],"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.000025091354,0.00002930847,0.0068464666,0.00045371565,0.00001624234,0.0000059815,0.01595459,0.0122071365,0.0022650543,0.0043273056,0.0009602955,0.9569088],"study_design_scores_gemma":[0.00034518828,0.00004760069,0.03526272,0.00017610723,0.0000055833298,0.00010795004,0.00033837763,0.9607921,0.0002278743,0.00001559467,0.0023836228,0.00029726495],"about_ca_topic_score_codex":0.0024376402,"about_ca_topic_score_gemma":0.000017547753,"teacher_disagreement_score":0.9566116,"about_ca_system_score_codex":0.000050048846,"about_ca_system_score_gemma":0.000046105462,"threshold_uncertainty_score":0.9999178},"labels":[],"label_agreement":null},{"id":"W2962850650","doi":"","title":"SimplE embedding for link prediction in knowledge graphs","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":178,"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":"Simple (philosophy); Embedding; Computer science; Theoretical computer science; Factorization; Link (geometry); Graph embedding; Tying; Artificial intelligence; Algorithm","score_opus":0.02168659529710737,"score_gpt":0.30032031980681734,"score_spread":0.27863372450970997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962850650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022266686,0.00038830147,0.9722034,0.00017277357,0.0021346072,0.0008684399,0.000009198498,0.00062277785,0.0013338586],"genre_scores_gemma":[0.99579924,0.0000037387524,0.0034264002,0.00018126235,0.00033346147,0.00015210386,0.000026668693,0.000009648454,0.0000674784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853015,0.00004079078,0.00065322756,0.00021807912,0.00019745427,0.00036028854],"domain_scores_gemma":[0.9988908,0.0000748382,0.00032062022,0.000251087,0.00039079925,0.00007185132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003382379,0.0001626694,0.00017950957,0.00035753546,0.00031095682,0.0005038888,0.00043984238,0.000106482395,0.0000010568687],"category_scores_gemma":[0.0000691809,0.00014985817,0.000049404658,0.0010062545,0.000052248775,0.0066866986,0.00007773079,0.00015047846,0.000026724627],"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.00009740683,0.000069523536,0.0035459807,0.0015565356,0.000018747367,0.0000020308623,0.013401231,0.08046452,0.00080122985,0.061246015,0.010229834,0.82856697],"study_design_scores_gemma":[0.0004187043,0.00012252592,0.00053240097,0.0001265729,0.0000022197908,0.000017838445,0.00010172012,0.983013,0.00022232297,0.002052741,0.0132400375,0.00014993329],"about_ca_topic_score_codex":0.000007569638,"about_ca_topic_score_gemma":0.000007739756,"teacher_disagreement_score":0.97353256,"about_ca_system_score_codex":0.00006709254,"about_ca_system_score_gemma":0.000050891776,"threshold_uncertainty_score":0.6111039},"labels":[],"label_agreement":null},{"id":"W2962969822","doi":"","title":"Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maxima and minima; Nabla symbol; Mathematics; Smoothness; Saddle point; Order (exchange); Combinatorics; Degenerate energy levels; Stochastic optimization; Algorithm; Mathematical optimization; Physics; Mathematical analysis; Omega; Geometry; Quantum mechanics","score_opus":0.028317591042347018,"score_gpt":0.2652874790833885,"score_spread":0.2369698880410415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962969822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004795437,0.00012518864,0.9913116,0.000032867465,0.0010620083,0.0004978868,0.000009520082,0.0010187207,0.0011467866],"genre_scores_gemma":[0.98942214,0.0000019252907,0.009798178,0.00012662789,0.0003752537,0.00011044994,0.00006283568,0.00003463717,0.00006797578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884695,0.000015768288,0.0005004898,0.0001267183,0.00021782545,0.0002922563],"domain_scores_gemma":[0.99906695,0.000035923316,0.00016285811,0.00015762287,0.00051995396,0.000056665544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013761812,0.00020820549,0.0002103489,0.00019679366,0.00023415136,0.000423465,0.0001523936,0.0001383858,0.0000055330956],"category_scores_gemma":[0.000037261445,0.00019528205,0.000039283856,0.000282838,0.00006779923,0.0016766335,0.000024235365,0.00010715519,0.000021655907],"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.000017936043,0.000005474142,0.0000047059825,0.00022357085,0.000013206403,2.905116e-7,0.0011060387,0.95920366,0.00018891563,0.00005139583,0.0019739969,0.037210792],"study_design_scores_gemma":[0.00029129762,0.00006778437,0.000008652339,0.00031226815,0.00001586979,0.000027368884,0.0005646521,0.99408185,0.0023824794,0.00002031792,0.0019890808,0.00023838601],"about_ca_topic_score_codex":0.000010114789,"about_ca_topic_score_gemma":0.0000011198229,"teacher_disagreement_score":0.98462665,"about_ca_system_score_codex":0.0000737277,"about_ca_system_score_gemma":0.00002780441,"threshold_uncertainty_score":0.79633707},"labels":[],"label_agreement":null},{"id":"W2962980921","doi":"","title":"TopRank: A practical algorithm for online stochastic ranking","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Generality; Generalization; Learning to rank; Regret; Online algorithm; sort; Ranking (information retrieval); Rank (graph theory); Machine learning; Algorithm; Artificial intelligence; Sorting algorithm; Theoretical computer science; Sorting; Mathematics; Information retrieval","score_opus":0.18174090392477427,"score_gpt":0.48522840909620396,"score_spread":0.3034875051714297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962980921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017750826,0.00008006848,0.9949054,0.00071137585,0.001210475,0.0008691658,0.00009211199,0.00014625766,0.00021006836],"genre_scores_gemma":[0.84880847,0.0000017589306,0.14324386,0.0009994168,0.0031677366,0.00034436793,0.00014065515,0.00004753401,0.0032461754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570656,0.00012312362,0.0012662414,0.00032127136,0.00206441,0.00051841117],"domain_scores_gemma":[0.9946969,0.0011129298,0.00070073514,0.0003743501,0.0029484967,0.0001665964],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002402772,0.00020129468,0.00034809887,0.00047649196,0.00064036204,0.0016438541,0.0005254372,0.00012877588,0.000051248902],"category_scores_gemma":[0.0049288827,0.00014716134,0.00008879824,0.0010136756,0.00020815153,0.0062218895,0.00011024469,0.00025711826,0.00024066691],"study_design_candidate":"design_other","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.000069097856,0.00003278702,0.000006818028,0.00005538555,0.000008309825,0.000001346149,0.0008662914,0.003440154,0.00002942876,0.00010776719,0.0030376532,0.992345],"study_design_scores_gemma":[0.0007786024,0.00018165015,0.000050771338,0.000060911625,0.0000065543186,0.00011871977,0.001333446,0.9296043,0.00008781325,0.0008365278,0.066767186,0.00017354815],"about_ca_topic_score_codex":0.000010627338,"about_ca_topic_score_gemma":0.000004895153,"teacher_disagreement_score":0.9921714,"about_ca_system_score_codex":0.000082153965,"about_ca_system_score_gemma":0.00022715855,"threshold_uncertainty_score":0.9993925},"labels":[],"label_agreement":null},{"id":"W2963185998","doi":"","title":"Plan, Attend, Generate: Planning for Sequence-to-Sequence Models","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Computer science; Sequence (biology); Plan (archaeology); Task (project management); Baseline (sea); Artificial intelligence; Character (mathematics); Mechanism (biology); Machine learning; Mathematics; Engineering","score_opus":0.19433423543765413,"score_gpt":0.3457445669782557,"score_spread":0.15141033154060154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963185998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02542496,0.00007626649,0.97025406,0.000892886,0.0011248187,0.0005513773,0.000017555638,0.0002760892,0.001381996],"genre_scores_gemma":[0.97291225,0.0000011770593,0.025817843,0.00066945335,0.00021411863,0.00017150865,0.000019131305,0.000009358797,0.00018517116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983677,0.00002176576,0.00057467044,0.00027549703,0.00037435626,0.00038601045],"domain_scores_gemma":[0.99822575,0.00002774889,0.00055219606,0.0007031691,0.00035585117,0.0001352839],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042958738,0.00018508935,0.0002123338,0.00014269394,0.0010782324,0.003395981,0.001465027,0.00009144203,3.892098e-7],"category_scores_gemma":[0.00009601073,0.0001669647,0.000042165586,0.000101688165,0.00003061372,0.011025705,0.00018682431,0.00012757807,0.00002666492],"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.000017831098,0.000007675356,0.0003411934,0.00061290717,0.000009470624,0.0000057898187,0.0062166112,0.8520806,0.0017261109,0.024400277,0.00089103845,0.11369053],"study_design_scores_gemma":[0.00024893094,0.000031043426,0.000038813112,0.00018229845,0.0000028543925,0.00005213922,0.00012006983,0.99573,0.00041259587,0.00056277215,0.0024025035,0.00021600409],"about_ca_topic_score_codex":0.000099853154,"about_ca_topic_score_gemma":0.0000013604271,"teacher_disagreement_score":0.9474873,"about_ca_system_score_codex":0.00008537388,"about_ca_system_score_gemma":0.00013910461,"threshold_uncertainty_score":0.9976386},"labels":[],"label_agreement":null},{"id":"W2963201904","doi":"","title":"Dimensionality Reduction has Quantifiable Imperfections: Two Geometric Bounds","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Measure (data warehouse); Dimensionality reduction; Mathematical proof; Computer science; Reduction (mathematics); Lipschitz continuity; Key (lock); Curse of dimensionality; Algorithm; Mathematics; Mathematical optimization; Point (geometry); Set (abstract data type); Topology (electrical circuits); Data mining; Artificial intelligence; Combinatorics","score_opus":0.04108341971202272,"score_gpt":0.28598691689081174,"score_spread":0.244903497178789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963201904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1365322,0.0008194171,0.85055715,0.0015383137,0.0035022344,0.00039688844,0.000015861398,0.0009693666,0.0056685545],"genre_scores_gemma":[0.9975932,0.0000059964777,0.0014334613,0.00015876241,0.00027099985,0.000027299457,0.000046208934,0.0000034482064,0.0004606288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816185,0.0000833963,0.00063804793,0.00027461947,0.00053316716,0.00030889842],"domain_scores_gemma":[0.9983407,0.00005046876,0.0004046921,0.00043042874,0.00066472247,0.00010894203],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076782424,0.00015551383,0.00021750444,0.00089374266,0.0011448022,0.0021333296,0.0005062175,0.00007855865,0.000031271647],"category_scores_gemma":[0.00024361786,0.00011934367,0.000069788024,0.0055870265,0.00015853293,0.0072813043,0.0001556167,0.00014471613,0.00039633457],"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.0000764653,0.0004309486,0.002873903,0.0006770668,0.0001721866,0.000006024821,0.0026948906,0.015005497,0.0019153222,0.095306315,0.07187714,0.80896425],"study_design_scores_gemma":[0.0005872758,0.00030106967,0.0024138882,0.00006288942,0.00003466091,0.00033181673,0.0004123943,0.8561615,0.001343454,0.0012087947,0.13665906,0.00048323197],"about_ca_topic_score_codex":0.0006526585,"about_ca_topic_score_gemma":0.0000032219339,"teacher_disagreement_score":0.861061,"about_ca_system_score_codex":0.00008858754,"about_ca_system_score_gemma":0.000086317734,"threshold_uncertainty_score":0.99890256},"labels":[],"label_agreement":null},{"id":"W2963221401","doi":"","title":"Variational Memory Addressing in Generative Models","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Language and cultural evolution","field":"Social Sciences","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":"Canadian Institute for Advanced Research","funders":"","keywords":"Computer science; Generative grammar; Generative model; Memory model; Inference; Artificial intelligence; Adaptive memory; Memory address; Flat memory model; Machine learning; Theoretical computer science; Memory management; Semiconductor memory; Shared memory; Parallel computing; Cognition","score_opus":0.08099046346303104,"score_gpt":0.34279473115126524,"score_spread":0.26180426768823417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963221401","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43634632,0.0017310074,0.026598463,0.006236326,0.003911652,0.0018380011,0.000035313285,0.00051988394,0.52278304],"genre_scores_gemma":[0.99842614,0.0000072970465,0.00016552358,0.00017762966,0.0003440068,0.00003484499,0.000023456869,0.0000031406364,0.0008179356],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893594,0.00009022044,0.00030401527,0.00008604726,0.0003869911,0.00019677443],"domain_scores_gemma":[0.9991821,0.000014563397,0.0003985821,0.000115813986,0.0002375805,0.00005137414],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004996567,0.00007974714,0.00010858759,0.00006759826,0.0017200545,0.0014442432,0.00023158405,0.000093416595,0.000017408398],"category_scores_gemma":[0.00018500625,0.00006671601,0.000024705261,0.00008830742,0.00009011335,0.010493653,0.00002661882,0.00010851469,0.000023893732],"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.000077876735,0.000075126336,0.0028868688,0.0005146567,0.000025955705,0.000012248817,0.4938722,0.1308907,0.00064084877,0.1344414,0.0041906903,0.23237142],"study_design_scores_gemma":[0.00073851226,0.0000158044,0.0046052877,0.00031505345,0.000009441596,0.000007868188,0.032821633,0.95512235,0.0000726108,0.0014882776,0.0044691633,0.00033396832],"about_ca_topic_score_codex":0.0030265856,"about_ca_topic_score_gemma":0.0004719401,"teacher_disagreement_score":0.8242317,"about_ca_system_score_codex":0.00014924858,"about_ca_system_score_gemma":0.00017109474,"threshold_uncertainty_score":0.99959236},"labels":[],"label_agreement":null},{"id":"W2963258372","doi":"","title":"Bayesian Optimisation for Machine Translation","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Machine translation; Bayesian probability; Artificial intelligence; Translation (biology); Machine learning","score_opus":0.016432709502656333,"score_gpt":0.26443310301270806,"score_spread":0.24800039351005174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963258372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112536974,0.0007618292,0.99578834,0.00080591446,0.0003252452,0.00047858225,0.000003803855,0.000993657,0.0007300801],"genre_scores_gemma":[0.7445383,0.0000013065487,0.25482714,0.00035543877,0.00008437049,0.00009244835,0.00005516451,0.000007634133,0.000038202295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987969,0.000049413546,0.00048478835,0.00016825454,0.00028884996,0.00021181186],"domain_scores_gemma":[0.99899596,0.00007046473,0.0003593285,0.00023437504,0.0002818046,0.00005808724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054909213,0.00015108459,0.00015699,0.00019921917,0.00025942383,0.0009707939,0.0004591112,0.00010131368,0.0000010666954],"category_scores_gemma":[0.00010351288,0.00012955844,0.000046340294,0.00031189958,0.000018156294,0.0059778704,0.000026901691,0.00010952414,0.0000064711144],"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.000011537691,0.000008508999,0.000021666414,0.0005383326,0.0000029975772,9.6649075e-8,0.0012297629,0.0025758361,0.00044397532,0.017857974,0.0003362266,0.97697306],"study_design_scores_gemma":[0.00028636857,0.000059870414,0.000007648423,0.000072703726,0.000004533501,0.000019873494,0.000021378206,0.98662674,0.0015080085,0.0021704233,0.009055106,0.00016731155],"about_ca_topic_score_codex":0.000019187853,"about_ca_topic_score_gemma":0.0000012119527,"teacher_disagreement_score":0.9840509,"about_ca_system_score_codex":0.00004735224,"about_ca_system_score_gemma":0.000037596947,"threshold_uncertainty_score":0.9361388},"labels":[],"label_agreement":null},{"id":"W2963313316","doi":"","title":"Scalable trust-region method for deep reinforcement learning using Kronecker-factored approximation","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Kronecker delta; Reinforcement learning; Scalability; Computer science; Trust region; Curvature; Mathematical optimization; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.05248858218001681,"score_gpt":0.31582601486795703,"score_spread":0.2633374326879402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963313316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015760745,0.00003949447,0.99408025,0.00017793968,0.0009905299,0.0009904318,3.7729953e-7,0.0002776186,0.0018672592],"genre_scores_gemma":[0.8919091,0.000003522369,0.10700553,0.00010019058,0.00014896772,0.00009959544,0.000045350487,0.000020804886,0.0006668938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744946,0.000092684415,0.000996241,0.0002987434,0.00064335094,0.00051954866],"domain_scores_gemma":[0.9963442,0.00007674344,0.00214865,0.00072438654,0.0005847944,0.00012121818],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009493851,0.00029308072,0.00034141322,0.00026117061,0.002178416,0.004574608,0.0010977865,0.00017001297,0.0000022953282],"category_scores_gemma":[0.00047495717,0.00027539016,0.00010234224,0.00019370764,0.000053206317,0.012488752,0.00023755887,0.00027005107,0.0000258228],"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.000013985549,0.000004738736,0.00034934623,0.00046477868,0.000013039592,4.8107e-7,0.0014992561,0.96002185,0.00020231475,0.0019971607,0.000063487285,0.035369586],"study_design_scores_gemma":[0.00077301986,0.00010984698,0.00012187508,0.00018955731,0.000020142443,0.000042028383,0.00030556112,0.99272275,0.00080611464,0.000039362843,0.0045507695,0.00031894597],"about_ca_topic_score_codex":0.00008821909,"about_ca_topic_score_gemma":5.932486e-7,"teacher_disagreement_score":0.89033306,"about_ca_system_score_codex":0.00025362594,"about_ca_system_score_gemma":0.00012751056,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W2963344792","doi":"","title":"Fast Approximate Natural Gradient Descent in a Kronecker Factored Eigenbasis","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":45,"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":"Diagonal; Kronecker delta; Leverage (statistics); Gradient descent; Computer science; Covariance; Stochastic gradient descent; Algorithm; Mathematics; Mathematical optimization; Artificial intelligence; Artificial neural network; Statistics; Physics; Geometry","score_opus":0.017205537931037383,"score_gpt":0.24234495920924384,"score_spread":0.22513942127820646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963344792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81395966,0.0002668162,0.17868254,0.00050749705,0.0029507154,0.0008174248,0.000008814984,0.00043909188,0.0023674646],"genre_scores_gemma":[0.99771,0.0000036231004,0.0017916302,0.0002733946,0.00007628586,0.000051855288,0.000025028714,0.0000055045025,0.000062713094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984928,0.000054382344,0.0005483054,0.0001970307,0.0003730869,0.0003343932],"domain_scores_gemma":[0.99914694,0.000013376511,0.00027889028,0.00022110993,0.00025964496,0.00008003069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002259785,0.00016480168,0.00016912521,0.00027605882,0.0002076376,0.00076832814,0.00037274632,0.00007537618,0.0000061617934],"category_scores_gemma":[0.00003122635,0.00013125352,0.00003868964,0.0005211565,0.000044836066,0.005067618,0.00009359163,0.00015412619,0.00018462892],"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.00008227142,0.0001408018,0.0030402874,0.0009171539,0.000016922526,0.000007976911,0.032305997,0.001509895,0.004231619,0.0011702138,0.0033408448,0.95323604],"study_design_scores_gemma":[0.00048374673,0.0000622178,0.002110928,0.00031674618,0.0000025042775,0.00003865222,0.0007267551,0.98843694,0.004372457,0.000047185917,0.0031587207,0.00024313327],"about_ca_topic_score_codex":0.00005893705,"about_ca_topic_score_gemma":0.000008784565,"teacher_disagreement_score":0.98692703,"about_ca_system_score_codex":0.00009806466,"about_ca_system_score_gemma":0.000051753446,"threshold_uncertainty_score":0.74090064},"labels":[],"label_agreement":null},{"id":"W2963421552","doi":"","title":"Architectural Complexity Measures of Recurrent Neural Networks","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":32,"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; Université de Montréal","funders":"","keywords":"Recurrent neural network; Feed forward; Computer science; Computability; Feedforward neural network; Graph; Nonlinear system; Computational complexity theory; Measure (data warehouse); Dependency (UML); Artificial intelligence; Algorithm; Theoretical computer science; Artificial neural network; Data mining; Engineering; Control engineering","score_opus":0.05000399624100138,"score_gpt":0.2526875896740306,"score_spread":0.20268359343302922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963421552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7353548,0.00070196344,0.26067954,0.00007135877,0.0016252603,0.00032109092,0.000013643664,0.00066647324,0.0005658716],"genre_scores_gemma":[0.99964654,0.00000707616,0.00011245923,0.00003125284,0.00015610084,0.000012214533,0.000008561436,0.000013307578,0.000012486369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987259,0.000041734696,0.0006209655,0.00009345794,0.00023946923,0.00027849348],"domain_scores_gemma":[0.9993753,0.00006328915,0.00021260914,0.00014148501,0.00013412024,0.000073199386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015093751,0.00018212399,0.00023885394,0.000104297156,0.000113362235,0.000067966925,0.00016960621,0.000057357134,0.0000035698674],"category_scores_gemma":[0.000044141692,0.00012261981,0.000057535453,0.00019727212,0.000074237316,0.0012971467,0.00003038696,0.00015935379,0.000005362964],"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.000025006813,0.0000036368417,0.00019172941,0.00039978724,0.0000072017483,5.575256e-7,0.0002960855,0.5630034,0.0031302248,0.00010107648,0.00008587203,0.43275538],"study_design_scores_gemma":[0.00034448731,0.000047347126,0.00068127795,0.00030119505,0.0000066095618,0.00007058434,0.00006826278,0.9934579,0.004081719,0.000028720688,0.00070570374,0.0002061531],"about_ca_topic_score_codex":0.000003306504,"about_ca_topic_score_gemma":0.0000011240901,"teacher_disagreement_score":0.4325492,"about_ca_system_score_codex":0.000046572877,"about_ca_system_score_gemma":0.000008423659,"threshold_uncertainty_score":0.500029},"labels":[],"label_agreement":null},{"id":"W2963436208","doi":"","title":"Optimal Subsampling with Influence Functions","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Asymptotically optimal algorithm; Estimator; Probabilistic logic; Computer science; Mathematical optimization; Function (biology); Class (philosophy); Statistical model; Importance sampling; Applied mathematics; Mathematics; Algorithm; Statistics; Artificial intelligence; Monte Carlo method","score_opus":0.07281130759508428,"score_gpt":0.3516244162452848,"score_spread":0.2788131086502005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963436208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3337268,0.000010422887,0.66044277,0.00004536288,0.0001825437,0.00018939428,0.000008469693,0.00018981386,0.005204454],"genre_scores_gemma":[0.9260402,2.7621883e-7,0.07350537,0.00011735208,0.00013208753,0.000043116564,0.000004723044,0.000009793221,0.00014709122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988866,0.000039886912,0.00045430716,0.00010890605,0.0002883305,0.00022199402],"domain_scores_gemma":[0.99861366,0.00019345293,0.00028019585,0.00016449195,0.00067002943,0.000078160796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029821348,0.00013279368,0.00016818309,0.00008617154,0.0003242699,0.00038303033,0.00012275222,0.000058450554,0.000025957981],"category_scores_gemma":[0.0005906086,0.000094566676,0.000017228514,0.00030496236,0.000100341946,0.001390571,0.000022860215,0.00013354605,0.00009168248],"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.0009379016,0.00030895992,0.013975257,0.009428112,0.00019537799,0.000014147498,0.03624362,0.028937092,0.0031743417,0.48879713,0.014004327,0.4039837],"study_design_scores_gemma":[0.001335776,0.001187107,0.004618718,0.0014557188,0.0001118517,0.00039895475,0.0049682744,0.9552128,0.0011517511,0.0060855313,0.022410387,0.0010631826],"about_ca_topic_score_codex":0.000028125258,"about_ca_topic_score_gemma":0.0000019331035,"teacher_disagreement_score":0.9262757,"about_ca_system_score_codex":0.000031393054,"about_ca_system_score_gemma":0.000061329236,"threshold_uncertainty_score":0.3856317},"labels":[],"label_agreement":null},{"id":"W2963489463","doi":"","title":"GibbsNet: Iterative Adversarial Inference for Deep Graphical Models","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Latent variable; Inference; Computer science; Joint probability distribution; Sampling (signal processing); Latent class model; Graphical model; Conditional probability distribution; Algorithm; Variable (mathematics); Artificial intelligence; Gibbs sampling; Flexibility (engineering); Theoretical computer science; Mathematical optimization; Machine learning; Mathematics; Statistics","score_opus":0.032470172596978826,"score_gpt":0.3099848913903102,"score_spread":0.2775147187933314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963489463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002046394,0.000045911813,0.99225396,0.0005887202,0.0016957687,0.0005287598,0.0000055097244,0.00026164379,0.0025733558],"genre_scores_gemma":[0.98447514,0.0000018222626,0.014849774,0.00018925325,0.00027717516,0.00011531097,0.000018891527,0.000009813356,0.00006285181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983003,0.00006771316,0.0005778532,0.00026453138,0.00043707737,0.00035250298],"domain_scores_gemma":[0.99774665,0.00013047125,0.00090874033,0.0006044315,0.00050480297,0.000104908584],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00048920803,0.00022173836,0.00026868767,0.00016814773,0.0015883347,0.0036356936,0.0014925774,0.00014675943,0.0000015900993],"category_scores_gemma":[0.0005706658,0.00019627939,0.00008162225,0.00014506548,0.00010201876,0.018145062,0.0002881218,0.00028111678,0.000013370052],"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.00007043748,0.000020731395,0.00045389665,0.0004022947,0.000023049643,0.0000025447782,0.008128894,0.6655683,0.00003913425,0.20013228,0.00019501333,0.1249634],"study_design_scores_gemma":[0.00074642664,0.000061534505,0.00024045749,0.00008892479,0.000007328802,0.00001292711,0.00013023152,0.9938375,0.000026741536,0.0031476954,0.0014637689,0.00023651424],"about_ca_topic_score_codex":0.00006148822,"about_ca_topic_score_gemma":0.0000043677965,"teacher_disagreement_score":0.9824287,"about_ca_system_score_codex":0.000058406178,"about_ca_system_score_gemma":0.000118465796,"threshold_uncertainty_score":0.99971145},"labels":[],"label_agreement":null},{"id":"W2963551771","doi":"","title":"A Unified Approach for Learning the Parameters of Sum-Product Networks","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Computational Drug Discovery Methods","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":"Multiplicative function; Mathematics; Mathematical optimization; Monomial; Product (mathematics); Regular polygon; Maximization; Tree (set theory); Expectation–maximization algorithm; Function (biology); Univariate; Projection (relational algebra); Applied mathematics; Artificial intelligence; Algorithm; Computer science; Discrete mathematics; Maximum likelihood; Multivariate statistics; Combinatorics; Statistics","score_opus":0.037597537478352636,"score_gpt":0.28082242087811515,"score_spread":0.2432248833997625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963551771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01016886,0.00013853412,0.98785925,0.00041932808,0.0003780562,0.0004694313,0.0000019518827,0.00011118388,0.00045340063],"genre_scores_gemma":[0.96662927,0.0000023656735,0.03302996,0.00008761855,0.00006242417,0.00009115855,0.000008734289,0.0000055114438,0.000082939616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986329,0.00018550183,0.0005196446,0.00015840978,0.00030143542,0.00020208309],"domain_scores_gemma":[0.99837947,0.0004739636,0.0005296578,0.00025008695,0.0003320113,0.00003482249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011661252,0.000116286035,0.0001647829,0.00010087271,0.0002069091,0.00034954754,0.0005645572,0.000037196234,2.0845603e-7],"category_scores_gemma":[0.00031022425,0.00006398264,0.00006153342,0.00040816687,0.00006094301,0.002714912,0.00008538177,0.00009271179,0.0000017026191],"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.000014869919,0.000006955939,0.000100540994,0.00016689832,0.000008203197,3.8887173e-8,0.0006917225,0.7827676,0.00006581437,0.006937573,0.00017676406,0.20906305],"study_design_scores_gemma":[0.0002459937,0.0000373445,0.0002379603,0.00006111153,0.0000047283734,0.000014160803,0.00014950232,0.9976576,0.0002515046,0.00019970772,0.0010421718,0.00009821066],"about_ca_topic_score_codex":0.000011479385,"about_ca_topic_score_gemma":1.20986e-7,"teacher_disagreement_score":0.9564604,"about_ca_system_score_codex":0.00003714161,"about_ca_system_score_gemma":0.000081506856,"threshold_uncertainty_score":0.3370695},"labels":[],"label_agreement":null},{"id":"W2963558674","doi":"","title":"Context-dependent upper-confidence bounds for directed exploration","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","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":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Context (archaeology); Computation; Machine learning; Artificial intelligence; Variance (accounting); Mathematical optimization; Algorithm; Mathematics","score_opus":0.03561658697522566,"score_gpt":0.2804357901936462,"score_spread":0.24481920321842052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963558674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011931859,0.00009977607,0.9934945,0.0003785633,0.001715937,0.0006450327,0.000002286368,0.00074646424,0.001724272],"genre_scores_gemma":[0.9945136,0.0000033071867,0.003879485,0.00048756474,0.00023795001,0.00015023637,0.0000283888,0.000009894326,0.0006896007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981853,0.00004949502,0.00070029247,0.0002072824,0.00053623656,0.0003213946],"domain_scores_gemma":[0.9979626,0.00006831512,0.0005282941,0.00037628703,0.0009848616,0.00007965672],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050075416,0.00017600853,0.00019538397,0.00018890835,0.0005320724,0.0021005736,0.00061418157,0.00009244297,0.0000033497447],"category_scores_gemma":[0.00021837372,0.00016009863,0.00005500822,0.0003722262,0.00006745748,0.010790187,0.00008401065,0.000113445116,0.0001356408],"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.0001273028,0.00005814899,0.00063347333,0.0020395836,0.00010180507,0.0000021764624,0.041839346,0.41304547,0.0015434709,0.11524869,0.015771285,0.40958926],"study_design_scores_gemma":[0.00038160832,0.00019795077,0.000049357197,0.000109153014,0.0000066462567,0.000017915065,0.0004763891,0.96972334,0.0014889378,0.00012537358,0.027226336,0.00019700087],"about_ca_topic_score_codex":0.00003808277,"about_ca_topic_score_gemma":0.0000025961192,"teacher_disagreement_score":0.9933204,"about_ca_system_score_codex":0.000099747456,"about_ca_system_score_gemma":0.00012610522,"threshold_uncertainty_score":0.99893534},"labels":[],"label_agreement":null},{"id":"W2963582321","doi":"","title":"Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":103,"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; Computer science; Bridge (graph theory); State (computer science); Mathematical optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.13487576751992256,"score_gpt":0.4272213443219531,"score_spread":0.29234557680203055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963582321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069055825,0.00083291164,0.9094979,0.002391006,0.0019705563,0.0026182488,0.000030956173,0.0003608538,0.013241702],"genre_scores_gemma":[0.9941895,0.000021702643,0.0005779187,0.000078127145,0.00017543559,0.00010946272,0.000029425826,0.000015743746,0.0048026624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964268,0.00007328281,0.0011378294,0.00029831805,0.0015475265,0.0005162232],"domain_scores_gemma":[0.9961886,0.0003914144,0.0015260357,0.00059548585,0.0011138516,0.00018460338],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032634465,0.00022299796,0.00036419916,0.00040685132,0.0032439823,0.006460275,0.0007948293,0.00012964143,0.000014071214],"category_scores_gemma":[0.004696167,0.00016559073,0.00007012072,0.0002666835,0.00024910748,0.009944907,0.00024456237,0.00032197026,0.00005600717],"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.00017898504,0.0000123820255,0.0046629338,0.0008027201,0.00002379052,0.0000042075853,0.005301728,0.10961309,0.00011228934,0.0016922558,0.0018171503,0.87577844],"study_design_scores_gemma":[0.0008668543,0.00016520923,0.0011149321,0.00017037777,0.0000067304995,0.000040622483,0.0038048448,0.90072495,0.00015080368,0.0009675877,0.091745526,0.00024156607],"about_ca_topic_score_codex":0.00006792674,"about_ca_topic_score_gemma":0.000006990971,"teacher_disagreement_score":0.9251337,"about_ca_system_score_codex":0.00012836303,"about_ca_system_score_gemma":0.00014429497,"threshold_uncertainty_score":0.99805367},"labels":[],"label_agreement":null},{"id":"W2963645527","doi":"","title":"GumBolt: Extending Gumbel trick to Boltzmann priors","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Prior probability; Gumbel distribution; Artificial intelligence; Computer science; MNIST database; Algorithm; Latent variable; Margin (machine learning); Bayesian probability; Mathematics; Machine learning; Artificial neural network; Statistics","score_opus":0.016421402057763993,"score_gpt":0.25689467972533503,"score_spread":0.24047327766757104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963645527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008259667,0.00013208254,0.98182315,0.0006892149,0.0019802854,0.00038978766,0.0000024876795,0.00030799114,0.0064153103],"genre_scores_gemma":[0.9873005,0.0000024568255,0.01055511,0.0010704853,0.0005976596,0.000037456313,0.0000041908634,0.0000085101165,0.00042361426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835885,0.00006896147,0.00056021416,0.00023407886,0.00040319032,0.00037471164],"domain_scores_gemma":[0.9987161,0.00003152088,0.00028775292,0.00033981478,0.00047114547,0.00015367163],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042679854,0.00018551495,0.00020947709,0.00024892573,0.00051364733,0.0015167327,0.00065173756,0.00006792678,0.000007777092],"category_scores_gemma":[0.00012089536,0.00015810122,0.00004952845,0.0008827785,0.000041533905,0.005761241,0.00016639325,0.00010072189,0.00042087652],"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.000033487628,0.000039772687,0.00032777828,0.00025580244,0.000027267008,0.0000043697664,0.014417844,0.022576569,0.002574618,0.004953614,0.033154618,0.92163426],"study_design_scores_gemma":[0.0002279232,0.00012678884,0.0006521105,0.00011250369,0.0000056475146,0.000032637476,0.00032556462,0.91340804,0.0017753158,0.00004057482,0.08300981,0.00028306202],"about_ca_topic_score_codex":0.000049026505,"about_ca_topic_score_gemma":0.0000025941797,"teacher_disagreement_score":0.97904086,"about_ca_system_score_codex":0.000069565576,"about_ca_system_score_gemma":0.00006896163,"threshold_uncertainty_score":0.99951977},"labels":[],"label_agreement":null},{"id":"W2963702270","doi":"","title":"Measuring the reliability of MCMC inference with bidirectional Monte Carlo","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Inference; Computer science; Bayesian inference; Monte Carlo method; Posterior probability; Approximate inference; Algorithm; Statistical inference; Artificial intelligence; Bayesian probability; Mathematics; Statistics","score_opus":0.07845018202371808,"score_gpt":0.31350586071201864,"score_spread":0.23505567868830057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963702270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9120819,0.00012324443,0.08060244,0.0004972205,0.00044173165,0.00060821325,0.000020000278,0.00017810613,0.00544714],"genre_scores_gemma":[0.9982118,0.0000048301604,0.0012374131,0.000030191935,0.00005980402,0.0000630356,6.52693e-7,0.000008691925,0.0003835878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985794,0.00013823296,0.0005732968,0.000103703496,0.0004439517,0.0001614533],"domain_scores_gemma":[0.9980295,0.00044810286,0.00052899384,0.00027577393,0.0006734677,0.000044219953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096885,0.00013299115,0.00021641042,0.000071751885,0.00015320045,0.00008676448,0.00017249369,0.00005980336,0.0000029032176],"category_scores_gemma":[0.000921154,0.000059305894,0.00004692444,0.00020377354,0.00009438553,0.0011382606,0.000033859687,0.00009798752,2.5141424e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00160419,0.0004167679,0.08814048,0.023080774,0.00031234988,0.0000062349777,0.04163698,0.024520786,0.013378019,0.04378118,0.007028879,0.7560934],"study_design_scores_gemma":[0.012463875,0.0019319194,0.018460369,0.019081963,0.0006236504,0.0008569804,0.022094611,0.7448647,0.055244632,0.0058936467,0.11412304,0.0043606204],"about_ca_topic_score_codex":0.000082699225,"about_ca_topic_score_gemma":0.000014400468,"teacher_disagreement_score":0.75173277,"about_ca_system_score_codex":0.00006545118,"about_ca_system_score_gemma":0.000094735544,"threshold_uncertainty_score":0.2418424},"labels":[],"label_agreement":null},{"id":"W2963779314","doi":"","title":"Satisfying real-world goals with dataset constraints","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Machine learning; Classifier (UML); Real world data; Data mining; Artificial intelligence; Training set; Set (abstract data type); Precision and recall; Data science","score_opus":0.027060350434579963,"score_gpt":0.27945208389443577,"score_spread":0.2523917334598558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963779314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079116714,0.000019382394,0.9919694,0.00095844467,0.00019496393,0.00039096214,0.0004166131,0.0008964903,0.0043625403],"genre_scores_gemma":[0.985028,0.000010656328,0.01394108,0.00041307046,0.00004144952,0.000095937,0.00028519868,0.000007943654,0.0001766456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985244,0.000055173554,0.0005476813,0.00021066071,0.00040671398,0.00025533835],"domain_scores_gemma":[0.99847823,0.00006819407,0.00054578506,0.0005983948,0.00022706103,0.00008233493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003627354,0.00015581612,0.0001680606,0.00023838032,0.00018785868,0.00080203766,0.00069584686,0.000046906596,0.000008881848],"category_scores_gemma":[0.000049699916,0.000095662435,0.000013910818,0.00045294155,0.00012185538,0.010012187,0.00009591576,0.000080818616,0.00011541141],"study_design_candidate":"design_other","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.000020762014,0.00002218677,0.0040457644,0.00045594477,0.00001647881,0.0000061067835,0.0007226337,0.00007417647,0.0039606923,0.07779823,0.03447925,0.87839776],"study_design_scores_gemma":[0.0055073653,0.0005909478,0.026438862,0.005661537,0.000046514953,0.001094169,0.00086748606,0.31409052,0.051921196,0.0014785391,0.58864784,0.0036550236],"about_ca_topic_score_codex":0.00004615391,"about_ca_topic_score_gemma":0.0000069415933,"teacher_disagreement_score":0.98423684,"about_ca_system_score_codex":0.00010031151,"about_ca_system_score_gemma":0.00012182467,"threshold_uncertainty_score":0.77340674},"labels":[],"label_agreement":null},{"id":"W2964096266","doi":"","title":"Toward Robustness against Label Noise in Training Deep Discriminative Neural Networks","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":186,"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":"Computer science; Robustness (evolution); Discriminative model; Artificial intelligence; Inference; Convolutional neural network; Deep neural networks; Pattern recognition (psychology); Machine learning; Noise (video); Training set; Graphical model; Artificial neural network; Noise measurement; Image (mathematics); Noise reduction","score_opus":0.0666042164439337,"score_gpt":0.29915740305396926,"score_spread":0.23255318661003554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964096266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05892183,0.0001890202,0.93276095,0.0018770155,0.0012468885,0.00037612088,0.0000041619937,0.00032432136,0.004299708],"genre_scores_gemma":[0.99810404,0.000007067553,0.0013639332,0.00021212286,0.00011827331,0.000060366376,0.00007394577,0.000008929559,0.000051314822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983118,0.00011604368,0.0006100682,0.00025866838,0.00034440123,0.00035898268],"domain_scores_gemma":[0.9982266,0.000049479226,0.0008543229,0.0005851656,0.00018922877,0.00009523325],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006086789,0.00020283838,0.00024498298,0.0001965169,0.0006990519,0.003048989,0.0012143634,0.000104521205,7.9074294e-7],"category_scores_gemma":[0.00028414454,0.00017699426,0.000033223187,0.00023606364,0.00007036065,0.010526673,0.00019653891,0.00037866452,0.000008833825],"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.000009880215,0.00001821094,0.0012969179,0.00019242392,0.0000031059624,0.000004933349,0.008231872,0.30696285,0.000016158954,0.0019163281,0.00004880345,0.6812985],"study_design_scores_gemma":[0.0004935086,0.000025010464,0.01094786,0.00014052504,0.0000031074048,0.000021564398,0.0010829566,0.9866949,0.0000051618244,0.00001324253,0.00036176073,0.00021042449],"about_ca_topic_score_codex":0.00010377196,"about_ca_topic_score_gemma":0.00001734681,"teacher_disagreement_score":0.9391822,"about_ca_system_score_codex":0.00007466594,"about_ca_system_score_gemma":0.00005695038,"threshold_uncertainty_score":0.99798596},"labels":[],"label_agreement":null},{"id":"W2970060558","doi":"","title":"Ordered Memory","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Treebank; Inference; Recurrent neural network; Artificial intelligence; Task (project management); Representation (politics); Tree (set theory); Machine learning; Theoretical computer science; Artificial neural network; Natural language processing; Annotation","score_opus":0.01587798405192172,"score_gpt":0.23179901244507461,"score_spread":0.2159210283931529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970060558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13091564,0.00025676558,0.83340377,0.000649959,0.0027519332,0.0005444728,0.0000012094805,0.0007962472,0.030679991],"genre_scores_gemma":[0.9965655,6.8195965e-7,0.002279022,0.00043221546,0.000053754353,0.000014059299,0.000004287114,0.0000036094457,0.0006468399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901134,0.000023795454,0.00036638195,0.00012276156,0.00029895248,0.0001767443],"domain_scores_gemma":[0.9992672,0.000014692703,0.0002016792,0.00032078248,0.000150609,0.000045019206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020484258,0.00009077985,0.00011600677,0.00010480441,0.00008690094,0.00069242605,0.00045713945,0.000050394927,0.0000054297575],"category_scores_gemma":[0.000018052006,0.00007835326,0.000023593931,0.0002341582,0.0000071561626,0.0054660724,0.00007889294,0.000095406045,0.00041358915],"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.000011231381,0.000024941824,0.0016817536,0.0018815288,0.000014436266,0.00000281107,0.0116946045,0.16076908,0.0012193335,0.035839155,0.0016753601,0.78518575],"study_design_scores_gemma":[0.00019936588,0.000014243377,0.000105685154,0.000043095653,8.611815e-7,0.000029703922,0.00021546986,0.9926797,0.00014881969,0.000052529063,0.0064039696,0.00010651859],"about_ca_topic_score_codex":0.000028446511,"about_ca_topic_score_gemma":2.3270373e-7,"teacher_disagreement_score":0.8656499,"about_ca_system_score_codex":0.00003442422,"about_ca_system_score_gemma":0.00006467893,"threshold_uncertainty_score":0.66770804},"labels":[],"label_agreement":null},{"id":"W2970168598","doi":"","title":"Surrogate Objectives for Batch Policy Optimization in One-step Decision Making","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Mathematical optimization; Entropy (arrow of time); Artificial intelligence; Multi-armed bandit; Constrained optimization problem; Action selection; Action (physics); Optimization problem; State (computer science); Surrogate model; Principle of maximum entropy; Machine learning; Mathematics; Algorithm; Regret; Psychology","score_opus":0.07992803755470389,"score_gpt":0.42332753069394063,"score_spread":0.34339949313923673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970168598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04015015,0.00013431734,0.95546687,0.00025284223,0.00069229864,0.0016084672,0.000025285874,0.000098161676,0.0015716346],"genre_scores_gemma":[0.98817945,0.0000064738024,0.010975207,0.000110999514,0.00014449428,0.000121842226,0.00002375631,0.000017809089,0.00041998122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995966,0.00014088661,0.0013734791,0.00034863342,0.0017084156,0.00046258175],"domain_scores_gemma":[0.9963411,0.0012083637,0.00072187994,0.0003758853,0.0012745844,0.0000781864],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002499276,0.00019114124,0.0003873786,0.0014216584,0.00023507037,0.0014410364,0.00059575646,0.00014109223,0.000033059983],"category_scores_gemma":[0.003984449,0.00015515578,0.000075036536,0.0021495286,0.00004658812,0.007755655,0.00011759712,0.00020485623,0.00019123295],"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.00012704005,0.00001570159,0.0011047606,0.00011211058,0.0000024150404,2.9229872e-7,0.00096010463,0.80060893,0.000025978756,0.00014029363,0.000097184355,0.19680521],"study_design_scores_gemma":[0.000939889,0.00008547748,0.001431157,0.0002959299,0.0000016611317,0.000010606784,0.0022531399,0.9918358,0.000070705886,0.000826301,0.0020697596,0.00017961436],"about_ca_topic_score_codex":0.000050387436,"about_ca_topic_score_gemma":0.000013552235,"teacher_disagreement_score":0.9480293,"about_ca_system_score_codex":0.00030518573,"about_ca_system_score_gemma":0.0002705393,"threshold_uncertainty_score":0.9995956},"labels":[],"label_agreement":null},{"id":"W2970250826","doi":"","title":"Piecewise Strong Convexity of Neural Networks","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maxima and minima; Piecewise; Convexity; Artificial neural network; Mathematics; Differentiable function; Stochastic gradient descent; Convex function; Applied mathematics; Norm (philosophy); Open set; Regularization (linguistics); Mathematical optimization; Regular polygon; Algorithm; Computer science; Mathematical analysis; Discrete mathematics; Artificial intelligence; Geometry","score_opus":0.014168538568912753,"score_gpt":0.23486229634571243,"score_spread":0.22069375777679967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970250826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014616271,0.00011353622,0.9815039,0.00008003061,0.0009248306,0.00048660333,0.0000023498544,0.0004238013,0.0018486918],"genre_scores_gemma":[0.996072,0.0000013329905,0.0036662521,0.00012880586,0.00003055703,0.0000259374,0.0000139013655,0.0000061753053,0.000055048076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985529,0.000042636988,0.0006501456,0.00015092352,0.0003748732,0.0002284912],"domain_scores_gemma":[0.99853635,0.000044088127,0.00062420947,0.00035262527,0.0003781165,0.00006461831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026121645,0.00014440392,0.00022469672,0.00018618272,0.00008069936,0.0003580443,0.00056244544,0.00008267094,0.000006170826],"category_scores_gemma":[0.00003733877,0.00012985515,0.000045512872,0.00048784114,0.000039874325,0.00435501,0.000110345354,0.00013801844,0.000015199749],"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.00001874127,0.000033125896,0.0034610997,0.00068455585,0.000013211556,6.485996e-7,0.001829195,0.8838913,0.000079541016,0.048335142,0.0005792625,0.061074197],"study_design_scores_gemma":[0.00023423982,0.00007322687,0.0003140458,0.000075896365,0.0000030007159,0.00001954891,0.000092620074,0.99871975,0.00014880106,0.000047441248,0.00014394315,0.00012749636],"about_ca_topic_score_codex":0.00002141172,"about_ca_topic_score_gemma":1.697679e-7,"teacher_disagreement_score":0.98145574,"about_ca_system_score_codex":0.000040402138,"about_ca_system_score_gemma":0.000043361964,"threshold_uncertainty_score":0.5295339},"labels":[],"label_agreement":null},{"id":"W2970271714","doi":"","title":"A Latent Variational Framework for Stochastic Optimization","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stochastic optimization; Stochastic gradient descent; Stochastic differential equation; Mathematical optimization; Computer science; Gradient descent; Continuous-time stochastic process; Inference; Stochastic process; Optimization problem; Stochastic approximation; Mathematics; Applied mathematics; Artificial intelligence; Key (lock); Artificial neural network","score_opus":0.016983820967495705,"score_gpt":0.2520262587933482,"score_spread":0.23504243782585252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970271714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012314403,0.00003957573,0.9963022,0.00033893026,0.0011570345,0.0011669939,0.000008174342,0.0006075506,0.00025641135],"genre_scores_gemma":[0.5087524,6.742993e-7,0.4903635,0.00035764588,0.00007285744,0.00029012832,0.00007439361,0.0000113699925,0.00007702309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986007,0.000024939112,0.00054493453,0.00019974979,0.00039849296,0.00023119143],"domain_scores_gemma":[0.9984705,0.00013901548,0.00047894267,0.00027393,0.0005731543,0.0000644556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002767799,0.00015382987,0.000170812,0.00024894066,0.00016857314,0.0007990105,0.00043127657,0.000116699965,0.000010245507],"category_scores_gemma":[0.00019521001,0.00014458396,0.000047811696,0.00047024857,0.000014270753,0.0038430681,0.000060584567,0.00010191878,0.00004187481],"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.0000061826495,0.000008781175,0.000020276606,0.00010339745,0.0000039947836,3.156055e-8,0.00044367107,0.7920122,0.0000033436863,0.20515023,0.00008855006,0.0021593429],"study_design_scores_gemma":[0.00028908264,0.00007756399,0.00003563812,0.00012386152,0.0000049994924,0.000015302703,0.000030726795,0.9961075,0.00001497769,0.002981613,0.00014980114,0.00016891753],"about_ca_topic_score_codex":0.000003839809,"about_ca_topic_score_gemma":3.1135908e-8,"teacher_disagreement_score":0.50862926,"about_ca_system_score_codex":0.00009113903,"about_ca_system_score_gemma":0.0000981482,"threshold_uncertainty_score":0.77048767},"labels":[],"label_agreement":null},{"id":"W2970395278","doi":"","title":"Fast AutoAugment","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Generalization; Code (set theory); Matching (statistics); Image (mathematics); Artificial intelligence; Source code; Pattern recognition (psychology); Machine learning; Set (abstract data type)","score_opus":0.011823379063630374,"score_gpt":0.24414204947072182,"score_spread":0.23231867040709145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970395278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016522836,0.00019650378,0.9679417,0.0008696473,0.0010830894,0.00078509795,0.0000027021415,0.00088790973,0.011710513],"genre_scores_gemma":[0.9936424,0.0000027188444,0.004922453,0.00061755755,0.000061113875,0.00008859298,0.000012568373,0.0000061040632,0.0006464952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.000021777774,0.0004119302,0.00016693289,0.00032507643,0.00023458716],"domain_scores_gemma":[0.99906564,0.00002534386,0.00029197038,0.00040150728,0.00014577055,0.00006975153],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001170087,0.00012476536,0.0001292392,0.00009879017,0.00014962637,0.00055330136,0.00056697015,0.00004541957,0.000005649905],"category_scores_gemma":[0.0000075508447,0.00010865804,0.000030281146,0.0004910835,0.000014761988,0.005532491,0.00011047858,0.00011913509,0.00083028176],"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.0000078931125,0.000033056,0.0006640397,0.00045684844,0.000009377759,0.000001128467,0.001941817,0.31961846,0.0012132314,0.11432792,0.0033964452,0.55832976],"study_design_scores_gemma":[0.00019460601,0.000027229786,0.00029272182,0.000041758114,0.0000013189444,0.000036273897,0.00009364417,0.9596623,0.00020401993,0.00016216621,0.03913351,0.00015044678],"about_ca_topic_score_codex":0.0000048939714,"about_ca_topic_score_gemma":1.881696e-7,"teacher_disagreement_score":0.97711957,"about_ca_system_score_codex":0.00006293745,"about_ca_system_score_gemma":0.00004002872,"threshold_uncertainty_score":0.99994767},"labels":[],"label_agreement":null},{"id":"W2970427923","doi":"","title":"The Synthesis of XNOR Recurrent Neural Networks with Stochastic Logic","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Ferroelectric and Negative Capacitance Devices","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":"McGill University","funders":"","keywords":"XNOR gate; Computer science; Stochastic computing; Artificial neural network; Quantization (signal processing); Theoretical computer science; Algorithm; Artificial intelligence; Logic gate","score_opus":0.009092623626001809,"score_gpt":0.20134472112784674,"score_spread":0.19225209750184494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970427923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8773217,0.007912855,0.10106747,0.00019097207,0.0030206519,0.0018805275,0.000020449601,0.00077314005,0.0078122267],"genre_scores_gemma":[0.99978065,0.000016911814,0.00002076648,0.000026050997,0.000045395955,0.0000643412,0.00000521843,0.000011291768,0.000029378249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990629,0.00002721309,0.00039238963,0.0000683895,0.00022629378,0.0002228385],"domain_scores_gemma":[0.99927115,0.00017242128,0.00021678806,0.0001316716,0.00017294833,0.00003499801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014973748,0.00014525675,0.00019290566,0.00006374856,0.00010944402,0.00015381342,0.00016025428,0.00005101906,0.0000029191476],"category_scores_gemma":[0.000037073234,0.00008603218,0.000029709186,0.00031966908,0.00004383677,0.00095815794,0.00000808949,0.00016321887,0.000013375689],"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.00003697498,0.0000032009953,0.00015125626,0.00056105526,0.000017845681,1.6412645e-7,0.00035321334,0.9559077,0.000035954767,0.00020520181,0.00020359387,0.042523853],"study_design_scores_gemma":[0.00012248194,0.0000664971,0.00023021402,0.00021989834,0.000011934283,0.000014759591,0.0006402571,0.99815726,0.000115554,0.000003870843,0.00029974294,0.000117500465],"about_ca_topic_score_codex":0.000004747994,"about_ca_topic_score_gemma":0.0000019342435,"teacher_disagreement_score":0.122458935,"about_ca_system_score_codex":0.000043590317,"about_ca_system_score_gemma":0.000014493081,"threshold_uncertainty_score":0.35082906},"labels":[],"label_agreement":null},{"id":"W2970634945","doi":"","title":"Maximum Entropy Monte-Carlo Planning","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Softmax function; Computer science; Mathematical optimization; Monte Carlo method; Principle of maximum entropy; Entropy (arrow of time); Convergence (economics); Monte Carlo tree search; Rate of convergence; Mathematics; Algorithm; Artificial intelligence; Artificial neural network; Statistics","score_opus":0.015684304278766808,"score_gpt":0.24203487129328252,"score_spread":0.22635056701451572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970634945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039503552,0.00019856813,0.94464624,0.00026397954,0.0023925544,0.0005497491,9.442412e-7,0.0007539804,0.011690449],"genre_scores_gemma":[0.9965496,0.0000014768184,0.001976555,0.00039107542,0.00007125986,0.000018031935,0.000007384701,0.000008920176,0.0009757107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823874,0.000042880914,0.0006075,0.00017278882,0.00058934785,0.00034872128],"domain_scores_gemma":[0.9987784,0.00003831192,0.0005012694,0.0003946403,0.00020600767,0.00008138188],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028309313,0.00017719997,0.00019822817,0.00019719609,0.00017528226,0.0015511676,0.0007138158,0.00008540272,0.000006665509],"category_scores_gemma":[0.000039365164,0.00015694971,0.000047028472,0.0003686353,0.000017383314,0.0069649857,0.00014379607,0.00022474406,0.0006029911],"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.000003989242,0.0000030571882,0.0027093282,0.00025273193,0.000005868183,0.0000013954925,0.0019840496,0.987396,0.00008236301,0.0018134041,0.0008049926,0.0049428],"study_design_scores_gemma":[0.00031503497,0.00006491468,0.00045116714,0.00014973729,0.0000027111882,0.00003740868,0.00031463557,0.98135096,0.000083841915,0.000014104373,0.017026778,0.00018871728],"about_ca_topic_score_codex":0.00001645132,"about_ca_topic_score_gemma":4.4437023e-8,"teacher_disagreement_score":0.95704603,"about_ca_system_score_codex":0.000083364204,"about_ca_system_score_gemma":0.000068126,"threshold_uncertainty_score":0.9994853},"labels":[],"label_agreement":null},{"id":"W2970641149","doi":"","title":"Residual Flows for Invertible Generative Modeling","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Invertible matrix; Residual; Lipschitz continuity; Discriminative model; Transformation (genetics); Computer science; Mathematics; Algorithm; Generative model; Artificial neural network; Density estimation; Applied mathematics; Mathematical optimization; Generative grammar; Artificial intelligence; Statistics; Estimator; Pure mathematics","score_opus":0.023988969713449645,"score_gpt":0.23942725955678212,"score_spread":0.21543828984333246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970641149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014851768,0.0001675184,0.98171335,0.00040996692,0.0010297527,0.0005957883,0.0000049883683,0.00014511718,0.0010817426],"genre_scores_gemma":[0.97334486,0.000002817032,0.025512664,0.00051503186,0.00024401916,0.000080503676,0.00002165848,0.000007781265,0.00027065017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987963,0.000051009833,0.00044759063,0.00019187473,0.00025470907,0.00025855086],"domain_scores_gemma":[0.99907166,0.000039721446,0.00019950324,0.00023445796,0.0003960702,0.000058586014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000319449,0.00014862223,0.00019229799,0.00011491588,0.00025321994,0.0009929836,0.00036692416,0.00006753514,0.0000032004004],"category_scores_gemma":[0.000044414996,0.00012390937,0.000049896167,0.00024586244,0.000009116437,0.006098606,0.00006901435,0.00008360596,0.00006522751],"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.000010614254,0.0000055767446,0.00002543953,0.00013849835,0.000008135023,1.246845e-7,0.0012330251,0.97447646,0.0010709367,0.002030375,0.0011801801,0.019820636],"study_design_scores_gemma":[0.00031730675,0.000056934605,0.0000042625284,0.000051140745,0.0000038123271,0.000005275453,0.00021433005,0.9946348,0.0012161023,0.00014056753,0.0031908534,0.00016459744],"about_ca_topic_score_codex":0.00003064854,"about_ca_topic_score_gemma":0.0000021346973,"teacher_disagreement_score":0.9584931,"about_ca_system_score_codex":0.000044509732,"about_ca_system_score_gemma":0.00009587304,"threshold_uncertainty_score":0.95753634},"labels":[],"label_agreement":null},{"id":"W2970667219","doi":"","title":"A Geometric Perspective on Optimal Representations for Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Insect and Pesticide Research","field":"Agricultural and Biological Sciences","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Université de Montréal","funders":"","keywords":"Reinforcement learning; Computer science; Representation (politics); Bellman equation; Perspective (graphical); Value (mathematics); Class (philosophy); Relaxation (psychology); Domain (mathematical analysis); Function (biology); Adversarial system; Artificial intelligence; Space (punctuation); Mathematical optimization; Machine learning; Mathematics; Mathematical analysis","score_opus":0.0356229744796313,"score_gpt":0.3060931110972628,"score_spread":0.2704701366176315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970667219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9707956,0.00009511929,0.00086411927,0.0006251336,0.00030519563,0.001300523,0.00001176687,0.0001414502,0.025861137],"genre_scores_gemma":[0.99789524,0.000003605578,0.000024140523,0.00010490832,0.0001497851,0.000106144056,0.00012262625,8.5843425e-7,0.001592715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989903,0.00003620699,0.00027337685,0.0001234636,0.0003355384,0.00024111559],"domain_scores_gemma":[0.9990882,0.00022016134,0.00017230032,0.000036697533,0.00042873644,0.00005385515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000285871,0.00009507186,0.00011802273,0.00007924132,0.0003407335,0.00038028695,0.0001274522,0.000058028774,0.00012954701],"category_scores_gemma":[0.00019276375,0.000040675688,0.000055012635,0.00055274885,0.000014761092,0.00087854406,0.000022283128,0.00014480163,0.00016628024],"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.0007125355,0.00009767525,0.0072476356,0.0007485803,0.000051777934,0.0000018603702,0.00568731,0.77851033,0.013121213,0.015973909,0.003030165,0.17481698],"study_design_scores_gemma":[0.00093578553,0.002514085,0.012218167,0.00019193006,0.000015828964,0.00003063719,0.021371963,0.9197664,0.0015308993,0.00008861462,0.04085122,0.00048443492],"about_ca_topic_score_codex":0.0002503013,"about_ca_topic_score_gemma":0.0000028167128,"teacher_disagreement_score":0.17433254,"about_ca_system_score_codex":0.000094394374,"about_ca_system_score_gemma":0.000018780833,"threshold_uncertainty_score":0.3667116},"labels":[],"label_agreement":null},{"id":"W2970673985","doi":"","title":"Learning Reward Machines for Partially Observable Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Observable; Computer science; Set (abstract data type); Artificial intelligence; Task (project management); Function (biology); Optimization problem; Learning automata; Representation (politics); Decomposition; Automaton; Mathematical optimization; Mathematics; Algorithm","score_opus":0.021000865689137876,"score_gpt":0.2534669585508525,"score_spread":0.23246609286171463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970673985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009366598,0.00008347839,0.9795047,0.00027504176,0.0013953254,0.0010580488,4.1791813e-7,0.00082568574,0.0074906996],"genre_scores_gemma":[0.9865053,0.0000066014845,0.0042388174,0.00030930343,0.00012326949,0.00012674893,0.000076498676,0.000022216036,0.008591196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739367,0.000094490904,0.0009842963,0.00028116454,0.00067813037,0.0005682698],"domain_scores_gemma":[0.99799085,0.00012883813,0.0009218098,0.00036360536,0.00048332085,0.000111576206],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088302436,0.00027890346,0.00033207246,0.00021388188,0.000553664,0.001821588,0.0007516076,0.00012572188,0.000011366171],"category_scores_gemma":[0.00025678906,0.0002555068,0.00010220126,0.00043769582,0.000022688797,0.0065847794,0.00019515668,0.0004129688,0.00029293817],"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.000015143391,0.00000347514,0.0026325784,0.00067961536,0.000012261616,3.4988363e-7,0.0017064933,0.98196477,0.00019342083,0.0029826306,0.00029981972,0.009509437],"study_design_scores_gemma":[0.0006109511,0.00037064916,0.00013670241,0.00017649913,0.000008109301,0.000015178179,0.0003079328,0.9319536,0.00019078488,0.000017856517,0.0659144,0.0002973376],"about_ca_topic_score_codex":0.000034991328,"about_ca_topic_score_gemma":4.5140496e-7,"teacher_disagreement_score":0.97713876,"about_ca_system_score_codex":0.00012179075,"about_ca_system_score_gemma":0.00013649907,"threshold_uncertainty_score":0.9999897},"labels":[],"label_agreement":null},{"id":"W2970700221","doi":"","title":"Invertible Convolutional Flow","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Jacobian matrix and determinant; Invertible matrix; Algorithm; Inverse; Computer science; Flow (mathematics); Computation; Applied mathematics; Convolution (computer science); Deconvolution; Mathematics; Mathematical optimization; Pure mathematics; Artificial intelligence; Artificial neural network","score_opus":0.009803219437600411,"score_gpt":0.20244898359163818,"score_spread":0.19264576415403778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970700221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052830786,0.0002211579,0.9827415,0.000499984,0.0018296404,0.00028219543,0.000003380911,0.00021859494,0.0089204805],"genre_scores_gemma":[0.99377716,0.0000018828865,0.004989571,0.00058952684,0.00010893078,0.00001506087,0.000013528121,0.0000035071969,0.0005008407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902225,0.000043614065,0.00031896442,0.00012769367,0.0002934928,0.00019396446],"domain_scores_gemma":[0.9993157,0.000024225139,0.00017509056,0.00019965305,0.0002290969,0.00005627123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019751354,0.00010585162,0.00012926936,0.00009210322,0.00014852968,0.0007049789,0.00033438724,0.000049526923,0.000020458916],"category_scores_gemma":[0.000022109547,0.00008868806,0.00003632634,0.00029503903,0.000018060611,0.006166317,0.000070052,0.00008438638,0.00055773713],"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.000018692226,0.00003220738,0.002161738,0.00045221738,0.000027025531,0.0000014570443,0.0023004897,0.7748884,0.0016323758,0.018279785,0.0185592,0.18164644],"study_design_scores_gemma":[0.00019113805,0.00002443369,0.0003398653,0.000036515037,0.0000015221659,0.000014444735,0.00006355543,0.9762402,0.00028804727,0.000053431813,0.02263147,0.000115372655],"about_ca_topic_score_codex":0.000022610502,"about_ca_topic_score_gemma":4.394528e-7,"teacher_disagreement_score":0.9884941,"about_ca_system_score_codex":0.000040926177,"about_ca_system_score_gemma":0.00008202049,"threshold_uncertainty_score":0.71687686},"labels":[],"label_agreement":null},{"id":"W2970783931","doi":"","title":"Legendre Memory Units: Continuous-Time Representation in Recurrent Neural Networks","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Reservoir Computing","field":"Computer Science","cited_by":95,"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; MNIST database; Recurrent neural network; Backpropagation; Artificial neural network; Algorithm; Artificial intelligence","score_opus":0.014825311699941644,"score_gpt":0.2382913086173716,"score_spread":0.22346599691742997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970783931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88723767,0.0016355509,0.09444574,0.0013254691,0.0071534733,0.0021545673,0.000004145735,0.00100767,0.0050357413],"genre_scores_gemma":[0.99882454,0.000008044823,0.00019891831,0.00031685396,0.00021982718,0.000026407226,0.00004247944,0.000012077648,0.00035087383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975729,0.00019644943,0.00094067946,0.0003246701,0.00047558773,0.00048971636],"domain_scores_gemma":[0.9984508,0.000098408775,0.00058758876,0.00042806272,0.00033282954,0.000102287195],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047870158,0.00024069258,0.00034848112,0.0002666252,0.00018196896,0.001144103,0.00074686937,0.00012571165,0.000006660042],"category_scores_gemma":[0.00004048682,0.00020777347,0.000056282643,0.0013831615,0.000025755151,0.005689695,0.00024253804,0.0004095437,0.00008202035],"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.000019579906,0.000018822406,0.0026450274,0.00020555107,0.000005924666,0.000008183337,0.0010415467,0.84356004,0.00006902716,0.00046325152,0.0010649376,0.15089808],"study_design_scores_gemma":[0.0005157195,0.00007154548,0.00078660465,0.00024009687,0.0000024827286,0.00007233089,0.0003039824,0.99651515,0.000035794168,0.000009734009,0.0012000583,0.0002464864],"about_ca_topic_score_codex":0.000059551774,"about_ca_topic_score_gemma":0.0000028918707,"teacher_disagreement_score":0.1529551,"about_ca_system_score_codex":0.00008164347,"about_ca_system_score_gemma":0.00006106376,"threshold_uncertainty_score":0.99989283},"labels":[],"label_agreement":null},{"id":"W2970803838","doi":"","title":"Lookahead Optimizer: k steps forward, 1 step back","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":176,"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":"Treebank; Computer science; Stochastic gradient descent; Hyperparameter; Artificial neural network; Machine translation; Computation; Artificial intelligence; Gradient descent; Algorithm; Deep neural networks; Stability (learning theory); Mathematical optimization; Machine learning; Mathematics","score_opus":0.013592823231687565,"score_gpt":0.24653417746470588,"score_spread":0.23294135423301832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970803838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056097186,0.00028407123,0.975105,0.0007283797,0.001075949,0.0012055001,0.0000066074226,0.0006379221,0.015346889],"genre_scores_gemma":[0.9554285,0.000014939131,0.040077507,0.0012667549,0.00015552131,0.00017343198,0.000060364157,0.000023478706,0.0027995035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807495,0.000049822956,0.00071236625,0.0002892051,0.00047087407,0.00040276046],"domain_scores_gemma":[0.9983163,0.000071313734,0.00051585917,0.0006758397,0.00028982168,0.00013084813],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022016368,0.00022657787,0.00026280992,0.00015697583,0.00021158783,0.0008607017,0.0009109073,0.00009758034,0.000017485603],"category_scores_gemma":[0.000017415345,0.00020136316,0.00006575987,0.00072211714,0.000031925072,0.008142939,0.00018098763,0.00021568128,0.0020072013],"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.000050780738,0.0000790811,0.0011895862,0.0015085416,0.00003368526,0.0000026783591,0.0023148945,0.52543354,0.00073846686,0.05159757,0.021075126,0.39597604],"study_design_scores_gemma":[0.0004528568,0.00004971702,0.00008723524,0.000082704624,0.0000033571303,0.00005825325,0.00010240252,0.9085711,0.00014130247,0.00010265005,0.090097636,0.00025078055],"about_ca_topic_score_codex":0.000010651171,"about_ca_topic_score_gemma":6.553132e-7,"teacher_disagreement_score":0.9498188,"about_ca_system_score_codex":0.00008731932,"about_ca_system_score_gemma":0.00007151863,"threshold_uncertainty_score":0.9987699},"labels":[],"label_agreement":null},{"id":"W2970990876","doi":"","title":"Reducing the variance in online optimization by transporting past gradients","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","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; University of British Columbia","funders":"","keywords":"Hessian matrix; Estimator; Computer science; Iterated function; Variance (accounting); Variance reduction; Convergence (economics); Mathematical optimization; Rate of convergence; Optimization problem; Applied mathematics; Algorithm; Mathematics; Statistics; Mathematical analysis","score_opus":0.011025963739625494,"score_gpt":0.2322976399575386,"score_spread":0.2212716762179131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970990876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020453312,0.00009600173,0.9769901,0.00050810864,0.0005556022,0.0006244872,0.0000058026535,0.0003196105,0.00044697922],"genre_scores_gemma":[0.98220485,0.000004829013,0.017248424,0.00029603203,0.00003241377,0.00005308179,0.000075444004,0.000008967543,0.00007592427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983845,0.000052358693,0.00075935165,0.00019627588,0.00035773148,0.00024978505],"domain_scores_gemma":[0.9988894,0.00004091948,0.0005525481,0.00029504648,0.00018112178,0.00004096752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041243076,0.00014617215,0.00016192975,0.00018268409,0.00014743338,0.00051881216,0.00058011216,0.00006703775,0.0000028902866],"category_scores_gemma":[0.00004618775,0.000114040326,0.000026831976,0.0008805835,0.000021886592,0.004233804,0.000041358286,0.00017065227,0.00000873395],"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.0000040326636,0.000022728198,0.0013167142,0.00012317722,0.0000022039897,2.8730213e-7,0.0026726038,0.9851574,0.0000736268,0.0015110243,0.00021249677,0.008903719],"study_design_scores_gemma":[0.00025548929,0.000029518918,0.00046928282,0.00020829076,0.00000199117,0.0000159248,0.00024990801,0.99827963,0.000055769833,0.00002473791,0.00027696823,0.00013246744],"about_ca_topic_score_codex":0.00005537036,"about_ca_topic_score_gemma":8.540974e-7,"teacher_disagreement_score":0.9617516,"about_ca_system_score_codex":0.000085269974,"about_ca_system_score_gemma":0.00004205406,"threshold_uncertainty_score":0.50029176},"labels":[],"label_agreement":null},{"id":"W2971133559","doi":"","title":"Universal Boosting Variational Inference","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Domain Adaptation and Few-Shot Learning","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":"Mathematics; Mathematical optimization; Boosting (machine learning); Hellinger distance; Degeneracy (biology); Applied mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.016146962566080145,"score_gpt":0.24058967803656828,"score_spread":0.22444271547048814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971133559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009806562,0.000031538133,0.9603378,0.00028014695,0.00064759277,0.0001982812,0.0000014600434,0.0003663403,0.028330281],"genre_scores_gemma":[0.99094963,7.623871e-7,0.0077282633,0.00046432886,0.000035132405,0.0000066889206,0.000015750877,0.0000040053874,0.00079543673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988757,0.000040964253,0.0003603825,0.00013299094,0.00039996134,0.0001900431],"domain_scores_gemma":[0.9990977,0.00007319651,0.00034203203,0.00016829379,0.000255854,0.00006290176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029840076,0.00010489816,0.00011040565,0.00015567213,0.00018968304,0.00095560605,0.00037918554,0.000054460103,0.00001445211],"category_scores_gemma":[0.00009483014,0.00009984417,0.000025989739,0.00036372093,0.0000135813725,0.0070187184,0.00007819679,0.00014969513,0.0003795347],"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.0000096354015,0.000013509773,0.002875701,0.00026978084,0.000008389349,0.0000012135044,0.0077388044,0.65492743,0.00040734842,0.25708044,0.00037601954,0.0762917],"study_design_scores_gemma":[0.00025742035,0.000019371812,0.0010321984,0.000052895408,0.0000013179263,0.000012894914,0.0003323942,0.99051434,0.000014652459,0.00010603134,0.007529854,0.00012660482],"about_ca_topic_score_codex":0.000012609729,"about_ca_topic_score_gemma":2.3750769e-7,"teacher_disagreement_score":0.98114306,"about_ca_system_score_codex":0.00006144486,"about_ca_system_score_gemma":0.00017483009,"threshold_uncertainty_score":0.9214931},"labels":[],"label_agreement":null},{"id":"W2971218263","doi":"","title":"SMILe: Scalable Meta Inverse Reinforcement Learning through Context-Conditional Policies","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Meta learning (computer science); Scalability; Machine learning; Principle of maximum entropy; Context (archaeology); Task (project management)","score_opus":0.03388311419550946,"score_gpt":0.2615376253999302,"score_spread":0.22765451120442073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971218263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041957935,0.00018061294,0.9541455,0.00044470665,0.0011702264,0.00076425896,0.0000022146503,0.00069145527,0.03840524],"genre_scores_gemma":[0.99059904,0.000008758606,0.0013526244,0.0018026374,0.000076752935,0.00007141324,0.00009813909,0.000013503754,0.005977126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731076,0.00009596322,0.0009220708,0.0002425263,0.0009498176,0.00047885938],"domain_scores_gemma":[0.9981554,0.000087809836,0.0008239458,0.00041135843,0.0004256564,0.000095830095],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047951503,0.00029067489,0.00039510132,0.00022148629,0.00042599975,0.0015346046,0.00073236704,0.00011804399,0.00007511479],"category_scores_gemma":[0.00009300755,0.00024950225,0.00012769934,0.00056111347,0.00006343841,0.011470991,0.00023443345,0.00037447226,0.0010063123],"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.000004263585,0.0000046554132,0.00030517156,0.00028649866,0.00007217233,6.324762e-7,0.0032740787,0.96989506,0.00006967596,0.023248775,0.0021869738,0.00065204455],"study_design_scores_gemma":[0.0005026505,0.0001204734,0.000120874305,0.00008205771,0.00003932692,0.000038609407,0.0012393942,0.94919413,0.0002847671,0.00006688205,0.048019275,0.00029157783],"about_ca_topic_score_codex":0.00020086204,"about_ca_topic_score_gemma":8.307445e-7,"teacher_disagreement_score":0.9864032,"about_ca_system_score_codex":0.00015133731,"about_ca_system_score_gemma":0.00015636816,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W2971278153","doi":"","title":"Latent Ordinary Differential Equations for Irregularly-Sampled Time Series","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":253,"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":"Ode; Recurrent neural network; Ordinary differential equation; Series (stratigraphy); Computer science; Applied mathematics; Time series; Differential equation; Algorithm; Artificial neural network; Artificial intelligence; Mathematics; Machine learning; Mathematical analysis","score_opus":0.019262993932551497,"score_gpt":0.26730703194135114,"score_spread":0.24804403800879965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971278153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047468826,0.0001292724,0.94561476,0.0019783732,0.001943091,0.0015150746,0.000019332008,0.0007490476,0.00058222393],"genre_scores_gemma":[0.9929676,6.8048047e-7,0.0044234674,0.00018634174,0.00012480783,0.00016003086,0.0001422168,0.000011904329,0.0019829208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846834,0.000082475206,0.0005813701,0.00019617916,0.00037004353,0.00030161976],"domain_scores_gemma":[0.9986369,0.00011612393,0.0004146524,0.0003496457,0.0004022633,0.00008040252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026682703,0.00016509797,0.0002236525,0.00017065323,0.00032165865,0.0010016753,0.0004973075,0.00009163102,0.000020951864],"category_scores_gemma":[0.000111947076,0.00014390549,0.0000626773,0.00029262423,0.000018024655,0.005243296,0.000111024,0.00015607379,0.00025348604],"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.00041407094,0.00022514602,0.01430225,0.021426119,0.00015507497,0.0000050865397,0.029512344,0.23038878,0.0050293645,0.23133475,0.011104252,0.45610276],"study_design_scores_gemma":[0.00036089748,0.00015052813,0.0012525889,0.00010589619,0.0000045835445,0.000025519184,0.00005413944,0.99035764,0.000038502283,0.00012838253,0.0073442175,0.00017713252],"about_ca_topic_score_codex":0.000048071677,"about_ca_topic_score_gemma":9.081952e-7,"teacher_disagreement_score":0.9454988,"about_ca_system_score_codex":0.00007245071,"about_ca_system_score_gemma":0.00011581667,"threshold_uncertainty_score":0.96591777},"labels":[],"label_agreement":null},{"id":"W2971278755","doi":"","title":"Efficient and Thrifty Voting by Any Means Necessary","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Voting; Outcome (game theory); Distortion (music); Social choice theory; Pareto principle; Computer science; Anti-plurality voting; Mathematical economics; Majority rule; Social Welfare; Pareto efficiency; Cardinal voting systems; Bullet voting; Microeconomics; Economics; Econometrics; Mathematical optimization; Mathematics; Artificial intelligence; Political science","score_opus":0.01461270378024442,"score_gpt":0.20387383084491287,"score_spread":0.18926112706466844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971278755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96543264,0.0024691883,0.004896344,0.00016983869,0.0010274263,0.00044492964,0.000060544287,0.00016300866,0.025336076],"genre_scores_gemma":[0.99885637,0.0000039891606,0.000030023653,0.0002161826,0.00006360589,0.000017300168,0.000024967952,0.00001362116,0.00077394454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985534,0.000029685678,0.00086432474,0.00020468283,0.00007448566,0.0002733992],"domain_scores_gemma":[0.9989181,0.000042338124,0.0007526793,0.00015755964,0.00005663887,0.00007264934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095625373,0.00016202166,0.00033480334,0.00015222705,0.00018832806,0.000485703,0.00015072775,0.00010274334,0.00002279916],"category_scores_gemma":[0.000060245897,0.00016177515,0.000040125098,0.00020815185,0.000033615426,0.00096705405,0.000038355072,0.00015004087,0.00049668684],"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.00014886438,0.0001988422,0.37524936,0.0130978655,0.00014260838,0.0000027205308,0.03052442,0.13344604,0.0009846401,0.42040423,0.0077832197,0.018017182],"study_design_scores_gemma":[0.0006411161,0.000060914183,0.0020690195,0.00026003737,0.0000040613804,0.00003757633,0.0015983806,0.9746266,0.00005239345,0.00013354057,0.020165492,0.00035083844],"about_ca_topic_score_codex":0.00009083985,"about_ca_topic_score_gemma":4.5015477e-7,"teacher_disagreement_score":0.8411806,"about_ca_system_score_codex":0.000043277032,"about_ca_system_score_gemma":0.000011110811,"threshold_uncertainty_score":0.6596999},"labels":[],"label_agreement":null},{"id":"W2991356711","doi":"","title":"Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes","year":2019,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Statistical Methods and Inference","field":"Mathematics","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":"Bayes' theorem; Bayesian probability; Computer science; Generalization; Mathematics; Algorithm; Artificial intelligence","score_opus":0.047565025380845095,"score_gpt":0.3282503884662163,"score_spread":0.2806853630853712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991356711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19619066,0.00023920734,0.7941713,0.00021216726,0.0008863615,0.000964791,0.000026690066,0.0004788418,0.006830022],"genre_scores_gemma":[0.98365873,0.000007564489,0.015030617,0.00033152042,0.00014112987,0.000092682385,0.00005784893,0.000028519278,0.00065135816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980234,0.0001647227,0.00088260055,0.00019347231,0.00041772664,0.00031807332],"domain_scores_gemma":[0.99812746,0.0002902551,0.00062241923,0.00022510321,0.000638986,0.00009579425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977356,0.00024667187,0.0003529233,0.0001419146,0.00018343545,0.0006852305,0.00020233006,0.00015515278,0.00009942496],"category_scores_gemma":[0.0010110227,0.000194755,0.00003875594,0.00055028894,0.00003773946,0.002075841,0.000036435027,0.00017683877,0.00014889703],"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.0004825035,0.0005167563,0.021256506,0.081474185,0.0002775709,0.000014386527,0.03610078,0.0131352125,0.01348051,0.39965025,0.012995046,0.42061627],"study_design_scores_gemma":[0.0010094432,0.00021418127,0.0014117487,0.000810507,0.000062959596,0.000055010114,0.0010488213,0.95290154,0.0020190587,0.033571027,0.006121706,0.00077398436],"about_ca_topic_score_codex":0.000035153476,"about_ca_topic_score_gemma":0.0000020571151,"teacher_disagreement_score":0.93976635,"about_ca_system_score_codex":0.00006141608,"about_ca_system_score_gemma":0.00012343455,"threshold_uncertainty_score":0.79418784},"labels":[],"label_agreement":null},{"id":"W3024230214","doi":"","title":"Stochastic Nested Variance Reduction for Nonconvex Optimization","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","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 Waterloo","funders":"","keywords":"Variance reduction; Mathematics; Combinatorics; Nabla symbol; Gradient descent; Function (biology); Stationary point; Reduction (mathematics); Applied mathematics; Mathematical analysis; Computer science; Physics; Geometry; Statistics; Omega","score_opus":0.019737543993972165,"score_gpt":0.2620247578532457,"score_spread":0.24228721385927354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024230214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012382498,0.00003273881,0.9953254,0.00029667633,0.0017965777,0.0009646842,0.00000465808,0.00095183594,0.0005035914],"genre_scores_gemma":[0.76555425,9.968331e-7,0.23325132,0.0002200434,0.0003731412,0.0003832098,0.000060629507,0.000016004191,0.00014041028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985493,0.000034914545,0.000610432,0.00023565273,0.00030843643,0.00026126037],"domain_scores_gemma":[0.9978238,0.000040202438,0.00055980455,0.00031405783,0.0011862436,0.00007592399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003331871,0.00017131196,0.00017020135,0.00028851812,0.00041234877,0.00083737687,0.00044627883,0.00010647829,0.000003614937],"category_scores_gemma":[0.00017970553,0.00016643273,0.00003673452,0.0007467608,0.00007113203,0.005788488,0.00005173993,0.00007497474,0.00002040966],"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.000030600237,0.000025340365,0.0000041092517,0.00023336883,0.000009026398,1.3073237e-7,0.0027310117,0.93464696,0.00012955496,0.03290858,0.0015827809,0.02769854],"study_design_scores_gemma":[0.00034138115,0.00016029314,0.000007244253,0.0000987974,0.0000072337175,0.000070094415,0.00010026067,0.9978948,0.00034781778,0.00022899653,0.0005573545,0.00018569517],"about_ca_topic_score_codex":0.00000981629,"about_ca_topic_score_gemma":1.0803623e-7,"teacher_disagreement_score":0.7654304,"about_ca_system_score_codex":0.00009862714,"about_ca_system_score_gemma":0.000108366934,"threshold_uncertainty_score":0.80748445},"labels":[],"label_agreement":null},{"id":"W3098331497","doi":"","title":"Exploiting weakly supervised visual patterns to learn from partial annotations","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Visualization; Pattern recognition (psychology)","score_opus":0.04010477857880841,"score_gpt":0.2992739282928343,"score_spread":0.2591691497140259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098331497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06612259,0.00004801234,0.93084806,0.0014635245,0.0001906513,0.00030561793,0.000015089323,0.00083509303,0.0001713763],"genre_scores_gemma":[0.9863284,0.0000028364127,0.010161656,0.003147811,0.0002311488,0.00006192345,0.000044585682,0.000009718539,0.00001190753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853927,0.00005143105,0.0005611315,0.00022116452,0.0003755021,0.00025152616],"domain_scores_gemma":[0.99912417,0.000045351266,0.00022169676,0.00016223268,0.00025914062,0.0001873921],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00010832326,0.00015762782,0.00018441513,0.00009541221,0.00023926573,0.0010868626,0.00045180562,0.000053659383,0.000005629666],"category_scores_gemma":[0.00017527511,0.00014868121,0.000042414566,0.0005570458,0.000012229551,0.007506236,0.00014575486,0.00016081022,0.00012139773],"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.000044789445,0.000031951917,0.0014526919,0.0003936589,0.000014503417,0.000009905847,0.029209543,0.0073113292,0.012241192,0.00097522227,0.0012561271,0.9470591],"study_design_scores_gemma":[0.0002497671,0.00018168584,0.00042765148,0.00015081225,0.000005088118,0.0000065019112,0.0018048121,0.96370053,0.023642313,0.000041263913,0.009488729,0.00030084682],"about_ca_topic_score_codex":0.00006463099,"about_ca_topic_score_gemma":7.5348305e-7,"teacher_disagreement_score":0.9563892,"about_ca_system_score_codex":0.000033806857,"about_ca_system_score_gemma":0.000052440788,"threshold_uncertainty_score":0.9999501},"labels":[],"label_agreement":null},{"id":"W3098410977","doi":"","title":"Escaping the Gravitational Pull of Softmax","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Thermodynamics and Statistical Mechanics","field":"Physics and Astronomy","cited_by":13,"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":"Softmax function; Computer science; Gravitation; Physics; Astronomy; Artificial intelligence; Convolutional neural network","score_opus":0.015999474418498066,"score_gpt":0.24280885204077338,"score_spread":0.22680937762227532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098410977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016610606,0.000049576687,0.9799598,0.0004624982,0.00014152202,0.00019378055,0.000076591816,0.00002809946,0.0024775655],"genre_scores_gemma":[0.9991457,2.1568687e-7,0.0005092626,0.00017078943,0.000091134774,0.000015052776,0.000051385032,0.0000046262417,0.000011868163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993445,0.000017900493,0.00032375366,0.00005290577,0.00016548934,0.00009541302],"domain_scores_gemma":[0.9994701,0.00004534322,0.00024998962,0.000053200074,0.00014269265,0.000038686223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066985245,0.00007105678,0.00010234491,0.000015302869,0.00011497427,0.00008952426,0.00010894417,0.000014719043,0.000016106465],"category_scores_gemma":[0.000021229844,0.00004949361,0.00002959749,0.00012691237,0.00002263928,0.00051323633,0.00001893759,0.00008799705,0.000012530394],"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.000028238801,0.00001629178,0.00028425024,0.00037314117,0.000024640154,1.6630861e-7,0.005053872,0.033706307,0.0011922239,0.7848556,0.00020561319,0.17425968],"study_design_scores_gemma":[0.00015838063,0.000025127376,0.000103913844,0.0000298213,0.0000073368974,7.284074e-7,0.0016154436,0.98969686,0.00013964057,0.006955246,0.0011912232,0.00007627429],"about_ca_topic_score_codex":0.000010634547,"about_ca_topic_score_gemma":7.939853e-8,"teacher_disagreement_score":0.98253506,"about_ca_system_score_codex":0.0000063261955,"about_ca_system_score_gemma":0.000027930526,"threshold_uncertainty_score":0.20182908},"labels":[],"label_agreement":null},{"id":"W3098528340","doi":"","title":"Differentiable Meta-Learning of Bandit Policies.","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Differentiable function; Meta learning (computer science); Computer science; Artificial intelligence; Mathematics; Economics","score_opus":0.23017559285573402,"score_gpt":0.4086101303330043,"score_spread":0.17843453747727028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098528340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15846716,0.002903038,0.8177622,0.0050969147,0.0009163996,0.0016166351,0.0001010901,0.0006649833,0.012471562],"genre_scores_gemma":[0.9986326,0.000005126721,0.0001966844,0.00019728784,0.00010545941,0.00002776804,0.000014183431,0.0000091649545,0.0008117356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960571,0.00017324973,0.0012435801,0.00019677069,0.0020320562,0.000297254],"domain_scores_gemma":[0.9975045,0.0003063678,0.00087338395,0.00021407865,0.00093067763,0.00017099458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009582213,0.00016097094,0.0005319765,0.00029272021,0.00024111572,0.000807128,0.0006266476,0.0000719775,0.00020309228],"category_scores_gemma":[0.0024657983,0.00010579439,0.00013877806,0.0013181594,0.000091067355,0.0038500775,0.00014406073,0.00028078788,0.00022612768],"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.00021637873,0.00006583078,0.0049295328,0.0015226007,0.00036337817,0.0000046060454,0.024643382,0.7862515,0.0023875784,0.0014357079,0.01888719,0.15929233],"study_design_scores_gemma":[0.00039320329,0.00012901788,0.0006521727,0.000024345798,0.00004980342,0.000011603734,0.0035320716,0.93331844,0.0019927232,0.00017213174,0.05954936,0.00017514195],"about_ca_topic_score_codex":0.000043045256,"about_ca_topic_score_gemma":4.654057e-7,"teacher_disagreement_score":0.84016544,"about_ca_system_score_codex":0.000029079754,"about_ca_system_score_gemma":0.0000825762,"threshold_uncertainty_score":0.77831537},"labels":[],"label_agreement":null},{"id":"W3098536204","doi":"","title":"On the Optimal Weighted $\\ell_2$ Regularization in Overparameterized Linear Regression","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","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":"Combinatorics; Lambda; Star (game theory); Physics; Regularization (linguistics); Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.026903009874408267,"score_gpt":0.24682546761520707,"score_spread":0.2199224577407988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098536204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010406922,0.000028688595,0.98428,0.0030815687,0.00024000675,0.00061058,0.0000020908737,0.0005071372,0.0008429918],"genre_scores_gemma":[0.978441,0.0000032552384,0.019205922,0.002106553,0.0000504193,0.00009752904,0.000029770514,0.000010759663,0.00005477414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984359,0.000112653106,0.0005978323,0.00020130469,0.00045753323,0.00019475612],"domain_scores_gemma":[0.9989407,0.00010362259,0.00043297518,0.00027218848,0.00018018037,0.00007029963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028517982,0.00016819093,0.00017667885,0.00017490532,0.00017635096,0.0005462496,0.0005685061,0.00009248213,0.000004874479],"category_scores_gemma":[0.00030618894,0.0001120351,0.00003507781,0.0010193964,0.000032760498,0.0025303978,0.00009622886,0.00020256934,0.00003142069],"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.0003051411,0.000115200455,0.00014970868,0.00067184295,0.000020838734,0.000010705942,0.021870583,0.47974095,0.0016614024,0.44055396,0.006067989,0.04883166],"study_design_scores_gemma":[0.00030434673,0.00010201452,0.000023962748,0.00017324342,0.0000018532635,0.000007605254,0.00008568927,0.9970643,0.0012473328,0.00039665741,0.00046327975,0.00012971231],"about_ca_topic_score_codex":0.0000046551854,"about_ca_topic_score_gemma":5.3832025e-8,"teacher_disagreement_score":0.9680341,"about_ca_system_score_codex":0.00005694096,"about_ca_system_score_gemma":0.00005249307,"threshold_uncertainty_score":0.5267498},"labels":[],"label_agreement":null},{"id":"W3098770144","doi":"","title":"Graph Policy Network for Transferable Active Learning on Graphs","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Machine learning; Artificial intelligence; Graph; Theoretical computer science","score_opus":0.0221627674460945,"score_gpt":0.25844239892404175,"score_spread":0.23627963147794726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098770144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004814213,0.0001772694,0.9872771,0.00366144,0.00059446594,0.00095413113,0.000008514693,0.00093918346,0.0015736704],"genre_scores_gemma":[0.99256295,0.000015200074,0.002951238,0.0038412057,0.00039028475,0.00015114245,0.000031540312,0.000017537477,0.000038924947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982492,0.0000751961,0.00053339696,0.0002824496,0.0003501019,0.0005096761],"domain_scores_gemma":[0.9989576,0.00012602343,0.00032861068,0.00018064163,0.0002221307,0.00018502127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016007356,0.00024518368,0.00027338925,0.00018666587,0.00060129334,0.0006248471,0.0005589314,0.00010264559,7.3178734e-7],"category_scores_gemma":[0.00009395261,0.0002200578,0.00012160948,0.0016236525,0.00003607421,0.0046960423,0.00004151621,0.00037423166,0.0000150781325],"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.00010193824,0.000008877867,0.00006196824,0.0002802168,0.000013732559,0.0000010256713,0.0026271269,0.8031144,0.00008002591,0.05263317,0.0014204478,0.13965704],"study_design_scores_gemma":[0.0006785188,0.00044595372,0.00009089391,0.00012432027,0.000006222735,0.000013655599,0.0001902798,0.9758629,0.00030927305,0.0025528364,0.01941018,0.00031494326],"about_ca_topic_score_codex":0.0000110396095,"about_ca_topic_score_gemma":6.246267e-7,"teacher_disagreement_score":0.98774874,"about_ca_system_score_codex":0.000040573068,"about_ca_system_score_gemma":0.000072807416,"threshold_uncertainty_score":0.8973697},"labels":[],"label_agreement":null},{"id":"W3098804530","doi":"","title":"Decision trees as partitioning machines to characterize their generalization properties","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton; Université Laval","funders":"","keywords":"Generalization; Dimension (graph theory); Pruning; Decision tree; Bounded function; Mathematics; Binary decision diagram; Function (biology); VC dimension; Combinatorics; Binary tree; Integer (computer science); Upper and lower bounds; Discrete mathematics; Tree (set theory); Binary number; Weight-balanced tree; Simple (philosophy); Algorithm; Computer science; Binary search tree; Artificial intelligence; Arithmetic","score_opus":0.045104908451804655,"score_gpt":0.25600826252564246,"score_spread":0.2109033540738378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098804530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15419555,0.00014405073,0.83654416,0.0070121465,0.00044354392,0.00037022986,0.000008678548,0.00068442035,0.0005972573],"genre_scores_gemma":[0.99454033,0.000006149566,0.0021939913,0.0028298525,0.00017020205,0.00006544662,0.00013129867,0.0000080828495,0.000054667133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868506,0.00007846302,0.0005126633,0.00021435102,0.00033230882,0.00017713502],"domain_scores_gemma":[0.99909216,0.000020302274,0.0002964211,0.00022826208,0.00022304563,0.00013980418],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021689424,0.00015497727,0.00015620618,0.00012211573,0.0003418516,0.0017191351,0.00045730712,0.000051567902,0.0000053038634],"category_scores_gemma":[0.00027290842,0.00011577494,0.000029639106,0.0005381326,0.000012890977,0.005172016,0.00010763393,0.00010989155,0.00021566087],"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.00006743578,0.000022474162,0.0017284733,0.00040055884,0.00000880928,0.0000010798439,0.017937794,0.058976807,0.015798727,0.0056924727,0.0019866268,0.89737874],"study_design_scores_gemma":[0.00014805947,0.00007451476,0.0037490597,0.000118684926,0.0000023034245,0.000016637796,0.00015244308,0.95871115,0.0007084713,0.000023948265,0.03613315,0.00016157143],"about_ca_topic_score_codex":0.000067543086,"about_ca_topic_score_gemma":0.0000025885322,"teacher_disagreement_score":0.8997344,"about_ca_system_score_codex":0.000028521961,"about_ca_system_score_gemma":0.000053211894,"threshold_uncertainty_score":0.99931717},"labels":[],"label_agreement":null},{"id":"W3099022131","doi":"","title":"Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual information; Generalization; Conditional mutual information; Computer science; Algorithm; Sample complexity; Sample (material); Mathematics; Artificial intelligence; Theoretical computer science","score_opus":0.017739944479120598,"score_gpt":0.2671884721861898,"score_spread":0.2494485277070692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099022131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072739404,0.000012806524,0.9865937,0.0045067924,0.000116515424,0.0007768772,0.000049138387,0.00031328047,0.0003569196],"genre_scores_gemma":[0.9808734,0.0000013846304,0.0055198125,0.01209418,0.00021644999,0.00032639003,0.0009533271,0.0000070529404,0.000008006263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984948,0.000054321332,0.0005774185,0.00023574202,0.00044128005,0.00019645531],"domain_scores_gemma":[0.99878997,0.000030609892,0.00034797267,0.00021607688,0.00037202626,0.00024332828],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001593063,0.00018928056,0.0001574207,0.00016698473,0.000429353,0.0017963828,0.00034687258,0.00007730272,0.0000030672907],"category_scores_gemma":[0.00002943164,0.00017591537,0.000024814326,0.0007161519,0.000027739135,0.008996799,0.000059024733,0.00012128706,0.0000849301],"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.000059092814,0.00004998012,0.00019834137,0.0002564675,0.000007624459,5.4520075e-7,0.0064347405,0.7357505,0.0008578657,0.053007547,0.0040769833,0.19930033],"study_design_scores_gemma":[0.00034641026,0.00019650739,0.0004920088,0.000025654219,0.000003603982,0.0000065191634,0.00008801616,0.9784987,0.0002595184,0.0000978084,0.019782221,0.00020305387],"about_ca_topic_score_codex":0.000016499076,"about_ca_topic_score_gemma":0.0000011456815,"teacher_disagreement_score":0.9810739,"about_ca_system_score_codex":0.000052954394,"about_ca_system_score_gemma":0.00007343135,"threshold_uncertainty_score":0.99923986},"labels":[],"label_agreement":null},{"id":"W3099060373","doi":"","title":"Adversarial Example Games","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Adversarial system; Computer science; Artificial intelligence","score_opus":0.029357070575294738,"score_gpt":0.2449176958512792,"score_spread":0.21556062527598446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099060373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009439912,0.000067693756,0.99391514,0.0007733386,0.00046294066,0.00023679958,0.000001909355,0.0017931534,0.0018050508],"genre_scores_gemma":[0.9858544,0.0000022702825,0.012353224,0.0015292576,0.00016492623,0.00004601532,0.0000061515907,0.0000061008077,0.000037693946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895114,0.000030568495,0.00039500665,0.00015638882,0.0002931742,0.0001737353],"domain_scores_gemma":[0.9992334,0.000020927404,0.00027880943,0.00018377061,0.00018452144,0.00009852731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010896429,0.000117381205,0.00013492325,0.000084125255,0.00015148424,0.00059048797,0.00045233473,0.00005748664,0.00000340389],"category_scores_gemma":[0.00008036482,0.00010859382,0.00003266424,0.0004502156,0.000020230067,0.007296699,0.00010605234,0.00013115299,0.000077024015],"study_design_candidate":"design_other","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.000053577314,0.00002021606,0.000120309975,0.0009708814,0.000014238431,0.0000072385437,0.014599773,0.017569328,0.0025270225,0.024629228,0.0123978555,0.92709035],"study_design_scores_gemma":[0.00028920503,0.000111825226,0.000041241852,0.00003443407,0.0000024218214,0.00003899046,0.00024664873,0.8180868,0.005335223,0.00018053938,0.17541257,0.00022009606],"about_ca_topic_score_codex":0.00003178459,"about_ca_topic_score_gemma":2.480737e-7,"teacher_disagreement_score":0.98491037,"about_ca_system_score_codex":0.000037699694,"about_ca_system_score_gemma":0.000049756454,"threshold_uncertainty_score":0.5694089},"labels":[],"label_agreement":null},{"id":"W3099351824","doi":"","title":"Online Fast Adaptation and Knowledge Accumulation (OSAKA): a New Approach to Continual Learning","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Adaptation (eye); Artificial intelligence; Knowledge management; Machine learning; Psychology","score_opus":0.09874274633483145,"score_gpt":0.30306125328846156,"score_spread":0.20431850695363013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099351824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007967669,0.00010570609,0.9858485,0.0009470997,0.00013880916,0.00035093544,0.0000016853123,0.0004223309,0.0042172633],"genre_scores_gemma":[0.96865094,0.0000022128227,0.029586812,0.0009609794,0.00014258803,0.000015373482,0.00006356456,0.000009820964,0.0005677311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986235,0.00009229014,0.0005187087,0.00024735017,0.0003069762,0.00021119193],"domain_scores_gemma":[0.99901736,0.000041425104,0.00032792616,0.000105881045,0.0002379031,0.00026952047],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027194497,0.00016338461,0.00019060267,0.00016504558,0.00027428687,0.0012040944,0.00026238934,0.00007216622,0.0000016900369],"category_scores_gemma":[0.00027103047,0.00015912091,0.000027260816,0.0006583538,0.000016177772,0.0042383466,0.0001067713,0.00023171227,0.00008065856],"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.000018307084,0.000017977842,0.0000931292,0.00020112083,0.000004747821,2.280474e-7,0.06978073,0.55204606,0.0001752083,0.0032230914,0.0007154844,0.3737239],"study_design_scores_gemma":[0.00046613935,0.000057018384,0.00047103784,0.000047966783,0.0000043843643,0.000012295608,0.0040321257,0.9747914,0.0000138404575,0.000009507458,0.019918488,0.0001757965],"about_ca_topic_score_codex":0.000021504324,"about_ca_topic_score_gemma":0.0000016657797,"teacher_disagreement_score":0.9606832,"about_ca_system_score_codex":0.00003636885,"about_ca_system_score_gemma":0.00015961796,"threshold_uncertainty_score":0.99983275},"labels":[],"label_agreement":null},{"id":"W3099873237","doi":"","title":"Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Submodular set function; Regret; Computer science; Maximization; Order (exchange); Algorithm; Approximation algorithm; Mathematical optimization; Mathematics; Machine learning","score_opus":0.04129501515726763,"score_gpt":0.26037031659564563,"score_spread":0.219075301438378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099873237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092556636,0.00017678691,0.9935031,0.0032534811,0.000838834,0.00066387065,0.000044582623,0.0005183242,0.00007546878],"genre_scores_gemma":[0.7053811,0.000023895458,0.2870251,0.005156613,0.0010382193,0.00029955764,0.0008940514,0.0000446995,0.00013674867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983018,0.000032698863,0.0007000995,0.0002808482,0.00035851973,0.0003260326],"domain_scores_gemma":[0.99844044,0.000038942588,0.00044778863,0.0002837016,0.0006443315,0.0001448075],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022493489,0.00022129346,0.00025548303,0.00013735003,0.0004890793,0.0011495822,0.00069368165,0.00011079004,0.0000032556788],"category_scores_gemma":[0.00012701505,0.00020625675,0.00008044274,0.00091739313,0.000042859723,0.0048537226,0.00012701136,0.0001673808,0.00001209033],"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.00008322436,0.00012587602,0.00011634976,0.0034098746,0.000054898675,0.0000032926002,0.01030444,0.042905733,0.00044581335,0.0050173523,0.0037390715,0.9337941],"study_design_scores_gemma":[0.000609955,0.00015156285,0.000056602177,0.000051473802,0.000007486164,0.000024934045,0.000111436995,0.96576786,0.00010984563,0.0002379466,0.032622542,0.00024833597],"about_ca_topic_score_codex":0.000034915975,"about_ca_topic_score_gemma":0.0000039005995,"teacher_disagreement_score":0.93354577,"about_ca_system_score_codex":0.000048338996,"about_ca_system_score_gemma":0.00009034965,"threshold_uncertainty_score":0.99988735},"labels":[],"label_agreement":null},{"id":"W3100153641","doi":"","title":"AutoSync: Learning to Synchronize for Data-Parallel Distributed Deep Learning","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Distributed learning; Distributed computing; Parallel computing; Computer architecture","score_opus":0.03669615027792841,"score_gpt":0.28148668118525455,"score_spread":0.24479053090732614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100153641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041453226,0.00015342978,0.9946345,0.0016586762,0.00017696661,0.00053434534,0.000008824207,0.0020568224,0.0003618939],"genre_scores_gemma":[0.8756098,0.000005856545,0.1225098,0.0010149201,0.00015727872,0.000085382584,0.0005217494,0.000016207168,0.00007899822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821,0.000095833035,0.0006528606,0.0003494494,0.00034025798,0.00035161458],"domain_scores_gemma":[0.9985784,0.000087710425,0.00043994217,0.0003180673,0.00037807823,0.00019778595],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046550395,0.00020091154,0.00026190424,0.00011787382,0.0005721771,0.0014954356,0.0012698313,0.00008852826,0.0000017431197],"category_scores_gemma":[0.0006559049,0.00019390415,0.000040793104,0.00067064626,0.00001659035,0.0038911188,0.00042376952,0.00027237504,0.000052423624],"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.0000142796935,0.00000593518,0.00010773854,0.0002778173,0.0000072643506,6.407308e-7,0.0024846848,0.92246634,0.000031762196,0.00061484985,0.0028147362,0.07117393],"study_design_scores_gemma":[0.00026493258,0.00013792845,0.00003354765,0.000064022264,0.000005192276,0.000011683565,0.00018938136,0.9241727,0.000049612394,0.000010710885,0.07483647,0.00022381982],"about_ca_topic_score_codex":0.000013873973,"about_ca_topic_score_gemma":3.143433e-7,"teacher_disagreement_score":0.87519526,"about_ca_system_score_codex":0.000058755508,"about_ca_system_score_gemma":0.000086643,"threshold_uncertainty_score":0.9995411},"labels":[],"label_agreement":null},{"id":"W3100210912","doi":"","title":"What went wrong and when? Instance-wise feature importance for time-series black-box models","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":27,"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":"Black box; Computer science; Series (stratigraphy); Feature (linguistics); Time series; Artificial intelligence; Machine learning","score_opus":0.03220889811413114,"score_gpt":0.24985837122618623,"score_spread":0.2176494731120551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100210912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018856855,0.0027121913,0.95820004,0.015883926,0.00097368174,0.0015416689,0.000014819298,0.00066060456,0.0011562282],"genre_scores_gemma":[0.98394245,0.00012449372,0.011567601,0.0031667382,0.00023635931,0.00017889537,0.000033531556,0.000023063047,0.0007268808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983821,0.000032721335,0.000584995,0.00029453565,0.0003604891,0.0003451909],"domain_scores_gemma":[0.9987018,0.00003998518,0.00043698447,0.00026013778,0.0003952058,0.00016587238],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0002508543,0.00022140772,0.000262987,0.000082524675,0.00032802098,0.0030073675,0.00050812965,0.000105429586,0.0000022597483],"category_scores_gemma":[0.00007487495,0.00019961127,0.000046516096,0.00034478362,0.00007844336,0.031017758,0.000119366465,0.00015591989,0.0000368999],"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.00045934916,0.000087272056,0.0004893107,0.008891777,0.00007911778,0.000025366846,0.24079253,0.24743673,0.0027608217,0.1369243,0.048941772,0.31311163],"study_design_scores_gemma":[0.00015452299,0.00010900242,0.0000074318073,0.00019345152,0.000005529763,0.000018117113,0.0034040597,0.97880137,0.0018268607,0.0016793271,0.01355661,0.0002437403],"about_ca_topic_score_codex":0.000007217142,"about_ca_topic_score_gemma":0.000004711445,"teacher_disagreement_score":0.96508557,"about_ca_system_score_codex":0.00006173403,"about_ca_system_score_gemma":0.00009636896,"threshold_uncertainty_score":0.9980276},"labels":[],"label_agreement":null},{"id":"W3100814986","doi":"","title":"Coded Sequential Matrix Multiplication For Straggler Mitigation","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Error Correcting Code 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 Toronto","funders":"","keywords":"Computer science; Matrix multiplication; Multiplication (music); Parallel computing; Matrix (chemical analysis); Arithmetic; Mathematics; Combinatorics; Chemistry","score_opus":0.03885571071306662,"score_gpt":0.3050603360880518,"score_spread":0.2662046253749851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100814986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114508,0.00004971875,0.98392063,0.0016057574,0.00040602993,0.0008638329,0.000008432507,0.0014528075,0.00024197553],"genre_scores_gemma":[0.96717584,9.3219626e-7,0.031807095,0.0005717534,0.00014840576,0.00019888955,0.000059509013,0.000009495312,0.000028062914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871343,0.000040570914,0.0005580508,0.00019819874,0.0002946934,0.0001950345],"domain_scores_gemma":[0.9987341,0.000043610016,0.0004922523,0.00019917688,0.00044424896,0.00008658367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247845,0.00013875579,0.00014733784,0.00009482358,0.00021501398,0.000810558,0.00046935532,0.0000901259,9.426055e-7],"category_scores_gemma":[0.00014818301,0.00013619878,0.000052132615,0.00036988917,0.000017769775,0.004770523,0.00005906245,0.00011602705,0.000028031573],"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.00028260436,0.00011246505,0.0011417881,0.00798642,0.00006536753,0.0000030914707,0.061189305,0.06541372,0.10108909,0.05675939,0.029169254,0.6767875],"study_design_scores_gemma":[0.0002789053,0.000070302514,0.00006707441,0.000053778735,0.0000049938894,0.000013746409,0.00016621621,0.9856082,0.009149325,0.000093599425,0.0043348884,0.00015897417],"about_ca_topic_score_codex":0.000018488072,"about_ca_topic_score_gemma":7.9789953e-7,"teacher_disagreement_score":0.9557251,"about_ca_system_score_codex":0.000064447406,"about_ca_system_score_gemma":0.0000758373,"threshold_uncertainty_score":0.7816229},"labels":[],"label_agreement":null},{"id":"W3101035550","doi":"","title":"Measuring Systematic Generalization in Neural Proof Generation with Transformers","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University","funders":"","keywords":"Mathematical proof; Computer science; Backward chaining; Generalization; Chaining; Artificial intelligence; Natural deduction; Automated theorem proving; Inference; Theoretical computer science; Programming language; Mathematics; Inference engine","score_opus":0.061497662312542785,"score_gpt":0.22974727517805896,"score_spread":0.16824961286551618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101035550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045892872,0.0002816627,0.9512012,0.00085784,0.00023316224,0.0010038144,9.115295e-7,0.00023517231,0.00029334647],"genre_scores_gemma":[0.99725777,0.0000015760579,0.0018983948,0.0005707069,0.00010198464,0.0001319473,0.000017573471,0.000009703942,0.000010337147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980448,0.00010281207,0.00083580293,0.00022311037,0.0005475521,0.00024591474],"domain_scores_gemma":[0.99917644,0.000011432727,0.0003494249,0.00016347131,0.00020530463,0.000093894334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031315588,0.00018101497,0.0002714008,0.00017071542,0.00014379984,0.00085708714,0.00033670317,0.000065550325,7.129203e-7],"category_scores_gemma":[0.000043700125,0.00014420963,0.00002867993,0.0006752679,0.000012665805,0.0067536565,0.00002611815,0.00013958274,0.000007125581],"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.000011708824,0.000010578148,0.0004056916,0.014908758,0.000007915366,0.0000043255077,0.0128885945,0.9523719,0.0010579166,0.0010193328,0.000015680636,0.01729763],"study_design_scores_gemma":[0.00039202502,0.000052285443,0.000029822802,0.00059397676,0.000006522026,0.000050019426,0.0003061461,0.9976006,0.00076518796,0.0000023814391,0.000024439858,0.0001765586],"about_ca_topic_score_codex":0.00003286376,"about_ca_topic_score_gemma":0.0000066408525,"teacher_disagreement_score":0.9513649,"about_ca_system_score_codex":0.00009194788,"about_ca_system_score_gemma":0.00008707737,"threshold_uncertainty_score":0.82649106},"labels":[],"label_agreement":null},{"id":"W3101144313","doi":"","title":"Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Regret; Markov decision process; Bounding overwatch; Inverse; Combinatorics; Adversarial system; Hessian matrix; Mathematics; Markov chain; Robustness (evolution); Computer science; Diagonal; Discrete mathematics; Markov process; Mathematical optimization; Artificial intelligence; Applied mathematics; Statistics","score_opus":0.05573393714338376,"score_gpt":0.3323731971055618,"score_spread":0.27663925996217803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101144313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056859635,0.00019028688,0.9401946,0.001385253,0.00018991818,0.000573693,0.000012766678,0.0002158414,0.0003780277],"genre_scores_gemma":[0.9991298,0.000002075646,0.0002960372,0.00021558584,0.00020093592,0.000021988082,0.000020768544,0.000011790994,0.0001010631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700737,0.00015083875,0.000714143,0.00027779175,0.0015568818,0.0002929909],"domain_scores_gemma":[0.9981296,0.00044521948,0.00040425966,0.0001226448,0.0006789387,0.00021933828],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006617566,0.00017722673,0.00028851916,0.00021703275,0.00046384468,0.0014177728,0.00025985762,0.000083055646,0.00002285542],"category_scores_gemma":[0.0016177526,0.00012422728,0.00003076376,0.0008631811,0.00013303725,0.004224517,0.000045579574,0.00037685287,0.00013124084],"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.00023770369,0.0000052685164,0.000032531687,0.00011235886,0.000005266985,0.000007305312,0.0086055305,0.87932646,0.000066278946,0.000023137958,0.00010333931,0.1114748],"study_design_scores_gemma":[0.00083877135,0.0003253031,0.000043834098,0.00006481864,0.0000078579915,0.000101698664,0.005735172,0.98721343,0.00002349407,0.000040485935,0.005439867,0.00016528381],"about_ca_topic_score_codex":0.00001947358,"about_ca_topic_score_gemma":0.0000018087183,"teacher_disagreement_score":0.9422701,"about_ca_system_score_codex":0.000044206805,"about_ca_system_score_gemma":0.000106966385,"threshold_uncertainty_score":0.9996188},"labels":[],"label_agreement":null},{"id":"W3101152497","doi":"","title":"On Efficiency in Hierarchical Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Machine learning","score_opus":0.02283141343365988,"score_gpt":0.25049009276771156,"score_spread":0.22765867933405168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101152497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060408525,0.000028153298,0.9810825,0.0013187159,0.00030837383,0.00033815383,1.3746444e-7,0.0004015244,0.010481587],"genre_scores_gemma":[0.99764395,0.0000024206233,0.0005362935,0.0016070133,0.000051666742,0.000023846304,0.000010342907,0.000007135075,0.00011734029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791044,0.0000875898,0.0007551874,0.00020598462,0.0006884954,0.00035230472],"domain_scores_gemma":[0.9991436,0.000079073405,0.0003502994,0.00019100345,0.00010010063,0.00013589906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033624176,0.00017798178,0.00019908238,0.00021952418,0.00019833709,0.00079868885,0.00064010354,0.00007611387,0.000004831317],"category_scores_gemma":[0.00032596895,0.00015954212,0.00003924947,0.00078741345,0.000029058658,0.0027212803,0.00014486998,0.00052977074,0.00022672514],"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.000009961518,0.00000478628,0.00017214062,0.00015348596,0.0000015557808,0.0000027164785,0.0035753844,0.9793579,0.000026569998,0.0106050065,0.00017792352,0.0059125833],"study_design_scores_gemma":[0.00042770375,0.00029702866,0.00011082216,0.0001100609,0.000001186209,0.000007322609,0.00015307739,0.99499357,0.00007002713,0.000013773307,0.0036414727,0.0001739602],"about_ca_topic_score_codex":0.000009821619,"about_ca_topic_score_gemma":8.9901725e-8,"teacher_disagreement_score":0.9916031,"about_ca_system_score_codex":0.00009271195,"about_ca_system_score_gemma":0.000084588995,"threshold_uncertainty_score":0.77017754},"labels":[],"label_agreement":null},{"id":"W3101430149","doi":"","title":"Optimal visual search based on a model of target detectability in natural images","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Visual Attention and Saliency Detection","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":"York University","funders":"","keywords":"Artificial intelligence; Computer science; Visual search; Observer (physics); Computer vision; Bayesian probability; Pattern recognition (psychology); Eye tracking; Psychophysics; Target acquisition; Ground truth; Human visual system model; Visual perception; Machine learning; Perception; Image (mathematics)","score_opus":0.02855786317148687,"score_gpt":0.28934353605750157,"score_spread":0.26078567288601473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101430149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3588964,0.000018766174,0.6398847,0.00046521483,0.00015560749,0.0002480354,0.0000037442835,0.00014965597,0.00017788057],"genre_scores_gemma":[0.9966479,2.5144894e-7,0.0029196914,0.00037798478,0.000018766705,0.000018515024,0.000006187745,0.000003935011,0.0000067655214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984931,0.000095226314,0.00054876803,0.00017713035,0.0004986674,0.0001871623],"domain_scores_gemma":[0.99936694,0.000026121701,0.00018866164,0.00012256185,0.00022461994,0.00007110667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036060822,0.00011885436,0.00017476083,0.00019393048,0.00008644116,0.00025642858,0.00029657345,0.00005502534,0.000001787093],"category_scores_gemma":[0.00008376754,0.00010331032,0.000051021147,0.0006473733,0.000032136682,0.0026417845,0.000052258023,0.00021696933,0.000011777626],"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.000053150397,0.000035725952,0.00034506986,0.00044086433,0.0000011852242,4.6653497e-7,0.001595725,0.98265576,0.0051522288,0.00010520178,0.000018331499,0.009596269],"study_design_scores_gemma":[0.00037117882,0.00018167438,0.0005313299,0.000046562443,8.8359e-7,0.0000020129291,0.00019080967,0.98671377,0.011842391,0.00000561151,0.000010805659,0.00010295798],"about_ca_topic_score_codex":0.000018216015,"about_ca_topic_score_gemma":3.5034495e-7,"teacher_disagreement_score":0.6377515,"about_ca_system_score_codex":0.000053081345,"about_ca_system_score_gemma":0.00010478516,"threshold_uncertainty_score":0.42128724},"labels":[],"label_agreement":null},{"id":"W3101581426","doi":"","title":"Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernel","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Initialization; Artificial neural network; Kernel (algebra); Chaotic; Artificial intelligence; Tangent; Computer science; Linearization; Deep learning; Nonlinear system; Machine learning; Geometry; Algorithm; Mathematics; Physics; Discrete mathematics","score_opus":0.021154375713718625,"score_gpt":0.263866539708851,"score_spread":0.24271216399513237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101581426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98265254,0.0003301722,0.014917387,0.0011214822,0.00016799581,0.00055333914,8.83238e-7,0.00010276445,0.00015341114],"genre_scores_gemma":[0.9997357,0.000003618812,0.000034249846,0.00009086803,0.000075976975,0.000027988335,0.00000377256,0.0000058933642,0.0000218964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844176,0.0002528685,0.0005427082,0.00017068077,0.00043022973,0.00016175966],"domain_scores_gemma":[0.9987576,0.00012119505,0.00063708954,0.00021815249,0.00019452906,0.00007143486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032345921,0.00013112923,0.00022216933,0.00005326177,0.0003740665,0.00026746572,0.00055943074,0.00005024881,0.0000016161462],"category_scores_gemma":[0.00009826265,0.00007748987,0.00004789261,0.0007955338,0.00009571833,0.0012831371,0.00021890324,0.00030839673,0.0000044196304],"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.00037609987,0.00015239633,0.06254462,0.000388393,0.000050188944,9.887814e-7,0.034751106,0.86383015,0.00029210464,0.0015686563,0.00022066473,0.035824627],"study_design_scores_gemma":[0.0011631415,0.000274061,0.011366379,0.00001935436,0.00001832289,0.0000110054925,0.0029406594,0.9838576,0.00001845254,0.000009546917,0.00023692119,0.000084591666],"about_ca_topic_score_codex":0.00003970473,"about_ca_topic_score_gemma":0.0000020931027,"teacher_disagreement_score":0.120027415,"about_ca_system_score_codex":0.00002078527,"about_ca_system_score_gemma":0.00003366771,"threshold_uncertainty_score":0.31599453},"labels":[],"label_agreement":null},{"id":"W3101687646","doi":"","title":"Succinct and Robust Multi-Agent Communication With Temporal Message Control","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Mobile Agent-Based Network Management","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 Toronto; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.026145195417562654,"score_gpt":0.2185402984517623,"score_spread":0.19239510303419963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101687646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005631437,0.0007292185,0.9893705,0.0024928912,0.00009836758,0.00085605244,0.0000032351968,0.00037522538,0.00044302954],"genre_scores_gemma":[0.98889047,0.000014233213,0.008864771,0.0020291202,0.00003307935,0.00010494514,0.000024779283,0.000008349067,0.00003023651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986357,0.00012199374,0.00048107273,0.00019515648,0.00035288066,0.00021316679],"domain_scores_gemma":[0.99888265,0.00003363563,0.0004407331,0.0003474229,0.00015706563,0.00013852045],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032666622,0.00017390041,0.00020104248,0.00007714522,0.00027240993,0.0010585295,0.0005309435,0.000043473152,0.0000022681027],"category_scores_gemma":[0.000015707952,0.00013780844,0.000021866428,0.00037093845,0.00004011351,0.0036932763,0.0001477939,0.00014680339,0.000022198676],"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.00016529224,0.000094882394,0.011582451,0.0030016028,0.00011202205,0.000025448428,0.01329368,0.61608946,0.00006455192,0.006162162,0.007784478,0.341624],"study_design_scores_gemma":[0.0011664216,0.00009253244,0.0007655355,0.00009489722,0.0000114895565,0.000014157658,0.00030908393,0.988597,0.000016645772,0.0000019209635,0.008762697,0.0001676584],"about_ca_topic_score_codex":0.0000604103,"about_ca_topic_score_gemma":0.00000631952,"teacher_disagreement_score":0.983259,"about_ca_system_score_codex":0.000059355163,"about_ca_system_score_gemma":0.000051462554,"threshold_uncertainty_score":0.9999785},"labels":[],"label_agreement":null},{"id":"W3102090196","doi":"","title":"Discovering Symbolic Models from Deep Learning with Inductive Biases","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Inductive bias; Computer science; Focus (optics); Artificial neural network; Artificial intelligence; Symbolic regression; The Symbolic; Deep neural networks; Deep learning; Theoretical computer science; Graph; Machine learning; Multi-task learning","score_opus":0.03918932432090418,"score_gpt":0.24442994547018326,"score_spread":0.20524062114927907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102090196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11256766,0.000073117044,0.88526565,0.0005907588,0.000058466598,0.00016455924,0.0000048047186,0.00025056818,0.0010244093],"genre_scores_gemma":[0.99604136,0.0000016623873,0.0033553212,0.00038086314,0.00011327388,0.00004535303,0.00004950071,0.000006626733,0.0000060340108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991028,0.000027402406,0.0002744548,0.00016840531,0.00029625007,0.00013069349],"domain_scores_gemma":[0.99929315,0.00006454482,0.00025881286,0.00011774169,0.00017822938,0.00008752413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042870222,0.00011799257,0.0001311278,0.000051465922,0.00024151985,0.0009308103,0.0003019307,0.000026948126,9.905133e-7],"category_scores_gemma":[0.0000140015945,0.00009870694,0.0000234699,0.00049123133,0.00001881988,0.005543018,0.00008375475,0.00015468766,0.000030191704],"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.0000054392217,0.0000063275147,0.00009813199,0.00004047876,0.0000082824,4.273319e-7,0.008275346,0.9347392,0.00009302879,0.017174082,0.000021934848,0.03953734],"study_design_scores_gemma":[0.00014619579,0.000032510983,0.00031582464,0.00005268474,0.000003923747,0.0000040287878,0.0006910151,0.99699354,0.00007368124,0.00077419746,0.00077694596,0.00013542919],"about_ca_topic_score_codex":0.00012518057,"about_ca_topic_score_gemma":0.0000013209419,"teacher_disagreement_score":0.8834737,"about_ca_system_score_codex":0.000024994351,"about_ca_system_score_gemma":0.000057500944,"threshold_uncertainty_score":0.8975825},"labels":[],"label_agreement":null},{"id":"W3102197198","doi":"","title":"Learning Linear Programs from Optimal Decisions","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Computer science; Linear programming; Mathematical optimization; Backpropagation; Point (geometry); Artificial intelligence; Homogeneous; Machine learning; Artificial neural network; Algorithm; Mathematics","score_opus":0.03041559653165141,"score_gpt":0.26340838422031,"score_spread":0.23299278768865858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102197198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06037666,0.00016749815,0.93463403,0.001923729,0.00047594684,0.00022398152,0.0000023730483,0.0011972204,0.000998582],"genre_scores_gemma":[0.97173893,0.0000029370058,0.027185233,0.0005669032,0.00032453405,0.000022339756,0.00006225951,0.000008773639,0.00008808631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854094,0.00008214915,0.0004824663,0.00020874247,0.00044313978,0.00024253593],"domain_scores_gemma":[0.9991072,0.000061907995,0.00031167493,0.00016451467,0.00017714071,0.00017758187],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00018892084,0.00015490399,0.00018478381,0.00006801968,0.00035425788,0.0012959546,0.0005836823,0.000070585316,0.0000047739586],"category_scores_gemma":[0.00025054297,0.00012965227,0.000052380496,0.0005118565,0.000020177318,0.003231478,0.00015373748,0.00041131477,0.00025681077],"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.0000082367405,0.000012636337,0.0007778322,0.00006576681,0.000007902135,0.0000043713726,0.009331874,0.21961308,0.00006033784,0.00032523673,0.00031920584,0.76947355],"study_design_scores_gemma":[0.00022317257,0.00012376718,0.00012299899,0.00007777399,0.000003190954,0.000012500389,0.00045098978,0.9590727,0.000040660532,0.000007876437,0.039711848,0.00015251453],"about_ca_topic_score_codex":0.00007132274,"about_ca_topic_score_gemma":1.9287316e-7,"teacher_disagreement_score":0.9113623,"about_ca_system_score_codex":0.000017768123,"about_ca_system_score_gemma":0.00006037614,"threshold_uncertainty_score":0.9997408},"labels":[],"label_agreement":null},{"id":"W3102998533","doi":"","title":"Information Maximization for Few-Shot Learning","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Shot (pellet); Maximization; Artificial intelligence; Machine learning; Mathematics; Mathematical optimization","score_opus":0.040735737377868744,"score_gpt":0.2550705761810338,"score_spread":0.21433483880316506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102998533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008406606,0.000045330675,0.99160355,0.0018818788,0.00033108928,0.00051133224,0.0000036099602,0.0007196766,0.0040628435],"genre_scores_gemma":[0.98334354,0.000004397125,0.012833209,0.0033196034,0.000103518054,0.00009778428,0.0001720094,0.000009730975,0.00011620696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984164,0.000053869822,0.00072318065,0.00012456694,0.00041699922,0.0002649517],"domain_scores_gemma":[0.99853224,0.000049461705,0.00065191573,0.00012905056,0.0004933123,0.00014400075],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00035765048,0.00016806464,0.00017998787,0.00017116337,0.000471881,0.0019332719,0.00040409862,0.00009190116,0.0000042445845],"category_scores_gemma":[0.0004354772,0.00016369837,0.000057849047,0.000567029,0.00001903815,0.014674607,0.000066053624,0.00020291614,0.00013008538],"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.000032244636,0.0000058513556,0.00012280706,0.0006401058,0.0000069300295,1.8095977e-7,0.020063696,0.7893195,0.00013876887,0.015211821,0.0018045958,0.1726535],"study_design_scores_gemma":[0.0005008761,0.000074212025,0.000058566282,0.000033416156,0.0000041677517,0.000008020353,0.0012108791,0.9008181,0.00007834216,0.000039155115,0.096996084,0.00017816231],"about_ca_topic_score_codex":0.000003921471,"about_ca_topic_score_gemma":1.2437937e-7,"teacher_disagreement_score":0.9825029,"about_ca_system_score_codex":0.000052469943,"about_ca_system_score_gemma":0.00011531505,"threshold_uncertainty_score":0.99910665},"labels":[],"label_agreement":null},{"id":"W3103290077","doi":"","title":"Learning Agent Representations for Ice Hockey","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","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 Waterloo; Simon Fraser University","funders":"","keywords":"Ice hockey; Computer science; Artificial intelligence; Physical medicine and rehabilitation","score_opus":0.04542303430578692,"score_gpt":0.2864625706532663,"score_spread":0.24103953634747938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103290077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090004946,0.000049499373,0.9928561,0.0020679545,0.00046018092,0.00049734086,0.0000013139284,0.00056717463,0.0026004054],"genre_scores_gemma":[0.98941684,0.0000035077423,0.008622762,0.0012061528,0.00016025639,0.00009783705,0.00004608873,0.000010254442,0.00043631785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985535,0.000052195825,0.0005785152,0.00017934728,0.00038639503,0.00025004437],"domain_scores_gemma":[0.99879986,0.000082473416,0.00048292562,0.0001843993,0.00032868105,0.000121664234],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022623687,0.00013451294,0.00015399448,0.0000911451,0.00042078592,0.0013014158,0.0005138456,0.000056346482,0.00000206016],"category_scores_gemma":[0.00037806583,0.00012885277,0.00005612269,0.000446806,0.000019188898,0.0044907406,0.00010881945,0.00018761752,0.000101576],"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.000004873108,0.000002391796,0.00018468,0.0003344762,0.0000063645393,4.3048652e-7,0.0065198215,0.977268,0.0000903442,0.0022463019,0.0024083157,0.010934005],"study_design_scores_gemma":[0.00029335727,0.00011839075,0.00007301492,0.000036613565,0.0000057116986,0.000008609643,0.0008192462,0.95224786,0.00016213898,0.000008578631,0.04608553,0.00014092562],"about_ca_topic_score_codex":0.000010712584,"about_ca_topic_score_gemma":9.941041e-8,"teacher_disagreement_score":0.98851675,"about_ca_system_score_codex":0.000044485754,"about_ca_system_score_gemma":0.00007558681,"threshold_uncertainty_score":0.99973536},"labels":[],"label_agreement":null},{"id":"W3103352262","doi":"","title":"DiffGCN: Graph Convolutional Networks via Differential Operators and Algebraic Multigrid Pooling","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multigrid method; Pooling; Theoretical computer science; Laplace operator; Convolutional neural network; Graph; Kernel (algebra); Algorithm; Partial differential equation; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.009552245456797056,"score_gpt":0.18631742082496275,"score_spread":0.1767651753681657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103352262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3834738,0.0014031087,0.6139209,0.00011311292,0.00037740573,0.0001260114,0.000009478208,0.0004898855,0.000086249165],"genre_scores_gemma":[0.9992608,0.000029239702,0.00007026068,0.00024353979,0.00027660574,0.00001633798,0.000082762905,0.000015573603,0.000004877258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989984,0.000019101182,0.00046205174,0.000112671,0.00019742384,0.00021033747],"domain_scores_gemma":[0.99961066,0.000014458073,0.00008305591,0.00006336905,0.000088930865,0.00013949836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059713107,0.00017735045,0.00021865225,0.00009527766,0.0001962335,0.0003741517,0.00009393996,0.00009009192,0.0000074294994],"category_scores_gemma":[0.000014350854,0.00015946808,0.000051535513,0.00024670636,0.000028092241,0.001043782,0.000022990132,0.00019828604,0.000012016681],"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.000006049477,0.0000029283149,0.00050763926,0.00035461696,0.000029715467,5.7943544e-7,0.00078246504,0.9896924,0.00037773402,0.000027771965,0.00023789711,0.007980199],"study_design_scores_gemma":[0.0002728333,0.000011788653,0.00028326063,0.00005962885,0.000025694426,0.000010579781,0.00015754452,0.9987586,0.000052189935,0.0000034117434,0.00018151167,0.00018291544],"about_ca_topic_score_codex":0.000014903196,"about_ca_topic_score_gemma":7.510393e-7,"teacher_disagreement_score":0.615787,"about_ca_system_score_codex":0.000021362337,"about_ca_system_score_gemma":0.000010384814,"threshold_uncertainty_score":0.6502919},"labels":[],"label_agreement":null},{"id":"W3103966376","doi":"","title":"Value-driven Hindsight Modelling","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hindsight bias; Leverage (statistics); Computer science; Reinforcement learning; Machine learning; Artificial intelligence; Bellman equation; Exploit; Function (biology); Representation (politics); Mathematical optimization; Mathematics","score_opus":0.03967133682234385,"score_gpt":0.2352821196128032,"score_spread":0.19561078279045935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103966376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072096667,0.000074031035,0.9920077,0.001341783,0.0004454891,0.0002241824,6.6292387e-7,0.00061617617,0.00456905],"genre_scores_gemma":[0.98457634,0.000003455125,0.013544164,0.0016102116,0.00013802866,0.000014070611,0.000012358638,0.0000090310195,0.00009235185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983612,0.000046206456,0.0006012482,0.00017148587,0.0005517049,0.00026817835],"domain_scores_gemma":[0.9989947,0.000027593414,0.00040960417,0.00022713275,0.00019588454,0.00014507178],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00015023112,0.00016139516,0.0001779936,0.000095895775,0.00024356683,0.0013797302,0.0007470396,0.000073620286,0.0000022734198],"category_scores_gemma":[0.000041722484,0.0001450934,0.000045979155,0.000470494,0.00002054869,0.006555713,0.00013998958,0.00022488677,0.0002334532],"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.0000020499963,0.0000016745657,0.000046412602,0.00019224404,0.0000039309434,0.0000010447297,0.0035029429,0.9871282,0.00003445769,0.0057809185,0.00059280265,0.0027133161],"study_design_scores_gemma":[0.00019085154,0.00004973335,0.000006788403,0.00005670924,0.0000038133949,0.000012550819,0.00011789497,0.98568624,0.00011192113,0.0000134669335,0.013580696,0.00016931626],"about_ca_topic_score_codex":0.000010171196,"about_ca_topic_score_gemma":2.319524e-8,"teacher_disagreement_score":0.98385537,"about_ca_system_score_codex":0.00004749471,"about_ca_system_score_gemma":0.00007753161,"threshold_uncertainty_score":0.9996569},"labels":[],"label_agreement":null},{"id":"W3104306602","doi":"","title":"Equivariant Networks for Hierarchical Structures","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Industrial Technology and Control Systems","field":"Engineering","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":"McGill University; University of British Columbia","funders":"","keywords":"Equivariant map; Computer science; Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.022923666114282537,"score_gpt":0.2243336720813768,"score_spread":0.20141000596709427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104306602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008905108,0.00097499334,0.98036176,0.001221198,0.0024321126,0.001284737,0.00003297598,0.002195393,0.0025917038],"genre_scores_gemma":[0.99865913,0.0000019995693,0.00012825365,0.0003115293,0.00072048616,0.000113892274,0.000038179274,0.000014331695,0.000012174795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990496,0.000017480406,0.00047766155,0.00008219258,0.00012173436,0.0002513078],"domain_scores_gemma":[0.999631,0.00003077185,0.00010114048,0.00008557924,0.000073407544,0.000078105666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011729464,0.00014114376,0.00021606723,0.0000558346,0.000142719,0.0002207468,0.0001764461,0.0002522305,0.0000033215156],"category_scores_gemma":[0.00006424684,0.00012222838,0.00004593295,0.00018056591,0.000024628605,0.00076061476,0.000014479165,0.00027070576,0.000010561501],"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.000092905175,0.0000026048376,0.000042150386,0.00088449125,0.000042668664,0.0000013725315,0.0008533584,0.8560349,0.00045248182,0.0146844275,0.008242429,0.118666224],"study_design_scores_gemma":[0.00052048545,0.000048674126,0.000016467437,0.000030502746,0.000009543194,0.000014982948,0.00016353262,0.96080834,0.00009488682,0.00007780953,0.03807838,0.00013638123],"about_ca_topic_score_codex":0.0000038146397,"about_ca_topic_score_gemma":2.3451273e-7,"teacher_disagreement_score":0.989754,"about_ca_system_score_codex":0.000028097873,"about_ca_system_score_gemma":0.000020011938,"threshold_uncertainty_score":0.49843284},"labels":[],"label_agreement":null},{"id":"W3104577421","doi":"","title":"On Numerosity of Deep Neural Networks","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Cognitive and developmental aspects of mathematical skills","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Numerosity adaptation effect; Artificial intelligence; Deep learning; Computer science; Number sense; Artificial neural network; Convolutional neural network; Task (project management); Object (grammar); Set (abstract data type); Cognition; Deep neural networks; Machine learning; Pattern recognition (psychology); Cognitive science; Psychology; Neuroscience","score_opus":0.034676967205877984,"score_gpt":0.2766262649239015,"score_spread":0.24194929771802354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104577421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5843833,0.0002584424,0.37650904,0.0022530295,0.0007455126,0.0018416907,0.000030260286,0.0007926917,0.03318602],"genre_scores_gemma":[0.9982881,8.907567e-7,0.00045212355,0.0011228927,0.00007155076,0.000017192115,0.000014894584,0.000011310465,0.000021072377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985441,0.000039228984,0.00070726953,0.0001140538,0.00039520112,0.00020017626],"domain_scores_gemma":[0.99889785,0.00024138452,0.0004292884,0.00009881682,0.00021176532,0.00012088317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016145616,0.00017078214,0.00031513956,0.00005107925,0.00011137131,0.00013168788,0.00016586811,0.00007320918,0.000049735037],"category_scores_gemma":[0.00054115936,0.00013430101,0.00006678749,0.00026158677,0.000041703097,0.0008992529,0.00005628908,0.00017051755,0.00005052945],"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.0010388967,0.00077705906,0.0016620625,0.017906504,0.00021238005,0.000025507103,0.024386354,0.032302648,0.00054639345,0.15102936,0.013019832,0.757093],"study_design_scores_gemma":[0.0005813935,0.00019157813,0.00023936831,0.00022243866,0.000021906848,0.000015979898,0.00057043805,0.9929449,0.00068550115,0.0041233064,0.0001487784,0.00025438788],"about_ca_topic_score_codex":0.000003823479,"about_ca_topic_score_gemma":4.28278e-7,"teacher_disagreement_score":0.9606423,"about_ca_system_score_codex":0.000027063741,"about_ca_system_score_gemma":0.000012539193,"threshold_uncertainty_score":0.5476636},"labels":[],"label_agreement":null},{"id":"W3104591796","doi":"","title":"Principal Neighbourhood Aggregation for Graph Nets","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Exploit; Theoretical computer science; Graph; Neighbourhood (mathematics); News aggregator; Graph isomorphism; Data mining; Artificial intelligence; Machine learning; Mathematics","score_opus":0.026325718818596754,"score_gpt":0.25203489105682375,"score_spread":0.225709172238227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104591796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048575113,0.00024796338,0.98959696,0.0026037877,0.00070729014,0.0007620985,0.0000061295314,0.00066360034,0.0005546545],"genre_scores_gemma":[0.9886283,0.000004654992,0.008236647,0.0027401012,0.00020544288,0.00012430342,0.0000315886,0.00001115079,0.000017798684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984388,0.000034677083,0.00060451217,0.00023971335,0.00034974745,0.00033257212],"domain_scores_gemma":[0.99875563,0.000053583673,0.0005080537,0.00021619389,0.00029704225,0.00016948197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014024197,0.00019191254,0.00020170394,0.00011219492,0.00029101892,0.0008025306,0.00059154717,0.000088029585,0.000001191182],"category_scores_gemma":[0.00009568107,0.00017287323,0.00007860142,0.0007520104,0.000027331416,0.0073684184,0.000086030406,0.00016011902,0.0000219962],"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.000084569954,0.000026791946,0.00050570624,0.001177536,0.00002283234,0.0000035229668,0.0060449075,0.22787754,0.0005124125,0.05465707,0.0038996506,0.70518744],"study_design_scores_gemma":[0.00048895704,0.00012662256,0.00021776148,0.00006059597,0.000004506861,0.00002269547,0.000076552904,0.98542744,0.00033761087,0.00054920145,0.012471456,0.00021661725],"about_ca_topic_score_codex":0.0000038973,"about_ca_topic_score_gemma":4.998125e-7,"teacher_disagreement_score":0.9837708,"about_ca_system_score_codex":0.000029013014,"about_ca_system_score_gemma":0.00005182268,"threshold_uncertainty_score":0.7738821},"labels":[],"label_agreement":null},{"id":"W3104616748","doi":"","title":"Unsupervised Text Generation by Learning from Search","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Paraphrase; Computer science; Artificial intelligence; Generative grammar; Bootstrapping (finance); Unsupervised learning; Machine learning; Baseline (sea); Beam search; Natural language processing; Simulated annealing; Search algorithm; Algorithm; Mathematics","score_opus":0.06081246761507966,"score_gpt":0.25057610381942186,"score_spread":0.1897636362043422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104616748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08791786,0.00027673633,0.9086558,0.0018249615,0.00025490703,0.00016706176,0.0000026750213,0.00037492052,0.0005250657],"genre_scores_gemma":[0.99610454,0.0000033762267,0.0024148948,0.0010788809,0.00023882094,0.000014274872,0.0000876715,0.000005956634,0.000051610852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987038,0.000082040555,0.00042655092,0.00018903732,0.00041372603,0.0001848669],"domain_scores_gemma":[0.9994143,0.000021054271,0.00014641027,0.00014813858,0.00016334916,0.0001067067],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016464476,0.000111858666,0.0001281226,0.000050316103,0.00024187472,0.0012880667,0.0004105355,0.00006481241,0.000006648768],"category_scores_gemma":[0.00004513454,0.00010463432,0.000024286339,0.00024658066,0.000010432305,0.0045724595,0.000087600994,0.00021128824,0.00014649532],"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.000008647871,0.000011671233,0.00083778065,0.0003200677,0.0000122696965,0.0000018186855,0.028766144,0.5347354,0.030373864,0.0012579929,0.0037203203,0.39995402],"study_design_scores_gemma":[0.00019974062,0.000025405556,0.000028096196,0.000017521434,0.0000016489789,0.0000026443793,0.00034757092,0.99223274,0.0014608607,0.0000041892326,0.0055635353,0.00011605467],"about_ca_topic_score_codex":0.0001146731,"about_ca_topic_score_gemma":3.111693e-7,"teacher_disagreement_score":0.9081867,"about_ca_system_score_codex":0.000036824404,"about_ca_system_score_gemma":0.000061243074,"threshold_uncertainty_score":0.9997487},"labels":[],"label_agreement":null},{"id":"W3104722529","doi":"","title":"Untangling tradeoffs between recurrence and self-attention in artificial neural networks","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","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":"Université de Montréal","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence","score_opus":0.030068948169692702,"score_gpt":0.2506744529650285,"score_spread":0.2206055047953358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104722529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42814294,0.00054323836,0.56328577,0.005769031,0.0005298267,0.00082882313,0.0000058516307,0.00067997404,0.00021456584],"genre_scores_gemma":[0.99856395,0.000011528933,0.0006045639,0.00045589352,0.00029631445,0.000039771574,0.000020331485,0.0000058779783,0.0000017810196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985648,0.000060271002,0.0006390207,0.00023722634,0.00022865273,0.00027007045],"domain_scores_gemma":[0.9993161,0.00004913673,0.00029375718,0.00013505845,0.0000758351,0.00013008977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020452614,0.00015424106,0.00019492961,0.00008738098,0.0002205873,0.00090343726,0.0003418039,0.00008166053,4.4053058e-7],"category_scores_gemma":[0.00001690303,0.00014467786,0.000029483714,0.00082393497,0.00002418313,0.0034438737,0.00008607648,0.0002732518,0.000006858542],"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.000017670523,0.000051407453,0.021178426,0.0006342312,0.000012303597,0.0000067049687,0.005571794,0.15711182,0.00016253805,0.010061623,0.0005164473,0.80467504],"study_design_scores_gemma":[0.00014812972,0.000040131934,0.0038770505,0.000056424826,0.0000047799194,0.000012324251,0.00012443295,0.99487925,0.000020477048,0.000059910373,0.0006200691,0.0001570472],"about_ca_topic_score_codex":0.000014377484,"about_ca_topic_score_gemma":0.0000017238657,"teacher_disagreement_score":0.8377674,"about_ca_system_score_codex":0.000028143219,"about_ca_system_score_gemma":0.000022841294,"threshold_uncertainty_score":0.8711866},"labels":[],"label_agreement":null},{"id":"W3104800136","doi":"","title":"ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Metaheuristic Optimization Algorithms Research","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 British Columbia","funders":"","keywords":"Logarithm; Heuristic; Computer science; Algorithm; Mathematical optimization; Work (physics); Mathematics; Engineering","score_opus":0.03633757259381575,"score_gpt":0.28543745454321406,"score_spread":0.2490998819493983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104800136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027832543,0.00012133898,0.9937777,0.0009308565,0.00044600727,0.00060656655,0.00005280654,0.0005765807,0.00070488773],"genre_scores_gemma":[0.8087251,0.00001961573,0.1863538,0.0031111904,0.00050650275,0.00017557401,0.001015757,0.000034076846,0.000058382164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971442,0.00018996597,0.00096782704,0.00035557238,0.0009794052,0.00036298553],"domain_scores_gemma":[0.9978679,0.000060716768,0.0005539993,0.0003729447,0.00077168545,0.0003727486],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003349988,0.00024828207,0.00029792747,0.00019774426,0.0003073609,0.002864814,0.00088150206,0.000121170575,0.000040803723],"category_scores_gemma":[0.000209102,0.00022666898,0.00004703032,0.0008449279,0.00004905582,0.011303861,0.00014346163,0.00026885915,0.00024920588],"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.00004180873,0.00006846855,0.00006593598,0.00031599132,0.000030480505,0.0000096932135,0.01570022,0.17141527,0.0002849159,0.0017669748,0.0014102239,0.80889],"study_design_scores_gemma":[0.0005918538,0.00016518054,0.00011335359,0.00003192029,0.0000062301456,0.000013405507,0.0004715725,0.9937882,0.0006492716,0.000021926948,0.0038921633,0.00025495925],"about_ca_topic_score_codex":0.00008324276,"about_ca_topic_score_gemma":2.462112e-7,"teacher_disagreement_score":0.8223729,"about_ca_system_score_codex":0.000055238765,"about_ca_system_score_gemma":0.00020450953,"threshold_uncertainty_score":0.9981703},"labels":[],"label_agreement":null},{"id":"W3105009590","doi":"","title":"Multimodal Graph Networks for Compositional Generalization in Visual Question Answering","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":27,"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; Question answering; Generalization; Graph; Artificial intelligence; Graph theory; Natural language processing; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.015426769876601897,"score_gpt":0.2875687495257047,"score_spread":0.2721419796491028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105009590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054058544,0.000060338916,0.9432809,0.0014032326,0.00019562872,0.0005851852,0.0000042672505,0.0003488459,0.00006308937],"genre_scores_gemma":[0.9822419,0.0000017088524,0.016357496,0.0007849505,0.0001658184,0.0002305188,0.0002061108,0.000009052368,0.0000024020358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871904,0.000071195514,0.00055274664,0.00020760475,0.00023781505,0.0002116232],"domain_scores_gemma":[0.99923134,0.00004981189,0.00030127118,0.0001076509,0.00022016098,0.000089780864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002436444,0.00014168373,0.0001544991,0.00015643722,0.00022893542,0.0005634334,0.00030312221,0.00008312639,8.639394e-7],"category_scores_gemma":[0.000059579896,0.00014678111,0.000039149058,0.0006092894,0.000018191613,0.0029141358,0.000051623374,0.00016238673,0.0000088308125],"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.000014343778,0.00001568653,0.0025598002,0.00015851749,0.0000024817934,2.080637e-7,0.00093621365,0.968623,0.0004968447,0.007415575,0.00006324927,0.019714091],"study_design_scores_gemma":[0.00047866788,0.000051754687,0.008364079,0.000054960594,0.0000024843964,0.000007569316,0.00003443695,0.9903178,0.00006903364,0.000042671127,0.00042075597,0.00015574957],"about_ca_topic_score_codex":0.0001365879,"about_ca_topic_score_gemma":0.0000024475012,"teacher_disagreement_score":0.9281834,"about_ca_system_score_codex":0.000060685918,"about_ca_system_score_gemma":0.00004190025,"threshold_uncertainty_score":0.598556},"labels":[],"label_agreement":null},{"id":"W3105027165","doi":"","title":"Regularized linear autoencoders recover the principal components, eventually","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regularization (linguistics); Feature learning; Computer science; Simple (philosophy); Representation (politics); Principal component analysis; Gradient descent; Mathematical optimization; Mathematics; Artificial intelligence; Artificial neural network; Algorithm; Applied mathematics","score_opus":0.036751842957258835,"score_gpt":0.24326561935089744,"score_spread":0.2065137763936386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105027165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014756527,0.00014147646,0.9571496,0.024217146,0.00064909883,0.00084433507,0.000006744378,0.000675436,0.0015596203],"genre_scores_gemma":[0.99120224,0.000006335241,0.0037546372,0.0045465436,0.00024114417,0.000076668824,0.000027392503,0.000007778746,0.00013724802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986195,0.00006604307,0.0005218366,0.00017591019,0.000389336,0.00022737458],"domain_scores_gemma":[0.9990398,0.000045079025,0.00035637757,0.00029471432,0.00015134728,0.00011265239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020831755,0.00014115969,0.00014985849,0.000034033117,0.0004098012,0.0007425165,0.0008516099,0.000054086955,0.00000319592],"category_scores_gemma":[0.000034997993,0.0000955298,0.000057342357,0.00051431544,0.000038471302,0.0026009004,0.00015453486,0.00021160218,0.00010669312],"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.00011128775,0.000109359826,0.00044144865,0.0010552721,0.00008046443,0.000008080056,0.020848075,0.6489385,0.0032894295,0.08619871,0.04680034,0.19211908],"study_design_scores_gemma":[0.00021557155,0.000026506026,0.00017976701,0.000029038742,0.000003947135,0.000016938426,0.00008722395,0.9126045,0.000049685375,0.000050660015,0.08662254,0.00011363408],"about_ca_topic_score_codex":0.000016906639,"about_ca_topic_score_gemma":5.5284437e-7,"teacher_disagreement_score":0.97644573,"about_ca_system_score_codex":0.000028463255,"about_ca_system_score_gemma":0.00006410573,"threshold_uncertainty_score":0.71601033},"labels":[],"label_agreement":null},{"id":"W3105079502","doi":"","title":"Multi-task Additive Models for Robust Estimation and Automatic Structure Discovery","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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 Ottawa","funders":"","keywords":"Computer science; Task (project management); Artificial intelligence; Estimation; Data mining; Pattern recognition (psychology); Engineering","score_opus":0.023526670654839713,"score_gpt":0.250854597206479,"score_spread":0.2273279265516393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105079502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006518299,0.00012796313,0.9916275,0.0006944636,0.00021855427,0.00040314413,0.000039646075,0.0003263925,0.000044008746],"genre_scores_gemma":[0.90211546,9.3213714e-7,0.09719712,0.00046061547,0.0000783151,0.00004022113,0.0000729005,0.0000069297166,0.000027496706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.000037869697,0.00037149107,0.00017506513,0.00021729054,0.00016745237],"domain_scores_gemma":[0.9992925,0.000051980154,0.00033004882,0.000108018816,0.0001348343,0.00008260893],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00010795645,0.0001470363,0.00017343315,0.00007049788,0.00025850654,0.0014463874,0.00022976003,0.000060032773,5.386661e-7],"category_scores_gemma":[0.00011046056,0.000120230834,0.000028025634,0.0002140827,0.000021491776,0.008554259,0.000061210136,0.00013580131,0.0000029425137],"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.000003699852,0.0000040310715,0.000013477578,0.00071065576,0.0000055690584,3.5637711e-7,0.0061130673,0.7809297,0.0000397527,0.0006725962,0.00022726993,0.21127985],"study_design_scores_gemma":[0.00039506637,0.000057353052,0.00011163771,0.000109356115,0.000006344716,0.000019091103,0.00025024472,0.9985508,0.000033388227,0.00011364471,0.00020627402,0.00014681289],"about_ca_topic_score_codex":0.000012080498,"about_ca_topic_score_gemma":2.5143842e-7,"teacher_disagreement_score":0.89559716,"about_ca_system_score_codex":0.000022324099,"about_ca_system_score_gemma":0.000051089453,"threshold_uncertainty_score":0.9995902},"labels":[],"label_agreement":null},{"id":"W3105702366","doi":"","title":"Variational Policy Gradient Method for Reinforcement Learning with General Utilities","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical optimization; Reinforcement learning; Convexity; Markov decision process; Q-learning; Mathematics; Gradient descent; Gradient method; Computer science; Applied mathematics; Convergence (economics); Markov process; Artificial neural network; Artificial intelligence; Finance","score_opus":0.03067472875020712,"score_gpt":0.28240915646595416,"score_spread":0.25173442771574706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105702366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018417867,0.000027589014,0.9940392,0.002340293,0.00021501824,0.0005975977,0.0000017852935,0.00038875462,0.0022055805],"genre_scores_gemma":[0.8497978,0.0000030154674,0.14564249,0.0027433482,0.0004729659,0.0002205666,0.00011620056,0.000019748231,0.0009838685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802727,0.00007504048,0.0006796217,0.00021598744,0.00062688213,0.00037518743],"domain_scores_gemma":[0.9985284,0.000087405315,0.00060967536,0.00017749936,0.00044580712,0.00015117532],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003908071,0.00021468659,0.0002306061,0.00018609843,0.0004415797,0.0011346277,0.00048525445,0.000065905835,0.0000028577765],"category_scores_gemma":[0.000204691,0.00017793616,0.00005660672,0.00054182095,0.000027478896,0.0037101367,0.000105979496,0.00020175068,0.000019133104],"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.000020774958,0.0000023857144,0.00007636803,0.00035227,0.000015745156,3.097567e-7,0.005143465,0.92963755,0.000027746575,0.058748037,0.0003705171,0.005604844],"study_design_scores_gemma":[0.0005867178,0.0003543159,0.000057955123,0.000049157283,0.000008537547,0.000022125187,0.00039684342,0.96853465,0.00011464507,0.000032982898,0.02963061,0.00021148135],"about_ca_topic_score_codex":0.000055384247,"about_ca_topic_score_gemma":2.1555022e-7,"teacher_disagreement_score":0.8496136,"about_ca_system_score_codex":0.00012850702,"about_ca_system_score_gemma":0.0002931137,"threshold_uncertainty_score":0.9999023},"labels":[],"label_agreement":null},{"id":"W3105878426","doi":"","title":"Variational Amodal Object Completion","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Linguistic Variation and Morphology","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); University of Toronto","funders":"","keywords":"Amodal perception; Computer science; Object (grammar); Artificial intelligence; Computer vision; Completion (oil and gas wells); Psychology; Engineering; Cognition; Neuroscience; Mechanical engineering","score_opus":0.04884399175119023,"score_gpt":0.304242389403268,"score_spread":0.2553983976520777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105878426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036463726,0.00023784138,0.48846853,0.06237951,0.009252313,0.0022856758,0.00011130987,0.00235773,0.39844337],"genre_scores_gemma":[0.9955127,0.0000020077537,0.00033508815,0.003026247,0.00087462534,0.000018658306,0.00008447531,0.00000409375,0.00014206381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882346,0.00012572715,0.0003718244,0.0000903446,0.0004162858,0.00017235857],"domain_scores_gemma":[0.9991365,0.00004586655,0.00026870266,0.000047198813,0.0003822963,0.00011945168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037638526,0.0000747867,0.000119138596,0.000056424626,0.00052000064,0.00036628055,0.00013502853,0.00008360629,0.00011379136],"category_scores_gemma":[0.00075591455,0.00007318832,0.000028499433,0.0002659772,0.000057023655,0.0010565051,0.0000164787,0.00010113356,0.00022398491],"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.000105315645,0.000049266313,0.004949875,0.00047419412,0.00003146484,0.0000045159118,0.1886093,0.013465261,0.00027437805,0.7444555,0.025243586,0.022337325],"study_design_scores_gemma":[0.00065335893,0.000053744574,0.0032108924,0.000026165868,0.000014615832,0.000008439005,0.0063804598,0.3487923,0.000011286594,0.00025627032,0.6403575,0.00023497693],"about_ca_topic_score_codex":0.0004665947,"about_ca_topic_score_gemma":0.0000103712155,"teacher_disagreement_score":0.959049,"about_ca_system_score_codex":0.000067382665,"about_ca_system_score_gemma":0.00023012608,"threshold_uncertainty_score":0.39994773},"labels":[],"label_agreement":null},{"id":"W3106085430","doi":"","title":"Gradient Estimation with Stochastic Softmax Tricks","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Softmax function; Estimator; Gumbel distribution; Computer science; Latent variable; Algorithm; Artificial intelligence; Mathematics; Theoretical computer science; Machine learning; Artificial neural network; Statistics","score_opus":0.018544197203115984,"score_gpt":0.22380238714806924,"score_spread":0.20525818994495326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106085430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072237453,0.000059189413,0.9957148,0.0010198333,0.0001998369,0.00055993034,0.0000026699036,0.0012217101,0.0004996634],"genre_scores_gemma":[0.94792354,5.0710554e-7,0.051122136,0.0007546582,0.000043210952,0.0001099352,0.000023350716,0.000010106348,0.000012532209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984556,0.000031502346,0.0005293632,0.00021588018,0.00052557106,0.0002421084],"domain_scores_gemma":[0.99878424,0.0000388139,0.00045797435,0.00021754848,0.00033838485,0.00016302301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014282693,0.00019071613,0.0001955848,0.00019109437,0.00021861547,0.00088890345,0.00048690516,0.000060271566,0.0000021592807],"category_scores_gemma":[0.00013743095,0.00015421177,0.000029070552,0.00094032474,0.00003801444,0.004763487,0.000068066394,0.00013857555,0.00004499954],"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.00003530895,0.000025634788,0.000033936853,0.00043246502,0.000012750633,0.0000027751769,0.00875402,0.8223923,0.000025891508,0.020528778,0.0012110452,0.14654511],"study_design_scores_gemma":[0.00034143234,0.00020779335,0.000021060821,0.00008465518,0.000007577325,0.00006184882,0.00014131777,0.9984535,0.00009853656,0.0000950175,0.0002940281,0.00019323459],"about_ca_topic_score_codex":0.000008687055,"about_ca_topic_score_gemma":1.1900506e-7,"teacher_disagreement_score":0.9472012,"about_ca_system_score_codex":0.00006706872,"about_ca_system_score_gemma":0.00009524771,"threshold_uncertainty_score":0.85717165},"labels":[],"label_agreement":null},{"id":"W3106148219","doi":"","title":"Learning Deformable Tetrahedral Meshes for 3D Reconstruction","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polygon mesh; Point cloud; Computer science; Tetrahedron; Voxel; Surface reconstruction; Vertex (graph theory); Artificial intelligence; Computer graphics; Mesh generation; 3D reconstruction; Geometry processing; Differentiable function; Computational science; Artificial neural network; Algorithm; Computer graphics (images); Surface (topology); Theoretical computer science; Mathematics; Geometry; Finite element method","score_opus":0.017267676827871045,"score_gpt":0.20677000387688033,"score_spread":0.18950232704900927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106148219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18143265,0.0006513604,0.8082039,0.0002727457,0.00083333516,0.00040922203,0.000015368048,0.0020413462,0.0061401147],"genre_scores_gemma":[0.99824685,0.000010317617,0.0013219053,0.00008588634,0.00017986938,0.00003764514,0.00004895482,0.00001459823,0.000053946344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917006,0.000010283835,0.0004222281,0.00007499333,0.00013529572,0.00018711579],"domain_scores_gemma":[0.99964094,0.0000137771585,0.00010426373,0.0000473136,0.00012320417,0.00007050946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001126073,0.00012077532,0.00016997283,0.00008294999,0.00019795222,0.00031822885,0.00007543716,0.000067791574,0.000005659839],"category_scores_gemma":[0.00004913481,0.00011143213,0.000056894532,0.00022120509,0.000011035779,0.0020546,0.0000070389488,0.00014655961,0.000030049529],"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.000005649766,7.597339e-7,0.00014063113,0.00071148225,0.000012218297,7.33986e-8,0.0011579776,0.89270395,0.00016725238,0.0000089413625,0.0002630918,0.104827985],"study_design_scores_gemma":[0.00018990596,0.000032279102,0.0000067715073,0.000061739294,0.000018895373,0.000014363767,0.0009821886,0.9926968,0.00024214601,0.000004691559,0.005614162,0.00013602905],"about_ca_topic_score_codex":0.000008596477,"about_ca_topic_score_gemma":4.0332105e-7,"teacher_disagreement_score":0.81681424,"about_ca_system_score_codex":0.000037017446,"about_ca_system_score_gemma":0.000016539316,"threshold_uncertainty_score":0.45440704},"labels":[],"label_agreement":null},{"id":"W3106175111","doi":"","title":"Training Linear Finite-State Machines.","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Training (meteorology); Finite-state machine; Artificial intelligence; Algorithm; Physics","score_opus":0.03953275174896976,"score_gpt":0.2669046606796222,"score_spread":0.22737190893065246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106175111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042030215,0.00012185051,0.98509425,0.003650547,0.0006355405,0.00018226259,0.0000046005534,0.00080872397,0.0052991905],"genre_scores_gemma":[0.99178153,0.0000016754342,0.005231748,0.0024743315,0.0002444269,0.000014148723,0.000019230018,0.000008782696,0.00022415168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871016,0.00005878959,0.00048083827,0.00017036352,0.00033212843,0.0002477229],"domain_scores_gemma":[0.99920946,0.000059481245,0.00030248053,0.00015551689,0.000121402074,0.0001516832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022116635,0.00015623006,0.0001858119,0.000088028704,0.00023384507,0.0008213197,0.00051397196,0.000043909193,0.0000047858716],"category_scores_gemma":[0.00020935654,0.00013090792,0.000044449556,0.0005123769,0.000020177851,0.0032951473,0.000090055604,0.0002780811,0.00018698334],"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.0000064450737,0.000005748002,0.00012032061,0.00037007337,0.0000059875274,0.000007624943,0.026940871,0.23385964,0.000026211692,0.0007077113,0.00040350828,0.73754585],"study_design_scores_gemma":[0.00020835426,0.00005021492,0.00004014756,0.000041785104,0.0000017511512,0.00003471591,0.00014373302,0.9640981,0.000019105259,0.000021002343,0.0351859,0.00015520211],"about_ca_topic_score_codex":0.000064223044,"about_ca_topic_score_gemma":4.7038776e-7,"teacher_disagreement_score":0.9875785,"about_ca_system_score_codex":0.00001464903,"about_ca_system_score_gemma":0.00007274235,"threshold_uncertainty_score":0.7920005},"labels":[],"label_agreement":null},{"id":"W3106325597","doi":"","title":"Adaptive Gradient Quantization for Data-Parallel SGD","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hyperparameter; Quantization (signal processing); Computer science; Parametric statistics; Artificial intelligence; Algorithm; Heuristic; Machine learning; Theoretical computer science; Mathematics; Statistics","score_opus":0.11280027183829801,"score_gpt":0.3202749403614523,"score_spread":0.20747466852315433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106325597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006561817,0.00009479273,0.99633896,0.0015949928,0.00028572336,0.0007250825,0.000018875971,0.00061562064,0.00026035515],"genre_scores_gemma":[0.55562323,0.000012732031,0.43559664,0.0071057915,0.0002639601,0.0002819446,0.0010428142,0.000017331113,0.0000555428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857277,0.000046437104,0.00057355285,0.00022583822,0.00039757055,0.00018385341],"domain_scores_gemma":[0.9987974,0.00004418728,0.0004115949,0.00030212454,0.00031176006,0.00013294244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030624692,0.000122714,0.00015609134,0.000080756836,0.0001691688,0.00070109393,0.00090204895,0.000052428935,0.0000023392904],"category_scores_gemma":[0.00021451304,0.00010771616,0.00002457446,0.00036634057,0.000030008418,0.0083498685,0.00016377271,0.00008928727,0.000034032393],"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.000086100794,0.000057708774,0.000089282155,0.0019835606,0.000033747172,0.0000028611444,0.013944652,0.007781766,0.0014025164,0.02776122,0.063617826,0.88323873],"study_design_scores_gemma":[0.00029650863,0.00010778471,0.000015841002,0.00004484655,0.000004945857,0.000006994908,0.00025805584,0.99119216,0.0006673572,0.00006068883,0.0072190603,0.0001257824],"about_ca_topic_score_codex":0.000016115167,"about_ca_topic_score_gemma":3.683867e-7,"teacher_disagreement_score":0.98341036,"about_ca_system_score_codex":0.00003398054,"about_ca_system_score_gemma":0.00008133937,"threshold_uncertainty_score":0.6760665},"labels":[],"label_agreement":null},{"id":"W3144252049","doi":"","title":"RL Unplugged: A Collection of Benchmarks for Offline Reinforcement Learning.","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Machine learning","score_opus":0.025197425025171277,"score_gpt":0.25185865706341515,"score_spread":0.22666123203824387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144252049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009418303,0.00005837385,0.9936435,0.00077700685,0.00042845216,0.00073677266,0.0000011580432,0.00023039007,0.0031824647],"genre_scores_gemma":[0.9944941,0.000006487978,0.0044579874,0.00042000288,0.00009866466,0.000076474775,0.000093732866,0.00000902856,0.00034352264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801695,0.000050156104,0.0009835968,0.00017205786,0.0005154193,0.00026181608],"domain_scores_gemma":[0.998063,0.00007552397,0.0009936513,0.00018384267,0.0005769756,0.00010696602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003764953,0.0001754518,0.00027096702,0.00016680014,0.00027126225,0.0003930593,0.0004740007,0.000092561735,0.00000697671],"category_scores_gemma":[0.00033364107,0.00016468884,0.000077151846,0.0007095922,0.00003135724,0.0029027387,0.00010555898,0.0002010849,0.000014126306],"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.000028476385,0.000004536911,0.00017630498,0.0008822675,0.000011748379,1.6385184e-7,0.003461677,0.98687774,0.00018746061,0.0016628017,0.0027197807,0.0039870553],"study_design_scores_gemma":[0.0006391085,0.0004868511,0.000040506126,0.00009088617,0.000009874927,0.000006872939,0.000305868,0.9728975,0.000961313,0.0000058378864,0.024392968,0.00016236276],"about_ca_topic_score_codex":0.000018496889,"about_ca_topic_score_gemma":2.1687758e-7,"teacher_disagreement_score":0.99355227,"about_ca_system_score_codex":0.000072783216,"about_ca_system_score_gemma":0.00014573293,"threshold_uncertainty_score":0.6715816},"labels":[],"label_agreement":null},{"id":"W3193215773","doi":"","title":"Detecting Interrogative Utterances with Recurrent Neural Networks","year":2015,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Topic Modeling","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":"Utterance; Computer science; Artificial neural network; Regularization (linguistics); Artificial intelligence; Recurrent neural network; Interrogative; Deep neural networks; Context (archaeology); Statement (logic); Speech recognition; Natural language processing; Machine learning; Linguistics","score_opus":0.04103528702438647,"score_gpt":0.2667657193270378,"score_spread":0.22573043230265133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193215773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08134923,0.00027843358,0.91525686,0.00027986683,0.0013539729,0.00025606412,5.56683e-7,0.00036441637,0.00086062704],"genre_scores_gemma":[0.9962572,6.6931136e-7,0.0032534753,0.00025530037,0.0001626404,0.000041057985,0.0000043249674,0.000005993615,0.000019355024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985851,0.000072147006,0.00048187422,0.00018587481,0.00039949868,0.0002754893],"domain_scores_gemma":[0.9988251,0.000028425176,0.00042500894,0.00023135147,0.00037210085,0.00011801483],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035869973,0.00016466659,0.00017368348,0.00011635527,0.00017138674,0.0011023812,0.0004712035,0.000051354727,3.4621135e-7],"category_scores_gemma":[0.000046405134,0.00012275763,0.000024251764,0.0003762813,0.000028502174,0.0064391727,0.00010064832,0.00022896819,0.000008364078],"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.000022817034,0.000008140899,0.0007970028,0.00014392276,0.0000075489074,0.0000031515026,0.01400288,0.53972846,0.000005566049,0.00046395778,0.00009538614,0.44472116],"study_design_scores_gemma":[0.00032097884,0.000102312915,0.00005002749,0.0001511254,0.0000028839818,0.00009728923,0.001386278,0.99719554,0.000040012226,0.000018484217,0.0004778501,0.00015720824],"about_ca_topic_score_codex":0.000040832958,"about_ca_topic_score_gemma":0.0000053890603,"teacher_disagreement_score":0.91490793,"about_ca_system_score_codex":0.00008502446,"about_ca_system_score_gemma":0.0000624684,"threshold_uncertainty_score":0.99993455},"labels":[],"label_agreement":null},{"id":"W3202097587","doi":"","title":"Learning One Representation to Optimize All Rewards","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","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":"Université de Montréal","funders":"","keywords":"Computer science; Representation (politics); Markov decision process; Artificial intelligence; Reinforcement learning; A priori and a posteriori; Machine learning; Markov process; Temporal difference learning; Mathematics","score_opus":0.04197470961659992,"score_gpt":0.29183757204241134,"score_spread":0.2498628624258114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202097587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032361443,0.00006014124,0.98540956,0.0013238696,0.00072241994,0.0002518636,4.4228787e-7,0.00049820123,0.008497358],"genre_scores_gemma":[0.9584229,0.0000096774675,0.037461348,0.0012984049,0.00012059132,0.000049925507,0.00006446659,0.0000129581495,0.0025597438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796575,0.00012772824,0.00066948915,0.00023152374,0.0006987865,0.00030671692],"domain_scores_gemma":[0.99840504,0.000056866447,0.0003905897,0.00038068957,0.00063732907,0.00012948466],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00039740404,0.00014808589,0.0002017328,0.00018164807,0.00025766113,0.001948632,0.00043996927,0.00007754767,0.0000070637793],"category_scores_gemma":[0.00043305184,0.00015545158,0.00004651492,0.0008205595,0.000013819776,0.004895332,0.00022626691,0.00025214656,0.00022115876],"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.000003673543,0.0000056989174,0.00015286934,0.0001302303,0.000008938043,0.0000032407195,0.0035298937,0.9776489,0.0004119393,0.0009129422,0.00073232385,0.016459312],"study_design_scores_gemma":[0.00025362297,0.00006866658,0.00022049199,0.0001263446,0.0000066064044,0.000054859724,0.0006038564,0.9804281,0.0015102387,0.000010305923,0.01652518,0.00019170129],"about_ca_topic_score_codex":0.000025239708,"about_ca_topic_score_gemma":3.9400285e-7,"teacher_disagreement_score":0.9551867,"about_ca_system_score_codex":0.000105012805,"about_ca_system_score_gemma":0.00012956388,"threshold_uncertainty_score":0.99908745},"labels":[],"label_agreement":null},{"id":"W3202820157","doi":"","title":"An Extensible Benchmark Suite for Learning to Simulate Physical Systems","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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 Victoria","funders":"","keywords":"Computer science; Benchmark (surveying); Suite; Kernel (algebra); Physical system; Complement (music); Machine learning; Stability (learning theory); Distributed computing; Set (abstract data type); Artificial intelligence; Data mining","score_opus":0.016922313167194378,"score_gpt":0.2951060489753647,"score_spread":0.2781837358081703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202820157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84182465,0.00013763773,0.1511453,0.00021223091,0.0018103024,0.0010249174,0.00003800041,0.0002731368,0.0035338583],"genre_scores_gemma":[0.9971415,6.022205e-7,0.00012560464,0.00012277464,0.0010593627,0.00014342424,0.0002987684,0.000019177916,0.0010887813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986646,0.00007513139,0.0004604885,0.00022024661,0.00024886208,0.00033062967],"domain_scores_gemma":[0.99878067,0.000048022783,0.00024634923,0.00018646827,0.00055423,0.00018426978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016702457,0.00019103332,0.00027868853,0.00008456315,0.0003997057,0.00093328895,0.00011945051,0.000049610713,0.000014230964],"category_scores_gemma":[0.000015564685,0.00017565985,0.00008702742,0.00031960948,0.000014748955,0.001912785,0.000026693318,0.00019053918,0.000035817455],"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.000027098196,0.00003793171,0.00031490167,0.00022185489,0.000012754593,4.6688274e-7,0.0012761059,0.95926815,0.0017716025,0.002266538,0.0008560389,0.03394657],"study_design_scores_gemma":[0.00032777392,0.000077332654,0.000045453467,0.00010539379,0.000015702586,0.000008741468,0.0023450577,0.97025317,0.00074903545,0.000052216958,0.025800511,0.00021961222],"about_ca_topic_score_codex":0.00004070494,"about_ca_topic_score_gemma":2.7277383e-7,"teacher_disagreement_score":0.15531687,"about_ca_system_score_codex":0.000028606539,"about_ca_system_score_gemma":0.000073348056,"threshold_uncertainty_score":0.8999727},"labels":[],"label_agreement":null},{"id":"W3210720616","doi":"","title":"Scallop: From Probabilistic Deductive Databases to Scalable Differentiable Reasoning","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Scalability; Deductive reasoning; Deductive database; Database; Programming language; Natural language processing; Artificial intelligence; Data mining; Information retrieval","score_opus":0.021531567657527787,"score_gpt":0.2609899767663771,"score_spread":0.2394584091088493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210720616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04883173,0.00053629634,0.9475299,0.0002192051,0.0008964865,0.00036063627,0.0001314858,0.00034809802,0.0011461772],"genre_scores_gemma":[0.8909054,0.0000064949695,0.10674482,0.0005145099,0.00025838698,0.00020440145,0.0006061336,0.000018366323,0.000741478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981146,0.00008964707,0.0006124366,0.00037175903,0.0004551767,0.00035636843],"domain_scores_gemma":[0.9982687,0.00007144417,0.00029065096,0.0006175216,0.00057797943,0.00017370853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018699975,0.00021213418,0.0002972313,0.00010938638,0.0003904552,0.0008469467,0.00032762208,0.000044464676,0.000012351559],"category_scores_gemma":[0.00036538532,0.00018706995,0.00003845421,0.00070324336,0.000031475294,0.008754955,0.0003484288,0.00013924754,0.00011895127],"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.00016892006,0.00048921275,0.006508947,0.0064496947,0.00021968463,0.00013814332,0.034813818,0.13712814,0.019450203,0.5464725,0.029187778,0.21897298],"study_design_scores_gemma":[0.00079372036,0.00007913236,0.0018858762,0.0024136496,0.000030807165,0.00024857355,0.0042287135,0.75195277,0.01026987,0.00035137,0.22667684,0.0010686874],"about_ca_topic_score_codex":0.00039500152,"about_ca_topic_score_gemma":0.0000272637,"teacher_disagreement_score":0.8420737,"about_ca_system_score_codex":0.000109154535,"about_ca_system_score_gemma":0.00021112633,"threshold_uncertainty_score":0.8167127},"labels":[],"label_agreement":null},{"id":"W3211367579","doi":"","title":"Representer Point Selection via Local Jacobian Expansion for Post-hoc Classifier Explanation of Deep Neural Networks and Ensemble Models","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Adversarial Robustness in Machine Learning","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 Toronto","funders":"","keywords":"Computer science; Jacobian matrix and determinant; Artificial intelligence; Classifier (UML); Artificial neural network; Deep neural networks; Selection (genetic algorithm); Machine learning; Pattern recognition (psychology); Mathematics; Applied mathematics","score_opus":0.015990527970888624,"score_gpt":0.2491866928081204,"score_spread":0.23319616483723177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211367579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01701097,0.00020584624,0.9811693,0.0003378753,0.00063551427,0.00033052202,0.0000013767668,0.00013531437,0.00017331282],"genre_scores_gemma":[0.99342114,0.0000036553758,0.006101618,0.00022636808,0.00010472428,0.00004203216,0.00005269885,0.00001167893,0.000036079655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983401,0.00013010239,0.00067460636,0.00026526224,0.0003379925,0.00025197602],"domain_scores_gemma":[0.9982508,0.000094064526,0.0005283053,0.00021110092,0.0008441426,0.000071632465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038555844,0.00016843277,0.00023686507,0.00016659265,0.00028394003,0.00043064385,0.00020295248,0.00013953156,0.0000015497797],"category_scores_gemma":[0.00008622684,0.00016034371,0.000056311535,0.000387989,0.000036985854,0.006317808,0.00012412308,0.00020574157,9.787977e-7],"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.000053875654,0.000010148773,0.000060085044,0.0002370173,0.0000067303545,9.3999813e-7,0.0014218489,0.8510736,0.0006272047,0.0013788105,0.000048428647,0.1450813],"study_design_scores_gemma":[0.0005224011,0.000110008674,0.0001279359,0.0000727911,0.00001014978,0.00014839086,0.0007532193,0.9972923,0.0005188075,0.00022871011,0.00005856667,0.00015672133],"about_ca_topic_score_codex":0.000045790253,"about_ca_topic_score_gemma":0.000010467318,"teacher_disagreement_score":0.97641015,"about_ca_system_score_codex":0.00007289028,"about_ca_system_score_gemma":0.000051109393,"threshold_uncertainty_score":0.65386266},"labels":[],"label_agreement":null},{"id":"W3211453469","doi":"","title":"Artsheets for Art Datasets","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Aesthetic Perception and Analysis","field":"Neuroscience","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 Toronto","funders":"","keywords":"Computer science","score_opus":0.04697436033513219,"score_gpt":0.3059174410977153,"score_spread":0.2589430807625831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211453469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4495731,0.0007564829,0.42500895,0.016076583,0.006057548,0.0032395653,0.0025883703,0.0025852718,0.0941141],"genre_scores_gemma":[0.99490166,0.000008418657,0.00011353595,0.0026949008,0.00006967505,0.000054504635,0.00043826058,0.0000067891738,0.0017122839],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989824,0.00004538472,0.0003840075,0.00015238934,0.00025664782,0.00017916226],"domain_scores_gemma":[0.99942166,0.000019177392,0.00018746892,0.00017833826,0.00012450408,0.00006886956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012834444,0.00009864111,0.0001368595,0.00007746584,0.0002650136,0.0005199583,0.00012062858,0.00004571379,0.00006271352],"category_scores_gemma":[0.00026296964,0.000086446664,0.000057472058,0.00028378988,0.00003395476,0.0017754285,0.000025569756,0.000066716035,0.00034928185],"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.000118761665,0.00028386092,0.00030084472,0.002752088,0.000011757906,0.000039196308,0.005645353,0.020283552,0.2072882,0.011082857,0.34039533,0.41179818],"study_design_scores_gemma":[0.00041285343,0.000023024835,0.00005923778,0.00006504088,0.000015933354,0.00022049683,0.0006147262,0.34533122,0.0077751847,0.000042236425,0.6452477,0.00019232769],"about_ca_topic_score_codex":0.000001584504,"about_ca_topic_score_gemma":7.8097315e-7,"teacher_disagreement_score":0.5453285,"about_ca_system_score_codex":0.000023854123,"about_ca_system_score_gemma":0.00006147362,"threshold_uncertainty_score":0.50139695},"labels":[],"label_agreement":null},{"id":"W3211462868","doi":"","title":"Iterative Teaching by Label Synthesis","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Computer science; Selection (genetic algorithm); Contrast (vision); Iterative method; Algorithm; Artificial intelligence; Theoretical computer science; Machine learning","score_opus":0.017800298451563695,"score_gpt":0.268583519151509,"score_spread":0.2507832206999453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211462868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067488686,0.00064646255,0.9697065,0.0034568254,0.0005901988,0.00015007133,0.000022714,0.00060220156,0.018076174],"genre_scores_gemma":[0.99334514,0.0000050226176,0.005146592,0.00056602404,0.000054482687,0.000043252785,0.00012174932,0.0000052483965,0.00071249745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987806,0.00019100141,0.0003842042,0.00017585103,0.00029993278,0.00016840792],"domain_scores_gemma":[0.9990478,0.00009415099,0.00028674773,0.0002984763,0.00021270118,0.00006013746],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003878561,0.000115231116,0.00013226972,0.000077090386,0.00038854862,0.0018677032,0.00034025914,0.00005557928,0.000004069192],"category_scores_gemma":[0.00039473275,0.00010180785,0.000021497939,0.00026360538,0.000013950421,0.005620966,0.000078739635,0.00022309051,0.00008391972],"study_design_candidate":"design_other","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.0000041000985,0.000053904576,0.0004616246,0.00039507233,0.000012505524,0.0000033210752,0.00456347,0.0007585364,0.0030296757,0.02648675,0.01686989,0.9473612],"study_design_scores_gemma":[0.000138808,0.000013668044,0.00017261205,0.000108292545,0.000004057503,0.00006400227,0.0003690473,0.8959173,0.0012052582,0.000026102425,0.10182091,0.00015993863],"about_ca_topic_score_codex":0.000030286037,"about_ca_topic_score_gemma":5.278684e-7,"teacher_disagreement_score":0.9865963,"about_ca_system_score_codex":0.000042719857,"about_ca_system_score_gemma":0.00007643625,"threshold_uncertainty_score":0.99916846},"labels":[],"label_agreement":null},{"id":"W3211684788","doi":"","title":"Average-Reward Learning and Planning with Options","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","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":"University of Alberta","funders":"","keywords":"Reinforcement learning; Markov decision process; Computer science; Abstraction; Convergence (economics); Sample complexity; Artificial intelligence; Machine learning; Mathematical proof; Markov chain; Sample (material); Domain (mathematical analysis); Markov process; Mathematics; Statistics","score_opus":0.01646724830475379,"score_gpt":0.2526428685441239,"score_spread":0.23617562023937008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211684788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074714217,0.00036277086,0.9867648,0.0002099795,0.00026882163,0.00010962712,2.8750583e-7,0.0003311759,0.004481129],"genre_scores_gemma":[0.9908171,0.0000097591255,0.0080772005,0.00016295274,0.000050455797,0.0000147764595,0.000017187023,0.0000069449334,0.00084359053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988878,0.000063052365,0.00033621452,0.00014876276,0.0003473436,0.00021687125],"domain_scores_gemma":[0.9991324,0.000045661633,0.0002688273,0.00015042644,0.00032869194,0.000074014846],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00020055886,0.00012667417,0.00013871057,0.0001141407,0.00042047104,0.0017286509,0.0001738616,0.000051845476,0.0000020821924],"category_scores_gemma":[0.0000877347,0.00010905102,0.00001659048,0.0004021172,0.000028713395,0.0040354743,0.000107887034,0.00025028153,0.000020996746],"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.000002020981,0.0000021863532,0.0019932913,0.00018232057,0.0000065757476,0.000008865442,0.0025598542,0.988095,0.000041946863,0.001624611,0.000077698525,0.005405614],"study_design_scores_gemma":[0.00024914616,0.00005062263,0.0004164628,0.00022013966,0.000004219972,0.00028960887,0.000925723,0.98691064,0.00011299525,0.0000065275317,0.010656362,0.00015756529],"about_ca_topic_score_codex":0.0000049593386,"about_ca_topic_score_gemma":1.5861531e-7,"teacher_disagreement_score":0.9833457,"about_ca_system_score_codex":0.000034239736,"about_ca_system_score_gemma":0.00010017514,"threshold_uncertainty_score":0.99930763},"labels":[],"label_agreement":null},{"id":"W3211741236","doi":"","title":"Learning in two-player zero-sum partially observable Markov games with perfect recall","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Observable; Zero (linguistics); Computer science; Markov chain; Recall; Zero-sum game; Markov process; Mathematics; Mathematical economics; Game theory; Statistics; Machine learning; Cognitive psychology; Psychology; Physics","score_opus":0.018763851378186695,"score_gpt":0.2540259796019725,"score_spread":0.23526212822378578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211741236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061686255,0.0002322497,0.92562246,0.0005857725,0.00068889826,0.00039584682,5.8088045e-7,0.00058120897,0.010206738],"genre_scores_gemma":[0.98836803,0.000009526449,0.00906817,0.00038155293,0.000051293977,0.00004609138,0.000027813523,0.000015074527,0.0020324308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976702,0.00020054678,0.00074301544,0.0002731318,0.0006421358,0.00047101916],"domain_scores_gemma":[0.99856144,0.000092255825,0.0004784477,0.00035766838,0.00041436107,0.00009582588],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006205395,0.00023051816,0.00029138112,0.00017590338,0.00026351772,0.001839757,0.00046058756,0.00007566524,0.000007220187],"category_scores_gemma":[0.00017213455,0.00019892579,0.00004178643,0.0008888634,0.00003320075,0.005905949,0.0001497234,0.00046671228,0.00006866969],"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.000013026364,0.00000962177,0.012281147,0.00032593735,0.000008075778,0.000019590114,0.0021168268,0.9708441,0.00015758188,0.0004777647,0.00021136056,0.013534957],"study_design_scores_gemma":[0.0006628475,0.00011502727,0.0014997617,0.0004046723,0.0000060000484,0.00013192337,0.00042081508,0.9867987,0.0004495157,0.0000067624323,0.009234232,0.00026971527],"about_ca_topic_score_codex":0.00006695371,"about_ca_topic_score_gemma":0.0000147580095,"teacher_disagreement_score":0.9266818,"about_ca_system_score_codex":0.000121697216,"about_ca_system_score_gemma":0.0003370045,"threshold_uncertainty_score":0.9991964},"labels":[],"label_agreement":null},{"id":"W3211759539","doi":"","title":"Referring Transformer: A One-step Approach to Multi-task Visual Grounding","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformer; Artificial intelligence; Segmentation; Encoder; Ground; Leverage (statistics); Margin (machine learning); Language model; Machine learning; Natural language processing; Engineering","score_opus":0.040190123109037815,"score_gpt":0.30488632255680165,"score_spread":0.26469619944776385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211759539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048040655,0.000099716126,0.945763,0.0005466587,0.0002751439,0.0004973779,0.000003541508,0.00060780114,0.0041661407],"genre_scores_gemma":[0.9345828,0.0000017855053,0.06432245,0.00056702126,0.00008420798,0.00024186577,0.00005121257,0.000015598229,0.00013305183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978309,0.000102529586,0.0007379532,0.00036787926,0.00055129634,0.00040942614],"domain_scores_gemma":[0.9987611,0.000040626353,0.00023561681,0.00040024312,0.00036599283,0.00019640781],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043590105,0.00022379342,0.00026716664,0.0002610426,0.0005347241,0.0016607993,0.0006126375,0.00010321689,0.000002397775],"category_scores_gemma":[0.00010668798,0.00022515343,0.00006738031,0.0011362083,0.000019445863,0.0038098185,0.00008281011,0.0003364967,0.00014097065],"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.000027868586,0.0005352687,0.0019045828,0.0031132598,0.00006795787,0.000005301476,0.035520907,0.18230477,0.016749687,0.036334664,0.0002651694,0.7231706],"study_design_scores_gemma":[0.00040103673,0.000028228209,0.0025904889,0.00012350887,0.0000077159375,0.00009470901,0.00067777117,0.9913728,0.0005695572,0.000007659619,0.0038441045,0.0002823851],"about_ca_topic_score_codex":0.00029027605,"about_ca_topic_score_gemma":0.000005803499,"teacher_disagreement_score":0.88654214,"about_ca_system_score_codex":0.00015101419,"about_ca_system_score_gemma":0.00014066098,"threshold_uncertainty_score":0.9993756},"labels":[],"label_agreement":null},{"id":"W3211776917","doi":"","title":"Learning Tree Interpretation from Object Representation for Deep Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Reinforcement Learning in Robotics","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 Waterloo; Simon Fraser University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Interpretation (philosophy); Representation (politics); Tree (set theory); Object (grammar); Machine learning; Programming language; Mathematics","score_opus":0.021558708445137575,"score_gpt":0.2752711759624968,"score_spread":0.2537124675173592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211776917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002678855,0.000117914635,0.9903236,0.00019828703,0.0009509869,0.0004528187,5.00864e-7,0.0005036673,0.0047733746],"genre_scores_gemma":[0.9891053,0.00001384428,0.008637907,0.00022716878,0.00014223422,0.00013159639,0.0004823991,0.000017113522,0.0012424287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750185,0.00018710353,0.0009978046,0.00032250411,0.0006337585,0.0003569815],"domain_scores_gemma":[0.99759746,0.00026295538,0.0009380265,0.00032021833,0.00079411885,0.0000872453],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042214512,0.0002288821,0.0002775989,0.00020575323,0.0005597151,0.0020592075,0.00041441806,0.00011997239,0.000010901425],"category_scores_gemma":[0.00082068186,0.00023606274,0.0001072625,0.00057236,0.000024543035,0.006271557,0.00015476882,0.00035326727,0.00007577864],"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.000017488152,0.000004292278,0.0004019147,0.00016544334,0.000020124186,0.0000014557233,0.0068840706,0.9243797,0.0004421686,0.00061719905,0.00011468634,0.06695144],"study_design_scores_gemma":[0.00063793873,0.00014771434,0.00024852218,0.00017768965,0.000018660518,0.00001812388,0.0024584262,0.98959863,0.0019422704,0.000047446018,0.004450831,0.00025371832],"about_ca_topic_score_codex":0.000050753366,"about_ca_topic_score_gemma":0.0000031361367,"teacher_disagreement_score":0.9864265,"about_ca_system_score_codex":0.00017241517,"about_ca_system_score_gemma":0.00014387272,"threshold_uncertainty_score":0.99897677},"labels":[],"label_agreement":null},{"id":"W3211913805","doi":"","title":"PLUGIn: A simple algorithm for inverting generative models with recovery guarantees","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simple (philosophy); Computer science; Plug-in; Algorithm; Generative model; Generative grammar; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.024443581683610983,"score_gpt":0.24393023563814464,"score_spread":0.21948665395453365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211913805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027812566,0.000250832,0.99515414,0.00036238474,0.00012368163,0.00035087587,0.000020478987,0.00023987077,0.00071647076],"genre_scores_gemma":[0.7483011,0.000009893728,0.2487371,0.0014680992,0.00017295005,0.0006267228,0.000342113,0.000019917647,0.00032212448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998935,0.00002697187,0.00040242105,0.00018927162,0.00023559526,0.00021073387],"domain_scores_gemma":[0.998895,0.000041622567,0.00026962,0.00025341354,0.0004900519,0.000050316445],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00014615452,0.0001287918,0.00016078769,0.000074211224,0.00036030804,0.0011082164,0.00025897118,0.00006510668,0.0000010008091],"category_scores_gemma":[0.000016412081,0.00010727136,0.00004200264,0.0004289891,0.000018847732,0.005038904,0.00006109948,0.0000991716,0.000007914174],"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.000007452996,0.000038080467,0.000013506459,0.00048675004,0.00003101072,0.000004039414,0.004930309,0.100845695,0.0011334588,0.025446959,0.0017508097,0.8653119],"study_design_scores_gemma":[0.00029033012,0.000032885775,0.000005422422,0.0000634481,0.0000058951855,0.00008482695,0.00041925517,0.99005324,0.003307111,0.0012659053,0.004318642,0.00015303472],"about_ca_topic_score_codex":0.000018981595,"about_ca_topic_score_gemma":0.000004022543,"teacher_disagreement_score":0.88920754,"about_ca_system_score_codex":0.00004395339,"about_ca_system_score_gemma":0.00020378949,"threshold_uncertainty_score":0.9999287},"labels":[],"label_agreement":null},{"id":"W3211965499","doi":"","title":"TriBERT: Human-centric Audio-visual Representation Learning","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Music and Audio Processing","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; University of British Columbia","funders":"","keywords":"Computer science; Audio visual; Representation (politics); Artificial intelligence; Human–computer interaction; Visualization; Computer vision; Speech recognition; Natural language processing; Multimedia","score_opus":0.026231415577706776,"score_gpt":0.2957809480702087,"score_spread":0.26954953249250196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211965499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08954937,0.0012378906,0.889638,0.0013012895,0.001427408,0.00030966406,0.000001188249,0.0009852914,0.015549863],"genre_scores_gemma":[0.99666685,0.000007971647,0.0010307824,0.0006277262,0.00019552172,0.00002524423,0.000056808523,0.000009010111,0.0013800629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979834,0.00013666169,0.00070516416,0.00027391198,0.00056961883,0.00033124912],"domain_scores_gemma":[0.99850243,0.000045456756,0.0005815204,0.00022467838,0.00054916344,0.0000967304],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00033443686,0.0001737326,0.00023203676,0.00019557447,0.0007502677,0.0022821557,0.00033546658,0.00009250779,0.000013667312],"category_scores_gemma":[0.00016977947,0.0001658903,0.00006391752,0.0012025245,0.000027842736,0.0071061053,0.00014624425,0.00026717843,0.00008659053],"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.000014615663,0.000109070934,0.004042342,0.0017251137,0.000036150162,0.00005635558,0.012091491,0.036328632,0.0066699763,0.008180653,0.0070652254,0.92368037],"study_design_scores_gemma":[0.0008664066,0.000055315635,0.0012631501,0.0002963322,0.000014257783,0.00030553856,0.0011710816,0.9590924,0.0064144274,0.00015431034,0.029936366,0.0004304236],"about_ca_topic_score_codex":0.000020204789,"about_ca_topic_score_gemma":6.835595e-7,"teacher_disagreement_score":0.92324996,"about_ca_system_score_codex":0.00007989349,"about_ca_system_score_gemma":0.0001933342,"threshold_uncertainty_score":0.99875355},"labels":[],"label_agreement":null},{"id":"W3212081583","doi":"","title":"Techniques for Symbol Grounding with SATNet","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Image Retrieval and Classification Techniques","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":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Symbol (formal); Key (lock); Pipeline (software); Solver; Machine learning; Theoretical computer science; Programming language","score_opus":0.019769664802177817,"score_gpt":0.25981923059500645,"score_spread":0.24004956579282863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212081583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051871006,0.00017426077,0.9952157,0.0005956696,0.00014923143,0.00037500856,0.000003490114,0.0008869578,0.0020809548],"genre_scores_gemma":[0.9552071,0.0000081500075,0.04350331,0.00045819132,0.00008014988,0.00026065035,0.000036711303,0.00000866532,0.0004370534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989761,0.00002906999,0.00037048597,0.00015758182,0.00027574183,0.00019101318],"domain_scores_gemma":[0.9987129,0.000035562112,0.00027373052,0.00024726306,0.0006821408,0.000048391976],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002523048,0.00011981138,0.00014672377,0.00010716462,0.00024655458,0.0013034822,0.00030705985,0.000064318454,0.0000011633042],"category_scores_gemma":[0.000046629273,0.00009379565,0.000033974102,0.00049499277,0.000025500212,0.0044821533,0.00004522843,0.000085829604,0.000006497313],"study_design_candidate":"design_other","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.000025172196,0.000043144522,0.00014734521,0.0016585498,0.0000172889,0.0000050121,0.0019539888,0.00002901696,0.0066195284,0.09828455,0.0018899763,0.88932645],"study_design_scores_gemma":[0.00062373164,0.00031812003,0.00026865062,0.0007303384,0.00002121636,0.0006656789,0.0013471096,0.47106007,0.31885865,0.00091292255,0.20443642,0.00075710303],"about_ca_topic_score_codex":0.0000049348682,"about_ca_topic_score_gemma":3.2598263e-7,"teacher_disagreement_score":0.95468843,"about_ca_system_score_codex":0.000060581096,"about_ca_system_score_gemma":0.00013954478,"threshold_uncertainty_score":0.99973327},"labels":[],"label_agreement":null},{"id":"W3212380924","doi":"","title":"Monte Carlo Tree Search With Iteratively Refining State Abstractions","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Artificial Intelligence in Games","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":"Monte Carlo tree search; Refining (metallurgy); Computer science; Monte Carlo method; Tree (set theory); State (computer science); Parallel computing; Theoretical computer science; Algorithm; Mathematics; Statistics","score_opus":0.04253105902072312,"score_gpt":0.2895440876454856,"score_spread":0.2470130286247625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212380924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41202033,0.00042838126,0.56949526,0.0015572289,0.0010536646,0.00031441104,0.000015449801,0.00078893814,0.01432638],"genre_scores_gemma":[0.99483806,0.0000039301235,0.003721611,0.00017140832,0.000048847323,0.000034470995,0.0000050614376,0.000007664425,0.0011689499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983795,0.0000747462,0.0005437549,0.00020500038,0.00050577126,0.00029122405],"domain_scores_gemma":[0.998418,0.00006902464,0.00025930782,0.00028773188,0.0008762775,0.000089712325],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00025441853,0.00014906743,0.00016420281,0.00014423797,0.0003925211,0.0021317387,0.0003424363,0.00004762394,0.0000046971822],"category_scores_gemma":[0.00004911296,0.00012309704,0.000031570242,0.00057807664,0.000051146482,0.0076477756,0.00007972945,0.00024484546,0.00011521058],"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.000031655964,0.000053103937,0.001357085,0.0004276021,0.000037086593,0.00007770187,0.042006128,0.40919173,0.0014185976,0.004745458,0.0006016197,0.54005224],"study_design_scores_gemma":[0.00010726374,0.00007130306,0.00093309366,0.00019685352,0.0000041867697,0.00026956227,0.0031652802,0.98265153,0.0069050244,0.00002645117,0.005436707,0.00023276826],"about_ca_topic_score_codex":0.00016124941,"about_ca_topic_score_gemma":0.00005614921,"teacher_disagreement_score":0.58281773,"about_ca_system_score_codex":0.00008136732,"about_ca_system_score_gemma":0.00028762995,"threshold_uncertainty_score":0.99890417},"labels":[],"label_agreement":null},{"id":"W3212514152","doi":"","title":"Regime Switching Bandits","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Markov decision process; Upper and lower bounds; Stochastic matrix; Markov process; Observable; Computer science; State (computer science); Partially observable Markov decision process; Matrix (chemical analysis); Reinforcement learning; Probably approximately correct learning; Artificial intelligence; Mathematical optimization; Mathematics; Markov model; Algorithm; Machine learning; Unsupervised learning; Generalization error; Statistics","score_opus":0.1121872631780489,"score_gpt":0.4130105025504202,"score_spread":0.3008232393723713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212514152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082169466,0.0027639132,0.87272084,0.0057414593,0.0048091034,0.00087446196,0.000039585375,0.0006715997,0.0302096],"genre_scores_gemma":[0.99512273,0.000006911885,0.0007822564,0.00030343197,0.00025932473,0.000028140503,0.000024443076,0.000010948894,0.0034617847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571383,0.00018478298,0.0010990128,0.00028172243,0.0023438383,0.00037681556],"domain_scores_gemma":[0.9964792,0.00037049458,0.00052642036,0.0006795596,0.0017928092,0.00015150201],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016955025,0.0001557213,0.00028666947,0.00034056982,0.00047448906,0.002745844,0.00075940206,0.00009541439,0.00008997495],"category_scores_gemma":[0.0050725415,0.00011697036,0.000072423725,0.0015073045,0.000040928207,0.0073641143,0.00023484397,0.00029610484,0.0008845954],"study_design_candidate":"design_other","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.000054175274,0.00004579893,0.0012538354,0.00030783407,0.00001934173,0.00007105109,0.0050873626,0.06673161,0.0013783652,0.0009930024,0.028528184,0.89552945],"study_design_scores_gemma":[0.0006979033,0.000041384705,0.0012486996,0.00015637622,0.000005606272,0.00048266395,0.005695292,0.77072996,0.00226205,0.002917672,0.21540877,0.00035364213],"about_ca_topic_score_codex":0.000014196104,"about_ca_topic_score_gemma":0.0000030887559,"teacher_disagreement_score":0.9129533,"about_ca_system_score_codex":0.00008831041,"about_ca_system_score_gemma":0.00026858755,"threshold_uncertainty_score":0.9998933},"labels":[],"label_agreement":null},{"id":"W3212540177","doi":"","title":"Entropic Desired Dynamics for Intrinsic Control","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Mathematical Biology Tumor Growth","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":"Université de Montréal","funders":"","keywords":"Dynamics (music); Computer science; Control (management); Control theory (sociology); Statistical physics; Physics; Artificial intelligence","score_opus":0.036903607793451934,"score_gpt":0.2916946939445424,"score_spread":0.2547910861510905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212540177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12303814,0.00029830146,0.8663723,0.0013857022,0.0011184193,0.0018729101,0.00012570084,0.0006349182,0.0051536495],"genre_scores_gemma":[0.9950732,0.0000012279864,0.0037737866,0.0003155241,0.00012362188,0.0002047306,0.00010095216,0.000017806928,0.00038915788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983702,0.00008470289,0.0008449431,0.00014840033,0.0002349714,0.00031679263],"domain_scores_gemma":[0.99819195,0.00045499354,0.00045653625,0.000238512,0.0005738593,0.00008415321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034709316,0.00018750978,0.0003977838,0.00008650034,0.00018945504,0.00028160776,0.00016635754,0.00013503141,0.000016049555],"category_scores_gemma":[0.0014347485,0.00015662836,0.00009073939,0.00020863737,0.000050377603,0.0008065122,0.000030651503,0.00013581123,0.000035570065],"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.00013268185,0.00016582792,0.0011649498,0.0110478755,0.0001138556,0.000012285073,0.0014709223,0.00013120839,0.00047889154,0.9288844,0.004656298,0.051740833],"study_design_scores_gemma":[0.00401098,0.00015992783,0.00025097546,0.00046837743,0.00016396455,0.00045015514,0.0016240126,0.921315,0.0012489572,0.06306254,0.006627085,0.0006180296],"about_ca_topic_score_codex":0.0000022478293,"about_ca_topic_score_gemma":0.0000035206883,"teacher_disagreement_score":0.92118376,"about_ca_system_score_codex":0.0001249963,"about_ca_system_score_gemma":0.0001151279,"threshold_uncertainty_score":0.63871187},"labels":[],"label_agreement":null},{"id":"W3212564326","doi":"","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Graph Neural Networks","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Longest path problem; Artificial neural network; Path (computing); Shortest path problem; Operator (biology); Mathematical optimization; Graph; Representation (politics); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.018386948677528908,"score_gpt":0.2599354822932214,"score_spread":0.24154853361569248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212564326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008216669,0.0030628254,0.97700864,0.0014105544,0.007757714,0.0010969336,0.000023559478,0.0012300094,0.00019310339],"genre_scores_gemma":[0.9221094,0.000119247314,0.067415595,0.00419664,0.0048156567,0.00059471617,0.00042033452,0.00007659774,0.00025178547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954869,0.0002033497,0.0015937125,0.000705365,0.00074643356,0.0012642193],"domain_scores_gemma":[0.99652904,0.00030953417,0.0010395591,0.00088118715,0.00091862166,0.00032204366],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049810443,0.00058703,0.00061074074,0.00024346609,0.0011716783,0.0020361913,0.0010505838,0.000444849,0.0000037753684],"category_scores_gemma":[0.00016556508,0.00056048454,0.00032237996,0.0023482377,0.00010305848,0.008804605,0.0003200466,0.0008551513,0.00000975743],"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.00004458785,0.000018778646,0.00059892336,0.00023893692,0.000025647618,0.000009701009,0.0003351035,0.86973405,0.00001947029,0.017401287,0.002770592,0.10880289],"study_design_scores_gemma":[0.00066452904,0.00017824624,0.0006796744,0.00026008973,0.000030215451,0.00030122182,0.0000808372,0.983572,0.000048739526,0.0050007883,0.00865174,0.00053194043],"about_ca_topic_score_codex":0.000010305876,"about_ca_topic_score_gemma":0.000005237737,"teacher_disagreement_score":0.91389275,"about_ca_system_score_codex":0.00010814102,"about_ca_system_score_gemma":0.00012461176,"threshold_uncertainty_score":0.9996847},"labels":[],"label_agreement":null},{"id":"W3212595576","doi":"","title":"Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Oracle; Softmax function; Mathematics; Reduction (mathematics); Computer science; Context (archaeology); Mathematical optimization; Convex optimization; Algorithm; Regular polygon; Artificial intelligence","score_opus":0.026584626937523424,"score_gpt":0.30573841595116885,"score_spread":0.2791537890136454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212595576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038230189,0.0008127297,0.9905883,0.00005354659,0.00094009726,0.00034352017,0.000004784874,0.0017355158,0.0016984621],"genre_scores_gemma":[0.71182084,0.000037614423,0.28757963,0.00012993145,0.00014219059,0.000107169886,0.00010857868,0.00003342686,0.000040628664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989379,0.000059853406,0.00053097965,0.00011494059,0.00013183749,0.00022447844],"domain_scores_gemma":[0.9990783,0.00006905096,0.0001645854,0.00018468472,0.00044861148,0.000054772125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024059044,0.000171799,0.00023061778,0.00012456995,0.00017259362,0.0004600282,0.000112251546,0.00010432539,0.0000036274066],"category_scores_gemma":[0.0000840663,0.00017247217,0.000058840884,0.00029687138,0.000012203858,0.0014840397,0.000021748336,0.00011518813,0.0000039200468],"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.000008546453,0.000014293608,0.000009253948,0.0006087227,0.000030194466,0.0000013624506,0.000984034,0.8517348,0.010472512,0.00034060783,0.0009929746,0.13480265],"study_design_scores_gemma":[0.0002077024,0.000022808352,0.000005261617,0.00018360809,0.000021175143,0.000060214814,0.00031800766,0.944812,0.0432035,0.00006027479,0.010907947,0.00019749091],"about_ca_topic_score_codex":0.0000071240934,"about_ca_topic_score_gemma":3.6979648e-7,"teacher_disagreement_score":0.7079978,"about_ca_system_score_codex":0.00008370138,"about_ca_system_score_gemma":0.00006073384,"threshold_uncertainty_score":0.70332104},"labels":[],"label_agreement":null},{"id":"W3212608195","doi":"","title":"Fair Algorithms for Multi-Agent Multi-Armed Bandits","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Regret; Sublinear function; Multi-armed bandit; Computer science; Nash equilibrium; Mathematical optimization; Social Welfare; Mathematical economics; Artificial intelligence; Algorithm; Mathematics; Machine learning; Discrete mathematics; Law","score_opus":0.3178937303358701,"score_gpt":0.4768734040535386,"score_spread":0.15897967371766852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212608195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030717384,0.0007228466,0.99220884,0.0004401992,0.0020317056,0.0010136727,0.00013711094,0.00020231864,0.0001715568],"genre_scores_gemma":[0.91702765,0.00003127621,0.066700436,0.0007126965,0.00069442973,0.0008499573,0.00036899894,0.00006318709,0.013551339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495983,0.0001976643,0.0016269413,0.00048545457,0.0020919996,0.00063813815],"domain_scores_gemma":[0.9945136,0.00051964616,0.0007355689,0.00053556345,0.0034376173,0.00025805802],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019557537,0.00028102935,0.00047750314,0.00044019325,0.0006819244,0.0021933727,0.0007167211,0.0001727831,0.00005060016],"category_scores_gemma":[0.004486904,0.00021653077,0.00016939348,0.0013171353,0.00010472837,0.0052282196,0.00017972798,0.00027983348,0.00040514616],"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.000112038,0.00027335563,0.00090576085,0.00082338165,0.000055385233,0.000035905774,0.0059637274,0.08091226,0.0010626186,0.00016144222,0.012355158,0.897339],"study_design_scores_gemma":[0.0017917068,0.000049491253,0.0008369175,0.000073120085,0.00000715734,0.00007989419,0.0036781223,0.91362035,0.001996765,0.0000718389,0.07752557,0.0002690395],"about_ca_topic_score_codex":0.000017887185,"about_ca_topic_score_gemma":0.000010951975,"teacher_disagreement_score":0.92550844,"about_ca_system_score_codex":0.00018458211,"about_ca_system_score_gemma":0.0003871471,"threshold_uncertainty_score":0.9988424},"labels":[],"label_agreement":null},{"id":"W3212694181","doi":"","title":"Clockwork Variational Autoencoders","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Generative Adversarial Networks and Image Synthesis","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":"Clockwork; Computer science; Artificial intelligence; Benchmark (surveying); Abstraction; Hierarchy; Machine learning; Term (time); Pattern recognition (psychology)","score_opus":0.013093083608344295,"score_gpt":0.22171116450240272,"score_spread":0.20861808089405842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212694181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020706082,0.0002862825,0.9912028,0.0012132549,0.0012524537,0.00008831304,0.0000024654419,0.00017398519,0.0055734026],"genre_scores_gemma":[0.9587415,0.0000057798507,0.039439443,0.0010609102,0.0002687009,0.000024071856,0.000031021773,0.0000050589683,0.00042354225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883586,0.00008417141,0.0003865886,0.00015393778,0.00034054279,0.00019891736],"domain_scores_gemma":[0.99899924,0.000043187418,0.00021168325,0.00021668497,0.00046371884,0.00006548038],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021048402,0.00011284018,0.00013202419,0.00006746174,0.0002963244,0.0012761756,0.00028164557,0.00005743345,0.000013627841],"category_scores_gemma":[0.00008784827,0.00010228343,0.000045086217,0.000509565,0.000017712473,0.0047307094,0.00008191619,0.00009876495,0.00007250543],"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.0000054240254,0.00003253459,0.00021233421,0.00015671823,0.000027228174,0.000009324499,0.0025164094,0.8169525,0.00030116207,0.03619929,0.011258371,0.13232869],"study_design_scores_gemma":[0.00014307589,0.000009356185,0.00033535855,0.00003544689,0.0000034093669,0.000045333367,0.00015211738,0.9729714,0.00029179238,0.00018678188,0.02570165,0.00012430496],"about_ca_topic_score_codex":0.000012944093,"about_ca_topic_score_gemma":9.786557e-7,"teacher_disagreement_score":0.9585344,"about_ca_system_score_codex":0.00004333365,"about_ca_system_score_gemma":0.00020519468,"threshold_uncertainty_score":0.99976057},"labels":[],"label_agreement":null},{"id":"W3212707937","doi":"","title":"On Empirical Risk Minimization with Dependent and Heavy-Tailed Data","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Statistical Methods and Inference","field":"Mathematics","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":"Empirical risk minimization; Independent and identically distributed random variables; Heavy-tailed distribution; Minification; Multiplier (economics); Mixing (physics); Computer science; Mathematics; Applied mathematics; Econometrics; Mathematical optimization; Statistical physics; Statistics; Random variable; Physics","score_opus":0.13488903632227647,"score_gpt":0.38727390732712047,"score_spread":0.25238487100484397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212707937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17607963,0.00013578155,0.8197831,0.0003247536,0.00024447739,0.0003570844,0.00013202458,0.00014854256,0.002794615],"genre_scores_gemma":[0.95836127,0.000011617372,0.041103348,0.00026631684,0.000052679326,0.000020494805,0.000096530406,0.000011473602,0.00007627631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987207,0.00016053977,0.0004427569,0.00018058236,0.0003477703,0.00014763641],"domain_scores_gemma":[0.9985067,0.0005140588,0.00030797964,0.0003244396,0.00026897652,0.00007783623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035411553,0.00012703176,0.00020459807,0.000051127314,0.00017609462,0.00041962686,0.000120833436,0.00006638059,0.000016532178],"category_scores_gemma":[0.002050167,0.00008969393,0.000009001696,0.00018093015,0.000028537126,0.0008784842,0.00006863523,0.00015974941,0.000010007368],"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.0013917963,0.00059609656,0.029951649,0.009782941,0.00020172191,0.00007393539,0.011405159,0.005167222,0.0001127327,0.14721854,0.021847414,0.7722508],"study_design_scores_gemma":[0.0011214549,0.00023546121,0.0017498279,0.00055304024,0.00008682967,0.00019688372,0.0014121772,0.98337966,0.00035218266,0.008967145,0.0015920458,0.00035331183],"about_ca_topic_score_codex":0.000010462589,"about_ca_topic_score_gemma":0.00000513749,"teacher_disagreement_score":0.9782124,"about_ca_system_score_codex":0.000024313844,"about_ca_system_score_gemma":0.00008944558,"threshold_uncertainty_score":0.40464714},"labels":[],"label_agreement":null},{"id":"W3213182304","doi":"","title":"Neural Algorithmic Reasoners are Implicit Planners","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Explainable Artificial Intelligence (XAI)","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Bottleneck; Computer science; Reinforcement learning; Computation; Graph; Artificial intelligence; Machine learning; Theoretical computer science; Algorithm","score_opus":0.02233425019800933,"score_gpt":0.26249117948677364,"score_spread":0.2401569292887643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213182304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1664288,0.0020049922,0.80116636,0.0069797165,0.006270987,0.0011224028,0.000034485027,0.002423507,0.013568739],"genre_scores_gemma":[0.9965331,0.0000077839595,0.0016794994,0.0011241909,0.0001659813,0.00005754923,0.000033034008,0.000012688141,0.00038616432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779916,0.00009806249,0.0007352105,0.0003094073,0.0005545674,0.00050356967],"domain_scores_gemma":[0.9981201,0.0000577217,0.0005066994,0.00049732154,0.00065512885,0.00016300737],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00030780223,0.00023025164,0.00026384176,0.00019098037,0.00041434253,0.0019769997,0.00071750546,0.00011476686,0.000006430515],"category_scores_gemma":[0.00015715408,0.00021931909,0.00007393774,0.0010199003,0.00004576534,0.0076843323,0.00016982341,0.00024831388,0.00020940602],"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.00005779633,0.00016632958,0.0029610915,0.002215146,0.00008193741,0.00041259849,0.022900289,0.20267664,0.0060841343,0.049842305,0.02175617,0.69084555],"study_design_scores_gemma":[0.0001405023,0.00003400572,0.000333451,0.0001341742,0.0000053877575,0.0004197939,0.003649753,0.97985345,0.0046605812,0.00014368052,0.010310226,0.00031499862],"about_ca_topic_score_codex":0.000116170624,"about_ca_topic_score_gemma":0.000009023973,"teacher_disagreement_score":0.8301043,"about_ca_system_score_codex":0.00012980164,"about_ca_system_score_gemma":0.00018316429,"threshold_uncertainty_score":0.999059},"labels":[],"label_agreement":null},{"id":"W3213541187","doi":"","title":"Your head is there to move you around: Goal-driven models of the primate dorsal pathway","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Visual perception and processing mechanisms","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Neuroscience; Dorsum; Stimulus (psychology); Artificial intelligence; Primate; Artificial neural network; Visual system; Contrast (vision); Pattern recognition (psychology); Visual cortex; Psychology; Biology; Cognitive psychology; Anatomy","score_opus":0.0736994860117204,"score_gpt":0.32408595465762324,"score_spread":0.25038646864590286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213541187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9646039,0.00018589733,0.021170879,0.0018207119,0.0016028206,0.00080174656,0.00013977148,0.00030082362,0.00937345],"genre_scores_gemma":[0.9946111,0.000007761284,0.00014664998,0.0038243153,0.000064265274,0.000039932896,0.00000887823,0.000019973788,0.001277118],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781114,0.00014818097,0.000728794,0.0002661082,0.0007342291,0.0003115211],"domain_scores_gemma":[0.9986445,0.000028585255,0.00050088356,0.00034684315,0.00038369323,0.0000955088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021688452,0.00021984983,0.0002646243,0.00009966493,0.00042036164,0.00065954175,0.00041845726,0.000120798206,0.000028542492],"category_scores_gemma":[0.00014363704,0.00015676992,0.000098140525,0.00072379614,0.00005735166,0.0024295223,0.00013628688,0.00022152963,0.0001041705],"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.00015798138,0.00020745609,0.00027237975,0.003353666,0.000015678781,0.000008290514,0.059642006,0.10986288,0.7021099,0.008459602,0.0009665169,0.11494367],"study_design_scores_gemma":[0.000622247,0.00008449959,0.00026578206,0.00069265044,0.0000142540775,0.00014530629,0.004632769,0.636125,0.3485633,0.0007027961,0.007759029,0.00039233378],"about_ca_topic_score_codex":0.000030904965,"about_ca_topic_score_gemma":0.0000018195148,"teacher_disagreement_score":0.5262621,"about_ca_system_score_codex":0.000073535884,"about_ca_system_score_gemma":0.0002379397,"threshold_uncertainty_score":0.6392892},"labels":[],"label_agreement":null},{"id":"W3213695764","doi":"","title":"Local Hyper-Flow Diffusion","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Waterloo","funders":"","keywords":"Hypergraph; Cluster analysis; Computer science; Mathematical optimization; Mathematics; Flow (mathematics); Interpretation (philosophy); Theoretical computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.010921004371104577,"score_gpt":0.2441491110590466,"score_spread":0.23322810668794203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213695764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1040904,0.00032380037,0.8632712,0.0002399046,0.00036526326,0.0002261958,0.00001543262,0.00037654195,0.031091297],"genre_scores_gemma":[0.99849,0.000001166146,0.0005674392,0.000106851134,0.00019295125,0.000030063682,0.00020945733,0.0000076968545,0.00039437972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990202,0.000040364706,0.00041846352,0.000109615845,0.00023346249,0.00017789699],"domain_scores_gemma":[0.99926966,0.000016956166,0.0002044231,0.00017965389,0.00027351803,0.00005578882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009853998,0.00012317197,0.00018185098,0.00006721212,0.0002001755,0.00039623815,0.00010906631,0.00003527615,0.00011665927],"category_scores_gemma":[0.0000044381804,0.000110643334,0.000074609314,0.00033562205,0.000025701853,0.0010974321,0.000060620852,0.00012517335,0.00006026063],"study_design_candidate":"design_other","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.000009050571,0.00006044921,0.007140832,0.00018064579,0.000028301936,0.0000015669522,0.000760202,0.018343586,0.0005290466,0.004254452,0.006594924,0.9620969],"study_design_scores_gemma":[0.0001970536,0.0000110954525,0.00034139352,0.000094228475,0.000019551308,0.0000112155885,0.001063217,0.9392053,0.0011631827,0.00024061846,0.057477348,0.00017582698],"about_ca_topic_score_codex":0.00007341339,"about_ca_topic_score_gemma":0.0000014596096,"teacher_disagreement_score":0.9619211,"about_ca_system_score_codex":0.000030854808,"about_ca_system_score_gemma":0.000059855753,"threshold_uncertainty_score":0.4511904},"labels":[],"label_agreement":null},{"id":"W3213792049","doi":"","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Adversarial system; Minimax; Computer science; Robustness (evolution); Mathematical optimization; Robust optimization; Simplex; Optimization problem; Set (abstract data type); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.020611067852627677,"score_gpt":0.2633538074082902,"score_spread":0.2427427395556625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213792049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031853432,0.0002611031,0.9908382,0.000696943,0.0025326465,0.00021736475,0.0000059180625,0.00035960553,0.0019028601],"genre_scores_gemma":[0.958625,0.000009287426,0.0388914,0.0006701972,0.00052887044,0.000038817234,0.000546679,0.000018737395,0.0006709838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980163,0.00017598478,0.00068110274,0.00028206507,0.00056597946,0.0002785821],"domain_scores_gemma":[0.998432,0.00004101906,0.0005237062,0.00034707456,0.000565727,0.000090510126],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00033236045,0.00020118093,0.00021466146,0.00012129543,0.00044364677,0.0016385444,0.0004314796,0.00014639755,0.000020628311],"category_scores_gemma":[0.00027130014,0.00020500398,0.0000527769,0.0006484771,0.00002660172,0.008158121,0.00014944443,0.00022440958,0.000047316636],"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.0000054944903,0.000013268707,0.000052142655,0.00008379207,0.000007442698,0.0000029966538,0.0011322193,0.9767521,0.0005749878,0.0005852501,0.0064748875,0.014315389],"study_design_scores_gemma":[0.00052282074,0.000022859254,0.000011571498,0.00004190437,0.0000074915274,0.00005367284,0.00019828233,0.9835453,0.00063930155,0.0000046899395,0.014727495,0.00022462946],"about_ca_topic_score_codex":0.00002360441,"about_ca_topic_score_gemma":0.0000012764299,"teacher_disagreement_score":0.9554397,"about_ca_system_score_codex":0.00012814265,"about_ca_system_score_gemma":0.00021020192,"threshold_uncertainty_score":0.9993979},"labels":[],"label_agreement":null},{"id":"W3213829125","doi":"","title":"Predicting Molecular Conformation via Dynamic Graph Score Matching","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Computational Drug Discovery Methods","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Matching (statistics); Graph; Artificial intelligence; Pattern recognition (psychology); Mathematics; Theoretical computer science; Statistics","score_opus":0.013560772634569672,"score_gpt":0.27384176623583933,"score_spread":0.26028099360126966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213829125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18668245,0.00032070812,0.81015456,0.00027204485,0.0007789975,0.00019428262,0.000004198047,0.00034255392,0.0012501848],"genre_scores_gemma":[0.9843723,0.0000037502539,0.0149237495,0.0005035778,0.000033736233,0.000032801752,0.0000996769,0.000009370241,0.000021039365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978516,0.00017618823,0.00080076524,0.0002117211,0.0006793909,0.00028033112],"domain_scores_gemma":[0.99839324,0.00009207284,0.0005249142,0.00031207956,0.0005881357,0.0000895541],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005730367,0.00018975894,0.00020404843,0.00024499468,0.00032101816,0.0012484379,0.00044116488,0.00007869011,0.0000023857597],"category_scores_gemma":[0.000101400234,0.00019195734,0.00007626694,0.0008734398,0.000025262201,0.010108095,0.00018466878,0.00021512108,0.00003426617],"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.0000056624604,0.0000197035,0.00028328158,0.0008213499,0.000020153619,0.000014560107,0.0043612225,0.83355093,0.0021837421,0.01148998,0.000043875218,0.14720556],"study_design_scores_gemma":[0.00023343484,0.000014916347,0.001072944,0.00018362181,0.0000063684874,0.0003357161,0.0003930932,0.99366754,0.00097178237,0.0026933197,0.0002242732,0.0002029697],"about_ca_topic_score_codex":0.000026192278,"about_ca_topic_score_gemma":0.0000016035613,"teacher_disagreement_score":0.79768986,"about_ca_system_score_codex":0.00010743051,"about_ca_system_score_gemma":0.00022809494,"threshold_uncertainty_score":0.99978834},"labels":[],"label_agreement":null},{"id":"W3214135126","doi":"","title":"Joint Modeling of Visual Objects and Relations for Scene Graph Generation","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Geographic Information Systems Studies","field":"Social Sciences","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":"HEC Montréal","funders":"","keywords":"Computer science; Joint (building); Artificial intelligence; Computer vision; Graph; Graph theory; Scene graph; Theoretical computer science; Mathematics; Engineering; Combinatorics","score_opus":0.06235957478073229,"score_gpt":0.3135556497437372,"score_spread":0.2511960749630049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214135126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.704674,0.0033911765,0.25321433,0.0015656636,0.0027879584,0.0026615001,0.000060773833,0.00042306117,0.031221505],"genre_scores_gemma":[0.99871606,0.000041417552,0.0006742223,0.000080724036,0.00015239239,0.000095443174,0.00006743917,0.0000052788796,0.00016704485],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984098,0.00007190458,0.0008227301,0.00009749115,0.00040113894,0.00019691691],"domain_scores_gemma":[0.99774647,0.000042897555,0.00048002834,0.000078333134,0.0015937922,0.00005849658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079336617,0.00010286702,0.00021305383,0.00023599635,0.0010261488,0.00034849654,0.000053358213,0.00010195275,0.0000029611322],"category_scores_gemma":[0.0003381526,0.00010168881,0.000058124486,0.0005033888,0.00008128538,0.002760754,0.000024347273,0.00006719559,0.0000034380068],"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.000059269863,0.00013304941,0.0065683303,0.006017613,0.00021318397,0.0000011977017,0.46532223,0.32321706,0.002979287,0.14369316,0.0026667768,0.049128853],"study_design_scores_gemma":[0.0003916445,0.000029696004,0.00016102551,0.00016000982,0.000021841748,0.000008086658,0.04958042,0.9470968,0.00016637181,0.00020074681,0.0020325303,0.00015083035],"about_ca_topic_score_codex":0.00036609793,"about_ca_topic_score_gemma":0.00012800483,"teacher_disagreement_score":0.62387973,"about_ca_system_score_codex":0.00004389577,"about_ca_system_score_gemma":0.00019677164,"threshold_uncertainty_score":0.789241},"labels":[],"label_agreement":null},{"id":"W3214251933","doi":"","title":"A Minimalist Approach to Offline Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Data Stream Mining Techniques","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":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Leverage (statistics); Hyperparameter; Offline learning; Artificial intelligence; Machine learning; Online algorithm; Algorithm; Online learning","score_opus":0.025813524807456505,"score_gpt":0.2637669248935865,"score_spread":0.23795340008613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214251933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002141961,0.00007407402,0.9645148,0.00036326074,0.00023827449,0.00025681115,0.0000028899435,0.0008675569,0.031540394],"genre_scores_gemma":[0.9230214,0.000002337871,0.07497847,0.0007852377,0.00006940483,0.00010938587,0.00016225906,0.00000856117,0.00086297165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837744,0.000059404956,0.0005929953,0.0002301393,0.0004663797,0.00027366678],"domain_scores_gemma":[0.9987475,0.000022256621,0.00028332102,0.00042736367,0.00040571627,0.0001138441],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036730952,0.00015796277,0.00019091889,0.00017884586,0.0002207346,0.0015583378,0.00062260864,0.0000618116,0.0000021551648],"category_scores_gemma":[0.00018946936,0.00014937817,0.00003532667,0.0007530973,0.000016164424,0.0040916265,0.0003519015,0.00016849521,0.00006179308],"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.00005116647,0.00022580636,0.0009384174,0.0035384046,0.000064089356,0.00003652716,0.032207776,0.26251242,0.0032167886,0.09070986,0.06704326,0.5394555],"study_design_scores_gemma":[0.00016756407,0.00007189308,0.0000891969,0.00014614536,0.000003856539,0.00015632763,0.0004702542,0.91399467,0.0018973927,0.000013844851,0.082761884,0.00022694658],"about_ca_topic_score_codex":0.000032062704,"about_ca_topic_score_gemma":4.1283405e-7,"teacher_disagreement_score":0.9208794,"about_ca_system_score_codex":0.00007811743,"about_ca_system_score_gemma":0.00013013769,"threshold_uncertainty_score":0.99947816},"labels":[],"label_agreement":null},{"id":"W3214266825","doi":"","title":"ATISS: Autoregressive Transformers for Indoor Scene Synthesis","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"3D Surveying and Cultural Heritage","field":"Earth and Planetary Sciences","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":"Computer science; Autoregressive model; Transformer; Texture synthesis; Minimum bounding box; Permutation (music); Floor plan; Architecture; Artificial intelligence; Embedding; Computer vision; Algorithm; Image (mathematics); Engineering drawing; Image processing; Engineering; Mathematics","score_opus":0.02360552716175293,"score_gpt":0.23050804853210158,"score_spread":0.20690252137034865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214266825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8988741,0.010240058,0.020219516,0.0023443648,0.0060420693,0.002503307,0.0019515788,0.0011701812,0.056654792],"genre_scores_gemma":[0.99852484,0.000015600439,0.00038353473,0.00020073172,0.00010046048,0.00002269681,0.00033622014,0.0000034605655,0.00041242823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885637,0.00006689484,0.00041144225,0.000132673,0.00026204716,0.00027057543],"domain_scores_gemma":[0.9992278,0.00014669423,0.00018650421,0.00006913296,0.0002695874,0.00010028301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026453877,0.00014233973,0.00020028136,0.000051034618,0.00038716593,0.0004949366,0.0001029529,0.00009149294,0.00013966554],"category_scores_gemma":[0.00020553166,0.00010699056,0.00006854277,0.00019815857,0.000034961377,0.0020798086,0.0000028451343,0.000094182724,0.000075107615],"study_design_candidate":"design_other","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.000056934983,0.000008482414,0.014492029,0.0010875758,0.00002217161,0.000004939181,0.0018724245,0.0027206817,0.00009618526,0.00003638611,0.0014705466,0.97813165],"study_design_scores_gemma":[0.0009875438,0.00017288783,0.071564406,0.001146205,0.00007625289,0.00030337987,0.0121436585,0.8302652,0.003944431,0.00004141729,0.07842078,0.0009338308],"about_ca_topic_score_codex":0.0001710964,"about_ca_topic_score_gemma":0.00012443509,"teacher_disagreement_score":0.9771978,"about_ca_system_score_codex":0.000009749598,"about_ca_system_score_gemma":0.000108337794,"threshold_uncertainty_score":0.4772685},"labels":[],"label_agreement":null},{"id":"W3214379748","doi":"","title":"Are My Deep Learning Systems Fair? An Empirical Study of Fixed-Seed Training","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":20,"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":"Training (meteorology); Computer science; Artificial intelligence; Machine learning; Geography","score_opus":0.11610215058101943,"score_gpt":0.4009260998072039,"score_spread":0.2848239492261845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214379748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886097,0.0003057866,0.0005978748,0.0005136672,0.00090941513,0.00046799675,0.0000037535317,0.00022220216,0.008369637],"genre_scores_gemma":[0.9991314,0.000008438706,0.00002018272,0.00018645718,0.00031269604,0.000025430407,0.000017134344,0.000012713317,0.00028555217],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99683374,0.00079273,0.000827912,0.00017178114,0.0010024012,0.0003714438],"domain_scores_gemma":[0.9968427,0.00015751325,0.0010758316,0.0001482485,0.0015748441,0.00020087461],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001762167,0.0001560664,0.00040500556,0.00012988332,0.0013551626,0.0016013448,0.00025087828,0.0002379437,0.0000067773676],"category_scores_gemma":[0.0015706607,0.00015082794,0.000058014168,0.00064153405,0.00012041399,0.0043622144,0.000040692015,0.00046355987,0.000008002753],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021161488,0.00018145755,0.040221207,0.0006500392,0.000039619765,0.000013461491,0.9214987,0.026498614,0.00006704327,0.0015260142,0.00008791021,0.0091947485],"study_design_scores_gemma":[0.00045432898,0.00015938366,0.0083895475,0.00022845366,0.000023397517,0.000007688347,0.9429666,0.043468967,0.000007099716,0.00004143728,0.0040386496,0.00021445271],"about_ca_topic_score_codex":0.0015208912,"about_ca_topic_score_gemma":0.00066830043,"teacher_disagreement_score":0.03183166,"about_ca_system_score_codex":0.000113297596,"about_ca_system_score_gemma":0.00038799515,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W3214485347","doi":"","title":"Dynamic Inference with Neural Interpreters","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Inference; Artificial neural network; Interpreter; Artificial intelligence; Leverage (statistics); Unary operation; Transformer; Generalization; Reuse; Machine learning; Programming language; Mathematics","score_opus":0.010235428346110546,"score_gpt":0.24974414536721334,"score_spread":0.2395087170211028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214485347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07636534,0.00029580097,0.91760504,0.002029182,0.0005674866,0.0003004887,0.0000051850548,0.0005332574,0.0022982117],"genre_scores_gemma":[0.9961698,0.0000052266146,0.0027372031,0.00082157244,0.000024029287,0.00006128735,0.0000245777,0.0000060446205,0.00015023677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988549,0.000038098828,0.00038134697,0.00020004509,0.00028216754,0.00024345388],"domain_scores_gemma":[0.9989666,0.000042793676,0.00024228325,0.0003571098,0.00030399818,0.000087256776],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00007855198,0.00015017088,0.0001498091,0.00007263934,0.00022026073,0.0013603764,0.0004573439,0.000046159188,0.0000028849074],"category_scores_gemma":[0.000017979764,0.000117181175,0.000032537075,0.0006451674,0.00003675127,0.004318029,0.00011571247,0.00017357692,0.00003175656],"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.000032949923,0.00008237405,0.0015586175,0.00088788295,0.000038439797,0.000046852096,0.0051672375,0.21622467,0.002247364,0.027609935,0.0018080197,0.74429566],"study_design_scores_gemma":[0.00016106707,0.000036932837,0.00037631183,0.000107042426,0.0000037651205,0.00019584355,0.00015561705,0.99519724,0.00016479813,0.000054953354,0.0033781962,0.00016821623],"about_ca_topic_score_codex":0.000011276952,"about_ca_topic_score_gemma":0.0000051021793,"teacher_disagreement_score":0.91980445,"about_ca_system_score_codex":0.000039961404,"about_ca_system_score_gemma":0.000098649856,"threshold_uncertainty_score":0.9996763},"labels":[],"label_agreement":null},{"id":"W3214578629","doi":"","title":"AC-GC: Lossy Activation Compression with Guaranteed Convergence","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lossy compression; Convergence (economics); Computer science; Compression (physics); Data compression; Algorithm; Materials science; Artificial intelligence; Composite material","score_opus":0.023896276554672857,"score_gpt":0.2975382174979012,"score_spread":0.27364194094322836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214578629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7116913,0.00031346516,0.25911272,0.013341628,0.0003855705,0.0016294173,0.000018283716,0.0013205279,0.01218708],"genre_scores_gemma":[0.9951518,0.000011562281,0.0026494956,0.0014487881,0.0000889873,0.00008796702,0.00017165016,0.000009573157,0.00038013558],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888676,0.000023834895,0.00040306596,0.00013234638,0.00039723478,0.00015677625],"domain_scores_gemma":[0.9989068,0.000022541299,0.00024534634,0.00021938852,0.0005041323,0.00010177516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011502707,0.000117558644,0.00019161297,0.000057144105,0.00016904464,0.00015068753,0.00007365194,0.000073440635,0.00004096088],"category_scores_gemma":[0.000068889676,0.00008511273,0.000028346569,0.00038500252,0.000058422036,0.00087903114,0.000024851144,0.00019660614,0.00002961797],"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.0013816115,0.0011565108,0.04443843,0.02184864,0.00023790276,0.00016329909,0.009515605,0.0030792796,0.4107557,0.011915391,0.1724406,0.323067],"study_design_scores_gemma":[0.002510167,0.00022455909,0.004717177,0.004591085,0.00010088756,0.0015812163,0.0019431793,0.694758,0.08517537,0.00006440373,0.20383425,0.00049971114],"about_ca_topic_score_codex":0.000024761437,"about_ca_topic_score_gemma":2.9929686e-7,"teacher_disagreement_score":0.6916787,"about_ca_system_score_codex":0.000044980083,"about_ca_system_score_gemma":0.00015582154,"threshold_uncertainty_score":0.34707963},"labels":[],"label_agreement":null},{"id":"W3214579609","doi":"","title":"Self-Instantiated Recurrent Units with Dynamic Soft Recursion","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Recursion (computer science); Parallel computing; Theoretical computer science; Programming language","score_opus":0.012425024326310827,"score_gpt":0.2156978901110866,"score_spread":0.20327286578477577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214579609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.400676,0.0093292305,0.5595578,0.0002608308,0.0047771493,0.0012331181,0.00006480181,0.0047112117,0.019389829],"genre_scores_gemma":[0.9990876,0.00008952004,0.0005029576,0.000039091272,0.00002647287,0.000017767255,0.00012113574,0.000018002342,0.00009747012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989936,0.000025295443,0.0003952216,0.00010190151,0.00027010898,0.00021391641],"domain_scores_gemma":[0.999204,0.000010855808,0.00010322638,0.00015641161,0.00045827072,0.00006722947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009505051,0.00015916313,0.00015720235,0.00008889723,0.00013242349,0.0003322607,0.00010247192,0.000075306656,0.000009785784],"category_scores_gemma":[0.000020088011,0.00013120161,0.000017186101,0.0006258393,0.000012727484,0.001345602,0.000014992388,0.00017616535,0.000045079978],"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.00003920756,0.00004146106,0.00019111684,0.0060716593,0.00007065312,0.00003146144,0.005903397,0.64734477,0.00085799297,0.0006969804,0.0011487234,0.33760256],"study_design_scores_gemma":[0.00015435244,0.000036928337,0.000046599656,0.00038520255,0.000010883001,0.00013338457,0.0006079742,0.9751242,0.0013357659,0.000005153628,0.02195719,0.00020239246],"about_ca_topic_score_codex":0.00000452994,"about_ca_topic_score_gemma":0.000005804121,"teacher_disagreement_score":0.59841156,"about_ca_system_score_codex":0.00009103913,"about_ca_system_score_gemma":0.00007860172,"threshold_uncertainty_score":0.53502464},"labels":[],"label_agreement":null},{"id":"W3214608036","doi":"","title":"Joint Semantic Mining for Weakly Supervised RGB-D Salient Object Detection","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Visual Attention and Saliency Detection","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":"University of Alberta","funders":"","keywords":"Computer science; Joint (building); Artificial intelligence; Object detection; Object (grammar); Pattern recognition (psychology); Salient; Computer vision; Data mining; Natural language processing; Engineering; Structural engineering","score_opus":0.03477239714532766,"score_gpt":0.26834560590698175,"score_spread":0.2335732087616541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214608036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1453739,0.00013341318,0.8501405,0.00039063266,0.0024588897,0.00041637462,0.0000025510174,0.00047755142,0.0006061974],"genre_scores_gemma":[0.9972115,0.0000034623793,0.001801408,0.00044558436,0.00011717807,0.00012344688,0.000024648967,0.000009555777,0.00026322278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982404,0.000087102424,0.0007151721,0.0002539331,0.00041143032,0.00029197775],"domain_scores_gemma":[0.99866134,0.000031673142,0.00033555017,0.00025335074,0.00063173694,0.0000863482],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042979955,0.00016904177,0.00021059341,0.00022037319,0.0004901711,0.0012963901,0.00021021717,0.000094070034,0.0000042612364],"category_scores_gemma":[0.00012978473,0.00015927333,0.00011281229,0.0006627433,0.000017040944,0.0037715335,0.00006592561,0.0001065711,0.000046944268],"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.000048443195,0.00017226153,0.00036899434,0.0036664628,0.000060424965,0.000010707489,0.014072978,0.01551605,0.1199279,0.00387515,0.001679164,0.84060144],"study_design_scores_gemma":[0.00047847565,0.00012042724,0.0005891355,0.0001464515,0.000010413817,0.00013552028,0.001347535,0.9679384,0.025883075,0.000069739304,0.0030584729,0.00022234162],"about_ca_topic_score_codex":0.000019910605,"about_ca_topic_score_gemma":0.000008465004,"teacher_disagreement_score":0.9524224,"about_ca_system_score_codex":0.000099354256,"about_ca_system_score_gemma":0.0001137347,"threshold_uncertainty_score":0.99974036},"labels":[],"label_agreement":null}]}