{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08981053,0.0024276446,0.87478226,0.0025469852,0.00051497953,0.00011768246,0.0010943607,0.0044628736,0.024242703],"genre_scores_gemma":[0.7970391,0.00056111935,0.18982632,0.00066266133,0.00030145037,0.00013742747,0.0014914154,0.00039561657,0.009584848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.00017462617,0.000016658883,0.000087863504,0.00012547013,0.000057301386],"domain_scores_gemma":[0.99794847,0.001324676,0.00013214641,0.00029501755,0.00019097513,0.00010873447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276246,0.0005951639,0.0013415662,0.0015036794,0.0009866153,0.001577981,0.0016446532,0.0022791123,0.0063434914],"category_scores_gemma":[0.006179941,0.0005645388,0.0011574902,0.0013999082,0.00083212863,0.0027808722,0.0018221637,0.0016904386,0.0018400967],"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.0010936391,0.00029836307,0.00461563,0.00058588467,0.00052924815,0.0007301211,0.00019512454,0.25816166,0.0046457546,0.3671844,0.0357455,0.3262148],"study_design_scores_gemma":[0.00006426134,0.000014715144,0.00017377968,0.000018453546,0.000031042437,0.000038798906,0.000014052702,0.7078544,0.0007133179,0.289528,0.0015400468,0.000009213526],"about_ca_topic_score_codex":0.00095952745,"about_ca_topic_score_gemma":0.001766474,"teacher_disagreement_score":0.0063434914,"about_ca_system_score_codex":0.00055989635,"about_ca_system_score_gemma":0.00078024965,"threshold_uncertainty_score":0.021221042},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037417412,0.0006511424,0.9909189,0.0016186079,0.00009125115,0.00010387314,0.00022944102,0.00019435023,0.002450815],"genre_scores_gemma":[0.0880386,0.0008861738,0.9074914,0.00085186097,0.0003902321,0.0007049525,0.00065775885,0.00013218295,0.00084684294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9734018,0.0094330385,0.0037664887,0.0044299955,0.008156549,0.0008121577],"domain_scores_gemma":[0.9396952,0.030070657,0.0066092666,0.012233023,0.010094877,0.0012970302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02813102,0.0019148435,0.002549851,0.008247268,0.0035668467,0.009385272,0.007253961,0.005496571,0.002826716],"category_scores_gemma":[0.0516832,0.0013603509,0.0036571678,0.008383105,0.017726589,0.018197214,0.005802618,0.00820783,0.0011118847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002268387,0.000029090577,0.00081539684,0.0002726815,0.000054071355,0.000036680558,0.0003048441,0.007677815,0.00057946926,0.9724894,0.001541748,0.01617609],"study_design_scores_gemma":[0.000021223532,0.000064007974,0.00051911717,0.00013667163,0.000040516737,0.00015698154,0.0001379918,0.03699968,0.001149011,0.9529071,0.007808596,0.000059049406],"about_ca_topic_score_codex":0.0022437135,"about_ca_topic_score_gemma":0.0013234667,"teacher_disagreement_score":0.02813102,"about_ca_system_score_codex":0.004895412,"about_ca_system_score_gemma":0.0034507578,"threshold_uncertainty_score":0.14877284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004108158,0.00060491037,0.9912657,0.00040411382,0.00011240343,0.000025169322,0.00016623862,0.0008216646,0.0024916194],"genre_scores_gemma":[0.46275547,0.0014186947,0.51804775,0.00074905937,0.00024161596,0.0002743793,0.0010104884,0.0005590029,0.014943525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994586,0.00015762198,0.000028004357,0.00014305416,0.00013665785,0.000076094126],"domain_scores_gemma":[0.99928623,0.00034700727,0.000051388626,0.00014107226,0.000118616445,0.000055705008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085485535,0.0008574966,0.0010229645,0.00039249987,0.0003147535,0.0013048887,0.0025355155,0.0015234359,0.0059006936],"category_scores_gemma":[0.0034623146,0.000594949,0.0007508397,0.0007179138,0.00080917316,0.002499249,0.0019591984,0.0026102941,0.0019583642],"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.00007915122,0.000062941974,0.00094364403,0.000106747866,0.00008023391,0.00007927239,0.000056841967,0.7655347,0.0028584271,0.11948928,0.00548503,0.105223775],"study_design_scores_gemma":[0.0000031109453,0.0000075391254,0.000036993013,0.0000063853763,0.000003600983,0.000015204375,0.0000021477326,0.96896905,0.0004626957,0.02923878,0.0012495049,0.0000050074436],"about_ca_topic_score_codex":0.0018958171,"about_ca_topic_score_gemma":0.0029449556,"teacher_disagreement_score":0.0059006936,"about_ca_system_score_codex":0.0007911952,"about_ca_system_score_gemma":0.0007481053,"threshold_uncertainty_score":0.019739747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101081515,0.00019017476,0.9862272,0.00037140818,0.000059358466,0.000055936875,0.00047833667,0.0010164203,0.00149297],"genre_scores_gemma":[0.51639986,0.00069809245,0.46549907,0.0007429844,0.00031084675,0.000798258,0.0027078246,0.0005161922,0.01232681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850863,0.00064808363,0.00007517381,0.00038235242,0.00027405965,0.00011161199],"domain_scores_gemma":[0.99778146,0.0013749318,0.00017626025,0.00039731734,0.00019442009,0.0000756003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025367697,0.0010113448,0.0012157746,0.0011165396,0.00043402892,0.0018417579,0.0039252914,0.001801184,0.004651243],"category_scores_gemma":[0.008755062,0.0006968254,0.0014142852,0.0017781013,0.001081588,0.003112356,0.002037663,0.0027897723,0.002248765],"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.0007663705,0.00031134905,0.002839805,0.0003650409,0.00033393115,0.0003258665,0.00036707512,0.5802077,0.0139439255,0.10083622,0.013609709,0.286093],"study_design_scores_gemma":[0.000016015765,0.000022631884,0.00023375821,0.00001131884,0.000023032897,0.000040812483,0.000009474785,0.9637141,0.0015561633,0.032825094,0.0015324902,0.000015133978],"about_ca_topic_score_codex":0.002743036,"about_ca_topic_score_gemma":0.0038698155,"teacher_disagreement_score":0.004651243,"about_ca_system_score_codex":0.0009531957,"about_ca_system_score_gemma":0.0009476447,"threshold_uncertainty_score":0.015559971},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018803371,0.00019378934,0.995404,0.00006647192,0.00007294569,0.00003319407,0.000032395208,0.0015818977,0.00073504844],"genre_scores_gemma":[0.10458073,0.00053155265,0.887506,0.00022255872,0.00014866696,0.00020607615,0.00021128546,0.00047249324,0.006120641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.00023489163,0.00005065771,0.00020271917,0.00035370397,0.00006748369],"domain_scores_gemma":[0.99891925,0.0005497921,0.00007899674,0.00015043207,0.00024338625,0.000058192076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967414,0.0015191089,0.0010908616,0.0010630277,0.00043755962,0.0013470742,0.002723686,0.001335224,0.004197994],"category_scores_gemma":[0.004823716,0.0010854783,0.0008653891,0.0011044613,0.0008026448,0.00335327,0.002090392,0.0024835262,0.0019434006],"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.00020152732,0.00019544715,0.00088427245,0.00024585857,0.00030208117,0.00016764003,0.00016523457,0.32870522,0.010076244,0.040845804,0.006217844,0.61199284],"study_design_scores_gemma":[0.00001168428,0.00003349121,0.00010300378,0.000012761179,0.000021320711,0.000030496216,0.000005504602,0.9834157,0.0027681193,0.011215631,0.0023678334,0.0000144279265],"about_ca_topic_score_codex":0.0044454327,"about_ca_topic_score_gemma":0.006182783,"teacher_disagreement_score":0.0044454327,"about_ca_system_score_codex":0.0006760239,"about_ca_system_score_gemma":0.00082449435,"threshold_uncertainty_score":0.014043629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011680272,0.00020189979,0.98387516,0.0007888148,0.000086796856,0.0012228201,0.00017143854,0.00030665813,0.0016661533],"genre_scores_gemma":[0.3860384,0.0003793767,0.6043751,0.0005920501,0.00021710212,0.007040646,0.00026291198,0.00009427972,0.0009999968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9295598,0.05498957,0.0017815685,0.0073616956,0.005001631,0.0013057997],"domain_scores_gemma":[0.55410236,0.37428597,0.024431905,0.039593767,0.0051937187,0.0023923318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.063548274,0.0023398742,0.002388628,0.0018046191,0.001447397,0.002680254,0.0058163796,0.00339638,0.0067512663],"category_scores_gemma":[0.23502307,0.0017285716,0.001319352,0.0015997391,0.007304707,0.0067204423,0.0036699225,0.004554027,0.0007748883],"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.0047050193,0.0013326573,0.006379976,0.0016254786,0.00065137807,0.00024647271,0.00032205833,0.3247532,0.009128816,0.57127875,0.002866557,0.07670959],"study_design_scores_gemma":[0.0011245711,0.0021508818,0.0007583995,0.000096815886,0.00017306257,0.00011716075,0.000056374647,0.52143013,0.0045072744,0.46659705,0.002916583,0.00007176928],"about_ca_topic_score_codex":0.0005570984,"about_ca_topic_score_gemma":0.000673999,"teacher_disagreement_score":0.063548274,"about_ca_system_score_codex":0.0041894154,"about_ca_system_score_gemma":0.004874994,"threshold_uncertainty_score":0.33607948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024745362,0.0002965282,0.9634707,0.0011636567,0.0000395271,0.000029945317,0.00016128493,0.00034607307,0.009747003],"genre_scores_gemma":[0.6727786,0.00085191533,0.29572225,0.00090212363,0.0002673777,0.00031842437,0.0005440084,0.00044253535,0.028172705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774843,0.0011385876,0.00007515442,0.00035206453,0.00046468087,0.00022100132],"domain_scores_gemma":[0.9937866,0.0039166636,0.00052107393,0.0008437482,0.0005540527,0.0003779315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046584983,0.0008655632,0.0017531259,0.0010642679,0.0013377953,0.0031299207,0.0026392997,0.0019062554,0.0069792215],"category_scores_gemma":[0.014389456,0.0010359386,0.0016745285,0.00095627067,0.0031248915,0.0058914484,0.0030560524,0.0037814674,0.0017702795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053233685,0.000028372375,0.00045811356,0.000037212576,0.000030824427,0.00009249529,0.00022015208,0.06418206,0.00058571046,0.9248014,0.001474347,0.008036081],"study_design_scores_gemma":[0.000021707248,0.000012821967,0.00015172562,0.000013782107,0.000011864874,0.000040609553,0.000017443297,0.4717038,0.00013113626,0.5266044,0.0012676431,0.00002304112],"about_ca_topic_score_codex":0.005118637,"about_ca_topic_score_gemma":0.004846626,"teacher_disagreement_score":0.0069792215,"about_ca_system_score_codex":0.002208023,"about_ca_system_score_gemma":0.0016705355,"threshold_uncertainty_score":0.024636805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075541437,0.00010018963,0.99067277,0.0001294087,0.000009810727,0.000007980843,0.00003461282,0.00010701105,0.0013840451],"genre_scores_gemma":[0.62869275,0.00093580055,0.36179665,0.00019668552,0.00008886175,0.00014114093,0.00031110167,0.00020727565,0.0076297047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994692,0.0002001014,0.000023286722,0.000086171436,0.00017861745,0.000042636726],"domain_scores_gemma":[0.9991566,0.00039390996,0.000097248405,0.00017498937,0.0001303563,0.00004696212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008837483,0.00079543126,0.00045826726,0.00037844066,0.00020144602,0.0007007939,0.0007583477,0.0005678783,0.0015608044],"category_scores_gemma":[0.004269637,0.00042757476,0.0003571318,0.0003996527,0.0014170463,0.0022705519,0.001555793,0.001661556,0.00042872658],"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.000051135932,0.000017073204,0.00026577731,0.000059373393,0.000021628335,0.00004871316,0.000054885655,0.7135185,0.0061645606,0.23753725,0.0014154009,0.040845606],"study_design_scores_gemma":[0.0000015017746,0.000006402193,0.00003396046,0.0000032643834,0.0000010432552,0.000007850439,0.0000032253065,0.96659976,0.0007012626,0.03219302,0.0004459182,0.0000026749135],"about_ca_topic_score_codex":0.0022524442,"about_ca_topic_score_gemma":0.0027815255,"teacher_disagreement_score":0.0022524442,"about_ca_system_score_codex":0.00095753104,"about_ca_system_score_gemma":0.0007561759,"threshold_uncertainty_score":0.006947398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006819125,0.000047111746,0.9989666,0.00004877766,0.00001078028,0.000007693041,0.0000088386905,0.000060512935,0.00016776624],"genre_scores_gemma":[0.10280136,0.00033611388,0.8928159,0.00016980743,0.00010760769,0.00021245006,0.00021376438,0.00027501656,0.003067938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982322,0.00076069677,0.000073036244,0.00029269356,0.0005403354,0.0001010415],"domain_scores_gemma":[0.99534446,0.0033534213,0.00027109572,0.00039569655,0.000520865,0.00011439529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046231416,0.001200033,0.0015260841,0.0011685581,0.00081627164,0.0020564338,0.003143798,0.001952035,0.0032862895],"category_scores_gemma":[0.018441701,0.0010573127,0.0009532193,0.0014619686,0.0017819835,0.0027439333,0.0024379012,0.0034563406,0.0011370054],"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.00007441537,0.00006482619,0.00063250534,0.000117493924,0.000081904705,0.00006541718,0.00009778284,0.69611406,0.0026247476,0.18119757,0.002385291,0.116544046],"study_design_scores_gemma":[0.0000074360278,0.0000056206245,0.000042045485,0.000004248452,0.0000031728805,0.000009927065,0.0000021669832,0.97700727,0.0003975873,0.0219941,0.00052093103,0.000005548223],"about_ca_topic_score_codex":0.0042783977,"about_ca_topic_score_gemma":0.005386085,"teacher_disagreement_score":0.0046231416,"about_ca_system_score_codex":0.0017032584,"about_ca_system_score_gemma":0.00236944,"threshold_uncertainty_score":0.024449825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015251159,0.00013311357,0.9830104,0.000093345276,0.000020341977,0.000040601644,0.000033102406,0.0007604167,0.0006574971],"genre_scores_gemma":[0.51531845,0.00017291821,0.4800616,0.00030169412,0.00007882555,0.00027304285,0.00039289906,0.00035661392,0.0030439978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981158,0.0007589697,0.00012827087,0.0004021817,0.00044830106,0.00014647121],"domain_scores_gemma":[0.9948672,0.0032342128,0.00039044674,0.000780602,0.0005629196,0.00016469389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035925321,0.00082748797,0.0016046995,0.0011529174,0.00051961583,0.0010513524,0.0021135744,0.0016127165,0.0027193143],"category_scores_gemma":[0.018038435,0.0005593749,0.0009525008,0.00092817657,0.001102064,0.0025617918,0.001952544,0.0015585367,0.001385371],"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.00042137565,0.00019669237,0.0016329847,0.00017695302,0.00010052543,0.00016076623,0.00017369367,0.6327961,0.0117016155,0.047683228,0.0027468523,0.30220926],"study_design_scores_gemma":[0.000010125126,0.000026962407,0.00011830695,0.0000051145726,0.00000433814,0.000035178422,0.000009408844,0.9852889,0.0024780387,0.011676493,0.00033981018,0.0000073563224],"about_ca_topic_score_codex":0.0017530875,"about_ca_topic_score_gemma":0.0015895973,"teacher_disagreement_score":0.0035925321,"about_ca_system_score_codex":0.0008275798,"about_ca_system_score_gemma":0.0012040931,"threshold_uncertainty_score":0.018999398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007782258,0.00005790996,0.9906855,0.00008848803,0.000027935886,0.000034262186,0.000009168648,0.0002673907,0.0010469491],"genre_scores_gemma":[0.5298639,0.0001256404,0.46499062,0.00028932327,0.00006363437,0.00024337452,0.00008311288,0.00014541678,0.0041949553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870837,0.00038258758,0.00008652303,0.00026880906,0.00043684433,0.00011688849],"domain_scores_gemma":[0.9965228,0.0021713166,0.0002860278,0.0005093619,0.00036592936,0.00014461714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024591382,0.00067106093,0.0011321504,0.00059713784,0.00033419958,0.0012035273,0.0021970554,0.0014962364,0.0026611062],"category_scores_gemma":[0.009931841,0.0005324236,0.0006099107,0.00050325907,0.0016785196,0.0024054593,0.001991589,0.0021480783,0.0005040884],"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.00028150986,0.00020674465,0.0011882557,0.00009420468,0.000059712766,0.00014461196,0.00018132315,0.56944543,0.0048804837,0.12621345,0.0014038198,0.29590052],"study_design_scores_gemma":[0.000011954947,0.000031036227,0.00004314151,0.0000050310873,0.0000036151923,0.000019744917,0.0000042806496,0.9863013,0.0010489413,0.012085716,0.0004403154,0.0000049222162],"about_ca_topic_score_codex":0.0019423595,"about_ca_topic_score_gemma":0.0014436734,"teacher_disagreement_score":0.0026611062,"about_ca_system_score_codex":0.0011977518,"about_ca_system_score_gemma":0.0012763464,"threshold_uncertainty_score":0.013005316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012918387,0.000111629335,0.99660873,0.00010159683,0.000060154078,0.00003241419,0.000029907922,0.00027119476,0.0014925047],"genre_scores_gemma":[0.097466335,0.0003926658,0.8923697,0.00024288436,0.00018288069,0.00035316826,0.00022221066,0.00036114233,0.008408979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913967,0.00029303873,0.00002715278,0.00013198555,0.0003444312,0.00006361179],"domain_scores_gemma":[0.99935156,0.0001993098,0.000049376173,0.000093971015,0.00025101035,0.000054837437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011091818,0.0010398879,0.0013508938,0.0007559778,0.00049147307,0.0010388443,0.0016256272,0.0013790341,0.006317773],"category_scores_gemma":[0.003141656,0.0005533271,0.0007742126,0.00070480787,0.00086747005,0.0011147519,0.0017616198,0.0017849656,0.0025785938],"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.00019362364,0.00010180757,0.0006079048,0.00027220004,0.000097154356,0.00022072185,0.00011301616,0.63482124,0.010421024,0.14253305,0.01733634,0.19328183],"study_design_scores_gemma":[0.000026327014,0.000031274332,0.000050919665,0.00000898933,0.000007785205,0.00004925208,0.000004959302,0.98527724,0.0011526325,0.0078042545,0.0055764806,0.000009795914],"about_ca_topic_score_codex":0.0024891293,"about_ca_topic_score_gemma":0.0020743862,"teacher_disagreement_score":0.006317773,"about_ca_system_score_codex":0.00054613437,"about_ca_system_score_gemma":0.0018920213,"threshold_uncertainty_score":0.021135032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11883045,0.00025894248,0.87371814,0.0003169255,0.00006403984,0.00006240037,0.000488457,0.0019385297,0.0043220264],"genre_scores_gemma":[0.8030175,0.00025330755,0.1910461,0.00014702686,0.000029622237,0.0000546474,0.000599272,0.00017302202,0.0046796612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986815,0.000019866391,0.000003863938,0.000051908442,0.000038786708,0.000017492846],"domain_scores_gemma":[0.99972993,0.00011719243,0.000042169162,0.00006256023,0.000029454883,0.000018696077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018438716,0.00045465233,0.0003020413,0.00040498923,0.0001867715,0.00047591736,0.0006653763,0.00067153055,0.0022729316],"category_scores_gemma":[0.0012151303,0.000479347,0.0005567133,0.00027345354,0.000536261,0.0007412473,0.00035586924,0.0008843977,0.0005255866],"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.00036215506,0.00014484614,0.00468048,0.00025242602,0.00008497835,0.0007863849,0.00017353363,0.5893795,0.103132665,0.02951403,0.0033468711,0.26814204],"study_design_scores_gemma":[0.0000114000695,0.000023671737,0.0017631887,0.000013108153,0.000010759577,0.00016404841,0.00001753585,0.96248907,0.021903608,0.01202498,0.0015634818,0.000015230369],"about_ca_topic_score_codex":0.0020730174,"about_ca_topic_score_gemma":0.005185487,"teacher_disagreement_score":0.0022729316,"about_ca_system_score_codex":0.0005107723,"about_ca_system_score_gemma":0.00036475054,"threshold_uncertainty_score":0.007603705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028627533,0.000512472,0.9652584,0.0006507576,0.000037431284,0.00013422029,0.00005727699,0.00033445348,0.0043874704],"genre_scores_gemma":[0.65207744,0.00044360332,0.3421046,0.00048677356,0.00009078512,0.00051064097,0.00022427912,0.00020545514,0.003856385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954222,0.0029699777,0.00013228462,0.00049128634,0.00065264065,0.0003315508],"domain_scores_gemma":[0.9738057,0.023074044,0.0009784092,0.00096235255,0.00070235,0.0004771948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084569305,0.0014570209,0.0022045285,0.0010277032,0.000946396,0.0018697698,0.0024657995,0.0021837999,0.0024906478],"category_scores_gemma":[0.0333282,0.0011091976,0.0010225358,0.0010895706,0.0025913208,0.002970869,0.001961415,0.0028729718,0.00037875233],"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.0001658459,0.00008001228,0.0007058127,0.00007543502,0.0000640541,0.00005830212,0.00007754383,0.91417354,0.00029595275,0.06478119,0.0009325572,0.018589739],"study_design_scores_gemma":[0.000018153038,0.000017871296,0.00006158965,0.000009100055,0.0000064532132,0.000011131708,0.000005698244,0.9739135,0.00016501543,0.025599647,0.00018722964,0.00000458405],"about_ca_topic_score_codex":0.0064519374,"about_ca_topic_score_gemma":0.007292533,"teacher_disagreement_score":0.0084569305,"about_ca_system_score_codex":0.0026422183,"about_ca_system_score_gemma":0.003003319,"threshold_uncertainty_score":0.04472506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07893443,0.00012948219,0.9181778,0.00027990836,0.00004623452,0.000056338144,0.00009769067,0.00069200294,0.0015861646],"genre_scores_gemma":[0.74458766,0.00018668493,0.25258863,0.00030787068,0.000036702084,0.000093282084,0.000264125,0.00023406226,0.0017010376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977154,0.0000693524,0.000009524953,0.00006206839,0.0000540605,0.000033359498],"domain_scores_gemma":[0.99912137,0.0004896593,0.00008470137,0.00019996901,0.000055809654,0.0000484136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009216483,0.00068984355,0.0006433934,0.00038332632,0.00015753943,0.00065678236,0.0008013109,0.0010096813,0.0020315158],"category_scores_gemma":[0.0028569782,0.00044555403,0.00083695713,0.00026192024,0.0007569841,0.0010730303,0.0006579589,0.0013352743,0.0003925766],"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.00008999759,0.00006007484,0.00048586028,0.000060673403,0.000038525413,0.0001547303,0.00006516399,0.9313452,0.026533792,0.012916605,0.0006875188,0.027561795],"study_design_scores_gemma":[0.0000068394916,0.00002303394,0.00012104735,0.0000048109446,0.0000043112527,0.000054711785,0.0000043056566,0.9924076,0.0036110678,0.0034966222,0.00025929156,0.000006484375],"about_ca_topic_score_codex":0.0012262359,"about_ca_topic_score_gemma":0.0014240165,"teacher_disagreement_score":0.0020315158,"about_ca_system_score_codex":0.00054757716,"about_ca_system_score_gemma":0.00035178973,"threshold_uncertainty_score":0.006796062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058328435,0.00019173368,0.9930058,0.00021940256,0.000019748264,0.00003288411,0.00015800126,0.00019691404,0.0003427036],"genre_scores_gemma":[0.38170278,0.0011117624,0.6101058,0.00057815533,0.0002572617,0.00052340486,0.0016106784,0.00032107136,0.0037891828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99393153,0.0022851464,0.00041983862,0.0016910011,0.0013253062,0.00034728387],"domain_scores_gemma":[0.9562507,0.029367087,0.0038168414,0.00804866,0.001503912,0.0010127961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012913997,0.00094418984,0.002173456,0.003146392,0.0019877723,0.0034592112,0.0045551145,0.0039229556,0.00472006],"category_scores_gemma":[0.061820846,0.0020763474,0.003143184,0.0038268224,0.005090377,0.010468819,0.004189073,0.0073948717,0.0010394948],"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.000115429626,0.000060812927,0.0038197893,0.00019720459,0.00012709109,0.00030802097,0.0006491812,0.21404749,0.0017647534,0.7357679,0.0022422762,0.040900163],"study_design_scores_gemma":[0.00001675564,0.000020652113,0.0005375519,0.000031256466,0.000017260129,0.000071746006,0.000027679893,0.6515962,0.00036650532,0.34605545,0.0012326908,0.000026327714],"about_ca_topic_score_codex":0.009372181,"about_ca_topic_score_gemma":0.009197035,"teacher_disagreement_score":0.012913997,"about_ca_system_score_codex":0.0032953857,"about_ca_system_score_gemma":0.0019460513,"threshold_uncertainty_score":0.06829661},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003087217,0.000106004285,0.9947078,0.00033721005,0.000076812576,0.000022832763,0.00003767011,0.00074842083,0.00087593106],"genre_scores_gemma":[0.14823589,0.00028897886,0.8427349,0.0008437572,0.00013194152,0.00025160154,0.00043210873,0.0009381202,0.006142731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900764,0.00029717985,0.000062343985,0.00032250694,0.00022067413,0.000089729976],"domain_scores_gemma":[0.99854445,0.00061819796,0.000077487086,0.00043869085,0.0002579779,0.00006320603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935952,0.0013148567,0.0012526654,0.0005911745,0.000583781,0.0016799618,0.0022700066,0.0024578855,0.009108966],"category_scores_gemma":[0.008306087,0.0011525205,0.0010030227,0.00087868696,0.0010273746,0.004190531,0.0016267961,0.006718304,0.002348166],"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.00014600738,0.00017872606,0.0008576712,0.00012921568,0.0001650964,0.000108249944,0.00016077241,0.6840776,0.017469918,0.07791934,0.004980077,0.21380736],"study_design_scores_gemma":[0.000026845957,0.00003384878,0.00011667938,0.000022449727,0.000013182859,0.000048433867,0.00001238278,0.9562456,0.008004503,0.03157466,0.003878316,0.000023016806],"about_ca_topic_score_codex":0.002600589,"about_ca_topic_score_gemma":0.004901662,"teacher_disagreement_score":0.009108966,"about_ca_system_score_codex":0.00085959403,"about_ca_system_score_gemma":0.0010781694,"threshold_uncertainty_score":0.030472517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010501461,0.0001791463,0.9968562,0.00023244467,0.000048654932,0.000024024504,0.000020756805,0.000085726286,0.0015028961],"genre_scores_gemma":[0.12983128,0.000974218,0.86270255,0.00063121505,0.00060978555,0.00040061332,0.00021666731,0.00019688858,0.0044367053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556786,0.0017910659,0.00015885111,0.0005478738,0.0017167254,0.00021766401],"domain_scores_gemma":[0.993433,0.004389092,0.00032526843,0.0007220478,0.00092688244,0.00020360021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137788,0.0010342273,0.0022877837,0.0013362156,0.0010391452,0.0022883194,0.002934759,0.0023858072,0.0033314626],"category_scores_gemma":[0.017407982,0.0008363489,0.0012606622,0.0016638626,0.0021958954,0.004596592,0.0026300037,0.0035991045,0.0011688459],"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.00009277901,0.00008140932,0.00063069694,0.00022962742,0.00008509862,0.00016348498,0.00020492541,0.26577252,0.0026223925,0.5407827,0.009479194,0.17985515],"study_design_scores_gemma":[0.000008276255,0.00003232421,0.000074060175,0.000026557438,0.000012038665,0.00013673057,0.000011096516,0.8018308,0.0013690515,0.19252704,0.00395567,0.000016345532],"about_ca_topic_score_codex":0.00082897244,"about_ca_topic_score_gemma":0.0007680367,"teacher_disagreement_score":0.004137788,"about_ca_system_score_codex":0.0012368525,"about_ca_system_score_gemma":0.0012725318,"threshold_uncertainty_score":0.021882951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02522689,0.00020136627,0.9721025,0.00020091071,0.000021470978,0.000041159947,0.00006336283,0.0006312011,0.0015111613],"genre_scores_gemma":[0.7503097,0.00017166798,0.24610099,0.00019860332,0.000039520666,0.00023231107,0.000287163,0.00011943121,0.0025406538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988212,0.00046206824,0.00006321898,0.00029034892,0.00027434135,0.000088833585],"domain_scores_gemma":[0.99293023,0.0047662463,0.00057143974,0.0008310479,0.00061792845,0.00028319738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020624795,0.0007929308,0.0013473808,0.00052962435,0.00038092257,0.0009137292,0.0019892135,0.0013442072,0.0028463276],"category_scores_gemma":[0.015189405,0.00084446376,0.0004761583,0.00043025264,0.0012344897,0.0024342593,0.0021875645,0.0018662848,0.00063183246],"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.00017644351,0.00007799525,0.0012285163,0.0001357615,0.000047778227,0.00011085244,0.00011597797,0.8797263,0.0023704723,0.015307438,0.0014129933,0.09928946],"study_design_scores_gemma":[0.000014007825,0.000029422697,0.00007562981,0.000008254283,0.0000030873723,0.000015675576,0.0000054496636,0.9926934,0.0005388372,0.00632985,0.0002811763,0.000005074377],"about_ca_topic_score_codex":0.0024910837,"about_ca_topic_score_gemma":0.002838331,"teacher_disagreement_score":0.0028463276,"about_ca_system_score_codex":0.0007423583,"about_ca_system_score_gemma":0.0014440536,"threshold_uncertainty_score":0.01090759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031189627,0.00018422416,0.99502325,0.00011417312,0.000041142124,0.000021424565,0.000012786874,0.000084561274,0.0013995488],"genre_scores_gemma":[0.36308494,0.00044978608,0.62909395,0.00024171559,0.00008954435,0.00023373024,0.0000930766,0.00013022129,0.006583024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993286,0.00017568188,0.000042901785,0.00013583571,0.0002541276,0.00006286525],"domain_scores_gemma":[0.9976478,0.0013774668,0.00018216581,0.00025522197,0.0004383454,0.00009886328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428547,0.0008440595,0.0010280835,0.00051005225,0.00040181432,0.0010917281,0.0017996329,0.0014512967,0.0028723846],"category_scores_gemma":[0.008947497,0.00047191174,0.00082487863,0.0005218561,0.0017629805,0.0018871228,0.0020687948,0.0023006564,0.00055823964],"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.000118207696,0.00006276508,0.00059133733,0.00015366606,0.000046921676,0.00009520556,0.00012632922,0.70481735,0.0026210784,0.22415246,0.0010968762,0.06611783],"study_design_scores_gemma":[0.0000064694386,0.000017281607,0.000021528036,0.0000058626706,0.0000027019448,0.000012807204,0.00000210343,0.9857782,0.00048005427,0.013133815,0.0005346536,0.0000044861663],"about_ca_topic_score_codex":0.0031792736,"about_ca_topic_score_gemma":0.0019369519,"teacher_disagreement_score":0.0031792736,"about_ca_system_score_codex":0.0013477986,"about_ca_system_score_gemma":0.0013070058,"threshold_uncertainty_score":0.012843549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031182407,0.00015175069,0.99173886,0.00033354046,0.00008161251,0.00007907916,0.00009979168,0.0008692318,0.003527914],"genre_scores_gemma":[0.47370645,0.00038232125,0.5171502,0.00030124548,0.00008499135,0.0007703005,0.00034576096,0.0003469137,0.006911709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984371,0.00061202695,0.00010898865,0.00028167805,0.00042048874,0.00013966022],"domain_scores_gemma":[0.99620396,0.002542666,0.00024871712,0.00034231527,0.00047811598,0.00018423761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025377353,0.0014058495,0.0011764047,0.0006925945,0.00087635784,0.0018468405,0.0017596243,0.0011193532,0.00780202],"category_scores_gemma":[0.007086779,0.00076416094,0.0009136051,0.0008137709,0.0012329033,0.0017223228,0.001667907,0.0025844024,0.0010274872],"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.00006942986,0.000046075656,0.00033047673,0.00008590254,0.000039649833,0.000055753942,0.00006290053,0.91126263,0.0005990005,0.057207298,0.0017434794,0.028497452],"study_design_scores_gemma":[0.000010126639,0.000011617956,0.0000257211,0.0000063894895,0.0000055617716,0.0000062397567,0.000004500367,0.98162234,0.00033994362,0.01648874,0.0014719728,0.000006847336],"about_ca_topic_score_codex":0.011349734,"about_ca_topic_score_gemma":0.012179242,"teacher_disagreement_score":0.011349734,"about_ca_system_score_codex":0.0021789114,"about_ca_system_score_gemma":0.004062857,"threshold_uncertainty_score":0.026100338},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013084672,0.00047421304,0.99566597,0.0003543737,0.000091934155,0.000068063244,0.00029561095,0.00032650234,0.0014149051],"genre_scores_gemma":[0.16129713,0.0023772123,0.82466966,0.0005373622,0.0006686589,0.0006617697,0.002010814,0.00013432433,0.0076431064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961061,0.0015514703,0.00017504908,0.00087841885,0.0010763064,0.00021271649],"domain_scores_gemma":[0.99311054,0.0043518343,0.00044065661,0.0010932172,0.0008535365,0.00015020007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047985357,0.0023908005,0.0025136804,0.0017166956,0.0012153839,0.0020567589,0.0034659556,0.0024756347,0.009272612],"category_scores_gemma":[0.015032953,0.001226535,0.0028000628,0.0030947865,0.001328503,0.0034133287,0.0019815264,0.0035578266,0.0045025074],"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.00017419412,0.00019603007,0.0021214713,0.0007038458,0.0005586457,0.00023126983,0.00030109932,0.4437939,0.002184089,0.19841054,0.024858268,0.3264666],"study_design_scores_gemma":[0.00002498321,0.00003740815,0.00025292666,0.000032905864,0.00003025821,0.00010122379,0.000027037026,0.8899391,0.00037663724,0.10312806,0.00602218,0.00002720634],"about_ca_topic_score_codex":0.009323824,"about_ca_topic_score_gemma":0.010367774,"teacher_disagreement_score":0.009323824,"about_ca_system_score_codex":0.0011677959,"about_ca_system_score_gemma":0.0016261836,"threshold_uncertainty_score":0.031019926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02028822,0.00007556794,0.9781309,0.00007234803,0.000017239085,0.000052583036,0.000016642269,0.00046167264,0.0008847582],"genre_scores_gemma":[0.82668734,0.00007661138,0.17171752,0.000096359065,0.000020523348,0.00015909999,0.00008656009,0.00006476316,0.0010912401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945706,0.00016167785,0.000026934156,0.00010031734,0.0001748488,0.000079109406],"domain_scores_gemma":[0.9975794,0.0015508892,0.0002374814,0.0002054419,0.00031342017,0.000113380614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012685214,0.0008984014,0.0012686749,0.00035820674,0.00036851602,0.00063521543,0.0014810975,0.000967887,0.0018171655],"category_scores_gemma":[0.005609119,0.00044444203,0.0005417665,0.0002868109,0.0009970631,0.0011313392,0.0012328962,0.0016048547,0.000319654],"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.00009474227,0.00009646386,0.00051997753,0.00004771975,0.000026678339,0.000058315105,0.00005583209,0.9461254,0.0014594065,0.006452494,0.0005957516,0.04446721],"study_design_scores_gemma":[0.0000073034216,0.000016758018,0.000022473305,0.000001538287,0.000001866187,0.000005927744,0.0000015673739,0.99840003,0.00021520114,0.0012561481,0.00006912074,0.0000020267237],"about_ca_topic_score_codex":0.007127197,"about_ca_topic_score_gemma":0.005546447,"teacher_disagreement_score":0.007127197,"about_ca_system_score_codex":0.00089283206,"about_ca_system_score_gemma":0.0014996557,"threshold_uncertainty_score":0.0141714215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01638658,0.00003797245,0.9829385,0.000097330994,0.0000069559023,0.000012140348,0.000022673412,0.00013152027,0.00036634604],"genre_scores_gemma":[0.6457516,0.00035367205,0.3493744,0.00019199059,0.00008559967,0.00016581193,0.0002476991,0.0001288192,0.0037003697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947673,0.00018946159,0.00002533658,0.00013062885,0.00013340384,0.000044383403],"domain_scores_gemma":[0.99749005,0.0014071927,0.00035025374,0.00033747705,0.00032398783,0.00009094469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015823321,0.00040578356,0.0006692153,0.00062866654,0.00028881177,0.001101724,0.0012333913,0.0011982323,0.0017143609],"category_scores_gemma":[0.008597187,0.00056554243,0.0008276283,0.0008157025,0.0010496345,0.0030792172,0.0010865901,0.0014343098,0.0004719165],"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.00014216518,0.00006371064,0.0017574003,0.00008265562,0.00007154243,0.00017086901,0.00020779739,0.7723244,0.005136193,0.122132726,0.0014132796,0.096497275],"study_design_scores_gemma":[0.000005621746,0.00001655885,0.0000892597,0.0000021775902,0.0000032659275,0.000032932527,0.0000057222906,0.96344113,0.0006212732,0.035580005,0.00019652957,0.0000055697474],"about_ca_topic_score_codex":0.0011955958,"about_ca_topic_score_gemma":0.0015177174,"teacher_disagreement_score":0.0017143609,"about_ca_system_score_codex":0.0005058588,"about_ca_system_score_gemma":0.0005729011,"threshold_uncertainty_score":0.008368313},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025975371,0.0001187012,0.9961444,0.00011439795,0.00004397028,0.000017067814,0.000014472148,0.0003055177,0.00064397685],"genre_scores_gemma":[0.13598011,0.00040131283,0.8586719,0.0002345331,0.00019157337,0.00016367335,0.00018618214,0.00028782163,0.0038828012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989981,0.00028247837,0.000050242925,0.00019208061,0.00038373447,0.00009339343],"domain_scores_gemma":[0.9987093,0.0006146813,0.0000843288,0.0002627682,0.00024837547,0.00008057875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016515385,0.0010195845,0.0015312567,0.00079940987,0.00049963954,0.001198782,0.0011680563,0.001561886,0.004112727],"category_scores_gemma":[0.005426655,0.00045021556,0.00091551174,0.0010147218,0.0008251329,0.0018306107,0.0018951432,0.0025723858,0.001705423],"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.00031439232,0.0001406928,0.00089283095,0.0002988911,0.00011535335,0.00021432867,0.00034835056,0.5956946,0.018801035,0.098758265,0.009353822,0.27506736],"study_design_scores_gemma":[0.000019100757,0.000035414265,0.000093582465,0.000009396043,0.000008926938,0.000058628077,0.00001642653,0.9846713,0.0018272904,0.011185252,0.002062934,0.00001164078],"about_ca_topic_score_codex":0.0032401802,"about_ca_topic_score_gemma":0.0025362666,"teacher_disagreement_score":0.004112727,"about_ca_system_score_codex":0.0005367471,"about_ca_system_score_gemma":0.0014037545,"threshold_uncertainty_score":0.013758421},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030488487,0.00084166235,0.9573815,0.0005576868,0.000053310843,0.000041102303,0.00006244848,0.00020552857,0.010368295],"genre_scores_gemma":[0.91470176,0.0005891798,0.07942398,0.00015515264,0.00013278415,0.000099475496,0.00005728054,0.0000739888,0.0047664135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963117,0.00011185069,0.000014801701,0.00007877946,0.00011477287,0.00004865906],"domain_scores_gemma":[0.9992384,0.00045835163,0.00008637136,0.00006449044,0.000097749464,0.000054660242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506301,0.0004820429,0.00066494616,0.000828578,0.00028396185,0.00090699724,0.0012546524,0.0006736276,0.0019363391],"category_scores_gemma":[0.002620182,0.00026620235,0.0006585295,0.000514042,0.0012044917,0.0018389069,0.0008749282,0.00064010004,0.0003746286],"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.00011810215,0.000042426447,0.000816995,0.00018877097,0.000082877596,0.00018439055,0.000335194,0.20741723,0.0155502325,0.71077174,0.0031711312,0.061320834],"study_design_scores_gemma":[0.000010474281,0.00006468375,0.0005021059,0.000012308245,0.000012906066,0.00009260414,0.000012851926,0.8003773,0.0014874319,0.19595625,0.001453803,0.000017267457],"about_ca_topic_score_codex":0.0012185496,"about_ca_topic_score_gemma":0.0010056425,"teacher_disagreement_score":0.0019363391,"about_ca_system_score_codex":0.0012172323,"about_ca_system_score_gemma":0.00042462326,"threshold_uncertainty_score":0.00883168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015451356,0.00016346318,0.9966467,0.00016618136,0.00003105886,0.000041797575,0.00009486507,0.0002384132,0.0010723986],"genre_scores_gemma":[0.14844652,0.0010839126,0.84217685,0.00049208885,0.00026022288,0.0007519784,0.0010830049,0.00039803432,0.0053073494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981444,0.0009754012,0.000056592176,0.00029030885,0.00040702592,0.00012626091],"domain_scores_gemma":[0.992673,0.00531579,0.00025084903,0.00076151127,0.0008108936,0.0001879543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004664295,0.00089570397,0.0015671856,0.0014266336,0.000860895,0.0024824054,0.0032766978,0.0021708834,0.0066431896],"category_scores_gemma":[0.023040542,0.0009397186,0.0012899861,0.0017841987,0.0019611444,0.0033425032,0.0024559726,0.0033214176,0.0022189145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658967,0.000085499545,0.0024242664,0.000168496,0.00010629981,0.00019786599,0.00021398383,0.27041033,0.0012089815,0.61906534,0.009649543,0.09634277],"study_design_scores_gemma":[0.00003712834,0.000014276308,0.0001688038,0.00003402208,0.000019823508,0.00008049904,0.000017086097,0.7849464,0.00042543476,0.20965205,0.004584349,0.0000201587],"about_ca_topic_score_codex":0.0061401143,"about_ca_topic_score_gemma":0.0061501353,"teacher_disagreement_score":0.0066431896,"about_ca_system_score_codex":0.0012385466,"about_ca_system_score_gemma":0.002799155,"threshold_uncertainty_score":0.024667501},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049584158,0.0003284158,0.93674064,0.0009930956,0.00006474734,0.00003624609,0.0002516448,0.00034555187,0.0116555],"genre_scores_gemma":[0.8363001,0.0006784998,0.15158997,0.00018019187,0.00009299539,0.00029227592,0.0003331969,0.000112919064,0.010419809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986255,0.00003366623,0.000007467068,0.000028464405,0.000039751754,0.000028019469],"domain_scores_gemma":[0.9997166,0.00015454301,0.000024254403,0.000037099628,0.00003476066,0.000032610766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046690524,0.0004673394,0.0007020834,0.00036565817,0.00047173744,0.0009881727,0.002329322,0.0010636846,0.0048063206],"category_scores_gemma":[0.0013707106,0.00035692385,0.0009173309,0.000526075,0.001087619,0.0023747222,0.00081791374,0.0011510672,0.0005269206],"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.000050992025,0.000027859794,0.0003947132,0.000031299154,0.00002321271,0.000089723064,0.000044490156,0.7552372,0.0011790101,0.23564357,0.0005397469,0.0067381184],"study_design_scores_gemma":[0.000010460512,0.000009767832,0.00004512596,0.0000025949603,0.0000049265304,0.000018188632,0.000002635875,0.94889903,0.00014763362,0.05035101,0.00050482585,0.000003810545],"about_ca_topic_score_codex":0.006118111,"about_ca_topic_score_gemma":0.0039808936,"teacher_disagreement_score":0.006118111,"about_ca_system_score_codex":0.00095744623,"about_ca_system_score_gemma":0.0011621237,"threshold_uncertainty_score":0.01607871},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05013814,0.0006230703,0.9390168,0.001473228,0.00002608127,0.00032057543,0.00049041864,0.00033888477,0.007572813],"genre_scores_gemma":[0.6596367,0.0006551821,0.3317707,0.0005854169,0.00010055062,0.0011234271,0.0008597422,0.00020612826,0.005062092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97811866,0.014420047,0.000984942,0.0022035337,0.003309565,0.0009631806],"domain_scores_gemma":[0.9381009,0.052016232,0.0025588665,0.0040586344,0.0022113107,0.0010539673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017866135,0.0015671506,0.0037550963,0.0019264248,0.0012410737,0.0034679705,0.0031290667,0.0036611124,0.0064837215],"category_scores_gemma":[0.07282828,0.0015316242,0.0016355749,0.0028040984,0.0030743803,0.0075487383,0.003988513,0.003626079,0.0010636856],"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.00071129814,0.00037822447,0.0014317698,0.00028947077,0.00020957818,0.0001443,0.0004543796,0.6066837,0.0011812709,0.32320815,0.0038173082,0.061490472],"study_design_scores_gemma":[0.00009438153,0.000114708564,0.00033319343,0.00004136327,0.000025093716,0.00004267514,0.000068527566,0.7912338,0.00070470484,0.20635054,0.0009546475,0.00003643764],"about_ca_topic_score_codex":0.0027196892,"about_ca_topic_score_gemma":0.0027239616,"teacher_disagreement_score":0.017866135,"about_ca_system_score_codex":0.0038160835,"about_ca_system_score_gemma":0.0024480624,"threshold_uncertainty_score":0.094486296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031118926,0.0013283154,0.95024455,0.0011428582,0.00035204826,0.00008750046,0.00017579639,0.0013886052,0.014161354],"genre_scores_gemma":[0.6104632,0.001089306,0.3694984,0.0014492263,0.0005712148,0.00022288282,0.00044323129,0.0012836,0.014978972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982054,0.0006207897,0.00007795946,0.00030430028,0.00063131034,0.00016024659],"domain_scores_gemma":[0.98674726,0.009507775,0.00061749294,0.0015973249,0.0010357914,0.00049429166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003967882,0.0017170642,0.001749857,0.0016536864,0.0009976175,0.0015278334,0.0031084674,0.0029282852,0.009121481],"category_scores_gemma":[0.027312988,0.0005093781,0.0011394043,0.00094303285,0.0021663515,0.0066059143,0.005863089,0.004221539,0.0014927954],"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.00024883897,0.00020441234,0.001397619,0.00019174213,0.000084779786,0.00021954977,0.00019996737,0.14181535,0.0039079157,0.74199647,0.007165281,0.102568015],"study_design_scores_gemma":[0.000038229737,0.000084455576,0.00022918632,0.000023538758,0.000017271488,0.00010436892,0.000019432195,0.572169,0.00094492774,0.4222643,0.0040800907,0.000025227884],"about_ca_topic_score_codex":0.0022195566,"about_ca_topic_score_gemma":0.0028348432,"teacher_disagreement_score":0.009121481,"about_ca_system_score_codex":0.0015956995,"about_ca_system_score_gemma":0.00097301754,"threshold_uncertainty_score":0.03051436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001642092,0.00018851398,0.99709785,0.00010654799,0.000020892172,0.00003453418,0.00011034907,0.000312947,0.0004863022],"genre_scores_gemma":[0.19719721,0.0006030928,0.79270524,0.00042986052,0.00025424032,0.00053675025,0.0024481844,0.0005565984,0.005268889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99384284,0.0028011815,0.00034724246,0.0014369239,0.0012237778,0.00034811813],"domain_scores_gemma":[0.99401253,0.0023932864,0.0007076376,0.0015988295,0.0010679263,0.00021978527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047586877,0.0017307518,0.002461494,0.002183508,0.0013882722,0.0031385336,0.0048398715,0.002663194,0.004331397],"category_scores_gemma":[0.015617069,0.0008893023,0.002073575,0.002987542,0.002028418,0.004773577,0.00396661,0.0032589734,0.0031931296],"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.00046964572,0.0003235375,0.0036821365,0.0007499454,0.000491192,0.00024905332,0.00068801537,0.44164014,0.008173625,0.12947233,0.019215858,0.39484456],"study_design_scores_gemma":[0.000018854942,0.000049543258,0.00036610026,0.000042175976,0.0000252104,0.00007269577,0.000053579613,0.91993606,0.0023871257,0.072951466,0.0040655066,0.00003172686],"about_ca_topic_score_codex":0.0019308075,"about_ca_topic_score_gemma":0.0024574497,"teacher_disagreement_score":0.0048398715,"about_ca_system_score_codex":0.0014273457,"about_ca_system_score_gemma":0.0019642827,"threshold_uncertainty_score":0.02516663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015151473,0.00005491879,0.9976342,0.00006199947,0.000015276119,0.000017348302,0.000023054286,0.00024690572,0.0004312005],"genre_scores_gemma":[0.11460015,0.00038173117,0.87758005,0.0003640209,0.00024939986,0.00036574356,0.00047901185,0.00081103103,0.005168777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985852,0.00051157206,0.0000659145,0.000266136,0.00044076657,0.00013035734],"domain_scores_gemma":[0.99769443,0.00097505486,0.000266424,0.0005637147,0.0003668851,0.00013340595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039535216,0.0019121926,0.0015485215,0.0009340446,0.00059074815,0.0010712638,0.0026794716,0.0018923635,0.0034959968],"category_scores_gemma":[0.009753286,0.00073608966,0.0013154792,0.0009614597,0.001917742,0.0021284441,0.0034310515,0.0037552246,0.0016901763],"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.00043002883,0.00015605708,0.00083407515,0.0003604282,0.00020381184,0.00029805113,0.00030330048,0.5621111,0.034431733,0.08040376,0.012855494,0.30761218],"study_design_scores_gemma":[0.000017463384,0.00009963293,0.00017851953,0.000020524529,0.000018530805,0.000078101795,0.0000136193175,0.97542024,0.00604415,0.015189108,0.0028987222,0.000021363452],"about_ca_topic_score_codex":0.0012975105,"about_ca_topic_score_gemma":0.0011016116,"teacher_disagreement_score":0.0039535216,"about_ca_system_score_codex":0.0006944636,"about_ca_system_score_gemma":0.001164047,"threshold_uncertainty_score":0.020908415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040192652,0.00011991111,0.95766467,0.00021626794,0.000030133158,0.000034055094,0.0000120454315,0.00019359971,0.0015365572],"genre_scores_gemma":[0.8975414,0.00008964018,0.10008913,0.00010510166,0.000017327598,0.00010302683,0.000028429331,0.000025196194,0.0020006618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975437,0.00008929439,0.000015219017,0.00004316212,0.00006688849,0.000031053336],"domain_scores_gemma":[0.99871564,0.00090084557,0.00013324684,0.00004799545,0.00015122624,0.000051097322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012483407,0.00042853903,0.00056533684,0.00024216516,0.00027562605,0.0005227871,0.0005831323,0.00075153727,0.0009799373],"category_scores_gemma":[0.0029689146,0.00028587395,0.00037608482,0.00023307206,0.00071228476,0.0004964898,0.0006865066,0.0009550925,0.00012409785],"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.00005754593,0.000034207784,0.00025543245,0.000021064176,0.000016266069,0.000023657627,0.000040161238,0.97394764,0.0011065394,0.005065539,0.00020198374,0.019229915],"study_design_scores_gemma":[0.000004828745,0.000009906638,0.000015532107,8.678791e-7,0.0000010967599,0.0000015445789,8.879275e-7,0.9991431,0.00013737337,0.00063533103,0.000048229947,0.0000012825052],"about_ca_topic_score_codex":0.0082133515,"about_ca_topic_score_gemma":0.004601019,"teacher_disagreement_score":0.0082133515,"about_ca_system_score_codex":0.0007421789,"about_ca_system_score_gemma":0.0009401019,"threshold_uncertainty_score":0.016331077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008653005,0.000044969132,0.99094385,0.000040057566,0.0000070682877,0.000011932292,0.000032220665,0.00016546856,0.00010133448],"genre_scores_gemma":[0.40005505,0.00025379946,0.59747213,0.00006154369,0.00003498563,0.00016124238,0.0004906211,0.0001415469,0.0013290115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926394,0.00027190533,0.000051217416,0.00018536889,0.0001792322,0.000048252437],"domain_scores_gemma":[0.9941076,0.004766149,0.00040453326,0.0003728331,0.00026578005,0.00008300179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014496822,0.00066092407,0.00074127346,0.00083585375,0.0004634057,0.00079757086,0.0012289996,0.00097024045,0.0016878294],"category_scores_gemma":[0.009777452,0.00077733933,0.0007971715,0.00063605205,0.0009612106,0.0019915323,0.0011223475,0.0018145044,0.00038223524],"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.00006781009,0.000043098273,0.0014887138,0.00006628192,0.00004010804,0.00010514929,0.00013744966,0.94183797,0.0018439216,0.020897858,0.00024062805,0.03323102],"study_design_scores_gemma":[0.0000030118142,0.0000052735013,0.000085354586,0.000003333806,0.000002807662,0.000007827668,0.0000048430325,0.9902148,0.00043232302,0.009096501,0.0001399741,0.000003917925],"about_ca_topic_score_codex":0.0063761794,"about_ca_topic_score_gemma":0.007315894,"teacher_disagreement_score":0.0063761794,"about_ca_system_score_codex":0.00078519364,"about_ca_system_score_gemma":0.0012058555,"threshold_uncertainty_score":0.012678146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037731186,0.0009692831,0.95412046,0.0014108187,0.000060931587,0.00008029519,0.00014756367,0.0002199762,0.005259498],"genre_scores_gemma":[0.89313585,0.0010100964,0.09912643,0.0005110618,0.00020349037,0.00028235491,0.00014074279,0.000086485226,0.0055035776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647224,0.002164506,0.00010142146,0.0005368181,0.0003780416,0.00034698195],"domain_scores_gemma":[0.9866454,0.009924301,0.0017244352,0.0010477927,0.00039246408,0.00026560933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004796262,0.0013751012,0.0023145678,0.000966577,0.0007434839,0.0030752777,0.002419904,0.00298553,0.003788901],"category_scores_gemma":[0.026909564,0.00074971037,0.0010912233,0.0017863333,0.0029175791,0.004336558,0.002557728,0.0039198194,0.0007395204],"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.00009152276,0.00006761034,0.0008007946,0.00010049221,0.000076141354,0.00031032684,0.00011179488,0.753856,0.00039801124,0.2226601,0.0013870557,0.020140214],"study_design_scores_gemma":[0.000015739499,0.00002467084,0.0001114829,0.000013177158,0.000009080822,0.000050951883,0.000023607492,0.9104796,0.00011367402,0.088691205,0.0004545712,0.00001219739],"about_ca_topic_score_codex":0.0027934387,"about_ca_topic_score_gemma":0.002219034,"teacher_disagreement_score":0.004796262,"about_ca_system_score_codex":0.0013586663,"about_ca_system_score_gemma":0.0009697663,"threshold_uncertainty_score":0.025365412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90924716,0.00029045582,0.08729548,0.00016887534,0.000072476,0.00005570001,0.00029284728,0.0005037135,0.0020731483],"genre_scores_gemma":[0.9710423,0.0001780321,0.026976068,0.000035623434,0.000013675506,0.00002542522,0.0005331452,0.00001453317,0.0011812252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998529,0.00002293872,0.0000075881726,0.00004344005,0.000028974866,0.000044087996],"domain_scores_gemma":[0.9997012,0.00015226752,0.000042977787,0.000027239803,0.00006228691,0.000013958341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042814703,0.00054115494,0.0001688687,0.00034209804,0.00014381419,0.0004731597,0.00027308226,0.00033471422,0.0006905546],"category_scores_gemma":[0.0016852948,0.00018837614,0.00022855723,0.0002956768,0.00016765259,0.00040127727,0.00036621597,0.00038548437,0.0003025237],"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.0009742749,0.0004653911,0.048947282,0.00019827175,0.00030836547,0.00043843288,0.0002721135,0.13761191,0.22883275,0.0010721751,0.0021947687,0.57868433],"study_design_scores_gemma":[0.000015845995,0.00022224984,0.042484466,0.000028323373,0.00007616974,0.00013282173,0.00011414495,0.89857644,0.056485284,0.0009147058,0.0009260225,0.000023469036],"about_ca_topic_score_codex":0.005702781,"about_ca_topic_score_gemma":0.009170255,"teacher_disagreement_score":0.005702781,"about_ca_system_score_codex":0.00035688677,"about_ca_system_score_gemma":0.0002978014,"threshold_uncertainty_score":0.011339188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026505888,0.000073505806,0.9964676,0.00008755802,0.000013094163,0.0000064450287,0.000029853365,0.0002759565,0.00039547757],"genre_scores_gemma":[0.34602532,0.00047573366,0.6493198,0.00021513662,0.00008761508,0.00010051951,0.00040003387,0.00023389234,0.0031419345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992017,0.00025536976,0.000045432786,0.0001749966,0.0002289266,0.000093614195],"domain_scores_gemma":[0.99760145,0.0014106709,0.0002095289,0.00036904015,0.00031815222,0.0000911697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021166368,0.0011691906,0.0009814743,0.00087500445,0.0005016764,0.0018695279,0.0017469325,0.0015149724,0.0017682019],"category_scores_gemma":[0.008066268,0.00081321975,0.00092393515,0.0010256481,0.0012424475,0.0037283162,0.001955249,0.0031927044,0.0006994141],"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.00010877283,0.0001030601,0.001376498,0.00010105767,0.000108722845,0.000090148504,0.000098753764,0.7537695,0.0033289646,0.10489417,0.0024822021,0.13353825],"study_design_scores_gemma":[0.000004142847,0.0000045667593,0.000049609378,0.000003769512,0.0000045127204,0.000007905258,0.0000019137913,0.97252816,0.0006898562,0.026452104,0.0002485074,0.000004875962],"about_ca_topic_score_codex":0.008180103,"about_ca_topic_score_gemma":0.008884639,"teacher_disagreement_score":0.008180103,"about_ca_system_score_codex":0.0015172506,"about_ca_system_score_gemma":0.0013505509,"threshold_uncertainty_score":0.016264975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002691486,0.0057069985,0.9813973,0.0012587173,0.0002403929,0.000091053524,0.0006579313,0.00081368163,0.007142448],"genre_scores_gemma":[0.16527304,0.0116236685,0.8044259,0.0010832947,0.001437319,0.0009134352,0.0037094918,0.000789062,0.010744755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997566,0.001100298,0.0001153402,0.00059467304,0.0005298595,0.00009381171],"domain_scores_gemma":[0.99629647,0.0019429605,0.00039476273,0.00076705735,0.0004853928,0.00011335777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017390795,0.0014824627,0.0017241752,0.0047938726,0.0014323866,0.0025442396,0.002152406,0.0022275373,0.0069081155],"category_scores_gemma":[0.0102829905,0.00066516077,0.00151673,0.0065422584,0.002750549,0.0044063525,0.0034181937,0.0034019414,0.0033705155],"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.00003696386,0.000027032504,0.00038559487,0.00036736744,0.00008100349,0.00012319535,0.00025049894,0.051991325,0.0007312233,0.8337422,0.013694811,0.098568715],"study_design_scores_gemma":[0.000008880733,0.000015062169,0.00022569299,0.000054045056,0.000015090221,0.0001292093,0.00006400668,0.08582034,0.00033323496,0.879816,0.03349651,0.000021997723],"about_ca_topic_score_codex":0.0033616386,"about_ca_topic_score_gemma":0.0024667424,"teacher_disagreement_score":0.0069081155,"about_ca_system_score_codex":0.0017909842,"about_ca_system_score_gemma":0.00084526517,"threshold_uncertainty_score":0.023109972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034885537,0.0002503532,0.96170163,0.00048866187,0.000020097048,0.000041961648,0.0002815411,0.00029833333,0.0020319573],"genre_scores_gemma":[0.8739374,0.00090440636,0.1181839,0.0003925252,0.00024767139,0.00044728926,0.0014107861,0.000327741,0.0041482653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525565,0.001912866,0.0002625637,0.0010085446,0.0010866888,0.0004736859],"domain_scores_gemma":[0.9321415,0.05484211,0.005373921,0.0039386363,0.00241073,0.0012931414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0086866515,0.0012001393,0.0016422926,0.0023075675,0.0010532526,0.0025243498,0.002742857,0.0026309607,0.0042119944],"category_scores_gemma":[0.05668522,0.0013100267,0.0017436651,0.0016895978,0.0040222965,0.007883715,0.0033489529,0.005469658,0.0006606357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016540867,0.000056451194,0.0020966535,0.00008968087,0.00006140964,0.0002810915,0.00035141062,0.17522632,0.0024058386,0.8088298,0.00087979046,0.0095562665],"study_design_scores_gemma":[0.000015572541,0.00001836979,0.00031197877,0.000015151877,0.000009581465,0.000057182202,0.000011567001,0.62256205,0.00044719488,0.37621456,0.00031249362,0.000024253488],"about_ca_topic_score_codex":0.0026236959,"about_ca_topic_score_gemma":0.0016948864,"teacher_disagreement_score":0.0086866515,"about_ca_system_score_codex":0.002094504,"about_ca_system_score_gemma":0.0013923952,"threshold_uncertainty_score":0.045939922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66105974,0.0005173979,0.3322785,0.00034997074,0.0001536995,0.00009187843,0.00009303916,0.0016467571,0.0038090635],"genre_scores_gemma":[0.9125788,0.00017314282,0.085541576,0.00007969497,0.00003927505,0.00005384209,0.00014102491,0.00021589808,0.001176647],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999448,0.00014734766,0.000059813367,0.000082630024,0.00022117372,0.000041072602],"domain_scores_gemma":[0.99785525,0.001627414,0.00009716491,0.0001200464,0.0002642554,0.00003587769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000970533,0.00052859803,0.00039941372,0.000345684,0.00026553747,0.0006185955,0.0003445438,0.00037106356,0.0023047065],"category_scores_gemma":[0.008958489,0.00012944802,0.0001806131,0.0002939151,0.0003538226,0.0007465848,0.00041056392,0.00040308174,0.0005515826],"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.0032471663,0.00037627915,0.004866678,0.00027289707,0.00012643669,0.00043760682,0.0003886792,0.011808748,0.4923486,0.0022058345,0.0007066075,0.4832146],"study_design_scores_gemma":[0.00013800904,0.001802622,0.025497543,0.000042374326,0.00021240876,0.0019231982,0.0001775197,0.19595268,0.76866966,0.0014426078,0.0040643793,0.00007703442],"about_ca_topic_score_codex":0.00060232857,"about_ca_topic_score_gemma":0.0005941047,"teacher_disagreement_score":0.0023047065,"about_ca_system_score_codex":0.00017539805,"about_ca_system_score_gemma":0.0002945946,"threshold_uncertainty_score":0.00770998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22011079,0.00035875075,0.77568775,0.00097424083,0.00004917712,0.000076171746,0.0012045221,0.00082309666,0.000715436],"genre_scores_gemma":[0.9303438,0.0004980616,0.063619606,0.0002337713,0.000088492365,0.00019578182,0.0017531033,0.000068625865,0.0031986393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.0003168729,0.000036541216,0.00022624861,0.00008943763,0.00005246702],"domain_scores_gemma":[0.99371594,0.0049103703,0.0004802226,0.00037310162,0.00039420914,0.0001260866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031139571,0.0006514517,0.0008363222,0.00087634404,0.00016414712,0.0006904395,0.0008721914,0.00095300906,0.0014325347],"category_scores_gemma":[0.009727355,0.00037542108,0.0008012051,0.0007829951,0.0005489042,0.0012740763,0.00042293037,0.0024171292,0.0007372838],"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.0002774368,0.00024818906,0.039360452,0.00007103767,0.00014570133,0.00015522595,0.00014127448,0.86244804,0.0017791119,0.0064751455,0.0018011515,0.08709726],"study_design_scores_gemma":[0.000011032275,0.000051641564,0.003150826,0.000008481583,0.000018973247,0.00003095722,0.000011670265,0.99033934,0.00059435563,0.005491979,0.00027852386,0.000012232082],"about_ca_topic_score_codex":0.004643267,"about_ca_topic_score_gemma":0.005452139,"teacher_disagreement_score":0.004643267,"about_ca_system_score_codex":0.0009006063,"about_ca_system_score_gemma":0.0008759141,"threshold_uncertainty_score":0.016468346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041899398,0.00040068815,0.9539743,0.0004704314,0.000049024587,0.000026940326,0.00003461886,0.00084573583,0.002298855],"genre_scores_gemma":[0.7320511,0.0005912946,0.2624489,0.0004043712,0.00012543632,0.00007718663,0.00021860172,0.00021003366,0.0038730702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994941,0.00016926102,0.00003574916,0.00010147361,0.00013814117,0.00006128831],"domain_scores_gemma":[0.9968342,0.0016072835,0.00025150285,0.00088431116,0.00034245933,0.00008023226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027452295,0.0009902281,0.0012254338,0.0005671997,0.00031150403,0.0015449735,0.0009338008,0.0021803093,0.003656572],"category_scores_gemma":[0.008553853,0.000562892,0.0008824836,0.000589206,0.00065358565,0.0049742367,0.0011397109,0.0030313204,0.0011302641],"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.00016894621,0.00038998513,0.002248135,0.00012714646,0.0001349474,0.000090445385,0.00008569635,0.7358449,0.01828142,0.027464459,0.0017985456,0.2133653],"study_design_scores_gemma":[0.0000094598,0.000028182876,0.00029425794,0.000007653382,0.000007686217,0.00001643474,0.0000033022022,0.9901528,0.0016922044,0.0072830906,0.00049714814,0.00000776209],"about_ca_topic_score_codex":0.0019615223,"about_ca_topic_score_gemma":0.0035936674,"teacher_disagreement_score":0.003656572,"about_ca_system_score_codex":0.0006246938,"about_ca_system_score_gemma":0.00095631444,"threshold_uncertainty_score":0.014518321},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018347299,0.00011570591,0.97966,0.00008677194,0.000028977362,0.000044178672,0.000052768806,0.00086791726,0.00079635525],"genre_scores_gemma":[0.32436183,0.00016357575,0.6720125,0.00013028915,0.000055302382,0.00029749938,0.00029396778,0.00034922958,0.0023357454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997366,0.000044340024,0.000017217522,0.00006895343,0.00010037153,0.00003260517],"domain_scores_gemma":[0.9990067,0.00048144857,0.00011409632,0.00016898678,0.00019156326,0.000037192163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073268835,0.00083259976,0.0005810158,0.000481072,0.0002733409,0.00046497388,0.001260906,0.0007431733,0.0027754467],"category_scores_gemma":[0.004248275,0.0005877208,0.00042795303,0.00051442237,0.00043734233,0.0011132853,0.000819811,0.0014735829,0.00083845545],"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.00018675445,0.00020045423,0.001512823,0.0001481352,0.00007211226,0.00015465725,0.00009071789,0.49139223,0.052428562,0.016287675,0.0036199344,0.4339059],"study_design_scores_gemma":[0.000013966102,0.00004645819,0.00035660242,0.000007100236,0.000007229506,0.00003360617,0.0000038282597,0.98412806,0.010614496,0.0037551138,0.0010243788,0.000009139719],"about_ca_topic_score_codex":0.0015698547,"about_ca_topic_score_gemma":0.004578052,"teacher_disagreement_score":0.0027754467,"about_ca_system_score_codex":0.00051771913,"about_ca_system_score_gemma":0.00057410944,"threshold_uncertainty_score":0.009284854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026694585,0.00039198517,0.9922449,0.00098102,0.000049312064,0.00006029051,0.0006520569,0.00091531774,0.00203558],"genre_scores_gemma":[0.13891287,0.0008956981,0.84466636,0.0009513657,0.0003723911,0.00039200074,0.0025000714,0.00043571572,0.01087348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962759,0.001313221,0.00023306008,0.00091627776,0.001105322,0.0001562556],"domain_scores_gemma":[0.9944885,0.0033324882,0.0004088039,0.0009167376,0.00066875754,0.00018480209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003223405,0.0010989932,0.0011688191,0.0035238955,0.0015191603,0.0031334623,0.003417047,0.0023744148,0.0063424637],"category_scores_gemma":[0.0155601315,0.0010606934,0.0018263523,0.004627163,0.0019807138,0.008174112,0.0028439618,0.002376823,0.0027742498],"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.00053822756,0.00033429128,0.0047403886,0.00064670516,0.00030485718,0.0004798758,0.0015578202,0.0700077,0.0140145,0.46961197,0.045335364,0.3924283],"study_design_scores_gemma":[0.0000434116,0.00008321965,0.0013520669,0.000062400846,0.000089077286,0.0006789072,0.00016650463,0.7259629,0.0030076734,0.23373467,0.03469723,0.000121891535],"about_ca_topic_score_codex":0.0073466543,"about_ca_topic_score_gemma":0.013376308,"teacher_disagreement_score":0.0073466543,"about_ca_system_score_codex":0.0011616008,"about_ca_system_score_gemma":0.0014903325,"threshold_uncertainty_score":0.021217704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23262925,0.0010076368,0.76054484,0.000394664,0.00010789766,0.0001296132,0.00007674225,0.002095452,0.0030139177],"genre_scores_gemma":[0.80107033,0.00023536231,0.19709188,0.00017708921,0.000028243676,0.0001128555,0.00014997937,0.00015057958,0.0009836755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998961,0.0004882344,0.000078486686,0.00024015481,0.00014500403,0.00008711986],"domain_scores_gemma":[0.99531883,0.0030909374,0.00019846956,0.0008934874,0.00034249222,0.00015564733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023682162,0.0009037516,0.0006792231,0.00024822893,0.0004271232,0.00089392293,0.0010149669,0.0009694697,0.0011499099],"category_scores_gemma":[0.010766006,0.0005981241,0.0002994373,0.00026871433,0.00075729756,0.0018347009,0.0008233417,0.0022859538,0.0004435473],"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.0010193089,0.00094818696,0.00597988,0.0002653667,0.00012152137,0.0001828043,0.00035192864,0.3391735,0.16177206,0.004298137,0.001051577,0.48483577],"study_design_scores_gemma":[0.0000393183,0.00023968973,0.0036314118,0.000034711516,0.000037438505,0.000111494046,0.000056170724,0.900795,0.09020231,0.0035598683,0.0012493114,0.000043307664],"about_ca_topic_score_codex":0.0027238012,"about_ca_topic_score_gemma":0.0056898687,"teacher_disagreement_score":0.0027238012,"about_ca_system_score_codex":0.00052065845,"about_ca_system_score_gemma":0.0007364769,"threshold_uncertainty_score":0.012524426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050141692,0.0011793529,0.9411966,0.0014052001,0.00014052168,0.000109054985,0.00016502247,0.0003427577,0.005319718],"genre_scores_gemma":[0.9106666,0.0005999363,0.08011164,0.0005231929,0.00020478175,0.00031363041,0.00017475184,0.00009434422,0.007311143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712604,0.0016080446,0.000117151234,0.00042004875,0.0003733291,0.00035528655],"domain_scores_gemma":[0.9859555,0.0116011845,0.0010433964,0.00044747946,0.0005864671,0.00036594135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046566236,0.0016679371,0.0028075809,0.0006033864,0.00057715335,0.0020746093,0.0017977408,0.0026419156,0.0039855186],"category_scores_gemma":[0.01796605,0.00101398,0.00074205274,0.0012913948,0.0023932252,0.002698834,0.0018570033,0.0024936919,0.00072970736],"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.00020835077,0.00007624349,0.00027939954,0.00009157399,0.000047484307,0.00008223055,0.00004810502,0.9669283,0.00034359194,0.023920663,0.00074560964,0.0072284746],"study_design_scores_gemma":[0.000021291044,0.000025948675,0.00003960929,0.000006844064,0.0000059464755,0.000010030473,0.000006032451,0.9871996,0.00010655334,0.012449367,0.0001238216,0.0000049000655],"about_ca_topic_score_codex":0.0038174414,"about_ca_topic_score_gemma":0.002716131,"teacher_disagreement_score":0.0046566236,"about_ca_system_score_codex":0.0017667986,"about_ca_system_score_gemma":0.0014921409,"threshold_uncertainty_score":0.02462691},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010106214,0.00013937008,0.987566,0.00021741631,0.00002802218,0.000028106111,0.00018289215,0.0010257759,0.0007060915],"genre_scores_gemma":[0.670287,0.00022886203,0.32250026,0.00040156505,0.00017760148,0.00020995976,0.0023520242,0.00047246937,0.0033702487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841,0.00065888383,0.00006700948,0.0004849038,0.00026366577,0.00011560568],"domain_scores_gemma":[0.9936651,0.004162259,0.00036288355,0.0011060354,0.0005468098,0.00015707802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021486098,0.0011280758,0.0012315137,0.0008571808,0.0006075025,0.0011794649,0.001936431,0.001283231,0.0042225597],"category_scores_gemma":[0.014020505,0.0006367074,0.0008266644,0.0010369117,0.0010571984,0.003859664,0.0021342074,0.0031046914,0.0013356978],"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.00031374043,0.00022693028,0.002240356,0.0002461713,0.0001295072,0.00017643374,0.0002811796,0.6887457,0.0045439266,0.059489697,0.009608219,0.23399824],"study_design_scores_gemma":[0.000007820779,0.000013504965,0.000090730704,0.000007041961,0.0000057983625,0.000008049914,0.000009199228,0.95084083,0.0006490156,0.04803531,0.00032689763,0.0000058066294],"about_ca_topic_score_codex":0.0024105406,"about_ca_topic_score_gemma":0.005600625,"teacher_disagreement_score":0.0042225597,"about_ca_system_score_codex":0.0009440248,"about_ca_system_score_gemma":0.0009794146,"threshold_uncertainty_score":0.014125884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005500892,0.0001117093,0.9931767,0.00007897606,0.000008082738,0.000029882542,0.000013900503,0.00006507704,0.0010147325],"genre_scores_gemma":[0.48055756,0.0005287553,0.5150491,0.00014149975,0.00003530925,0.00058386667,0.00016395688,0.00014930607,0.0027906077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852294,0.0007016817,0.00007240925,0.00016288602,0.00040359877,0.0001365501],"domain_scores_gemma":[0.99559826,0.0032636793,0.00022475187,0.00036067062,0.00040461283,0.00014809208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003997158,0.0008676283,0.0014144941,0.0009974341,0.000618304,0.0011800274,0.0017324853,0.0013342128,0.0027378506],"category_scores_gemma":[0.013598277,0.000559744,0.0010220882,0.0009199546,0.0019933071,0.0022307243,0.0028011228,0.0025896821,0.0004344501],"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.00005438016,0.000045842986,0.0003256291,0.000089906556,0.000035149635,0.000040732935,0.00012763329,0.6509156,0.0011964298,0.31130597,0.0005792712,0.035283495],"study_design_scores_gemma":[0.000008303163,0.000019995714,0.000020965881,0.0000119246115,0.000004121448,0.0000058645446,0.000008808714,0.94096196,0.00030356488,0.0583292,0.00032080323,0.0000045344664],"about_ca_topic_score_codex":0.0025779523,"about_ca_topic_score_gemma":0.002156374,"teacher_disagreement_score":0.003997158,"about_ca_system_score_codex":0.0018725947,"about_ca_system_score_gemma":0.0014359328,"threshold_uncertainty_score":0.021139264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018685622,0.0010740354,0.956365,0.0035290786,0.00014619694,0.00005401591,0.00025231385,0.00047830466,0.019415468],"genre_scores_gemma":[0.78616637,0.0020196582,0.19757333,0.0018641324,0.00040282836,0.00044859186,0.0005222834,0.00047334228,0.010529501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975205,0.0012414679,0.0001266238,0.00036321284,0.0005359148,0.00021216944],"domain_scores_gemma":[0.98760843,0.010090695,0.00033208734,0.0015337826,0.00026488715,0.00017003002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040149507,0.0010501011,0.0012985559,0.0006255732,0.0010867888,0.0031331195,0.00242156,0.0020009514,0.0059704934],"category_scores_gemma":[0.021835083,0.0008296019,0.0016533879,0.0008056996,0.006115099,0.010095408,0.003879113,0.0068395073,0.0009960444],"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.000054206354,0.000018426643,0.00023012128,0.00007857188,0.000031887488,0.000050733302,0.00011063422,0.123031415,0.0006861915,0.8660434,0.00096086675,0.008703632],"study_design_scores_gemma":[0.000008650472,0.000010571544,0.000032664324,0.0000199492,0.0000065604545,0.000031066254,0.000012013177,0.20797302,0.00029335747,0.7906273,0.0009777949,0.000007099728],"about_ca_topic_score_codex":0.0018816217,"about_ca_topic_score_gemma":0.0018048348,"teacher_disagreement_score":0.0059704934,"about_ca_system_score_codex":0.0016921366,"about_ca_system_score_gemma":0.001036176,"threshold_uncertainty_score":0.02123338},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068203355,0.001878941,0.9859409,0.0010821385,0.00015687996,0.000047225894,0.00018419673,0.00044220753,0.0034471967],"genre_scores_gemma":[0.4604353,0.0074484046,0.51091695,0.002214813,0.0024228555,0.0010119845,0.0017504176,0.001166172,0.012633104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943311,0.0018702981,0.0002831337,0.0011246944,0.0019287847,0.0004619634],"domain_scores_gemma":[0.9640322,0.02223328,0.0018623611,0.006005475,0.0048874826,0.0009792362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008882251,0.002706147,0.0020037338,0.0019452188,0.0012555029,0.0023936294,0.0033302924,0.0026626065,0.004689201],"category_scores_gemma":[0.055787943,0.0008861514,0.0019818349,0.0025764643,0.0041106204,0.006741687,0.006704254,0.010478996,0.0021840846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039532094,0.00019917809,0.0029000144,0.00056563696,0.0002664879,0.00042385585,0.00043778055,0.33600786,0.010859163,0.46128124,0.02117761,0.16548581],"study_design_scores_gemma":[0.000017872751,0.00007778762,0.0007445809,0.00007179204,0.000033841206,0.00017591592,0.00003430621,0.83113456,0.0019312985,0.16162455,0.0041039293,0.000049488175],"about_ca_topic_score_codex":0.0025032156,"about_ca_topic_score_gemma":0.0027005034,"teacher_disagreement_score":0.008882251,"about_ca_system_score_codex":0.0025523033,"about_ca_system_score_gemma":0.002153159,"threshold_uncertainty_score":0.04697442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039057522,0.00008673722,0.9946779,0.00007441272,0.000014942942,0.00004100554,0.000033653123,0.0006676272,0.0004980401],"genre_scores_gemma":[0.23535384,0.00021288442,0.75891817,0.00022465162,0.00006282382,0.00030309436,0.00038148806,0.00035008162,0.0041929847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962103,0.00011494203,0.000025517242,0.000082679966,0.00010142147,0.000054458327],"domain_scores_gemma":[0.9992525,0.00029308355,0.000053803822,0.0001990416,0.00016453845,0.00003696532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012639746,0.0012371358,0.0009397142,0.00046331808,0.0004064733,0.00058507995,0.0024613675,0.0013544674,0.0029670633],"category_scores_gemma":[0.0030690036,0.0008333494,0.0009318423,0.0005834359,0.00060381816,0.0018217796,0.001434081,0.0025091828,0.0010593281],"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.00023692733,0.00020802733,0.0014638295,0.0001348314,0.00009508829,0.00016160414,0.00013562737,0.380682,0.03077076,0.024029778,0.005908151,0.5561733],"study_design_scores_gemma":[0.000007699313,0.000039414674,0.00007219146,0.000004349751,0.0000075115827,0.000018715478,0.0000029884457,0.9925685,0.0034379025,0.0032062612,0.00062896084,0.000005473691],"about_ca_topic_score_codex":0.0032501593,"about_ca_topic_score_gemma":0.0061808606,"teacher_disagreement_score":0.0032501593,"about_ca_system_score_codex":0.0005515408,"about_ca_system_score_gemma":0.00095953565,"threshold_uncertainty_score":0.009925783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010642525,0.0017399417,0.9824379,0.0021015361,0.00012474181,0.00008297386,0.0004947199,0.00049091724,0.0018847052],"genre_scores_gemma":[0.5859567,0.0034935484,0.37939593,0.0013600655,0.00085293833,0.0009869392,0.0025687686,0.00047832937,0.024906741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98996556,0.006331973,0.00056425034,0.0014145259,0.0011277347,0.00059599074],"domain_scores_gemma":[0.9635919,0.028241083,0.0014684851,0.004049144,0.002014934,0.0006344322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013471357,0.0015876709,0.0056432975,0.0032358095,0.0030566438,0.0051918826,0.008376872,0.0056591057,0.009962976],"category_scores_gemma":[0.05348653,0.0022022463,0.0032345052,0.0049383086,0.00452158,0.01157277,0.0037445775,0.0073996303,0.003321034],"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.00044348626,0.00021268093,0.0017939522,0.00029058798,0.00024618197,0.00011419187,0.00032073248,0.40255362,0.00025748927,0.5048909,0.009807576,0.07906865],"study_design_scores_gemma":[0.000026566013,0.000012990677,0.00015393796,0.000021437521,0.00001993904,0.000024668861,0.000016209939,0.67709756,0.00008411543,0.32188547,0.00062895153,0.00002814651],"about_ca_topic_score_codex":0.015265314,"about_ca_topic_score_gemma":0.024396574,"teacher_disagreement_score":0.015265314,"about_ca_system_score_codex":0.0047708573,"about_ca_system_score_gemma":0.0034129021,"threshold_uncertainty_score":0.07124418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033333905,0.00025939356,0.9026901,0.004227566,0.00015690761,0.00027141525,0.00030779082,0.00018859914,0.058564335],"genre_scores_gemma":[0.8316366,0.0005612513,0.13757774,0.0012224024,0.00023096123,0.00077148917,0.00023752492,0.00008469293,0.027677272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978479,0.0010288687,0.00009955246,0.00036144664,0.0004240786,0.00023814349],"domain_scores_gemma":[0.9973985,0.0018452127,0.00016731402,0.0002379865,0.00015361418,0.0001974568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872421,0.00092004536,0.00082926947,0.00049338693,0.0007206766,0.0025056303,0.0018944679,0.0019948615,0.009315164],"category_scores_gemma":[0.0088555375,0.00040522616,0.000789504,0.0004470034,0.002414679,0.0038298955,0.0026424723,0.0030527448,0.00069071323],"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.0000223096,0.00004084093,0.0001341651,0.000039347306,0.000017712975,0.000037029455,0.00007685124,0.037474673,0.0003344014,0.95220643,0.0017063417,0.007909953],"study_design_scores_gemma":[0.000023468629,0.000027965025,0.00005092268,0.00001314842,0.000006269564,0.000021137856,0.000024681567,0.2325472,0.00020659632,0.7637894,0.003281743,0.000007566368],"about_ca_topic_score_codex":0.001833345,"about_ca_topic_score_gemma":0.001875316,"teacher_disagreement_score":0.009315164,"about_ca_system_score_codex":0.0019584498,"about_ca_system_score_gemma":0.001558196,"threshold_uncertainty_score":0.031162322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017350531,0.00002830973,0.9978436,0.000034648914,0.000010447516,0.000014188241,0.0000104351575,0.00014037281,0.00018277501],"genre_scores_gemma":[0.13852346,0.00020434066,0.8577656,0.00017446591,0.000108069864,0.000278513,0.0002071911,0.0003898205,0.0023484973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983234,0.0007560043,0.000051988984,0.00039164792,0.00036699037,0.00010989853],"domain_scores_gemma":[0.9949877,0.0034097505,0.00031500662,0.00079588336,0.00030023052,0.00019139657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964267,0.0011570867,0.0018514488,0.0015355246,0.0011569286,0.0016064009,0.0040033855,0.0018309793,0.0027292427],"category_scores_gemma":[0.015253749,0.0014369888,0.0014448584,0.0016224827,0.0025886477,0.0044112275,0.002950309,0.0030844235,0.0006582381],"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.00015457215,0.00009086291,0.0013642916,0.000090084126,0.00014517856,0.0001267152,0.0002778357,0.63340056,0.0021959885,0.26908836,0.0018479603,0.091217555],"study_design_scores_gemma":[0.000010045075,0.000013089572,0.00008015591,0.000004985156,0.000007606771,0.000019735375,0.000007173212,0.9404212,0.00039540243,0.058452357,0.0005794167,0.000008825136],"about_ca_topic_score_codex":0.0045382055,"about_ca_topic_score_gemma":0.0046273936,"teacher_disagreement_score":0.0045382055,"about_ca_system_score_codex":0.0017285042,"about_ca_system_score_gemma":0.0015279368,"threshold_uncertainty_score":0.020965278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066659,0.0019066285,0.8304543,0.0116105275,0.0013111678,0.000092676106,0.0004258773,0.0015392095,0.08600063],"genre_scores_gemma":[0.8364916,0.00086176966,0.1298685,0.0017856428,0.00033092807,0.0001316258,0.00017590464,0.00019660409,0.03015734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994779,0.00019370209,0.000016058628,0.00015356421,0.00010942717,0.00004933003],"domain_scores_gemma":[0.9984397,0.0008685214,0.00009563507,0.0003366716,0.00014182703,0.000117617776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011409264,0.0003687907,0.000657206,0.0004892859,0.0006846544,0.0016999785,0.00077138696,0.0014816808,0.008261774],"category_scores_gemma":[0.004592928,0.00034609588,0.0006735541,0.00026226582,0.0024343855,0.0026884507,0.0012088623,0.0015356585,0.0008663611],"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.00011760708,0.000033257365,0.0012060935,0.00006850389,0.000084569394,0.00011808135,0.00016821985,0.041336976,0.0026164844,0.92829436,0.0063213827,0.019634444],"study_design_scores_gemma":[0.00004948051,0.000077873694,0.0010457038,0.000036537218,0.000030127097,0.00014982959,0.000036550846,0.29802006,0.00093934365,0.6845153,0.015058764,0.000040515977],"about_ca_topic_score_codex":0.00437669,"about_ca_topic_score_gemma":0.0028414421,"teacher_disagreement_score":0.008261774,"about_ca_system_score_codex":0.0010038055,"about_ca_system_score_gemma":0.0007126096,"threshold_uncertainty_score":0.027638376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025838178,0.0001567848,0.9696632,0.00038271578,0.000028384797,0.000018347377,0.000044040193,0.00018716144,0.003681133],"genre_scores_gemma":[0.86607873,0.0003284786,0.12891588,0.00016424847,0.000058953887,0.00010920792,0.000091936156,0.000068475216,0.0041842316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990357,0.00045601957,0.00003881471,0.00018057755,0.00021993324,0.00006885897],"domain_scores_gemma":[0.9962475,0.00275501,0.00038946,0.00027267553,0.00023384778,0.00010160302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016171935,0.00040327254,0.0006783162,0.000691619,0.00038018162,0.0012241913,0.0016515778,0.0011972773,0.002321998],"category_scores_gemma":[0.010492873,0.0004556398,0.00066415576,0.0006130379,0.00171656,0.0026286533,0.0012957032,0.0011242989,0.00033939737],"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.000044713426,0.000022153503,0.0005675996,0.000033656837,0.00002923794,0.00006065752,0.00006350975,0.69767135,0.0011252258,0.2827789,0.00038787525,0.017215049],"study_design_scores_gemma":[0.000003951636,0.0000055131577,0.000048437683,0.000002750147,0.0000032107707,0.0000120742725,0.0000025322956,0.9217254,0.00019293425,0.07775767,0.00024111148,0.000004446971],"about_ca_topic_score_codex":0.002020873,"about_ca_topic_score_gemma":0.0016721991,"teacher_disagreement_score":0.002321998,"about_ca_system_score_codex":0.0011493833,"about_ca_system_score_gemma":0.0006638179,"threshold_uncertainty_score":0.008552611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006325007,0.00059462385,0.98955816,0.0011098855,0.00002986236,0.00003447432,0.000113377886,0.00012473685,0.002109955],"genre_scores_gemma":[0.6101991,0.0024685746,0.37566933,0.0010885372,0.00062581815,0.00077180855,0.00060339225,0.0003839962,0.008189447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99411964,0.0028015822,0.0002164129,0.0012472578,0.0013170302,0.000298145],"domain_scores_gemma":[0.9710679,0.022341987,0.0017987778,0.0026739163,0.0013910931,0.0007263282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010055932,0.0015028737,0.0017712185,0.0018776623,0.0012529489,0.0033475887,0.004184745,0.0039465614,0.0046338774],"category_scores_gemma":[0.032677114,0.0014551308,0.0026305916,0.0017788429,0.008269924,0.012134577,0.005440655,0.007433222,0.0010528439],"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.000017324519,0.000022744609,0.00048613423,0.000059381797,0.00002707612,0.000077567915,0.00019230199,0.05802064,0.00014517641,0.9348754,0.0004741747,0.0056021763],"study_design_scores_gemma":[0.0000058163632,0.000020299767,0.000074876676,0.000017519998,0.0000054277684,0.00002982467,0.000010652971,0.24264383,0.00009347159,0.756469,0.000618279,0.000010986646],"about_ca_topic_score_codex":0.0024210094,"about_ca_topic_score_gemma":0.0020378355,"teacher_disagreement_score":0.010055932,"about_ca_system_score_codex":0.0034062576,"about_ca_system_score_gemma":0.0017202139,"threshold_uncertainty_score":0.05318147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003123935,0.000307716,0.9953941,0.00014733896,0.000025170308,0.000030081994,0.000113636364,0.0004514712,0.0004065801],"genre_scores_gemma":[0.19460465,0.0011322983,0.79528725,0.0003550984,0.0004452785,0.000649566,0.0020088246,0.00068406353,0.004832927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653924,0.0015703192,0.0001779117,0.0009036454,0.0005925183,0.00021626704],"domain_scores_gemma":[0.9936511,0.0044546975,0.0004735098,0.000830329,0.00043352778,0.00015687235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048880004,0.0010653244,0.002173879,0.0020833644,0.0009993812,0.0016147017,0.0028022365,0.0022661616,0.0046988227],"category_scores_gemma":[0.020576011,0.001313054,0.0016003089,0.0029561203,0.0013807676,0.0052228896,0.0025748645,0.0033422809,0.002330843],"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.0005808195,0.00031796444,0.0019946382,0.0004534352,0.00023099319,0.00029236692,0.0006417193,0.3554786,0.008479263,0.2023569,0.012738475,0.41643482],"study_design_scores_gemma":[0.00002813839,0.000019417032,0.0002743747,0.000016810085,0.000017292132,0.00007051937,0.000023200304,0.8843915,0.0011100927,0.11140684,0.0026133633,0.00002841165],"about_ca_topic_score_codex":0.0035136966,"about_ca_topic_score_gemma":0.0046909014,"teacher_disagreement_score":0.0048880004,"about_ca_system_score_codex":0.0016416915,"about_ca_system_score_gemma":0.0018436717,"threshold_uncertainty_score":0.025850534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033705495,0.00036947863,0.9940601,0.00021989476,0.000044849225,0.000039754108,0.00014071654,0.0008932609,0.0008613774],"genre_scores_gemma":[0.20600925,0.0011859275,0.78674835,0.00024675482,0.00030330615,0.00034892967,0.0015751795,0.00048819944,0.0030941532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957176,0.0024098821,0.0002281697,0.00075095246,0.00075758965,0.00013594548],"domain_scores_gemma":[0.9914836,0.0041892985,0.00081768923,0.00214417,0.0011452604,0.00021993308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039814077,0.0014814482,0.0012982485,0.0018705167,0.00082389545,0.0025904952,0.0018029304,0.001337885,0.0026379267],"category_scores_gemma":[0.019001301,0.0009234506,0.0011968565,0.0020359706,0.0016952826,0.0036377439,0.0027547877,0.0028925778,0.00142186],"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.00017874553,0.00011761981,0.0017783104,0.00044643425,0.00028867729,0.000112979,0.00019617357,0.53058356,0.0042632343,0.11378281,0.012373285,0.33587816],"study_design_scores_gemma":[0.000009270379,0.000021551503,0.00013655827,0.00002078524,0.000009846007,0.000021378935,0.000011526329,0.9035607,0.0012020435,0.09271883,0.002277274,0.00001027578],"about_ca_topic_score_codex":0.002488069,"about_ca_topic_score_gemma":0.0031908778,"teacher_disagreement_score":0.0039814077,"about_ca_system_score_codex":0.0013720825,"about_ca_system_score_gemma":0.0017809481,"threshold_uncertainty_score":0.021055996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018415922,0.00022748762,0.9794392,0.0003134309,0.000018378805,0.000023844761,0.00022623365,0.0001622836,0.0011731135],"genre_scores_gemma":[0.82391447,0.00094126596,0.16503079,0.0004482683,0.00012616237,0.00022881097,0.0011393381,0.00018413851,0.007986588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984701,0.00069380493,0.00004875551,0.00046298964,0.00021498957,0.000109336215],"domain_scores_gemma":[0.9933242,0.0043436354,0.00095250265,0.0007700537,0.0004163462,0.00019325095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002770947,0.00089044776,0.0010245983,0.0016722041,0.00040160102,0.0013650275,0.0023436395,0.0015497863,0.003237454],"category_scores_gemma":[0.011870229,0.0006525546,0.0010896531,0.0015320873,0.002151545,0.0036157263,0.0018037853,0.001743787,0.00055821385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068531685,0.00003860455,0.0030279004,0.00011482447,0.00008188077,0.00019142771,0.00020496213,0.45257953,0.0016010797,0.51337415,0.002092713,0.026624393],"study_design_scores_gemma":[0.0000058123765,0.000012877427,0.0003987058,0.000007919251,0.000011336708,0.000049659055,0.000015689122,0.83287734,0.00019873645,0.16551149,0.0008988428,0.000011631667],"about_ca_topic_score_codex":0.0029571129,"about_ca_topic_score_gemma":0.0034523765,"teacher_disagreement_score":0.003237454,"about_ca_system_score_codex":0.0016135598,"about_ca_system_score_gemma":0.0006012248,"threshold_uncertainty_score":0.014654338},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06365862,0.00021738072,0.93188614,0.0005010628,0.000047214962,0.00011366783,0.0000398306,0.0026783776,0.00085758977],"genre_scores_gemma":[0.69078976,0.00013950768,0.30521217,0.00039958395,0.00011301728,0.0002605238,0.00021544797,0.0006256437,0.0022444308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627435,0.0014105574,0.00018514489,0.0006884687,0.0011482777,0.000293307],"domain_scores_gemma":[0.9760873,0.015558769,0.0018169275,0.0037555809,0.0021459586,0.0006354892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068431846,0.0011526587,0.0018820113,0.0009698988,0.00088225777,0.0013548841,0.0029780779,0.002459132,0.001606128],"category_scores_gemma":[0.0374422,0.0009787389,0.0010702081,0.0007156654,0.0021100282,0.003328057,0.003508403,0.00353776,0.0008733585],"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.0007050936,0.00044141957,0.0073783044,0.00011936762,0.00011633579,0.00023984192,0.000796414,0.72286165,0.013666531,0.018067744,0.004461861,0.2311454],"study_design_scores_gemma":[0.000012058131,0.000057715,0.00014729456,0.0000050862072,0.0000060181947,0.000017908145,0.000014136736,0.9944471,0.0014360138,0.003639071,0.00021080607,0.000006714696],"about_ca_topic_score_codex":0.00328941,"about_ca_topic_score_gemma":0.00340275,"teacher_disagreement_score":0.0068431846,"about_ca_system_score_codex":0.0010511306,"about_ca_system_score_gemma":0.0026522987,"threshold_uncertainty_score":0.03619063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024484948,0.00019282581,0.99618226,0.00022388353,0.00004748385,0.00003028377,0.000052183437,0.00041960514,0.000403009],"genre_scores_gemma":[0.37800494,0.0007731017,0.6106711,0.00086953957,0.00046391122,0.00051722664,0.00074295764,0.00040697173,0.007550268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976973,0.00083393237,0.00011809186,0.00059348106,0.0005466624,0.0002105508],"domain_scores_gemma":[0.9917515,0.0051289564,0.00052607333,0.0014828471,0.0008601735,0.0002503558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004907061,0.0021166771,0.0028034414,0.001119912,0.0009003609,0.001945464,0.005128734,0.0028864394,0.004645112],"category_scores_gemma":[0.021966113,0.0011309157,0.0013937477,0.0012373114,0.0018501785,0.0053983754,0.0031721655,0.004708969,0.0018598913],"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.0007733768,0.00015916457,0.0022828698,0.00025044198,0.00024454625,0.0002681413,0.00022900841,0.6102133,0.0038281882,0.12288475,0.005809211,0.253057],"study_design_scores_gemma":[0.000025103009,0.000055592474,0.00009431011,0.000015411688,0.000018978331,0.00005141184,0.0000051980255,0.95954764,0.0013332032,0.037800398,0.0010365015,0.000016241931],"about_ca_topic_score_codex":0.0021693811,"about_ca_topic_score_gemma":0.002469458,"teacher_disagreement_score":0.005128734,"about_ca_system_score_codex":0.0010432514,"about_ca_system_score_gemma":0.002555222,"threshold_uncertainty_score":0.025951326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047613727,0.00017369069,0.99367356,0.00016728698,0.000023995444,0.000013195839,0.00007265406,0.00020423454,0.00091006415],"genre_scores_gemma":[0.65005624,0.0011706608,0.3236466,0.0005790457,0.00022497166,0.00029732505,0.0009361312,0.0002507128,0.022838242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995485,0.00015162077,0.000015967169,0.00011416517,0.000115438335,0.00005421953],"domain_scores_gemma":[0.9988832,0.00063230016,0.00010683745,0.00014910533,0.00015654878,0.00007199077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011659003,0.00097547175,0.001189024,0.00055448787,0.00030144435,0.0009847014,0.0017437688,0.0019829,0.003876013],"category_scores_gemma":[0.003729645,0.000747553,0.0008290325,0.0005847249,0.001328343,0.0023482856,0.0018054533,0.002606472,0.0010005868],"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.000068107205,0.0000409447,0.00033836643,0.00008684566,0.000051557698,0.000065,0.000057041092,0.8261307,0.0016314776,0.13618071,0.0022454285,0.033103764],"study_design_scores_gemma":[0.0000044801095,0.000012800712,0.000026192241,0.0000041325397,0.0000035231917,0.000007702693,0.0000024554079,0.9662722,0.00018148641,0.033161417,0.00032035066,0.0000031900495],"about_ca_topic_score_codex":0.002267306,"about_ca_topic_score_gemma":0.003596968,"teacher_disagreement_score":0.003876013,"about_ca_system_score_codex":0.000841632,"about_ca_system_score_gemma":0.0010527329,"threshold_uncertainty_score":0.012966514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034469035,0.0003710468,0.96253663,0.00021789367,0.00003336238,0.00003790066,0.00015948468,0.0012682788,0.0009063553],"genre_scores_gemma":[0.50544584,0.0002905811,0.49146742,0.00023032898,0.00007450375,0.00019414595,0.000750451,0.00029746466,0.0012492669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980508,0.0009051067,0.00011391293,0.00032917503,0.00046120575,0.00013992167],"domain_scores_gemma":[0.9925978,0.004871279,0.00045913446,0.0011908945,0.000606967,0.00027381862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003966081,0.0009775539,0.0016329079,0.0012709717,0.0006410005,0.0018081263,0.0023407447,0.0014739801,0.0024757853],"category_scores_gemma":[0.016403586,0.0010528108,0.0013197692,0.0010102326,0.001156766,0.004316409,0.002646634,0.0030000813,0.0009543779],"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.00029684804,0.000121199955,0.0037532197,0.00011490093,0.00010916754,0.00014762368,0.0002226873,0.7521582,0.0032077741,0.05086251,0.00363499,0.18537079],"study_design_scores_gemma":[0.0000094816405,0.000021317786,0.00008500393,0.000009178027,0.000004629257,0.000019469036,0.0000114208115,0.9760978,0.000513524,0.022954222,0.00026655328,0.0000073424208],"about_ca_topic_score_codex":0.0027953014,"about_ca_topic_score_gemma":0.003630375,"teacher_disagreement_score":0.003966081,"about_ca_system_score_codex":0.0010318318,"about_ca_system_score_gemma":0.0012113728,"threshold_uncertainty_score":0.020974874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048804455,0.00006589899,0.9942228,0.00010588129,0.0000070626947,0.000010748689,0.00006544392,0.00017027021,0.00047145493],"genre_scores_gemma":[0.5370622,0.00043654826,0.4532299,0.00023573764,0.00006650807,0.00025603359,0.00094767904,0.00034536808,0.0074199834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00039137248,0.000029014558,0.00018119598,0.00013394323,0.00008117717],"domain_scores_gemma":[0.9980081,0.0012674164,0.00020426339,0.00026892737,0.00017379672,0.00007756469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611717,0.0011071791,0.0010249995,0.00046252884,0.00033550584,0.0011881238,0.0019824593,0.0011907576,0.002929813],"category_scores_gemma":[0.0045773066,0.0010680895,0.0010503528,0.0007215841,0.0011108641,0.0023792689,0.0018768447,0.0023871039,0.00073184405],"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.000060630886,0.000027985498,0.00035798247,0.000046236226,0.00003980892,0.00005051172,0.00005388695,0.9340457,0.0013716806,0.04571227,0.0009961441,0.017237239],"study_design_scores_gemma":[0.0000015240176,0.0000031665747,0.000022052487,0.0000011894477,0.0000014077516,0.0000030125404,0.0000012380232,0.9934989,0.00014497913,0.0062230406,0.00009765077,0.0000019264821],"about_ca_topic_score_codex":0.0059137424,"about_ca_topic_score_gemma":0.00728046,"teacher_disagreement_score":0.0059137424,"about_ca_system_score_codex":0.001175289,"about_ca_system_score_gemma":0.0012921368,"threshold_uncertainty_score":0.0117586255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04978753,0.00030440438,0.9469465,0.00049482996,0.000038896935,0.00003335889,0.00016316577,0.00057294086,0.0016584008],"genre_scores_gemma":[0.7629579,0.0004941889,0.22861657,0.0006550744,0.00009633833,0.00013516033,0.0007656937,0.00023515055,0.006043991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.00016811112,0.000021518243,0.00019930492,0.00010660356,0.00007324876],"domain_scores_gemma":[0.99880743,0.00056493917,0.00012374471,0.00034163424,0.000088084256,0.00007420834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009781884,0.0011725437,0.00096538325,0.00070117705,0.00043311942,0.0010934741,0.0017703301,0.0016853734,0.002168514],"category_scores_gemma":[0.004189286,0.0005603942,0.00072503334,0.0008227144,0.0011672637,0.0035668921,0.002200895,0.0035692928,0.00067972403],"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.00022004501,0.00023336442,0.0017270023,0.00028344925,0.00016658695,0.00028554746,0.00036679325,0.56489503,0.023846904,0.12805958,0.0060598976,0.2738557],"study_design_scores_gemma":[0.000008910661,0.000046443784,0.0001304562,0.000015201364,0.000012699591,0.00004069737,0.000023272296,0.91804934,0.0016642838,0.07910993,0.00089099724,0.000007818681],"about_ca_topic_score_codex":0.0011578458,"about_ca_topic_score_gemma":0.0029515391,"teacher_disagreement_score":0.002168514,"about_ca_system_score_codex":0.00088935555,"about_ca_system_score_gemma":0.00067979726,"threshold_uncertainty_score":0.007254362},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003380172,0.00012142773,0.9957426,0.00017104665,0.000015917345,0.0000140711145,0.000029353861,0.00034446677,0.0001810224],"genre_scores_gemma":[0.20167533,0.00043727242,0.7942914,0.00038646685,0.00013854944,0.00018974757,0.00056710915,0.00041726418,0.0018969411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850583,0.00077080575,0.000055713288,0.0003096622,0.0002532176,0.00010488087],"domain_scores_gemma":[0.9926167,0.0059359237,0.0004542049,0.00046953638,0.00039213037,0.00013151286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034370194,0.0013794308,0.0017399058,0.0009097293,0.0005748273,0.0012756992,0.0020048784,0.0016722367,0.0016964774],"category_scores_gemma":[0.01674611,0.0009843558,0.001056997,0.001222518,0.0015372663,0.0020374118,0.0018449638,0.002892198,0.0010204819],"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.000089506895,0.0000613181,0.0010849377,0.00014671202,0.000086101994,0.00010567149,0.000107297295,0.87679315,0.00323573,0.024641922,0.0029813931,0.09066625],"study_design_scores_gemma":[0.0000056078616,0.000006915321,0.00007024989,0.0000037223622,0.0000027196063,0.000011754923,0.000003958057,0.9916466,0.00039248622,0.007655874,0.00019583714,0.000004288202],"about_ca_topic_score_codex":0.0073300083,"about_ca_topic_score_gemma":0.007614419,"teacher_disagreement_score":0.0073300083,"about_ca_system_score_codex":0.0009477689,"about_ca_system_score_gemma":0.0018209448,"threshold_uncertainty_score":0.018176854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014101445,0.00019734085,0.9973918,0.00010339886,0.000021127744,0.000008369451,0.0000142277395,0.00006733781,0.0007861944],"genre_scores_gemma":[0.308607,0.0020089902,0.6788877,0.0003430313,0.00036134603,0.00026979766,0.00038674177,0.00019445512,0.0089408895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891734,0.0004243874,0.00006437879,0.00022664707,0.0002870333,0.00008025529],"domain_scores_gemma":[0.9954194,0.0038782037,0.00021413654,0.00019599406,0.00023490078,0.000057277255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023482218,0.00083265925,0.0010469571,0.0006816081,0.00062556606,0.001531418,0.0009508836,0.0014284307,0.0029409833],"category_scores_gemma":[0.00951718,0.000612465,0.0011639551,0.00068104226,0.001385222,0.0022898798,0.0013340241,0.0027874545,0.00060379365],"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.000057493344,0.000046702233,0.0005991149,0.0001962094,0.00006923977,0.00017017145,0.00022511947,0.50731754,0.002346612,0.39878514,0.0010778357,0.08910884],"study_design_scores_gemma":[0.000004508115,0.000012206134,0.000051706185,0.000015298276,0.000007918201,0.000026586684,0.000011934267,0.89694154,0.0005845731,0.100823484,0.0015104056,0.000009830744],"about_ca_topic_score_codex":0.0047682435,"about_ca_topic_score_gemma":0.0037683162,"teacher_disagreement_score":0.0047682435,"about_ca_system_score_codex":0.0013688868,"about_ca_system_score_gemma":0.0011450807,"threshold_uncertainty_score":0.012418747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02005196,0.00022564334,0.97747624,0.00029794525,0.00005856693,0.00005837544,0.000035941575,0.00036995253,0.0014255047],"genre_scores_gemma":[0.7244484,0.00023957608,0.27097338,0.00027804953,0.00011790712,0.0002940262,0.00012583267,0.0001783541,0.003344543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873155,0.00043563382,0.000111735324,0.00033369716,0.00025951708,0.00012792854],"domain_scores_gemma":[0.990567,0.006690543,0.0007687417,0.00079596293,0.00084816647,0.000329506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039599864,0.0010228028,0.0013298645,0.0006717373,0.00043715956,0.0012838929,0.0023752574,0.0022743747,0.0036491062],"category_scores_gemma":[0.026426772,0.00081203185,0.00051111827,0.00046011704,0.0016176414,0.00390638,0.0022573704,0.0033676785,0.00067321974],"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.0006327587,0.00026381636,0.0033317644,0.0002714798,0.00012816921,0.00022392473,0.00046679488,0.63512546,0.0053490163,0.08369867,0.0048460686,0.26566216],"study_design_scores_gemma":[0.000021832851,0.00004590535,0.000083616,0.000024696743,0.0000071737745,0.000024003197,0.000015412512,0.98408246,0.0009631889,0.014262846,0.0004590279,0.000009778083],"about_ca_topic_score_codex":0.0018920457,"about_ca_topic_score_gemma":0.002502193,"teacher_disagreement_score":0.0039599864,"about_ca_system_score_codex":0.00086709816,"about_ca_system_score_gemma":0.0012569693,"threshold_uncertainty_score":0.020942628},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029570807,0.00023680831,0.9941876,0.0002410988,0.00005959492,0.00004488296,0.0000802052,0.00029889817,0.001893864],"genre_scores_gemma":[0.24633332,0.0009078752,0.744423,0.00065057614,0.00028709898,0.0003763677,0.0005441493,0.00045923676,0.00601829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712557,0.0012404355,0.0001200306,0.00058940216,0.000644153,0.00028044768],"domain_scores_gemma":[0.9869464,0.009800361,0.0005905999,0.0014829276,0.000978023,0.00020163716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004499832,0.00210997,0.0019376057,0.0013648643,0.0011654,0.0023115461,0.003696883,0.0019686297,0.0071158614],"category_scores_gemma":[0.025203161,0.0011578514,0.0014704039,0.0025156885,0.0018345183,0.005567456,0.002531741,0.0035615137,0.0015374742],"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.00025232698,0.000113698836,0.0008540207,0.00037663215,0.00014563455,0.000120326295,0.00018909632,0.7265286,0.0020747965,0.1376953,0.007177485,0.124472044],"study_design_scores_gemma":[0.000013109065,0.000029157105,0.000057917012,0.00001802995,0.000020814283,0.000027800048,0.000014358438,0.92341405,0.0011300645,0.0732911,0.0019732937,0.000010271813],"about_ca_topic_score_codex":0.004752028,"about_ca_topic_score_gemma":0.006854468,"teacher_disagreement_score":0.0071158614,"about_ca_system_score_codex":0.0018965689,"about_ca_system_score_gemma":0.0019020739,"threshold_uncertainty_score":0.023804963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022959728,0.0001249495,0.9759779,0.00014921163,0.000025971609,0.000039962128,0.00005668319,0.0002514727,0.0004142515],"genre_scores_gemma":[0.7363461,0.00015998632,0.26072654,0.0001462463,0.0000792174,0.0002817407,0.00038167115,0.00013886642,0.001739701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974734,0.0009733317,0.00017201457,0.0008600586,0.00032413666,0.00019697245],"domain_scores_gemma":[0.98947185,0.007191739,0.0008345412,0.0010744429,0.0010643728,0.00036304892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035477034,0.0011207819,0.0017043639,0.0017263768,0.00079555326,0.0020305794,0.0026600738,0.0020714744,0.0020371403],"category_scores_gemma":[0.021060161,0.0006527176,0.0015038886,0.0016535548,0.001556505,0.004814829,0.0024251773,0.0021203202,0.0006159921],"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.0002152951,0.00020594252,0.0044902535,0.0002519262,0.00020060288,0.00017026794,0.00036688877,0.75281495,0.005238489,0.067674,0.0012041274,0.16716726],"study_design_scores_gemma":[0.0000031903824,0.000028617458,0.00013272327,0.0000058391834,0.0000067708847,0.000015602178,0.000019949668,0.957829,0.0005248644,0.041235916,0.00019005965,0.000007438632],"about_ca_topic_score_codex":0.0029207391,"about_ca_topic_score_gemma":0.0024036716,"teacher_disagreement_score":0.0035477034,"about_ca_system_score_codex":0.0013553585,"about_ca_system_score_gemma":0.0011949929,"threshold_uncertainty_score":0.01876223},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042144996,0.00013493096,0.9950819,0.0001469853,0.000009407404,0.00001289461,0.00003148804,0.000101160054,0.00026679842],"genre_scores_gemma":[0.28469643,0.00089990156,0.7111585,0.00023706658,0.00013550586,0.00021150106,0.00042348064,0.00014197343,0.0020956346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990922,0.0003733945,0.00005240739,0.0001719077,0.00025648763,0.00005358853],"domain_scores_gemma":[0.99745256,0.0017450546,0.00032535658,0.00022092779,0.00020888155,0.000047150384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022868544,0.0009018755,0.0008482852,0.00066415896,0.00031073045,0.0007929478,0.0009619036,0.0011891548,0.00080292596],"category_scores_gemma":[0.011077247,0.0004929806,0.00066071126,0.0008258912,0.0012646538,0.001632579,0.0014064106,0.0015548829,0.00039937088],"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.00013014939,0.00004805999,0.0006367372,0.00020468599,0.00005162835,0.00012166258,0.000084885425,0.82893693,0.020600075,0.050924994,0.0018702259,0.096390024],"study_design_scores_gemma":[0.0000058937503,0.000028323773,0.00018044742,0.000009553572,0.000004433352,0.000036048994,0.00000629364,0.9833708,0.0032824802,0.012460934,0.0006049246,0.000009953927],"about_ca_topic_score_codex":0.0016910367,"about_ca_topic_score_gemma":0.0015117811,"teacher_disagreement_score":0.0022868544,"about_ca_system_score_codex":0.00066413486,"about_ca_system_score_gemma":0.00097071927,"threshold_uncertainty_score":0.0120942},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008225677,0.00029727523,0.9809038,0.00035332827,0.0000788518,0.000029465777,0.00008925865,0.00035631275,0.009666111],"genre_scores_gemma":[0.695405,0.00095576374,0.2769836,0.0011596616,0.00026856805,0.00023446503,0.0006998371,0.0006371391,0.023655983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999308,0.00028207354,0.000024092687,0.00016296124,0.00015645637,0.00006650315],"domain_scores_gemma":[0.99920446,0.0004267679,0.000058079655,0.00013186225,0.0001201497,0.00005866841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640802,0.00088665186,0.0008066703,0.0005019062,0.00035052194,0.0012999369,0.0010961969,0.0010478806,0.005920452],"category_scores_gemma":[0.003772416,0.00040772703,0.0007109651,0.0003804621,0.001073784,0.0015725693,0.0022187445,0.00236087,0.0015346769],"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.00012033563,0.000075058975,0.0012412099,0.00013077041,0.00009083921,0.00015616162,0.00012738213,0.49775127,0.0063732625,0.39262393,0.0079840375,0.09332568],"study_design_scores_gemma":[0.000009956478,0.00002340144,0.00011233152,0.000016362097,0.00000932318,0.00006750656,0.000010120786,0.87992626,0.0012262946,0.1136935,0.004896352,0.000008640081],"about_ca_topic_score_codex":0.0006009189,"about_ca_topic_score_gemma":0.00093895796,"teacher_disagreement_score":0.005920452,"about_ca_system_score_codex":0.00068784395,"about_ca_system_score_gemma":0.000616496,"threshold_uncertainty_score":0.019805849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036071165,0.00022414178,0.9988753,0.00006734009,0.000023765286,0.000009471532,0.000022610073,0.000060949293,0.0003557071],"genre_scores_gemma":[0.1876095,0.0026330063,0.8042438,0.0003025697,0.00046756244,0.0003255184,0.0004825374,0.00015964852,0.0037758728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992668,0.00031299668,0.00003345924,0.0001683689,0.0001692408,0.000049077644],"domain_scores_gemma":[0.99858356,0.00086999324,0.00015742045,0.00018742429,0.00015181077,0.00004988564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012741995,0.001588715,0.0012324102,0.0005827578,0.00043886545,0.001002109,0.0012871388,0.0014498264,0.0038435918],"category_scores_gemma":[0.005224845,0.0005721418,0.0011370876,0.0009471073,0.00085109635,0.0018131412,0.0016569779,0.0023599458,0.0017766055],"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.00006047438,0.00007527881,0.0006300385,0.00044555412,0.00014367548,0.00021921292,0.00014692143,0.689268,0.005612988,0.16731618,0.0053715855,0.13071007],"study_design_scores_gemma":[0.0000032761122,0.000020909161,0.00006140652,0.0000120233235,0.000007742975,0.000030500561,0.0000072263783,0.96782726,0.00051179813,0.02982983,0.00167794,0.00000998984],"about_ca_topic_score_codex":0.0029296973,"about_ca_topic_score_gemma":0.0029462944,"teacher_disagreement_score":0.0038435918,"about_ca_system_score_codex":0.00054453313,"about_ca_system_score_gemma":0.0008476453,"threshold_uncertainty_score":0.012858152},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040705763,0.0001350124,0.99444985,0.000073521274,0.000025562094,0.000016351363,0.000016750766,0.00034596614,0.00086649845],"genre_scores_gemma":[0.6943551,0.00030579965,0.29762527,0.00020095467,0.00005755537,0.00020841567,0.000180721,0.00045149692,0.006614653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995004,0.00017095903,0.000027670387,0.00009431076,0.00014915677,0.00005753638],"domain_scores_gemma":[0.9987815,0.0006576595,0.00010250266,0.00013260428,0.0002481574,0.000077586024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015268205,0.0011904303,0.0012005178,0.0004479228,0.00027701783,0.00091525784,0.0010395824,0.0011787686,0.0028959035],"category_scores_gemma":[0.0045821173,0.00051869464,0.00066440966,0.00038376672,0.0012099405,0.0011553207,0.0010035158,0.0019517636,0.0007713178],"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.000045300465,0.000020788619,0.00028697366,0.00003909355,0.000024871777,0.000033672794,0.000029187268,0.96668386,0.0011843621,0.012306958,0.0007803082,0.018564703],"study_design_scores_gemma":[0.0000021107917,0.000006874132,0.000010626962,0.0000018091133,0.0000010415558,0.0000028982095,0.0000010060402,0.99797815,0.00014232377,0.0017261109,0.00012569208,0.0000014033762],"about_ca_topic_score_codex":0.006630737,"about_ca_topic_score_gemma":0.005700902,"teacher_disagreement_score":0.006630737,"about_ca_system_score_codex":0.0015345352,"about_ca_system_score_gemma":0.001590851,"threshold_uncertainty_score":0.013184309},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013638648,0.002200313,0.98049957,0.001190631,0.0001125167,0.00007318397,0.00018711954,0.00044132047,0.0016566651],"genre_scores_gemma":[0.62069,0.0019017333,0.3667084,0.0010118163,0.00079703634,0.0003477303,0.00080751465,0.00017610539,0.0075596147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996885,0.001187373,0.0002173065,0.00094572146,0.0005251573,0.00023934832],"domain_scores_gemma":[0.9877351,0.0075058434,0.0008612297,0.0019676744,0.0016152525,0.00031491075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006196862,0.0021225228,0.0034316224,0.0023862284,0.0011840537,0.0023617316,0.0048260815,0.003588704,0.0025476264],"category_scores_gemma":[0.016377956,0.0014760704,0.0017999122,0.0027333822,0.0017802209,0.006689181,0.0017337021,0.004738626,0.0008921368],"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.00053132314,0.00055129547,0.0069120163,0.0006733871,0.0010193192,0.00031774445,0.00080570905,0.6564293,0.0061177113,0.06497921,0.010106126,0.2515568],"study_design_scores_gemma":[0.000026836651,0.000112403366,0.00040095727,0.000053230404,0.00007780536,0.00008928888,0.000033072065,0.9677948,0.0013511025,0.028232487,0.0017938727,0.000034192348],"about_ca_topic_score_codex":0.008709659,"about_ca_topic_score_gemma":0.015171705,"teacher_disagreement_score":0.008709659,"about_ca_system_score_codex":0.0019974103,"about_ca_system_score_gemma":0.0017892112,"threshold_uncertainty_score":0.03277248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053346567,0.0022011367,0.9315229,0.0015553387,0.00025081818,0.00022643828,0.0010370556,0.005929776,0.003929933],"genre_scores_gemma":[0.7042405,0.0009465954,0.2720304,0.0018069397,0.0002891803,0.0004917138,0.0038540955,0.0009338735,0.015406623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974607,0.001091844,0.00015580327,0.00058629044,0.00044307232,0.00026225133],"domain_scores_gemma":[0.99337727,0.004005729,0.0004044374,0.0011369248,0.0008038286,0.0002718998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005234415,0.0015483997,0.002626134,0.00077412854,0.0014729784,0.0019248073,0.0040672473,0.003244734,0.0052916845],"category_scores_gemma":[0.014277195,0.0012828576,0.001385185,0.0011242647,0.0014335015,0.0052404124,0.0035876622,0.006096192,0.0021463516],"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.001470795,0.00072884356,0.0069579044,0.00076877815,0.00048157104,0.00041634968,0.0006595356,0.68061507,0.0043336353,0.029438721,0.033746596,0.24038218],"study_design_scores_gemma":[0.000039558283,0.00006961956,0.00018756058,0.000020228763,0.000023920906,0.000028142715,0.000016277241,0.9888483,0.0009634878,0.008670956,0.0011190722,0.000012883261],"about_ca_topic_score_codex":0.016859,"about_ca_topic_score_gemma":0.034083508,"teacher_disagreement_score":0.016859,"about_ca_system_score_codex":0.0025411728,"about_ca_system_score_gemma":0.002233778,"threshold_uncertainty_score":0.03352171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010362651,0.00035620123,0.9856572,0.0006148196,0.000062167215,0.000039134484,0.00026263765,0.00030336203,0.0023419044],"genre_scores_gemma":[0.5200796,0.00146649,0.46176454,0.0011148549,0.00034439782,0.00074115954,0.0018116612,0.0003144855,0.012362762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985775,0.0004598084,0.00007842185,0.00039535272,0.00035016224,0.00013870247],"domain_scores_gemma":[0.9963626,0.0022324517,0.00035780235,0.00049721537,0.00038611452,0.00016387524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022647153,0.0014278562,0.0013568043,0.0011738553,0.0004961939,0.00204388,0.0028155271,0.0018004399,0.0041381833],"category_scores_gemma":[0.009025199,0.0007739006,0.0013845637,0.0010611658,0.0016521298,0.004133913,0.0026733468,0.0035489714,0.0009767226],"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.00009636526,0.00012123714,0.0014040638,0.0002234548,0.00012728877,0.000097245145,0.000121534875,0.6174368,0.001484753,0.26341292,0.0059090015,0.109565236],"study_design_scores_gemma":[0.0000072270054,0.000040525934,0.00010742622,0.00001979617,0.000010680597,0.000020713747,0.00001101287,0.85250396,0.00057314907,0.14441028,0.0022886237,0.000006752764],"about_ca_topic_score_codex":0.0019788586,"about_ca_topic_score_gemma":0.002049804,"teacher_disagreement_score":0.0041381833,"about_ca_system_score_codex":0.0018159162,"about_ca_system_score_gemma":0.0010304458,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060131624,0.0003454104,0.9920896,0.0002887796,0.00007644772,0.000028381068,0.000113199945,0.0003494052,0.0006955283],"genre_scores_gemma":[0.41312554,0.0012418549,0.56742275,0.0008020649,0.00043826664,0.00040837875,0.0019975887,0.00055578817,0.01400772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907494,0.00030247023,0.00006484509,0.00019654054,0.0002768427,0.000084402636],"domain_scores_gemma":[0.9986834,0.00054701674,0.00008544227,0.00026812768,0.0003294792,0.0000864402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027715955,0.0011258459,0.0015350999,0.00077984115,0.00059126806,0.0011979772,0.0021391618,0.0024833193,0.002257569],"category_scores_gemma":[0.005829403,0.0004884115,0.0009479274,0.00094769034,0.0012942812,0.0035045675,0.0029737374,0.0037479748,0.0009269366],"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.00038576624,0.00045535303,0.00088248425,0.0003850181,0.0001782039,0.00014682858,0.00011200156,0.3953939,0.010714839,0.16399652,0.018768702,0.4085804],"study_design_scores_gemma":[0.0000094978495,0.00004385776,0.00013600806,0.000015710404,0.000014246027,0.00003687415,0.000007464445,0.9468879,0.001342895,0.05061601,0.00087879924,0.000010736516],"about_ca_topic_score_codex":0.0020003514,"about_ca_topic_score_gemma":0.0024746151,"teacher_disagreement_score":0.0027715955,"about_ca_system_score_codex":0.0011124266,"about_ca_system_score_gemma":0.001665013,"threshold_uncertainty_score":0.014657795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03061982,0.0006282172,0.95661753,0.00037911013,0.000087498454,0.00008938764,0.0006044134,0.007794263,0.0031798375],"genre_scores_gemma":[0.5373724,0.00065216556,0.44516322,0.00061764877,0.00010764643,0.00021049232,0.004964486,0.0007014129,0.010210466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00008980309,0.00002308702,0.00021672319,0.00011680216,0.000073229545],"domain_scores_gemma":[0.9994129,0.00014268412,0.000068929,0.00022582721,0.00010442737,0.000045112836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007720315,0.0019571632,0.0011387202,0.0012813922,0.00045358826,0.0010096009,0.0024513926,0.0011240814,0.0040555396],"category_scores_gemma":[0.0023810738,0.00049990945,0.0014035346,0.0015991277,0.0007139161,0.003598896,0.0017996542,0.0016918258,0.0015018228],"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.00022025805,0.00018332218,0.0010954103,0.00022865502,0.00019652676,0.00015506979,0.00013310963,0.36272,0.013243839,0.0280286,0.019978726,0.5738164],"study_design_scores_gemma":[0.000013312047,0.00003903009,0.00022101533,0.000008674614,0.000021134258,0.00002884878,0.000015086436,0.9701634,0.003424375,0.024492795,0.0015636078,0.000008803861],"about_ca_topic_score_codex":0.009685178,"about_ca_topic_score_gemma":0.016223026,"teacher_disagreement_score":0.009685178,"about_ca_system_score_codex":0.0015922709,"about_ca_system_score_gemma":0.0010913439,"threshold_uncertainty_score":0.019257605},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003946965,0.00041036107,0.9937571,0.00020697812,0.00004283264,0.00003170019,0.00003941704,0.00020171815,0.00136282],"genre_scores_gemma":[0.3432059,0.0010252952,0.64494807,0.0005405983,0.00018077527,0.00042829494,0.00065592426,0.00050307,0.008512152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924624,0.00031906052,0.00003118412,0.00012843721,0.00020587076,0.000069237736],"domain_scores_gemma":[0.99879766,0.0006911412,0.00012224853,0.000089975525,0.00022571703,0.0000731613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013736861,0.0016495977,0.001542335,0.0005421338,0.0004383829,0.0009066197,0.0012920512,0.0014015556,0.0018937546],"category_scores_gemma":[0.0037318214,0.0007623142,0.0012129678,0.00062353926,0.0011846968,0.0011372388,0.001356108,0.0021177267,0.00075285975],"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.000046311554,0.00004036,0.0004834513,0.00015175318,0.00007267822,0.00009201048,0.000042889555,0.9478576,0.001494524,0.023577215,0.003161846,0.022979353],"study_design_scores_gemma":[0.0000031231543,0.000008384971,0.000028280287,0.0000038132941,0.0000020599093,0.000006642351,0.0000019582635,0.9963439,0.0001274637,0.0031100132,0.00036200802,0.0000023357798],"about_ca_topic_score_codex":0.0065977615,"about_ca_topic_score_gemma":0.008562855,"teacher_disagreement_score":0.0065977615,"about_ca_system_score_codex":0.0012075641,"about_ca_system_score_gemma":0.001890871,"threshold_uncertainty_score":0.013118684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01001526,0.00018575932,0.9882631,0.0001732004,0.000022762733,0.000032954114,0.0000692401,0.0004756443,0.0007621436],"genre_scores_gemma":[0.47955465,0.00049717224,0.513391,0.0002473986,0.000095537835,0.000300394,0.00086880656,0.0002782149,0.0047667623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924695,0.00022323645,0.000059077523,0.0002137889,0.00019066293,0.0000662656],"domain_scores_gemma":[0.9960955,0.0024537044,0.00031432236,0.00041993766,0.0005801759,0.00013639362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024720551,0.0011701337,0.0012575717,0.00094746595,0.00062402344,0.0013921387,0.002431305,0.0017333621,0.00293324],"category_scores_gemma":[0.012895733,0.0010181348,0.0009962261,0.0009124259,0.001321795,0.0048104874,0.0020283717,0.0031202175,0.0007335047],"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.0001327705,0.00011496806,0.00096050615,0.0002024964,0.00010575972,0.00014217879,0.00019613844,0.6828714,0.003598911,0.0961923,0.0026182388,0.21286441],"study_design_scores_gemma":[0.0000047922476,0.00001201187,0.00003314611,0.000006591409,0.0000043326736,0.000013533067,0.0000043194796,0.96919024,0.0004978915,0.03001718,0.00021247532,0.0000034590423],"about_ca_topic_score_codex":0.0031705706,"about_ca_topic_score_gemma":0.0057434654,"teacher_disagreement_score":0.0031705706,"about_ca_system_score_codex":0.0015800445,"about_ca_system_score_gemma":0.0013924125,"threshold_uncertainty_score":0.013073623},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014603129,0.00036126876,0.9796382,0.0002644672,0.00004790552,0.00010627401,0.00012543653,0.00037391923,0.00447935],"genre_scores_gemma":[0.60248697,0.00041923823,0.3921625,0.00029476805,0.00006989703,0.0007206461,0.00047979565,0.00025156248,0.003114547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.00033069955,0.000042390497,0.00013940701,0.0001802721,0.00010226252],"domain_scores_gemma":[0.9951891,0.004044799,0.00022385365,0.00012550359,0.00025729917,0.00015945414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017450101,0.00125677,0.0016789745,0.0007232064,0.00070134277,0.0010217481,0.0014245537,0.0016207634,0.0057218797],"category_scores_gemma":[0.007960003,0.0008343482,0.0009789519,0.0008469151,0.001343438,0.00141482,0.0015558018,0.0023142924,0.00050336006],"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.00003403025,0.000020474336,0.00022914966,0.000050341918,0.000015622025,0.000031812415,0.000021554299,0.97831446,0.0001450426,0.0133619895,0.00048789385,0.0072876657],"study_design_scores_gemma":[0.0000100963725,0.000006904401,0.0000170352,0.000004704245,0.0000024497901,0.0000037041452,0.0000028112331,0.99379736,0.00004720106,0.0059033753,0.00020257826,0.0000017095425],"about_ca_topic_score_codex":0.0084951855,"about_ca_topic_score_gemma":0.009017726,"teacher_disagreement_score":0.0084951855,"about_ca_system_score_codex":0.0015083904,"about_ca_system_score_gemma":0.0026454306,"threshold_uncertainty_score":0.019141555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014092312,0.00018236753,0.9814275,0.00023819057,0.00008226638,0.00006881275,0.000038726776,0.0015123169,0.0023575516],"genre_scores_gemma":[0.5925046,0.00015238055,0.39843,0.0003775702,0.000104681094,0.00033913925,0.00020041052,0.0005238329,0.007367427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992536,0.00022672424,0.00003585814,0.00015583019,0.00021052458,0.000117478136],"domain_scores_gemma":[0.9985813,0.00075477565,0.00013474078,0.00020788632,0.00022254439,0.00009876958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014642614,0.0012804167,0.001366367,0.00049654284,0.0005463249,0.0011716427,0.0020398002,0.0019959384,0.0047118887],"category_scores_gemma":[0.004678664,0.0007671538,0.00064422074,0.0004904568,0.0011927333,0.0015535192,0.0019621733,0.0020324346,0.0010769767],"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.00012688404,0.000086665066,0.00049503334,0.000055511682,0.000029405652,0.00006078825,0.00003868055,0.9211771,0.0014326402,0.008319715,0.0028309512,0.065346695],"study_design_scores_gemma":[0.000009869244,0.00002729355,0.00003393836,0.0000037728962,0.0000029743603,0.000010493218,0.0000041781354,0.99637455,0.0006063816,0.0026047525,0.0003188507,0.0000028565323],"about_ca_topic_score_codex":0.0035098987,"about_ca_topic_score_gemma":0.0038743399,"teacher_disagreement_score":0.0047118887,"about_ca_system_score_codex":0.0012483698,"about_ca_system_score_gemma":0.0022076608,"threshold_uncertainty_score":0.015762866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05463598,0.00050808635,0.94112664,0.00035763587,0.000057431673,0.00006697112,0.0000721046,0.0011225295,0.00205261],"genre_scores_gemma":[0.70930713,0.00056503364,0.28499922,0.0004588916,0.00013807935,0.0001946288,0.00038814754,0.00028604025,0.0036628272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998672,0.0005258484,0.00008164458,0.00034980683,0.00028108468,0.00008965732],"domain_scores_gemma":[0.994091,0.003182151,0.00039872385,0.0016241123,0.00058124133,0.0001227482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038825858,0.0013292364,0.0011076845,0.0005570212,0.00045392953,0.0008601902,0.0015669424,0.0015419385,0.0012518538],"category_scores_gemma":[0.0135344025,0.00062097836,0.00082223595,0.00044431258,0.0013081079,0.0026921777,0.0021688237,0.0024214839,0.0005758459],"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.00027675633,0.00023251784,0.0025217861,0.00015544001,0.00022254461,0.00010332461,0.00020950299,0.7546239,0.010999677,0.027921895,0.0032564432,0.19947626],"study_design_scores_gemma":[0.00000831436,0.000045230456,0.00017648202,0.000008537185,0.000010272819,0.000023176439,0.000008610152,0.98851985,0.0018567032,0.009086769,0.00025008057,0.0000059657727],"about_ca_topic_score_codex":0.0021596567,"about_ca_topic_score_gemma":0.003012485,"teacher_disagreement_score":0.0038825858,"about_ca_system_score_codex":0.0006619469,"about_ca_system_score_gemma":0.0011122025,"threshold_uncertainty_score":0.020533323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070281164,0.0002055434,0.9899048,0.00030138792,0.000026845686,0.000047290763,0.000016719783,0.00015220161,0.002317084],"genre_scores_gemma":[0.74878913,0.0003916981,0.24445309,0.00042628066,0.00015696854,0.00039860545,0.000082676546,0.000104916,0.0051965774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713516,0.0014590321,0.00009654789,0.0003901598,0.00069502153,0.00022406522],"domain_scores_gemma":[0.9952195,0.0031629242,0.0005304661,0.0003020804,0.0005295891,0.00025535235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048101726,0.0016041313,0.002525439,0.0010593882,0.00061573996,0.0014573871,0.002973491,0.0026477997,0.0032766825],"category_scores_gemma":[0.010635639,0.0011777972,0.0011756765,0.0007915839,0.0017450949,0.0025087746,0.0025450967,0.0032384743,0.00068470556],"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.00007446039,0.00005781961,0.00038475028,0.000051097064,0.00009488788,0.00007553061,0.000072840056,0.9492175,0.00064597395,0.023350416,0.0006464614,0.025328344],"study_design_scores_gemma":[0.000012723538,0.00002440352,0.000040725692,0.000007131869,0.000011179395,0.000015024368,0.0000035892085,0.9881025,0.00015290751,0.011357727,0.00026369328,0.000008388519],"about_ca_topic_score_codex":0.0026028585,"about_ca_topic_score_gemma":0.0028805523,"teacher_disagreement_score":0.0048101726,"about_ca_system_score_codex":0.0013871018,"about_ca_system_score_gemma":0.0014419059,"threshold_uncertainty_score":0.025438905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025073662,0.00013413363,0.9966922,0.000099252604,0.0000067986925,0.000009351333,0.000035401084,0.00017939191,0.0003360395],"genre_scores_gemma":[0.26439643,0.0010281249,0.7284112,0.000249931,0.00011155965,0.00021984974,0.0005848029,0.0003712936,0.004626756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991374,0.00035171222,0.000043174045,0.00017432142,0.00020537752,0.00008808613],"domain_scores_gemma":[0.99750227,0.0013980024,0.00028895022,0.0004453318,0.00025341945,0.00011201706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023089787,0.0012854603,0.0010978245,0.001226629,0.0005040711,0.0018210991,0.002304329,0.0016742933,0.0023538016],"category_scores_gemma":[0.0097250305,0.0010270097,0.0012088945,0.0013954691,0.0014831193,0.00526575,0.0029165235,0.0038969654,0.0010318254],"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.00011084038,0.00006229214,0.001178252,0.0001341083,0.000062703104,0.00007012362,0.00025660248,0.5153992,0.0040239324,0.35246006,0.002984287,0.12325756],"study_design_scores_gemma":[0.0000025682189,0.000006380222,0.000059896323,0.000008783044,0.0000056297854,0.000016995567,0.0000063952807,0.9361571,0.00056417065,0.06259683,0.0005689348,0.0000062668737],"about_ca_topic_score_codex":0.006072852,"about_ca_topic_score_gemma":0.0074440837,"teacher_disagreement_score":0.006072852,"about_ca_system_score_codex":0.0018646917,"about_ca_system_score_gemma":0.0013448584,"threshold_uncertainty_score":0.013529301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029136596,0.0015005426,0.9612257,0.0016531285,0.00008392094,0.00016484676,0.00034206788,0.0008718448,0.0050214357],"genre_scores_gemma":[0.49921665,0.0024289603,0.48630643,0.0015298142,0.000710804,0.0011836734,0.0018961971,0.0007827876,0.0059446767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99260086,0.002092334,0.00050781836,0.0012739855,0.0027220352,0.0008029709],"domain_scores_gemma":[0.9294038,0.058447413,0.0024002527,0.006008429,0.002388887,0.0013511985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009253108,0.0026145768,0.0031290893,0.0023995508,0.0013410687,0.0039593787,0.003853357,0.0032491123,0.0065871067],"category_scores_gemma":[0.08013211,0.0014316726,0.0022495268,0.0025552548,0.0042241034,0.01344106,0.007737068,0.008107519,0.001603393],"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.0010825142,0.00040020284,0.004108725,0.0005532887,0.00021580185,0.00025577296,0.000425713,0.5813641,0.0073830034,0.282316,0.006398329,0.1154966],"study_design_scores_gemma":[0.000039784543,0.000068256806,0.00033858084,0.00004129106,0.000020626274,0.00008384089,0.00002575146,0.8987802,0.001932339,0.097697966,0.0009459882,0.00002537099],"about_ca_topic_score_codex":0.002033097,"about_ca_topic_score_gemma":0.0022662717,"teacher_disagreement_score":0.009253108,"about_ca_system_score_codex":0.0041135065,"about_ca_system_score_gemma":0.0029182255,"threshold_uncertainty_score":0.04893571},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005082441,0.00012177779,0.9905896,0.00021717417,0.00008052621,0.00005473691,0.000038863804,0.00048668904,0.0033281941],"genre_scores_gemma":[0.14893346,0.00040580428,0.843308,0.00020098542,0.00018641814,0.00024117997,0.00023025715,0.00055272126,0.0059412234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00030440834,0.00005051096,0.000112300535,0.00030031177,0.00010775835],"domain_scores_gemma":[0.9981437,0.00076881703,0.00013502716,0.0003924178,0.00044263233,0.00011740273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001211839,0.0014641923,0.0010205543,0.00059157977,0.00067594147,0.001150574,0.00069983787,0.0012154886,0.008246063],"category_scores_gemma":[0.008069454,0.000461141,0.00062770594,0.0007612181,0.0013819003,0.0018165135,0.0016586367,0.0026877462,0.003695424],"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.00045640607,0.00020100642,0.0015533951,0.000512004,0.00009801158,0.00046109178,0.00037108568,0.34641042,0.03289412,0.27446204,0.02150214,0.32107824],"study_design_scores_gemma":[0.000027284917,0.00006401469,0.00012321761,0.000018479268,0.00000577736,0.00009745354,0.000026298672,0.9369149,0.00636143,0.051898662,0.004451249,0.000011282938],"about_ca_topic_score_codex":0.0022515012,"about_ca_topic_score_gemma":0.0032218408,"teacher_disagreement_score":0.008246063,"about_ca_system_score_codex":0.00048394315,"about_ca_system_score_gemma":0.001923107,"threshold_uncertainty_score":0.027585804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075186556,0.00055740046,0.9873427,0.00031929795,0.000048533046,0.00002599534,0.00008697012,0.00042050128,0.0036799489],"genre_scores_gemma":[0.7223443,0.0010735899,0.26058137,0.0004113984,0.0001202706,0.0002441618,0.000452997,0.00034387768,0.01442799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997836,0.000070822476,0.0000072765442,0.0000634934,0.000050389477,0.00002440988],"domain_scores_gemma":[0.9991326,0.00066932495,0.000052906977,0.00005459788,0.00006269703,0.000027970458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064138946,0.00059389404,0.0005332914,0.00052366283,0.00028910767,0.0006605003,0.0011656381,0.0008362596,0.004106917],"category_scores_gemma":[0.0026006536,0.00048568146,0.00051447435,0.00046671127,0.0009914554,0.0014886609,0.0010024254,0.0018680869,0.0005880598],"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.0000360107,0.0000225821,0.00021372261,0.000063465784,0.000026023909,0.00005606222,0.000041584026,0.89507604,0.0014676639,0.06552317,0.0015070421,0.03596656],"study_design_scores_gemma":[0.0000024084666,0.0000054399893,0.000023370669,0.000003267702,0.000002368277,0.000009356245,0.000002259634,0.9791214,0.00025267806,0.020117529,0.00045753314,0.0000025068798],"about_ca_topic_score_codex":0.0021578737,"about_ca_topic_score_gemma":0.0032277326,"teacher_disagreement_score":0.004106917,"about_ca_system_score_codex":0.0010478023,"about_ca_system_score_gemma":0.00051820197,"threshold_uncertainty_score":0.01373899},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007528479,0.00018619353,0.990319,0.00024394236,0.000037201185,0.000035034544,0.0000211751,0.00041082347,0.0012181705],"genre_scores_gemma":[0.3266668,0.0003134601,0.66722685,0.00035301642,0.000077969664,0.00017351958,0.00016561746,0.00038010307,0.004642684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992125,0.0003559495,0.000038591093,0.00014203458,0.00018014987,0.00007078898],"domain_scores_gemma":[0.9980379,0.0012117065,0.00014043454,0.00024284706,0.0003039444,0.0000631718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024350432,0.001066796,0.0011971052,0.00040432013,0.00033748455,0.00075457786,0.0014256054,0.0015683823,0.0030345109],"category_scores_gemma":[0.008626001,0.0005793168,0.00043192622,0.00043228414,0.0010634728,0.0012786387,0.0010583436,0.0017499736,0.0009639651],"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.00022302507,0.0000819075,0.0007971236,0.0001498188,0.00006107706,0.00019065962,0.00013744319,0.792861,0.006773399,0.040795177,0.005463923,0.15246542],"study_design_scores_gemma":[0.000009002326,0.000023318813,0.000043637086,0.0000059849126,0.0000029395499,0.00001845564,0.0000051945085,0.99339503,0.0009294191,0.00478014,0.0007822517,0.0000046838068],"about_ca_topic_score_codex":0.0025474448,"about_ca_topic_score_gemma":0.0033994513,"teacher_disagreement_score":0.0030345109,"about_ca_system_score_codex":0.00047114203,"about_ca_system_score_gemma":0.0009549641,"threshold_uncertainty_score":0.0128778815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003989394,0.00005792912,0.9952678,0.00015446085,0.000015911075,0.000015929127,0.00003979789,0.00010773731,0.00035115605],"genre_scores_gemma":[0.19893433,0.00035285062,0.79703087,0.00023710809,0.00029815812,0.00018035343,0.0005997539,0.00015069194,0.0022159345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784184,0.00049713644,0.000096650045,0.00060252694,0.0008333451,0.00012839118],"domain_scores_gemma":[0.99126935,0.004939809,0.0009986847,0.0016052489,0.0009947574,0.00019220926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044666263,0.0008888587,0.0015402817,0.0017793501,0.0008720563,0.0024314437,0.0024552003,0.0019069922,0.0016978282],"category_scores_gemma":[0.019902743,0.0006775083,0.00093934895,0.0014285158,0.0024934914,0.0037360217,0.0025943813,0.003700482,0.0010662611],"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.0002134642,0.0002831147,0.00608821,0.00026055172,0.00010190981,0.00023109771,0.0003904457,0.31062496,0.012079614,0.19745295,0.00676451,0.4655092],"study_design_scores_gemma":[0.000009701237,0.000024297136,0.000564902,0.000023782351,0.000013330987,0.00011850637,0.00003094343,0.9069638,0.002956423,0.08740131,0.00187037,0.00002264602],"about_ca_topic_score_codex":0.0016783545,"about_ca_topic_score_gemma":0.0016329149,"teacher_disagreement_score":0.0044666263,"about_ca_system_score_codex":0.0008623912,"about_ca_system_score_gemma":0.0014873509,"threshold_uncertainty_score":0.023622036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03316235,0.00040769958,0.9558847,0.0013857494,0.00015673925,0.00011824261,0.00013484324,0.003208072,0.0055416767],"genre_scores_gemma":[0.5895531,0.00081686594,0.3983003,0.00082814554,0.0001715387,0.0002684662,0.00039717671,0.0003492072,0.00931522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956316,0.00021545636,0.00001688359,0.00010637766,0.0000734343,0.000024659555],"domain_scores_gemma":[0.99686927,0.002179979,0.000252858,0.00033720685,0.00028801573,0.00007265253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010817766,0.00093918113,0.00036995273,0.00026112833,0.00021145366,0.00073901744,0.0012010708,0.0012222962,0.0034862163],"category_scores_gemma":[0.009320332,0.00036360585,0.0003864178,0.000259935,0.0009971771,0.0021220127,0.0008336997,0.0017695659,0.0013672437],"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.00021608744,0.00034629708,0.0026650596,0.00069885555,0.00009992635,0.00028657148,0.0012357244,0.38357168,0.06168546,0.05068436,0.018801842,0.47970808],"study_design_scores_gemma":[0.000023136967,0.00010526937,0.00035187407,0.000040193157,0.00001824109,0.00010526044,0.000082172985,0.94119495,0.017041128,0.0330693,0.007941335,0.000027135195],"about_ca_topic_score_codex":0.0012655214,"about_ca_topic_score_gemma":0.0025575722,"teacher_disagreement_score":0.0034862163,"about_ca_system_score_codex":0.0004810489,"about_ca_system_score_gemma":0.0004600273,"threshold_uncertainty_score":0.011662543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018803487,0.00039404928,0.97269416,0.00054615166,0.00007842755,0.00010328267,0.0017815887,0.0032538224,0.002345041],"genre_scores_gemma":[0.42841962,0.0009389913,0.55338216,0.00046277232,0.0001886205,0.0003939879,0.008075178,0.0007471135,0.007391531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982576,0.0004080901,0.0001385211,0.0005731507,0.0004643229,0.00015826608],"domain_scores_gemma":[0.9930328,0.0032450594,0.00061263243,0.0021410962,0.0007447319,0.00022368776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016190475,0.0016534502,0.0011113283,0.0017140026,0.0007784635,0.001907713,0.0021448357,0.0015935996,0.0105791995],"category_scores_gemma":[0.016766503,0.0009463351,0.0015394079,0.0026078408,0.0015161061,0.009229476,0.002751979,0.003067751,0.0028261193],"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.00035377586,0.00024988223,0.002743556,0.0006559499,0.00013990112,0.00030411204,0.0003850941,0.4516407,0.005090694,0.1507879,0.02419419,0.36345434],"study_design_scores_gemma":[0.000014678765,0.000023628156,0.00018547908,0.000030700558,0.000018614954,0.000046896766,0.000031303174,0.8100525,0.001010095,0.1860184,0.0025529899,0.00001471215],"about_ca_topic_score_codex":0.005079478,"about_ca_topic_score_gemma":0.0095164925,"teacher_disagreement_score":0.0105791995,"about_ca_system_score_codex":0.0017237664,"about_ca_system_score_gemma":0.0012975018,"threshold_uncertainty_score":0.035390973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003040919,0.00009763503,0.9952864,0.00014852735,0.000026820639,0.000025098769,0.000020385296,0.00038149525,0.00097268715],"genre_scores_gemma":[0.1818602,0.00028815094,0.8125177,0.00042846755,0.0001026112,0.00032270083,0.00021460252,0.00060568214,0.0036599122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991918,0.00021842508,0.00005137113,0.000110434325,0.00034819316,0.000079821366],"domain_scores_gemma":[0.9978136,0.0011860768,0.00022238877,0.00034338146,0.00031988363,0.00011462417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019455253,0.0013271108,0.0013254251,0.0010070258,0.00060190127,0.0012902202,0.0020508675,0.0018015888,0.0042684064],"category_scores_gemma":[0.0072623026,0.00079381943,0.0013098483,0.0009018557,0.0013390438,0.0016968627,0.0023149787,0.0030696765,0.0016046085],"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.00019129254,0.00010346093,0.0008886284,0.00017951959,0.00011032113,0.000118736934,0.00013343537,0.7762729,0.008035423,0.075708285,0.005556185,0.1327019],"study_design_scores_gemma":[0.000015154019,0.000018359462,0.000048903265,0.000007692466,0.0000051861252,0.00001781085,0.0000046431146,0.99078596,0.000924224,0.0074313083,0.00073319935,0.000007636244],"about_ca_topic_score_codex":0.0030519858,"about_ca_topic_score_gemma":0.0047957473,"teacher_disagreement_score":0.0042684064,"about_ca_system_score_codex":0.00089407834,"about_ca_system_score_gemma":0.002074398,"threshold_uncertainty_score":0.014279246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023670637,0.00028839774,0.99250084,0.00036624772,0.00014640117,0.00017048798,0.00023500432,0.0017878187,0.002137786],"genre_scores_gemma":[0.13229401,0.00062312593,0.85704315,0.0004122419,0.0004094682,0.0007497541,0.0012283213,0.00047276547,0.0067671333],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966313,0.0012184754,0.00021494142,0.00044561987,0.0012020692,0.00028761188],"domain_scores_gemma":[0.9956579,0.002314966,0.0003029372,0.00072717166,0.0007873286,0.00020971804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041111084,0.001757566,0.0024380728,0.0019414814,0.0015484832,0.0026073174,0.0030565478,0.002342401,0.010855046],"category_scores_gemma":[0.013539281,0.0007464531,0.0009868866,0.0032353771,0.0014144267,0.0043006293,0.0025701015,0.0026418865,0.005262392],"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.00032794586,0.00026487472,0.0007899535,0.00034938366,0.000100710226,0.00010027513,0.000108377986,0.31090117,0.0012503124,0.13821697,0.046117026,0.50147307],"study_design_scores_gemma":[0.0001546486,0.00012220371,0.00010391254,0.000026691423,0.000015521915,0.00010511075,0.000028191202,0.8495667,0.00081354973,0.14098626,0.008050645,0.00002643602],"about_ca_topic_score_codex":0.0036597871,"about_ca_topic_score_gemma":0.0056576356,"teacher_disagreement_score":0.010855046,"about_ca_system_score_codex":0.0017003266,"about_ca_system_score_gemma":0.004515283,"threshold_uncertainty_score":0.036313772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028524017,0.00032060174,0.9635057,0.0010307182,0.00007868178,0.0001062767,0.00034547856,0.0018195183,0.0042689415],"genre_scores_gemma":[0.7408161,0.00043090532,0.2499529,0.0003799875,0.000079288984,0.00045771943,0.0006064133,0.00029904125,0.006977751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961203,0.0001559005,0.000017824486,0.000111533474,0.000054962897,0.000047792775],"domain_scores_gemma":[0.99760324,0.0018072623,0.00012293358,0.00022605143,0.00012507543,0.00011539997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013023063,0.000790839,0.00074914546,0.0004320623,0.00044994312,0.0010533645,0.0018653168,0.0014741963,0.0069642933],"category_scores_gemma":[0.0061695883,0.0006023369,0.00078017113,0.0005725307,0.0009787976,0.0023838254,0.0010336398,0.0023030338,0.00088948524],"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.00011369772,0.0000545512,0.0005954764,0.00007574782,0.000033317046,0.00008992429,0.00012979277,0.91549885,0.0009076377,0.043008022,0.0026403414,0.036852654],"study_design_scores_gemma":[0.000008497728,0.0000116122255,0.000028669741,0.0000029685154,0.0000045603283,0.000007650599,0.0000047959675,0.98217726,0.00025542802,0.017114729,0.00038102266,0.0000029215428],"about_ca_topic_score_codex":0.01110304,"about_ca_topic_score_gemma":0.014931319,"teacher_disagreement_score":0.01110304,"about_ca_system_score_codex":0.0015575961,"about_ca_system_score_gemma":0.0017234833,"threshold_uncertainty_score":0.023297906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02651263,0.0042283353,0.95068544,0.0053211157,0.00015051762,0.00007835135,0.00024655444,0.0004103423,0.012366692],"genre_scores_gemma":[0.7234767,0.0033712105,0.26372772,0.0014878274,0.0011194365,0.0005218307,0.00049913407,0.0005693287,0.005226836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97871053,0.006004469,0.0014281843,0.0043978714,0.008043058,0.001415934],"domain_scores_gemma":[0.86166257,0.09741894,0.010449648,0.021652384,0.006627856,0.002188578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018939236,0.0024547204,0.0030540046,0.0039709797,0.002107368,0.0076304697,0.003561981,0.004299086,0.0040284083],"category_scores_gemma":[0.12640841,0.0017128893,0.002463178,0.0035667892,0.014488872,0.025836691,0.013293944,0.009580063,0.00066021306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107274915,0.000058336926,0.0012303798,0.00029354513,0.00009104824,0.00016417373,0.0004381769,0.05696853,0.0015148262,0.90028375,0.0019340584,0.03691583],"study_design_scores_gemma":[0.000020414625,0.00014111935,0.000982905,0.000120547025,0.000045552388,0.00028504882,0.00009046672,0.15135783,0.0032189484,0.840311,0.0033403365,0.000085772495],"about_ca_topic_score_codex":0.0011945833,"about_ca_topic_score_gemma":0.00056881655,"teacher_disagreement_score":0.018939236,"about_ca_system_score_codex":0.005162223,"about_ca_system_score_gemma":0.0015104797,"threshold_uncertainty_score":0.10016149},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022751072,0.00046442798,0.9734821,0.000650436,0.00004147727,0.00003364719,0.00018424439,0.0003486053,0.0020439713],"genre_scores_gemma":[0.80043536,0.00082648714,0.1808042,0.0006111192,0.00016805393,0.0003721095,0.0008258512,0.00038746663,0.015569408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994808,0.00024048703,0.000021192436,0.00013547536,0.00006352401,0.000058597954],"domain_scores_gemma":[0.997001,0.0024613207,0.00012980717,0.00017816873,0.00014419436,0.00008558041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018631499,0.0008559296,0.0011591956,0.00080863317,0.0004814184,0.001484434,0.0023714292,0.0023021891,0.0040638493],"category_scores_gemma":[0.007901694,0.0009954277,0.001469797,0.00076358806,0.0018505678,0.0021504886,0.0015353748,0.0023515038,0.00068997015],"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.000032559623,0.000021765056,0.0007458465,0.000050717896,0.00004533468,0.00006725877,0.00011474451,0.89877135,0.0006811707,0.08691526,0.0010189376,0.011535109],"study_design_scores_gemma":[0.0000031936825,0.000003922752,0.0000571901,0.0000042615357,0.0000036192544,0.000009246772,0.000004807691,0.97567785,0.00008588371,0.023920845,0.00022397023,0.0000052163805],"about_ca_topic_score_codex":0.009740523,"about_ca_topic_score_gemma":0.0113944765,"teacher_disagreement_score":0.009740523,"about_ca_system_score_codex":0.0014813148,"about_ca_system_score_gemma":0.0008848116,"threshold_uncertainty_score":0.019367695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056666713,0.002007395,0.9813984,0.0011761059,0.0001909164,0.00006406625,0.0002643359,0.0011864465,0.008045745],"genre_scores_gemma":[0.34749475,0.0024760375,0.61484545,0.00072775834,0.00069281115,0.00061176764,0.0017858414,0.001640681,0.029724905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99736387,0.0014976036,0.00014187404,0.00037971287,0.00047421985,0.00014266833],"domain_scores_gemma":[0.992159,0.006498594,0.00022327747,0.00041884417,0.0005958522,0.00010437336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036290505,0.0010509604,0.0025494704,0.001820314,0.001019976,0.0021016172,0.0018758124,0.0031321784,0.011847638],"category_scores_gemma":[0.019460078,0.001645278,0.0015316557,0.0023811439,0.0017556705,0.0038851278,0.0025374817,0.0032932628,0.0028797511],"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.0002452227,0.00011033449,0.00027100096,0.00042483065,0.00015639172,0.00008685033,0.00015240221,0.60350543,0.0014254005,0.16352737,0.014942129,0.21515262],"study_design_scores_gemma":[0.000024827927,0.000013453251,0.000096971184,0.00002797779,0.000012910146,0.000012614067,0.000008535804,0.82463145,0.0002991935,0.17286803,0.001990754,0.000013348622],"about_ca_topic_score_codex":0.01012243,"about_ca_topic_score_gemma":0.008820158,"teacher_disagreement_score":0.011847638,"about_ca_system_score_codex":0.0022432457,"about_ca_system_score_gemma":0.00208296,"threshold_uncertainty_score":0.039634347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032099248,0.00011480442,0.9954531,0.00006285336,0.000024418177,0.00001922329,0.000016422851,0.00047168805,0.0006275103],"genre_scores_gemma":[0.6120471,0.00025445668,0.38086823,0.00021224408,0.00006415586,0.00024049134,0.00020840677,0.0005440684,0.0055609574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.00019350075,0.00003163057,0.00012670738,0.0001654074,0.000065430715],"domain_scores_gemma":[0.9985531,0.00073899195,0.0001284989,0.00016467186,0.000319976,0.0000948447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016288992,0.0011775487,0.00143103,0.00047561122,0.00031625477,0.000889598,0.001461519,0.0013071438,0.003410135],"category_scores_gemma":[0.0047955196,0.0005657082,0.00076601387,0.00039276318,0.0011254905,0.0013617987,0.0012217264,0.0022321418,0.0009275754],"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.00009053696,0.000033267035,0.00034060018,0.000053527416,0.000036987298,0.000054888464,0.000044479206,0.9456026,0.0021222527,0.012071946,0.0013589445,0.038189936],"study_design_scores_gemma":[0.0000035015617,0.000009075788,0.000011748515,0.0000019621796,0.0000015400899,0.0000041542116,0.000001163436,0.99808323,0.00023399065,0.0014884241,0.00015937735,0.0000018515744],"about_ca_topic_score_codex":0.006236748,"about_ca_topic_score_gemma":0.004733259,"teacher_disagreement_score":0.006236748,"about_ca_system_score_codex":0.0015075713,"about_ca_system_score_gemma":0.0017275171,"threshold_uncertainty_score":0.012400925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006306186,0.000084725245,0.99186397,0.00008073637,0.00004021765,0.000023493069,0.000031448566,0.00062038,0.0009488334],"genre_scores_gemma":[0.22935723,0.00017395655,0.7646148,0.00019754088,0.000050830957,0.00016648433,0.0002814615,0.00041386273,0.004743783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.00014462424,0.000029174567,0.000107839056,0.000150727,0.000050110335],"domain_scores_gemma":[0.998995,0.0003381471,0.000066159126,0.00023569667,0.00031104873,0.000053831012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012358109,0.0009464217,0.0010921572,0.0004820971,0.0003843441,0.0011726465,0.00097537,0.0012680152,0.0036896563],"category_scores_gemma":[0.0053004664,0.0005737891,0.0005406461,0.00060237566,0.0008748181,0.0017471736,0.00093941874,0.0015642354,0.0017744149],"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.0001689771,0.00010898283,0.0011049671,0.00012515049,0.0000721544,0.00008883585,0.00013690814,0.74157435,0.007732449,0.06457617,0.009242476,0.17506866],"study_design_scores_gemma":[0.000007561085,0.000013484877,0.00006706859,0.000005544558,0.0000024390763,0.000014035982,0.0000056581325,0.9910623,0.00048124066,0.0076101664,0.00072603556,0.0000044728404],"about_ca_topic_score_codex":0.006117841,"about_ca_topic_score_gemma":0.010081132,"teacher_disagreement_score":0.006117841,"about_ca_system_score_codex":0.00077137735,"about_ca_system_score_gemma":0.0016389138,"threshold_uncertainty_score":0.012343109},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26182082,0.0009515123,0.7287325,0.00057410984,0.000044193614,0.00007153561,0.00019089303,0.00029265598,0.00732174],"genre_scores_gemma":[0.9446356,0.0006187781,0.052178018,0.0000812716,0.000073559444,0.00013107811,0.00025375406,0.00010038814,0.0019274928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999353,0.00016823478,0.000052986717,0.00013800357,0.00020215976,0.00008553528],"domain_scores_gemma":[0.9935427,0.004064581,0.0009296366,0.0004042398,0.00074351,0.0003152525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001237546,0.0009218441,0.0006242998,0.0014124177,0.0005165644,0.0013952,0.0011432503,0.000968564,0.0023228663],"category_scores_gemma":[0.010052943,0.0005046182,0.0006777608,0.0006269577,0.0015548073,0.0042078546,0.0013256756,0.0014051193,0.0002586732],"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.00008454468,0.000055161057,0.004425659,0.00026268075,0.000093463896,0.00024136434,0.00029666332,0.5391436,0.010750301,0.41423255,0.0010400725,0.029374026],"study_design_scores_gemma":[0.0000063970856,0.00004854036,0.0011837833,0.00001599643,0.000021616474,0.000081081926,0.000042073494,0.79970723,0.0017538157,0.19651595,0.00060364685,0.000019971352],"about_ca_topic_score_codex":0.00083670043,"about_ca_topic_score_gemma":0.0010320477,"teacher_disagreement_score":0.0023228663,"about_ca_system_score_codex":0.001318288,"about_ca_system_score_gemma":0.00057435024,"threshold_uncertainty_score":0.009564936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033878041,0.00028004588,0.9953903,0.000104002975,0.00003351737,0.00006205998,0.000039522507,0.00019927965,0.0005034885],"genre_scores_gemma":[0.26568502,0.0010251554,0.7282324,0.0005014238,0.0003627893,0.0006873038,0.00076701154,0.0004487833,0.0022901082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927556,0.0043157805,0.00033187386,0.0009853553,0.0013214956,0.00029000573],"domain_scores_gemma":[0.9746694,0.020379184,0.0010355756,0.002378265,0.0011814217,0.00035620516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0098385755,0.0017771621,0.0025049248,0.0022925646,0.0010303034,0.0020304208,0.002133644,0.0018200453,0.00288968],"category_scores_gemma":[0.056415007,0.0011305382,0.001975637,0.0017300029,0.0023114053,0.002877037,0.0023904399,0.002459661,0.0006615461],"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.000518047,0.00018777177,0.004317075,0.00053642393,0.0004372848,0.0003396214,0.0004417081,0.54405284,0.0044730245,0.24346767,0.005017166,0.19621131],"study_design_scores_gemma":[0.000028533812,0.000050632912,0.00038868003,0.00004569075,0.00005491687,0.00006757797,0.000028072394,0.92609733,0.0022725766,0.0688639,0.0020799881,0.000022253478],"about_ca_topic_score_codex":0.0069000176,"about_ca_topic_score_gemma":0.00700985,"teacher_disagreement_score":0.0098385755,"about_ca_system_score_codex":0.001864311,"about_ca_system_score_gemma":0.0023050332,"threshold_uncertainty_score":0.052031994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020319489,0.00011883745,0.9929811,0.00015784701,0.000029988758,0.000038701666,0.00015726777,0.002923288,0.0015609451],"genre_scores_gemma":[0.27544484,0.00042017383,0.70904857,0.00071353663,0.00012522725,0.00053793273,0.0017933289,0.0021904048,0.009726034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992674,0.00029580103,0.000026570679,0.00014731976,0.00019153158,0.00007140957],"domain_scores_gemma":[0.9985127,0.0010413316,0.000070650596,0.00020427177,0.000096452044,0.00007457502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563211,0.0015743934,0.001125765,0.0007943775,0.000524969,0.001235379,0.0030704513,0.0016736742,0.008497616],"category_scores_gemma":[0.0054847184,0.001115917,0.0013003424,0.0006716698,0.0015554746,0.0022359937,0.002732596,0.003969386,0.0021066975],"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.000108221204,0.00005623466,0.00052839797,0.00009924318,0.000079487574,0.00009579934,0.00006997048,0.84773546,0.0010454106,0.07418851,0.007904351,0.068088904],"study_design_scores_gemma":[0.000006517313,0.000004574652,0.0000160787,0.000005723264,0.0000025408872,0.000007272197,0.0000025109496,0.9763566,0.00024620243,0.022550132,0.0007990397,0.0000027442063],"about_ca_topic_score_codex":0.0062325792,"about_ca_topic_score_gemma":0.016379561,"teacher_disagreement_score":0.008497616,"about_ca_system_score_codex":0.0017686371,"about_ca_system_score_gemma":0.0015791429,"threshold_uncertainty_score":0.028427362},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015738584,0.00006489127,0.9978148,0.000046731402,0.000006657825,0.000009193452,0.000015757305,0.000060178125,0.00040796064],"genre_scores_gemma":[0.19721724,0.0007507339,0.7969675,0.00022991447,0.00013719527,0.0003017247,0.00043575684,0.0002654185,0.0036944558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987264,0.00044593445,0.00008266445,0.00031371115,0.00034766807,0.00008368642],"domain_scores_gemma":[0.99834895,0.00076642877,0.00015240881,0.00032392127,0.00031177892,0.00009644911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002210076,0.0012927325,0.0015662794,0.0014561823,0.0006671562,0.0021670433,0.0030258896,0.0020018895,0.0034669635],"category_scores_gemma":[0.008524995,0.00113321,0.0013272801,0.0015058002,0.0017715725,0.0057242457,0.0041238647,0.0038887667,0.00091246585],"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.00005623185,0.00007069742,0.0007401964,0.00012402247,0.00010185643,0.0001235525,0.00015686777,0.64350796,0.00400625,0.2498264,0.0013618754,0.099924065],"study_design_scores_gemma":[0.0000031210297,0.000016034683,0.000039506398,0.00000838935,0.000009701663,0.000026404292,0.0000074572454,0.9318978,0.0005239206,0.06674597,0.000712749,0.00000891046],"about_ca_topic_score_codex":0.0015234078,"about_ca_topic_score_gemma":0.0021125798,"teacher_disagreement_score":0.0034669635,"about_ca_system_score_codex":0.0012126283,"about_ca_system_score_gemma":0.0014158619,"threshold_uncertainty_score":0.011688173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005013588,0.0003254371,0.9927763,0.00016702057,0.0000241778,0.00003245762,0.000042972468,0.00025088733,0.0013672059],"genre_scores_gemma":[0.65687937,0.00084246125,0.3375142,0.00050046877,0.00013551119,0.0006586001,0.00038616583,0.0004584333,0.0026247157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996012,0.0011050999,0.00031077777,0.00078370346,0.0014375359,0.00035093902],"domain_scores_gemma":[0.9560038,0.03540703,0.0023419121,0.0022983253,0.0031108102,0.0008383035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005353631,0.0019450828,0.0017906645,0.0018009278,0.00069926854,0.0025135549,0.003203173,0.0022895497,0.004003085],"category_scores_gemma":[0.06969464,0.0011267536,0.0013855703,0.0010714454,0.0027817183,0.0046640467,0.0046916073,0.006025323,0.0008666658],"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.0001018265,0.00007040889,0.00096989295,0.00013680696,0.000048218433,0.00005295486,0.00011099693,0.9151457,0.001422248,0.05186247,0.00088037015,0.029198145],"study_design_scores_gemma":[0.000007767883,0.00002369187,0.00007964202,0.000029414372,0.000005969854,0.000013717674,0.0000051390534,0.9804952,0.00067889126,0.018412378,0.00023847638,0.000009772924],"about_ca_topic_score_codex":0.0030350073,"about_ca_topic_score_gemma":0.0031813718,"teacher_disagreement_score":0.005353631,"about_ca_system_score_codex":0.0022000605,"about_ca_system_score_gemma":0.0025544916,"threshold_uncertainty_score":0.02831304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007185695,0.0008937417,0.9867079,0.00044966434,0.00007076332,0.000046389792,0.00006451534,0.00022990153,0.0043514045],"genre_scores_gemma":[0.7538124,0.0016310895,0.23929429,0.0008435114,0.0005349756,0.0004809819,0.0002589545,0.00045682388,0.0026870302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904659,0.0037691267,0.00047119858,0.0016148298,0.0028111087,0.0008678396],"domain_scores_gemma":[0.9264156,0.059629846,0.0040785205,0.0058617266,0.0029143395,0.0010999815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012943925,0.0022995884,0.0024161004,0.001442923,0.0010116209,0.004188729,0.0032203314,0.002530761,0.0032649112],"category_scores_gemma":[0.08591015,0.00095165893,0.0012550241,0.0013880837,0.0054529095,0.010210061,0.0042473874,0.005985639,0.00046887525],"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.00021167354,0.000110922265,0.0013864464,0.00020552741,0.00011248771,0.00009542967,0.000139257,0.6219187,0.00096384593,0.3346011,0.0016082417,0.038646482],"study_design_scores_gemma":[0.0000139011945,0.00008531291,0.00030791873,0.000055901946,0.000019723506,0.000044769517,0.000017830771,0.82186776,0.0010889799,0.17574476,0.00073385984,0.000019297246],"about_ca_topic_score_codex":0.0020327673,"about_ca_topic_score_gemma":0.0013962428,"teacher_disagreement_score":0.012943925,"about_ca_system_score_codex":0.003091693,"about_ca_system_score_gemma":0.002774602,"threshold_uncertainty_score":0.0684548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023565157,0.00033093957,0.994463,0.0002952879,0.00006319117,0.000034870598,0.000063834115,0.00076956325,0.0016227837],"genre_scores_gemma":[0.34361804,0.0016677036,0.63618284,0.0016960142,0.000372862,0.00062111526,0.00071375584,0.0014493868,0.013678343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889106,0.00049774745,0.000055062235,0.00022378542,0.00024140181,0.00009101937],"domain_scores_gemma":[0.99834585,0.0009862668,0.00011647269,0.00030076323,0.00015654501,0.0000941377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023361938,0.0015443256,0.001661621,0.0009455191,0.0006450397,0.0019149865,0.0028005913,0.002561055,0.0065709106],"category_scores_gemma":[0.008624215,0.001023254,0.0013927221,0.0011988803,0.0018195724,0.0035165711,0.0036851715,0.004553303,0.0027263372],"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.00015563252,0.00006981104,0.0006210985,0.00018977604,0.00014291219,0.0001631618,0.00015764119,0.6160122,0.0048072715,0.2123581,0.008458115,0.15686426],"study_design_scores_gemma":[0.000012242159,0.0000139104695,0.00003873265,0.000013918697,0.000008029798,0.00003184202,0.000004370325,0.9186693,0.0006218273,0.07857842,0.0019964792,0.000010926495],"about_ca_topic_score_codex":0.0027710658,"about_ca_topic_score_gemma":0.0035506645,"teacher_disagreement_score":0.0065709106,"about_ca_system_score_codex":0.0009855753,"about_ca_system_score_gemma":0.0013721661,"threshold_uncertainty_score":0.021981895},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06940558,0.0005710091,0.92551684,0.00063361414,0.000040967727,0.0000771879,0.0002417738,0.001516083,0.0019969721],"genre_scores_gemma":[0.66292256,0.0003445915,0.33427802,0.0002395986,0.00007378625,0.00022342139,0.0006644608,0.00073759974,0.0005159414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9836484,0.010606065,0.00088498206,0.0011890136,0.0032547219,0.00041685157],"domain_scores_gemma":[0.7705974,0.19428195,0.00596775,0.020438366,0.0071640327,0.0015504688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033141054,0.0012489352,0.0015325426,0.002830373,0.0010640003,0.002959346,0.002976733,0.0028428584,0.0020602548],"category_scores_gemma":[0.19714245,0.0012568162,0.0010648175,0.002504816,0.0033996126,0.004819785,0.0042085103,0.0045566023,0.0004428308],"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.00037011242,0.00007912009,0.010192652,0.000191409,0.00025151027,0.000107877444,0.00030855543,0.8688243,0.0012910365,0.0782539,0.0012903614,0.038839143],"study_design_scores_gemma":[0.000012510735,0.000016989126,0.00032046167,0.000018669942,0.000010915335,0.000021227175,0.000018931676,0.9693681,0.00071944454,0.02925193,0.0002290472,0.0000117392165],"about_ca_topic_score_codex":0.0070907697,"about_ca_topic_score_gemma":0.006026129,"teacher_disagreement_score":0.033141054,"about_ca_system_score_codex":0.0022736553,"about_ca_system_score_gemma":0.002898885,"threshold_uncertainty_score":0.17526877},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091345295,0.0006708512,0.8949412,0.0052822176,0.00018314447,0.0003818486,0.0013354449,0.0007846203,0.0050753066],"genre_scores_gemma":[0.5315704,0.00039140828,0.45965183,0.0018051512,0.00026353047,0.001049114,0.0021749127,0.00040540964,0.0026882724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912409,0.00392525,0.00067759166,0.002013434,0.0015978862,0.00054502906],"domain_scores_gemma":[0.9660587,0.021447279,0.002599593,0.0057396577,0.0030411314,0.001113762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015712837,0.0019554016,0.0017730404,0.0009890302,0.001136059,0.0041405596,0.0028244979,0.0032900572,0.0020105268],"category_scores_gemma":[0.05903835,0.00081513997,0.0008800573,0.0021897845,0.0016770357,0.0073120096,0.0033464024,0.004358598,0.00074415555],"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.00044159815,0.00064549723,0.010006877,0.00065007154,0.00020890118,0.00034329703,0.0004093111,0.80087703,0.005411304,0.055115588,0.015305135,0.110585414],"study_design_scores_gemma":[0.000053081836,0.00018176169,0.0018548837,0.00007254832,0.000032749307,0.00018980824,0.00018150812,0.91840273,0.004134148,0.07056775,0.004294986,0.000034126584],"about_ca_topic_score_codex":0.0016403869,"about_ca_topic_score_gemma":0.002661429,"teacher_disagreement_score":0.015712837,"about_ca_system_score_codex":0.0019970813,"about_ca_system_score_gemma":0.0028750177,"threshold_uncertainty_score":0.08309847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030780923,0.00049215875,0.96478593,0.0007337268,0.00005692046,0.000052081738,0.00019271155,0.002037569,0.00086793053],"genre_scores_gemma":[0.643769,0.00048236092,0.3483629,0.001296074,0.00023154759,0.00038951996,0.0019465674,0.0007671797,0.0027548417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927893,0.0035509383,0.0002981987,0.0016261055,0.001294522,0.00044091884],"domain_scores_gemma":[0.97004086,0.020707102,0.0022650526,0.004767334,0.0017909815,0.0004287212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012704453,0.0025582425,0.0024466373,0.0013861952,0.001195142,0.0026013006,0.003828435,0.003287358,0.0010910586],"category_scores_gemma":[0.055709723,0.0018355934,0.0011992205,0.0016088055,0.0034324916,0.0056309565,0.0057429774,0.0070666755,0.000804974],"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.0009956151,0.00024045615,0.0048098755,0.0002959676,0.00023198572,0.00019458347,0.00033563294,0.78999215,0.009684678,0.024299322,0.005394794,0.163525],"study_design_scores_gemma":[0.000025007113,0.000045212208,0.00023691222,0.000019409865,0.000015236489,0.000027630105,0.000020176753,0.9748253,0.0028126887,0.021545872,0.0004175395,0.000008909649],"about_ca_topic_score_codex":0.004507687,"about_ca_topic_score_gemma":0.00629003,"teacher_disagreement_score":0.012704453,"about_ca_system_score_codex":0.0025140953,"about_ca_system_score_gemma":0.0019050292,"threshold_uncertainty_score":0.06718832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0775162,0.0018305009,0.88585526,0.0008905049,0.0005394128,0.00010203678,0.0017746272,0.008005511,0.023485912],"genre_scores_gemma":[0.8224103,0.0011481574,0.13297029,0.00060763187,0.00017793765,0.00017323172,0.0026735957,0.00047610953,0.039362784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998055,0.000020336582,0.00001457197,0.00008152783,0.000037760317,0.000040359744],"domain_scores_gemma":[0.99959296,0.0000988243,0.000045745055,0.00013220761,0.00010084496,0.000029421035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029049077,0.0008725471,0.0005939071,0.00043263892,0.00037591098,0.001120013,0.002024236,0.00076142274,0.012344557],"category_scores_gemma":[0.0014011654,0.00034434695,0.0006589367,0.0005831837,0.0005418566,0.0032532753,0.0009600858,0.0010570241,0.0034052623],"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.00059501687,0.00025512427,0.0035428084,0.00045034537,0.00018559891,0.0004910905,0.00027796472,0.18200111,0.027303826,0.1264789,0.02889665,0.6295216],"study_design_scores_gemma":[0.000028865796,0.00013387846,0.00053250813,0.000034637895,0.000066230416,0.00016384965,0.00004529337,0.8892463,0.0119904755,0.08575843,0.011967211,0.000032358847],"about_ca_topic_score_codex":0.004372366,"about_ca_topic_score_gemma":0.009343578,"teacher_disagreement_score":0.012344557,"about_ca_system_score_codex":0.0005811661,"about_ca_system_score_gemma":0.00080269907,"threshold_uncertainty_score":0.04129672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02374357,0.0008482864,0.97022295,0.0006846937,0.000072639166,0.000083805615,0.00011112144,0.00028061078,0.003952296],"genre_scores_gemma":[0.7832429,0.000720761,0.20977533,0.0005034396,0.00012284849,0.00047983046,0.0004079263,0.00020480852,0.004542138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998304,0.00097113685,0.00008014003,0.00023792218,0.00024763218,0.00015917243],"domain_scores_gemma":[0.98568,0.012166885,0.0007067147,0.00047989088,0.0006160293,0.0003505383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058346866,0.0017607615,0.0025430967,0.00079305127,0.0004968165,0.0018885165,0.0014743009,0.002600129,0.0032418037],"category_scores_gemma":[0.020962527,0.000791335,0.00083520444,0.00082832255,0.0022415973,0.002302784,0.0019184657,0.0031553872,0.0006452694],"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.000101030564,0.000050611507,0.00034474788,0.00007337433,0.000028898521,0.00003546344,0.000031938063,0.9669447,0.00029804272,0.02239065,0.00052624504,0.009174281],"study_design_scores_gemma":[0.00000471264,0.00001838946,0.000022942457,0.000009622619,0.0000022862396,0.0000038451017,0.0000026374173,0.99231684,0.00011878922,0.0074012307,0.000095935684,0.0000026365576],"about_ca_topic_score_codex":0.0019068089,"about_ca_topic_score_gemma":0.001472735,"teacher_disagreement_score":0.0058346866,"about_ca_system_score_codex":0.002006122,"about_ca_system_score_gemma":0.001634086,"threshold_uncertainty_score":0.030857146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1611451,0.00084427366,0.8264393,0.0014554932,0.000041531446,0.00004344073,0.000303984,0.0003810313,0.009345694],"genre_scores_gemma":[0.945911,0.0007854903,0.045710582,0.0001670837,0.000060744864,0.00010387352,0.00034750142,0.0002355945,0.006678215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939704,0.00021577236,0.0000291118,0.00010032452,0.00017177183,0.00008596479],"domain_scores_gemma":[0.99758756,0.0014300584,0.0002758928,0.00017235086,0.00037934355,0.00015479785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013726949,0.0011035721,0.0008304802,0.0009671463,0.0004968184,0.0014058562,0.0010166527,0.0010110452,0.0018188511],"category_scores_gemma":[0.0076250196,0.00057567353,0.00078540767,0.0005324216,0.0017228723,0.0020311119,0.0016216866,0.001999219,0.00035297527],"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.0001169836,0.00002889368,0.0011515802,0.0001496159,0.00005146579,0.00029541398,0.00014312846,0.81837153,0.008623314,0.15576743,0.0014653349,0.013835327],"study_design_scores_gemma":[0.0000035051548,0.000033740864,0.000360548,0.000010208218,0.000004415012,0.000043104046,0.000019274143,0.96270156,0.001068594,0.03529018,0.0004580362,0.000006817775],"about_ca_topic_score_codex":0.0026401607,"about_ca_topic_score_gemma":0.0009994664,"teacher_disagreement_score":0.0026401607,"about_ca_system_score_codex":0.0013396249,"about_ca_system_score_gemma":0.0005679157,"threshold_uncertainty_score":0.009719729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010573863,0.00029764415,0.99524575,0.0003854063,0.000042418964,0.00001348516,0.000056073986,0.000043133627,0.002858691],"genre_scores_gemma":[0.31163734,0.0030893867,0.66043586,0.00067915,0.000889449,0.00053071143,0.0006308196,0.00045224236,0.02165507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985464,0.0006602893,0.000061377825,0.00023558455,0.00040060355,0.000095754716],"domain_scores_gemma":[0.99851376,0.0008851741,0.00012879685,0.00014474103,0.00022565159,0.00010186571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026619986,0.0010330206,0.0009976665,0.00094958296,0.0006705722,0.0019158963,0.0019083623,0.0013966297,0.0045950958],"category_scores_gemma":[0.005291363,0.0005198591,0.0011514166,0.0008475298,0.002376935,0.0025605517,0.002254747,0.0034346175,0.00087023305],"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.000004369489,0.000008520684,0.0000726647,0.00003189826,0.000015825974,0.000016627255,0.00004082236,0.04412684,0.00036745204,0.9496528,0.0007175266,0.004944686],"study_design_scores_gemma":[0.000007663724,0.00001546688,0.000072931194,0.000021494656,0.000007304496,0.000022710352,0.000015246966,0.46579945,0.0001747809,0.52865994,0.005192194,0.000010831904],"about_ca_topic_score_codex":0.003122434,"about_ca_topic_score_gemma":0.003338301,"teacher_disagreement_score":0.0045950958,"about_ca_system_score_codex":0.0016387157,"about_ca_system_score_gemma":0.0021583254,"threshold_uncertainty_score":0.015372157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047615096,0.0009739094,0.9307452,0.00046491026,0.00016127108,0.00020726108,0.00038973356,0.015192704,0.0042499606],"genre_scores_gemma":[0.4429951,0.00043701002,0.5472218,0.0007349953,0.00008819535,0.00046819856,0.0014061008,0.0015448667,0.0051037422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991991,0.00017561742,0.000054543223,0.00023592701,0.00021829213,0.00011651366],"domain_scores_gemma":[0.9982292,0.00072415784,0.00016965265,0.00056630484,0.00024365065,0.00006699862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739329,0.0013109228,0.0013689441,0.0012042181,0.0007477073,0.0011214254,0.0020328541,0.001430989,0.0056710616],"category_scores_gemma":[0.006279128,0.0008870554,0.0011330729,0.0011857637,0.0012642707,0.0026633597,0.003024309,0.0019079872,0.0021716366],"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.0004887714,0.00020713794,0.0032834266,0.00021728541,0.00012624457,0.00020550481,0.0002785496,0.21521963,0.01845102,0.015786065,0.021943014,0.7237935],"study_design_scores_gemma":[0.000031876174,0.00008584632,0.00025778724,0.000025298606,0.000016870224,0.00014352237,0.000033827648,0.9721654,0.011058706,0.011157841,0.0050052637,0.000017809776],"about_ca_topic_score_codex":0.004783494,"about_ca_topic_score_gemma":0.0057930495,"teacher_disagreement_score":0.0056710616,"about_ca_system_score_codex":0.0008611977,"about_ca_system_score_gemma":0.001709841,"threshold_uncertainty_score":0.018971562},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013781634,0.00021155571,0.98160166,0.00010795866,0.00008576063,0.000033031265,0.00007948659,0.001144584,0.002954346],"genre_scores_gemma":[0.5184217,0.00033900572,0.47583938,0.00019102337,0.000038638264,0.0001597323,0.0002484146,0.00015044752,0.004611773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998141,0.000029147288,0.000018107632,0.0000537809,0.00006330753,0.000021574231],"domain_scores_gemma":[0.99983025,0.000060853115,0.000027953924,0.000024636476,0.000047759462,0.000008447526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031833473,0.00047908118,0.00032584192,0.00018533121,0.0001772403,0.0004247287,0.0007191998,0.00044345428,0.0020545674],"category_scores_gemma":[0.0008803139,0.00024272343,0.00044261367,0.00019770124,0.00028307174,0.00060085015,0.0003201667,0.0005446157,0.00043534805],"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.0001498863,0.00006451333,0.0004584531,0.0003306218,0.00009592266,0.00033057499,0.00013932434,0.5623204,0.110499665,0.060860224,0.0028125898,0.26193786],"study_design_scores_gemma":[0.0000069414677,0.000036584883,0.00005441237,0.000010915755,0.000011003929,0.000036166,0.0000048159145,0.9802274,0.0141028,0.0036475125,0.0018549478,0.0000065161935],"about_ca_topic_score_codex":0.0016468961,"about_ca_topic_score_gemma":0.0033759002,"teacher_disagreement_score":0.0020545674,"about_ca_system_score_codex":0.0004195323,"about_ca_system_score_gemma":0.0005681742,"threshold_uncertainty_score":0.00687325},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006118774,0.000102566235,0.9901484,0.0001781429,0.000024357829,0.000048971222,0.000040570703,0.00035959747,0.0029785053],"genre_scores_gemma":[0.4669686,0.00017406298,0.528085,0.000208067,0.00006347482,0.00036655867,0.0002068084,0.0001639627,0.0037635593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987871,0.0004479472,0.00006146169,0.00018478493,0.0004068967,0.00011194858],"domain_scores_gemma":[0.99520195,0.0035836473,0.0002913493,0.00044231335,0.00031499335,0.00016569471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022470239,0.00076479436,0.0012141377,0.00083794544,0.00057489134,0.0009870332,0.0017512084,0.0011314217,0.004056892],"category_scores_gemma":[0.009607419,0.0006551463,0.0007917506,0.00097308436,0.0015738831,0.0014161997,0.0017334644,0.0016972545,0.00063900324],"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.000053244854,0.000025949073,0.00034421406,0.000034433142,0.000022879873,0.000036742225,0.000033762088,0.93034077,0.00036330288,0.041556265,0.00075312186,0.026435293],"study_design_scores_gemma":[0.000004480021,0.000005724883,0.00001692791,0.0000026960365,0.0000016362444,0.0000052257355,0.0000011706799,0.9912503,0.00012143717,0.008362213,0.00022668485,0.0000015285009],"about_ca_topic_score_codex":0.004654962,"about_ca_topic_score_gemma":0.005778416,"teacher_disagreement_score":0.004654962,"about_ca_system_score_codex":0.001694972,"about_ca_system_score_gemma":0.0021728117,"threshold_uncertainty_score":0.01357168},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003127699,0.00010170336,0.99417937,0.00008803472,0.000015290729,0.00001913183,0.000057955458,0.0003457121,0.002065124],"genre_scores_gemma":[0.48420173,0.0007252274,0.50046045,0.00039177877,0.000115249706,0.0003247683,0.00065101933,0.000645058,0.012484795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963045,0.00012230859,0.000018406672,0.000098000775,0.000096218064,0.000034685276],"domain_scores_gemma":[0.998973,0.0006699061,0.00008404544,0.00016015249,0.0000809496,0.00003194721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010169205,0.0009239677,0.00050279684,0.0006278319,0.00031836084,0.0007984932,0.001080502,0.00093220826,0.00625964],"category_scores_gemma":[0.004220012,0.000481652,0.0007726405,0.0004450699,0.0012920062,0.00155851,0.0016464086,0.001969204,0.0012732878],"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.000059139536,0.00003487523,0.00035185803,0.00009556126,0.00003230945,0.00008438152,0.00012514445,0.6761876,0.007024287,0.22063267,0.001857278,0.09351496],"study_design_scores_gemma":[0.0000036134923,0.000012800683,0.000035240864,0.0000099484205,0.0000050227154,0.000025695012,0.0000048634124,0.9475002,0.0014070424,0.049177274,0.0018126193,0.000005621399],"about_ca_topic_score_codex":0.002121809,"about_ca_topic_score_gemma":0.0027565053,"teacher_disagreement_score":0.00625964,"about_ca_system_score_codex":0.0006978678,"about_ca_system_score_gemma":0.00076159684,"threshold_uncertainty_score":0.020940602},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029369444,0.00024235477,0.9928888,0.00071334915,0.000039957104,0.000016314396,0.000042633044,0.000045659308,0.003073987],"genre_scores_gemma":[0.5372477,0.0016367838,0.45294666,0.000673082,0.0005618193,0.00034727814,0.00024711067,0.00024173618,0.006097752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984774,0.00078274717,0.00006613429,0.00026292828,0.0003000594,0.00011065804],"domain_scores_gemma":[0.9961592,0.0025203521,0.00035843448,0.00049229973,0.00030411122,0.00016557184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027188782,0.0013602602,0.001213262,0.0010797288,0.000539965,0.0024389094,0.0020755227,0.0021059378,0.00611102],"category_scores_gemma":[0.009884493,0.0006350218,0.0012856771,0.0010118011,0.0041023423,0.0061845174,0.002779073,0.004632681,0.0007374539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020315449,0.000024741366,0.00015946625,0.000058857793,0.000020660971,0.000029722618,0.000063097155,0.1650715,0.0005957137,0.82042533,0.00078631396,0.012744324],"study_design_scores_gemma":[0.0000110711035,0.000058886544,0.00005158821,0.000022129658,0.0000057206366,0.000022046665,0.000016495425,0.35995394,0.00031615177,0.6377535,0.0017769288,0.000011627428],"about_ca_topic_score_codex":0.0009167027,"about_ca_topic_score_gemma":0.0006796424,"teacher_disagreement_score":0.00611102,"about_ca_system_score_codex":0.0018286983,"about_ca_system_score_gemma":0.0009781967,"threshold_uncertainty_score":0.02044344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003930284,0.00024043898,0.99349046,0.00024041148,0.000036019188,0.000044752407,0.0000463026,0.00052244007,0.0014488812],"genre_scores_gemma":[0.56991696,0.00059143413,0.4243037,0.00036589804,0.00014576144,0.0008673118,0.0002886441,0.00022069496,0.0032996999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988599,0.00057880866,0.00006771642,0.0002061294,0.00020505769,0.00008234437],"domain_scores_gemma":[0.99555296,0.0033537194,0.00028026907,0.00036249176,0.0003376862,0.0001128223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019453714,0.0010812506,0.0012639469,0.00045666922,0.00039145115,0.0011933055,0.0013086742,0.0013708677,0.0035795302],"category_scores_gemma":[0.009478923,0.00048667623,0.00064921513,0.0004970412,0.0014733108,0.0016516156,0.0011680619,0.003176733,0.0006099307],"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.000061439896,0.00005809307,0.000379242,0.00010719877,0.000036177396,0.00004471012,0.000053706248,0.84229773,0.00071420986,0.11113393,0.001594227,0.043519422],"study_design_scores_gemma":[0.000010182393,0.000012301267,0.000024385701,0.000006967145,0.0000027943481,0.0000049160344,0.0000026492564,0.9647503,0.00018586595,0.03450331,0.00049279263,0.0000035004618],"about_ca_topic_score_codex":0.0014463402,"about_ca_topic_score_gemma":0.0018338809,"teacher_disagreement_score":0.0035795302,"about_ca_system_score_codex":0.001200085,"about_ca_system_score_gemma":0.0012643383,"threshold_uncertainty_score":0.011974692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097656585,0.000072396346,0.98173827,0.00011173437,0.00003559922,0.000041480384,0.00009553247,0.0007004309,0.0074388604],"genre_scores_gemma":[0.5347614,0.0004655177,0.43808797,0.0003080125,0.000098089666,0.00020594434,0.00058635924,0.0004972483,0.024989499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997565,0.000042908043,0.000009468459,0.00007415868,0.00008225967,0.00003473474],"domain_scores_gemma":[0.99957997,0.00015742762,0.000046369834,0.00011399566,0.00007422885,0.000027987786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069695624,0.0008098654,0.0003847725,0.000547032,0.00037859636,0.00080466346,0.0008041717,0.0007773412,0.006103049],"category_scores_gemma":[0.0024484082,0.00033658117,0.0005570132,0.00040532276,0.0009383261,0.0012087558,0.0010840575,0.0010385262,0.0011952827],"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.00006389906,0.000043528857,0.00058178516,0.00006359006,0.000026832571,0.0001226941,0.00010537516,0.47259647,0.014732075,0.37615204,0.0040844185,0.13142727],"study_design_scores_gemma":[0.0000040556542,0.000014421733,0.00009944678,0.000006493123,0.00000631069,0.00006406234,0.0000056986837,0.94406,0.0043250807,0.04775071,0.0036560867,0.0000075562425],"about_ca_topic_score_codex":0.0030287476,"about_ca_topic_score_gemma":0.0036862171,"teacher_disagreement_score":0.006103049,"about_ca_system_score_codex":0.0010356496,"about_ca_system_score_gemma":0.0010959812,"threshold_uncertainty_score":0.020416677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04209001,0.0006017012,0.9511522,0.00029889838,0.00013560483,0.000032983353,0.00010860425,0.002238514,0.0033414634],"genre_scores_gemma":[0.737292,0.0005967774,0.2548204,0.00025724788,0.00008961343,0.00011544624,0.00023459617,0.00022669094,0.00636728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981624,0.000035868852,0.00001422155,0.00005185795,0.00005114349,0.000030767922],"domain_scores_gemma":[0.9996704,0.000109503686,0.00005061692,0.00008496333,0.00006012175,0.000024338595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047899442,0.0005621827,0.00042774944,0.00027730665,0.00020316005,0.00094280276,0.0021526467,0.0008791165,0.002385772],"category_scores_gemma":[0.001792503,0.0003152003,0.00040248423,0.00042220854,0.0006869366,0.0016486988,0.00075361994,0.0010953305,0.0007521226],"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.0003366657,0.0001511145,0.0018703594,0.00021657477,0.00012291035,0.00040568758,0.0002610931,0.43032843,0.07213345,0.13686253,0.005857066,0.35145414],"study_design_scores_gemma":[0.000006205836,0.000035645735,0.000089655856,0.0000066337807,0.000008898296,0.00003793025,0.000007848264,0.9817629,0.009156579,0.007366968,0.0015105689,0.000010206774],"about_ca_topic_score_codex":0.0025627448,"about_ca_topic_score_gemma":0.003405563,"teacher_disagreement_score":0.0025627448,"about_ca_system_score_codex":0.00052914623,"about_ca_system_score_gemma":0.0004582629,"threshold_uncertainty_score":0.007981181},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016815934,0.0011100173,0.95681417,0.0005395073,0.00029702898,0.00018885262,0.00040425226,0.019157294,0.004672947],"genre_scores_gemma":[0.2647398,0.0004347577,0.7129027,0.0010951833,0.00015562243,0.0005940909,0.0020175863,0.002466964,0.0155933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993363,0.00017802234,0.000054548633,0.00018989801,0.00017245847,0.00006873939],"domain_scores_gemma":[0.99922204,0.00033113974,0.0000695203,0.00017430444,0.00014780673,0.0000550663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013943599,0.002282244,0.0020000965,0.00059041486,0.0005439692,0.0011583881,0.0026183557,0.0025873221,0.009455135],"category_scores_gemma":[0.003832751,0.00105402,0.0008048912,0.0006425067,0.0009128733,0.0016263608,0.0014492439,0.0030834107,0.006158217],"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.0008049755,0.00035177794,0.0014284154,0.00033658757,0.00020420521,0.00022659592,0.000107794396,0.61364895,0.006171588,0.013762046,0.04105739,0.32189965],"study_design_scores_gemma":[0.00005539183,0.000049633265,0.0000752905,0.000011888218,0.0000114065415,0.000024417363,0.0000072539456,0.993634,0.0014769323,0.0032423127,0.0014008768,0.000010614387],"about_ca_topic_score_codex":0.0068230988,"about_ca_topic_score_gemma":0.010490195,"teacher_disagreement_score":0.009455135,"about_ca_system_score_codex":0.0009125455,"about_ca_system_score_gemma":0.002323115,"threshold_uncertainty_score":0.031630635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011251109,0.00026185036,0.98600125,0.00022308971,0.00005120802,0.000023946417,0.00003998588,0.0013847959,0.0007626902],"genre_scores_gemma":[0.4391492,0.00057163596,0.552631,0.0004005374,0.00017070658,0.0002527612,0.00041025082,0.0015384356,0.004875516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984908,0.00047849384,0.00012076922,0.0002650966,0.000517833,0.00012693179],"domain_scores_gemma":[0.99633396,0.002082965,0.00027628941,0.00069377496,0.00050914474,0.00010384219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027065047,0.001671234,0.0016726777,0.00071171543,0.00059820333,0.0014480995,0.0018120885,0.0018323568,0.002327647],"category_scores_gemma":[0.014269058,0.0011404167,0.0009802133,0.000759878,0.0015337924,0.0030618152,0.0022407188,0.0029226274,0.0012282266],"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.00026103266,0.000101817204,0.0011530692,0.00019918765,0.000104987936,0.00014852568,0.00013101671,0.84271425,0.010674475,0.023130193,0.003033279,0.118348144],"study_design_scores_gemma":[0.000010046008,0.000028820601,0.00008235052,0.000007781157,0.000007084919,0.000020744077,0.000003937373,0.991017,0.002402301,0.0058999825,0.00051338825,0.0000065099816],"about_ca_topic_score_codex":0.0035142174,"about_ca_topic_score_gemma":0.0046485662,"teacher_disagreement_score":0.0035142174,"about_ca_system_score_codex":0.0009196741,"about_ca_system_score_gemma":0.0019039314,"threshold_uncertainty_score":0.014313519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016688616,0.000111270005,0.99677247,0.000086308784,0.000026075515,0.000027329017,0.000040795636,0.00036614778,0.000900759],"genre_scores_gemma":[0.27198526,0.00042656742,0.71966594,0.0005534626,0.00020210954,0.00028615724,0.0006894519,0.00061044196,0.005580735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983463,0.0007099282,0.00006533255,0.00032536377,0.00040768407,0.00014526016],"domain_scores_gemma":[0.9972905,0.0014241118,0.00015248162,0.000557465,0.0004171501,0.0001582588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039180974,0.001187501,0.0021261992,0.0010149784,0.00083438394,0.0015268705,0.0030274664,0.0015481631,0.0043638134],"category_scores_gemma":[0.011304002,0.0010422842,0.0014256713,0.0010881864,0.0013996869,0.0018615385,0.002883944,0.0026021602,0.0014294268],"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.00009530057,0.00006783153,0.0013838615,0.00019375718,0.00019870681,0.000094574636,0.00012443902,0.68163496,0.0027300427,0.1703802,0.007743443,0.13535288],"study_design_scores_gemma":[0.0000049794467,0.000005787431,0.000051333755,0.0000071588834,0.000006781509,0.000013736178,0.0000032185558,0.9659372,0.00039039666,0.03256197,0.0010133263,0.0000040983173],"about_ca_topic_score_codex":0.0038329477,"about_ca_topic_score_gemma":0.004957164,"teacher_disagreement_score":0.0043638134,"about_ca_system_score_codex":0.0015785656,"about_ca_system_score_gemma":0.0019854552,"threshold_uncertainty_score":0.020721138},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024670122,0.0005273281,0.96716124,0.00035148772,0.00008818153,0.000107339685,0.00012326911,0.004477574,0.002493581],"genre_scores_gemma":[0.84065586,0.00017944098,0.1552905,0.00040475768,0.000055049954,0.00033915925,0.00029469462,0.0003657138,0.0024148175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940526,0.00020235087,0.000028720759,0.00014593048,0.00013241936,0.00008534191],"domain_scores_gemma":[0.9982615,0.0010723267,0.00014891606,0.00023611938,0.00015596063,0.0001251785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669023,0.00122024,0.0014132385,0.0004488206,0.00040599663,0.00088002667,0.002225241,0.0013979359,0.003678383],"category_scores_gemma":[0.00562928,0.0006953441,0.00071759504,0.00033361415,0.0012060595,0.001376939,0.002256623,0.0024510755,0.000804481],"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.00012394908,0.00010215726,0.0007774272,0.00009720742,0.000061318126,0.00008341508,0.00006066423,0.92714065,0.0019096585,0.0056048213,0.0018332679,0.06220553],"study_design_scores_gemma":[0.000013529026,0.000023391112,0.00003277231,0.000004509436,0.0000035050834,0.0000071131253,0.0000027684132,0.99717665,0.00028992145,0.00223144,0.00021121583,0.0000031706616],"about_ca_topic_score_codex":0.003964559,"about_ca_topic_score_gemma":0.005016447,"teacher_disagreement_score":0.003964559,"about_ca_system_score_codex":0.0008662162,"about_ca_system_score_gemma":0.0017689058,"threshold_uncertainty_score":0.0123054385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030054534,0.00037057768,0.9666666,0.00044538674,0.00011629838,0.000028050501,0.00031767885,0.00019999995,0.0018008711],"genre_scores_gemma":[0.873157,0.0013494305,0.108982794,0.0003854173,0.00014979101,0.00021962803,0.00085712504,0.00017125312,0.014727591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941576,0.00014174166,0.000046219666,0.00019214515,0.00015221923,0.000051913317],"domain_scores_gemma":[0.9982016,0.0010556626,0.00034355887,0.0001344793,0.0002039312,0.000060769114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015160916,0.0005219086,0.00067025056,0.00047533753,0.00025696307,0.0008622803,0.0011344504,0.0011814052,0.0020444356],"category_scores_gemma":[0.006789045,0.00044318888,0.0008789213,0.00062092516,0.00090955885,0.0018211605,0.00091264804,0.001982132,0.00027480134],"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.000031061954,0.000027732558,0.0022757966,0.000096414806,0.000042827574,0.0002093588,0.00013196451,0.8531134,0.003506005,0.12795608,0.0009787594,0.011630584],"study_design_scores_gemma":[0.0000014907071,0.0000018608905,0.0001446649,0.0000023582238,0.0000018670214,0.000010684172,0.0000032241983,0.99075025,0.00010929142,0.008772095,0.00019898314,0.0000031395687],"about_ca_topic_score_codex":0.007972819,"about_ca_topic_score_gemma":0.006901272,"teacher_disagreement_score":0.007972819,"about_ca_system_score_codex":0.0010253809,"about_ca_system_score_gemma":0.0007289068,"threshold_uncertainty_score":0.015852809},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020433484,0.00041555974,0.91526103,0.0040421565,0.00024403674,0.00018973672,0.00022078527,0.00037149424,0.058821715],"genre_scores_gemma":[0.7219175,0.00078725105,0.23762159,0.0015075983,0.00046416884,0.0009825021,0.00038952008,0.00036502554,0.03596475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887693,0.004697083,0.0005513028,0.0024943617,0.002328148,0.001159814],"domain_scores_gemma":[0.97894466,0.009005292,0.0013487813,0.008569697,0.0015512214,0.0005803529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065749045,0.00084648223,0.0022888093,0.00084834587,0.0017154661,0.0040251534,0.0024992037,0.0028035082,0.015248629],"category_scores_gemma":[0.043789927,0.0007370091,0.0012209261,0.0012073341,0.005403883,0.0075181494,0.0042662774,0.003924676,0.0041803],"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.00011328795,0.000051586856,0.00033386212,0.00010875342,0.00004349251,0.000052526964,0.00015785427,0.015985796,0.0015893333,0.94179314,0.0038145324,0.035955857],"study_design_scores_gemma":[0.000034590685,0.000035718607,0.00013335307,0.00003846895,0.000012812256,0.00005138326,0.000063647436,0.034792062,0.00084689417,0.95667034,0.0073067932,0.000013849785],"about_ca_topic_score_codex":0.00073544984,"about_ca_topic_score_gemma":0.0011086457,"teacher_disagreement_score":0.015248629,"about_ca_system_score_codex":0.0013775837,"about_ca_system_score_gemma":0.0023399587,"threshold_uncertainty_score":0.05101174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008788654,0.001993671,0.9717389,0.0015652503,0.00015670739,0.000073689545,0.00015728563,0.00030178472,0.015224053],"genre_scores_gemma":[0.54927224,0.006310536,0.41189593,0.0028303163,0.001589994,0.00088054937,0.00067576766,0.0013635887,0.025181033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926763,0.0024827982,0.00026960688,0.0012503023,0.002691147,0.0006298281],"domain_scores_gemma":[0.9550938,0.03468132,0.0018782917,0.0039385217,0.0034840135,0.0009241331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013750757,0.0028342959,0.0024207537,0.00336946,0.0018628318,0.0048300494,0.0038464519,0.0027430071,0.009008506],"category_scores_gemma":[0.07347581,0.0013535479,0.0024717024,0.0022480376,0.0054128547,0.014629651,0.007119018,0.009858217,0.0023715475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004932997,0.000030082196,0.00041121035,0.00010889269,0.00003338775,0.000070115704,0.00019179293,0.06383092,0.00072094647,0.91182095,0.0022987807,0.0204335],"study_design_scores_gemma":[0.000008952522,0.000024669464,0.0001827129,0.00005526559,0.000018340414,0.00006986719,0.000023322456,0.32128412,0.00060644036,0.6749672,0.0027284706,0.00003055271],"about_ca_topic_score_codex":0.0034606005,"about_ca_topic_score_gemma":0.0029947017,"teacher_disagreement_score":0.013750757,"about_ca_system_score_codex":0.0054546036,"about_ca_system_score_gemma":0.0027164978,"threshold_uncertainty_score":0.07272184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050107655,0.00025077374,0.9929288,0.00016676019,0.000033234715,0.00002070717,0.000027424096,0.00015350645,0.0014080784],"genre_scores_gemma":[0.49628234,0.0008207809,0.4920969,0.00043827944,0.00017911095,0.00037907902,0.00047599358,0.0004947618,0.008832836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990895,0.00035237838,0.000033175937,0.00017526938,0.00027046067,0.00007914572],"domain_scores_gemma":[0.99868685,0.00079674163,0.0001178506,0.00010369438,0.00022962269,0.0000651844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395178,0.0012796043,0.001321775,0.00046840374,0.00042023498,0.00092239154,0.0012033919,0.0010957828,0.0018706546],"category_scores_gemma":[0.0036841019,0.00060367055,0.0012194489,0.00050252373,0.001184038,0.0010505185,0.0014308426,0.0018704355,0.0005148474],"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.00003484732,0.000030856587,0.0003410725,0.000095739284,0.000045882796,0.00007489479,0.000038601393,0.95418274,0.001585473,0.024457248,0.0015293895,0.017583283],"study_design_scores_gemma":[0.0000019402923,0.000006425724,0.00002327624,0.000002528252,0.0000015506507,0.0000046724876,0.0000015718977,0.9961641,0.00014673568,0.0034063736,0.00023890828,0.0000020127954],"about_ca_topic_score_codex":0.005269673,"about_ca_topic_score_gemma":0.0055112885,"teacher_disagreement_score":0.005269673,"about_ca_system_score_codex":0.0011007095,"about_ca_system_score_gemma":0.0014751885,"threshold_uncertainty_score":0.01047802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23401985,0.0025722699,0.7433548,0.0009687275,0.00039227985,0.00026586835,0.0042748046,0.006718052,0.0074333022],"genre_scores_gemma":[0.84195673,0.00096077466,0.14224373,0.00031208133,0.00023688658,0.00019007035,0.00658626,0.0003389453,0.0071746134],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946445,0.00009901781,0.000032343676,0.00023746931,0.000107132204,0.000059665257],"domain_scores_gemma":[0.9985417,0.0005844386,0.00015653331,0.00036751546,0.00026411487,0.00008572379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005024792,0.0012394015,0.0009502184,0.0015973176,0.00037641928,0.0011764499,0.0012695803,0.0014164984,0.0025900467],"category_scores_gemma":[0.0034116716,0.00045484977,0.0009006333,0.0013640884,0.0005692369,0.002366294,0.0011713695,0.0015963217,0.0018493456],"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.0014586338,0.00060008396,0.008693292,0.000628691,0.00028532394,0.00055557874,0.00023296569,0.03759616,0.08095634,0.0045023346,0.016646251,0.84784436],"study_design_scores_gemma":[0.00007750778,0.00032730857,0.005006928,0.00010545461,0.00014983678,0.0003115133,0.00013555642,0.9370398,0.023024555,0.028821224,0.004954257,0.00004607441],"about_ca_topic_score_codex":0.0043291743,"about_ca_topic_score_gemma":0.009312103,"teacher_disagreement_score":0.0043291743,"about_ca_system_score_codex":0.0004280507,"about_ca_system_score_gemma":0.00069936353,"threshold_uncertainty_score":0.008664608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15593746,0.00174796,0.77396685,0.010398192,0.0008589254,0.00006646531,0.00028135037,0.0024206778,0.054322165],"genre_scores_gemma":[0.9344385,0.00052191474,0.039644446,0.0021327615,0.00034243907,0.00006473283,0.0001355868,0.0006817239,0.022037799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990823,0.0003001384,0.000029049059,0.00013776567,0.00031404357,0.00013669227],"domain_scores_gemma":[0.9954364,0.003011038,0.00021089065,0.0007199039,0.00036238017,0.00025936132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076873,0.001014397,0.0012332293,0.00077819277,0.0010847258,0.0022990808,0.0015052202,0.00278227,0.007433434],"category_scores_gemma":[0.019782681,0.0007893167,0.0006067499,0.000486814,0.002676783,0.004159263,0.005235282,0.0031661957,0.0021143064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005101849,0.00010219211,0.0018749002,0.00028725367,0.00024881968,0.00047174358,0.00030073937,0.18722184,0.015714742,0.6720824,0.013896105,0.107289106],"study_design_scores_gemma":[0.00003088358,0.00006470437,0.00039859215,0.00004305906,0.000019282414,0.00011390647,0.000055028642,0.57873607,0.0024492068,0.41524118,0.0028223258,0.000025818403],"about_ca_topic_score_codex":0.0018032042,"about_ca_topic_score_gemma":0.0018780804,"teacher_disagreement_score":0.007433434,"about_ca_system_score_codex":0.00082216505,"about_ca_system_score_gemma":0.00090149784,"threshold_uncertainty_score":0.024867356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022199448,0.0027858687,0.96644896,0.0010049324,0.00016393005,0.000045693185,0.00011496186,0.00036710728,0.0068690223],"genre_scores_gemma":[0.885905,0.0015320317,0.1029654,0.00047083962,0.00018912031,0.00019978877,0.00025367408,0.00012910816,0.008355042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989588,0.0005692044,0.000064850035,0.0001493919,0.00012989165,0.00012770943],"domain_scores_gemma":[0.9934993,0.0051758466,0.0004050232,0.00037106633,0.00038603824,0.00016263755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031013563,0.0009985984,0.0015708706,0.00066380104,0.00038796477,0.0019740907,0.0013544318,0.0019933945,0.003887188],"category_scores_gemma":[0.016878208,0.0006398204,0.00057924225,0.0010107461,0.0012044975,0.0020914646,0.0011036347,0.0025704415,0.00084796315],"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.00019163123,0.00009751564,0.0007189784,0.00015188105,0.00013053404,0.000049176688,0.000062650994,0.86855066,0.00048274646,0.07687354,0.0024438612,0.050246913],"study_design_scores_gemma":[0.000012239688,0.000019128087,0.000052904477,0.000021588401,0.000011699369,0.0000073578713,0.000004961644,0.9766604,0.00017466562,0.022694293,0.0003370906,0.0000038213802],"about_ca_topic_score_codex":0.003091142,"about_ca_topic_score_gemma":0.0032269324,"teacher_disagreement_score":0.003887188,"about_ca_system_score_codex":0.0013689524,"about_ca_system_score_gemma":0.0013475001,"threshold_uncertainty_score":0.016401768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017466543,0.001085909,0.9762256,0.0019007672,0.00008065101,0.000044317487,0.00028355065,0.00038064172,0.002531991],"genre_scores_gemma":[0.43014875,0.0024237896,0.53942966,0.0026200495,0.00074047496,0.0008422444,0.0024329398,0.0015722447,0.019789914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970867,0.001981154,0.00008324012,0.0003884138,0.00029217708,0.00016831589],"domain_scores_gemma":[0.99098176,0.0069321147,0.0004909251,0.000702039,0.00061219494,0.00028092018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009220363,0.0025178983,0.0022983896,0.0012128917,0.000704166,0.0019597914,0.0030436188,0.0037036636,0.0036548944],"category_scores_gemma":[0.021539485,0.0012781365,0.0013129858,0.0012932128,0.0032486813,0.002937258,0.0036704524,0.0044437577,0.0009865189],"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.00025107036,0.000098085686,0.0014934596,0.00027973152,0.00019220258,0.00024553284,0.00016960944,0.7792098,0.0016899357,0.18047392,0.0068711783,0.029025463],"study_design_scores_gemma":[0.000016953303,0.000018488428,0.00009914927,0.000024102304,0.0000092219925,0.000011938654,0.000009494227,0.9583347,0.00014800696,0.040687095,0.0006278247,0.000013124732],"about_ca_topic_score_codex":0.0088503705,"about_ca_topic_score_gemma":0.0087015275,"teacher_disagreement_score":0.009220363,"about_ca_system_score_codex":0.0019279472,"about_ca_system_score_gemma":0.0026781184,"threshold_uncertainty_score":0.0487625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077263354,0.0002932418,0.9891823,0.00042392052,0.000054111908,0.00006504207,0.00009170154,0.00047673986,0.0016866245],"genre_scores_gemma":[0.7441964,0.0007500999,0.24363971,0.00078041217,0.0001344159,0.0007906425,0.0007380103,0.00030597087,0.008664393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989826,0.00044346257,0.0000377808,0.0002940196,0.0001614523,0.00008062525],"domain_scores_gemma":[0.9968406,0.0023602166,0.00019967568,0.00020955806,0.00026877984,0.00012116717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018514647,0.0011955975,0.0012557673,0.0010359657,0.00051116484,0.0011371896,0.002436071,0.002261947,0.0041742227],"category_scores_gemma":[0.008302522,0.00061457703,0.0008057077,0.0011196876,0.0019259097,0.0028130864,0.0020223535,0.003132399,0.0008385733],"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.00008082144,0.00008748654,0.00042271227,0.00008782292,0.000033775228,0.00007361831,0.00008317223,0.88638455,0.001202221,0.054807145,0.0022622435,0.05447448],"study_design_scores_gemma":[0.0000051877023,0.000008334237,0.000016428521,0.0000037508821,0.0000021508592,0.0000046643236,0.0000031534278,0.98253274,0.0001834963,0.016936779,0.00030096876,0.0000023730156],"about_ca_topic_score_codex":0.004515542,"about_ca_topic_score_gemma":0.0049729953,"teacher_disagreement_score":0.004515542,"about_ca_system_score_codex":0.002017646,"about_ca_system_score_gemma":0.0014260603,"threshold_uncertainty_score":0.014639139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023996472,0.0032447693,0.96454716,0.00068059086,0.00014602067,0.00013744767,0.00078485016,0.0003232592,0.006139424],"genre_scores_gemma":[0.5333561,0.0050358768,0.44917816,0.0011282308,0.00081245485,0.0008579514,0.0034095708,0.00047468094,0.005747004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674785,0.001043878,0.00019455126,0.00053290353,0.0011699914,0.0003108123],"domain_scores_gemma":[0.9889727,0.007776721,0.0008476246,0.000985935,0.0011260472,0.00029091287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034769399,0.0016010344,0.0012928827,0.0036951888,0.00073467364,0.002377333,0.0015808421,0.0016630279,0.0037561096],"category_scores_gemma":[0.019573085,0.0006493707,0.0012874925,0.0037675519,0.002060288,0.0049593356,0.0020951629,0.0040301844,0.0012240584],"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.00011217477,0.00007982538,0.002673387,0.00040599608,0.00011679491,0.00017952507,0.00044571198,0.23643279,0.00421892,0.6639586,0.0077269133,0.083649315],"study_design_scores_gemma":[0.000016335243,0.000045211407,0.0009194948,0.00010901131,0.000023780767,0.00013832448,0.00004536001,0.5326414,0.0011266858,0.45711273,0.007801356,0.000020271264],"about_ca_topic_score_codex":0.0016346377,"about_ca_topic_score_gemma":0.0013412231,"teacher_disagreement_score":0.0037561096,"about_ca_system_score_codex":0.0017330215,"about_ca_system_score_gemma":0.00073146785,"threshold_uncertainty_score":0.018387973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009847768,0.0011613951,0.98472345,0.0008175629,0.00007257405,0.00003236325,0.000073856674,0.00018286433,0.0030881541],"genre_scores_gemma":[0.5960857,0.0025146538,0.39282033,0.0012072162,0.00073997513,0.00044522446,0.00035637085,0.00072074035,0.0051098033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909457,0.0037448662,0.00051561935,0.0016036455,0.002613156,0.000576967],"domain_scores_gemma":[0.9201509,0.063005336,0.004187095,0.006895335,0.0044954824,0.0012658417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018178191,0.002475671,0.002383949,0.0038172093,0.0013379266,0.0032207249,0.003689181,0.0032412955,0.0026803596],"category_scores_gemma":[0.09934791,0.0012950654,0.002536046,0.0024416859,0.007742745,0.009121503,0.009771379,0.009629199,0.00045276925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015866543,0.00006765775,0.0014098062,0.00021572161,0.00017488156,0.00013556705,0.0003815508,0.3518868,0.0030931858,0.61653346,0.0013830187,0.024559591],"study_design_scores_gemma":[0.000009846341,0.00005509217,0.00036070606,0.0000584121,0.00003098639,0.00004373892,0.000018580162,0.7376121,0.0014674006,0.25935236,0.00095374964,0.000037016205],"about_ca_topic_score_codex":0.0025682296,"about_ca_topic_score_gemma":0.0022743845,"teacher_disagreement_score":0.018178191,"about_ca_system_score_codex":0.004085642,"about_ca_system_score_gemma":0.0020699135,"threshold_uncertainty_score":0.09613663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08143664,0.0007813054,0.7254871,0.008863339,0.0006496699,0.00047507978,0.0009396574,0.0010208959,0.18034628],"genre_scores_gemma":[0.8619727,0.00044979513,0.04536259,0.0012200027,0.0002529567,0.00028781645,0.0005038783,0.00012697658,0.08982316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989606,0.000451725,0.000026409049,0.000169067,0.00025263635,0.0001395144],"domain_scores_gemma":[0.9965249,0.002582949,0.00011057928,0.00033055784,0.00020817266,0.0002428184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011696595,0.0009968645,0.00074172847,0.0005452688,0.00061692833,0.0018274201,0.0014264584,0.0027557006,0.01906451],"category_scores_gemma":[0.009821343,0.00035136958,0.0005025357,0.00035571455,0.0012465157,0.0024033675,0.0021299042,0.0027107578,0.0018962494],"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.00046043194,0.00026907647,0.0007509675,0.00014459423,0.00010923146,0.0003212035,0.0001087859,0.2844349,0.0022187976,0.61721796,0.034950137,0.05901399],"study_design_scores_gemma":[0.000053439704,0.00008496035,0.00015477174,0.000020784442,0.000014438281,0.00009738914,0.000019744804,0.72635674,0.00078139966,0.26655895,0.0058438354,0.000013593383],"about_ca_topic_score_codex":0.0011320858,"about_ca_topic_score_gemma":0.0014601758,"teacher_disagreement_score":0.01906451,"about_ca_system_score_codex":0.00090826117,"about_ca_system_score_gemma":0.0008669982,"threshold_uncertainty_score":0.06377715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052486616,0.0004581224,0.9929066,0.00017062032,0.000077870594,0.000028756232,0.00002347342,0.00022659916,0.0008593986],"genre_scores_gemma":[0.47345188,0.0012618301,0.5164025,0.00042251585,0.00053924567,0.00032211223,0.00022073452,0.000247381,0.0071317717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906045,0.00026594164,0.00006476603,0.00030557424,0.00022192468,0.000081416125],"domain_scores_gemma":[0.99645233,0.002229342,0.00021446448,0.0005169641,0.00040769044,0.00017927997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024066668,0.000879532,0.0017060757,0.0013538657,0.00072037516,0.0014470435,0.0035381436,0.0015780216,0.0025609268],"category_scores_gemma":[0.006996414,0.00073559245,0.0011272115,0.0015365259,0.0018393532,0.0039367178,0.00410822,0.0031784019,0.0004756167],"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.00026001557,0.0004049744,0.0014109003,0.00035884063,0.00033449524,0.00021890453,0.00035199066,0.38469085,0.0048710722,0.120579414,0.0040411116,0.4824773],"study_design_scores_gemma":[0.0000065410827,0.00003109365,0.0001187146,0.000010946587,0.0000152577795,0.000026270367,0.000010266962,0.9538743,0.00052825536,0.04472872,0.0006388621,0.000010809031],"about_ca_topic_score_codex":0.003422109,"about_ca_topic_score_gemma":0.003302556,"teacher_disagreement_score":0.0035381436,"about_ca_system_score_codex":0.0008119347,"about_ca_system_score_gemma":0.00116492,"threshold_uncertainty_score":0.012727857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045807427,0.0008008614,0.9865568,0.0006433047,0.00021384582,0.00011621085,0.00021529275,0.0010241934,0.0058486625],"genre_scores_gemma":[0.20625512,0.0010553295,0.77227056,0.0011039057,0.0007913593,0.0008896793,0.0012440347,0.0016624638,0.014727648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948014,0.001772145,0.00027346116,0.0009955202,0.0013673346,0.0007901536],"domain_scores_gemma":[0.9772019,0.017224086,0.0008228455,0.002540199,0.0015993448,0.000611656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064898464,0.0041695274,0.0040655653,0.0023155515,0.001452802,0.0049270904,0.0075717648,0.0041905413,0.016706841],"category_scores_gemma":[0.03128014,0.0018889578,0.0026224847,0.0036870155,0.0026560691,0.009638143,0.005700934,0.010276528,0.0050167944],"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.00056468946,0.00077117747,0.00083465525,0.00058487593,0.00019392809,0.00014167571,0.00027003966,0.5662181,0.002446612,0.18085101,0.02973805,0.21738525],"study_design_scores_gemma":[0.000045332825,0.000038144553,0.000111791494,0.000027399734,0.000022086375,0.000029932091,0.0000178993,0.92070657,0.0005295198,0.07747309,0.0009810813,0.000017187065],"about_ca_topic_score_codex":0.004448918,"about_ca_topic_score_gemma":0.008058358,"teacher_disagreement_score":0.016706841,"about_ca_system_score_codex":0.00410941,"about_ca_system_score_gemma":0.004779099,"threshold_uncertainty_score":0.055890024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01899641,0.00027311716,0.92616355,0.0002753871,0.0004628212,0.00014962515,0.00037553033,0.049816754,0.0034868775],"genre_scores_gemma":[0.4310671,0.00023054575,0.55012923,0.00060647697,0.00017446425,0.00070893386,0.0016550118,0.0059023085,0.0095259985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991227,0.0001659083,0.00006486871,0.0002920074,0.0002462262,0.00010835447],"domain_scores_gemma":[0.99864656,0.0004662796,0.00006655858,0.00045705907,0.00023685175,0.00012666994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013495114,0.0014076057,0.0008971834,0.0007834892,0.00068018184,0.0013293106,0.0033403407,0.0011430096,0.012892905],"category_scores_gemma":[0.004788088,0.00087744027,0.0006243527,0.00079399085,0.0011406493,0.0025038181,0.0030515578,0.0025189046,0.0031439685],"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.0020310872,0.00064251205,0.003168605,0.00042536197,0.00036048878,0.00033367387,0.00037022936,0.20112453,0.020622881,0.038553197,0.07539756,0.65696996],"study_design_scores_gemma":[0.00015885633,0.00009422461,0.00022521049,0.000019814224,0.000027648117,0.000048356218,0.00004113974,0.955875,0.015251823,0.021468598,0.0067620133,0.000027342063],"about_ca_topic_score_codex":0.004105242,"about_ca_topic_score_gemma":0.008310291,"teacher_disagreement_score":0.012892905,"about_ca_system_score_codex":0.0010139076,"about_ca_system_score_gemma":0.0018958434,"threshold_uncertainty_score":0.043131053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20104478,0.0012846526,0.79291505,0.0023579767,0.00021950656,0.00006257739,0.00023338961,0.0005706548,0.0013114377],"genre_scores_gemma":[0.96601427,0.0002881486,0.032184392,0.0001608017,0.0001299996,0.000033234428,0.00020944834,0.000057907997,0.0009217828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990344,0.00038936446,0.000050681487,0.00028394797,0.0001262912,0.00011538667],"domain_scores_gemma":[0.9896444,0.008699414,0.00051050074,0.0005163723,0.00038680973,0.00024246458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050918767,0.0007996834,0.001653662,0.0006148369,0.0002951906,0.0013326419,0.0013096231,0.0015678162,0.001811002],"category_scores_gemma":[0.022987874,0.0004608764,0.0006503946,0.0005548923,0.0010445273,0.0033696252,0.0009894652,0.0025587548,0.00021456159],"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.0010132614,0.0002753958,0.015214575,0.00034235703,0.00039590208,0.00042555446,0.00028399966,0.7407897,0.0052691028,0.06895701,0.0040387656,0.16299434],"study_design_scores_gemma":[0.0000069461757,0.000019137477,0.00044816735,0.000008257595,0.000014421623,0.000020346382,0.0000057966113,0.980808,0.0003388306,0.018241646,0.00008193518,0.0000064256333],"about_ca_topic_score_codex":0.0018121663,"about_ca_topic_score_gemma":0.0018854933,"teacher_disagreement_score":0.0050918767,"about_ca_system_score_codex":0.0006610479,"about_ca_system_score_gemma":0.00056606124,"threshold_uncertainty_score":0.026928723},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014835562,0.00027498216,0.97749627,0.0002517897,0.00015526493,0.000052067928,0.00008393866,0.0019146523,0.0049355687],"genre_scores_gemma":[0.27923152,0.0003116313,0.7013261,0.0003366175,0.00009905838,0.00009908804,0.0001999651,0.00028263047,0.018113371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996013,0.0000799796,0.000019484596,0.00006582206,0.00019300605,0.000040362662],"domain_scores_gemma":[0.9989936,0.00027844743,0.000085452666,0.00025753654,0.000347013,0.00003793784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031931378,0.0009861591,0.0003391658,0.00064554246,0.0008027691,0.00064951775,0.0009693307,0.00076970505,0.009358675],"category_scores_gemma":[0.0019395613,0.00023756642,0.00021939205,0.00085060095,0.0004602752,0.0010154374,0.0008176604,0.0009524186,0.0021850856],"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.0006801466,0.00016242893,0.000769223,0.00026646687,0.000103103135,0.00029047343,0.00020143096,0.035664555,0.13666436,0.07066926,0.013810492,0.740718],"study_design_scores_gemma":[0.000054085514,0.00032481435,0.00053333875,0.0001103739,0.00006516043,0.00073227164,0.00006385905,0.62723255,0.3080703,0.034713764,0.028040297,0.00005926975],"about_ca_topic_score_codex":0.002304168,"about_ca_topic_score_gemma":0.0070608933,"teacher_disagreement_score":0.009358675,"about_ca_system_score_codex":0.00043913093,"about_ca_system_score_gemma":0.0012918297,"threshold_uncertainty_score":0.031307876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74801975,0.0008109179,0.24346194,0.00063226937,0.00006670438,0.00022637469,0.0007725187,0.003264302,0.0027452563],"genre_scores_gemma":[0.94889116,0.00020306098,0.049012113,0.0001475153,0.000013108119,0.00012628679,0.0010970585,0.000103366605,0.0004063666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747473,0.00097149867,0.00024787357,0.0006880756,0.00045506484,0.00016263683],"domain_scores_gemma":[0.9604189,0.030643309,0.0021040065,0.004975502,0.00139482,0.00046349695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006694199,0.0011155056,0.0006130201,0.0010406238,0.000278985,0.001103836,0.0016156236,0.001363978,0.0016018722],"category_scores_gemma":[0.05228423,0.0006035756,0.0009938248,0.00068677263,0.001147759,0.0053343102,0.0015939804,0.00261706,0.0004656616],"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.0007949703,0.0005756917,0.033208113,0.0006651753,0.00056920806,0.00018977755,0.00059469306,0.7490464,0.019704323,0.006530267,0.0018040432,0.18631741],"study_design_scores_gemma":[0.00003760072,0.00035858486,0.0034650392,0.000028830322,0.00006994122,0.00009852624,0.00006396481,0.97083336,0.011288314,0.01335307,0.00038044507,0.000022285252],"about_ca_topic_score_codex":0.0029241783,"about_ca_topic_score_gemma":0.0043085814,"teacher_disagreement_score":0.006694199,"about_ca_system_score_codex":0.001286137,"about_ca_system_score_gemma":0.0011397917,"threshold_uncertainty_score":0.035402715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061905824,0.0004263716,0.9325509,0.0012236511,0.00007273914,0.0000852957,0.00017796116,0.0005368414,0.0030203508],"genre_scores_gemma":[0.9127512,0.00024536776,0.08147031,0.0004289969,0.000120407545,0.00018228551,0.00029944282,0.00008227496,0.0044197426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.00037140423,0.000052780284,0.00034788664,0.0001542474,0.0001849321],"domain_scores_gemma":[0.99264115,0.005807964,0.00056813523,0.00047138392,0.00020970205,0.00030169173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025590383,0.001387584,0.0020934728,0.0004370077,0.0005515495,0.0016202636,0.0025019918,0.0027289977,0.0025538139],"category_scores_gemma":[0.0111631155,0.0007821785,0.00076504325,0.0005846416,0.001907771,0.003123708,0.0022538484,0.0032903387,0.0004990075],"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.00017248954,0.000054624627,0.00062976795,0.000055049117,0.000040684652,0.00006131962,0.0000424073,0.9617857,0.00026171978,0.025044803,0.00069103687,0.011160387],"study_design_scores_gemma":[0.000013990594,0.000017720346,0.00004030119,0.0000052127934,0.000005012655,0.000008412994,0.000004900162,0.9879084,0.00016421267,0.011700817,0.00012729505,0.000003736948],"about_ca_topic_score_codex":0.003822925,"about_ca_topic_score_gemma":0.0038586464,"teacher_disagreement_score":0.003822925,"about_ca_system_score_codex":0.0015379691,"about_ca_system_score_gemma":0.0016453415,"threshold_uncertainty_score":0.013533652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038023945,0.0017351776,0.9415618,0.0017268354,0.00009915572,0.000070813745,0.000087975626,0.00022091098,0.01647336],"genre_scores_gemma":[0.87390316,0.0015260418,0.11274391,0.00055548147,0.00025512054,0.0002648946,0.00015481225,0.00036356534,0.010233071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581903,0.0023752411,0.00019691938,0.00041202846,0.0008037924,0.00039294342],"domain_scores_gemma":[0.9597682,0.035490714,0.00081590854,0.0020087673,0.0014211003,0.00049537834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007894389,0.0012776112,0.0023150877,0.0010866853,0.0007262702,0.0021797607,0.002690543,0.0016859977,0.006612667],"category_scores_gemma":[0.038810004,0.0008834267,0.0009631118,0.0015138944,0.0037000757,0.006300599,0.003283378,0.0036849158,0.0006387731],"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.00019525428,0.000110378016,0.0009029418,0.00017814526,0.00007878063,0.000047691625,0.00019085477,0.32775056,0.0010859788,0.62421376,0.0021228222,0.04312288],"study_design_scores_gemma":[0.000041073537,0.000042660584,0.00026475263,0.000023911714,0.00002328696,0.000017090593,0.000020454314,0.5754522,0.00054049725,0.4228132,0.0007499947,0.00001086709],"about_ca_topic_score_codex":0.0037456502,"about_ca_topic_score_gemma":0.0022708175,"teacher_disagreement_score":0.007894389,"about_ca_system_score_codex":0.003089639,"about_ca_system_score_gemma":0.001498281,"threshold_uncertainty_score":0.041749954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3521502,0.00027309064,0.64415455,0.00042281195,0.000014878673,0.000043968757,0.00011043839,0.00025544947,0.0025746059],"genre_scores_gemma":[0.98094946,0.00008303,0.01730946,0.000052511736,0.000008459372,0.00004724445,0.000056831057,0.000033635857,0.0014593836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995018,0.00013990465,0.000019038564,0.00018612343,0.00007577428,0.00007728369],"domain_scores_gemma":[0.99810225,0.0011353524,0.000341593,0.0001227052,0.00020670527,0.000091436166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011586181,0.000414698,0.0007041962,0.0006017814,0.00021713102,0.0009285406,0.0010220474,0.00087130757,0.001171298],"category_scores_gemma":[0.0063391104,0.00043795415,0.0006951565,0.0003434324,0.0011408112,0.0016142459,0.0006732636,0.00075994787,0.00021722564],"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.00032180062,0.00010028127,0.0042636227,0.00011162619,0.000083370236,0.00016074663,0.0003643602,0.9341924,0.015531188,0.027476534,0.000547436,0.016846593],"study_design_scores_gemma":[0.000006914991,0.000025598441,0.0012012041,0.0000044959816,0.000005415927,0.00002716494,0.000008068116,0.99286723,0.00039987118,0.0053978777,0.000049055514,0.0000071358163],"about_ca_topic_score_codex":0.009968284,"about_ca_topic_score_gemma":0.006022662,"teacher_disagreement_score":0.009968284,"about_ca_system_score_codex":0.0018522745,"about_ca_system_score_gemma":0.0007472945,"threshold_uncertainty_score":0.019820511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9128288,0.0017734087,0.080344975,0.0008689053,0.00004157743,0.000058810034,0.00044001653,0.00030400473,0.0033394536],"genre_scores_gemma":[0.99457586,0.00022251757,0.004406659,0.000035906178,0.000019178946,0.000020495063,0.00028981987,0.00006612683,0.0003634251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992937,0.00027096394,0.00004165675,0.00017271035,0.00014998611,0.00007095275],"domain_scores_gemma":[0.9865067,0.00929375,0.0018065174,0.0012471242,0.0007333629,0.00041254182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003138174,0.00050048827,0.00043822746,0.0011836602,0.00037195766,0.0011576059,0.00061135076,0.0009310854,0.0011558947],"category_scores_gemma":[0.02928485,0.00029659606,0.00041860808,0.00086014427,0.0022001967,0.003832416,0.0012257829,0.0017285848,0.00019097606],"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.0011054417,0.0003792952,0.16002955,0.0006058439,0.0003509612,0.0006687836,0.0021994272,0.6032231,0.015396965,0.08535464,0.006591543,0.124094434],"study_design_scores_gemma":[0.00002273207,0.00029060803,0.06836916,0.000084727406,0.00003134209,0.00041887563,0.00039436016,0.89916104,0.0041459333,0.025114916,0.0018965844,0.0000697061],"about_ca_topic_score_codex":0.0019370817,"about_ca_topic_score_gemma":0.0012419601,"teacher_disagreement_score":0.003138174,"about_ca_system_score_codex":0.0010927998,"about_ca_system_score_gemma":0.00036153264,"threshold_uncertainty_score":0.016596437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011383034,0.00012310548,0.98564166,0.00019875029,0.00007562524,0.000046206704,0.000036928224,0.0004235338,0.002071146],"genre_scores_gemma":[0.80478567,0.0002060512,0.18742058,0.00022295176,0.0001463462,0.00019743768,0.00015803437,0.0001314935,0.0067315265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979292,0.0004963672,0.00020601139,0.00033870694,0.0008463884,0.0001832478],"domain_scores_gemma":[0.99405473,0.0024390076,0.0007879263,0.0015934714,0.0009492298,0.0001757606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024186093,0.0008857665,0.0010310698,0.0006266043,0.00080768677,0.001636458,0.0019017943,0.0014439533,0.0021049809],"category_scores_gemma":[0.009773903,0.00043368628,0.000492062,0.000567492,0.0015412061,0.0031919156,0.0027876613,0.0016540549,0.0007771331],"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.0012164667,0.00022544761,0.00089020334,0.0002518195,0.000105055915,0.0005509594,0.0004533445,0.5674752,0.043142255,0.21959002,0.0031302762,0.16296895],"study_design_scores_gemma":[0.000030947598,0.00006636932,0.00010004433,0.000011663314,0.000012936287,0.00006048191,0.00001944324,0.96150166,0.005404996,0.03179751,0.0009794859,0.000014377923],"about_ca_topic_score_codex":0.0014521554,"about_ca_topic_score_gemma":0.0018315598,"teacher_disagreement_score":0.0024186093,"about_ca_system_score_codex":0.00065842154,"about_ca_system_score_gemma":0.0014273816,"threshold_uncertainty_score":0.012790978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013534727,0.00015758624,0.9837526,0.00037373035,0.0000208109,0.000024290159,0.00017718945,0.0005848036,0.0013743213],"genre_scores_gemma":[0.6247296,0.00049573585,0.3677224,0.0006079225,0.0001294882,0.00028483124,0.001230819,0.0002512201,0.0045480365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994266,0.00017579834,0.0000291698,0.00013248774,0.00017670736,0.000059268797],"domain_scores_gemma":[0.9968694,0.0019869488,0.00031418612,0.0005083997,0.00023963096,0.000081518745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011149511,0.0010364787,0.0007855371,0.0013685848,0.00041593448,0.001288372,0.0020408158,0.0010178883,0.0025131316],"category_scores_gemma":[0.009181861,0.0006440842,0.0008292782,0.0012642996,0.0018492048,0.00306585,0.0027079491,0.0024612385,0.00057605776],"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.000050638508,0.00006325873,0.0023263744,0.0001917019,0.00009726057,0.00012812734,0.00017329249,0.7198915,0.0029705234,0.16325316,0.0022324878,0.10862169],"study_design_scores_gemma":[0.000004243837,0.000011502505,0.000077758654,0.000017720773,0.0000051232887,0.000010258862,0.000009674485,0.8760804,0.0007901772,0.122349866,0.0006377362,0.000005576748],"about_ca_topic_score_codex":0.0022440143,"about_ca_topic_score_gemma":0.0047462066,"teacher_disagreement_score":0.0025131316,"about_ca_system_score_codex":0.0012768279,"about_ca_system_score_gemma":0.0010189464,"threshold_uncertainty_score":0.009264052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006027851,0.000115769326,0.99131536,0.00022877887,0.00001692644,0.00004632582,0.00010588332,0.0005438627,0.0015991908],"genre_scores_gemma":[0.42061085,0.0003696484,0.57069415,0.00045019365,0.00012036775,0.0007269725,0.0012368058,0.00048595393,0.0053050104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880636,0.0004031397,0.000049469018,0.0003295556,0.0002799624,0.0001316011],"domain_scores_gemma":[0.99705243,0.0021907198,0.0002355504,0.0001500663,0.0002619223,0.00010926816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019615672,0.0014050398,0.001570884,0.0010786004,0.00045571604,0.0014931422,0.0016876622,0.0016674402,0.0056965137],"category_scores_gemma":[0.009073468,0.0009970678,0.0011292445,0.0009609368,0.0015753049,0.0021984086,0.0018569398,0.00343128,0.00088935945],"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.000041498985,0.000050186773,0.0002984552,0.00007002943,0.000018651297,0.00005019419,0.00003415157,0.93537617,0.000343761,0.027310027,0.0018984126,0.03450845],"study_design_scores_gemma":[0.000006551525,0.000008932696,0.000018449271,0.0000074186064,0.0000017529688,0.0000044329663,0.0000030822712,0.9834758,0.00016997343,0.016041294,0.00025950623,0.0000028111704],"about_ca_topic_score_codex":0.0037049148,"about_ca_topic_score_gemma":0.0048905434,"teacher_disagreement_score":0.0056965137,"about_ca_system_score_codex":0.0014226036,"about_ca_system_score_gemma":0.002161823,"threshold_uncertainty_score":0.019056737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004331227,0.00160028,0.9924718,0.00046709334,0.000051691153,0.000044446646,0.00011436806,0.00018816692,0.0007308981],"genre_scores_gemma":[0.49296528,0.0045196107,0.48353302,0.0012439389,0.0009664035,0.0008987321,0.0019432561,0.0005220859,0.013407588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763954,0.0011319984,0.00014402028,0.00060529046,0.00033271013,0.00014644292],"domain_scores_gemma":[0.9853888,0.012412699,0.0004381673,0.00072327023,0.00080001855,0.00023702715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059556887,0.0015887892,0.004133028,0.0018345916,0.00096847134,0.002197137,0.004339493,0.0038814757,0.0033159226],"category_scores_gemma":[0.024742996,0.0014534503,0.001447089,0.0022224826,0.0030187173,0.0055629145,0.0030709228,0.0039170594,0.0009312123],"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.00033402836,0.00029507672,0.00090973364,0.000993126,0.0004274723,0.00015799381,0.00022470571,0.6676273,0.0029400624,0.15980758,0.009637832,0.15664512],"study_design_scores_gemma":[0.000010512166,0.000022507693,0.000131268,0.000020073203,0.000015321477,0.0000213972,0.000008542135,0.90499866,0.00038394728,0.09396555,0.00040492162,0.00001726655],"about_ca_topic_score_codex":0.005512504,"about_ca_topic_score_gemma":0.004524612,"teacher_disagreement_score":0.0059556887,"about_ca_system_score_codex":0.002445382,"about_ca_system_score_gemma":0.0018939856,"threshold_uncertainty_score":0.031497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16573109,0.00040452604,0.81182617,0.0007131636,0.00024643925,0.00011369774,0.0005510433,0.0013236048,0.019090263],"genre_scores_gemma":[0.9506051,0.00012498898,0.041662958,0.000070559196,0.000024359784,0.00006674246,0.0003126923,0.00007390536,0.0070586056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992657,0.000017110833,0.0000031411596,0.000021250999,0.000011567197,0.00002036249],"domain_scores_gemma":[0.99978656,0.000093557384,0.000023929491,0.000028498418,0.000042500156,0.00002493849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021333194,0.00037676858,0.00054136134,0.00025923463,0.00030217637,0.00075107405,0.0007674174,0.00076686183,0.0049221464],"category_scores_gemma":[0.0014185436,0.00025281217,0.0002809257,0.00023795656,0.00041772155,0.001136668,0.00066442386,0.0008795731,0.00047925295],"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.0001244157,0.000049785147,0.00064904493,0.00003516791,0.00002545994,0.000063840715,0.00005396103,0.93397754,0.00083007145,0.02007379,0.0030999924,0.041017003],"study_design_scores_gemma":[0.00000626071,0.000008159613,0.00004260735,0.000002991671,0.0000026380212,0.0000041490384,0.000008885026,0.99278635,0.00016717764,0.0066406145,0.00032837814,0.0000017438583],"about_ca_topic_score_codex":0.0075364155,"about_ca_topic_score_gemma":0.0102971615,"teacher_disagreement_score":0.0075364155,"about_ca_system_score_codex":0.0006839917,"about_ca_system_score_gemma":0.0005756025,"threshold_uncertainty_score":0.01646626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013623387,0.00038088672,0.98035187,0.00018293646,0.00007364614,0.000048372578,0.00021183533,0.0032543726,0.0018727317],"genre_scores_gemma":[0.3981928,0.0006500216,0.5895461,0.0004434445,0.00008359351,0.00019984198,0.001616797,0.0007123459,0.008555091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997236,0.000044169952,0.000015869111,0.000079459984,0.00009594352,0.000040909086],"domain_scores_gemma":[0.99967504,0.00008822385,0.000035194713,0.000101975915,0.00007099865,0.000028593893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056775654,0.0010158786,0.0006496995,0.00087372266,0.00034373163,0.000853841,0.0017728033,0.00093340094,0.002499035],"category_scores_gemma":[0.0014870033,0.0003866759,0.0007505617,0.0011511736,0.00082553556,0.0018769206,0.0015899439,0.0010248756,0.000846258],"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.00018821932,0.00009464483,0.0009810689,0.00022041741,0.00017433816,0.00018838687,0.00010933707,0.4992763,0.018927071,0.0482557,0.010442827,0.42114165],"study_design_scores_gemma":[0.0000060407383,0.000016878066,0.00014345332,0.0000047314925,0.000008929506,0.00003082033,0.0000061599167,0.98411983,0.0035681801,0.010441061,0.0016467179,0.000007127661],"about_ca_topic_score_codex":0.012826,"about_ca_topic_score_gemma":0.017523564,"teacher_disagreement_score":0.012826,"about_ca_system_score_codex":0.001418023,"about_ca_system_score_gemma":0.0010737844,"threshold_uncertainty_score":0.025502682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153039405,0.00034520635,0.97197706,0.0012922062,0.00008908684,0.000071583694,0.00032719938,0.0003763613,0.010217282],"genre_scores_gemma":[0.8442179,0.0005997323,0.12952067,0.0005748778,0.00017794961,0.00032216765,0.00047421784,0.00024128138,0.023871299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842227,0.000640297,0.00006751217,0.00037927047,0.0002878365,0.00020286893],"domain_scores_gemma":[0.9941795,0.003802243,0.00070833106,0.00047773562,0.0005206157,0.00031150656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027461606,0.001259297,0.0015249932,0.0006877886,0.0005083992,0.0023828163,0.002744855,0.002209631,0.008960513],"category_scores_gemma":[0.013841501,0.0006468284,0.0009899465,0.0008424637,0.0026344638,0.00302332,0.0022539278,0.0034611728,0.0013989885],"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.00009755873,0.000046217807,0.00095432665,0.00010018555,0.00004701239,0.0001639564,0.00017176158,0.6772872,0.00075215945,0.2944474,0.0029441088,0.022988046],"study_design_scores_gemma":[0.00001471047,0.000020850168,0.00008989436,0.0000123527625,0.000005425834,0.000023122147,0.000010779389,0.8439957,0.00016055767,0.15466717,0.0009887003,0.000010815615],"about_ca_topic_score_codex":0.0050086114,"about_ca_topic_score_gemma":0.005762549,"teacher_disagreement_score":0.008960513,"about_ca_system_score_codex":0.0017938628,"about_ca_system_score_gemma":0.0015099857,"threshold_uncertainty_score":0.029975891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05888642,0.000530629,0.9228561,0.0006111502,0.000079704456,0.000030573643,0.0002043351,0.00047832157,0.016322786],"genre_scores_gemma":[0.8819358,0.0006140821,0.095768414,0.00025931714,0.00018451667,0.00007872906,0.00050539756,0.00022034191,0.020433385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996562,0.00010523188,0.00001594419,0.00010178842,0.00007615265,0.000044689692],"domain_scores_gemma":[0.99912137,0.00035998476,0.00012300562,0.00016758032,0.00012503602,0.00010297205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005002174,0.0004354732,0.0005374974,0.0008921309,0.00046402367,0.0011312104,0.0009933459,0.0008918126,0.0042686802],"category_scores_gemma":[0.0028914844,0.0003527865,0.00049011025,0.0004911792,0.0011734723,0.0025667655,0.0016415031,0.001565727,0.0005716891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030156438,0.000016831584,0.00028907738,0.00003419852,0.000019078378,0.000048014706,0.00007469672,0.05129699,0.0019558743,0.92363507,0.0011686522,0.021431403],"study_design_scores_gemma":[0.000003848,0.000010016023,0.0001695155,0.0000044390085,0.0000040168593,0.000016967457,0.000013570354,0.2395703,0.00035501472,0.7584458,0.0013999715,0.0000064503915],"about_ca_topic_score_codex":0.0017367385,"about_ca_topic_score_gemma":0.0021926558,"teacher_disagreement_score":0.0042686802,"about_ca_system_score_codex":0.00094190496,"about_ca_system_score_gemma":0.00039700393,"threshold_uncertainty_score":0.01428014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47964907,0.0023687973,0.48513344,0.008288038,0.00032304722,0.000038179274,0.00035966813,0.00063030695,0.023209436],"genre_scores_gemma":[0.97394377,0.0005031914,0.022448141,0.0003587337,0.000077763674,0.0000282051,0.000118227996,0.00007379768,0.002448105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991166,0.0003398598,0.00004131934,0.00019966603,0.00021533032,0.00008717116],"domain_scores_gemma":[0.9878864,0.009476087,0.001050589,0.0007022634,0.00064294046,0.00024158788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025504334,0.00048663124,0.0004322961,0.0009478741,0.00029857297,0.0013689545,0.0009388492,0.0006971904,0.0024495427],"category_scores_gemma":[0.03639969,0.00031284956,0.00038224962,0.00052289,0.002564485,0.0042374143,0.002095099,0.0021216404,0.00026474675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072717655,0.00010526324,0.02704055,0.00041305344,0.0001647074,0.00033001535,0.0012172202,0.17915705,0.015647553,0.5198332,0.0037593702,0.25160488],"study_design_scores_gemma":[0.00002688234,0.000088903085,0.010514316,0.00014069979,0.000030056644,0.00015923896,0.00012798749,0.49715984,0.0066614626,0.48162997,0.0034216216,0.00003906839],"about_ca_topic_score_codex":0.0015729587,"about_ca_topic_score_gemma":0.00091564213,"teacher_disagreement_score":0.0025504334,"about_ca_system_score_codex":0.0008913293,"about_ca_system_score_gemma":0.0003827306,"threshold_uncertainty_score":0.0134881735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042501982,0.00060030504,0.9496232,0.0005752531,0.000084103856,0.000047431615,0.0002484509,0.0006840537,0.005635161],"genre_scores_gemma":[0.81350476,0.0008062745,0.1771314,0.00022384383,0.00019475062,0.00017209447,0.0006506376,0.00027425162,0.007041981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917173,0.0003070131,0.00004488346,0.00020973803,0.00020077922,0.00006582804],"domain_scores_gemma":[0.997171,0.0015276528,0.0003082001,0.00051151664,0.00029739572,0.00018416144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016667886,0.00065486884,0.0010824734,0.0014316938,0.0007600489,0.0014735823,0.0011063647,0.0010318973,0.0018918089],"category_scores_gemma":[0.006721843,0.0003862276,0.001189914,0.0012236667,0.0015371135,0.003474958,0.002051507,0.0018039786,0.0003319419],"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.00008487032,0.000035395035,0.0011672725,0.00012575442,0.000057942358,0.00007062403,0.00013533891,0.60732347,0.0011935266,0.34379312,0.002595478,0.043417208],"study_design_scores_gemma":[0.000003951367,0.00001355082,0.0001585953,0.000007420813,0.0000064879114,0.00001439531,0.000009067051,0.8201808,0.00021478705,0.17865786,0.00072771293,0.0000053597937],"about_ca_topic_score_codex":0.004403214,"about_ca_topic_score_gemma":0.004598534,"teacher_disagreement_score":0.004403214,"about_ca_system_score_codex":0.0016551953,"about_ca_system_score_gemma":0.00071870716,"threshold_uncertainty_score":0.012009323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020950504,0.0003995904,0.9743188,0.00024388148,0.000033843015,0.000106014646,0.0002194635,0.0019686029,0.0017592807],"genre_scores_gemma":[0.55747044,0.00036139222,0.43215895,0.00042424447,0.00011764025,0.00048035252,0.0019282884,0.00070197886,0.006356771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993819,0.00023475161,0.000034400564,0.00019476945,0.00011350612,0.000040629482],"domain_scores_gemma":[0.9982101,0.0010820208,0.00013868476,0.00031087457,0.0002017809,0.000056552144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084638706,0.0005131038,0.0007582895,0.001069299,0.00038756756,0.0006920046,0.0016162683,0.00091032794,0.0026379945],"category_scores_gemma":[0.004300535,0.00034437896,0.0007870057,0.0010599046,0.0007401941,0.0018013383,0.00095098955,0.0009499861,0.0009771563],"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.00021905774,0.0002705323,0.0024935335,0.0003641485,0.00012953348,0.00022374507,0.00039408286,0.5307276,0.01315667,0.06605622,0.012716651,0.3732482],"study_design_scores_gemma":[0.000020050413,0.000025312449,0.0001323994,0.000007853248,0.000009542006,0.00003478275,0.000013967735,0.9728282,0.0021057068,0.023217907,0.0015974734,0.0000069247585],"about_ca_topic_score_codex":0.0015981254,"about_ca_topic_score_gemma":0.004321685,"teacher_disagreement_score":0.0026379945,"about_ca_system_score_codex":0.00070049375,"about_ca_system_score_gemma":0.00089776434,"threshold_uncertainty_score":0.0088249445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6708954,0.0035006623,0.3083331,0.0051554693,0.0002056088,0.00004730536,0.00012120016,0.0005443287,0.0111969225],"genre_scores_gemma":[0.9908296,0.00022232726,0.007186425,0.00011735863,0.000072801144,0.00002480532,0.000024882369,0.000054054177,0.0014677176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990338,0.00049832586,0.000061850355,0.00017466361,0.00012690735,0.00010445568],"domain_scores_gemma":[0.96732616,0.028061489,0.0015684331,0.0016716843,0.0008423126,0.0005300072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037373512,0.00035949872,0.0008378269,0.00059948355,0.0006885982,0.0015542435,0.0015375724,0.0018738785,0.0032082559],"category_scores_gemma":[0.04480108,0.0005136036,0.0003590957,0.00045284673,0.0012769683,0.005285366,0.0015968486,0.0018180315,0.0003174858],"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.0010221672,0.00035781032,0.014358293,0.00053865014,0.00020606394,0.00039032064,0.0016431827,0.34737116,0.012614114,0.40375796,0.0048908177,0.21284951],"study_design_scores_gemma":[0.000036297366,0.0001168814,0.0018774029,0.000027040389,0.000035653306,0.00007603449,0.00008951263,0.8066214,0.0014652098,0.18921882,0.00041225553,0.000023580818],"about_ca_topic_score_codex":0.001345581,"about_ca_topic_score_gemma":0.0023489213,"teacher_disagreement_score":0.0037373512,"about_ca_system_score_codex":0.00086288847,"about_ca_system_score_gemma":0.0005806114,"threshold_uncertainty_score":0.019765198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0461694,0.000919781,0.934565,0.00034656253,0.00015605631,0.00035478067,0.00022913211,0.007953246,0.009306014],"genre_scores_gemma":[0.39443928,0.00028954653,0.59483415,0.0004520012,0.000101814825,0.0010903154,0.00091447134,0.0020719636,0.0058065536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804723,0.00080688414,0.00009666819,0.00030717422,0.0004442214,0.0002977999],"domain_scores_gemma":[0.99498945,0.0027011863,0.00029457035,0.0014241246,0.00035347667,0.00023729309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033325264,0.0020208661,0.0020263174,0.001254616,0.0011190664,0.0020328145,0.004089404,0.0021686081,0.009325251],"category_scores_gemma":[0.013466281,0.0011167071,0.0012385483,0.0012284068,0.0015680165,0.002944719,0.0028190517,0.0023746893,0.0023944948],"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.0009176269,0.0003765757,0.0019151815,0.00033340396,0.00019052341,0.00029915653,0.0002641984,0.62090725,0.0061734766,0.033682927,0.013080307,0.32185933],"study_design_scores_gemma":[0.00009385929,0.00016011625,0.00013784086,0.000040430332,0.000034932153,0.00008630387,0.000032003318,0.9702269,0.003183163,0.02257478,0.0034022615,0.000027334469],"about_ca_topic_score_codex":0.0018923663,"about_ca_topic_score_gemma":0.0033582551,"teacher_disagreement_score":0.009325251,"about_ca_system_score_codex":0.0010691518,"about_ca_system_score_gemma":0.00270891,"threshold_uncertainty_score":0.031195998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038819067,0.0007361886,0.9526677,0.0008728802,0.00007138771,0.00010783489,0.0005721598,0.0017390439,0.004413774],"genre_scores_gemma":[0.71018136,0.00074667035,0.2779891,0.0004964327,0.0001396185,0.00028379358,0.0017986838,0.00042404895,0.0079404805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995555,0.00017586914,0.000020302938,0.00016371481,0.000049583323,0.00003509552],"domain_scores_gemma":[0.9985233,0.0009367147,0.000089946516,0.00026064023,0.0001247239,0.000064631764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007945563,0.00066821784,0.00074865774,0.0011004962,0.0006285821,0.0009948636,0.0013898119,0.0014295719,0.008518678],"category_scores_gemma":[0.005959865,0.0004129341,0.001106127,0.001088499,0.00095329696,0.003476007,0.0017961236,0.0017872908,0.0011880765],"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.00042124907,0.0002690482,0.0017470531,0.00049868756,0.00016876892,0.00024829697,0.00083040324,0.23931396,0.018323427,0.30599338,0.014726819,0.41745886],"study_design_scores_gemma":[0.0000117238005,0.000021737884,0.00023780693,0.000019635283,0.000021782833,0.000022921344,0.000045971377,0.71636283,0.0012762176,0.28031546,0.0016543384,0.000009546802],"about_ca_topic_score_codex":0.0062097227,"about_ca_topic_score_gemma":0.008733471,"teacher_disagreement_score":0.008518678,"about_ca_system_score_codex":0.0010782861,"about_ca_system_score_gemma":0.0005430257,"threshold_uncertainty_score":0.028497756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007778968,0.00028663507,0.98908174,0.00025986138,0.000059164653,0.000020145952,0.00012193614,0.00055593596,0.0018355836],"genre_scores_gemma":[0.35193607,0.0009360944,0.6284795,0.00039598704,0.0001837193,0.0001336511,0.00072388805,0.0004742233,0.01673691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.00019907934,0.0000419724,0.00022242563,0.00016570922,0.00006238382],"domain_scores_gemma":[0.99820733,0.00068945496,0.00016667633,0.0005401009,0.00034940476,0.000047055655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001777712,0.0013040227,0.0006621327,0.00065035705,0.00038592707,0.0012591771,0.001025669,0.0010390205,0.0034391545],"category_scores_gemma":[0.008406925,0.00083121326,0.00070828904,0.0007587766,0.0013193953,0.0031056495,0.00136194,0.002782347,0.0022065497],"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.00017448458,0.000074421405,0.0022561105,0.00022346286,0.00019578933,0.00012859686,0.00021472535,0.43964118,0.013541619,0.23718552,0.009592048,0.29677206],"study_design_scores_gemma":[0.000008494797,0.000030036068,0.00060575583,0.000027714577,0.00001736323,0.000045254048,0.000021033165,0.899099,0.004549004,0.09036694,0.005214238,0.000015221597],"about_ca_topic_score_codex":0.0023421193,"about_ca_topic_score_gemma":0.003614773,"teacher_disagreement_score":0.0034391545,"about_ca_system_score_codex":0.0006457314,"about_ca_system_score_gemma":0.0011311468,"threshold_uncertainty_score":0.011505127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013516721,0.0002884689,0.99763536,0.00010694207,0.0000330528,0.000011280084,0.000075459444,0.00031496113,0.00018272239],"genre_scores_gemma":[0.29485416,0.0013686626,0.6922004,0.00047948706,0.00041953754,0.00036675474,0.0017302698,0.0006577997,0.00792289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973954,0.0012171427,0.00014598353,0.0006673467,0.0003785969,0.00019547314],"domain_scores_gemma":[0.99199706,0.005177853,0.0006219102,0.0012800846,0.0007244296,0.00019869088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049412595,0.0020889402,0.0025158813,0.0014551503,0.0009231942,0.0022324168,0.0034812961,0.0027478626,0.0031679058],"category_scores_gemma":[0.019759933,0.0017557048,0.0022771866,0.0023376711,0.0013109584,0.0033933036,0.003550172,0.0048895245,0.0022843187],"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.0005302827,0.0002557101,0.00089431886,0.00033230826,0.0005203877,0.00017175154,0.00014880323,0.64146626,0.0055957786,0.057957113,0.0064752125,0.2856521],"study_design_scores_gemma":[0.000010138634,0.000028359838,0.0001417201,0.000011257142,0.000027083788,0.000026752636,0.000007817639,0.9725988,0.0008951624,0.02539088,0.00084437197,0.000017681923],"about_ca_topic_score_codex":0.0058996314,"about_ca_topic_score_gemma":0.00864321,"teacher_disagreement_score":0.0058996314,"about_ca_system_score_codex":0.0008899858,"about_ca_system_score_gemma":0.0017347389,"threshold_uncertainty_score":0.026132166},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018731169,0.00024013974,0.99571866,0.00021537731,0.00003649751,0.000033896293,0.000019976378,0.0000860828,0.0017763159],"genre_scores_gemma":[0.41957343,0.0010707321,0.5589846,0.00048703418,0.00018170748,0.0007639742,0.0002646429,0.00048319684,0.018190762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993724,0.00032411233,0.000021937096,0.000086876826,0.00013981877,0.000054873894],"domain_scores_gemma":[0.9984523,0.0011626858,0.00006995718,0.00006584479,0.00018409673,0.00006503834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022916833,0.0011166933,0.0013461533,0.00070612086,0.00041455834,0.0010316776,0.001399044,0.0014935981,0.0040505277],"category_scores_gemma":[0.00581927,0.0006667115,0.00080648775,0.00057924003,0.0016926489,0.001345704,0.0016839918,0.0024352078,0.0006902316],"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.00004076752,0.000032062548,0.00029447046,0.00009556292,0.00003928955,0.00006238296,0.00006446524,0.77164894,0.00083357457,0.2065126,0.0013370975,0.019038826],"study_design_scores_gemma":[0.000005196491,0.0000056684344,0.000014896982,0.0000046704436,0.0000018320202,0.0000036573808,0.0000025816214,0.9804669,0.00008627094,0.018882219,0.0005237366,0.0000023845878],"about_ca_topic_score_codex":0.007117778,"about_ca_topic_score_gemma":0.0046133962,"teacher_disagreement_score":0.007117778,"about_ca_system_score_codex":0.0020983755,"about_ca_system_score_gemma":0.0023484677,"threshold_uncertainty_score":0.015224874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013758288,0.00028294534,0.98118114,0.00051526946,0.00009205667,0.000034037785,0.00023868325,0.00045870317,0.0034388849],"genre_scores_gemma":[0.5924854,0.0005222766,0.37371898,0.00042126258,0.00031358705,0.00016123355,0.0014689732,0.0006407433,0.030267503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962354,0.00012253998,0.000018343493,0.00013069765,0.00006210296,0.00004272122],"domain_scores_gemma":[0.99897194,0.0005358773,0.000045567944,0.00023297334,0.00014625402,0.00006733388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010932753,0.0006503022,0.001026973,0.0005909489,0.00044492737,0.0014493936,0.0015072017,0.0016796691,0.008158008],"category_scores_gemma":[0.0036860346,0.00069355586,0.0010922982,0.00074395665,0.0010852593,0.0023780693,0.0019190356,0.0017848333,0.0013563456],"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.00026802777,0.00012800767,0.00059407257,0.00024566168,0.00019264671,0.00011883638,0.00016612744,0.40011376,0.0103795165,0.3309775,0.012667859,0.244148],"study_design_scores_gemma":[0.000008555989,0.000015161363,0.00013098467,0.0000066826933,0.0000076107394,0.000026677724,0.000012037421,0.9141433,0.001161067,0.083094336,0.001385512,0.000008010977],"about_ca_topic_score_codex":0.004628716,"about_ca_topic_score_gemma":0.00411806,"teacher_disagreement_score":0.008158008,"about_ca_system_score_codex":0.00072035805,"about_ca_system_score_gemma":0.0010664739,"threshold_uncertainty_score":0.027291238},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016716508,0.00011122858,0.99704295,0.00017361708,0.000027546816,0.000021434504,0.0000428378,0.0003142543,0.0005944925],"genre_scores_gemma":[0.24596547,0.0007942143,0.743158,0.0007646433,0.00033566286,0.00056969724,0.0007738659,0.0006374295,0.0070010307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979965,0.001042839,0.00010825774,0.00033633586,0.00039451948,0.000121571145],"domain_scores_gemma":[0.9970293,0.0018700967,0.00023043419,0.00045643598,0.0003157605,0.00009785153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033731242,0.0015653,0.0017277359,0.0009471912,0.00047481197,0.001677649,0.002151024,0.0015421346,0.005383845],"category_scores_gemma":[0.016781216,0.001088697,0.0012845559,0.0012507483,0.0014355116,0.0031900865,0.0023378935,0.004113864,0.0021651953],"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.00019032255,0.0001001853,0.000616848,0.00022676431,0.00015786437,0.00009184835,0.000104906016,0.65600896,0.0034966073,0.19103241,0.008451246,0.13952194],"study_design_scores_gemma":[0.000012510063,0.0000145784825,0.00005276767,0.000010488707,0.0000065375016,0.000011825284,0.0000037807195,0.96054626,0.00045931124,0.03811477,0.0007593507,0.0000078278945],"about_ca_topic_score_codex":0.0017100956,"about_ca_topic_score_gemma":0.0019773948,"teacher_disagreement_score":0.005383845,"about_ca_system_score_codex":0.0009272807,"about_ca_system_score_gemma":0.0014729376,"threshold_uncertainty_score":0.018010795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030224877,0.00007862404,0.9947253,0.00009083302,0.000023529248,0.000024439541,0.0001139886,0.0010802135,0.00084062986],"genre_scores_gemma":[0.16427612,0.00048447738,0.8305314,0.00016434031,0.000040005478,0.00017382794,0.0011580182,0.0009906463,0.002181213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993406,0.00012318278,0.00003440492,0.00011685301,0.00034635345,0.00003856881],"domain_scores_gemma":[0.99861026,0.0005416649,0.000112382164,0.00046763782,0.00021213079,0.000055938897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092100917,0.00095490954,0.0009249428,0.0011206272,0.00046982509,0.0015443844,0.0021016742,0.0015848826,0.0036401297],"category_scores_gemma":[0.0055743665,0.00082944176,0.001386091,0.0012661096,0.0010055657,0.00182485,0.001812676,0.002211377,0.001709718],"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.000050961142,0.0000294347,0.0005770506,0.000116105155,0.000054645694,0.00007421777,0.0000991479,0.8214581,0.007831212,0.024245044,0.004404767,0.14105926],"study_design_scores_gemma":[0.00000265169,0.00000627054,0.00004519036,0.00001009177,0.0000024824542,0.000027708744,0.000013127988,0.98568636,0.0020419646,0.010554115,0.001603696,0.0000064129513],"about_ca_topic_score_codex":0.0032669895,"about_ca_topic_score_gemma":0.005091087,"teacher_disagreement_score":0.0036401297,"about_ca_system_score_codex":0.0010357408,"about_ca_system_score_gemma":0.00093303993,"threshold_uncertainty_score":0.012177408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026216824,0.0015938714,0.95770663,0.00070926535,0.00045869843,0.00011287219,0.0007485522,0.0038345412,0.008618701],"genre_scores_gemma":[0.78948796,0.00061862066,0.19718257,0.0003855839,0.00014503326,0.00043442668,0.0024127944,0.0002509358,0.009082149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.00020270505,0.000044883363,0.00019381064,0.00008735105,0.000086194595],"domain_scores_gemma":[0.9946766,0.0042722723,0.0001500575,0.00040346105,0.00041955308,0.000078002195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054484,0.0008388254,0.0010020225,0.0004821796,0.00049489253,0.0009351251,0.0012564133,0.0013498367,0.009817593],"category_scores_gemma":[0.008916093,0.0007006337,0.00063793774,0.00065012684,0.0006603877,0.001736068,0.0010010336,0.0024004583,0.0024677152],"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.00037583036,0.00027618857,0.0024187674,0.00041795403,0.00018190527,0.00011703563,0.00012646535,0.64656657,0.002863011,0.022328498,0.0105023235,0.31382552],"study_design_scores_gemma":[0.00001497138,0.000027315176,0.00014730425,0.000019905861,0.000011404102,0.000010495677,0.000009735339,0.9860573,0.0010693346,0.011856922,0.000770385,0.0000050012486],"about_ca_topic_score_codex":0.0052832155,"about_ca_topic_score_gemma":0.010659015,"teacher_disagreement_score":0.009817593,"about_ca_system_score_codex":0.0007525654,"about_ca_system_score_gemma":0.0012658915,"threshold_uncertainty_score":0.032843173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053498456,0.0002814282,0.9903888,0.00016880369,0.00009226816,0.00004447094,0.00014206808,0.0023142542,0.0012180338],"genre_scores_gemma":[0.22500016,0.00023971093,0.769293,0.0002988734,0.000105038416,0.00026185595,0.0009234283,0.00060887943,0.0032690316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923265,0.00019526611,0.00007144734,0.00016115684,0.00028292436,0.000056612505],"domain_scores_gemma":[0.9987613,0.00043685292,0.000056538218,0.00039063976,0.0002948459,0.000059913866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346102,0.0009303582,0.00092523417,0.00058940117,0.0004902432,0.0009720521,0.0017862117,0.0009588936,0.0050626975],"category_scores_gemma":[0.00489711,0.00036428068,0.00038882246,0.00097232714,0.001001239,0.0016069937,0.0013954266,0.0019285254,0.0022356054],"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.0003821983,0.0001372551,0.001149965,0.00015997376,0.000058069094,0.00009327647,0.00015476574,0.4617273,0.010773243,0.043244023,0.019392863,0.4627272],"study_design_scores_gemma":[0.00003199912,0.0000250024,0.00006795961,0.0000056265244,0.0000026772277,0.00001901295,0.000009063372,0.9782034,0.0029420888,0.016793078,0.0018938133,0.0000062881295],"about_ca_topic_score_codex":0.003263971,"about_ca_topic_score_gemma":0.0053615132,"teacher_disagreement_score":0.0050626975,"about_ca_system_score_codex":0.0009688543,"about_ca_system_score_gemma":0.001400675,"threshold_uncertainty_score":0.016936421},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25822547,0.010340473,0.57605386,0.0025785086,0.0020674479,0.0015256127,0.027346939,0.036556523,0.08530521],"genre_scores_gemma":[0.7069229,0.0010972391,0.252745,0.00053404324,0.00017330206,0.0013420206,0.024854166,0.002749137,0.0095822355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967495,0.0013005846,0.00027536828,0.00052708277,0.00080430065,0.0003431504],"domain_scores_gemma":[0.98730487,0.0078604035,0.0005483033,0.0021046365,0.0015595439,0.0006221647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004315979,0.002597443,0.0012483287,0.0016273971,0.0008238927,0.0015683688,0.0036128773,0.0020245153,0.0066732448],"category_scores_gemma":[0.026208658,0.0005629679,0.0009539207,0.0012546058,0.0010975945,0.0016971058,0.0019830812,0.003357156,0.0022817662],"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.0017206131,0.001788027,0.0035894734,0.0014438935,0.0003040172,0.00028806107,0.00016592482,0.70386577,0.002863432,0.014413037,0.078878716,0.19067909],"study_design_scores_gemma":[0.0002369867,0.0004212072,0.0012140871,0.000089197594,0.000034857465,0.0000906433,0.00005234592,0.9704902,0.0037772348,0.016953329,0.006608001,0.00003190621],"about_ca_topic_score_codex":0.010854483,"about_ca_topic_score_gemma":0.01664212,"teacher_disagreement_score":0.010854483,"about_ca_system_score_codex":0.0018338846,"about_ca_system_score_gemma":0.0024028919,"threshold_uncertainty_score":0.0228253},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65195453,0.0025583205,0.3265243,0.0013735833,0.0003012958,0.0001858264,0.0024103564,0.005811172,0.00888053],"genre_scores_gemma":[0.9543119,0.0003030151,0.039839663,0.0001637343,0.0001309667,0.00007869757,0.0018818036,0.00013025274,0.0031598336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986451,0.0005606495,0.00006126243,0.0003178903,0.00025682704,0.00015821734],"domain_scores_gemma":[0.9965693,0.0020607263,0.00040268968,0.0002753629,0.00059444783,0.00009746744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016198417,0.0011221734,0.00062128564,0.0012028185,0.00033361002,0.00097229285,0.0010544865,0.0010345401,0.0016691405],"category_scores_gemma":[0.0073263594,0.0003397318,0.0005675488,0.00067362504,0.0003771204,0.0016352572,0.0012047654,0.0012821546,0.0012045508],"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.002628673,0.00070808467,0.051186103,0.0005849361,0.00059283385,0.0014971095,0.0032263047,0.07189059,0.11635477,0.0070029926,0.019738961,0.7245887],"study_design_scores_gemma":[0.000031699175,0.00018548733,0.017144775,0.0000598505,0.00013088294,0.00031902874,0.00081210973,0.941719,0.028674694,0.0059398366,0.0049146865,0.00006791218],"about_ca_topic_score_codex":0.0041628233,"about_ca_topic_score_gemma":0.0058526206,"teacher_disagreement_score":0.0041628233,"about_ca_system_score_codex":0.00064777356,"about_ca_system_score_gemma":0.00039952376,"threshold_uncertainty_score":0.008566678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012702084,0.00015448185,0.983266,0.00040438538,0.00004695354,0.000035016717,0.00014897903,0.00066056073,0.0025815745],"genre_scores_gemma":[0.68298054,0.00038175503,0.30740863,0.0002911112,0.00010332789,0.0003181518,0.00049963844,0.0003033586,0.0077135325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948657,0.00014567398,0.00002371974,0.00016205234,0.00009086708,0.0000910508],"domain_scores_gemma":[0.9992404,0.0003300628,0.00008532734,0.00016994601,0.00010500889,0.00006928456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079356006,0.00115237,0.0010860204,0.00048408247,0.00033575416,0.0012098748,0.0014930478,0.001535766,0.00418278],"category_scores_gemma":[0.003573019,0.00045297667,0.0006503341,0.0004938149,0.0009367267,0.0022368832,0.0015212672,0.0022070012,0.0009996616],"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.00011614713,0.00011567554,0.0006039432,0.000088528424,0.00004630242,0.000065873995,0.00006557727,0.85052574,0.0020530093,0.05762158,0.0029846893,0.08571283],"study_design_scores_gemma":[0.000013004373,0.000036445796,0.000049434995,0.000009157401,0.000007690132,0.000015576581,0.0000049503096,0.97423404,0.00070407626,0.024303775,0.00061440555,0.0000074330455],"about_ca_topic_score_codex":0.0021553023,"about_ca_topic_score_gemma":0.002631182,"teacher_disagreement_score":0.00418278,"about_ca_system_score_codex":0.0010288483,"about_ca_system_score_gemma":0.0017487652,"threshold_uncertainty_score":0.013992786},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26622897,0.008869497,0.42675948,0.004084356,0.0021646512,0.0031809087,0.14055827,0.07389199,0.074261904],"genre_scores_gemma":[0.34029874,0.003637232,0.44983995,0.0010884184,0.00027212585,0.004503365,0.18048714,0.007448524,0.0124245705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981006,0.00059662166,0.00025289017,0.00020498133,0.00066138606,0.00018362813],"domain_scores_gemma":[0.99429893,0.003063177,0.00028352905,0.0009461204,0.0011566579,0.00025159153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037516747,0.0029491757,0.0011622405,0.0020650437,0.00073211605,0.0016081432,0.005357827,0.0021633026,0.0063837217],"category_scores_gemma":[0.011472912,0.0007329607,0.0018198488,0.0030845145,0.0008985419,0.0015757957,0.0018300861,0.0025073015,0.002238295],"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.00034739563,0.0007752243,0.0059968457,0.002414576,0.0004216478,0.00036514454,0.00010603515,0.8122094,0.0029908249,0.021722797,0.09971171,0.052938256],"study_design_scores_gemma":[0.00020471221,0.0001673383,0.0012982112,0.000114865004,0.000040466144,0.000118597374,0.0000509107,0.9550157,0.0036414354,0.012463499,0.026843593,0.000040706116],"about_ca_topic_score_codex":0.012728088,"about_ca_topic_score_gemma":0.015240983,"teacher_disagreement_score":0.012728088,"about_ca_system_score_codex":0.0014418131,"about_ca_system_score_gemma":0.0029638698,"threshold_uncertainty_score":0.025308013},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068768593,0.00047848668,0.95754135,0.0005356405,0.00012787827,0.00011316234,0.0015471524,0.028855657,0.0039237235],"genre_scores_gemma":[0.19588299,0.00066622486,0.78922695,0.0006355368,0.00014536231,0.0002376572,0.0043212627,0.003182869,0.005701165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851686,0.00025529307,0.00013262378,0.00032386204,0.00066794705,0.00010349061],"domain_scores_gemma":[0.99525815,0.0021822557,0.00015836582,0.0018066862,0.00048391524,0.00011061622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018233854,0.0009863193,0.0010539417,0.0010998275,0.00058820634,0.002965106,0.004321215,0.0009789407,0.016831636],"category_scores_gemma":[0.012820658,0.0010957692,0.001581509,0.0015300928,0.0014044718,0.0059788222,0.0050298455,0.0032285322,0.003979304],"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.0006470546,0.00026088313,0.0016370559,0.00080509624,0.00025257297,0.00027907756,0.00024447826,0.11358797,0.0051657604,0.1392672,0.060622282,0.67723054],"study_design_scores_gemma":[0.000085708256,0.0000346555,0.00023711368,0.00005039542,0.00006174235,0.00006539477,0.00004052755,0.7682598,0.0056352937,0.21295343,0.012552701,0.000023277586],"about_ca_topic_score_codex":0.005939442,"about_ca_topic_score_gemma":0.010886461,"teacher_disagreement_score":0.016831636,"about_ca_system_score_codex":0.001184913,"about_ca_system_score_gemma":0.0018383879,"threshold_uncertainty_score":0.056307435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064884275,0.00005973675,0.9922265,0.00009289298,0.000028176448,0.000017861103,0.000026104097,0.00037509634,0.000685177],"genre_scores_gemma":[0.6005198,0.00022269007,0.38696826,0.00019759507,0.00014376156,0.0001584756,0.0003976412,0.00052544306,0.010866319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966776,0.00009215027,0.000015141278,0.000077642566,0.00010517831,0.00004212438],"domain_scores_gemma":[0.9992242,0.00034463708,0.00006276907,0.0001569883,0.00016868781,0.00004271499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009506992,0.0006167132,0.0007703963,0.00055469427,0.00040300196,0.0007589184,0.0013632976,0.001183358,0.0046173194],"category_scores_gemma":[0.003246141,0.00042820172,0.0007585948,0.0005368328,0.00068142207,0.0016198123,0.0014161963,0.00190876,0.0010039624],"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.00014094856,0.000093987306,0.00063048425,0.00007481939,0.00006196484,0.00016428642,0.00014001424,0.678479,0.011446139,0.088463485,0.005935605,0.2143693],"study_design_scores_gemma":[0.0000015971779,0.000006527753,0.000029052171,0.0000014957665,0.0000018894128,0.0000054447396,0.0000022876663,0.99256116,0.0004911521,0.006713442,0.00018338893,0.0000025217926],"about_ca_topic_score_codex":0.00289449,"about_ca_topic_score_gemma":0.0040500406,"teacher_disagreement_score":0.0046173194,"about_ca_system_score_codex":0.000559596,"about_ca_system_score_gemma":0.0006799949,"threshold_uncertainty_score":0.015446544},"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":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050945943,0.0005812322,0.0065486766,0.00045191983,0.0005886762,0.00021647885,0.9486448,0.029436672,0.008436886],"genre_scores_gemma":[0.010974229,0.00024976098,0.015608909,0.00021080839,0.00008071395,0.00044469032,0.96513754,0.0017785679,0.005514719],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989311,0.00015730834,0.0000971751,0.00031036898,0.00036629703,0.00013776876],"domain_scores_gemma":[0.9983724,0.000527089,0.00008268402,0.0006834702,0.00018692897,0.00014737013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011958765,0.001927139,0.00095640233,0.0039058267,0.0009241901,0.00245889,0.0026940806,0.001906915,0.12731831],"category_scores_gemma":[0.007434461,0.000635683,0.0024381566,0.00328091,0.00055146957,0.0017024331,0.002009835,0.0019900268,0.06628699],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034351207,0.00020885114,0.0015304765,0.0007883997,0.0001708778,0.000110278925,0.000059200058,0.0046390435,0.0012297601,0.0035621363,0.94836575,0.038991537],"study_design_scores_gemma":[0.0006350422,0.00012885484,0.0044420767,0.00022094061,0.00008167626,0.00024579494,0.00014574984,0.031029169,0.004860578,0.013922065,0.9442034,0.0000846049],"about_ca_topic_score_codex":0.0061351634,"about_ca_topic_score_gemma":0.021648489,"teacher_disagreement_score":0.12731831,"about_ca_system_score_codex":0.0006779837,"about_ca_system_score_gemma":0.0012323621,"threshold_uncertainty_score":0.42592216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011171276,0.000273686,0.9839279,0.00032327778,0.00003569611,0.00011646894,0.000036180973,0.00096353586,0.0031520596],"genre_scores_gemma":[0.30726203,0.00023007917,0.6836221,0.00032348098,0.00008391222,0.00042131814,0.00016732128,0.0002916865,0.0075980495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736834,0.0012459002,0.000089145615,0.00062619126,0.00051470986,0.00015564777],"domain_scores_gemma":[0.991015,0.0062788785,0.00041172586,0.0014587584,0.000603873,0.00023171843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029326824,0.0009098294,0.0012368956,0.000750142,0.0010861224,0.0014911303,0.0027406043,0.0021799991,0.0065696123],"category_scores_gemma":[0.013659328,0.000563721,0.0008246951,0.0007700623,0.0020896948,0.0035819835,0.002630384,0.0022306554,0.001960365],"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.0005898621,0.00034183264,0.0022181396,0.0005089388,0.000080912476,0.00020824392,0.0011012033,0.1783377,0.019525472,0.11997716,0.006161205,0.67094934],"study_design_scores_gemma":[0.0001178763,0.0001712217,0.00025213943,0.000046726447,0.000038467224,0.00020995754,0.0001464675,0.82690656,0.018062985,0.1418968,0.012115898,0.000035019897],"about_ca_topic_score_codex":0.0013037923,"about_ca_topic_score_gemma":0.0022342328,"teacher_disagreement_score":0.0065696123,"about_ca_system_score_codex":0.0013517856,"about_ca_system_score_gemma":0.0015284867,"threshold_uncertainty_score":0.021977603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009048671,0.00015585581,0.988221,0.00014584162,0.000026871834,0.000019386205,0.000032292857,0.0001688881,0.0021812622],"genre_scores_gemma":[0.6124535,0.00042271943,0.3819631,0.00016207699,0.00005837754,0.00018127593,0.00014391208,0.00011940976,0.00449563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990107,0.00040761588,0.000055561115,0.00019756691,0.00023064543,0.0000978502],"domain_scores_gemma":[0.9972995,0.0017048833,0.00025213475,0.0003194037,0.00024055401,0.00018356422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002110958,0.0007984567,0.0008541836,0.0005686482,0.0004563681,0.0012015468,0.0020295484,0.0009456483,0.004209871],"category_scores_gemma":[0.008165511,0.0004325076,0.00080472825,0.0008361548,0.001548346,0.0034871586,0.0019436002,0.002296028,0.00045158953],"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.00009632625,0.000058193167,0.0005522778,0.000086194996,0.000049015245,0.00008130753,0.000116866875,0.6938518,0.00095405424,0.24051295,0.0009390777,0.062701955],"study_design_scores_gemma":[0.000011165217,0.000030967,0.00005793298,0.000009061611,0.0000060324383,0.000016431162,0.0000068831923,0.88644445,0.00048495794,0.11209917,0.00082487596,0.000008191575],"about_ca_topic_score_codex":0.002590043,"about_ca_topic_score_gemma":0.0024163877,"teacher_disagreement_score":0.004209871,"about_ca_system_score_codex":0.0011623738,"about_ca_system_score_gemma":0.0013301654,"threshold_uncertainty_score":0.014083445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.334663,0.00072297297,0.64598787,0.0027010797,0.00015296049,0.00020707854,0.00049016677,0.00044513852,0.014629784],"genre_scores_gemma":[0.98092777,0.00019161537,0.011028561,0.00017770335,0.00004558053,0.00012641956,0.00011546473,0.000028217377,0.007358606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774027,0.0008736433,0.000119061566,0.00043660944,0.00028590544,0.0005444482],"domain_scores_gemma":[0.98222256,0.0148248235,0.0011457276,0.00046536556,0.0005721671,0.0007693397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034634813,0.0015134794,0.0037792262,0.00076652213,0.00086305256,0.00294524,0.0031840329,0.0029261461,0.00517834],"category_scores_gemma":[0.0155396415,0.0012197439,0.0009729419,0.00068957504,0.0036287215,0.0044038473,0.0032034363,0.0027904317,0.00042479267],"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.00075900217,0.00019563454,0.0011347239,0.00022845376,0.00013209324,0.0002879717,0.0002303545,0.82120717,0.000833207,0.16227426,0.0012393998,0.011477823],"study_design_scores_gemma":[0.00011321734,0.00007414071,0.00013872395,0.000015758214,0.000020045321,0.00002269343,0.000024973155,0.92719144,0.00022537034,0.072009206,0.00014291187,0.000021503665],"about_ca_topic_score_codex":0.0085022375,"about_ca_topic_score_gemma":0.006892487,"teacher_disagreement_score":0.0085022375,"about_ca_system_score_codex":0.002296489,"about_ca_system_score_gemma":0.002432427,"threshold_uncertainty_score":0.018316865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0133652445,0.000483734,0.96736676,0.00033451497,0.00008770421,0.00016935557,0.00029141043,0.0146846045,0.0032166066],"genre_scores_gemma":[0.48040584,0.000517223,0.50195515,0.00083787646,0.00015988314,0.00032957076,0.0015554619,0.0012628424,0.012976174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989687,0.00023325227,0.00004095257,0.00043141656,0.00017283853,0.00015290901],"domain_scores_gemma":[0.99903595,0.0003145874,0.00007312128,0.00033782638,0.0001571581,0.000081345985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015640485,0.0018708577,0.0013556625,0.0009454204,0.00044586952,0.0015225398,0.0040681125,0.002296771,0.008222523],"category_scores_gemma":[0.0034333267,0.00069850753,0.0019169598,0.0010216439,0.0010449128,0.0038558105,0.0034307027,0.0026886389,0.003112856],"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.00055833755,0.00039602502,0.00085379207,0.00031309342,0.0002120038,0.00039741845,0.0004753438,0.089838706,0.054974463,0.017464846,0.014071138,0.82044494],"study_design_scores_gemma":[0.00004165968,0.00024437887,0.000524283,0.000025054123,0.0000826632,0.00018660854,0.00009341588,0.93937445,0.024901103,0.028641567,0.005837368,0.000047360278],"about_ca_topic_score_codex":0.0050411522,"about_ca_topic_score_gemma":0.0067680073,"teacher_disagreement_score":0.008222523,"about_ca_system_score_codex":0.0009515886,"about_ca_system_score_gemma":0.001289959,"threshold_uncertainty_score":0.027507067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011818546,0.00017319665,0.9861356,0.0001641201,0.000052643114,0.000021915717,0.00010871444,0.00065867114,0.0008665062],"genre_scores_gemma":[0.689185,0.0003352169,0.30583453,0.00021193919,0.00006441436,0.0001590811,0.0006378865,0.0003354582,0.003236381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997844,0.000061995364,0.00001309914,0.00006180545,0.00005043279,0.000028298244],"domain_scores_gemma":[0.9991818,0.00042713605,0.00007385484,0.00011412024,0.00015513485,0.00004795562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068902003,0.00063395867,0.000987099,0.00057091453,0.0002532614,0.0009020405,0.0011480581,0.0014154318,0.0033428527],"category_scores_gemma":[0.003271149,0.0004216012,0.00064653717,0.0005993787,0.00068526046,0.0018547676,0.0010542851,0.0020056702,0.00061557867],"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.00021642253,0.000086902815,0.00083560596,0.0001434177,0.000060298786,0.00011429022,0.00010049323,0.68513846,0.007658031,0.07430694,0.004598367,0.2267407],"study_design_scores_gemma":[0.0000049558284,0.000010832372,0.00003296142,0.0000058206774,0.000003075143,0.000004780659,0.0000029839437,0.97297716,0.00040300997,0.026308075,0.00024371201,0.0000026779342],"about_ca_topic_score_codex":0.0029559769,"about_ca_topic_score_gemma":0.0036311513,"teacher_disagreement_score":0.0033428527,"about_ca_system_score_codex":0.00085329247,"about_ca_system_score_gemma":0.0006928886,"threshold_uncertainty_score":0.011183023},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002652313,0.000051616338,0.9772314,0.00012431586,0.00008709032,0.000071605486,0.00023734187,0.017909534,0.0016348806],"genre_scores_gemma":[0.16918668,0.00010796707,0.81051695,0.00030011198,0.00011418743,0.00038840596,0.001333761,0.0075203283,0.010531586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999134,0.00019959564,0.000049983162,0.00023878676,0.00025864053,0.000118863216],"domain_scores_gemma":[0.99784434,0.0012704756,0.00005333099,0.00056023145,0.0001852115,0.0000864993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013585525,0.0023796933,0.0012417377,0.0011249117,0.0006404729,0.0021823372,0.0025480762,0.0019964115,0.03703327],"category_scores_gemma":[0.009441149,0.0013062478,0.0013234717,0.000783363,0.0011817755,0.0031944579,0.004501584,0.003370666,0.009926216],"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.0011034483,0.00034430597,0.0015156971,0.000367686,0.00017376177,0.0008367062,0.0003133692,0.08899886,0.015373408,0.08581553,0.039646246,0.765511],"study_design_scores_gemma":[0.00018910877,0.00006101826,0.00018132139,0.00003984462,0.00003357597,0.00025130252,0.00006096056,0.8219508,0.016894616,0.14737098,0.012915866,0.00005058263],"about_ca_topic_score_codex":0.0023020522,"about_ca_topic_score_gemma":0.0051414836,"teacher_disagreement_score":0.03703327,"about_ca_system_score_codex":0.0006356948,"about_ca_system_score_gemma":0.0014025492,"threshold_uncertainty_score":0.12388861},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063863914,0.00076304685,0.9581434,0.00048673537,0.0005671484,0.00013068593,0.00097525766,0.025289785,0.007257564],"genre_scores_gemma":[0.31120592,0.0011527903,0.6339411,0.0011398789,0.00043309238,0.00040451737,0.0039684977,0.0028849747,0.04486918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993863,0.00008883046,0.000015444193,0.00023031027,0.00020483788,0.000074304626],"domain_scores_gemma":[0.9994394,0.00015799292,0.00003126359,0.00021071722,0.00009637066,0.00006423148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008093077,0.0010254381,0.00084405707,0.0006398573,0.00045970036,0.0016938525,0.0023367584,0.00165484,0.0157124],"category_scores_gemma":[0.0031321235,0.00038689957,0.000759638,0.00087373727,0.0006345819,0.0021882067,0.0028371785,0.0017807006,0.0062600584],"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.0005302585,0.00023834044,0.00035512148,0.0001743129,0.000122526,0.00017155104,0.000064419306,0.027305003,0.040486086,0.01898098,0.057668883,0.8539026],"study_design_scores_gemma":[0.00008248793,0.00016416704,0.0005501968,0.000025736754,0.00003780349,0.00018645296,0.000036741036,0.89526165,0.03726273,0.047611672,0.018748183,0.000032210944],"about_ca_topic_score_codex":0.004580512,"about_ca_topic_score_gemma":0.006070731,"teacher_disagreement_score":0.0157124,"about_ca_system_score_codex":0.0005486393,"about_ca_system_score_gemma":0.0010754337,"threshold_uncertainty_score":0.05256325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060406257,0.0002777066,0.97335577,0.0009073463,0.00025368494,0.0001230073,0.00059792725,0.011174348,0.0072695916],"genre_scores_gemma":[0.18132941,0.00033636772,0.8037148,0.0009031104,0.00022245348,0.00038263082,0.0034830545,0.0020721473,0.007555935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826294,0.000501869,0.00016523869,0.0004175019,0.00051018543,0.00014219602],"domain_scores_gemma":[0.996345,0.0017319376,0.00022465012,0.0010893716,0.0005231637,0.00008586392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021082347,0.001661651,0.0009947072,0.0020017037,0.0012381584,0.0028028283,0.0038605276,0.0020398535,0.024652865],"category_scores_gemma":[0.0140347965,0.0010329162,0.0018108306,0.0017933028,0.0024384346,0.007377424,0.0048080957,0.005259081,0.005884487],"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.0002888687,0.00016871559,0.0013435103,0.0005791485,0.00013538836,0.0003678023,0.0004312994,0.09558907,0.0090093585,0.33389932,0.039012317,0.5191752],"study_design_scores_gemma":[0.00005578314,0.00005943643,0.00015026185,0.0001193021,0.000027559674,0.00010930354,0.0000822223,0.5839583,0.010366382,0.38187343,0.023171172,0.00002678951],"about_ca_topic_score_codex":0.0024216636,"about_ca_topic_score_gemma":0.0077003897,"teacher_disagreement_score":0.024652865,"about_ca_system_score_codex":0.0015889412,"about_ca_system_score_gemma":0.0022779256,"threshold_uncertainty_score":0.082472086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020466164,0.00017866777,0.9731525,0.00023458709,0.00007209089,0.0001365977,0.000119420205,0.0008269704,0.0048130676],"genre_scores_gemma":[0.41652215,0.00013932379,0.57772547,0.0002889109,0.000058434143,0.00064574357,0.00047269158,0.00036311336,0.0037840868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988865,0.00047611774,0.00005773353,0.00017685053,0.0002680812,0.00013472594],"domain_scores_gemma":[0.9932916,0.0053067342,0.00020539691,0.00049403834,0.0005162193,0.00018585783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026734676,0.0008382414,0.0018974881,0.0016206261,0.0011167554,0.001337145,0.0022789985,0.0031368006,0.008190567],"category_scores_gemma":[0.014138242,0.0013299438,0.0015049988,0.0015169566,0.0015937954,0.0025315133,0.0022319686,0.0031940797,0.0011245582],"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.00016243671,0.00007514949,0.0005855554,0.000054083463,0.000050760846,0.00007943828,0.000082502906,0.9345802,0.00048023692,0.030096635,0.0013967037,0.032356266],"study_design_scores_gemma":[0.00001503322,0.000009031496,0.000024204666,0.000005880977,0.000006012178,0.000005885134,0.0000038658163,0.99287426,0.00009936214,0.0067914105,0.00016184937,0.0000032541584],"about_ca_topic_score_codex":0.010544602,"about_ca_topic_score_gemma":0.015873367,"teacher_disagreement_score":0.010544602,"about_ca_system_score_codex":0.00146055,"about_ca_system_score_gemma":0.003440946,"threshold_uncertainty_score":0.027400196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09535291,0.00088279665,0.8884451,0.0011709419,0.000110220375,0.00010656327,0.00017132427,0.00038784332,0.01337227],"genre_scores_gemma":[0.955674,0.00039832486,0.037793234,0.00028060863,0.00008865019,0.00018497602,0.00009903848,0.00005611284,0.0054249805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998336,0.00077687064,0.00006727196,0.0002894025,0.00024196426,0.00028853415],"domain_scores_gemma":[0.98976713,0.008285281,0.0009191932,0.0004167901,0.00033938157,0.00027230728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034173313,0.00090643874,0.0018624982,0.000758905,0.00079130265,0.0020441387,0.0013857424,0.0020161862,0.005208036],"category_scores_gemma":[0.013532557,0.000527798,0.0007842952,0.00094174297,0.0019305798,0.0023888645,0.0017769758,0.0022483382,0.00059667876],"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.00024797276,0.00012517715,0.0012179009,0.000110298,0.000086464155,0.00017591382,0.000121192985,0.77546656,0.0012136595,0.19572268,0.0017603962,0.023751823],"study_design_scores_gemma":[0.00001510899,0.000020863175,0.000093990675,0.000010112122,0.0000065308254,0.000015597567,0.000009716213,0.95654565,0.00018924958,0.042800296,0.00028625858,0.0000066755565],"about_ca_topic_score_codex":0.0022931972,"about_ca_topic_score_gemma":0.0014388004,"teacher_disagreement_score":0.005208036,"about_ca_system_score_codex":0.0016063742,"about_ca_system_score_gemma":0.0007662778,"threshold_uncertainty_score":0.018072784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16850846,0.00088130916,0.74095476,0.0034214426,0.00030736063,0.00007077051,0.0002867305,0.000287648,0.085281506],"genre_scores_gemma":[0.9723226,0.00031015955,0.012742715,0.00022861599,0.00009484481,0.00006990151,0.000061032057,0.00008050311,0.014089681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969053,0.00008807643,0.000015654738,0.000060574635,0.000105730025,0.000039510003],"domain_scores_gemma":[0.99854624,0.0006203822,0.0002008992,0.00014009625,0.00032902925,0.00016330637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535072,0.0006910998,0.0005294535,0.00069765106,0.0005683516,0.0012582067,0.0008857568,0.0010440795,0.0057694297],"category_scores_gemma":[0.0043059904,0.00021141677,0.00045321917,0.00027497273,0.0015920405,0.0020721399,0.0018260448,0.0013776296,0.00039836057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026465625,0.000019889818,0.00014294444,0.00005957834,0.00001331923,0.000055193887,0.00008655627,0.047723327,0.002473276,0.94367605,0.0008267505,0.004896536],"study_design_scores_gemma":[0.000010118996,0.000040236522,0.00023199763,0.000014910817,0.0000057899133,0.00004996125,0.00003121109,0.5667808,0.0005960557,0.4313786,0.00084405195,0.000016297665],"about_ca_topic_score_codex":0.0018222756,"about_ca_topic_score_gemma":0.0013331573,"teacher_disagreement_score":0.0057694297,"about_ca_system_score_codex":0.0014676584,"about_ca_system_score_gemma":0.0007918872,"threshold_uncertainty_score":0.0193007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004114675,0.0007787369,0.9930213,0.00032361908,0.00006127589,0.000041491083,0.00020530577,0.00033670542,0.0011168846],"genre_scores_gemma":[0.39132753,0.0034820952,0.5928783,0.0005794757,0.00023829729,0.0004373219,0.0016899484,0.00021828372,0.009148853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994168,0.00017107911,0.000028930814,0.00021015175,0.00011492436,0.000058053676],"domain_scores_gemma":[0.9989135,0.0006120846,0.000104331695,0.000102945225,0.00022001562,0.000047059497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910374,0.0013048912,0.0011457648,0.0014166947,0.00052359025,0.001015641,0.0029772,0.0017870732,0.0030033847],"category_scores_gemma":[0.004066811,0.0006082794,0.00080511364,0.0022149412,0.0011896741,0.0033661025,0.0009964235,0.002337888,0.00065186154],"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.000057695263,0.000045973324,0.0006236171,0.000125615,0.000059726182,0.000062962616,0.00005089065,0.84026706,0.00079515314,0.057281923,0.0047036163,0.09592572],"study_design_scores_gemma":[0.000003169175,0.000008305872,0.000048718517,0.0000066109824,0.0000060636517,0.000007927378,0.0000034070688,0.9794382,0.00017390806,0.019598009,0.00070137234,0.0000043513623],"about_ca_topic_score_codex":0.017637638,"about_ca_topic_score_gemma":0.015082421,"teacher_disagreement_score":0.017637638,"about_ca_system_score_codex":0.0020184193,"about_ca_system_score_gemma":0.0017130051,"threshold_uncertainty_score":0.035069942},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001436683,0.00020345487,0.9961855,0.00019057686,0.00003555594,0.00003433979,0.000025357062,0.00015041404,0.0017380957],"genre_scores_gemma":[0.10502834,0.00065244583,0.88248456,0.00063259114,0.00029056612,0.0005118089,0.00027539805,0.0008583194,0.0092659835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971921,0.0013472172,0.000109635264,0.00034961055,0.0008298999,0.0001716027],"domain_scores_gemma":[0.9947977,0.0033628028,0.00033482202,0.00073417515,0.0005825283,0.00018800414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054107504,0.002108292,0.0018052403,0.0017413055,0.00067640253,0.0021686638,0.003283367,0.0027141736,0.005608015],"category_scores_gemma":[0.01732228,0.0011218062,0.0019139843,0.0011112262,0.0023556422,0.003443951,0.0053439583,0.005049694,0.0018831394],"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.0001515038,0.00016411554,0.000599383,0.0003589664,0.00010835691,0.0001302589,0.00027063163,0.5324436,0.004366752,0.34215906,0.007448199,0.11179904],"study_design_scores_gemma":[0.0000139517015,0.000032016604,0.000045891768,0.000023710429,0.000007331075,0.000023540837,0.000009159091,0.9492815,0.00056723895,0.04812346,0.0018614097,0.0000108185495],"about_ca_topic_score_codex":0.002130137,"about_ca_topic_score_gemma":0.002798516,"teacher_disagreement_score":0.005608015,"about_ca_system_score_codex":0.0013108461,"about_ca_system_score_gemma":0.0019491712,"threshold_uncertainty_score":0.028615117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090150405,0.00044864797,0.987248,0.0003162147,0.000069928814,0.0000588249,0.000032661148,0.00015500025,0.002655586],"genre_scores_gemma":[0.70851755,0.00067004934,0.2824379,0.00041065697,0.000171114,0.00046345175,0.000100291865,0.000116022384,0.0071129357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978783,0.0009710042,0.0000971907,0.00032924186,0.00041560258,0.00030864793],"domain_scores_gemma":[0.99509746,0.0035517123,0.00036049538,0.00042110423,0.00035365665,0.00021555807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045550824,0.0012913371,0.0016180382,0.0008184622,0.0010746701,0.0021829957,0.0021715611,0.0020923493,0.0032281377],"category_scores_gemma":[0.011684306,0.0005222796,0.0007367353,0.0009191822,0.0022026163,0.0023997847,0.0017841976,0.001963536,0.00056708703],"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.00013478944,0.00007709563,0.00034048324,0.00007513554,0.000048441576,0.00004400362,0.00008392109,0.82032764,0.0006286212,0.14844908,0.0013775349,0.028413292],"study_design_scores_gemma":[0.000023190525,0.000019319412,0.00003417614,0.000011456036,0.000006075077,0.000008823806,0.000008752533,0.9234735,0.000245024,0.07563268,0.0005308392,0.000006104551],"about_ca_topic_score_codex":0.00247952,"about_ca_topic_score_gemma":0.0024619328,"teacher_disagreement_score":0.0045550824,"about_ca_system_score_codex":0.0021503158,"about_ca_system_score_gemma":0.0018949232,"threshold_uncertainty_score":0.024089813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038868234,0.00068201876,0.95443755,0.00061898166,0.00010084329,0.000050494185,0.00039019683,0.0008444069,0.0040073534],"genre_scores_gemma":[0.80434424,0.0005213221,0.1820654,0.00036874457,0.00009708767,0.00018447245,0.0010692807,0.00030419993,0.011045229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962854,0.00010072226,0.000017551078,0.00012598366,0.000075740834,0.000051404368],"domain_scores_gemma":[0.9984633,0.00096038246,0.00011532664,0.00021535275,0.00017326174,0.00007236972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012145455,0.00090028974,0.0009488021,0.000523445,0.00039468962,0.0009605149,0.0018455285,0.0014256224,0.0041477503],"category_scores_gemma":[0.0044193496,0.0006166803,0.0007348428,0.0005741661,0.001263042,0.0017380493,0.00132035,0.002615425,0.00072258676],"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.000075065254,0.00002843496,0.0009265499,0.00003969867,0.000036808982,0.000043492942,0.00003662365,0.9330049,0.0012721511,0.031444445,0.0026703365,0.030421617],"study_design_scores_gemma":[0.0000027046904,0.000005131558,0.00003589222,0.0000029423773,0.0000013736343,0.0000040184827,0.0000016705247,0.9948532,0.00024959064,0.004651018,0.00019044161,0.0000020667962],"about_ca_topic_score_codex":0.006955208,"about_ca_topic_score_gemma":0.009430983,"teacher_disagreement_score":0.006955208,"about_ca_system_score_codex":0.0010820224,"about_ca_system_score_gemma":0.00089350005,"threshold_uncertainty_score":0.013875544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073063057,0.0018891089,0.98614687,0.0012727946,0.000064751264,0.00004369102,0.00006693424,0.000121160534,0.0030884445],"genre_scores_gemma":[0.5216362,0.0084242895,0.44781998,0.0025267217,0.0017383435,0.00096130854,0.00085596216,0.00071976887,0.015317485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907198,0.0056862137,0.00034679842,0.0013009425,0.0015500402,0.00039623588],"domain_scores_gemma":[0.9017445,0.083796605,0.004563501,0.004778644,0.0038158305,0.0013009034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02463101,0.0032671993,0.0030172104,0.002088159,0.00086742954,0.0027131038,0.0035359531,0.003878715,0.0032536788],"category_scores_gemma":[0.09815334,0.0012291108,0.0018288488,0.0016239802,0.0059127114,0.007335625,0.006105077,0.008969143,0.0012043064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013014226,0.000110745204,0.0012759168,0.00042274725,0.00015489185,0.00025573297,0.00022409623,0.27918184,0.00169387,0.6937904,0.0023912448,0.020368444],"study_design_scores_gemma":[0.000018689607,0.00007276741,0.00038790103,0.00010380783,0.000027210754,0.00009900341,0.000024732777,0.7280491,0.0005624164,0.26923576,0.0013829143,0.000035758312],"about_ca_topic_score_codex":0.0011898975,"about_ca_topic_score_gemma":0.00067052845,"teacher_disagreement_score":0.02463101,"about_ca_system_score_codex":0.0024614152,"about_ca_system_score_gemma":0.0016415766,"threshold_uncertainty_score":0.13026279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015608271,0.00013931494,0.9784735,0.0003468774,0.000036526177,0.000043888293,0.0001285296,0.0014208565,0.0038021752],"genre_scores_gemma":[0.52358264,0.00032504552,0.46978095,0.00027602573,0.00004699271,0.00025421954,0.0005509386,0.00041395234,0.0047692196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873894,0.00039446037,0.00007814096,0.0003887713,0.00029677086,0.0001028659],"domain_scores_gemma":[0.996801,0.0017241053,0.00029988113,0.00085340167,0.00022862958,0.000092873786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015651927,0.00084739743,0.00071944937,0.0005552282,0.00054203044,0.0018595002,0.0020628083,0.0011298696,0.0037993435],"category_scores_gemma":[0.010774439,0.0007109884,0.0008703512,0.0006322517,0.0026619253,0.004883014,0.0020691336,0.0031767723,0.00086407247],"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.0001819277,0.00007993958,0.0015225706,0.00025545148,0.0000631404,0.00008233647,0.00030041955,0.52547306,0.0033461703,0.3186175,0.0029038298,0.14717366],"study_design_scores_gemma":[0.00001931423,0.000025360465,0.00009267648,0.000017721333,0.000009948259,0.000020378871,0.000022592125,0.80993223,0.0015203551,0.18620677,0.0021235284,0.000009224182],"about_ca_topic_score_codex":0.0020867437,"about_ca_topic_score_gemma":0.0038373326,"teacher_disagreement_score":0.0037993435,"about_ca_system_score_codex":0.0010755407,"about_ca_system_score_gemma":0.0017749226,"threshold_uncertainty_score":0.012710094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8846586,0.00026726196,0.10247367,0.00086087995,0.000030507268,0.000022160459,0.00018141264,0.00017124072,0.011334377],"genre_scores_gemma":[0.99474084,0.00006239995,0.0036875675,0.000022375507,0.000003865512,0.000011564658,0.000022946708,0.000012111015,0.001436145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99996674,0.000011631557,0.0000010918644,0.0000089929545,0.000004777954,0.0000068178883],"domain_scores_gemma":[0.99981886,0.00007773336,0.000026866084,0.000012897781,0.00003073246,0.000032964672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002306164,0.00019862383,0.00019412243,0.00017858333,0.00017360819,0.00036370655,0.0004952703,0.0003809106,0.0017523426],"category_scores_gemma":[0.0005805342,0.00015072829,0.00027270732,0.00011093843,0.00049037964,0.0004244448,0.00032942207,0.00038459976,0.00013433199],"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.000038288574,0.000024352605,0.00093891734,0.000019438008,0.000014164437,0.0000669146,0.000055970595,0.9826652,0.0026046536,0.010647489,0.00029928732,0.0026254402],"study_design_scores_gemma":[0.0000019674694,0.000006098358,0.00019278591,0.0000010758155,0.0000012826508,0.0000051615657,0.0000058259407,0.9958033,0.000107089494,0.0038321435,0.00004211882,0.0000011573945],"about_ca_topic_score_codex":0.007638233,"about_ca_topic_score_gemma":0.0055375537,"teacher_disagreement_score":0.007638233,"about_ca_system_score_codex":0.0006635076,"about_ca_system_score_gemma":0.0004192854,"threshold_uncertainty_score":0.0151875615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012658536,0.00033354678,0.98333055,0.00034831313,0.000044097786,0.000047125573,0.000088796856,0.00030464405,0.002844323],"genre_scores_gemma":[0.51802874,0.0010270368,0.45768547,0.0006392207,0.0002805617,0.00040305982,0.0007302209,0.00055851723,0.020647123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991462,0.00026530022,0.000035153662,0.0002625284,0.00021062465,0.00008018248],"domain_scores_gemma":[0.9960537,0.0023716965,0.00042348524,0.0004026829,0.00052812725,0.00022025383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024911915,0.0010123531,0.0012666174,0.0013796883,0.0007959677,0.0015869152,0.001928876,0.002264084,0.0047670915],"category_scores_gemma":[0.009439294,0.0006053016,0.0010190173,0.0011330259,0.0017782808,0.003887873,0.0021673867,0.0024073182,0.0007609585],"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.00013274046,0.00007315721,0.0012039933,0.00022781023,0.00008524776,0.00016211686,0.0002145292,0.7062263,0.0065725334,0.20786773,0.0066887364,0.07054509],"study_design_scores_gemma":[0.000007196012,0.000012042631,0.00009429955,0.000008086143,0.0000047970075,0.000024756082,0.000009207192,0.96692914,0.00061284367,0.03138438,0.00090651755,0.0000068388385],"about_ca_topic_score_codex":0.0027349659,"about_ca_topic_score_gemma":0.00328616,"teacher_disagreement_score":0.0047670915,"about_ca_system_score_codex":0.0019022053,"about_ca_system_score_gemma":0.0011352056,"threshold_uncertainty_score":0.01594752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050521656,0.00017528806,0.9916442,0.00019583518,0.000022929307,0.000035596004,0.000036955476,0.00035734047,0.0024796645],"genre_scores_gemma":[0.66619444,0.00060673215,0.32408595,0.0006166743,0.00014013934,0.000367028,0.00034849474,0.0005431973,0.007097289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984409,0.00065481314,0.000065766595,0.00030773063,0.00036036657,0.00017037422],"domain_scores_gemma":[0.997378,0.0016432513,0.00023693312,0.00042464683,0.00019944883,0.00011775362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031105664,0.0018253286,0.0013449398,0.00070197275,0.00054255896,0.0014014835,0.0016531494,0.0014384441,0.0033919944],"category_scores_gemma":[0.007330571,0.00066609384,0.0009584224,0.00058517756,0.002259171,0.00241281,0.0039583296,0.0035828755,0.001041829],"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.000072649804,0.000038520124,0.00033297576,0.00007215611,0.000050714065,0.00006629619,0.000051171126,0.91330355,0.0029398254,0.046098202,0.002139953,0.03483406],"study_design_scores_gemma":[0.000005295598,0.0000274619,0.000043834214,0.000010885735,0.0000055232385,0.000031120722,0.000006766213,0.97401583,0.0013877962,0.023772487,0.0006864742,0.0000065109025],"about_ca_topic_score_codex":0.0006471759,"about_ca_topic_score_gemma":0.0007624261,"teacher_disagreement_score":0.0033919944,"about_ca_system_score_codex":0.0010416107,"about_ca_system_score_gemma":0.0010667996,"threshold_uncertainty_score":0.016450465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44294602,0.0008427195,0.5418133,0.00058531173,0.00011780082,0.00020932063,0.00208942,0.0039035634,0.007492548],"genre_scores_gemma":[0.9196678,0.00032269565,0.07542058,0.00010069747,0.000042192598,0.000061770064,0.0020462284,0.00017464011,0.0021635029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996636,0.000076891236,0.000019840516,0.00009727855,0.00010404981,0.00003838171],"domain_scores_gemma":[0.9988362,0.0005226272,0.00020133256,0.00017713362,0.00018980626,0.00007289432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005380199,0.0006041932,0.00080258405,0.003765224,0.00046139184,0.0009792504,0.00094328704,0.00094475184,0.0033434012],"category_scores_gemma":[0.003270319,0.0003416743,0.00082437927,0.0025762867,0.0004461233,0.0013994398,0.0008227163,0.000818438,0.0009003528],"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.00084808836,0.00055614323,0.020150395,0.00024425608,0.00034098132,0.00045813198,0.00007628819,0.5477212,0.02271033,0.022565613,0.0075206654,0.37680787],"study_design_scores_gemma":[0.000015645017,0.00004586789,0.0009372774,0.000005037557,0.00002674035,0.000037649315,0.000011665361,0.98582596,0.0017577144,0.010869192,0.0004577008,0.000009551757],"about_ca_topic_score_codex":0.0049550924,"about_ca_topic_score_gemma":0.008079253,"teacher_disagreement_score":0.0049550924,"about_ca_system_score_codex":0.00062003837,"about_ca_system_score_gemma":0.000721428,"threshold_uncertainty_score":0.011184812},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015340932,0.00012481149,0.981941,0.00016897707,0.000025801297,0.00004834713,0.00031815184,0.0012460864,0.0007859025],"genre_scores_gemma":[0.635506,0.00029033364,0.3568206,0.00015640698,0.00006071307,0.00021215978,0.001670985,0.00054962083,0.00473325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956065,0.00011481786,0.0000229964,0.00015124439,0.000096327945,0.00005396062],"domain_scores_gemma":[0.99904245,0.0005113972,0.00006229765,0.00016610649,0.0001620712,0.000055670553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007768898,0.0006589963,0.0010124785,0.0011372442,0.00049948005,0.0012814434,0.0021305496,0.0014722435,0.0034635486],"category_scores_gemma":[0.0037905732,0.00071864174,0.0016427031,0.0014235848,0.0004899886,0.002026148,0.0011274844,0.0015294557,0.0010801587],"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.0001657555,0.00013306412,0.0017869988,0.00009649457,0.000112137066,0.00012937274,0.00013548066,0.81200045,0.005494979,0.022062398,0.0032747306,0.15460812],"study_design_scores_gemma":[0.0000023403836,0.000004990615,0.00006918175,0.0000017801035,0.000006126168,0.000007701845,0.000003862727,0.99525356,0.0004035334,0.0040696124,0.00017492361,0.0000024284163],"about_ca_topic_score_codex":0.02314886,"about_ca_topic_score_gemma":0.039771352,"teacher_disagreement_score":0.02314886,"about_ca_system_score_codex":0.0010755048,"about_ca_system_score_gemma":0.0013353219,"threshold_uncertainty_score":0.046028256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027391717,0.00007662189,0.9933623,0.00018016442,0.000028520892,0.00003981579,0.00004972818,0.00080587546,0.0027177401],"genre_scores_gemma":[0.5228709,0.00023783009,0.4619877,0.0004967355,0.00018455576,0.00049515953,0.0003833766,0.0006168772,0.012726818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986064,0.00037765075,0.000070272916,0.00042853225,0.00037670403,0.00014053409],"domain_scores_gemma":[0.997113,0.0017706268,0.00017212633,0.00047038932,0.00034571823,0.00012816924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014047856,0.0011467066,0.0014963626,0.0005905306,0.00053770625,0.0014188814,0.0029363642,0.0011366295,0.007360719],"category_scores_gemma":[0.006882076,0.00089110807,0.00078646664,0.00047510513,0.001646661,0.0018914145,0.002402997,0.003018552,0.0013559673],"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.0001464883,0.00016242356,0.000760121,0.00017404395,0.000104165134,0.00009176328,0.00013125954,0.78117347,0.0026124066,0.081070915,0.004400086,0.12917289],"study_design_scores_gemma":[0.000010383334,0.000027636945,0.000055939923,0.000007394411,0.0000065908653,0.000015523041,0.0000043838018,0.9727622,0.0005006624,0.025609626,0.0009932577,0.0000064145866],"about_ca_topic_score_codex":0.00430335,"about_ca_topic_score_gemma":0.0073722336,"teacher_disagreement_score":0.007360719,"about_ca_system_score_codex":0.0014592521,"about_ca_system_score_gemma":0.0021563086,"threshold_uncertainty_score":0.02462411},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035445045,0.00019939881,0.9830751,0.0000729526,0.000054506727,0.00005003999,0.0005996315,0.01067619,0.0017276478],"genre_scores_gemma":[0.3045195,0.0005286074,0.6775787,0.0003258925,0.00008920773,0.00033840662,0.0061865067,0.002669276,0.007763807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996158,0.00007861389,0.000015032426,0.00013867466,0.000110108194,0.00004176204],"domain_scores_gemma":[0.99968576,0.00015090151,0.00002334416,0.00007206208,0.000042193966,0.000025748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006229856,0.0012820014,0.0006322923,0.00074583566,0.00028131678,0.0009371328,0.001862118,0.00091292895,0.0073217005],"category_scores_gemma":[0.0016852997,0.0008150922,0.0018529386,0.0006799411,0.0006870123,0.0010699099,0.0012845859,0.0020057678,0.0046680905],"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.00027177713,0.00011777656,0.0008497083,0.00021087608,0.00013288757,0.00017600931,0.000118691685,0.6444792,0.02340785,0.0180433,0.017682793,0.2945091],"study_design_scores_gemma":[0.000017082895,0.000030727697,0.00010061273,0.0000082370225,0.000010263211,0.00005006436,0.000009349672,0.98431385,0.0042266627,0.006800566,0.00442181,0.000010816112],"about_ca_topic_score_codex":0.0063048517,"about_ca_topic_score_gemma":0.014832325,"teacher_disagreement_score":0.0073217005,"about_ca_system_score_codex":0.0008749027,"about_ca_system_score_gemma":0.00084516045,"threshold_uncertainty_score":0.024493456},"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":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96225375,0.00065114273,0.017148014,0.006559093,0.00008512339,0.00009381629,0.00013099758,0.00006570716,0.0130123515],"genre_scores_gemma":[0.9968568,0.000069354086,0.0015606277,0.00024396484,0.000023557033,0.000031010793,0.000052645697,0.000021096077,0.0011409126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99128526,0.006350435,0.00028193768,0.00078068743,0.0008578019,0.00044380792],"domain_scores_gemma":[0.7539429,0.21042517,0.011819293,0.014131798,0.006517386,0.0031633824],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02748295,0.00039350544,0.00058217795,0.0005732608,0.0015915653,0.0025682736,0.0016217543,0.0021457146,0.007078965],"category_scores_gemma":[0.22754133,0.00029698116,0.0002997686,0.0007234538,0.0044593,0.0061825626,0.0017810473,0.004347698,0.0006175652],"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.007895449,0.0049937633,0.27576318,0.00071048824,0.0006315686,0.0004023632,0.0077746543,0.081842676,0.0047334554,0.335427,0.019637628,0.26018783],"study_design_scores_gemma":[0.0010163625,0.0023404923,0.12549399,0.0003728157,0.00022158626,0.00028943628,0.0052648573,0.34164056,0.004596226,0.50817114,0.010472949,0.00011951927],"about_ca_topic_score_codex":0.004503473,"about_ca_topic_score_gemma":0.0042669578,"teacher_disagreement_score":0.9725171,"about_ca_system_score_codex":0.0023528624,"about_ca_system_score_gemma":0.0014991274,"threshold_uncertainty_score":0.14534545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04567585,0.0002771407,0.94347626,0.00045015768,0.00008145848,0.000057900805,0.00012316847,0.005032717,0.0048253736],"genre_scores_gemma":[0.64661163,0.00028427108,0.34566733,0.00038762743,0.000083260624,0.00013463515,0.00036842408,0.000445399,0.006017325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994836,0.00012361586,0.000044798588,0.00018250031,0.00010510018,0.000060420065],"domain_scores_gemma":[0.99841154,0.0007003667,0.00009467023,0.00053851603,0.00018834966,0.000066558656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426461,0.0005832165,0.00062263064,0.00048758188,0.0003599315,0.0012649815,0.001982967,0.0009866026,0.0038829783],"category_scores_gemma":[0.0060346546,0.0006917498,0.0010424291,0.00038192308,0.0013856865,0.0043311073,0.0018577246,0.0021881028,0.0009038359],"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.0004160103,0.00018684781,0.0022392364,0.00026201995,0.00015603205,0.0003402328,0.00052841194,0.44155997,0.025197493,0.13745715,0.004730524,0.3869261],"study_design_scores_gemma":[0.000012812755,0.000024579886,0.00011879852,0.000012076988,0.000020988791,0.000042138163,0.00001663423,0.94260305,0.005550355,0.04954651,0.0020419832,0.000010190426],"about_ca_topic_score_codex":0.0026310934,"about_ca_topic_score_gemma":0.0040983213,"teacher_disagreement_score":0.0038829783,"about_ca_system_score_codex":0.00093696325,"about_ca_system_score_gemma":0.00095051853,"threshold_uncertainty_score":0.012989819},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016590787,0.0008977777,0.96819836,0.00064124574,0.0002708706,0.00010851851,0.0003533895,0.0054830536,0.0074560847],"genre_scores_gemma":[0.3919721,0.00051279593,0.5900971,0.00059927226,0.0002746569,0.00033221004,0.00079523504,0.0011878227,0.0142288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994111,0.00012962181,0.000025877926,0.00007450103,0.00030050872,0.000058430036],"domain_scores_gemma":[0.998965,0.00047333585,0.000038739003,0.0002762184,0.00019410146,0.000052619263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077285303,0.00081983284,0.00060346833,0.00062139606,0.0003678779,0.0009293416,0.0013492062,0.0015264519,0.0065661343],"category_scores_gemma":[0.003759628,0.00023288325,0.00029047555,0.00081363716,0.00095827534,0.0010822223,0.0016172674,0.0021472892,0.002177678],"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.0009087249,0.00019494098,0.00031231527,0.00020236369,0.00005826396,0.00022441185,0.00011028565,0.17520685,0.019560253,0.041353296,0.027770452,0.73409784],"study_design_scores_gemma":[0.000067109955,0.000086112326,0.00009567903,0.000025226787,0.000007929214,0.00016411635,0.00001414366,0.9652617,0.011932821,0.018900009,0.0034330147,0.0000121231],"about_ca_topic_score_codex":0.0032094761,"about_ca_topic_score_gemma":0.0049061016,"teacher_disagreement_score":0.0065661343,"about_ca_system_score_codex":0.00045524884,"about_ca_system_score_gemma":0.0012610429,"threshold_uncertainty_score":0.02196592},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026857462,0.00016852038,0.967448,0.00011855453,0.000096653115,0.000030146688,0.000038483588,0.0011631167,0.004078971],"genre_scores_gemma":[0.7716065,0.000113346774,0.22012782,0.00014824247,0.000062120576,0.00011671092,0.0001200298,0.00029441455,0.0074108727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996407,0.0000856881,0.000030499496,0.00010431768,0.00008257426,0.00005623761],"domain_scores_gemma":[0.9992009,0.00035095404,0.000055959707,0.00021484122,0.00012322253,0.000054196284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006610249,0.00052003027,0.0008041399,0.00031608113,0.00039565854,0.0010853326,0.0016395982,0.0013404808,0.004136949],"category_scores_gemma":[0.0028195612,0.00056130695,0.00067386933,0.00035079374,0.00093761744,0.0016282753,0.001921452,0.001315862,0.0011644663],"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.00031900592,0.00017972154,0.00077319134,0.00016352131,0.00013315683,0.00036671478,0.00031965275,0.5373337,0.04409572,0.14685263,0.0034767424,0.2659862],"study_design_scores_gemma":[0.000007199811,0.000016550686,0.00003305274,0.000004227448,0.0000068070294,0.000020797572,0.0000039741876,0.9880705,0.0022166006,0.009290378,0.00032363547,0.0000063085995],"about_ca_topic_score_codex":0.0013860739,"about_ca_topic_score_gemma":0.0022027192,"teacher_disagreement_score":0.004136949,"about_ca_system_score_codex":0.0005246831,"about_ca_system_score_gemma":0.0005753617,"threshold_uncertainty_score":0.013839483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03588863,0.0004207099,0.95989853,0.00017509253,0.00005318167,0.00008517986,0.00043053395,0.0018432245,0.0012050006],"genre_scores_gemma":[0.5733645,0.00041010146,0.41845673,0.00024111416,0.000146062,0.00025571292,0.0032126915,0.00030655775,0.0036064794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991673,0.00013347426,0.00006518386,0.0002766437,0.00022772353,0.00012971745],"domain_scores_gemma":[0.99881566,0.0003857275,0.00013133815,0.0002770421,0.0003307763,0.000059547077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412659,0.0013144534,0.002076294,0.0021182217,0.0007762908,0.0011548706,0.0022204872,0.0013992684,0.0021171677],"category_scores_gemma":[0.0034595467,0.00058731873,0.0017049805,0.0024047191,0.0006473125,0.0016448065,0.002238003,0.0010675397,0.0015293661],"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.0006451509,0.0006982367,0.0042594667,0.0003511119,0.00022393308,0.00020585426,0.00015991007,0.04998065,0.050755262,0.0070039714,0.008366795,0.8773497],"study_design_scores_gemma":[0.000015390946,0.00006919281,0.0015613628,0.00001558057,0.00004089136,0.00008571454,0.000044541208,0.9739446,0.009876543,0.013109518,0.0012249289,0.000011675952],"about_ca_topic_score_codex":0.0032178161,"about_ca_topic_score_gemma":0.0066155093,"teacher_disagreement_score":0.0032178161,"about_ca_system_score_codex":0.00056202564,"about_ca_system_score_gemma":0.0012216554,"threshold_uncertainty_score":0.0070825815},"labels":[],"label_agreement":null}]}