{"meta":{"query_hash":"591345dbeb0d","filters":{"venue":"Machine Learning"},"cohort_total":113,"direct_labels_cover":0,"predictions_cover":113,"exported":113,"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/591345dbeb0d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Machine+Learning"},"results":[{"id":"W138226303","doi":"10.1007/s10994-016-5557-9","title":"Fast learning of relational dependency networks","year":2016,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"China Scholarship Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bayesian network; Statistical relational learning; Computer science; Boosting (machine learning); Tuple; Artificial intelligence; Dependency (UML); Relational database; Benchmark (surveying); Machine learning; Bayesian probability; Data mining; Mathematics","score_opus":0.01565735542101996,"score_gpt":0.23234033158792922,"score_spread":0.21668297616690926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138226303","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.011356896,0.0008180529,0.9839389,0.0005044128,0.000057807094,0.000048179514,0.00049212045,0.0016016226,0.0011820908],"genre_scores_gemma":[0.41649345,0.0015560086,0.5694174,0.00040727088,0.0002717108,0.00031747826,0.0042807795,0.0006394519,0.0066165132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976017,0.00097058876,0.00013318393,0.00061943044,0.0005225264,0.00015257676],"domain_scores_gemma":[0.9808397,0.015262253,0.00060130825,0.0020004879,0.0010246582,0.0002715426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029751188,0.001263989,0.0021546725,0.0024199155,0.0011149824,0.0022208567,0.0032418284,0.0019448346,0.0076875784],"category_scores_gemma":[0.027670233,0.0017421551,0.0015330752,0.0025168555,0.0010037731,0.0063057393,0.0034784835,0.0039164936,0.0020414132],"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.00044664863,0.0001675521,0.0030358653,0.00050360226,0.00028039716,0.0002322459,0.00025652224,0.4195835,0.0023063817,0.105302855,0.017050032,0.45083448],"study_design_scores_gemma":[0.00001845036,0.000013133858,0.00022883926,0.000018504901,0.00002522556,0.000038289585,0.000016991775,0.91401595,0.00059171004,0.08364232,0.0013813893,0.000009134463],"about_ca_topic_score_codex":0.009780994,"about_ca_topic_score_gemma":0.01597335,"teacher_disagreement_score":0.009780994,"about_ca_system_score_codex":0.0018767776,"about_ca_system_score_gemma":0.0022228295,"threshold_uncertainty_score":0.025717497},"labels":[],"label_agreement":null},{"id":"W1499053674","doi":"10.1007/s10994-011-5259-2","title":"ILP turns 20","year":2011,"lang":"en","type":"article","venue":"Machine Learning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":128,"is_retracted":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":"Biotechnology and Biological Sciences Research Council; Microsoft Research; University of Oxford; Imperial College London; University of New South Wales; Royal Academy of Engineering; Jawaharlal Nehru University","keywords":"Inductive logic programming; Analogy; Subject (documents); Implementation; Computer science; Artificial intelligence; Development (topology); Projection (relational algebra); Cognitive science; Machine learning; Epistemology; Psychology; Programming language; Mathematics; Algorithm; Library science","score_opus":0.02463525336756793,"score_gpt":0.22296309924810606,"score_spread":0.19832784588053815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499053674","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00356033,0.003304477,0.17635225,0.032613706,0.006245812,0.00007896914,0.0010656168,0.0014050672,0.7753738],"genre_scores_gemma":[0.3994771,0.006667782,0.090457104,0.029665152,0.010679071,0.0006771402,0.0027230517,0.0028008833,0.4568527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980147,0.000531157,0.000102708604,0.0006677974,0.00047403065,0.00020962207],"domain_scores_gemma":[0.9976108,0.0011626197,0.00012695158,0.00041632095,0.00053935515,0.00014406808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016635085,0.0011333892,0.0007582317,0.0011518345,0.002074537,0.0059264437,0.0011976116,0.001756406,0.0885513],"category_scores_gemma":[0.007198107,0.00052690605,0.0013744268,0.0007978429,0.004345189,0.00620494,0.0025092617,0.0051218625,0.02653746],"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.000022760234,0.0000108893855,0.00011053102,0.000048566097,0.000010394916,0.00011180598,0.00012798049,0.00049933937,0.0001520506,0.94277865,0.041158248,0.014968766],"study_design_scores_gemma":[0.000009802128,0.0000075040653,0.00006615809,0.00004294717,0.0000073223873,0.000093111914,0.000053301916,0.0012175561,0.00028284916,0.84111357,0.15709828,0.000007616823],"about_ca_topic_score_codex":0.0016316072,"about_ca_topic_score_gemma":0.0015482184,"teacher_disagreement_score":0.0885513,"about_ca_system_score_codex":0.0027887246,"about_ca_system_score_gemma":0.0014692338,"threshold_uncertainty_score":0.2962336},"labels":[],"label_agreement":null},{"id":"W1560635010","doi":"10.1023/a:1007653929870","title":"Stochastic Grammatical Inference of Text Database Structure","year":2000,"lang":"en","type":"article","venue":"Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Grammar induction; Computer science; Nesting (process); Markup language; Inference; Construct (python library); Semantics (computer science); Grammar; Artificial intelligence; Natural language processing; Theoretical computer science; Programming language; XML; Rule-based machine translation; Linguistics","score_opus":0.008191670648523592,"score_gpt":0.2716978941340115,"score_spread":0.2635062234854879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560635010","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.07095329,0.00023420618,0.9199224,0.0020547227,0.00012592926,0.00006998386,0.0012928292,0.0023185639,0.0030280843],"genre_scores_gemma":[0.7457427,0.00030303063,0.24674068,0.00048635385,0.00026991018,0.0001161711,0.002746617,0.0005805786,0.003013992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717975,0.0012086852,0.00023519795,0.0005819648,0.0006152524,0.00017909153],"domain_scores_gemma":[0.9683925,0.02529387,0.0010535449,0.002208408,0.0027408751,0.00031075737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034547923,0.00035659346,0.00088788994,0.002170717,0.0010639314,0.0023053861,0.002358176,0.0014764927,0.004576388],"category_scores_gemma":[0.033008408,0.0009271363,0.0013843726,0.0017061105,0.0013311197,0.006336168,0.0018660484,0.0020239642,0.0008856315],"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.00046884175,0.00027175085,0.009204257,0.00056694215,0.00017535617,0.0004959423,0.00096945255,0.21542104,0.008545945,0.49446398,0.020190269,0.2492263],"study_design_scores_gemma":[0.000026223703,0.000015208555,0.00048062354,0.000019624415,0.000031239637,0.000059812082,0.000058190817,0.7679944,0.0022170409,0.22762126,0.0014619699,0.000014409198],"about_ca_topic_score_codex":0.007129606,"about_ca_topic_score_gemma":0.0127827125,"teacher_disagreement_score":0.007129606,"about_ca_system_score_codex":0.002040903,"about_ca_system_score_gemma":0.0019078419,"threshold_uncertainty_score":0.01827091},"labels":[],"label_agreement":null},{"id":"W1560659665","doi":"10.1023/a:1013947519741","title":"Metric-Based Methods for Adaptive Model Selection and Regularization","year":2002,"lang":"en","type":"article","venue":"Machine Learning","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regularization (linguistics); Artificial intelligence; Computer science; Machine learning; Labeled data; Training set; Exploit; Model selection; Supervised learning; Regression; Pattern recognition (psychology); Mathematics; Statistics; Artificial neural network","score_opus":0.029202128097776763,"score_gpt":0.29442337625596693,"score_spread":0.26522124815819015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560659665","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.00027868839,0.00037347118,0.99900204,0.00007373797,0.000025802437,0.000008605378,0.000011651851,0.00005852137,0.0001674865],"genre_scores_gemma":[0.06292834,0.0019389198,0.93097955,0.00024808059,0.0003766129,0.00039050556,0.00029912873,0.00033583984,0.0025030223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474585,0.0031572985,0.00022911803,0.0005303413,0.001216303,0.00012117274],"domain_scores_gemma":[0.9894103,0.007277455,0.00052487745,0.0011418284,0.0014236674,0.00022195227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075368723,0.0023988625,0.0034234622,0.0024299072,0.0009856495,0.002036201,0.00490626,0.0035153967,0.00254603],"category_scores_gemma":[0.02971441,0.0014351876,0.0018388815,0.003265931,0.0026508514,0.0035189094,0.00416793,0.005386981,0.0010687765],"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.00010221304,0.000098886856,0.00044427867,0.00039827428,0.0003492475,0.00008428078,0.0001345346,0.38260806,0.00217176,0.4388857,0.0065495404,0.16817327],"study_design_scores_gemma":[0.000013329761,0.000019456858,0.00007905688,0.000017643491,0.000021315485,0.000029634091,0.0000059874988,0.8425328,0.0003764124,0.15471023,0.0021734892,0.00002062794],"about_ca_topic_score_codex":0.004267357,"about_ca_topic_score_gemma":0.004388541,"teacher_disagreement_score":0.0075368723,"about_ca_system_score_codex":0.0017812873,"about_ca_system_score_gemma":0.0019160167,"threshold_uncertainty_score":0.039859295},"labels":[],"label_agreement":null},{"id":"W1589662877","doi":"10.5772/9149","title":"Fuzzy System with Positive and Negative Rules","year":2010,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fuzzy logic; Computer science; Artificial intelligence","score_opus":0.005503985490406825,"score_gpt":0.180494299935262,"score_spread":0.1749903144448552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589662877","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.01833405,0.0019600433,0.9429444,0.0005278893,0.0005972136,0.00017680642,0.00023819398,0.001294376,0.033926997],"genre_scores_gemma":[0.3874023,0.0017750837,0.56471694,0.0005913479,0.00042995883,0.00030540314,0.00060332153,0.00009699206,0.0440786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988078,0.00021685449,0.00011738743,0.00030305743,0.00049181224,0.000063048756],"domain_scores_gemma":[0.9992083,0.00036305658,0.000043692195,0.00010066695,0.00025690006,0.000027379945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014200195,0.00057589577,0.0008291952,0.0005947361,0.0009320346,0.00230137,0.0014284232,0.0013029061,0.0057264958],"category_scores_gemma":[0.002887101,0.00032092276,0.0007718936,0.0005790714,0.0009637801,0.001647875,0.00090549316,0.0011540508,0.002426736],"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.0005071513,0.00019468175,0.0022287692,0.000868522,0.00017955358,0.0020186645,0.0008352474,0.0816339,0.030340333,0.41500685,0.0146836955,0.45150256],"study_design_scores_gemma":[0.0001511418,0.0002561676,0.0010487078,0.00022737158,0.00022647346,0.0019313539,0.000113192415,0.68362767,0.022634165,0.18743789,0.10220643,0.00013937437],"about_ca_topic_score_codex":0.0014106056,"about_ca_topic_score_gemma":0.0012790461,"teacher_disagreement_score":0.0057264958,"about_ca_system_score_codex":0.0004422307,"about_ca_system_score_gemma":0.00069202017,"threshold_uncertainty_score":0.019156992},"labels":[],"label_agreement":null},{"id":"W1591760165","doi":"10.1023/a:1013943418833","title":"Model Selection for Small Sample Regression","year":2002,"lang":"en","type":"article","venue":"Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":125,"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":"Overfitting; Estimator; Generalization; Model selection; Generalization error; Mathematics; Covariance matrix; Artificial intelligence; Selection (genetic algorithm); Linear regression; Applied mathematics; Regression; Sample size determination; Computer science; Statistics; Artificial neural network","score_opus":0.05444036630139729,"score_gpt":0.265644620019226,"score_spread":0.21120425371782872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591760165","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.0028220206,0.0006377593,0.9950647,0.00027109912,0.00007703193,0.000045088917,0.000121072255,0.0005798171,0.00038140462],"genre_scores_gemma":[0.34190723,0.002696171,0.6346595,0.00061664305,0.00094957853,0.0015066261,0.0031542284,0.001440692,0.0130693475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956636,0.003182198,0.00013765848,0.00044553308,0.00043728962,0.00013377392],"domain_scores_gemma":[0.97492653,0.021880837,0.00051858375,0.0014858404,0.0009662104,0.00022196067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008449601,0.0014935462,0.0030420115,0.0014545323,0.00086238584,0.0014058602,0.0025297825,0.0016980747,0.005845841],"category_scores_gemma":[0.035715073,0.0013706987,0.001781841,0.0015259258,0.0009505574,0.0021008945,0.0014863188,0.0035545724,0.0023279907],"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.0007737982,0.00030050104,0.0031670404,0.000709627,0.00094271294,0.0004681339,0.00012381669,0.5831216,0.0034227937,0.07582723,0.022616088,0.3085266],"study_design_scores_gemma":[0.00004056881,0.00003322147,0.0002507144,0.000012537632,0.00003964151,0.000027512371,0.000006297491,0.97188765,0.00046019157,0.026058247,0.0011739059,0.000009518382],"about_ca_topic_score_codex":0.0029534989,"about_ca_topic_score_gemma":0.0031369436,"teacher_disagreement_score":0.008449601,"about_ca_system_score_codex":0.0007939163,"about_ca_system_score_gemma":0.0012823982,"threshold_uncertainty_score":0.044686258},"labels":[],"label_agreement":null},{"id":"W1851653583","doi":"10.1007/s10994-015-5535-7","title":"Learning to identify relevant studies for systematic reviews using random forest and external information","year":2015,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":98,"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":"Random forest; Computer science; Heuristics; Machine learning; Classifier (UML); Artificial intelligence; Cluster analysis; Systematic review; Class (philosophy); Recall; USable; Task (project management); Data mining; Information retrieval; Natural language processing; World Wide Web","score_opus":0.09096737967275106,"score_gpt":0.3815705795832492,"score_spread":0.2906031999104981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851653583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03310554,0.16494519,0.7132946,0.0068829292,0.0017515268,0.039186694,0.032317564,0.0050426465,0.0034733538],"genre_scores_gemma":[0.21653701,0.017941806,0.70855886,0.0022567804,0.0010180284,0.036964625,0.015520543,0.00035808174,0.0008442601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.8165774,0.1079019,0.04521941,0.014417081,0.014983502,0.00090068474],"domain_scores_gemma":[0.34864002,0.5865281,0.030300433,0.018857133,0.014052448,0.0016218522],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.18498945,0.0057532187,0.01757909,0.046520807,0.0023544577,0.0066366727,0.005025201,0.0041014967,0.0075458516],"category_scores_gemma":[0.48406565,0.0022920729,0.024968829,0.017927995,0.002084471,0.007863043,0.005558532,0.0042118067,0.0016854977],"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.0047772657,0.00093372643,0.025025215,0.26357883,0.08095103,0.0010028486,0.0017285493,0.021831091,0.0028123,0.008031781,0.025113551,0.5642139],"study_design_scores_gemma":[0.011127799,0.004142092,0.018788556,0.12499877,0.3188915,0.0020451925,0.0012871496,0.2671984,0.00754222,0.19712141,0.046058547,0.0007983935],"about_ca_topic_score_codex":0.0030954517,"about_ca_topic_score_gemma":0.00919322,"teacher_disagreement_score":0.81501055,"about_ca_system_score_codex":0.0033991751,"about_ca_system_score_gemma":0.012374935,"threshold_uncertainty_score":0.9783294},"labels":[],"label_agreement":null},{"id":"W1964505066","doi":"10.1007/s10994-008-5087-1","title":"Guest editor’s introduction: special issue on inductive transfer learning","year":2008,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Inductive transfer; Computer science; Transfer of learning; Multi-task learning; Artificial intelligence; Generalization; Task (project management); Heuristics; Machine learning; Representation (politics); Similarity (geometry); Transfer of training; Instance-based learning; Sequence learning; Active learning (machine learning); Robot learning; Knowledge management; Mathematics","score_opus":0.008890312988525221,"score_gpt":0.2275228686149516,"score_spread":0.2186325556264264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964505066","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007688312,0.0031280548,0.0012700388,0.03169038,0.9622361,0.000012921795,0.00007140413,0.00009292405,0.0014213644],"genre_scores_gemma":[0.00095543027,0.0023127291,0.000759431,0.0151221715,0.96872073,0.00002435492,0.00008772082,0.00014139863,0.011876033],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723405,0.0005446592,0.0004009317,0.00054864556,0.0010628288,0.00020885034],"domain_scores_gemma":[0.98130244,0.0050378726,0.0012645819,0.0010383856,0.0094873775,0.0018694372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005073758,0.0022003937,0.0028331694,0.003228454,0.0015562219,0.0042591654,0.0028228585,0.0061847544,0.03294037],"category_scores_gemma":[0.021829449,0.0008742107,0.0019204901,0.0015134253,0.0012549321,0.0036483712,0.0017777779,0.010948987,0.018386796],"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.00003544115,0.000014801315,0.00006269522,0.00014435124,0.000016509697,0.00006660386,0.0000047504777,0.000047297133,0.00011269061,0.00036246647,0.9885852,0.010547235],"study_design_scores_gemma":[0.000052328523,0.00005700917,0.0008590209,0.00026256774,0.000070103546,0.0005065184,0.000021789594,0.00079851726,0.0004554021,0.002873141,0.99400747,0.000036231708],"about_ca_topic_score_codex":0.0006132708,"about_ca_topic_score_gemma":0.0019097243,"teacher_disagreement_score":0.03294037,"about_ca_system_score_codex":0.0011487199,"about_ca_system_score_gemma":0.0014215432,"threshold_uncertainty_score":0.11019647},"labels":[],"label_agreement":null},{"id":"W1970842225","doi":"10.1007/s10994-013-5336-9","title":"Learning semantic representations of objects and their parts","year":2013,"lang":"en","type":"article","venue":"Machine Learning","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Agence Nationale de la Recherche; Compute Canada; Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research","keywords":"Computer science; WordNet; Object (grammar); Embedding; Artificial intelligence; Image retrieval; Annotation; Set (abstract data type); Image (mathematics); Information retrieval; Automatic image annotation; Learning object; Cognitive neuroscience of visual object recognition; Machine learning; Pattern recognition (psychology)","score_opus":0.01081827026464842,"score_gpt":0.2673789469826173,"score_spread":0.2565606767179689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970842225","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.0902808,0.0018226913,0.898594,0.00078095496,0.0002476584,0.00017228675,0.0018131136,0.0028119972,0.003476427],"genre_scores_gemma":[0.6444193,0.0026283176,0.3397652,0.0004077421,0.00024684038,0.00025519988,0.007942435,0.00023959672,0.0040954277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994468,0.000088641704,0.000042859094,0.00021171343,0.0001448637,0.000065105785],"domain_scores_gemma":[0.9993826,0.00020182613,0.0000875429,0.0001614444,0.00012829363,0.000038234593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065921806,0.0011944353,0.0010357196,0.002479229,0.0004025205,0.0017055552,0.0013426092,0.0017599998,0.0022841154],"category_scores_gemma":[0.0028426514,0.00046483515,0.0014401309,0.0027302308,0.0008280452,0.004841204,0.0012938831,0.001498839,0.0010501532],"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.00073610264,0.0005392164,0.005690822,0.0006019238,0.0002891729,0.00037736754,0.0003862725,0.038270693,0.036760524,0.039324127,0.01768268,0.859341],"study_design_scores_gemma":[0.00009819605,0.0003346434,0.004449733,0.00022370694,0.00036513046,0.00058757147,0.0006657404,0.80434656,0.017423427,0.15936974,0.012073921,0.00006166514],"about_ca_topic_score_codex":0.0034399228,"about_ca_topic_score_gemma":0.0038292005,"teacher_disagreement_score":0.0034399228,"about_ca_system_score_codex":0.0007351899,"about_ca_system_score_gemma":0.0010054312,"threshold_uncertainty_score":0.0076411366},"labels":[],"label_agreement":null},{"id":"W1973974006","doi":"10.1007/s10994-014-5435-2","title":"Asymptotic stability of equilibrium points of mean shift algorithm","year":2014,"lang":"en","type":"article","venue":"Machine Learning","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Lyapunov function; Mathematics; Equilibrium point; Stationary point; Cluster analysis; Stability theory; Function (biology); Algorithm; Mathematical optimization; Applied mathematics; Nonlinear system; Mathematical analysis; Statistics; Differential equation","score_opus":0.008805442501923695,"score_gpt":0.23631504181872012,"score_spread":0.22750959931679643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973974006","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.39316267,0.0013165454,0.5849793,0.001346619,0.00013293503,0.00011080678,0.0002149111,0.00042442646,0.01831184],"genre_scores_gemma":[0.966865,0.0005207487,0.024456697,0.000123227,0.000095497366,0.00018304281,0.00024674623,0.00016792565,0.007341062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.0002925196,0.000029676807,0.00016730267,0.00019037593,0.00013664746],"domain_scores_gemma":[0.99490744,0.0029209994,0.00047029584,0.0002484742,0.0011259142,0.00032694757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019947782,0.00073832157,0.001191869,0.0017553329,0.0014336647,0.0023517993,0.0017307552,0.0015005342,0.0045056115],"category_scores_gemma":[0.01583436,0.0005550608,0.000686969,0.00083838357,0.0025525277,0.0025085125,0.0029027024,0.0015046978,0.00081911025],"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.0006395006,0.00012632026,0.0051200343,0.00031692453,0.0001978626,0.00021993258,0.0007659421,0.29307088,0.013868369,0.6447153,0.004137719,0.036821153],"study_design_scores_gemma":[0.00003318207,0.000076499295,0.0009901199,0.000029477918,0.000017440207,0.000054162167,0.000100763864,0.7718994,0.0015814957,0.2243942,0.0007895885,0.000033691114],"about_ca_topic_score_codex":0.0033424369,"about_ca_topic_score_gemma":0.0016761634,"teacher_disagreement_score":0.0045056115,"about_ca_system_score_codex":0.0016188695,"about_ca_system_score_gemma":0.0016013226,"threshold_uncertainty_score":0.015072763},"labels":[],"label_agreement":null},{"id":"W1987756646","doi":"10.1007/s10994-009-5151-5","title":"A co-classification approach to learning from multilingual corpora","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Categorization; Artificial intelligence; Boosting (machine learning); Regularization (linguistics); Natural language processing; Benchmarking; Consistency (knowledge bases); Text categorization; Machine learning","score_opus":0.02645328759020278,"score_gpt":0.2968939080229041,"score_spread":0.27044062043270134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987756646","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.0080079,0.0017579424,0.979044,0.0007989653,0.00052453764,0.00030842036,0.0010738048,0.0032097616,0.005274647],"genre_scores_gemma":[0.13062905,0.0014225852,0.83797413,0.0006938911,0.00087115937,0.0011307513,0.008809052,0.0009248661,0.017544473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98922604,0.003962787,0.0010183395,0.0026877576,0.0025744932,0.00053063664],"domain_scores_gemma":[0.97193897,0.013269096,0.0008657626,0.0062672673,0.0071126027,0.00054638175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008427502,0.0016713088,0.0023265514,0.011195211,0.0034681763,0.0052818297,0.0046775984,0.0032678468,0.0062615057],"category_scores_gemma":[0.02449719,0.00089439884,0.002709803,0.013345106,0.0015800376,0.008500831,0.0056246673,0.004708035,0.00577611],"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.000357585,0.000728891,0.004864538,0.00045603243,0.0005209795,0.00041917549,0.0005801214,0.009186373,0.0065309834,0.021546522,0.030353462,0.9244554],"study_design_scores_gemma":[0.00011871718,0.00028605916,0.0045628957,0.00029870583,0.0007444952,0.0013311305,0.0009359181,0.78175753,0.022866204,0.1128578,0.07400073,0.00023975014],"about_ca_topic_score_codex":0.0070183952,"about_ca_topic_score_gemma":0.01559406,"teacher_disagreement_score":0.011195211,"about_ca_system_score_codex":0.0013975591,"about_ca_system_score_gemma":0.0033589723,"threshold_uncertainty_score":0.044569433},"labels":[],"label_agreement":null},{"id":"W1992860510","doi":"10.1007/s10994-014-5446-z","title":"Adaptive Euclidean maps for histograms: generalized Aitchison embeddings","year":2014,"lang":"en","type":"article","venue":"Machine Learning","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology; McGill University","keywords":"Mahalanobis distance; Simplex; Euclidean space; Metric (unit); Euclidean geometry; Euclidean distance; Artificial intelligence; Metric space; Histogram; Mathematics; Computer science; Simple (philosophy); Pattern recognition (psychology); Machine learning; Combinatorics; Discrete mathematics; Image (mathematics)","score_opus":0.015586888487415388,"score_gpt":0.2740671935572671,"score_spread":0.2584803050698517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992860510","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.016390245,0.00046177034,0.9802356,0.00020619272,0.00009240234,0.0000387503,0.0001929069,0.00032298802,0.002059186],"genre_scores_gemma":[0.509921,0.0017923054,0.4756758,0.00030081448,0.0002885684,0.00021007155,0.0012544574,0.00044212333,0.010114766],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943584,0.00019253054,0.00003127338,0.00014189843,0.00015083243,0.000047651196],"domain_scores_gemma":[0.9985763,0.00053338945,0.000118837655,0.0003624999,0.00030693933,0.000102107675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000866667,0.0006952613,0.00074901205,0.0012943168,0.00032149386,0.0013579974,0.0014995293,0.0012359145,0.0041120886],"category_scores_gemma":[0.0047140294,0.00037196,0.0005767739,0.0018434136,0.0009654325,0.0032435143,0.0016817574,0.001941497,0.0014656466],"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.00039753094,0.0001958073,0.0010770902,0.00029762182,0.00006442541,0.000094482355,0.00019110514,0.1500828,0.013845456,0.26594862,0.009968085,0.55783695],"study_design_scores_gemma":[0.000024924027,0.00009530022,0.0005370068,0.000028632498,0.00001599162,0.00014719609,0.00006498254,0.8600649,0.0029454313,0.13112332,0.0049197427,0.000032616805],"about_ca_topic_score_codex":0.0017125509,"about_ca_topic_score_gemma":0.0012954898,"teacher_disagreement_score":0.0041120886,"about_ca_system_score_codex":0.000593481,"about_ca_system_score_gemma":0.00053572515,"threshold_uncertainty_score":0.013756335},"labels":[],"label_agreement":null},{"id":"W2000334459","doi":"10.1007/s10994-006-8366-8","title":"Learning decomposable markov networks in pseudo-independent domains with local evaluation","year":2006,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graphical model; Inference; Computer science; Domain (mathematical analysis); Focus (optics); Probabilistic logic; Approximate inference; Theoretical computer science; Markov chain; Artificial intelligence; Algorithm; Bayesian network; Computation; Machine learning; Mathematics","score_opus":0.008028931723578174,"score_gpt":0.23737798604925192,"score_spread":0.22934905432567373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000334459","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.032635882,0.00036692107,0.9650734,0.0005246812,0.000018643468,0.00005011463,0.00014433103,0.00021828155,0.00096774544],"genre_scores_gemma":[0.7528954,0.00081754854,0.23957837,0.00035173827,0.00016788288,0.000538541,0.001115909,0.00021994903,0.004314689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957522,0.0026061365,0.00017099643,0.00079996994,0.00041415013,0.00025652253],"domain_scores_gemma":[0.9384453,0.05593957,0.0019903067,0.0015704739,0.0011507872,0.00090351736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008420678,0.001592951,0.0032164794,0.0026231743,0.0011387488,0.0027412234,0.0036857126,0.0035144528,0.0037434888],"category_scores_gemma":[0.040692322,0.0020290667,0.0015018263,0.0021137553,0.004379502,0.008935016,0.004828807,0.0042342646,0.00045133152],"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.00022673873,0.00010592143,0.0011229794,0.0001270363,0.0000792332,0.0001029202,0.00013379322,0.81968963,0.00027113713,0.15565777,0.0008333496,0.02164946],"study_design_scores_gemma":[0.000014151382,0.000010780639,0.00005273413,0.000009302519,0.000006756067,0.0000061832593,0.000006459269,0.8921222,0.00007647246,0.10761986,0.00006903153,0.0000060971806],"about_ca_topic_score_codex":0.0068675815,"about_ca_topic_score_gemma":0.009808881,"teacher_disagreement_score":0.008420678,"about_ca_system_score_codex":0.003338674,"about_ca_system_score_gemma":0.0021104459,"threshold_uncertainty_score":0.044533312},"labels":[],"label_agreement":null},{"id":"W2006330826","doi":"10.1007/s10994-011-5254-7","title":"Model selection in reinforcement learning","year":2011,"lang":"en","type":"article","venue":"Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":44,"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":"Reinforcement learning; Mathematics; Estimator; Oracle; Bellman equation; Function (biology); Regularization (linguistics); Countable set; Sequence (biology); Combinatorics; Rate of convergence; Discrete mathematics; Mathematical optimization; Computer science; Artificial intelligence; Statistics","score_opus":0.03659510899503107,"score_gpt":0.24580997705280483,"score_spread":0.20921486805777376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006330826","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.012220145,0.0020213109,0.9801543,0.0010141563,0.00014141166,0.000038213548,0.000033490716,0.00020341306,0.0041735917],"genre_scores_gemma":[0.849001,0.0014213797,0.13946238,0.00045874843,0.0003252094,0.0003296143,0.0001346998,0.0001556336,0.0087113585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980781,0.0013385181,0.00005620794,0.00019279431,0.00024473827,0.00008965623],"domain_scores_gemma":[0.9912907,0.0077144084,0.00024140437,0.00025223292,0.00036835176,0.00013287444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030007774,0.00081852224,0.0019548861,0.0006059599,0.0004927586,0.0013216038,0.0015054166,0.0018147297,0.0036415898],"category_scores_gemma":[0.013706853,0.00077420194,0.00061952154,0.0007234466,0.0019986625,0.0020152463,0.0012693251,0.0023956492,0.00044267968],"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.00009259565,0.0000693143,0.0006326678,0.00013829934,0.000082804865,0.00007131924,0.00006421772,0.8254107,0.00031442178,0.12656851,0.0024449916,0.044110075],"study_design_scores_gemma":[0.000018164917,0.000014721206,0.000045204397,0.000007917492,0.0000074739883,0.00000790178,0.0000033212275,0.94519067,0.00009519334,0.054198172,0.00040718156,0.000004069874],"about_ca_topic_score_codex":0.0032973285,"about_ca_topic_score_gemma":0.0022385558,"teacher_disagreement_score":0.0036415898,"about_ca_system_score_codex":0.0013177665,"about_ca_system_score_gemma":0.0008361903,"threshold_uncertainty_score":0.015869856},"labels":[],"label_agreement":null},{"id":"W2013023084","doi":"10.1007/s10994-013-5371-6","title":"Beam search algorithms for multilabel learning","year":2013,"lang":"en","type":"article","venue":"Machine Learning","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":90,"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":"Inference; Beam search; Computer science; Machine learning; Artificial intelligence; Probabilistic logic; Classifier (UML); Task (project management); Range (aeronautics); Algorithm; Search algorithm","score_opus":0.031059016798618035,"score_gpt":0.28921241142287696,"score_spread":0.2581533946242589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013023084","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.0016772706,0.00057394005,0.9951504,0.00020986296,0.00005212282,0.00004868135,0.00014270634,0.0008877399,0.0012572904],"genre_scores_gemma":[0.046756677,0.0006233525,0.94415843,0.00055882393,0.00018173318,0.0005935036,0.0012726204,0.00071187323,0.005142992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995754,0.0023786381,0.0002037212,0.0006267076,0.00076448405,0.00027249422],"domain_scores_gemma":[0.98785365,0.008808124,0.00035927558,0.0015698359,0.0011549005,0.00025427592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006210132,0.0015637848,0.0036749735,0.0035723941,0.0025256178,0.002311798,0.004622538,0.0031445946,0.01566523],"category_scores_gemma":[0.022685315,0.0014542775,0.0018059209,0.0060476684,0.002337182,0.0058276122,0.004292376,0.0048211487,0.0057156626],"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.0006126372,0.00038013145,0.0010342291,0.0005225143,0.00026460752,0.00008997994,0.0003410903,0.16989568,0.0021981895,0.2318424,0.04309098,0.54972756],"study_design_scores_gemma":[0.00013559639,0.00007144243,0.0001456021,0.00006759887,0.000044930774,0.000053188043,0.000058288093,0.5778378,0.0011835392,0.41402537,0.0063446052,0.000031924134],"about_ca_topic_score_codex":0.0042951196,"about_ca_topic_score_gemma":0.007780662,"teacher_disagreement_score":0.01566523,"about_ca_system_score_codex":0.0015793339,"about_ca_system_score_gemma":0.002321513,"threshold_uncertainty_score":0.052405417},"labels":[],"label_agreement":null},{"id":"W2013029345","doi":"10.1007/s10994-009-5137-3","title":"Learning the set covering machine by bound minimization and margin-sparsity trade-off","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"VC dimension; Classifier (UML); Margin (machine learning); Computer science; Minification; Upper and lower bounds; Artificial intelligence; Machine learning; Dimension (graph theory); Algorithm; Structural risk minimization; Mathematics; Mathematical optimization; Support vector machine; Combinatorics","score_opus":0.007079538754920486,"score_gpt":0.22503493450158998,"score_spread":0.2179553957466695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013029345","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.040941842,0.0013594801,0.95135427,0.0017402448,0.000103851795,0.00006214026,0.0002249525,0.00051692786,0.0036962465],"genre_scores_gemma":[0.6051638,0.0015108375,0.38208827,0.00088586274,0.00070341484,0.0004435352,0.0014501349,0.0007751652,0.006978883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968485,0.0017675677,0.000119300865,0.00046983335,0.0005784165,0.00021635192],"domain_scores_gemma":[0.9796618,0.016548835,0.00074855506,0.001619209,0.000857901,0.0005636451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046707853,0.0015498048,0.004286618,0.0016425351,0.0009806392,0.0025362521,0.00312597,0.0041488926,0.004208766],"category_scores_gemma":[0.030311609,0.0013788805,0.0012812446,0.0025985613,0.00251898,0.0066158567,0.0042145234,0.0033752373,0.0008752925],"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.00046390083,0.00023392784,0.0018473142,0.0003552908,0.00014305777,0.00012352303,0.00019448268,0.725378,0.001798129,0.11245103,0.01439516,0.1426162],"study_design_scores_gemma":[0.000019567502,0.000039147155,0.0001343626,0.000018966704,0.000009681602,0.000036478585,0.000012404008,0.9155765,0.00031992767,0.083362356,0.0004616033,0.0000091319525],"about_ca_topic_score_codex":0.0011772498,"about_ca_topic_score_gemma":0.0011289283,"teacher_disagreement_score":0.0046707853,"about_ca_system_score_codex":0.0014368081,"about_ca_system_score_gemma":0.0010174637,"threshold_uncertainty_score":0.024701774},"labels":[],"label_agreement":null},{"id":"W2014398373","doi":"10.1007/s10994-006-0477-8","title":"Bidding agents for online auctions with hidden bids","year":2006,"lang":"en","type":"article","venue":"Machine Learning","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Common value auction; Bidding; Valuation (finance); Computer science; Combinatorial auction; Artificial intelligence; Machine learning; Ex-ante; Econometrics; Mathematical optimization; Microeconomics; Economics; Mathematics","score_opus":0.078163754291518,"score_gpt":0.38805502070464504,"score_spread":0.30989126641312703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014398373","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.041717965,0.00043108215,0.95018524,0.0009188503,0.000116846335,0.00011885018,0.000118570446,0.00019537182,0.006197164],"genre_scores_gemma":[0.7610824,0.0006761841,0.21776128,0.00025696572,0.00030087953,0.00043610614,0.00032490297,0.00022493249,0.018936347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637187,0.0022225424,0.00020906975,0.00037717406,0.0005058232,0.00031354692],"domain_scores_gemma":[0.9783149,0.017085683,0.0012798267,0.0015670083,0.0010642736,0.0006882808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00736086,0.0011129307,0.0031392018,0.000798811,0.0012619171,0.005869811,0.004087396,0.0031293244,0.00856029],"category_scores_gemma":[0.033519395,0.0017231972,0.0013212966,0.0013931812,0.0025630593,0.010762147,0.0027910168,0.004382628,0.0011024515],"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.0005187676,0.00027158033,0.00068942964,0.00026483706,0.00010683324,0.00022868189,0.00035596077,0.22860724,0.00068246276,0.73511547,0.0043198885,0.028838808],"study_design_scores_gemma":[0.00007001768,0.000022494112,0.000061924,0.000014251122,0.000014639809,0.000032760156,0.00002678479,0.6239541,0.000108588945,0.37513834,0.0005426588,0.000013337733],"about_ca_topic_score_codex":0.0014838518,"about_ca_topic_score_gemma":0.0016901538,"teacher_disagreement_score":0.00856029,"about_ca_system_score_codex":0.0014428061,"about_ca_system_score_gemma":0.0023198845,"threshold_uncertainty_score":0.03892839},"labels":[],"label_agreement":null},{"id":"W2018288672","doi":"10.1007/s10994-006-9713-5","title":"Slow emergence of cooperation for win-stay lose-shift on trees","year":2006,"lang":"en","type":"article","venue":"Machine Learning","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Emerging Frontiers; Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Exponential growth; Graph; Bounded function; Exponential function; Convergence (economics); Computer science; Dilemma; Mathematics; Discrete mathematics; Theoretical computer science; Economics","score_opus":0.013706365712844998,"score_gpt":0.2847747342946952,"score_spread":0.2710683685818502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018288672","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.89911824,0.0002645305,0.0920673,0.0010350734,0.00006371981,0.00006354613,0.00014072133,0.0002404043,0.0070064603],"genre_scores_gemma":[0.9926426,0.00007396154,0.005466001,0.00007173147,0.000014541451,0.00004618338,0.00006660144,0.00004572275,0.0015726389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927336,0.000297685,0.000025697547,0.00011394462,0.00009371085,0.00019556815],"domain_scores_gemma":[0.9854374,0.010467171,0.00095121656,0.001094271,0.0006955036,0.0013543883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019629372,0.00028769768,0.0012273834,0.0007724705,0.0014195159,0.001353334,0.0010308404,0.001675968,0.0051697763],"category_scores_gemma":[0.019027432,0.00044968823,0.0007212699,0.00044464265,0.0016316825,0.0022598945,0.0013345559,0.0024678223,0.0005718755],"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.00084532425,0.00039730791,0.013748834,0.00046120243,0.0002674969,0.00079743034,0.0018797232,0.22039501,0.032864537,0.65496796,0.01813354,0.055241626],"study_design_scores_gemma":[0.00007550187,0.00012877028,0.004566749,0.000029159772,0.000046591227,0.00025032286,0.00039970802,0.5739544,0.001701697,0.41751468,0.0012931251,0.000039250666],"about_ca_topic_score_codex":0.0013280318,"about_ca_topic_score_gemma":0.0018041615,"teacher_disagreement_score":0.0051697763,"about_ca_system_score_codex":0.0008900503,"about_ca_system_score_gemma":0.000738074,"threshold_uncertainty_score":0.017294645},"labels":[],"label_agreement":null},{"id":"W2023719154","doi":"10.1007/s10994-012-5308-5","title":"Learning directed relational models with recursive dependencies","year":2012,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Statistical relational learning; Computer science; Markov blanket; Theoretical computer science; Graphical model; Probabilistic logic; Inductive logic programming; Predicate (mathematical logic); Bayesian network; Relational database; Artificial intelligence; Machine learning; Markov chain; Markov model; Data mining; Variable-order Markov model; Programming language","score_opus":0.027453026784250344,"score_gpt":0.234085874637636,"score_spread":0.20663284785338565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023719154","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.0240562,0.00025822467,0.97305095,0.0005270496,0.00001728589,0.00004050944,0.00034519003,0.0004356143,0.0012690673],"genre_scores_gemma":[0.60171354,0.00072565716,0.3899308,0.0004691461,0.00009547143,0.0003086491,0.002385218,0.00015342915,0.004218083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972351,0.0013999045,0.00014156464,0.00064726506,0.00044314683,0.00013291641],"domain_scores_gemma":[0.98424006,0.013410584,0.0008134151,0.0007914313,0.00053293374,0.00021161496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035591135,0.0008626604,0.0010613768,0.0016475212,0.00055639475,0.0019557665,0.0019823932,0.001626652,0.002594284],"category_scores_gemma":[0.018852321,0.0011112611,0.0015266278,0.0017333587,0.00137469,0.006063902,0.0019487166,0.0029093358,0.0005309547],"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.00008780753,0.00011258035,0.00296682,0.00012872119,0.00009483236,0.00018770165,0.00028968626,0.6953015,0.0005117654,0.22590135,0.0023978404,0.0720193],"study_design_scores_gemma":[0.0000087978915,0.000009397175,0.000099784345,0.000009376828,0.0000100824755,0.000016429918,0.000009648726,0.8464488,0.00015386372,0.15257828,0.00064926577,0.0000062215872],"about_ca_topic_score_codex":0.006908384,"about_ca_topic_score_gemma":0.014383391,"teacher_disagreement_score":0.006908384,"about_ca_system_score_codex":0.0021366412,"about_ca_system_score_gemma":0.0012005703,"threshold_uncertainty_score":0.01882261},"labels":[],"label_agreement":null},{"id":"W2026798797","doi":"10.1007/s10994-005-0464-5","title":"Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning","year":2005,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Constraint (computer-aided design); Heuristic; Class (philosophy); Mathematics; Discrete mathematics; Boolean function; Combinatorics; Artificial intelligence; Computer science; Mathematical optimization","score_opus":0.01560519044351934,"score_gpt":0.25798942077620063,"score_spread":0.24238423033268128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026798797","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.0058840546,0.00034367375,0.9890752,0.0006092716,0.00006753189,0.000052658983,0.000048339745,0.00015688073,0.0037624459],"genre_scores_gemma":[0.38243678,0.0010520645,0.6034563,0.00041851588,0.00041894874,0.0006713562,0.00029136895,0.00064772094,0.010606922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97237587,0.019889647,0.00091720076,0.0019287801,0.00406115,0.00082735444],"domain_scores_gemma":[0.82345194,0.15540703,0.004288143,0.008716915,0.0066553904,0.0014805702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038178634,0.0021418994,0.004571722,0.0026720974,0.0017984529,0.004081459,0.0048694964,0.0053212205,0.006695971],"category_scores_gemma":[0.1450115,0.0014051602,0.0014193165,0.0042163585,0.007187663,0.008157399,0.0054326006,0.0046510664,0.0015301906],"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.00019589231,0.000110396744,0.00072707137,0.00024357162,0.00007905539,0.00008743585,0.00029715942,0.3001067,0.00028108674,0.63097686,0.0045594936,0.062335156],"study_design_scores_gemma":[0.000030931176,0.000042320742,0.000087717126,0.000049499344,0.000014365523,0.00003951158,0.00003133837,0.43334544,0.000369781,0.5648978,0.0010714034,0.0000199206],"about_ca_topic_score_codex":0.0015356943,"about_ca_topic_score_gemma":0.0011730688,"teacher_disagreement_score":0.038178634,"about_ca_system_score_codex":0.0032008733,"about_ca_system_score_gemma":0.003367384,"threshold_uncertainty_score":0.20191038},"labels":[],"label_agreement":null},{"id":"W2026829590","doi":"10.1007/s10994-008-5091-5","title":"Effective short-term opponent exploitation in simplified poker","year":2008,"lang":"en","type":"article","venue":"Machine Learning","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Nash equilibrium; Fictitious play; Computer science; Adversary; Best response; Bayesian game; Context (archaeology); Set (abstract data type); Convergence (economics); Game theory; Term (time); Mathematical economics; Repeated game; Artificial intelligence; Mathematical optimization; Mathematics; Computer security; Economics","score_opus":0.03764273235022859,"score_gpt":0.2966816643115067,"score_spread":0.25903893196127814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026829590","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.7528211,0.0001538622,0.22551578,0.00031530848,0.0000668274,0.000050186434,0.000031366897,0.0002543229,0.02079116],"genre_scores_gemma":[0.9895489,0.000022651891,0.005889142,0.00001849998,0.0000057802076,0.000013454557,0.000016047758,0.0000225275,0.0044628857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.00011730012,0.000011864519,0.00004165976,0.00006757515,0.00007527453],"domain_scores_gemma":[0.9985185,0.00091829477,0.000101275036,0.00016544879,0.00009239753,0.00020412302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007330627,0.00037630985,0.00084672385,0.00028702314,0.0006412342,0.00086263486,0.0009548854,0.0009915942,0.004941644],"category_scores_gemma":[0.004753449,0.00036021537,0.00029895236,0.00021784539,0.0010179752,0.0015597118,0.0016007052,0.0011934435,0.00036884414],"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.001437459,0.00054173527,0.0038418998,0.00016745788,0.00011980179,0.00082603894,0.0007012197,0.65805566,0.016043665,0.2392874,0.0027780114,0.07619958],"study_design_scores_gemma":[0.000033153672,0.00009888829,0.00070099626,0.0000050250515,0.00001023978,0.000101650025,0.000055762972,0.94651717,0.00089919963,0.051246963,0.00032017997,0.00001075629],"about_ca_topic_score_codex":0.00097139704,"about_ca_topic_score_gemma":0.0012137301,"teacher_disagreement_score":0.004941644,"about_ca_system_score_codex":0.0003931944,"about_ca_system_score_gemma":0.0005922136,"threshold_uncertainty_score":0.016531467},"labels":[],"label_agreement":null},{"id":"W2031056773","doi":"10.1007/s10994-012-5316-5","title":"Quantum speed-up for unsupervised learning","year":2012,"lang":"en","type":"article","venue":"Machine Learning","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":213,"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; Cluster analysis; Unsupervised learning; Initialization; Graph; Speedup; Quantum; Quantum machine learning; Theoretical computer science; Quantization (signal processing); Algorithm; Artificial intelligence; Quantum algorithm","score_opus":0.016506940666037247,"score_gpt":0.25622023387617643,"score_spread":0.23971329321013918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031056773","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.01755832,0.0005175426,0.96669555,0.0010969549,0.00022332672,0.0000910544,0.00005996415,0.0009594007,0.012797922],"genre_scores_gemma":[0.5421308,0.0008426446,0.44767988,0.0005178084,0.0002541233,0.0003649709,0.00011464316,0.0004928915,0.0076021515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987299,0.00039759604,0.000059691043,0.00023339718,0.0004383524,0.00014108114],"domain_scores_gemma":[0.9959067,0.002450672,0.00016897924,0.0009763507,0.00039402017,0.000103319166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170269,0.00058513356,0.0006674585,0.00062553416,0.0013474636,0.0016625943,0.0012969088,0.0013271536,0.008806804],"category_scores_gemma":[0.008711982,0.00046875703,0.00069252815,0.0007880361,0.0025201389,0.004328451,0.002358315,0.0026124974,0.0013237718],"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.00014815314,0.000073698066,0.00031987744,0.00015743589,0.000034896868,0.00008418702,0.00017897098,0.07619875,0.008401251,0.85334384,0.0042532734,0.056805644],"study_design_scores_gemma":[0.000044486816,0.0000711917,0.00014114333,0.000027049504,0.000017269402,0.00008594446,0.000037066868,0.48569718,0.0077116787,0.4974967,0.008640843,0.000029543211],"about_ca_topic_score_codex":0.00097653456,"about_ca_topic_score_gemma":0.0011915358,"teacher_disagreement_score":0.008806804,"about_ca_system_score_codex":0.001561286,"about_ca_system_score_gemma":0.0011186923,"threshold_uncertainty_score":0.029461682},"labels":[],"label_agreement":null},{"id":"W2032024758","doi":"10.1007/s10994-013-5421-0","title":"Tracking people over time in 19th century Canada for longitudinal analysis","year":2013,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; University of Guelph","funders":"Ontario Ministry of Research and Innovation; Research and Innovation Foundation","keywords":"Tracking (education); Late 19th century; Longitudinal data; Artificial intelligence; Computer science; Psychology; Data mining; Period (music); Art","score_opus":0.04624489143412698,"score_gpt":0.3420139273379866,"score_spread":0.2957690359038596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032024758","genre_codex":"empirical","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.9167041,0.0022942615,0.002851434,0.005073864,0.00020273731,0.0003594556,0.06448273,0.00014440385,0.00788704],"genre_scores_gemma":[0.9658022,0.0017954495,0.004178739,0.0010043121,0.000033176526,0.00035895876,0.014770015,0.00006308866,0.011994181],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774927,0.0002092899,0.00016490421,0.0002633476,0.0007750669,0.0008382197],"domain_scores_gemma":[0.9879027,0.00053411815,0.0008978735,0.00042996032,0.008074002,0.0021613806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00243411,0.0003160579,0.0005090985,0.0035883205,0.0043935063,0.0021646721,0.0022287173,0.0008086679,0.0032939264],"category_scores_gemma":[0.0084227845,0.00040204596,0.0006712087,0.009247007,0.00067295,0.0008773495,0.0018255875,0.0014962758,0.00061159814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012350632,0.00009748647,0.94967926,0.00008497878,0.00011400399,0.000119749275,0.0023520333,0.00057351246,0.00018911171,0.0011862796,0.020592412,0.024887638],"study_design_scores_gemma":[0.000026185517,0.00004609027,0.9737809,0.00023959193,0.000093671595,0.000071960436,0.0078539625,0.0019741526,0.00029101735,0.00025536315,0.015322863,0.000044387773],"about_ca_topic_score_codex":0.9987204,"about_ca_topic_score_gemma":0.9991572,"teacher_disagreement_score":0.040605113,"about_ca_system_score_codex":0.040605113,"about_ca_system_score_gemma":0.1228592,"threshold_uncertainty_score":0.2946121},"labels":[],"label_agreement":null},{"id":"W2037905382","doi":"10.1007/s10994-006-0219-y","title":"Online calibrated forecasts: Memory efficiency versus universality for learning in games","year":2006,"lang":"en","type":"article","venue":"Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; Air Force Office of Scientific Research; Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Fictitious play; Regret; Repeated game; Computer science; Nash equilibrium; Best response; Universality (dynamical systems); Artificial intelligence; Mathematics; Mathematical optimization; Game theory; Mathematical economics; Machine learning","score_opus":0.08089650883186325,"score_gpt":0.4011498157716262,"score_spread":0.32025330693976295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037905382","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.16151768,0.00071509735,0.8291195,0.00199173,0.000117498676,0.00008976673,0.00020089417,0.00052274374,0.00572511],"genre_scores_gemma":[0.9607141,0.000454222,0.036517113,0.00022264107,0.00015673437,0.000085384934,0.00013867118,0.0000855535,0.0016254226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964271,0.0014994782,0.0002643893,0.00089993665,0.00045841583,0.0004506722],"domain_scores_gemma":[0.92169386,0.06099594,0.0045007393,0.009595219,0.00228202,0.00093222986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011310367,0.0013631339,0.0027936897,0.0012533165,0.00081471825,0.0034688509,0.0030593579,0.0026742318,0.0047833556],"category_scores_gemma":[0.10501842,0.000962733,0.00095942325,0.0010568625,0.0027800049,0.012651963,0.0032715,0.0042154198,0.00047404587],"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.0008053826,0.00029713003,0.007166443,0.00029131758,0.0002905363,0.00015430957,0.00043036893,0.50280744,0.001290538,0.3799181,0.0030063295,0.10354208],"study_design_scores_gemma":[0.000055396227,0.00007852103,0.001136813,0.000043981498,0.000043619635,0.000043455046,0.000052605938,0.6946536,0.0009178139,0.3025563,0.00038623466,0.00003162806],"about_ca_topic_score_codex":0.0022553597,"about_ca_topic_score_gemma":0.0023923784,"teacher_disagreement_score":0.011310367,"about_ca_system_score_codex":0.0016331271,"about_ca_system_score_gemma":0.001630426,"threshold_uncertainty_score":0.059815645},"labels":[],"label_agreement":null},{"id":"W2038227658","doi":"10.1007/s10994-005-0913-1","title":"Corpus-based Learning of Analogies and Semantic Relations","year":2005,"lang":"en","type":"article","venue":"Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":178,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Analogy; Noun; Artificial intelligence; Natural language processing; Part of speech; Computer science; Class (philosophy); Meaning (existential); Word (group theory); Set (abstract data type); Semantics (computer science); Mathematics; Linguistics; Psychology","score_opus":0.008477493126515724,"score_gpt":0.25691361684639447,"score_spread":0.24843612371987875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038227658","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.18203826,0.003535895,0.7603718,0.0028147066,0.001257574,0.0005038508,0.006369608,0.0056866524,0.03742158],"genre_scores_gemma":[0.68943554,0.001698102,0.28494895,0.0005088111,0.00042921887,0.0005797418,0.014125313,0.0006382998,0.0076360246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970065,0.0012794461,0.0002220659,0.000867596,0.00054013496,0.00008430841],"domain_scores_gemma":[0.9761973,0.017672593,0.0005741052,0.0032870094,0.001987597,0.00028143838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027279905,0.00096027687,0.0010294336,0.004508838,0.0012963895,0.0033809752,0.0030994127,0.0017826528,0.01754993],"category_scores_gemma":[0.035209935,0.0007643875,0.0012021472,0.004113241,0.0018018717,0.010541384,0.0028922944,0.0038698965,0.002767854],"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.0009873494,0.0010220485,0.0059676482,0.0012338302,0.00046616874,0.0006467959,0.0009009264,0.042453013,0.008203799,0.12233772,0.031081298,0.78469944],"study_design_scores_gemma":[0.00030398357,0.00024406695,0.0030929493,0.00022986425,0.000275379,0.0006520984,0.00053707743,0.6097551,0.00791055,0.3503452,0.026554888,0.000098815115],"about_ca_topic_score_codex":0.0034459792,"about_ca_topic_score_gemma":0.0067517017,"teacher_disagreement_score":0.01754993,"about_ca_system_score_codex":0.0011354722,"about_ca_system_score_gemma":0.0018637255,"threshold_uncertainty_score":0.058710396},"labels":[],"label_agreement":null},{"id":"W2040852548","doi":"10.1007/s10994-007-5043-5","title":"A notion of task relatedness yielding provable multiple-task learning guarantees","year":2008,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":103,"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":"Generalization; Multi-task learning; Computer science; Task (project management); Artificial intelligence; Similarity (geometry); Machine learning; Point (geometry); Domain (mathematical analysis); Variety (cybernetics); Theoretical computer science; Mathematics","score_opus":0.012613177219527812,"score_gpt":0.22340017247581537,"score_spread":0.21078699525628755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040852548","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.012857193,0.00070734427,0.9680093,0.0046120286,0.00034706556,0.00010230749,0.00038382434,0.0021583058,0.010822615],"genre_scores_gemma":[0.6339337,0.0010565288,0.34069738,0.0054650106,0.0024433234,0.0007939923,0.0014829856,0.0023880035,0.011738986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97740227,0.0069378917,0.0012371968,0.0055944957,0.0060827513,0.0027453087],"domain_scores_gemma":[0.8949858,0.061612926,0.0045863222,0.029020803,0.0051707374,0.0046233996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014633301,0.0031073417,0.0044423947,0.0018002146,0.004025043,0.00693081,0.010263713,0.008438602,0.010635252],"category_scores_gemma":[0.09412395,0.0027567097,0.003657799,0.0037666378,0.0071293055,0.026394073,0.021832354,0.021879684,0.0043120217],"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.0017999925,0.000676542,0.0012605612,0.0009137468,0.00022450362,0.00042993226,0.0007821655,0.07264912,0.0082403105,0.796269,0.029015912,0.08773822],"study_design_scores_gemma":[0.00010123356,0.0001069215,0.0001488294,0.000039200346,0.00005254358,0.00019084866,0.000049005812,0.10735889,0.0020390367,0.8871142,0.0027657854,0.000033408414],"about_ca_topic_score_codex":0.0007992115,"about_ca_topic_score_gemma":0.0011728276,"teacher_disagreement_score":0.014633301,"about_ca_system_score_codex":0.0026745088,"about_ca_system_score_gemma":0.0044289706,"threshold_uncertainty_score":0.07738918},"labels":[],"label_agreement":null},{"id":"W2065015368","doi":"10.1007/s10994-010-5179-6","title":"Polynomial regression under arbitrary product distributions","year":2010,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Carnegie Mellon University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Mathematics; Product (mathematics); Polynomial; Degree (music); Discrete mathematics; Noise (video); Gaussian; Simple (philosophy); Distribution (mathematics); Combinatorics; Algorithm; Applied mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.0072890674834150656,"score_gpt":0.24878458362669115,"score_spread":0.24149551614327608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065015368","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.02869634,0.00087774824,0.9593064,0.0016358659,0.00013516986,0.000024863164,0.00016774645,0.00043452834,0.008721332],"genre_scores_gemma":[0.78416944,0.00273829,0.1845352,0.0006029224,0.001179906,0.00013540304,0.0007006095,0.0005591713,0.025379006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675226,0.00164612,0.00010457354,0.0005528657,0.00068686483,0.00025731826],"domain_scores_gemma":[0.9806368,0.013276449,0.0011486061,0.0032591594,0.0012340532,0.00044505153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046352963,0.00094999967,0.0013113011,0.0008442212,0.0005959098,0.0018485201,0.0016546824,0.0012622591,0.0047982195],"category_scores_gemma":[0.03162141,0.00076726783,0.0007782102,0.0018214327,0.0031929838,0.007815405,0.003299763,0.0034973659,0.0016831573],"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.000154402,0.000047825124,0.00063056214,0.00013503268,0.000036342444,0.00010509208,0.00007329442,0.030494902,0.001025649,0.9253451,0.0049828268,0.036968812],"study_design_scores_gemma":[0.000033791377,0.000028810913,0.00025060974,0.000012507056,0.000012263395,0.00013474569,0.000011236117,0.28281832,0.0007947976,0.71346754,0.0024216494,0.000013730604],"about_ca_topic_score_codex":0.0011865676,"about_ca_topic_score_gemma":0.0008377622,"teacher_disagreement_score":0.0047982195,"about_ca_system_score_codex":0.0011798594,"about_ca_system_score_gemma":0.0011124283,"threshold_uncertainty_score":0.02451402},"labels":[],"label_agreement":null},{"id":"W2069150044","doi":"10.1007/s10994-013-5362-7","title":"Modelling relational statistics with Bayes Nets","year":2013,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Semantics (computer science); Bayes' theorem; Class (philosophy); Benchmark (surveying); Approximate Bayesian computation; Function (biology); Artificial intelligence; Theoretical computer science; Machine learning; Bayesian probability; Data mining; Inference; Programming language","score_opus":0.02059995532552589,"score_gpt":0.21840187201107317,"score_spread":0.19780191668554728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069150044","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.003105559,0.0007642786,0.9942781,0.00039328952,0.000036142334,0.000020880148,0.00015177405,0.000115628565,0.0011343785],"genre_scores_gemma":[0.3459965,0.004634084,0.6407197,0.0004577532,0.0005473405,0.00036972557,0.0012510523,0.00018604661,0.005837856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415576,0.0035450973,0.00037319053,0.0007002177,0.0010228099,0.0002029567],"domain_scores_gemma":[0.9690277,0.026951414,0.001717025,0.0010969148,0.000932547,0.00027442648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007940221,0.0011381204,0.0021003296,0.003003623,0.00084161846,0.0049426123,0.0024605948,0.0020692162,0.004710462],"category_scores_gemma":[0.035358436,0.0015954192,0.001955691,0.0033650198,0.002465552,0.007334243,0.0023657265,0.003548069,0.0009756009],"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.00008770481,0.00006462686,0.0016646505,0.00023802133,0.00017682035,0.00015915312,0.0002327478,0.2140248,0.00026570828,0.73766315,0.0015422148,0.043880373],"study_design_scores_gemma":[0.000013609105,0.000008421815,0.00012440223,0.00004385898,0.000028469367,0.000034518904,0.000015614647,0.36722976,0.00011094455,0.63094336,0.0014326299,0.000014445871],"about_ca_topic_score_codex":0.006448136,"about_ca_topic_score_gemma":0.00820823,"teacher_disagreement_score":0.007940221,"about_ca_system_score_codex":0.0018014789,"about_ca_system_score_gemma":0.0017977392,"threshold_uncertainty_score":0.041992366},"labels":[],"label_agreement":null},{"id":"W2073171642","doi":"10.1007/s10994-012-5289-4","title":"Learning graphical models for relational data via lattice search","year":2012,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Statistical relational learning; Graphical model; Relational database; Computer science; Machine learning; Artificial intelligence; Relational calculus; Bayesian network; Relational model; Naive Bayes classifier; Theoretical computer science; Data mining; Support vector machine","score_opus":0.10801632996442037,"score_gpt":0.32518487109788347,"score_spread":0.2171685411334631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073171642","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.004381083,0.00041644645,0.9932005,0.00054864906,0.000020635509,0.000038234648,0.0004004109,0.00046286633,0.00053107046],"genre_scores_gemma":[0.21700738,0.0016390111,0.77502793,0.00046506771,0.0002104581,0.000550563,0.0029867534,0.00031184973,0.0018010547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919714,0.0051862905,0.00038359963,0.00105279,0.0011554485,0.00025048415],"domain_scores_gemma":[0.9513355,0.04220556,0.0018692359,0.0029736517,0.0010531421,0.0005630689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008900071,0.0013330937,0.0037148322,0.0048822793,0.0013465438,0.0046569416,0.004312773,0.0029691025,0.006868301],"category_scores_gemma":[0.058329545,0.0019783776,0.0029435726,0.007225659,0.0032318684,0.011689109,0.0041542077,0.0062934468,0.0020563947],"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.00032598508,0.0003125354,0.0030166623,0.00060214836,0.000303185,0.00022813806,0.0004070877,0.46002367,0.0007454316,0.40646428,0.007113351,0.12045757],"study_design_scores_gemma":[0.000052737625,0.000015588736,0.00008111928,0.000035587815,0.00002149617,0.000043569926,0.000030394212,0.6473343,0.00011929449,0.35147238,0.00077479857,0.000018787885],"about_ca_topic_score_codex":0.007803917,"about_ca_topic_score_gemma":0.01252076,"teacher_disagreement_score":0.008900071,"about_ca_system_score_codex":0.0023757818,"about_ca_system_score_gemma":0.0034034501,"threshold_uncertainty_score":0.047068655},"labels":[],"label_agreement":null},{"id":"W2076167926","doi":"10.1007/s10994-008-5088-0","title":"Inductive transfer with context-sensitive neural networks","year":2008,"lang":"en","type":"article","venue":"Machine Learning","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":"Acadia University","funders":"","keywords":"Computer science; Inductive transfer; Machine learning; Task (project management); Multi-task learning; Artificial intelligence; Transfer of learning; Context (archaeology); Artificial neural network; Encoding (memory); Reduction (mathematics); Robot learning","score_opus":0.017420568659186616,"score_gpt":0.2137613535598668,"score_spread":0.1963407849006802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076167926","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.011600365,0.0005388586,0.98519415,0.00016114608,0.00007700568,0.000049977647,0.000054794673,0.00087084714,0.0014527517],"genre_scores_gemma":[0.677714,0.0007334679,0.30968118,0.0005403023,0.00024721478,0.00034870536,0.0006571542,0.00035550463,0.009722479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928766,0.0002798885,0.000031750795,0.00019174199,0.00014969954,0.00005921034],"domain_scores_gemma":[0.99799347,0.0012536241,0.000077064025,0.00039969364,0.00021490785,0.000061326355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017428144,0.00068006094,0.0011857434,0.0007359595,0.00052949006,0.0007088387,0.0026721216,0.0015747839,0.0030468309],"category_scores_gemma":[0.005335631,0.00051682297,0.0007001578,0.0008589722,0.00093481864,0.002397757,0.0029357125,0.0022362107,0.001137857],"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.00028211472,0.00036370722,0.00087598286,0.00024787415,0.00018999733,0.0001823802,0.00017717706,0.45920733,0.016298238,0.040920597,0.007290031,0.47396445],"study_design_scores_gemma":[0.0000071437794,0.000026002015,0.0001273449,0.000008811191,0.000010528111,0.00003255408,0.000009965438,0.9667909,0.0035781546,0.028752085,0.0006468002,0.000009671859],"about_ca_topic_score_codex":0.0015217665,"about_ca_topic_score_gemma":0.0019659437,"teacher_disagreement_score":0.0030468309,"about_ca_system_score_codex":0.0006238805,"about_ca_system_score_gemma":0.0005844975,"threshold_uncertainty_score":0.010192692},"labels":[],"label_agreement":null},{"id":"W2082021920","doi":"10.1023/b:mach.0000033118.09057.80","title":"Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces","year":2004,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Dimension (graph theory); Clustering high-dimensional data; CURE data clustering algorithm; Mathematics; Quadratic equation; Correlation clustering; Computer science; Constrained clustering; Approximation algorithm; Data stream clustering; Algorithm; Data mining; Pattern recognition (psychology); Artificial intelligence; Combinatorics","score_opus":0.018086759246439765,"score_gpt":0.24490751639547292,"score_spread":0.22682075714903316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082021920","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.0054878145,0.0012711526,0.99012554,0.00045554867,0.000101893405,0.000045361772,0.00008624619,0.0006714699,0.0017549596],"genre_scores_gemma":[0.17057195,0.002013927,0.81367344,0.0006780019,0.0005268273,0.0005087648,0.0010945239,0.00072679354,0.01020576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960841,0.0016427864,0.00019376182,0.00055682065,0.0011657579,0.0003566229],"domain_scores_gemma":[0.9879418,0.007538616,0.00062311045,0.0020177288,0.001406049,0.0004726216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049185487,0.001850116,0.003168558,0.0022607225,0.0015214825,0.0033612093,0.0048559657,0.0027606362,0.0070733973],"category_scores_gemma":[0.02263485,0.0012585747,0.001271353,0.005916768,0.0018272881,0.0057258476,0.0036819864,0.0056383996,0.0032331129],"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.00066875323,0.00045465003,0.001242012,0.0006984206,0.00015159995,0.000086127584,0.0003449535,0.46984896,0.0020891316,0.11089335,0.029775275,0.38374683],"study_design_scores_gemma":[0.00003027989,0.000029848368,0.00014615439,0.000014510479,0.00001556799,0.000033418066,0.00003305334,0.9408546,0.0003282929,0.05680186,0.0017032514,0.0000091229485],"about_ca_topic_score_codex":0.0065651448,"about_ca_topic_score_gemma":0.007394312,"teacher_disagreement_score":0.0070733973,"about_ca_system_score_codex":0.0026921532,"about_ca_system_score_gemma":0.0021911855,"threshold_uncertainty_score":0.026012063},"labels":[],"label_agreement":null},{"id":"W2083002797","doi":"10.1007/s10994-013-5361-8","title":"Alignment based kernel learning with a continuous set of base kernels","year":2013,"lang":"en","type":"article","venue":"Machine Learning","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Kernel (algebra); Tree kernel; Base (topology); A priori and a posteriori; Parameterized complexity; Computer science; Kernel embedding of distributions; Kernel method; Multiple kernel learning; Set (abstract data type); String kernel; Artificial intelligence; Variable kernel density estimation; Polynomial kernel; Machine learning; Computation; Discretization; Algorithm; Mathematics; Support vector machine; Discrete mathematics","score_opus":0.011064948118837077,"score_gpt":0.21890172120634782,"score_spread":0.20783677308751075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083002797","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.017247995,0.00014255193,0.9810346,0.000065663466,0.000033902925,0.00002255116,0.000032940763,0.0008919987,0.00052772136],"genre_scores_gemma":[0.5648657,0.00019876975,0.4298836,0.000115819355,0.000049480583,0.000100921316,0.0003681023,0.00030598496,0.004111582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877304,0.00032441324,0.00007821267,0.0003436484,0.0003552176,0.00012550724],"domain_scores_gemma":[0.9977258,0.0005134365,0.00018000607,0.00080270297,0.0006401641,0.00013800597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012210046,0.0006073583,0.0012960562,0.00060332596,0.0005000686,0.0011768608,0.0017421559,0.0014404374,0.002529792],"category_scores_gemma":[0.0047202953,0.0004603445,0.00080796157,0.0010387107,0.0006900182,0.00276043,0.0021357639,0.0022491792,0.0018523883],"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.00090152834,0.0005129893,0.0021994896,0.00017064935,0.00019056309,0.000090403555,0.00013057514,0.19728103,0.048420276,0.028937282,0.0058852388,0.71528],"study_design_scores_gemma":[0.000014791197,0.00008141251,0.00045446336,0.0000065825034,0.000019161578,0.00005733852,0.00001048067,0.9857072,0.008322026,0.0042485557,0.0010609676,0.000016991653],"about_ca_topic_score_codex":0.002767596,"about_ca_topic_score_gemma":0.0023446812,"teacher_disagreement_score":0.002767596,"about_ca_system_score_codex":0.00062641053,"about_ca_system_score_gemma":0.0011482714,"threshold_uncertainty_score":0.008463025},"labels":[],"label_agreement":null},{"id":"W2086587356","doi":"10.1007/s10994-013-5364-5","title":"BoostingTree: parallel selection of weak learners in boosting, with application to ranking","year":2013,"lang":"en","type":"article","venue":"Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Magyarország Kormánya; Alberta Innovates; Nemzeti Kutatási és Technológiai Hivatal; Hungarian Scientific Research Fund","keywords":"Boosting (machine learning); Gradient boosting; Machine learning; Artificial intelligence; Ranking (information retrieval); Decision tree; Computer science; Mathematics; Feature selection; Pattern recognition (psychology); Random forest","score_opus":0.03175220600398684,"score_gpt":0.3621694942332327,"score_spread":0.3304172882292459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086587356","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.0028178312,0.00037084456,0.9909965,0.00011915227,0.00019680255,0.00012278132,0.000110562905,0.0040774154,0.0011880348],"genre_scores_gemma":[0.06584315,0.00035377406,0.92770886,0.00017583944,0.00024411538,0.0003810736,0.000555741,0.0011862582,0.0035512517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963206,0.0016562954,0.00020686374,0.00034127472,0.0011838342,0.00029118764],"domain_scores_gemma":[0.9947955,0.0021466664,0.00017660356,0.0010753683,0.0015213606,0.00028446983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008926756,0.0015656308,0.0032927007,0.0023037097,0.0012749339,0.002503374,0.0041630287,0.0023234112,0.008224647],"category_scores_gemma":[0.016174627,0.0014285755,0.0018874139,0.0033142916,0.0008529132,0.002781876,0.0027098171,0.0037649737,0.005379838],"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.0006727901,0.0003252656,0.0013783413,0.00033161492,0.00025884103,0.000111523266,0.000166542,0.12775578,0.0034272056,0.027296346,0.02955534,0.80872035],"study_design_scores_gemma":[0.00015419407,0.0001171771,0.0003371009,0.000033247066,0.00007608704,0.00008317123,0.000021165351,0.95603985,0.0031195611,0.030489704,0.009500555,0.000028204744],"about_ca_topic_score_codex":0.002686291,"about_ca_topic_score_gemma":0.0042766044,"teacher_disagreement_score":0.008926756,"about_ca_system_score_codex":0.00077468087,"about_ca_system_score_gemma":0.0023246473,"threshold_uncertainty_score":0.04720974},"labels":[],"label_agreement":null},{"id":"W2086959852","doi":"10.1007/s10994-009-5103-0","title":"NP-hardness of Euclidean sum-of-squares clustering","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":863,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Cluster analysis; Mathematics; Euclidean distance; Explained sum of squares; Euclidean geometry; Combinatorics; Pattern recognition (psychology); Artificial intelligence; Computer science; Statistics","score_opus":0.012571535375825917,"score_gpt":0.2570000966085654,"score_spread":0.24442856123273946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086959852","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.09082035,0.0052133026,0.8392804,0.017828146,0.00077861355,0.00032658988,0.0043866676,0.002989387,0.038376547],"genre_scores_gemma":[0.63023615,0.002875429,0.33510074,0.0028688665,0.0009604881,0.0007316512,0.0053928313,0.0014302989,0.02040365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99413294,0.0019964434,0.00038309162,0.0012902736,0.0016599816,0.0005372186],"domain_scores_gemma":[0.97650456,0.017888442,0.00092086504,0.0027715145,0.0013928218,0.0005217586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025371208,0.0014115169,0.0036811926,0.0010096085,0.0021406137,0.0046279933,0.005001582,0.003719729,0.007659008],"category_scores_gemma":[0.026150323,0.0012452044,0.0015418004,0.003963928,0.003144532,0.008856873,0.0037228246,0.0050543146,0.0018369692],"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.0017483112,0.0004490148,0.0021090587,0.0015221972,0.00033593609,0.00038472808,0.0008351782,0.53109294,0.003592115,0.17188105,0.08371957,0.20232986],"study_design_scores_gemma":[0.00021526411,0.000058342084,0.00047437527,0.00005793379,0.000048261034,0.00029165955,0.0002854683,0.526195,0.0018168307,0.46410444,0.006420189,0.000032294065],"about_ca_topic_score_codex":0.005403852,"about_ca_topic_score_gemma":0.0055088955,"teacher_disagreement_score":0.007659008,"about_ca_system_score_codex":0.0030603283,"about_ca_system_score_gemma":0.0036142543,"threshold_uncertainty_score":0.02562195},"labels":[],"label_agreement":null},{"id":"W2099367269","doi":"10.1023/b:mach.0000035516.74817.51","title":"Introduction: Lessons Learned from Data Mining Applications and Collaborative Problem Solving","year":2004,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Ministrstvo za Izobraževanje, Znanost in Šport; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Computer science; Data science; Data mining","score_opus":0.037539201725950364,"score_gpt":0.30025338922856964,"score_spread":0.26271418750261927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099367269","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071565453,0.13472953,0.46913013,0.28882223,0.027628936,0.00014358762,0.001713332,0.0015426063,0.06913319],"genre_scores_gemma":[0.1483361,0.14330858,0.41399705,0.10784244,0.07923656,0.00047984865,0.003585101,0.0012651078,0.10194917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981621,0.0005348391,0.000106248706,0.00044988218,0.0006647838,0.00008218316],"domain_scores_gemma":[0.9763435,0.016756715,0.00042684513,0.0017569497,0.0039326996,0.00078327034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004184429,0.0009593597,0.0008863921,0.001478706,0.0011757733,0.0047910046,0.002480938,0.0035764535,0.012356503],"category_scores_gemma":[0.02043543,0.0004934434,0.0006795161,0.0029662861,0.00284051,0.009217152,0.0020444405,0.006869127,0.0065719904],"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.00011226775,0.0001626719,0.0011954756,0.0014711887,0.00006799441,0.00016480194,0.0006783473,0.0032973026,0.0008438506,0.18147726,0.46722308,0.34330577],"study_design_scores_gemma":[0.000030800227,0.00005913855,0.00097283284,0.00061767467,0.00003342817,0.00040971598,0.0003959568,0.007587659,0.001213519,0.46952632,0.5190845,0.00006845506],"about_ca_topic_score_codex":0.0024178848,"about_ca_topic_score_gemma":0.0020496128,"teacher_disagreement_score":0.012356503,"about_ca_system_score_codex":0.0015262135,"about_ca_system_score_gemma":0.0016239369,"threshold_uncertainty_score":0.041336596},"labels":[],"label_agreement":null},{"id":"W2104094955","doi":"10.1007/s10994-009-5152-4","title":"A theory of learning from different domains","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":3486,"is_retracted":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":"Advanced Research Projects Agency; Defense Advanced Research Projects Agency; University of Pennsylvania; National Science Foundation","keywords":"Classifier (UML); Computer science; Weighting; Discriminative model; Artificial intelligence; Bounding overwatch; Pattern recognition (psychology); Bayes error rate; Labeled data; Machine learning; Test data; Quadratic classifier; Divergence (linguistics); Algorithm; Bayes classifier; Support vector machine; Naive Bayes classifier","score_opus":0.015224496617028887,"score_gpt":0.23817871003438795,"score_spread":0.22295421341735908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104094955","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.0032860404,0.0033752748,0.9743397,0.0031647068,0.00028901536,0.00009335185,0.0002607144,0.00018909799,0.015002015],"genre_scores_gemma":[0.32871696,0.012146045,0.61651736,0.0072554247,0.0048757256,0.0024313848,0.0019000693,0.00054584915,0.025611179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98591125,0.0059950934,0.0009067138,0.003118042,0.0034134164,0.0006554328],"domain_scores_gemma":[0.956077,0.03365522,0.0016825909,0.005355957,0.002376306,0.0008528769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014380254,0.0025159973,0.003030754,0.005854788,0.0025844024,0.008852513,0.005280232,0.005102105,0.0093676485],"category_scores_gemma":[0.04085714,0.0017262134,0.004565594,0.004972297,0.012499618,0.018018562,0.010053108,0.00976848,0.003025445],"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.000022317088,0.000025833697,0.00030087298,0.00018082817,0.000072443276,0.000060242925,0.00014163523,0.014558581,0.0000963855,0.9651338,0.0021184096,0.017288594],"study_design_scores_gemma":[0.000015387313,0.000022910288,0.00014044857,0.000059178015,0.000014153385,0.000077155746,0.000029361445,0.04977415,0.0001017949,0.9444194,0.0053279144,0.000018176599],"about_ca_topic_score_codex":0.0027525602,"about_ca_topic_score_gemma":0.001304121,"teacher_disagreement_score":0.014380254,"about_ca_system_score_codex":0.0045065074,"about_ca_system_score_gemma":0.0023562708,"threshold_uncertainty_score":0.076051},"labels":[],"label_agreement":null},{"id":"W2114563530","doi":"10.1023/a:1013916107446","title":"Bayesian Treed Models","year":2002,"lang":"en","type":"article","venue":"Machine Learning","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":184,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Texas at Austin; University of Chicago; National Science Foundation","keywords":"Partition (number theory); Simple (philosophy); Computer science; Bayesian probability; Parametric statistics; Artificial neural network; Parametric model; Mathematics; Tree (set theory); Set (abstract data type); Algorithm; Artificial intelligence; Statistics","score_opus":0.11840723952739055,"score_gpt":0.3423309401831147,"score_spread":0.22392370065572417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114563530","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.0052865916,0.0012924534,0.9790709,0.0011550909,0.0001737578,0.000034434757,0.0010509908,0.000412553,0.011523199],"genre_scores_gemma":[0.4577479,0.0047131376,0.47667632,0.0013977203,0.0007700277,0.00054430525,0.0058422643,0.0007985996,0.05150978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974377,0.0012346411,0.00009452144,0.00049622566,0.00057084946,0.00016600742],"domain_scores_gemma":[0.9936187,0.0042222063,0.00037328538,0.00091806264,0.0006540282,0.00021368479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002978657,0.00086938695,0.0019201236,0.0017914803,0.00088245794,0.00367839,0.0027180677,0.0035289412,0.013390633],"category_scores_gemma":[0.019081935,0.0011627682,0.0014377006,0.0027206088,0.0014659069,0.005202589,0.001964741,0.0035176624,0.004722431],"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.00006815367,0.000038423263,0.00053531915,0.00009218289,0.000056077723,0.00007330855,0.00011800271,0.088169776,0.00022166884,0.85969824,0.011008192,0.03992063],"study_design_scores_gemma":[0.0000151846525,0.000008156816,0.000119152115,0.000024505094,0.00001778667,0.000054774624,0.000013360302,0.28709146,0.000090158355,0.7056758,0.006876302,0.0000133478725],"about_ca_topic_score_codex":0.0034482959,"about_ca_topic_score_gemma":0.0043528574,"teacher_disagreement_score":0.013390633,"about_ca_system_score_codex":0.0014614217,"about_ca_system_score_gemma":0.0013866383,"threshold_uncertainty_score":0.04479611},"labels":[],"label_agreement":null},{"id":"W2115650093","doi":"10.1007/s10994-006-8199-5","title":"Cost curves: An improved method for visualizing classifier performance","year":2006,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":324,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; National Research Council Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Classifier (UML); Computer science; Artificial intelligence; Pattern recognition (psychology); Software; Learning curve; Visualization; Machine learning; Receiver operating characteristic; Range (aeronautics); Data mining; Engineering","score_opus":0.03939313177323189,"score_gpt":0.3477566611305509,"score_spread":0.30836352935731903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115650093","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.01716969,0.00072807993,0.95322835,0.000333103,0.00026260203,0.00018383138,0.003478459,0.021572841,0.0030429936],"genre_scores_gemma":[0.19269353,0.0006936335,0.7890846,0.00022904844,0.00023830627,0.0007763379,0.0043715285,0.0065332237,0.005379832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644864,0.00071011507,0.00034615706,0.00044321307,0.0018077531,0.00024408505],"domain_scores_gemma":[0.9784857,0.011302292,0.0016236382,0.002422804,0.0056745443,0.00049094285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051099,0.0030488044,0.0019326628,0.011666424,0.0008696507,0.0037185892,0.0025612751,0.0025287347,0.011025331],"category_scores_gemma":[0.03230528,0.000757734,0.0013548319,0.008843739,0.00067089923,0.0050420547,0.0018045185,0.0032771074,0.0035080395],"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.0010128635,0.00035060386,0.008695398,0.0008251722,0.0004402438,0.00017924777,0.00063040364,0.07848797,0.01832888,0.015413105,0.066064015,0.80957216],"study_design_scores_gemma":[0.00010771255,0.00021904417,0.007688445,0.000118062846,0.00014249467,0.00036552304,0.00013841517,0.9269266,0.019944526,0.021102289,0.022967054,0.0002798008],"about_ca_topic_score_codex":0.008913709,"about_ca_topic_score_gemma":0.006105118,"teacher_disagreement_score":0.011666424,"about_ca_system_score_codex":0.0012449695,"about_ca_system_score_gemma":0.0014183518,"threshold_uncertainty_score":0.036883414},"labels":[],"label_agreement":null},{"id":"W2119296376","doi":"10.1007/s10994-006-6205-6","title":"Adaptive game AI with dynamic scripting","year":2006,"lang":"en","type":"article","venue":"Machine Learning","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":260,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Alberta","keywords":"Computer science; Scripting language; CLARITY; Human–computer interaction; Computer game; Game design; Sequential game; Scalability; Artificial intelligence; Game design document; Adaptation (eye); Multimedia; Game theory; Game Developer; Programming language; Database","score_opus":0.010368082131558508,"score_gpt":0.24754596782144508,"score_spread":0.23717788568988657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119296376","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.038754918,0.00008675335,0.9353548,0.00026410617,0.00008899769,0.00014891107,0.00006145167,0.0017278603,0.023512246],"genre_scores_gemma":[0.7903158,0.00007467595,0.20017722,0.00015335681,0.000025997424,0.00024101233,0.000104734674,0.00014368724,0.008763399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994215,0.00024412318,0.000034263492,0.00011912782,0.00013022014,0.000050764214],"domain_scores_gemma":[0.998445,0.0009021113,0.00008857007,0.00029992402,0.00013980803,0.00012459284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786034,0.00044323134,0.0003657373,0.00029977548,0.0003900206,0.0009441922,0.0011576749,0.0005596645,0.00500068],"category_scores_gemma":[0.0051260237,0.00037640746,0.00040071268,0.00024959492,0.0011094967,0.0016495662,0.0012443792,0.0013820996,0.0005015446],"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.0003639298,0.0003803184,0.002313068,0.00019935964,0.000107696615,0.00036414195,0.0008205376,0.39947772,0.014819763,0.41544718,0.005504163,0.16020222],"study_design_scores_gemma":[0.00002998577,0.000043492117,0.00015208032,0.000009050589,0.00001149807,0.000049198592,0.000028035212,0.8831071,0.0017240117,0.11179286,0.0030408103,0.000011746125],"about_ca_topic_score_codex":0.0016583329,"about_ca_topic_score_gemma":0.0017524569,"teacher_disagreement_score":0.00500068,"about_ca_system_score_codex":0.00043960946,"about_ca_system_score_gemma":0.0005844488,"threshold_uncertainty_score":0.016728938},"labels":[],"label_agreement":null},{"id":"W2119785746","doi":"10.1007/s10994-009-5110-1","title":"Training parsers by inverse reinforcement learning","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":70,"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":"Treebank; Parsing; Computer science; Generalization; Artificial intelligence; Set (abstract data type); Reinforcement learning; Function (biology); Machine learning; Training set; Inverse; Algorithm; Mathematics","score_opus":0.02311423201309188,"score_gpt":0.2528785846531024,"score_spread":0.22976435264001055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119785746","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.025625339,0.0002768507,0.9664972,0.00061458076,0.00012930864,0.000086171734,0.000097939235,0.004485401,0.0021871421],"genre_scores_gemma":[0.6120088,0.00023312241,0.38096702,0.00053989363,0.000083706655,0.0003628181,0.0004070113,0.0006009729,0.0047966433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874926,0.00049974327,0.000070638846,0.00035604704,0.00019279686,0.00013161992],"domain_scores_gemma":[0.98973197,0.008226462,0.000307519,0.0007401834,0.00080433703,0.000189618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025821405,0.001040894,0.0015875855,0.00095202023,0.0006153601,0.0011036715,0.0021877924,0.0024038432,0.006075742],"category_scores_gemma":[0.014184031,0.0014768351,0.0010232447,0.000593291,0.0017775021,0.002852054,0.001926974,0.004279763,0.0014222547],"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.00030707335,0.0002960386,0.0022561727,0.00024763844,0.00013449905,0.00024073185,0.00023736226,0.6017127,0.005326719,0.029867139,0.0082284175,0.35114548],"study_design_scores_gemma":[0.000025189664,0.000022960989,0.00006721588,0.000012522282,0.000014455677,0.000019525394,0.000009188798,0.9829047,0.0012002994,0.015259382,0.0004571209,0.000007382752],"about_ca_topic_score_codex":0.004106336,"about_ca_topic_score_gemma":0.005273471,"teacher_disagreement_score":0.006075742,"about_ca_system_score_codex":0.0012214467,"about_ca_system_score_gemma":0.0022697484,"threshold_uncertainty_score":0.020325363},"labels":[],"label_agreement":null},{"id":"W2120199131","doi":"10.1023/a:1024068626366","title":"Inference for the Generalization Error","year":2003,"lang":"en","type":"article","venue":"Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":959,"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; Université du Québec à Montréal; Health Canada; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Estimator; Variance (accounting); Generalization; Statistical hypothesis testing; Null hypothesis; Statistics; Set (abstract data type); Generalization error; Mathematics; Computer science; Randomness; Econometrics; Artificial intelligence; Algorithm; Machine learning; Artificial neural network","score_opus":0.026905038304977553,"score_gpt":0.2926671986209821,"score_spread":0.2657621603160046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120199131","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.007718812,0.0009090361,0.9868902,0.0016381581,0.00025766535,0.00004174915,0.000186517,0.00040864202,0.0019491949],"genre_scores_gemma":[0.537145,0.0025627182,0.43595627,0.0018298099,0.0023642087,0.0005487381,0.001691206,0.000848743,0.01705328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493307,0.0018209587,0.0003032599,0.001783751,0.0008458542,0.00031304848],"domain_scores_gemma":[0.970258,0.023096763,0.00094077346,0.0030888456,0.0022217482,0.00039386723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010626746,0.0014690141,0.002672326,0.0027956231,0.0011750646,0.002985655,0.003942511,0.0032219375,0.010475791],"category_scores_gemma":[0.06362353,0.0012811322,0.002650067,0.0016175298,0.0032529365,0.007932821,0.0030607283,0.0094533665,0.0021286183],"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.0002940844,0.00019271963,0.004397948,0.0005446464,0.0006175779,0.00018425824,0.00020303737,0.2876836,0.0019168272,0.5232614,0.011792799,0.16891108],"study_design_scores_gemma":[0.000030963656,0.000023433213,0.00067543605,0.0000905094,0.00006163275,0.00006346669,0.000017591385,0.66292787,0.0008330438,0.33407128,0.0011784988,0.000026272799],"about_ca_topic_score_codex":0.005624606,"about_ca_topic_score_gemma":0.0049629374,"teacher_disagreement_score":0.010626746,"about_ca_system_score_codex":0.002752115,"about_ca_system_score_gemma":0.002385402,"threshold_uncertainty_score":0.056200266},"labels":[],"label_agreement":null},{"id":"W2129809168","doi":"10.1023/a:1013955821559","title":"Kernel Matching Pursuit","year":2002,"lang":"en","type":"article","venue":"Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":322,"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":"Radial basis function; Basis (linear algebra); Basis function; Boosting (machine learning); Algorithm; Matching pursuit; Artificial intelligence; Computer science; Matching (statistics); Mathematics; Function (biology); Kernel (algebra); Pattern recognition (psychology); Artificial neural network; Statistics","score_opus":0.01448241195974086,"score_gpt":0.20520698678331692,"score_spread":0.19072457482357605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129809168","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.0067817695,0.00080835214,0.98054725,0.00044415065,0.0001765217,0.000028449165,0.000093065566,0.0005039682,0.010616539],"genre_scores_gemma":[0.42468217,0.0035314886,0.51296055,0.00043685985,0.00060229993,0.00013851676,0.0008521994,0.0004647897,0.056331053],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994856,0.000119968674,0.000024433624,0.00011891072,0.00021023658,0.00004084392],"domain_scores_gemma":[0.999178,0.00019860128,0.00009200381,0.00024843565,0.00022926788,0.00005375663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060630596,0.0006743788,0.0010363484,0.00089659076,0.00043929927,0.0016446358,0.0005751221,0.0010879947,0.0056941323],"category_scores_gemma":[0.0032185041,0.0003552103,0.00050166796,0.0013441971,0.0008035605,0.0016159575,0.0017390085,0.0013939647,0.005051891],"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.00022842275,0.00011475547,0.0005793169,0.00018659543,0.000080739024,0.00009189556,0.00006974092,0.050630488,0.017031467,0.2913045,0.017151605,0.6225306],"study_design_scores_gemma":[0.000020982132,0.00006477223,0.0005080951,0.000023230354,0.00003328099,0.00025593498,0.000033816763,0.83112526,0.010331841,0.12972994,0.027845291,0.000027448661],"about_ca_topic_score_codex":0.0004820601,"about_ca_topic_score_gemma":0.00039208456,"teacher_disagreement_score":0.0056941323,"about_ca_system_score_codex":0.00038207765,"about_ca_system_score_gemma":0.0007319381,"threshold_uncertainty_score":0.01904875},"labels":[],"label_agreement":null},{"id":"W2135194391","doi":"10.1023/a:1020281327116","title":"An Introduction to MCMC for Machine Learning","year":2003,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2418,"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; Markov chain Monte Carlo; Monte Carlo method; Probabilistic logic; Artificial intelligence; Machine learning; Bayesian probability; Mathematics; Statistics","score_opus":0.01302649663491802,"score_gpt":0.28260567903664,"score_spread":0.269579182401722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135194391","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.00012778556,0.006512593,0.98912245,0.0007134406,0.0005079409,0.00001958011,0.00015533676,0.0007306178,0.0021103818],"genre_scores_gemma":[0.012642379,0.011893848,0.96394545,0.00095705106,0.0027345326,0.00042974818,0.00042129343,0.001354537,0.005621126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603206,0.0021362086,0.00025361995,0.00039922973,0.0010559268,0.00012299234],"domain_scores_gemma":[0.98449266,0.012568797,0.00031818866,0.0014040214,0.0010622465,0.00015408183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736459,0.0025228013,0.0032850106,0.0030129862,0.0009934736,0.0037344743,0.0043622516,0.0056300303,0.017395379],"category_scores_gemma":[0.028237376,0.0024544052,0.0028038812,0.006455931,0.0029418517,0.0043112827,0.0022893602,0.009672034,0.008129144],"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.000037114263,0.0000613616,0.00039069273,0.0007929176,0.00019679953,0.000118198644,0.0001726177,0.054127563,0.0005234297,0.7084346,0.044321854,0.19082278],"study_design_scores_gemma":[0.000028929511,0.000011889089,0.00019860045,0.0001722846,0.000042963056,0.00013740534,0.00001353447,0.17387334,0.0003584549,0.76443195,0.060661554,0.000069112444],"about_ca_topic_score_codex":0.0062840898,"about_ca_topic_score_gemma":0.00683659,"teacher_disagreement_score":0.017395379,"about_ca_system_score_codex":0.0020716388,"about_ca_system_score_gemma":0.0023672916,"threshold_uncertainty_score":0.058193326},"labels":[],"label_agreement":null},{"id":"W2137027418","doi":"10.1007/s10994-012-5307-6","title":"Learning compact Markov logic networks with decision trees","year":2012,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Computer science; Markov chain; Graphical model; Bayesian network; Horn clause; Decision tree; Inductive logic programming; Set (abstract data type); Probabilistic logic; Class (philosophy); Machine learning; Inference; Theoretical computer science; Logic programming","score_opus":0.017743112740989813,"score_gpt":0.25844724040643563,"score_spread":0.24070412766544583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137027418","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.017720385,0.00054667325,0.9794352,0.00052196695,0.000027814378,0.00003117214,0.0002139752,0.00029394837,0.0012088268],"genre_scores_gemma":[0.6743236,0.001217,0.3183242,0.00043516117,0.00020474305,0.00031244935,0.0013848293,0.00013744134,0.003660507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997489,0.0013442773,0.00012794042,0.0004920884,0.0003928593,0.00015384247],"domain_scores_gemma":[0.97543144,0.021960882,0.0011278973,0.00071825803,0.000499227,0.0002623089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003770295,0.0009297874,0.0017394405,0.0014730464,0.0007196533,0.0022065623,0.0017833317,0.0018287811,0.0039346428],"category_scores_gemma":[0.022157414,0.0011935954,0.0011071144,0.0014384346,0.0018022149,0.0065218904,0.0022617306,0.0028777542,0.000607134],"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.0003521894,0.00019002001,0.0015707563,0.00024342157,0.0001276116,0.00016193335,0.00019838748,0.63214767,0.0006151466,0.27756914,0.0025537298,0.08426989],"study_design_scores_gemma":[0.000021083612,0.00001546161,0.00005936534,0.000014939688,0.000011140798,0.000011245976,0.000007878626,0.76575625,0.00011292462,0.23367557,0.0003074457,0.0000065880135],"about_ca_topic_score_codex":0.0034219949,"about_ca_topic_score_gemma":0.0058210716,"teacher_disagreement_score":0.0039346428,"about_ca_system_score_codex":0.0018245807,"about_ca_system_score_gemma":0.0013794387,"threshold_uncertainty_score":0.019939423},"labels":[],"label_agreement":null},{"id":"W2143379662","doi":"10.1007/s10994-009-5154-2","title":"Particle swarm optimizer for variable weighting in clustering high-dimensional data","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":72,"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 Sherbrooke","funders":"","keywords":"Cluster analysis; k-medians clustering; Weighting; Particle swarm optimization; Correlation clustering; Variable (mathematics); Mathematical optimization; Algorithm; CURE data clustering algorithm; Mathematics; Computer science; Fuzzy clustering; Jaccard index; Data mining; Artificial intelligence","score_opus":0.027126925669503376,"score_gpt":0.2695101599614228,"score_spread":0.24238323429191944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143379662","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.003952246,0.00016437599,0.99522877,0.00005453382,0.000044259297,0.00003252015,0.000016257352,0.00020602232,0.00030106658],"genre_scores_gemma":[0.14651868,0.00022299848,0.8502004,0.00009069671,0.00007832076,0.00034100504,0.00017080759,0.0001462475,0.0022307935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992053,0.00035710772,0.00006478023,0.000114764895,0.00019704142,0.000061032548],"domain_scores_gemma":[0.99824464,0.0010621642,0.00009767898,0.00014104365,0.00039471168,0.000059702565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036457912,0.0012173807,0.0021166992,0.0009501459,0.0008044078,0.001058393,0.0018639358,0.0017483542,0.0020139357],"category_scores_gemma":[0.0064967154,0.00085443223,0.0009064125,0.0014362009,0.0008952002,0.0010678692,0.0012155384,0.0018066576,0.00055879593],"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.00023342832,0.000101488775,0.0004904973,0.00013998483,0.00011834311,0.000050330415,0.0001269307,0.7975883,0.0025413583,0.009193185,0.0034673512,0.18594874],"study_design_scores_gemma":[0.0000123206455,0.00001260694,0.00004545249,0.00000281848,0.0000041087956,0.0000031551906,0.000003680014,0.9987423,0.000238199,0.0007383066,0.00019450359,0.0000025899863],"about_ca_topic_score_codex":0.010651174,"about_ca_topic_score_gemma":0.006525383,"teacher_disagreement_score":0.010651174,"about_ca_system_score_codex":0.000900137,"about_ca_system_score_gemma":0.0013026809,"threshold_uncertainty_score":0.021178365},"labels":[],"label_agreement":null},{"id":"W2151161180","doi":"10.1007/s10994-010-5229-0","title":"Informing sequential clinical decision-making through reinforcement learning: an empirical study","year":2010,"lang":"en","type":"article","venue":"Machine Learning","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","cited_by":204,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Institute of Mental Health; National Institute on Drug Abuse; Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; National Institutes of Health","keywords":"Reinforcement learning; Computer science; Imputation (statistics); Artificial intelligence; Machine learning; Missing data; Context (archaeology); Set (abstract data type)","score_opus":0.3261500829909371,"score_gpt":0.5301317871582475,"score_spread":0.20398170416731037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151161180","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.97130156,0.00040468498,0.025909968,0.000691911,0.000028984801,0.00024997938,0.00012524342,0.00008398974,0.0012037831],"genre_scores_gemma":[0.9944543,0.000103293714,0.004891527,0.00007892427,0.000013222099,0.00008114811,0.000087576744,0.000008491691,0.0002813781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913948,0.0070252554,0.0002451482,0.00054778764,0.00044998844,0.0003370081],"domain_scores_gemma":[0.6463642,0.3334276,0.0096199745,0.0049414136,0.0029956044,0.0026512162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018882519,0.0007797156,0.0011546083,0.00055240415,0.00045904133,0.0013141375,0.0013313029,0.0016839876,0.0027694085],"category_scores_gemma":[0.1276597,0.0005102506,0.000613471,0.0006300086,0.0009799402,0.0014368198,0.00084275275,0.0025987197,0.00037059587],"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.014029842,0.011888494,0.15667963,0.0004557962,0.0006489662,0.0004574128,0.0010654764,0.6571809,0.0016161851,0.008065144,0.002293279,0.14561884],"study_design_scores_gemma":[0.0010109822,0.0029439332,0.020399695,0.000062329396,0.00017288675,0.00015536239,0.00020422234,0.95984757,0.00076161197,0.013826021,0.00054525863,0.00007019949],"about_ca_topic_score_codex":0.006091672,"about_ca_topic_score_gemma":0.003396283,"teacher_disagreement_score":0.018882519,"about_ca_system_score_codex":0.0014693638,"about_ca_system_score_gemma":0.0026809205,"threshold_uncertainty_score":0.09986144},"labels":[],"label_agreement":null},{"id":"W2153039919","doi":"10.1007/s10994-012-5280-0","title":"Temporal-difference search in computer Go","year":2012,"lang":"en","type":"article","venue":"Machine Learning","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":93,"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; Temporal difference learning; Computer science; Search algorithm; Monte Carlo method; Bootstrapping (finance); Tree (set theory); Artificial intelligence; Reinforcement learning; Markov decision process; Beam search; Markov chain Monte Carlo; Search problem; Machine learning; Algorithm; Markov process; Mathematics; Statistics; Bayesian probability","score_opus":0.044164561907309385,"score_gpt":0.309821783679691,"score_spread":0.2656572217723816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153039919","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.5414586,0.002452018,0.37099713,0.0036033744,0.00032863786,0.000095539435,0.00027514002,0.00058119086,0.08020837],"genre_scores_gemma":[0.9730266,0.0001862922,0.018117674,0.000117072355,0.000034447254,0.000025613434,0.0000744608,0.000046874047,0.008371031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.00020792804,0.000025340556,0.00008577417,0.00012212284,0.00009486244],"domain_scores_gemma":[0.99605197,0.0030275728,0.00018661158,0.00025847644,0.00023664182,0.00023866551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010604995,0.00024621008,0.0007783281,0.0010773927,0.0009870261,0.0015463452,0.0013687909,0.0016836693,0.012011344],"category_scores_gemma":[0.011258332,0.0002498654,0.00044479314,0.0010317124,0.0014111385,0.004730643,0.0013956724,0.0013385549,0.00039034276],"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.000339973,0.000101878635,0.0009772377,0.00009445382,0.000029036737,0.000102690115,0.00023975695,0.058109034,0.0009238943,0.9115672,0.0021494997,0.025365237],"study_design_scores_gemma":[0.000045590426,0.000044482327,0.00034543822,0.000014842801,0.000012974721,0.0000516067,0.000094756906,0.31688628,0.00034600627,0.68097156,0.0011734469,0.000012994138],"about_ca_topic_score_codex":0.0053713857,"about_ca_topic_score_gemma":0.0062554623,"teacher_disagreement_score":0.012011344,"about_ca_system_score_codex":0.0012267535,"about_ca_system_score_gemma":0.0011261366,"threshold_uncertainty_score":0.040181994},"labels":[],"label_agreement":null},{"id":"W2159863202","doi":"10.1007/s10994-005-0928-7","title":"Combining Statistical Language Models via the Latent Maximum Entropy Principle","year":2005,"lang":"en","type":"article","venue":"Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Computer science; Principle of maximum entropy; Perplexity; Language model; Artificial intelligence; Probabilistic latent semantic analysis; Probabilistic logic; Smoothing; Natural language processing; Inference; Statistical model; Entropy (arrow of time); Natural language","score_opus":0.015687245931904955,"score_gpt":0.26299922893494887,"score_spread":0.2473119830030439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159863202","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.0071320585,0.0003817388,0.99091154,0.000277165,0.00004219441,0.000021359974,0.00010356653,0.0003203732,0.0008099535],"genre_scores_gemma":[0.5655903,0.0020222254,0.4216978,0.00044519838,0.00079844915,0.0004606751,0.0017121495,0.0007180562,0.0065551763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664956,0.0020788088,0.00013818618,0.00036840647,0.00060191576,0.00016310814],"domain_scores_gemma":[0.9903244,0.008121315,0.00031374142,0.00062248786,0.00046729328,0.00015080723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044643665,0.0011029383,0.0018811837,0.002027558,0.00068367075,0.0028687937,0.0016169994,0.00152684,0.002288891],"category_scores_gemma":[0.015299356,0.0011442351,0.0019341542,0.0017756706,0.0010099693,0.006234653,0.0031586753,0.0025071097,0.0013470472],"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.00053870893,0.0002918291,0.0022938217,0.0004000498,0.0007520122,0.00029904436,0.0007324516,0.4750363,0.006669239,0.2338047,0.00626728,0.27291465],"study_design_scores_gemma":[0.000015318086,0.000018500466,0.00021699948,0.000012761798,0.000036495177,0.000026746317,0.0000179894,0.8866677,0.0005610676,0.111671895,0.0007309628,0.000023611445],"about_ca_topic_score_codex":0.0013417944,"about_ca_topic_score_gemma":0.0020020476,"teacher_disagreement_score":0.0044643665,"about_ca_system_score_codex":0.0006254775,"about_ca_system_score_gemma":0.0009795434,"threshold_uncertainty_score":0.023610115},"labels":[],"label_agreement":null},{"id":"W2214733097","doi":"10.1023/b:mach.0000019803.57720.7b","title":"Classification Using Φ-Machines and Constructive Function Approximation","year":2004,"lang":"en","type":"article","venue":"Machine Learning","topic":"Neural Networks and Applications","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":"McGill University","funders":"Cleveland Clinic Foundation; Cleveland Clinic; National Science Foundation","keywords":"Clef; Computer science; Support vector machine; Artificial intelligence; Decision tree; Machine learning; Classifier (UML); Constructive; Artificial neural network; Linear classifier","score_opus":0.020357497995076457,"score_gpt":0.251239282618204,"score_spread":0.23088178462312753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214733097","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.002597087,0.00040705007,0.9955511,0.00019666298,0.000045197383,0.0000137590105,0.000010549177,0.000111322166,0.0010672195],"genre_scores_gemma":[0.26462516,0.0011789277,0.7295685,0.00029036764,0.00045130655,0.00022942649,0.000176236,0.00015557639,0.0033246113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643886,0.0022298603,0.00014435432,0.00036722695,0.00068122544,0.00013855069],"domain_scores_gemma":[0.98583686,0.011114678,0.00066589273,0.0010935256,0.0011258185,0.00016321329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050503765,0.0010087865,0.0019444384,0.0026335744,0.00091731735,0.002589309,0.0026329884,0.002412258,0.0026437466],"category_scores_gemma":[0.024643555,0.0008052725,0.0019927192,0.002228785,0.0036939671,0.0037030808,0.0027815215,0.0027578531,0.0010604439],"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.00009767932,0.000050758365,0.0008105491,0.0002218995,0.00007526373,0.00009545408,0.00015207824,0.20137313,0.0015676961,0.6148785,0.0027280534,0.17794901],"study_design_scores_gemma":[0.000010726688,0.000022201959,0.000109760964,0.00002624784,0.000015334823,0.000059985203,0.000020782314,0.68150526,0.00073159987,0.3158835,0.001604125,0.000010461441],"about_ca_topic_score_codex":0.00077119586,"about_ca_topic_score_gemma":0.00073365046,"teacher_disagreement_score":0.0050503765,"about_ca_system_score_codex":0.0014766635,"about_ca_system_score_gemma":0.00082984735,"threshold_uncertainty_score":0.026709259},"labels":[],"label_agreement":null},{"id":"W2284548247","doi":"10.1007/s10994-021-06019-1","title":"Bayesian optimization with safety constraints: safe and automatic parameter tuning in robotics","year":2021,"lang":"en","type":"preprint","venue":"Machine Learning","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Eidgenössische Technische Hochschule Zürich; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Bayesian optimization; Overshoot (microwave communication); Computer science; Robotics; Process (computing); Context (archaeology); Gaussian process; Robot; Bayesian probability; Set (abstract data type); Artificial intelligence; Probabilistic logic; Optimization problem; Mathematical optimization; Machine learning; Algorithm; Gaussian; Mathematics","score_opus":0.008947761347103697,"score_gpt":0.22550247125578554,"score_spread":0.21655470990868184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284548247","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.0030417047,0.000120541714,0.9961927,0.00009656699,0.00000629149,0.0000150426085,0.000007740142,0.00018360601,0.000335877],"genre_scores_gemma":[0.36628175,0.00052532577,0.63073653,0.00030250498,0.00006553519,0.000242261,0.0001046237,0.0003556448,0.0013858771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979292,0.0008130049,0.00010397543,0.00038768596,0.0006007656,0.00016541078],"domain_scores_gemma":[0.99506724,0.0035481867,0.00050152757,0.00038542924,0.00038406064,0.000113553986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003944556,0.0014110006,0.0014160231,0.0009024901,0.00069993123,0.0012367247,0.0015231633,0.0019658427,0.0011081811],"category_scores_gemma":[0.015797716,0.0011558969,0.000686829,0.00076882757,0.002866601,0.002376604,0.0024868797,0.0026642731,0.0004414776],"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.000100540834,0.000049847986,0.00078487926,0.00011166447,0.000053663112,0.00004863349,0.00012866827,0.8535184,0.0048590936,0.041946046,0.00093125243,0.097467296],"study_design_scores_gemma":[0.000017493425,0.000026021089,0.00012800313,0.000022286777,0.0000070716433,0.000018182895,0.000008743231,0.957024,0.002033914,0.03994678,0.00075375993,0.000013739928],"about_ca_topic_score_codex":0.003747307,"about_ca_topic_score_gemma":0.003737685,"teacher_disagreement_score":0.003944556,"about_ca_system_score_codex":0.0012024215,"about_ca_system_score_gemma":0.0025426163,"threshold_uncertainty_score":0.02086109},"labels":[],"label_agreement":null},{"id":"W2501500329","doi":"10.1007/s10994-016-5585-5","title":"Improving probabilistic inference in graphical models with determinism and cycles","year":2016,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graphical model; Belief propagation; Factor graph; Message passing; Computer science; Approximate inference; Inference; Theoretical computer science; Leverage (statistics); Local consistency; Artificial intelligence; Machine learning; Algorithm; Mathematics; Mathematical optimization; Probabilistic logic; Constraint satisfaction","score_opus":0.016583001162358054,"score_gpt":0.23959821481261537,"score_spread":0.2230152136502573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501500329","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.008125149,0.0006334753,0.9890765,0.0005901448,0.000037602946,0.000028321083,0.00008217563,0.00047584242,0.00095080177],"genre_scores_gemma":[0.40462732,0.002429083,0.5854041,0.0009435929,0.00045007092,0.00031141684,0.0008580711,0.0007395963,0.004236691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98941606,0.006218787,0.0005468872,0.001927821,0.0014503879,0.0004399992],"domain_scores_gemma":[0.86886847,0.11889876,0.0030733573,0.006465298,0.0019559916,0.00073821336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014259899,0.002311234,0.0044508153,0.0039738077,0.0019847068,0.0039379275,0.005070334,0.0040343837,0.0042579053],"category_scores_gemma":[0.10094967,0.0037877169,0.0037616487,0.004055095,0.0041226936,0.0125548225,0.006391351,0.00716917,0.00086347293],"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.00019679492,0.0001245985,0.001456993,0.00031433615,0.00026654475,0.00011828213,0.00031986972,0.6649629,0.0004717575,0.26346973,0.0021788853,0.06611928],"study_design_scores_gemma":[0.000016901597,0.0000143049365,0.000078584766,0.000019340538,0.000032516196,0.000016374606,0.000008498624,0.62732595,0.00015970513,0.37183213,0.00048098306,0.000014711526],"about_ca_topic_score_codex":0.016465148,"about_ca_topic_score_gemma":0.01884446,"teacher_disagreement_score":0.016465148,"about_ca_system_score_codex":0.0036112831,"about_ca_system_score_gemma":0.004889573,"threshold_uncertainty_score":0.07541448},"labels":[],"label_agreement":null},{"id":"W2581879608","doi":"10.1007/s10994-016-5619-z","title":"Efficient parameter learning of Bayesian network classifiers","year":2017,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","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 Waterloo","funders":"Air Force Office of Scientific Research; Australian Research Council; Asian Office of Aerospace Research and Development","keywords":"Discriminative model; Artificial intelligence; Machine learning; Computer science; Pattern recognition (psychology); Bayesian network; Generative model; Bayesian probability; Generative grammar; Mathematics","score_opus":0.023678123723986304,"score_gpt":0.2688267466209545,"score_spread":0.2451486228969682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581879608","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.004175358,0.00024374515,0.99388206,0.00017725398,0.000015415395,0.00006591958,0.00012473659,0.00046118375,0.00085429125],"genre_scores_gemma":[0.3443195,0.0009413433,0.6469312,0.0004477241,0.0001945911,0.0007186821,0.0023716758,0.0005582138,0.003517035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554515,0.0021160971,0.00026375355,0.00092275697,0.00091174996,0.00024043908],"domain_scores_gemma":[0.99187064,0.005445695,0.00057183905,0.0010312508,0.0009108736,0.00016966322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006344814,0.0021311967,0.0026114204,0.0025519538,0.0009517155,0.002344012,0.0041900002,0.0027195895,0.0037195398],"category_scores_gemma":[0.029661993,0.00130882,0.0015235447,0.0025293266,0.0014679967,0.0073119965,0.0028844788,0.0045291907,0.0017710262],"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.00014842933,0.00013104016,0.002303612,0.0001948876,0.0001237193,0.00007536422,0.00015591737,0.60219157,0.0018894443,0.072682925,0.0053440267,0.31475905],"study_design_scores_gemma":[0.00000884979,0.00001044441,0.00012493106,0.0000164709,0.00001118651,0.000023824668,0.0000104536975,0.9473724,0.0005614245,0.051014084,0.00083579315,0.000010222616],"about_ca_topic_score_codex":0.0053244065,"about_ca_topic_score_gemma":0.0073931925,"teacher_disagreement_score":0.006344814,"about_ca_system_score_codex":0.002811277,"about_ca_system_score_gemma":0.0019372782,"threshold_uncertainty_score":0.03355497},"labels":[],"label_agreement":null},{"id":"W2585472988","doi":"10.1007/s10994-016-5617-1","title":"Memory-adaptive high utility sequential pattern mining over data streams","year":2017,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Clickstream; Data stream mining; Data stream; Data mining; Tree (set theory); Web server; The Internet","score_opus":0.05879960194168286,"score_gpt":0.31258075664599344,"score_spread":0.25378115470431056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585472988","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.078561924,0.00044259257,0.9175768,0.00024121148,0.00007186244,0.00009064818,0.00024272666,0.0020803162,0.0006919059],"genre_scores_gemma":[0.7422067,0.00026048868,0.25414494,0.00012949239,0.000105772895,0.0001268274,0.00055166025,0.000139292,0.0023348876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989237,0.00021062637,0.00011991312,0.0002313728,0.00038846204,0.00012587491],"domain_scores_gemma":[0.9947914,0.0027746349,0.00034397183,0.0010816264,0.00081482175,0.00019356444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017193968,0.0007386685,0.0011551221,0.0015068945,0.000519698,0.0012266962,0.0020834506,0.00058830256,0.0013333325],"category_scores_gemma":[0.010755144,0.0005230241,0.0004929305,0.002304682,0.000482101,0.0020452703,0.0019211695,0.001001909,0.0005289599],"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.0021648929,0.00047527323,0.011069282,0.00024508146,0.00016335944,0.00036440324,0.00020528551,0.157492,0.015099485,0.0090806335,0.0051233848,0.79851687],"study_design_scores_gemma":[0.000032102515,0.00006636077,0.00053623196,0.0000060571324,0.000017081808,0.00008807048,0.000025762229,0.98773974,0.0033408075,0.00774725,0.000394989,0.0000055197233],"about_ca_topic_score_codex":0.0029129842,"about_ca_topic_score_gemma":0.0043812236,"teacher_disagreement_score":0.0029129842,"about_ca_system_score_codex":0.00043431658,"about_ca_system_score_gemma":0.0012468131,"threshold_uncertainty_score":0.009093165},"labels":[],"label_agreement":null},{"id":"W2604867865","doi":"10.1007/s10994-017-5683-z","title":"Efficient benchmarking of algorithm configurators via model-based surrogates","year":2017,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Benchmarking; Computer science; Surrogate model; Range (aeronautics); Algorithm; Set (abstract data type); Configurator; Hyperparameter; Mathematical optimization; Machine learning; Artificial intelligence; Mathematics; Engineering","score_opus":0.013987542445136907,"score_gpt":0.2622762930874399,"score_spread":0.24828875064230296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604867865","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.33165184,0.002282927,0.6457222,0.0010746235,0.00043117144,0.00032022863,0.00055341684,0.004925067,0.0130385235],"genre_scores_gemma":[0.85997146,0.00021129938,0.13735965,0.00009949713,0.000028243272,0.00021701767,0.0006714644,0.00040885346,0.0010325966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955438,0.0027768263,0.0002222372,0.00038215073,0.0008060205,0.0002688765],"domain_scores_gemma":[0.9863609,0.008836829,0.0006526763,0.0021352011,0.0017079549,0.00030640964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00550478,0.0015241941,0.0014360195,0.0012805862,0.000674707,0.0023698187,0.0020073184,0.0021142461,0.003218596],"category_scores_gemma":[0.033313427,0.00058179686,0.0007799259,0.0011417299,0.00084011175,0.0022559876,0.0015011758,0.0018712549,0.00085983],"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.0006117782,0.00024596593,0.0016419949,0.00016919232,0.00007443266,0.000059441507,0.000048053946,0.920556,0.001824324,0.007683556,0.0025685441,0.064516634],"study_design_scores_gemma":[0.000027061047,0.000074624164,0.00012956023,0.0000123507325,0.0000073096157,0.000015208679,0.000011408027,0.9965773,0.000999278,0.0018772191,0.0002639117,0.000004765966],"about_ca_topic_score_codex":0.0017757777,"about_ca_topic_score_gemma":0.002148807,"teacher_disagreement_score":0.00550478,"about_ca_system_score_codex":0.0013206883,"about_ca_system_score_gemma":0.0020699883,"threshold_uncertainty_score":0.029112458},"labels":[],"label_agreement":null},{"id":"W2611665460","doi":"10.1007/s10994-009-5134-6","title":"Pointwise exact bootstrap distributions of ROC curves","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","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":"Université de Montréal","funders":"","keywords":"Pointwise; Mathematics; Receiver operating characteristic; Confidence interval; Statistics; Mathematical analysis","score_opus":0.0197606494335381,"score_gpt":0.28621812602858154,"score_spread":0.26645747659504343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611665460","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.071153365,0.002149039,0.9171202,0.0008714929,0.00016668334,0.00029110097,0.0011089921,0.0015024581,0.0056366017],"genre_scores_gemma":[0.82225525,0.0017781784,0.16535541,0.0005451492,0.000634976,0.0009619698,0.004091045,0.00059743394,0.003780619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9829941,0.010123382,0.0006205879,0.0020806228,0.0035281836,0.0006530761],"domain_scores_gemma":[0.8150462,0.1423555,0.00614349,0.023886777,0.011036,0.0015319353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038074315,0.0015465041,0.0024851698,0.005588812,0.0008846696,0.004162402,0.0036994691,0.0036584053,0.0083192],"category_scores_gemma":[0.22642112,0.00086224335,0.0015376016,0.0036026237,0.004102757,0.006662626,0.0037501813,0.004475761,0.0027566992],"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.0019249793,0.0004996667,0.02220046,0.0012961061,0.00048845867,0.001046896,0.0013537335,0.2154661,0.004146104,0.42938936,0.021541981,0.30064613],"study_design_scores_gemma":[0.00010795553,0.00024895274,0.0083480105,0.00036404774,0.00008065748,0.00092748116,0.0002029776,0.70014197,0.002466471,0.28064737,0.0063758153,0.000088341105],"about_ca_topic_score_codex":0.0005971156,"about_ca_topic_score_gemma":0.0004162262,"teacher_disagreement_score":0.038074315,"about_ca_system_score_codex":0.0014094589,"about_ca_system_score_gemma":0.0008259522,"threshold_uncertainty_score":0.20135862},"labels":[],"label_agreement":null},{"id":"W2735649811","doi":"10.1007/s10994-017-5657-1","title":"Generalized exploration in policy search","year":2017,"lang":"en","type":"article","venue":"Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Seventh Framework Programme; Technische Universität Darmstadt","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Entropy (arrow of time); Policy learning; Machine learning; Mathematical optimization; Mathematics","score_opus":0.05004398310810728,"score_gpt":0.33199694268441793,"score_spread":0.28195295957631067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735649811","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.037790164,0.003500808,0.94850665,0.0016443392,0.00018511902,0.000039637114,0.00007793396,0.0002466478,0.008008659],"genre_scores_gemma":[0.8800489,0.0016316405,0.108621806,0.0003838997,0.0002619137,0.00022231974,0.00014303725,0.00018591779,0.008500661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983747,0.0011092499,0.000054691172,0.00017740029,0.00018081485,0.00010315369],"domain_scores_gemma":[0.9935149,0.005430716,0.00026674004,0.0003400532,0.00023477199,0.00021285503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028500005,0.0011298846,0.0025628388,0.0009920279,0.00072784995,0.0018967062,0.0015392064,0.0024668374,0.0038060017],"category_scores_gemma":[0.014741787,0.0009859467,0.0009160815,0.0014635406,0.0042482587,0.0041947816,0.0030933968,0.0028851577,0.00031840062],"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.00011696291,0.000031922773,0.0004452133,0.0001495599,0.00007603399,0.00007792293,0.00013407727,0.5573142,0.00024318208,0.4182181,0.0016937219,0.021499109],"study_design_scores_gemma":[0.000024825156,0.000019550263,0.00006201423,0.000018532639,0.000009647194,0.000012115002,0.000012359383,0.6827138,0.00006106619,0.3165457,0.00051215856,0.000008205477],"about_ca_topic_score_codex":0.0043222373,"about_ca_topic_score_gemma":0.003214812,"teacher_disagreement_score":0.0043222373,"about_ca_system_score_codex":0.0016424874,"about_ca_system_score_gemma":0.001498478,"threshold_uncertainty_score":0.015072405},"labels":[],"label_agreement":null},{"id":"W2751686959","doi":"10.1007/s10994-018-5719-z","title":"Reservoir of diverse adaptive learners and stacking fast hoeffding drift detection methods for evolving data streams","year":2018,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Trillium Foundation; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Concept drift; Data stream mining; Data stream; Change detection; Streaming data; False alarm; Intrusion detection system; Resource (disambiguation); Ranging","score_opus":0.06608287604619553,"score_gpt":0.3737000284153294,"score_spread":0.3076171523691339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751686959","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.016639631,0.00051606493,0.9817399,0.00011981997,0.000085879925,0.00003539089,0.00004171192,0.00036754532,0.00045410253],"genre_scores_gemma":[0.31712857,0.0007320809,0.67504436,0.0002164247,0.00021714167,0.00020708621,0.00040502576,0.00021036921,0.005838991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.00020937515,0.0000914339,0.0002349578,0.00028807018,0.00009662412],"domain_scores_gemma":[0.9957754,0.0020148072,0.0002511923,0.0005927817,0.0011667194,0.00019911355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003593886,0.0010121163,0.0016280861,0.0013771291,0.0007735854,0.0014349226,0.0028525519,0.0016772754,0.0017653074],"category_scores_gemma":[0.012542983,0.00080431084,0.0010838149,0.0014384346,0.0008504008,0.0035049254,0.0027266017,0.0027123594,0.0006269024],"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.0004385114,0.0002099722,0.003909418,0.00014488587,0.00016640214,0.00016470648,0.00030372886,0.39457515,0.0072296793,0.02311582,0.003848085,0.56589365],"study_design_scores_gemma":[0.0000055989076,0.000027775835,0.0001304572,0.0000069121916,0.00001033568,0.000022296621,0.000009081469,0.9955813,0.0010977937,0.0027420383,0.000360225,0.000006085061],"about_ca_topic_score_codex":0.0045556813,"about_ca_topic_score_gemma":0.0058817407,"teacher_disagreement_score":0.0045556813,"about_ca_system_score_codex":0.00069150823,"about_ca_system_score_gemma":0.0018595221,"threshold_uncertainty_score":0.01900655},"labels":[],"label_agreement":null},{"id":"W2897984390","doi":"10.1007/s10994-019-05833-y","title":"Combining Bayesian optimization and Lipschitz optimization","year":2019,"lang":"en","type":"preprint","venue":"Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Canadian Institute for Advanced Research","keywords":"Lipschitz continuity; Bayesian optimization; Heuristics; Regret; Mathematical optimization; Computer science; Bayesian probability; Constant (computer programming); Optimization problem; Function (biology); Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.05627383965606547,"score_gpt":0.3841076774584195,"score_spread":0.32783383780235403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897984390","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.002792356,0.001014012,0.9918087,0.0007915226,0.000072770505,0.000014703698,0.000040665946,0.00011123693,0.003354053],"genre_scores_gemma":[0.31524825,0.005729934,0.654867,0.0011189565,0.001471627,0.0003466896,0.0005791829,0.0006739746,0.019964444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960594,0.0023885586,0.00015740577,0.00036731313,0.00087648485,0.00015071475],"domain_scores_gemma":[0.9849641,0.012008377,0.0006582759,0.0009274949,0.0011693987,0.00027247853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008655819,0.0017767475,0.0034895309,0.0024395264,0.0007747743,0.0041216817,0.0019422236,0.0034224067,0.003922801],"category_scores_gemma":[0.03479904,0.0015279046,0.0011370357,0.0029726913,0.0025844602,0.006171033,0.0037259206,0.0035831924,0.0010037089],"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.00012360253,0.000090621026,0.00053857267,0.00033669797,0.00020599607,0.000056527657,0.000089443194,0.30017808,0.0007503249,0.62174153,0.0055414177,0.07034717],"study_design_scores_gemma":[0.000012624669,0.00001660349,0.000112328824,0.00003565568,0.000020441737,0.0000125516435,0.000009032448,0.6856382,0.0002624806,0.31246898,0.0013954738,0.000015566062],"about_ca_topic_score_codex":0.0037938084,"about_ca_topic_score_gemma":0.003519239,"teacher_disagreement_score":0.008655819,"about_ca_system_score_codex":0.0020551065,"about_ca_system_score_gemma":0.002355595,"threshold_uncertainty_score":0.045776904},"labels":[],"label_agreement":null},{"id":"W2901999103","doi":"10.1007/s10994-018-05774-y","title":"Arbitrage of forecasting experts","year":2018,"lang":"en","type":"article","venue":"Machine Learning","topic":"Time Series Analysis and Forecasting","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":"Dalhousie University","funders":"European Regional Development Fund; Fundação para a Ciência e a Tecnologia; Electronic Components and Systems for European Leadership","keywords":"Computer science; Set (abstract data type); Task (project management); Machine learning; Arbitrage; Component (thermodynamics); Data mining; Artificial intelligence; Series (stratigraphy); Econometrics; Mathematics; Finance","score_opus":0.020222925291654262,"score_gpt":0.22770358929800594,"score_spread":0.20748066400635168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901999103","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.18486504,0.0024232452,0.7623747,0.007359264,0.0007737723,0.000109005225,0.00018584814,0.0006691209,0.04124008],"genre_scores_gemma":[0.9684362,0.00040115832,0.018318683,0.00032229244,0.0004085087,0.00006428089,0.00008709829,0.000072241455,0.011889529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99230015,0.0034309817,0.0004822679,0.0016411524,0.0013928625,0.0007525824],"domain_scores_gemma":[0.93222487,0.051260702,0.0037077998,0.008872539,0.0025631525,0.0013709585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015510375,0.0009048842,0.0024980034,0.0010195524,0.0007955081,0.0035619384,0.002043107,0.0038025465,0.009686093],"category_scores_gemma":[0.11273029,0.0006361212,0.0012170828,0.00088670215,0.0023142132,0.006428888,0.0030456623,0.0044662463,0.0009747345],"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.00091243285,0.0000942857,0.0045646904,0.00020297615,0.00025683877,0.0007711486,0.00051807606,0.10202478,0.0029130417,0.806071,0.0061598355,0.07551096],"study_design_scores_gemma":[0.000061945226,0.00010821061,0.0010537525,0.00003044238,0.000049897102,0.000209271,0.000058967453,0.43261123,0.0012932294,0.5620944,0.0023937076,0.000034975266],"about_ca_topic_score_codex":0.0004979833,"about_ca_topic_score_gemma":0.0003024072,"teacher_disagreement_score":0.015510375,"about_ca_system_score_codex":0.0010472374,"about_ca_system_score_gemma":0.0009732688,"threshold_uncertainty_score":0.08202773},"labels":[],"label_agreement":null},{"id":"W2947014533","doi":"10.1007/s10994-020-05910-7","title":"Evaluating time series forecasting models: an empirical study on performance estimation methods","year":2020,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":386,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fundação para a Ciência e a Tecnologia; Canada Research Chairs","keywords":"Series (stratigraphy); Computer science; Time series; Independent and identically distributed random variables; Dependency (UML); Machine learning; Data mining; Pipeline (software); Sample (material); Estimation; Artificial intelligence; Statistics; Mathematics; Random variable; Engineering","score_opus":0.22272588833177512,"score_gpt":0.44611060638913863,"score_spread":0.2233847180573635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947014533","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.6567836,0.00877769,0.32538137,0.0016950966,0.0001912203,0.0001956273,0.00040665714,0.00055039546,0.0060183397],"genre_scores_gemma":[0.9596854,0.0013605657,0.037682842,0.00009638788,0.0001042428,0.000063926134,0.00043869822,0.00010474505,0.00046319797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.973111,0.019837594,0.0011915886,0.0015730634,0.0038126,0.00047415367],"domain_scores_gemma":[0.52855456,0.4442889,0.0079908585,0.009076698,0.009070683,0.0010182481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06269631,0.0016190715,0.0015405883,0.003461691,0.000533007,0.0031456188,0.0016880631,0.0022343784,0.0009880771],"category_scores_gemma":[0.23897605,0.00041934717,0.0011157246,0.0037516067,0.0011945257,0.0069118524,0.0012117237,0.0019732972,0.00021806984],"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.0015143581,0.0008903836,0.11750652,0.0006239092,0.0010595698,0.00013693569,0.0008070355,0.54655033,0.001722551,0.031944606,0.0034677673,0.29377607],"study_design_scores_gemma":[0.0000359586,0.00053720013,0.011375906,0.00011462449,0.00019631673,0.000060304377,0.00022841,0.9749883,0.0015209656,0.010194806,0.0007156186,0.000031573512],"about_ca_topic_score_codex":0.0032989993,"about_ca_topic_score_gemma":0.0017236205,"teacher_disagreement_score":0.06269631,"about_ca_system_score_codex":0.0021215677,"about_ca_system_score_gemma":0.0014828313,"threshold_uncertainty_score":0.33157372},"labels":[],"label_agreement":null},{"id":"W2984353870","doi":"10.1007/s10994-019-05855-6","title":"A survey on semi-supervised learning","year":2019,"lang":"en","type":"article","venue":"Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":2562,"is_retracted":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":"Universiteit Leiden","keywords":"Artificial intelligence; Machine learning; Computer science; Supervised learning; Unsupervised learning; Scope (computer science); Semi-supervised learning; Artificial neural network; Field (mathematics); Data science; Mathematics","score_opus":0.02000205411217099,"score_gpt":0.24997513849481656,"score_spread":0.22997308438264558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984353870","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003389189,0.24135578,0.7350987,0.00357839,0.0011458722,0.0002254745,0.0005357228,0.00085465674,0.013816174],"genre_scores_gemma":[0.12499387,0.3760209,0.47741178,0.0027662492,0.007048465,0.00086456,0.003907817,0.00073715934,0.00624919],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9876539,0.00520911,0.0012194761,0.0017254852,0.003974521,0.0002175346],"domain_scores_gemma":[0.9730954,0.019818002,0.00083993044,0.0017439931,0.0042310767,0.00027150582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008611789,0.0014184114,0.0024388433,0.0050126165,0.00093404995,0.0040000654,0.0035549437,0.0022569837,0.0033743859],"category_scores_gemma":[0.023191372,0.001001386,0.0018570563,0.008960475,0.0024517493,0.0066124853,0.0026464008,0.0028970798,0.0030519278],"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.00009379097,0.00012647304,0.0020556257,0.006161568,0.0002298829,0.0001654902,0.00053782045,0.024793012,0.0009108266,0.083235614,0.032111928,0.84957796],"study_design_scores_gemma":[0.000050895283,0.00027009603,0.0031352,0.0050406954,0.00015215798,0.0014996888,0.00057332386,0.22540651,0.0039967033,0.3391644,0.4204899,0.00022039341],"about_ca_topic_score_codex":0.001470266,"about_ca_topic_score_gemma":0.0008576726,"teacher_disagreement_score":0.008611789,"about_ca_system_score_codex":0.0014928799,"about_ca_system_score_gemma":0.0025260274,"threshold_uncertainty_score":0.04554403},"labels":[],"label_agreement":null},{"id":"W3003871186","doi":"10.1007/s10994-021-06092-6","title":"Improving sequential latent variable models with autoregressive flows","year":2021,"lang":"en","type":"article","venue":"Machine Learning","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Autoregressive model; STAR model; Latent variable; Computer science; Generalization; Benchmark (surveying); Decorrelation; Series (stratigraphy); Sequence (biology); Nonlinear autoregressive exogenous model; Autocorrelation; Latent variable model; Time series; Algorithm; Mathematics; Artificial intelligence; Machine learning; Autoregressive integrated moving average; Econometrics; Statistics","score_opus":0.012232198424941554,"score_gpt":0.201964833962153,"score_spread":0.18973263553721145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003871186","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.014268686,0.00035668517,0.9839049,0.00021407731,0.000089995025,0.000016473587,0.00007897125,0.0005277973,0.0005424355],"genre_scores_gemma":[0.5701206,0.0010465629,0.4179715,0.00030567337,0.00039375282,0.00023938571,0.0015295771,0.0005026027,0.007890408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822277,0.0009787607,0.000097283046,0.00034131948,0.00023137368,0.00012849153],"domain_scores_gemma":[0.98859847,0.009414631,0.0004228259,0.00086049514,0.000513189,0.00019034589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053315577,0.0014594808,0.0021700892,0.0011133878,0.00063957745,0.0016379607,0.002335717,0.0018832308,0.00420397],"category_scores_gemma":[0.016382841,0.0015244453,0.0016657163,0.0014618594,0.00083978276,0.004659949,0.0024032486,0.0037672655,0.0013875834],"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.00025366494,0.00017799302,0.0011923687,0.000112103764,0.0001597483,0.0000775104,0.0001246286,0.8745018,0.0008370118,0.037086576,0.0025646265,0.082911894],"study_design_scores_gemma":[0.00000688611,0.000009177536,0.000034746856,0.0000031628515,0.0000070242636,0.0000029006744,0.000002070693,0.99154377,0.00008584139,0.008169193,0.00013265421,0.0000024704866],"about_ca_topic_score_codex":0.006914504,"about_ca_topic_score_gemma":0.0069252755,"teacher_disagreement_score":0.006914504,"about_ca_system_score_codex":0.0008165754,"about_ca_system_score_gemma":0.0015443623,"threshold_uncertainty_score":0.028196335},"labels":[],"label_agreement":null},{"id":"W3088086419","doi":"10.1007/s10994-020-05902-7","title":"Fast greedy $$\\mathcal {C}$$-bound minimization with guarantees","year":2020,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Algorithm; Upper and lower bounds; Boosting (machine learning); Combinatorics; Machine learning; Mathematics; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.010887755744747697,"score_gpt":0.21806746839543142,"score_spread":0.20717971265068372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088086419","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.022975959,0.001148665,0.94966817,0.0028426086,0.00033186778,0.00037986645,0.00076407916,0.0042101378,0.017678728],"genre_scores_gemma":[0.3963516,0.0004888778,0.57123303,0.00268047,0.00056950585,0.0011810957,0.0033031038,0.0024977773,0.021694578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633527,0.0012517751,0.00014141639,0.00063307694,0.00091222825,0.0007262251],"domain_scores_gemma":[0.99153155,0.005886027,0.00028581018,0.0009589254,0.0009768934,0.00036077903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034987838,0.0024285861,0.003014505,0.0011787686,0.0011981867,0.0025196846,0.0033109337,0.0024839987,0.018524557],"category_scores_gemma":[0.014593539,0.0010412242,0.0018352809,0.0017353956,0.0016221259,0.0030453252,0.0030342066,0.0043998603,0.005634194],"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.0009988319,0.00049035973,0.0017308787,0.00064864755,0.0001568569,0.00018622368,0.0001458641,0.51303524,0.0027045961,0.09831943,0.10681355,0.27476954],"study_design_scores_gemma":[0.00007523399,0.000049465496,0.00016866381,0.00003388656,0.000019029063,0.000036398444,0.000026686823,0.9393719,0.0007543872,0.057232976,0.0022196982,0.000011648774],"about_ca_topic_score_codex":0.007263218,"about_ca_topic_score_gemma":0.012543634,"teacher_disagreement_score":0.018524557,"about_ca_system_score_codex":0.0031109494,"about_ca_system_score_gemma":0.0052761785,"threshold_uncertainty_score":0.06197083},"labels":[],"label_agreement":null},{"id":"W3093752029","doi":"10.1007/s10994-022-06300-x","title":"Early anomaly detection in time series: a hierarchical approach for predicting critical health episodes","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Anomaly Detection Techniques and Applications","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":"Dalhousie University","funders":"","keywords":"Leverage (statistics); Computer science; Anomaly detection; Key (lock); Machine learning; Artificial intelligence; Data mining; Time series; Series (stratigraphy); Event (particle physics); Computer security","score_opus":0.014507948139910411,"score_gpt":0.2850247771733264,"score_spread":0.270516829033416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093752029","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.12108166,0.0008403594,0.8740495,0.00036620567,0.00007424231,0.0001778577,0.0011030836,0.0010593698,0.0012476965],"genre_scores_gemma":[0.80606985,0.0003916933,0.19016582,0.00008471587,0.00015069738,0.00014132427,0.0013763543,0.00006141285,0.0015581077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990208,0.00018842219,0.00008995641,0.00025544432,0.00030063582,0.00014486439],"domain_scores_gemma":[0.99665254,0.0017390101,0.0004282775,0.00027889712,0.0006863188,0.00021485255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017996193,0.0008029038,0.0012227241,0.0032099888,0.00065894204,0.0010816277,0.0015264526,0.00085949746,0.0014112795],"category_scores_gemma":[0.005187618,0.00045225333,0.0011058463,0.0018556479,0.00044788333,0.0011946799,0.0010199876,0.0015869893,0.00036775324],"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.0007235152,0.0013790217,0.10549939,0.00034914643,0.00058316486,0.00048744216,0.0005248742,0.34763202,0.017945725,0.015137468,0.007403258,0.5023351],"study_design_scores_gemma":[0.000009140793,0.00009679305,0.007612641,0.000015583706,0.000052446252,0.000051597854,0.00003192045,0.98420435,0.0010141628,0.006480502,0.00041078043,0.00002010124],"about_ca_topic_score_codex":0.013994366,"about_ca_topic_score_gemma":0.018154504,"teacher_disagreement_score":0.013994366,"about_ca_system_score_codex":0.00081746915,"about_ca_system_score_gemma":0.0014939713,"threshold_uncertainty_score":0.027825832},"labels":[],"label_agreement":null},{"id":"W3094116343","doi":"10.1007/s10994-023-06337-6","title":"The role of mutual information in variational classifiers","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","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":"École de Technologie Supérieure","funders":"H2020 Marie Skłodowska-Curie Actions; Universidad de Buenos Aires; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Information bottleneck method; Mutual information; Overfitting; Artificial intelligence; Regularization (linguistics); Computer science; Mathematics; Generalization; Kullback–Leibler divergence; Early stopping; MNIST database; Entropy (arrow of time); Inference; Algorithm; Machine learning; Artificial neural network","score_opus":0.00828382254537237,"score_gpt":0.22553121530298656,"score_spread":0.21724739275761418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094116343","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.018504823,0.0017510166,0.9760801,0.0015005404,0.00009501188,0.000031254505,0.000065569286,0.000102694525,0.0018688815],"genre_scores_gemma":[0.7888543,0.0031941438,0.1975719,0.0010971547,0.0010840779,0.00026501878,0.0003766396,0.00041752553,0.007139189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495924,0.0031858704,0.00018948613,0.0008537255,0.00061676954,0.00019489792],"domain_scores_gemma":[0.95357394,0.041277014,0.0012033839,0.0020291356,0.00128993,0.000626591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01132337,0.0009309164,0.0025873294,0.0016806106,0.0013585667,0.0028686544,0.0040133153,0.0039317454,0.0018917972],"category_scores_gemma":[0.048293676,0.0016850727,0.0013517534,0.001334216,0.005508015,0.009407007,0.004487767,0.004549993,0.0002634442],"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.00018963209,0.00011383065,0.0019121885,0.00027982396,0.00026202743,0.00010647475,0.0003283166,0.2634072,0.0015113902,0.6791852,0.002379453,0.050324343],"study_design_scores_gemma":[0.000010940623,0.00002817006,0.00031816526,0.000025855355,0.000020031039,0.00003868367,0.00001831785,0.6813104,0.00031884792,0.3173572,0.0005271211,0.000026206199],"about_ca_topic_score_codex":0.003144103,"about_ca_topic_score_gemma":0.002804412,"teacher_disagreement_score":0.01132337,"about_ca_system_score_codex":0.0017061619,"about_ca_system_score_gemma":0.001247751,"threshold_uncertainty_score":0.05988449},"labels":[],"label_agreement":null},{"id":"W3098081048","doi":"10.1007/s10994-021-05989-6","title":"A framework for the fine-grained evaluation of the instantaneous expected value of soccer possessions","year":2021,"lang":"en","type":"preprint","venue":"Machine Learning","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agència de Gestió d'Ajuts Universitaris i de Recerca; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Possession (linguistics); Interpretation (philosophy); Computer science; Set (abstract data type); Value (mathematics); Series (stratigraphy); Artificial intelligence; Machine learning; Geology","score_opus":0.06513801801211416,"score_gpt":0.3054878476148347,"score_spread":0.24034982960272055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098081048","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.015157539,0.00019541469,0.9814896,0.00037025852,0.00003147823,0.000022464961,0.0002579267,0.00018969197,0.0022857015],"genre_scores_gemma":[0.82524997,0.00072770595,0.16867365,0.00016639371,0.00017671924,0.00017961912,0.00054908753,0.00017924984,0.0040976694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989403,0.00042601672,0.00005340306,0.00026857675,0.00019401818,0.000117845535],"domain_scores_gemma":[0.99551445,0.0029239345,0.0005956021,0.00038498628,0.00034832093,0.0002327101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036457425,0.0011681458,0.0009818376,0.0016420159,0.00039820434,0.00238668,0.0019977763,0.0014585749,0.0042797304],"category_scores_gemma":[0.014878772,0.00055081083,0.0008511624,0.0009819766,0.0018996458,0.0039733904,0.0018093125,0.0027133669,0.00037864674],"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.000047972277,0.00005293352,0.00227785,0.000059320737,0.00006619379,0.000111983674,0.000095347605,0.6952894,0.0013426172,0.2802891,0.0013305614,0.019036751],"study_design_scores_gemma":[0.0000037250607,0.000022425154,0.0005789221,0.00001688449,0.0000070004926,0.000026486488,0.00001565534,0.86925083,0.00018353034,0.12925133,0.00063124485,0.000011890921],"about_ca_topic_score_codex":0.005628503,"about_ca_topic_score_gemma":0.0034273867,"teacher_disagreement_score":0.005628503,"about_ca_system_score_codex":0.001907367,"about_ca_system_score_gemma":0.0012326222,"threshold_uncertainty_score":0.019280791},"labels":[],"label_agreement":null},{"id":"W3131097734","doi":"10.1007/s10994-022-06265-x","title":"SVRG meets AdaGrad: painless variance reduction","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; SAIT Polytechnic; Université de Montréal; Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Minification; Mathematics; Variance reduction; Constant (computer programming); Reduction (mathematics); Heuristic; Variance (accounting); Robustness (evolution); Regular polygon; Algorithm; Mathematical optimization; Computer science; Applied mathematics; Statistics; Geometry","score_opus":0.009090252797299359,"score_gpt":0.20340088466178724,"score_spread":0.19431063186448788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131097734","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.0027571826,0.00015750396,0.99215627,0.00032461752,0.00018303793,0.000028899916,0.00007602585,0.002079921,0.0022365812],"genre_scores_gemma":[0.132837,0.0002974074,0.84731376,0.00043853096,0.00026437335,0.00015083735,0.0005092677,0.0012927304,0.016896054],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989831,0.00030969974,0.000036311427,0.00016627825,0.00042882518,0.00007574774],"domain_scores_gemma":[0.9990804,0.0003769964,0.000054683507,0.00023128049,0.00018762684,0.00006903815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013573897,0.0012598448,0.0011797306,0.0006218718,0.00036269517,0.0011796812,0.00138694,0.0019978096,0.007197113],"category_scores_gemma":[0.0052180663,0.0005750418,0.0006088144,0.00067207863,0.0009000988,0.0015673932,0.0020392945,0.0033303273,0.004302539],"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.00035011466,0.00027060608,0.0004892026,0.00020817993,0.00006532337,0.0001484552,0.00007684323,0.19341652,0.015543901,0.07968695,0.03725536,0.6724886],"study_design_scores_gemma":[0.000015236296,0.000037538583,0.0000618326,0.000010478837,0.000004407472,0.000045520985,0.000006319074,0.97515905,0.0035818077,0.017154101,0.0039163223,0.0000074658824],"about_ca_topic_score_codex":0.0017054261,"about_ca_topic_score_gemma":0.002415158,"teacher_disagreement_score":0.007197113,"about_ca_system_score_codex":0.00042617598,"about_ca_system_score_gemma":0.0011543065,"threshold_uncertainty_score":0.02407676},"labels":[],"label_agreement":null},{"id":"W3134713499","doi":"10.1007/s10994-021-05947-2","title":"Incremental learning of iterated dependencies","year":2021,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Atomic Energy of Canada Limited; Universiteit van Amsterdam; University of Cambridge; Institut national de recherche en informatique et en automatique (INRIA); University of Pennsylvania","keywords":"Link grammar; Dependency (UML); Iterated function; Categorial grammar; Grammar induction; Rule-based machine translation; Combinatory categorial grammar; Computer science; Dependency theory (database theory); Mathematics; Learnability; Theoretical computer science; L-attributed grammar; Tree-adjoining grammar; Artificial intelligence; Context-free grammar; Mildly context-sensitive grammar formalism; Functional dependency; Generative grammar; Emergent grammar; Attribute grammar","score_opus":0.00914247867839503,"score_gpt":0.2367233856628351,"score_spread":0.22758090698444006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134713499","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.06555685,0.0006777437,0.92567015,0.00048531525,0.00015310057,0.000058451915,0.00019602825,0.00096456835,0.006237761],"genre_scores_gemma":[0.8111228,0.00057010556,0.17854348,0.00021332441,0.00026986416,0.0001619394,0.0008283114,0.00029907352,0.007991099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990227,0.0003571978,0.000053497082,0.00026067186,0.00021704393,0.00008895953],"domain_scores_gemma":[0.98716927,0.009464504,0.0004778924,0.0015251412,0.0010747812,0.00028847833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017584665,0.0005562076,0.0010903359,0.001159423,0.000614356,0.0011754603,0.002508517,0.001195081,0.005376588],"category_scores_gemma":[0.020168887,0.00074306247,0.00079879543,0.0009442222,0.0011779155,0.0042327447,0.0019862244,0.0021805668,0.00075002766],"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.00047660572,0.0003233258,0.0041843243,0.0003862127,0.00021011778,0.00037891456,0.00042225327,0.3447869,0.0054348726,0.24434304,0.013068349,0.385985],"study_design_scores_gemma":[0.00001935785,0.000032054668,0.00032043058,0.00001584145,0.00002158719,0.00004406303,0.000012134865,0.9164208,0.0007522148,0.08147352,0.00087684806,0.000011116245],"about_ca_topic_score_codex":0.0024710922,"about_ca_topic_score_gemma":0.0045208973,"teacher_disagreement_score":0.005376588,"about_ca_system_score_codex":0.0007446816,"about_ca_system_score_gemma":0.00094433746,"threshold_uncertainty_score":0.017986417},"labels":[],"label_agreement":null},{"id":"W3135908355","doi":"10.1007/s10994-022-06188-7","title":"STUDD: a student–teacher method for unsupervised concept drift detection","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Concept drift; Computer science; Unsupervised learning; Context (archaeology); Data stream mining; Artificial intelligence; Data stream; Machine learning; Set (abstract data type); Task (project management); State (computer science); Algorithm; Engineering","score_opus":0.016396987087168403,"score_gpt":0.31820220685964856,"score_spread":0.30180521977248015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135908355","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.0116355885,0.00037194643,0.9737158,0.0001874133,0.0002874881,0.0003261736,0.001242304,0.011354586,0.00087873626],"genre_scores_gemma":[0.10827432,0.00017222531,0.87636036,0.00027160064,0.00017333987,0.00055898284,0.0038172577,0.0010018456,0.009370111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998485,0.0003955016,0.00013520016,0.00043227302,0.00044221614,0.00010976213],"domain_scores_gemma":[0.99732375,0.00091330486,0.00016891751,0.0005804242,0.00082611473,0.00018732731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037168409,0.0012275138,0.00134051,0.003908997,0.000840665,0.0014265826,0.0020570357,0.0015926257,0.0060874303],"category_scores_gemma":[0.008149181,0.0006040164,0.0012961723,0.0016318309,0.0004677748,0.0016385284,0.0024938567,0.0017774065,0.0038727284],"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.00046282113,0.00033277774,0.006606438,0.00019502715,0.00025213198,0.00011228663,0.00014893462,0.006507365,0.008289898,0.0025031283,0.021267574,0.95332164],"study_design_scores_gemma":[0.00025132686,0.0003646582,0.0062154243,0.00006266977,0.00015297746,0.00042549777,0.00016979389,0.91422325,0.028608339,0.009700253,0.039741866,0.00008397483],"about_ca_topic_score_codex":0.0022301907,"about_ca_topic_score_gemma":0.007865376,"teacher_disagreement_score":0.0060874303,"about_ca_system_score_codex":0.00052655913,"about_ca_system_score_gemma":0.0019966927,"threshold_uncertainty_score":0.020364463},"labels":[],"label_agreement":null},{"id":"W3160953847","doi":"10.1007/s10994-021-06012-8","title":"RB-CCR: Radial-Based Combined Cleaning and Resampling algorithm for imbalanced data classification","year":2021,"lang":"en","type":"preprint","venue":"Machine Learning","topic":"Imbalanced Data Classification 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":"National Research Council Canada","funders":"Infrastruktura PL-Grid; Narodowe Centrum Nauki","keywords":"Resampling; Oversampling; Benchmark (surveying); Computer science; Artificial intelligence; Prior probability; Binary classification; Binary number; Pattern recognition (psychology); Class (philosophy); Data mining; Machine learning; Algorithm; Mathematics; Support vector machine; Bayesian probability","score_opus":0.06623426337024325,"score_gpt":0.321198295922057,"score_spread":0.25496403255181377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160953847","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.009007534,0.00042529491,0.98624253,0.00022040728,0.00006595453,0.0001042916,0.00012772433,0.0033414445,0.00046493916],"genre_scores_gemma":[0.11554858,0.00017616345,0.88053066,0.00038776887,0.0000856631,0.00026223934,0.00094061246,0.0004738306,0.0015944256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705696,0.00082128827,0.00025489889,0.00064249244,0.0009931648,0.00023114026],"domain_scores_gemma":[0.99517447,0.0015021081,0.00046281778,0.0010481701,0.0015987181,0.00021380965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736027,0.0010693377,0.0022241708,0.0024077022,0.0010970345,0.0015015389,0.0036961967,0.0020015712,0.002946461],"category_scores_gemma":[0.0107247,0.0006325578,0.0014691547,0.0020465506,0.0009478402,0.0017108978,0.002071826,0.002447409,0.0024905363],"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.00091096736,0.00032516578,0.0036993024,0.00024844502,0.00017770455,0.00022030478,0.00028796526,0.17484203,0.015738258,0.011445787,0.020856103,0.771248],"study_design_scores_gemma":[0.00003669084,0.00004082769,0.0003986749,0.000012140711,0.000015059024,0.00006564527,0.000024760458,0.988274,0.0049911058,0.0033628556,0.0027590434,0.000019192154],"about_ca_topic_score_codex":0.008678856,"about_ca_topic_score_gemma":0.00810605,"teacher_disagreement_score":0.008678856,"about_ca_system_score_codex":0.0010309028,"about_ca_system_score_gemma":0.0019242172,"threshold_uncertainty_score":0.025046766},"labels":[],"label_agreement":null},{"id":"W3169315049","doi":"10.1007/s10994-021-06080-w","title":"On the benefits of representation regularization in invariance based domain generalization","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Mila - Quebec Artificial Intelligence Institute; Vector Institute; Western University; Université Laval","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Regularization (linguistics); Invariant (physics); Computer science; Generalization error; Artificial intelligence; Representation (politics); Generalization; Machine learning; Feature learning; Robustness (evolution); Algorithm; Mathematics; Unsupervised learning","score_opus":0.021319547624807592,"score_gpt":0.24230291248694885,"score_spread":0.22098336486214126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169315049","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.02001654,0.0002470842,0.97789943,0.0003090921,0.000026842548,0.00003697558,0.00002768625,0.00048179485,0.00095457776],"genre_scores_gemma":[0.6657709,0.00049787236,0.3292849,0.0006429783,0.00015621736,0.00016652215,0.0003541668,0.00033050342,0.00279601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878174,0.00044884198,0.000049937244,0.00037138513,0.00024583723,0.00010234044],"domain_scores_gemma":[0.9966157,0.0016139998,0.0002614338,0.0010387448,0.00031397378,0.00015603544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002685024,0.00090901315,0.0011799713,0.0007831973,0.0007548933,0.00093707483,0.0017320432,0.0014956568,0.0013908605],"category_scores_gemma":[0.009696527,0.00039588133,0.0010652412,0.00082644384,0.0020417618,0.003006952,0.003071974,0.002901051,0.000632932],"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.00022187237,0.00024173102,0.002548186,0.000117011485,0.000116632255,0.00020361521,0.00033325938,0.6598622,0.019309195,0.07636348,0.0045271153,0.23615567],"study_design_scores_gemma":[0.000008071393,0.000051258605,0.0002277162,0.000006905382,0.000008782202,0.000049535494,0.000016416046,0.97613084,0.0016542922,0.021265872,0.00056870363,0.000011596255],"about_ca_topic_score_codex":0.0023994367,"about_ca_topic_score_gemma":0.0019089128,"teacher_disagreement_score":0.002685024,"about_ca_system_score_codex":0.00073568115,"about_ca_system_score_gemma":0.0010511171,"threshold_uncertainty_score":0.014199913},"labels":[],"label_agreement":null},{"id":"W3182947351","doi":"10.1007/s10994-021-05980-1","title":"Triply stochastic gradient method for large-scale nonlinear similar unlabeled classification","year":2021,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Data Classification","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":"Western University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Government of Jiangsu Province; Six Talent Peaks Project in Jiangsu Province; National Natural Science Foundation of China","keywords":"Scalability; Classifier (UML); Computer science; Artificial intelligence; Generalization; Machine learning; Kernel (algebra); Stochastic gradient descent; Benchmark (surveying); Data point; Nonlinear system; Scale (ratio); Linear classifier; Algorithm; Mathematics; Artificial neural network","score_opus":0.024356367146481445,"score_gpt":0.3079578563482156,"score_spread":0.28360148920173417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182947351","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.004771209,0.0001670932,0.99369496,0.00015391909,0.00004241515,0.000055245557,0.00006449848,0.0005683284,0.00048237617],"genre_scores_gemma":[0.24249299,0.00035521193,0.7459824,0.00041174525,0.00023677487,0.00048867054,0.0012091334,0.0005246867,0.008298302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.00041103904,0.00005606647,0.00021175675,0.00030204846,0.00009579908],"domain_scores_gemma":[0.997619,0.0011478203,0.00014641647,0.00035645955,0.0005594093,0.00017085705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025312763,0.00082800933,0.0019775662,0.0012933785,0.0010374029,0.0012327812,0.0030455247,0.0020424488,0.004519848],"category_scores_gemma":[0.00634543,0.0007777039,0.0012921822,0.0013809938,0.0013026821,0.0020462829,0.0023119135,0.0024722305,0.0015020338],"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.0004088243,0.00037155373,0.0014569394,0.0003018827,0.00023226438,0.00019106294,0.00013346715,0.54144627,0.0065114195,0.06925856,0.015922053,0.36376566],"study_design_scores_gemma":[0.0000068904574,0.0000105130475,0.000049129918,0.0000022332886,0.0000041844464,0.000010562703,0.0000030485462,0.994799,0.00023331925,0.004546736,0.00033035563,0.000003887006],"about_ca_topic_score_codex":0.010053707,"about_ca_topic_score_gemma":0.010854023,"teacher_disagreement_score":0.010053707,"about_ca_system_score_codex":0.0012043271,"about_ca_system_score_gemma":0.0022674517,"threshold_uncertainty_score":0.019990325},"labels":[],"label_agreement":null},{"id":"W3184701629","doi":"10.1007/s10994-021-06029-z","title":"Multimodal deep learning for cetacean distribution modeling of fin whales (Balaenoptera physalus) in the western Mediterranean Sea","year":2021,"lang":"en","type":"article","venue":"Machine Learning","topic":"Marine animal studies overview","field":"Environmental Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Ocean Frontier Institute; Agence Nationale de la Recherche; ISblue","keywords":"Balaenoptera; Whale; Artificial intelligence; Deep learning; Species distribution; Range (aeronautics); Metric (unit); Task (project management); Machine learning; Computer science; Transfer of learning; Habitat; Geography; Cetacea; Mediterranean climate; Ecology; Engineering; Biology","score_opus":0.022617051752978477,"score_gpt":0.261314677143047,"score_spread":0.23869762539006853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184701629","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.9128774,0.00094138767,0.08318614,0.0006544063,0.00004444504,0.000015812646,0.00050262146,0.0003401987,0.0014376586],"genre_scores_gemma":[0.9927341,0.00013466178,0.0053749485,0.00005155838,0.000017449285,0.000011611875,0.0004643253,0.000021435619,0.0011898858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994147,0.000014260479,0.0000025795277,0.000020192925,0.000006253925,0.00001528504],"domain_scores_gemma":[0.9998441,0.00007036337,0.000017952081,0.000010524727,0.000037124322,0.00002000569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041745423,0.00046240076,0.00030823285,0.00037607763,0.00020876224,0.00035523486,0.0006323972,0.0005533867,0.00082332524],"category_scores_gemma":[0.0010177118,0.00021474436,0.0004570026,0.00031931134,0.0001765831,0.0004671844,0.0005219138,0.00054567645,0.00017607215],"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.00011261442,0.000081449936,0.023586625,0.000029087685,0.000095421434,0.0000802388,0.00006954442,0.9153744,0.0017407974,0.0004998591,0.0013087251,0.057021134],"study_design_scores_gemma":[0.0000017232403,0.0000052318946,0.0022821673,0.0000024836606,0.0000036041542,0.0000047721974,0.000014721471,0.9972525,0.00011281257,0.00024996029,0.000068209876,0.0000017583916],"about_ca_topic_score_codex":0.031543203,"about_ca_topic_score_gemma":0.026295468,"teacher_disagreement_score":0.031543203,"about_ca_system_score_codex":0.00047815594,"about_ca_system_score_gemma":0.00035738928,"threshold_uncertainty_score":0.06271917},"labels":[],"label_agreement":null},{"id":"W3196229027","doi":"10.1007/s10994-021-06041-3","title":"Guest editorial: special issue on reinforcement learning for real life","year":2021,"lang":"en","type":"editorial","venue":"Machine Learning","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":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Cognitive science; Artificial intelligence; Psychology; Social psychology","score_opus":0.009127397020637387,"score_gpt":0.25391970605673,"score_spread":0.2447923090360926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196229027","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023162567,0.004335725,0.00022543246,0.025106622,0.9684023,0.000017677707,0.000043802844,0.000068216934,0.0017770116],"genre_scores_gemma":[0.0003512525,0.0023607665,0.00013148863,0.011213512,0.97556156,0.000022173774,0.00002909444,0.000049376893,0.010280725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956344,0.00082845025,0.00041641048,0.0005881576,0.002251169,0.00028144993],"domain_scores_gemma":[0.98333514,0.006807995,0.0013895589,0.00047783696,0.005355924,0.0026335607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062061604,0.0037978983,0.004083467,0.0031690777,0.002627962,0.008125297,0.0031651633,0.017618323,0.029801937],"category_scores_gemma":[0.022084199,0.0011978539,0.0024583824,0.0011172157,0.0021797202,0.003181139,0.0018013779,0.01599236,0.017886108],"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.000026721018,0.000010329968,0.000013027195,0.00011802882,0.000015022936,0.000060837036,0.0000031542204,0.000034914086,0.000039044313,0.00020862324,0.99559313,0.0038770703],"study_design_scores_gemma":[0.00010648955,0.00003892075,0.0002173147,0.00030313345,0.00005439182,0.00017523266,0.000014820514,0.0004390744,0.00012115553,0.0017696049,0.9967372,0.000022588782],"about_ca_topic_score_codex":0.0010863552,"about_ca_topic_score_gemma":0.0037109673,"teacher_disagreement_score":0.029801937,"about_ca_system_score_codex":0.0025842008,"about_ca_system_score_gemma":0.002312031,"threshold_uncertainty_score":0.09969741},"labels":[],"label_agreement":null},{"id":"W3208335533","doi":"10.1007/s10994-023-06340-x","title":"A moment-matching metric for latent variable generative models","year":2023,"lang":"en","type":"preprint","venue":"Machine Learning","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Canadian Statistical Sciences Institute; University of Toronto","keywords":"Latent variable; Metric (unit); Regularization (linguistics); Gaussian; Matrix norm; Computer science; Latent variable model; Mathematics; Applied mathematics; Moment (physics); Generative grammar; Norm (philosophy); Artificial intelligence; Algorithm; Mathematical optimization","score_opus":0.060794617866384765,"score_gpt":0.30770584740672646,"score_spread":0.2469112295403417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208335533","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.009484462,0.00019514971,0.988902,0.00022250078,0.000023180137,0.00003241001,0.00010178176,0.00017570856,0.0008629617],"genre_scores_gemma":[0.36590338,0.00043573472,0.6295293,0.00021434744,0.00015480784,0.00028211036,0.00082501053,0.00052821497,0.0021271752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930588,0.0040492513,0.0003311209,0.001010844,0.0013375183,0.00021255147],"domain_scores_gemma":[0.9817136,0.012385215,0.0018089265,0.0016936971,0.0016651981,0.00073337957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008726039,0.00090777106,0.0014068064,0.0034967312,0.00080531515,0.0022527913,0.0024236967,0.0028811672,0.0029194953],"category_scores_gemma":[0.039611656,0.00058952026,0.0014308194,0.002171714,0.0025162129,0.004085194,0.0031390316,0.0025405432,0.0007527167],"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.00017420831,0.000085220505,0.0019057093,0.00021615243,0.00010162469,0.00012849088,0.00025054003,0.28124592,0.0044388943,0.6330141,0.003496422,0.074942715],"study_design_scores_gemma":[0.0000070152664,0.00003502439,0.0003474598,0.000024964504,0.0000076110355,0.00006294399,0.000017298047,0.7715239,0.0008493805,0.22549927,0.0015961877,0.000028955272],"about_ca_topic_score_codex":0.0018611914,"about_ca_topic_score_gemma":0.0010972715,"teacher_disagreement_score":0.008726039,"about_ca_system_score_codex":0.0023993445,"about_ca_system_score_gemma":0.0011924425,"threshold_uncertainty_score":0.0461483},"labels":[],"label_agreement":null},{"id":"W4200566067","doi":"10.1007/s10994-021-06069-5","title":"A taxonomy of weight learning methods for statistical relational learning","year":2021,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Defense Advanced Research Projects Agency; Institut de Valorisation des Données; Canada First Research Excellence Fund; National Science Foundation","keywords":"Statistical relational learning; Probabilistic logic; Artificial intelligence; Computer science; Machine learning; Metric (unit); Set (abstract data type); Theoretical computer science; Data mining; Relational database","score_opus":0.05351484882150161,"score_gpt":0.33730451084438556,"score_spread":0.28378966202288397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200566067","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.0017724202,0.001391641,0.9951717,0.00036081125,0.000037293386,0.000055608547,0.000060884806,0.00042301245,0.0007266402],"genre_scores_gemma":[0.13726082,0.0036617871,0.853973,0.0005120237,0.00034261256,0.00060855306,0.00056942407,0.00047821528,0.0025936172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411607,0.0023088586,0.00047928403,0.00088924903,0.002026961,0.00017955883],"domain_scores_gemma":[0.991738,0.004789291,0.00054589374,0.0012793293,0.0014599939,0.00018762673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008813904,0.0020453667,0.0017492565,0.004169914,0.0007197178,0.0026604952,0.0053412695,0.0022666967,0.002989517],"category_scores_gemma":[0.022472007,0.0009790031,0.0021717637,0.0059375106,0.0018054852,0.006112242,0.0041321623,0.0042282715,0.0013013626],"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.00009337381,0.00020796133,0.0019391321,0.00043811262,0.00023668012,0.00006647091,0.00015000964,0.23484573,0.0013988273,0.15373409,0.0056517054,0.6012379],"study_design_scores_gemma":[0.0000143770785,0.000037637732,0.00013786372,0.0000688593,0.000017082535,0.0000379474,0.000015781567,0.9001733,0.0009675742,0.09525299,0.0032602127,0.000016392556],"about_ca_topic_score_codex":0.0025290884,"about_ca_topic_score_gemma":0.002233088,"teacher_disagreement_score":0.008813904,"about_ca_system_score_codex":0.0019092489,"about_ca_system_score_gemma":0.00141368,"threshold_uncertainty_score":0.04661292},"labels":[],"label_agreement":null},{"id":"W4225277467","doi":"10.1007/s10994-022-06171-2","title":"Arbitrary conditional inference in variational autoencoders via fast prior network training","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Generative Adversarial Networks and Image Synthesis","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":"Inference; Computer science; Artificial intelligence; Conditional probability distribution; Machine learning; Approximate inference; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.015102373214212433,"score_gpt":0.23249925987396183,"score_spread":0.2173968866597494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225277467","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.0053624823,0.00020348726,0.9927248,0.000201023,0.000027857091,0.000014927916,0.00005044787,0.0002394983,0.001175535],"genre_scores_gemma":[0.54767776,0.0007238165,0.43605092,0.00044878628,0.00020590302,0.00035958277,0.00067756313,0.00072107237,0.013134656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991159,0.0004258625,0.000030932923,0.00016046909,0.00018349843,0.000083217885],"domain_scores_gemma":[0.99273866,0.0062115695,0.00021344911,0.00040659905,0.0002852484,0.0001445017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023637984,0.0011143904,0.0014621628,0.00085956097,0.0006184879,0.0011475086,0.0023827236,0.0020796799,0.00448906],"category_scores_gemma":[0.011337567,0.0016563358,0.00096591463,0.00090212125,0.002572211,0.0026771736,0.003163133,0.003907033,0.00076638366],"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.00007043779,0.000032222146,0.0002717475,0.00006726748,0.000037968886,0.000040409923,0.000050592964,0.87848055,0.0009191377,0.0899625,0.0016297091,0.028437532],"study_design_scores_gemma":[0.0000033214794,0.000002863398,0.000020086445,0.000003321942,0.0000017901777,0.0000036053768,0.0000017915372,0.9812352,0.00013116395,0.018461678,0.0001327935,0.000002363803],"about_ca_topic_score_codex":0.009002556,"about_ca_topic_score_gemma":0.01375513,"teacher_disagreement_score":0.009002556,"about_ca_system_score_codex":0.0016332195,"about_ca_system_score_gemma":0.001572549,"threshold_uncertainty_score":0.017900348},"labels":[],"label_agreement":null},{"id":"W4229516452","doi":"10.4018/978-1-60960-818-7.ch804","title":"Pattern Discovery as Event Association","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Data Management and Algorithms","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":"Pattern Discovery Technologies (Canada); University of Waterloo","funders":"","keywords":"Event (particle physics); Association (psychology); Task (project management); Binary number; Mathematics; Computer science; Artificial intelligence; Algorithm; Combinatorics; Discrete mathematics; Arithmetic; Psychology; Physics","score_opus":0.012529066127516131,"score_gpt":0.2193140326999921,"score_spread":0.20678496657247597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229516452","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.010571811,0.0077003934,0.9542015,0.0069310777,0.00087978365,0.00058628526,0.00510888,0.0021156834,0.011904659],"genre_scores_gemma":[0.20104288,0.0077219573,0.752078,0.003627794,0.0023382916,0.0017944057,0.017092573,0.00040725278,0.013896925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98498166,0.0042217546,0.0010810042,0.0054480312,0.003790215,0.00047739188],"domain_scores_gemma":[0.96723425,0.020851143,0.0036589608,0.0049012876,0.0026361707,0.0007182131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008186597,0.0023971254,0.002476479,0.0072279647,0.0017163255,0.0069727106,0.004639714,0.0034467673,0.011310608],"category_scores_gemma":[0.042632543,0.0015366137,0.0031462498,0.01115354,0.0040505715,0.0138826575,0.0068087666,0.004956485,0.0043874034],"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.0006091633,0.00031704752,0.011441121,0.002115439,0.0006058344,0.0017171734,0.0011202956,0.036358956,0.0018629557,0.56341445,0.04783433,0.33260328],"study_design_scores_gemma":[0.000071198214,0.000075284835,0.0011787586,0.0002410121,0.00011958258,0.0010188335,0.00021160819,0.13474952,0.0015360384,0.8149632,0.045770373,0.00006464965],"about_ca_topic_score_codex":0.0029618305,"about_ca_topic_score_gemma":0.001987393,"teacher_disagreement_score":0.011310608,"about_ca_system_score_codex":0.0022828204,"about_ca_system_score_gemma":0.002353832,"threshold_uncertainty_score":0.043295383},"labels":[],"label_agreement":null},{"id":"W4230976265","doi":"10.4018/978-1-60960-818-7.ch710","title":"Ethology-Based Approximate Adaptive Learning","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Machine Learning and Algorithms","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 Manitoba","funders":"","keywords":"Ethology; Artificial intelligence; Computer science; Animal learning; Machine learning; Adaptive learning; Adaptive behavior; Psychology; Biology; Cognitive psychology; Ecology","score_opus":0.025530463959230084,"score_gpt":0.2349662953763786,"score_spread":0.2094358314171485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230976265","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.007876361,0.01160653,0.84423494,0.0033048196,0.00085492677,0.000047781265,0.00008991607,0.0002986091,0.13168615],"genre_scores_gemma":[0.36035296,0.023652865,0.37152615,0.0024113746,0.0012904464,0.00033334826,0.000373049,0.00025143736,0.23980844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997961,0.00005351736,0.0000079027595,0.000039896957,0.00009129118,0.00001135296],"domain_scores_gemma":[0.99975246,0.00013357025,0.000013484909,0.000033517153,0.000053760454,0.000013218753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516247,0.00036827353,0.0003337048,0.00039747445,0.00027322705,0.0010242488,0.0008254384,0.00073054514,0.004735902],"category_scores_gemma":[0.0013469715,0.00019418389,0.00034061488,0.00039887417,0.0011629974,0.0014053201,0.0007268729,0.0016233365,0.0014933761],"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.000019055084,0.000025557729,0.0002783428,0.00014812523,0.000028334593,0.000050366027,0.00011863145,0.042940624,0.0017932549,0.81008804,0.010732464,0.13377708],"study_design_scores_gemma":[0.000009306053,0.000045798268,0.00041528806,0.00008001556,0.00001359501,0.00022532078,0.000040194387,0.1849788,0.0016926843,0.71331894,0.09915683,0.00002319246],"about_ca_topic_score_codex":0.0004204383,"about_ca_topic_score_gemma":0.0004365455,"teacher_disagreement_score":0.004735902,"about_ca_system_score_codex":0.00059376727,"about_ca_system_score_gemma":0.00037321114,"threshold_uncertainty_score":0.015843213},"labels":[],"label_agreement":null},{"id":"W4233822191","doi":"10.4018/978-1-60960-818-7.ch702","title":"Granular Computing and Human-Centricity in Computational Intelligence","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Rough Sets and Fuzzy Logic","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":"Granular computing; Computer science; Fuzzy logic; Facet (psychology); Fuzzy set; Cluster analysis; Set (abstract data type); Computational intelligence; Suite; Rough set; Theoretical computer science; Artificial intelligence; Data mining; Data science","score_opus":0.03026399410605888,"score_gpt":0.2575815101774934,"score_spread":0.22731751607143455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233822191","genre_codex":"other","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.008838509,0.17805797,0.39452663,0.013981818,0.002512442,0.00013091444,0.00026313646,0.00064089167,0.40104762],"genre_scores_gemma":[0.372021,0.1525438,0.29134268,0.0034946399,0.003434242,0.00037294114,0.00047201468,0.00039091168,0.17592777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995229,0.00012091458,0.000029841132,0.000075786076,0.00021882882,0.00003168554],"domain_scores_gemma":[0.9993228,0.0004821572,0.000024290903,0.00008956042,0.000057818925,0.000023492325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007937117,0.0006376241,0.0005935885,0.001350852,0.0005823009,0.004344712,0.0007717082,0.0010537992,0.002985262],"category_scores_gemma":[0.0014055931,0.00032039572,0.00044994504,0.0027298294,0.004284697,0.00424699,0.001000461,0.0019764982,0.0009317966],"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.0000092335085,0.000007516001,0.000057934143,0.00014739038,0.000008780226,0.000045421843,0.00029454456,0.0028227349,0.0003144106,0.9507577,0.00963216,0.0359023],"study_design_scores_gemma":[0.000004330605,0.000009951984,0.0001702819,0.00013541443,0.0000057919565,0.000102867554,0.00010205642,0.004996392,0.00028679127,0.89001805,0.10415585,0.000012111984],"about_ca_topic_score_codex":0.0009655737,"about_ca_topic_score_gemma":0.0010467481,"teacher_disagreement_score":0.004344712,"about_ca_system_score_codex":0.0016168685,"about_ca_system_score_gemma":0.0007499144,"threshold_uncertainty_score":0.011731207},"labels":[],"label_agreement":null},{"id":"W4240001947","doi":"10.4018/978-1-60960-818-7.ch420","title":"A Case Study on Scaffolding Adaptive Feedback within Virtual Learning Environments","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Process (computing); Representation (politics); Virtual Laboratory; Knowledge representation and reasoning; Human–computer interaction; Domain (mathematical analysis); Domain knowledge; Artificial intelligence; Multimedia","score_opus":0.04625016421813858,"score_gpt":0.2410604903703685,"score_spread":0.19481032615222993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240001947","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.855692,0.0027959535,0.081879616,0.003396172,0.00038304855,0.00075323763,0.00023557115,0.00062896597,0.05423551],"genre_scores_gemma":[0.93733704,0.001162807,0.03326799,0.000266761,0.000047863345,0.00017530573,0.00009049216,0.0001338597,0.027517775],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9961731,0.0024211514,0.00013946903,0.00021757337,0.0007341365,0.00031472064],"domain_scores_gemma":[0.99497074,0.0035638623,0.00022547557,0.00036760833,0.0003493283,0.0005229788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029685097,0.000720951,0.0005612727,0.00092770316,0.002796945,0.0028182906,0.0025537894,0.004223939,0.003986098],"category_scores_gemma":[0.009853391,0.00031386563,0.000593872,0.0011198432,0.002192509,0.0018545628,0.002151156,0.0016791264,0.0010211592],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001280688,0.0051317415,0.0186503,0.0027009593,0.0001344224,0.19404218,0.2508151,0.034086343,0.027749037,0.050958626,0.029530149,0.3849205],"study_design_scores_gemma":[0.00037431633,0.0051002335,0.026741477,0.0020592485,0.00020627891,0.11739124,0.15463383,0.05647696,0.050027348,0.025638372,0.56095356,0.0003972113],"about_ca_topic_score_codex":0.002772285,"about_ca_topic_score_gemma":0.005702313,"teacher_disagreement_score":0.004223939,"about_ca_system_score_codex":0.0014987498,"about_ca_system_score_gemma":0.0010523214,"threshold_uncertainty_score":0.015699148},"labels":[],"label_agreement":null},{"id":"W4240420143","doi":"10.4018/978-1-60960-818-7.ch708","title":"A Cognitive Computational Knowledge Representation Theory","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Representation (politics); Computer science; Cognition; Knowledge representation and reasoning; Cognitive science; Field (mathematics); Cognitive model; Computational model; Artificial intelligence; Psychology; Mathematics","score_opus":0.04657129650791966,"score_gpt":0.2844310450365971,"score_spread":0.23785974852867744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240420143","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.005543502,0.015585615,0.57940793,0.014342219,0.0008656268,0.00010682226,0.0003621758,0.00039381284,0.38339224],"genre_scores_gemma":[0.39196023,0.018812839,0.4528218,0.0041585327,0.0016354205,0.0005630697,0.0010972582,0.00031517708,0.1286357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929607,0.00024141335,0.000036358222,0.00012871387,0.00024237925,0.00005506712],"domain_scores_gemma":[0.99915636,0.0005353746,0.000030136689,0.00013821993,0.000102384205,0.00003748165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010113476,0.0007154434,0.00052707735,0.001376269,0.0011789987,0.0056723496,0.0019667998,0.0017563667,0.009001638],"category_scores_gemma":[0.0020873474,0.00034996768,0.0011401995,0.0016704283,0.0067754863,0.0077146348,0.001967226,0.0029745742,0.0024313976],"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.0000022054512,0.0000041322805,0.000021925467,0.000044963213,0.000005060253,0.00001912475,0.0001763636,0.0007944419,0.0000739005,0.9858209,0.0032357327,0.009801221],"study_design_scores_gemma":[0.000002692795,0.0000029435987,0.00003073998,0.000033157357,0.0000028300458,0.000049390284,0.000049016864,0.0030347244,0.000072479335,0.9587652,0.037953053,0.000003761163],"about_ca_topic_score_codex":0.0026870435,"about_ca_topic_score_gemma":0.0017613221,"teacher_disagreement_score":0.009001638,"about_ca_system_score_codex":0.0022946824,"about_ca_system_score_gemma":0.0014896613,"threshold_uncertainty_score":0.030113518},"labels":[],"label_agreement":null},{"id":"W4244216214","doi":"10.4018/978-1-60960-818-7.ch109","title":"Adaptive Algorithms for Intelligent Geometric Computing","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Computer Graphics and Visualization Techniques","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 Calgary","funders":"","keywords":"Computer science; Visualization; Computation; Focus (optics); Terrain; Biometrics; Data mining; Algorithm; Artificial intelligence","score_opus":0.06151726145225705,"score_gpt":0.29956108285762567,"score_spread":0.23804382140536862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244216214","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.0013890762,0.01317538,0.9515555,0.0012908591,0.0011200868,0.00007631363,0.0001356688,0.0008685366,0.03038857],"genre_scores_gemma":[0.14591135,0.033876773,0.7627122,0.0013305023,0.0031682546,0.00083809166,0.0010167302,0.000707211,0.050439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992092,0.00020217655,0.000052903717,0.0001283815,0.00035688243,0.00005054298],"domain_scores_gemma":[0.9994042,0.00028094946,0.000031358246,0.00011006516,0.00015139834,0.00002203891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006904573,0.0013250527,0.0010086072,0.0010879615,0.00048308985,0.0021895084,0.0012766083,0.0014552148,0.0077339867],"category_scores_gemma":[0.002799151,0.00041144763,0.0010477299,0.0015187546,0.0014557759,0.0017479014,0.0018234703,0.0026940703,0.0038253248],"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.000034681103,0.00002555888,0.00024507364,0.0004389499,0.00007262919,0.00007519663,0.00013555442,0.108158424,0.0022738546,0.651398,0.022317605,0.21482448],"study_design_scores_gemma":[0.000021099238,0.00004137035,0.00019411197,0.0001370342,0.000020475354,0.00015083987,0.000044676886,0.36871517,0.0011061738,0.4477372,0.18180163,0.00003017551],"about_ca_topic_score_codex":0.00125403,"about_ca_topic_score_gemma":0.0009038235,"teacher_disagreement_score":0.0077339867,"about_ca_system_score_codex":0.0010089028,"about_ca_system_score_gemma":0.0008806213,"threshold_uncertainty_score":0.025872827},"labels":[],"label_agreement":null},{"id":"W4247922211","doi":"10.4018/978-1-60960-818-7.ch609","title":"Forecasting Supply Chain Demand Using Machine Learning Algorithms","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Supply chain; Ranking (information retrieval); Computer science; Demand forecasting; Quality (philosophy); Support vector machine; Supply and demand; Machine learning; Competition (biology); Noise (video); Artificial intelligence; Supply chain management; Distortion (music); Demand management; Operations research; Algorithm; Engineering; Marketing; Business; Economics; Microeconomics","score_opus":0.1585308921770113,"score_gpt":0.3428885349061645,"score_spread":0.1843576427291532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247922211","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.07838753,0.0029720974,0.9080865,0.00090257707,0.000112685986,0.00007245462,0.00070233835,0.0012305222,0.0075332983],"genre_scores_gemma":[0.5925917,0.0031808733,0.39465782,0.00013047668,0.0002073648,0.00016625317,0.0018173701,0.00008583825,0.0071623935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974066,0.00008283462,0.00002177741,0.00005682622,0.00007853536,0.00001933728],"domain_scores_gemma":[0.99847597,0.0012235477,0.000070154536,0.000058411842,0.00015736597,0.000014666897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605072,0.00076558586,0.00061326375,0.0011329656,0.00021895634,0.0009339076,0.0007609588,0.0008182017,0.0015212145],"category_scores_gemma":[0.0026290321,0.0003364538,0.0004079383,0.0019509946,0.00019507746,0.0013965068,0.00031615555,0.0008821511,0.0006439191],"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.000025963165,0.000040579675,0.0021022183,0.00005611072,0.000032125423,0.00003147664,0.00003682692,0.8484483,0.0005365644,0.0024479155,0.0019510381,0.1442909],"study_design_scores_gemma":[0.0000011601643,0.0000038565595,0.00023940307,0.0000061641636,0.0000018731201,0.0000047550448,0.000006653333,0.99705315,0.00015521176,0.0021172196,0.00040768928,0.0000029157516],"about_ca_topic_score_codex":0.008451482,"about_ca_topic_score_gemma":0.00572471,"teacher_disagreement_score":0.008451482,"about_ca_system_score_codex":0.00079459406,"about_ca_system_score_gemma":0.00046537296,"threshold_uncertainty_score":0.016804576},"labels":[],"label_agreement":null},{"id":"W4280576960","doi":"10.1007/s10994-022-06172-1","title":"MAGMA: inference and prediction using multi-task Gaussian processes with common mean","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Gaussian Processes and Bayesian Inference","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":"Artificial Intelligence in Medicine (Canada)","funders":"Army Research Laboratory; Army Research Office; Engineering and Physical Sciences Research Council; CHIST-ERA; Agence Nationale de la Recherche","keywords":"Gaussian process; Computer science; Task (project management); Inference; Computation; Process (computing); Gaussian; Machine learning; Data mining; Artificial intelligence; Algorithm","score_opus":0.016205121222673265,"score_gpt":0.24954763735420707,"score_spread":0.2333425161315338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280576960","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.0069957008,0.00017911084,0.9919007,0.00020878542,0.00003677603,0.000022242957,0.000043513977,0.00027888158,0.00033429806],"genre_scores_gemma":[0.659907,0.00043416233,0.33522716,0.00036422204,0.00023213451,0.00022151889,0.00036672386,0.00016838619,0.003078741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986659,0.0005562813,0.00006542144,0.0003385895,0.00022740746,0.0001463119],"domain_scores_gemma":[0.9947143,0.0039654355,0.0003275272,0.00034157172,0.0005204508,0.00013068525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004167861,0.0010829541,0.002309917,0.0010373741,0.0007219638,0.0017396258,0.0028103802,0.0022552707,0.0020015],"category_scores_gemma":[0.013397451,0.00089419505,0.0015597058,0.0015193309,0.0014607677,0.002081755,0.002305374,0.002989703,0.00047395844],"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.00009639391,0.000033853034,0.0006336977,0.000046211106,0.00007306365,0.000051339677,0.000048255664,0.94031477,0.0006153694,0.016563164,0.0008435572,0.040680375],"study_design_scores_gemma":[0.0000047239523,0.000008866454,0.000049042577,0.0000030444794,0.000004573689,0.000005058587,0.0000022259408,0.99414486,0.0001364646,0.0054997993,0.00013777922,0.0000036342076],"about_ca_topic_score_codex":0.013656341,"about_ca_topic_score_gemma":0.009160477,"teacher_disagreement_score":0.013656341,"about_ca_system_score_codex":0.0011333406,"about_ca_system_score_gemma":0.0019467738,"threshold_uncertainty_score":0.02715373},"labels":[],"label_agreement":null},{"id":"W4286632124","doi":"10.1007/s10994-022-06191-y","title":"Improving fairness generalization through a sample-robust optimization method","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"Canada Research Chairs; Centre International de Mathématiques et Informatique de Toulouse; Agence Nationale de la Recherche","keywords":"Computer science; Robustness (evolution); Machine learning; Scalability; Artificial intelligence; Generalization; Fairness measure; Heuristic; Metric (unit); Set (abstract data type); Generalization error; Artificial neural network; Throughput; Mathematics","score_opus":0.04930835796936283,"score_gpt":0.36396374213362154,"score_spread":0.3146553841642587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286632124","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.0048786183,0.00011563805,0.99341184,0.00030477613,0.000053811164,0.00005373947,0.000023469065,0.00029358373,0.0008645289],"genre_scores_gemma":[0.3819541,0.00021800626,0.6087508,0.000750151,0.0004135878,0.00043696704,0.00024584966,0.0005327919,0.0066977213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537754,0.0022170234,0.00017157098,0.0010309014,0.0008896509,0.00031324415],"domain_scores_gemma":[0.9847334,0.010535519,0.0007817786,0.0017386731,0.0017664752,0.00044415065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011157284,0.0016144741,0.0030128316,0.0015481064,0.0012078403,0.0017429978,0.0037896459,0.0033985851,0.004827119],"category_scores_gemma":[0.03260573,0.0009592957,0.0016884523,0.0011280016,0.0025321036,0.0032147265,0.0045789755,0.004158188,0.0009168373],"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.00029330002,0.00026292095,0.0011378585,0.00013836211,0.00017823304,0.00007242894,0.0001516644,0.820856,0.0021796124,0.06714187,0.0053609256,0.10222682],"study_design_scores_gemma":[0.000016544967,0.00002217266,0.000061858795,0.0000062522313,0.000009575768,0.0000072166104,0.0000049496025,0.9866917,0.00028447964,0.012673213,0.00021656833,0.000005562261],"about_ca_topic_score_codex":0.00524129,"about_ca_topic_score_gemma":0.004427407,"teacher_disagreement_score":0.011157284,"about_ca_system_score_codex":0.001800057,"about_ca_system_score_gemma":0.0037725018,"threshold_uncertainty_score":0.059006095},"labels":[],"label_agreement":null},{"id":"W4297691576","doi":"10.1007/s10994-022-06212-w","title":"Speeding up neural network robustness verification via algorithm configuration and an optimised mixed integer linear programming solver portfolio","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Robustness (evolution); Artificial neural network; Solver; Algorithm; Linear programming; Integer programming; Scalability; Machine learning; Artificial intelligence; Programming language; Database","score_opus":0.01773640680379212,"score_gpt":0.26762500283110385,"score_spread":0.24988859602731173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297691576","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.06955975,0.00022971242,0.91342634,0.0006140986,0.00008252763,0.00022025446,0.00015994263,0.007352462,0.0083548995],"genre_scores_gemma":[0.6006495,0.00008608156,0.39516008,0.00028962013,0.000032083302,0.00026359048,0.00032555786,0.00077121926,0.002422312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671197,0.0014660337,0.00015745872,0.00050279626,0.00081304956,0.0003487371],"domain_scores_gemma":[0.99092567,0.0065111048,0.0007037709,0.0010540071,0.00064290187,0.00016249773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033316824,0.0016621066,0.0009375687,0.0008711362,0.00050217874,0.0016834881,0.0019541355,0.0016750236,0.007662088],"category_scores_gemma":[0.017631227,0.00093417766,0.0011786828,0.00049951696,0.0016500085,0.0021987758,0.0024599524,0.0027291286,0.0012265384],"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.00024037443,0.00011576919,0.001050822,0.00010080788,0.000043567325,0.00013669659,0.000043414482,0.9251359,0.004716179,0.013273802,0.0019303663,0.053212203],"study_design_scores_gemma":[0.00001844592,0.000025258649,0.00003667612,0.000008109679,0.0000050600183,0.000013018416,0.000005765659,0.99365354,0.0023257444,0.0036339639,0.00027076245,0.0000036022159],"about_ca_topic_score_codex":0.0024995082,"about_ca_topic_score_gemma":0.003125545,"teacher_disagreement_score":0.007662088,"about_ca_system_score_codex":0.0013823168,"about_ca_system_score_gemma":0.002354878,"threshold_uncertainty_score":0.025632262},"labels":[],"label_agreement":null},{"id":"W4313421115","doi":"10.1007/s10994-022-06282-w","title":"Automated imbalanced classification via layered learning","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa; Dalhousie University","funders":"Canada Research Chairs","keywords":"Overfitting; Artificial intelligence; Computer science; Machine learning; Decision boundary; Cluster analysis; Resampling; Benchmark (surveying); Class (philosophy); Binary classification; Data mining; Oversampling; Pattern recognition (psychology); Support vector machine; Artificial neural network","score_opus":0.016691511570374844,"score_gpt":0.2665123368446004,"score_spread":0.24982082527422556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313421115","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.03279098,0.0003804653,0.9586244,0.00051342224,0.00016425163,0.00010173378,0.000608916,0.0056411126,0.0011746895],"genre_scores_gemma":[0.49843758,0.00032313523,0.49223164,0.00035985824,0.0002718431,0.00027214608,0.0033249073,0.0006072229,0.0041717347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995059,0.0013328909,0.00033732236,0.000874654,0.0018541977,0.00054189586],"domain_scores_gemma":[0.99081284,0.002617827,0.00082583906,0.0031462132,0.0021976638,0.00039966207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059131486,0.0017208444,0.002148391,0.0031979275,0.0011540403,0.0036580246,0.00296266,0.0016449483,0.0029687143],"category_scores_gemma":[0.016952666,0.0008434742,0.0015746271,0.0025677115,0.00096801145,0.004884168,0.004954225,0.003696416,0.0023599693],"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.0007917883,0.0006414779,0.013116202,0.00023575392,0.0002805019,0.00020927993,0.00027800148,0.08978186,0.020399945,0.013231947,0.023631858,0.8374014],"study_design_scores_gemma":[0.000023392886,0.000060825656,0.0012849576,0.000023547975,0.000045804274,0.00008237296,0.00006288743,0.96419185,0.0076249773,0.024125105,0.0024509898,0.00002325706],"about_ca_topic_score_codex":0.0023193592,"about_ca_topic_score_gemma":0.0037813238,"teacher_disagreement_score":0.0059131486,"about_ca_system_score_codex":0.001326992,"about_ca_system_score_gemma":0.002141884,"threshold_uncertainty_score":0.031272113},"labels":[],"label_agreement":null},{"id":"W4313421210","doi":"10.1007/s10994-022-06268-8","title":"The class imbalance problem in deep learning","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":270,"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; National Research Council Canada; University of Alberta","funders":"","keywords":"Artificial intelligence; Deep learning; Computer science; Machine learning; Class (philosophy); Context (archaeology)","score_opus":0.007893058798280584,"score_gpt":0.2351205030355744,"score_spread":0.22722744423729382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313421210","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021494867,0.0035251693,0.96775913,0.0040741726,0.0005334838,0.00006431165,0.00025950716,0.00034012462,0.0019492377],"genre_scores_gemma":[0.6581174,0.0048474744,0.32124943,0.0025417171,0.0024959552,0.0005685629,0.0010910969,0.00036983125,0.008718563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99156696,0.0033273436,0.00047554827,0.0014906937,0.0027000338,0.00043945468],"domain_scores_gemma":[0.9776968,0.0155133065,0.0017234815,0.002497587,0.0021649203,0.00040395907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014494082,0.00096694176,0.0022279487,0.001564289,0.0014922204,0.0035101238,0.0025785903,0.0028479402,0.0017773091],"category_scores_gemma":[0.049421962,0.0010529772,0.0009166725,0.002789885,0.0030693407,0.0081028845,0.0037224565,0.0071285837,0.00045755092],"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.0005641942,0.0003346279,0.012507619,0.00068797247,0.0002931908,0.00037369263,0.000603973,0.1315224,0.0026206835,0.26856145,0.031972133,0.5499581],"study_design_scores_gemma":[0.00003842068,0.00006743457,0.0016078365,0.000107853084,0.000046042467,0.00020160046,0.00011087946,0.56316954,0.0026457596,0.42502323,0.0069534983,0.000027991386],"about_ca_topic_score_codex":0.0020372614,"about_ca_topic_score_gemma":0.0021171665,"teacher_disagreement_score":0.014494082,"about_ca_system_score_codex":0.0021335261,"about_ca_system_score_gemma":0.0020415296,"threshold_uncertainty_score":0.076652944},"labels":[],"label_agreement":null},{"id":"W4321016149","doi":"10.1007/s10994-023-06305-0","title":"Diverse and consistent multi-view networks for semi-supervised regression","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Data Classification","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":"Canada Research Chairs; University of Toronto; University of New Brunswick","funders":"Institute for Infocomm Research; Agency for Science, Technology and Research","keywords":"DICOM; Computer science; Consistency (knowledge bases); Probabilistic logic; Artificial intelligence; Machine learning; Graphical model; Data mining; Regression; Mathematics","score_opus":0.04672530729582696,"score_gpt":0.29844873456331644,"score_spread":0.2517234272674895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321016149","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.005104038,0.0003426702,0.9937943,0.0001639715,0.000023884722,0.00002035258,0.00008033788,0.00017641472,0.00029408495],"genre_scores_gemma":[0.49164814,0.0009196634,0.49978283,0.0004634848,0.00028623422,0.00039294915,0.0015651126,0.0003948575,0.0045467303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971872,0.0014952194,0.00012606419,0.0006616311,0.00039786572,0.00013202746],"domain_scores_gemma":[0.98741317,0.008938318,0.0007263669,0.0015462628,0.0010202148,0.00035574727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045514856,0.0013311413,0.0019459687,0.0011888292,0.0007687411,0.0015129605,0.002964872,0.0034304664,0.0020973964],"category_scores_gemma":[0.019149384,0.0012987588,0.0013735448,0.001198694,0.0016643235,0.0034060553,0.0035633433,0.0041352324,0.0008823818],"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.00034257275,0.00018137095,0.0020204808,0.00022361666,0.00024908182,0.0001923731,0.00022890866,0.6887245,0.004798815,0.066501416,0.0062103183,0.23032652],"study_design_scores_gemma":[0.00000566085,0.000022630318,0.00009999135,0.000009829042,0.000007556764,0.00002026324,0.000008637102,0.97739273,0.0003123185,0.021810412,0.00030296392,0.000006908113],"about_ca_topic_score_codex":0.002522289,"about_ca_topic_score_gemma":0.0040564197,"teacher_disagreement_score":0.0045514856,"about_ca_system_score_codex":0.0009776717,"about_ca_system_score_gemma":0.0009722105,"threshold_uncertainty_score":0.024070859},"labels":[],"label_agreement":null},{"id":"W4364381349","doi":"10.1007/s10994-023-06326-9","title":"Understanding CNN fragility when learning with imbalanced data","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"Office of Naval Research","keywords":"Convolutional neural network; Class (philosophy); Artificial intelligence; Computer science; Feature (linguistics); Focus (optics); Pattern recognition (psychology); Set (abstract data type); Machine learning; Image (mathematics)","score_opus":0.14952743444589864,"score_gpt":0.30261477515111007,"score_spread":0.15308734070521143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364381349","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.89096224,0.0007332864,0.10252599,0.0020318485,0.00012138468,0.000079997655,0.0006027473,0.00085653615,0.002086021],"genre_scores_gemma":[0.9913455,0.00008705605,0.0074156695,0.00019355844,0.000035154273,0.000040758674,0.0004150901,0.00004561482,0.00042170807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989656,0.00021055085,0.000067083485,0.00028721037,0.00027533437,0.00019428734],"domain_scores_gemma":[0.9914335,0.0044248337,0.0014660114,0.0013237,0.00096403307,0.0003879259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032830595,0.00087326404,0.000751846,0.0011994963,0.00069335796,0.0014714263,0.0014901614,0.0011916925,0.0011702162],"category_scores_gemma":[0.023519663,0.00054288073,0.0005181822,0.00076636183,0.0014502413,0.0034016182,0.0016703209,0.002316069,0.00024784438],"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.000880408,0.00030002117,0.073758185,0.00019148798,0.00017732813,0.0006418719,0.00041123587,0.783715,0.016582567,0.012150157,0.005534855,0.10565685],"study_design_scores_gemma":[0.000010925333,0.000053368523,0.0070829764,0.000017923843,0.000013336902,0.00006769493,0.00007252708,0.9751363,0.0040936004,0.013019961,0.00042001743,0.00001141275],"about_ca_topic_score_codex":0.00520066,"about_ca_topic_score_gemma":0.004706862,"teacher_disagreement_score":0.00520066,"about_ca_system_score_codex":0.0027315253,"about_ca_system_score_gemma":0.0005760792,"threshold_uncertainty_score":0.019818723},"labels":[],"label_agreement":null},{"id":"W4376636921","doi":"10.1007/s10994-023-06332-x","title":"Federated learning with superquantile aggregation for heterogeneous data","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research; Agence Nationale de la Recherche; National Science Foundation","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.05211959121355498,"score_gpt":0.29835848739190035,"score_spread":0.24623889617834538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376636921","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.033443335,0.00030426466,0.9631323,0.00047847422,0.00005838862,0.00005799643,0.00028591443,0.0012315706,0.0010077548],"genre_scores_gemma":[0.70017934,0.00018976603,0.29507637,0.00034947367,0.0001154462,0.00013783961,0.0009416897,0.00021546992,0.002794563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943223,0.0019015123,0.0004711351,0.000950316,0.0017145424,0.0006401025],"domain_scores_gemma":[0.98725486,0.003064109,0.0006125457,0.007890226,0.0009635883,0.0002145859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007830024,0.00067878276,0.0017978136,0.0014678459,0.0014371305,0.004045433,0.002377869,0.001257906,0.0020289787],"category_scores_gemma":[0.016343793,0.0005367709,0.0012420181,0.0027237027,0.0014918895,0.006974494,0.006218248,0.0024650486,0.00056312385],"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.0019004649,0.00063309266,0.007906568,0.00023287689,0.00043944232,0.0007268827,0.00080878165,0.31826815,0.011292644,0.23234114,0.01021141,0.41523853],"study_design_scores_gemma":[0.000028750259,0.0000636044,0.00042964148,0.000022106851,0.000036206842,0.00014696729,0.00008624728,0.7698513,0.006355324,0.22095841,0.0020014883,0.000019888228],"about_ca_topic_score_codex":0.0019214583,"about_ca_topic_score_gemma":0.0029281962,"teacher_disagreement_score":0.007830024,"about_ca_system_score_codex":0.0014982461,"about_ca_system_score_gemma":0.002188092,"threshold_uncertainty_score":0.04140961},"labels":[],"label_agreement":null},{"id":"W4386126338","doi":"10.1007/s10994-023-06368-z","title":"Cautious policy programming: exploiting KL regularization for monotonic policy improvement in reinforcement learning","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science","keywords":"Reinforcement learning; Monotonic function; Computer science; Mathematical optimization; Regularization (linguistics); Bellman equation; Entropy (arrow of time); Maximization; Upper and lower bounds; Exploit; Artificial intelligence; Mathematics","score_opus":0.017741848969039416,"score_gpt":0.2845911047478464,"score_spread":0.26684925577880697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386126338","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.012801321,0.00008983615,0.98547333,0.00021304436,0.000021189537,0.000033587567,0.0000073542897,0.00015192958,0.0012084505],"genre_scores_gemma":[0.75954944,0.000108295644,0.23765045,0.00033806957,0.000052175983,0.0001878915,0.000033428663,0.00013202633,0.0019482577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881494,0.0005271801,0.00004750833,0.00019987585,0.00029356236,0.00011687131],"domain_scores_gemma":[0.9956293,0.002981045,0.00043207465,0.00030783864,0.00043584863,0.00021398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032194145,0.0008735629,0.0010929842,0.00055843923,0.00045680595,0.0009710325,0.0015022283,0.0013393984,0.0014394136],"category_scores_gemma":[0.011340262,0.0004942639,0.00040972698,0.00044707351,0.0022121335,0.0014884227,0.0018720459,0.0026642568,0.0002334457],"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.000109830966,0.000086100015,0.00067856145,0.000060223683,0.000036595295,0.000063819,0.00009729919,0.9074284,0.0031725094,0.04271054,0.000880099,0.044676077],"study_design_scores_gemma":[0.0000073822684,0.00002247797,0.000021896793,0.000004314803,0.0000015789269,0.000005402389,0.0000020475375,0.99366635,0.00036709875,0.00577041,0.00012803123,0.0000029106234],"about_ca_topic_score_codex":0.0018748858,"about_ca_topic_score_gemma":0.0014217091,"teacher_disagreement_score":0.0032194145,"about_ca_system_score_codex":0.0009406584,"about_ca_system_score_gemma":0.0016239354,"threshold_uncertainty_score":0.017026067},"labels":[],"label_agreement":null},{"id":"W4386838733","doi":"10.1007/s10994-023-06391-0","title":"A general framework for the practical disintegration of PAC-Bayesian bounds","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Generalization; Computer science; Bayesian probability; Artificial neural network; Artificial intelligence; Generalization error; Bayesian network; Machine learning; Algorithm; Mathematics","score_opus":0.022321818771002738,"score_gpt":0.33163513537195954,"score_spread":0.3093133166009568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386838733","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.0005475745,0.0003126419,0.9880101,0.0011860185,0.00013073573,0.000039499464,0.000064079846,0.0001479823,0.00956131],"genre_scores_gemma":[0.14480272,0.0016974233,0.8353569,0.0023398383,0.0017994448,0.00071325933,0.00037297895,0.0006459,0.012271538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856054,0.0064774347,0.00075793045,0.0018318413,0.004469929,0.0008574024],"domain_scores_gemma":[0.96815354,0.018165104,0.0010005804,0.007700245,0.004118947,0.00086151273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018644817,0.002875682,0.002530684,0.0032413786,0.002945842,0.007613972,0.008042088,0.0053954986,0.016472146],"category_scores_gemma":[0.07165042,0.0023638997,0.0031754586,0.0039048716,0.00855757,0.018579504,0.010711995,0.01715259,0.0037173016],"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.000013756244,0.000012940641,0.000052106738,0.00003309567,0.000012644296,0.00003476626,0.00006156661,0.0066739097,0.00012226606,0.9833055,0.0019202327,0.0077571175],"study_design_scores_gemma":[0.000009408791,0.00001282568,0.000029687431,0.00003154267,0.000010572254,0.000042553274,0.000013872601,0.05017048,0.00018322463,0.94429564,0.005184129,0.000016014646],"about_ca_topic_score_codex":0.00431563,"about_ca_topic_score_gemma":0.004109059,"teacher_disagreement_score":0.018644817,"about_ca_system_score_codex":0.0043211826,"about_ca_system_score_gemma":0.0041433997,"threshold_uncertainty_score":0.09860444},"labels":[],"label_agreement":null},{"id":"W4388488218","doi":"10.1007/s10994-023-06413-x","title":"GVFs in the real world: making predictions online for water treatment","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Alberta","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Observability; Computer science; Hyperparameter; Reinforcement learning; Predictability; Artificial intelligence; Machine learning; Online learning; Artificial neural network; Software deployment; Online and offline; Data mining; Mathematics; Statistics","score_opus":0.04528288908384457,"score_gpt":0.3443340184857532,"score_spread":0.2990511294019086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388488218","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.3936387,0.00030369338,0.59886044,0.001707807,0.00018473888,0.00008081944,0.00019546192,0.0018996599,0.0031286646],"genre_scores_gemma":[0.9706981,0.000037131194,0.02848108,0.00008519735,0.000014910076,0.000021307791,0.00006604325,0.000033955133,0.00056223985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.00012237961,0.000012029911,0.00007739851,0.00005249706,0.00003676739],"domain_scores_gemma":[0.99778444,0.0014336461,0.0001956367,0.00020309618,0.00027397322,0.000109296256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013762134,0.00052587676,0.000519339,0.00023316963,0.00029078755,0.00058890955,0.0009155876,0.0007713866,0.0013208915],"category_scores_gemma":[0.0065488997,0.00025153765,0.00021896407,0.00024274517,0.0005198937,0.0013231674,0.0006203806,0.0014105641,0.00027258933],"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.00011293712,0.00007505763,0.0024642707,0.000020610909,0.000016616608,0.000047582802,0.000040878196,0.96486735,0.0013249236,0.0012665843,0.00084461615,0.028918557],"study_design_scores_gemma":[0.000003412935,0.000013603431,0.00015829373,0.0000015001548,0.0000010652177,0.0000022414933,0.0000048530583,0.99842334,0.00045203243,0.0008337266,0.00010392389,0.0000020738908],"about_ca_topic_score_codex":0.008660407,"about_ca_topic_score_gemma":0.006972969,"teacher_disagreement_score":0.008660407,"about_ca_system_score_codex":0.00069593376,"about_ca_system_score_gemma":0.000721295,"threshold_uncertainty_score":0.01722002},"labels":[],"label_agreement":null},{"id":"W4389074848","doi":"10.1007/s10994-023-06460-4","title":"Multi-agent reinforcement learning for fast-timescale demand response of residential loads","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Samsung; Institut de Valorisation des Données; Microsoft Research","keywords":"Reinforcement learning; Computer science; Demand response; Renewable energy; Distributed computing; Power (physics); Artificial intelligence; Engineering; Electrical engineering; Electricity","score_opus":0.01256083026442792,"score_gpt":0.24168967895844878,"score_spread":0.22912884869402086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389074848","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.15226796,0.00030908524,0.84295833,0.00053212815,0.000104484294,0.00007951407,0.00008169483,0.00059143035,0.0030753647],"genre_scores_gemma":[0.9890366,0.000028393497,0.009803445,0.000036082605,0.000012280704,0.00003215037,0.000027770173,0.000016646212,0.001006626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996424,0.00014694587,0.000015694119,0.000065630826,0.000059629343,0.0000697512],"domain_scores_gemma":[0.99777204,0.0016225838,0.00018684418,0.00007514974,0.0002432155,0.00010007317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014579972,0.0005963319,0.0009883186,0.00031382882,0.0003637735,0.0005966497,0.0008768711,0.0009386248,0.0016908104],"category_scores_gemma":[0.0046613934,0.0004017588,0.00030127598,0.0002631495,0.00056751847,0.0006291518,0.0008075986,0.0012185171,0.00022753814],"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.000050491166,0.00003448262,0.0002425021,0.000014584147,0.0000089015675,0.000025107152,0.000014349691,0.99185175,0.0002813371,0.0009499789,0.00025734524,0.006269122],"study_design_scores_gemma":[0.0000025428824,0.000004303883,0.000020433208,4.420262e-7,5.2221185e-7,0.0000010088058,8.749298e-7,0.9997296,0.00003126503,0.00019359015,0.000014916444,5.218873e-7],"about_ca_topic_score_codex":0.009679208,"about_ca_topic_score_gemma":0.008222916,"teacher_disagreement_score":0.009679208,"about_ca_system_score_codex":0.0008159641,"about_ca_system_score_gemma":0.00083605247,"threshold_uncertainty_score":0.019245744},"labels":[],"label_agreement":null},{"id":"W4389914665","doi":"10.1007/s10994-023-06410-0","title":"Heterogeneous multi-task feature learning with mixed $$\\ell _{2,1}$$ regularization","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regularization (linguistics); Multi-task learning; Artificial intelligence; Computer science; Pattern recognition (psychology); Task (project management); Machine learning; Feature (linguistics); Feature learning; Mathematics; Engineering","score_opus":0.01001073199106917,"score_gpt":0.21192493207020055,"score_spread":0.20191420007913138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389914665","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.0026580193,0.00013546179,0.9959317,0.0002528793,0.000051601222,0.000024270428,0.0001127112,0.00023153362,0.0006018864],"genre_scores_gemma":[0.3160838,0.00052389497,0.6714534,0.0011950644,0.000502224,0.00049001444,0.0016244708,0.00042097992,0.0077061104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998536,0.0006624742,0.00005632325,0.0002982897,0.00030623283,0.00014072134],"domain_scores_gemma":[0.9981001,0.0009963549,0.00014306272,0.00038674817,0.00026481858,0.00010891425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024556466,0.0019042912,0.0017483558,0.00062380376,0.00061453757,0.001269573,0.002448879,0.0028717497,0.0030955193],"category_scores_gemma":[0.0071862587,0.00077148696,0.0013345216,0.0014161761,0.0014887616,0.0020128032,0.002955918,0.0027207641,0.0012175593],"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.00077293563,0.00043991534,0.0009194169,0.00033957913,0.00028098642,0.00030963647,0.00016420893,0.5691702,0.014567371,0.07989541,0.03245393,0.3006864],"study_design_scores_gemma":[0.000020192705,0.000032870594,0.00008280012,0.000007222186,0.000011924599,0.000033618537,0.000007854897,0.98388195,0.00100466,0.013915082,0.0009908039,0.000011041753],"about_ca_topic_score_codex":0.0030490812,"about_ca_topic_score_gemma":0.004341001,"teacher_disagreement_score":0.0030955193,"about_ca_system_score_codex":0.0005121202,"about_ca_system_score_gemma":0.0012605373,"threshold_uncertainty_score":0.012986898},"labels":[],"label_agreement":null},{"id":"W4390906071","doi":"10.1007/s10994-023-06414-w","title":"Understanding imbalanced data: XAI & interpretable ML framework","year":2024,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","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":"National Research Council Canada","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Class (philosophy); Deep learning; Focus (optics); Key (lock); Outlier; Set (abstract data type); Data mining","score_opus":0.13825777887594604,"score_gpt":0.34134489256745015,"score_spread":0.20308711369150412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390906071","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.0020407322,0.00021516997,0.99276793,0.0015239455,0.000058396876,0.000046496287,0.00034550155,0.0016550778,0.0013467838],"genre_scores_gemma":[0.26679024,0.0007436272,0.7226338,0.001307176,0.0007373204,0.0005600579,0.002114244,0.0010834074,0.004030206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596775,0.001710824,0.00020821785,0.0007258177,0.0011295347,0.00025776116],"domain_scores_gemma":[0.9860086,0.008598516,0.0011201306,0.0021842124,0.0016821948,0.00040622687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00983663,0.0012592269,0.0013620341,0.0033945714,0.0009979117,0.0055692988,0.0038957293,0.0020392595,0.007212304],"category_scores_gemma":[0.0418264,0.00081754907,0.0014346233,0.0024807293,0.0029985968,0.006762307,0.0063895895,0.005795203,0.002308895],"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.00024109292,0.0002118399,0.0064573335,0.00030513149,0.00014765061,0.0004437292,0.00090127613,0.2376208,0.0018925107,0.38466427,0.033073317,0.33404103],"study_design_scores_gemma":[0.000013397989,0.000017591854,0.00032506548,0.00005344181,0.000012993297,0.000059335827,0.00007944109,0.7520838,0.00066226296,0.24087353,0.005804778,0.0000144410105],"about_ca_topic_score_codex":0.0027237479,"about_ca_topic_score_gemma":0.0027412835,"teacher_disagreement_score":0.00983663,"about_ca_system_score_codex":0.0020155848,"about_ca_system_score_gemma":0.0020982558,"threshold_uncertainty_score":0.052021682},"labels":[],"label_agreement":null},{"id":"W4391127911","doi":"10.1007/s10994-023-06497-5","title":"Empirical analysis of performance assessment for imbalanced classification","year":2024,"lang":"en","type":"article","venue":"Machine Learning","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Machine learning; Computer science","score_opus":0.0385424843247923,"score_gpt":0.3639158091002024,"score_spread":0.3253733247754101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127911","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.7359208,0.0076837726,0.240553,0.0025320712,0.00047667083,0.00024698387,0.0030501448,0.0019489332,0.007587681],"genre_scores_gemma":[0.9684364,0.00045682627,0.027222198,0.0001370015,0.00019742592,0.00008709623,0.0022805051,0.00016201481,0.0010204893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9744598,0.013131804,0.0014810415,0.0024223449,0.007625955,0.0008790275],"domain_scores_gemma":[0.71638817,0.23168814,0.010577937,0.020815292,0.018580398,0.0019501036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036150973,0.0014078498,0.0013804507,0.0038712479,0.00082332967,0.0022605516,0.0014907533,0.0019587574,0.0016016884],"category_scores_gemma":[0.17949899,0.00029836353,0.00064718636,0.0029963837,0.001517507,0.0034036008,0.0016945936,0.0015955498,0.0007124243],"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.0039473264,0.0014485951,0.17047836,0.0010592096,0.0011231226,0.00040746244,0.00082802813,0.3164982,0.009436622,0.019626018,0.030073259,0.4450738],"study_design_scores_gemma":[0.00010152684,0.0011306114,0.043557,0.00013150007,0.00018594973,0.00072387286,0.00040724064,0.92544466,0.008031702,0.016754983,0.0034487438,0.00008218061],"about_ca_topic_score_codex":0.0014010159,"about_ca_topic_score_gemma":0.001031116,"teacher_disagreement_score":0.036150973,"about_ca_system_score_codex":0.0017903637,"about_ca_system_score_gemma":0.0011069566,"threshold_uncertainty_score":0.1911869},"labels":[],"label_agreement":null},{"id":"W4392094980","doi":"10.1007/s10994-024-06514-1","title":"Correction to: Multi-agent reinforcement learning for fast-timescale demand response of residential loads","year":2024,"lang":"en","type":"article","venue":"Machine Learning","topic":"Smart Grid Energy Management","field":"Engineering","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":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Demand response; Artificial intelligence; Engineering; Structural engineering; Electrical engineering","score_opus":0.00856574228745731,"score_gpt":0.2416009840240008,"score_spread":0.2330352417365435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392094980","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005323092,0.0007154861,0.005603533,0.03971852,0.9483635,0.00004344019,0.0018175914,0.0014516575,0.0017539931],"genre_scores_gemma":[0.13808464,0.006420574,0.033958085,0.07849834,0.47129774,0.0005090665,0.0071192095,0.004079845,0.26003245],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99637705,0.00054648623,0.0006664407,0.0007950816,0.001199837,0.00041506081],"domain_scores_gemma":[0.95871526,0.011488639,0.0018878725,0.0035574809,0.022450224,0.0019004486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030251544,0.0024710968,0.0032246413,0.00298602,0.0026362839,0.003290184,0.0048460257,0.009054562,0.12570164],"category_scores_gemma":[0.07613273,0.0011400894,0.0016960987,0.0033796018,0.0022753456,0.0029971404,0.0031242676,0.00883451,0.053098027],"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.00013091143,0.000020631536,0.00026951425,0.0002323575,0.000044687113,0.00048479033,0.00007078918,0.0008259961,0.00018161372,0.00262651,0.98301876,0.01209351],"study_design_scores_gemma":[0.00029205796,0.00009478741,0.0031641803,0.00035557247,0.00006885468,0.0014284006,0.0003026225,0.015923576,0.0020409445,0.012358825,0.96375006,0.00022018458],"about_ca_topic_score_codex":0.012156516,"about_ca_topic_score_gemma":0.011509961,"teacher_disagreement_score":0.12570164,"about_ca_system_score_codex":0.0034561043,"about_ca_system_score_gemma":0.0033037676,"threshold_uncertainty_score":0.42051387},"labels":[],"label_agreement":null},{"id":"W4400073212","doi":"10.1007/s10994-024-06541-y","title":"Secure and fast asynchronous Vertical Federated Learning via cascaded hybrid optimization","year":2024,"lang":"en","type":"article","venue":"Machine Learning","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Asynchronous learning; Distributed computing; Artificial intelligence; Computer network; Mathematics; Synchronous learning; Cooperative learning; Mathematics education","score_opus":0.009790899163707976,"score_gpt":0.24336011641232386,"score_spread":0.23356921724861587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400073212","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.028954247,0.00017027832,0.9664473,0.00030606138,0.00009033139,0.0000534178,0.00012347191,0.0014716652,0.0023831301],"genre_scores_gemma":[0.8615952,0.000097264885,0.13305518,0.00021246469,0.000074188974,0.00012275258,0.00024582696,0.00019031647,0.0044068065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786013,0.0005447941,0.00010644128,0.0004615314,0.00057102373,0.0004560946],"domain_scores_gemma":[0.99687177,0.0014662744,0.00019043934,0.0009784728,0.00035358584,0.00013947678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021717544,0.0010330215,0.0015243501,0.00051545526,0.0010212862,0.0018806045,0.0021545906,0.0015236934,0.005193742],"category_scores_gemma":[0.0070083034,0.0005458853,0.0009049636,0.00078415056,0.0012855766,0.0031746107,0.0038207993,0.0021074545,0.0010922763],"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.0016545192,0.00037213412,0.0014490993,0.0001617578,0.00014148487,0.00028135383,0.00015473916,0.68442684,0.010218753,0.10087728,0.009534654,0.1907274],"study_design_scores_gemma":[0.000019053727,0.000032083102,0.000059909748,0.0000048408683,0.0000073580736,0.000024449098,0.000008100908,0.976922,0.0014524503,0.021222131,0.000241796,0.000005874799],"about_ca_topic_score_codex":0.0019484654,"about_ca_topic_score_gemma":0.0030475957,"teacher_disagreement_score":0.005193742,"about_ca_system_score_codex":0.0010354448,"about_ca_system_score_gemma":0.0021131109,"threshold_uncertainty_score":0.017374814},"labels":[],"label_agreement":null},{"id":"W4407200740","doi":"10.1007/s10994-024-06659-z","title":"Robust query performance prediction for dense retrievers via adaptive disturbance generation","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Disturbance (geology); Computer science; Artificial intelligence; Control theory (sociology); Pattern recognition (psychology); Biology; Control (management)","score_opus":0.02459554223764634,"score_gpt":0.2541639193749147,"score_spread":0.22956837713726838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407200740","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.06504699,0.00047087728,0.93166476,0.00020184826,0.000056626886,0.000060616818,0.00017341466,0.0012156233,0.0011093353],"genre_scores_gemma":[0.9489013,0.00018445292,0.04851734,0.00007296169,0.0000758586,0.000051420317,0.0004405738,0.000088419474,0.0016676619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918336,0.00010972582,0.000039456758,0.00017484861,0.0003438135,0.0001489196],"domain_scores_gemma":[0.99797493,0.0010137573,0.00022400789,0.00028079713,0.00043303933,0.00007347749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180484,0.0007630389,0.0011213217,0.0006553971,0.00027892916,0.0009134402,0.0010262365,0.00072758464,0.0010005301],"category_scores_gemma":[0.0052207448,0.00032301524,0.00031137723,0.0008145785,0.00055736693,0.0010169438,0.0008403487,0.0009029244,0.0006101502],"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.0007845068,0.0002210327,0.00355425,0.00013825779,0.00006450201,0.0001648003,0.000076846816,0.7271619,0.037842702,0.004010856,0.0033865992,0.22259371],"study_design_scores_gemma":[0.000005342409,0.000024489478,0.0003612596,0.0000014275686,0.0000044056787,0.000013424028,0.000005021477,0.9967758,0.00215086,0.0005460468,0.0001078702,0.00000418237],"about_ca_topic_score_codex":0.005974723,"about_ca_topic_score_gemma":0.0064889607,"teacher_disagreement_score":0.005974723,"about_ca_system_score_codex":0.0007195512,"about_ca_system_score_gemma":0.0008273752,"threshold_uncertainty_score":0.011879861},"labels":[],"label_agreement":null},{"id":"W4407241185","doi":"10.1007/s10994-024-06670-4","title":"Schema-tune: noise-driven bias mitigation in transformer-based language models","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Schema (genetic algorithms); Transformer; Artificial intelligence; Natural language processing; Machine learning; Speech recognition; Engineering; Electrical engineering","score_opus":0.018024811983866115,"score_gpt":0.2643060661716281,"score_spread":0.24628125418776198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407241185","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.01330603,0.00027331794,0.9765866,0.0002403531,0.00010129589,0.00006321753,0.00061740674,0.0077724005,0.0010394602],"genre_scores_gemma":[0.53861666,0.000510439,0.44924963,0.0005793054,0.00016431586,0.00023791453,0.0037938538,0.0028805032,0.0039673815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886984,0.0004668337,0.000070100665,0.00028876224,0.0002107476,0.000093648814],"domain_scores_gemma":[0.99724305,0.0014763693,0.00009693949,0.00066792505,0.00041289258,0.000102851605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023964972,0.0007791496,0.00083806727,0.00066150544,0.00036651196,0.001402978,0.001718941,0.0009971495,0.0044003073],"category_scores_gemma":[0.010637139,0.0005016929,0.0010022775,0.0007644337,0.00048512785,0.0026735628,0.0019372246,0.0021351185,0.0030341202],"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.0012060427,0.00030915113,0.0043696202,0.0005877334,0.00043700848,0.0002750089,0.00073497294,0.16233422,0.040551923,0.054769386,0.033431347,0.70099366],"study_design_scores_gemma":[0.00006303724,0.000056581004,0.00024769016,0.000019532588,0.000059962116,0.000097024524,0.0000648436,0.9461794,0.013318113,0.03537262,0.004501036,0.000020207064],"about_ca_topic_score_codex":0.002324363,"about_ca_topic_score_gemma":0.0050523365,"teacher_disagreement_score":0.0044003073,"about_ca_system_score_codex":0.0005232056,"about_ca_system_score_gemma":0.0012847253,"threshold_uncertainty_score":0.0147204995},"labels":[],"label_agreement":null},{"id":"W4407939460","doi":"10.1007/s10994-025-06752-x","title":"A contrastive neural disentanglement approach for query performance prediction","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Artificial neural network; Natural language processing","score_opus":0.009212424396369148,"score_gpt":0.238969669819153,"score_spread":0.22975724542278383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407939460","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.12770028,0.0012729478,0.861486,0.0007299286,0.00017486906,0.00013032199,0.00049979135,0.0010221527,0.006983682],"genre_scores_gemma":[0.901279,0.00027789842,0.093606494,0.0001719262,0.00018777869,0.00007961164,0.00044038173,0.000100493824,0.003856365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987669,0.0003581817,0.00006364139,0.00030184514,0.00038498375,0.00012441546],"domain_scores_gemma":[0.99617565,0.002353674,0.0003037151,0.0004626443,0.00058200763,0.00012225212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002414919,0.0007365352,0.0009495061,0.0016367098,0.0004020722,0.0014292403,0.0018952353,0.0008662877,0.0026971702],"category_scores_gemma":[0.008778914,0.00032214524,0.0004306669,0.0014898862,0.00055220095,0.0027552682,0.0014165848,0.0020538373,0.0005458133],"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.00246515,0.0011070127,0.018369082,0.00022072012,0.0002481618,0.0002856175,0.00026773335,0.11192227,0.052272197,0.052451003,0.0057267994,0.7546642],"study_design_scores_gemma":[0.000017911052,0.00011967579,0.0028660924,0.000009366476,0.000032734577,0.00004969507,0.00002078107,0.9807998,0.003934805,0.011140531,0.0009903222,0.000018197483],"about_ca_topic_score_codex":0.0048671863,"about_ca_topic_score_gemma":0.0069613294,"teacher_disagreement_score":0.0048671863,"about_ca_system_score_codex":0.0009321145,"about_ca_system_score_gemma":0.00075182953,"threshold_uncertainty_score":0.012771428},"labels":[],"label_agreement":null},{"id":"W4408558613","doi":"10.1007/s10994-024-06664-2","title":"Gender disentangled representation learning in neural rankers","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Neural dynamics and brain function","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 Guelph; Toronto Metropolitan University; University of Waterloo; University of Toronto","funders":"","keywords":"Representation (politics); Artificial neural network; Computer science; Artificial intelligence; Machine learning; Political science","score_opus":0.026069682320608932,"score_gpt":0.2943342839074334,"score_spread":0.26826460158682447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408558613","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.76633227,0.0011054305,0.2016219,0.0032322626,0.0004498805,0.00005589623,0.0015155777,0.00076379045,0.02492293],"genre_scores_gemma":[0.98595375,0.00009225943,0.0065055443,0.00008520552,0.00005469304,0.000007854078,0.00024188611,0.00008754779,0.006971208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.00031194734,0.00003030161,0.00023077778,0.00011361116,0.00015546482],"domain_scores_gemma":[0.9978416,0.0010329107,0.00018244548,0.0005373695,0.00026432337,0.00014135735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002421955,0.00042966515,0.00052361545,0.0005281596,0.000382674,0.0023222156,0.0006343437,0.0007743425,0.008523295],"category_scores_gemma":[0.01430873,0.00027519226,0.0003714961,0.0004401984,0.00073932036,0.0029096513,0.0010559909,0.001362975,0.0016141897],"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.0026279853,0.00037934026,0.046264663,0.0002927561,0.00034504244,0.0006293381,0.0022875594,0.05018684,0.088899195,0.22254816,0.015353285,0.5701857],"study_design_scores_gemma":[0.00008758665,0.0005742688,0.0672284,0.00010507663,0.00015553938,0.001025182,0.0010037806,0.6022983,0.03847354,0.2770022,0.011860431,0.00018569827],"about_ca_topic_score_codex":0.0016048163,"about_ca_topic_score_gemma":0.0024557225,"teacher_disagreement_score":0.008523295,"about_ca_system_score_codex":0.00048157308,"about_ca_system_score_gemma":0.0005929673,"threshold_uncertainty_score":0.028513253},"labels":[],"label_agreement":null},{"id":"W4409740531","doi":"10.1007/s10994-025-06767-4","title":"Developing safe and responsible large language model: can we balance bias reduction and language understanding?","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Vector Institute","funders":"","keywords":"Reduction (mathematics); Balance (ability); Computer science; Cognitive psychology; Linguistics; Psychology; Mathematics; Philosophy","score_opus":0.024262651807243713,"score_gpt":0.30208355966579215,"score_spread":0.2778209078585484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409740531","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.018654944,0.00028005577,0.9720076,0.0044598905,0.00009024163,0.00008322762,0.00017467357,0.0028329305,0.0014164828],"genre_scores_gemma":[0.49063092,0.00069107127,0.49898177,0.002382956,0.0002823063,0.00029001513,0.00088415155,0.0024484347,0.0034083668],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99587953,0.0020837183,0.00022376128,0.0006588035,0.0008329463,0.00032119243],"domain_scores_gemma":[0.9679933,0.017299227,0.0013739691,0.008687766,0.0036748936,0.00097075687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009263448,0.0010751954,0.001673326,0.00078218634,0.00091733667,0.0033426955,0.0035285603,0.0022224595,0.0040070224],"category_scores_gemma":[0.056290504,0.0011028306,0.0011131676,0.00052488566,0.0025670354,0.015886765,0.0053209024,0.006344907,0.0025105523],"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.0010635057,0.00047879072,0.012815839,0.00073246495,0.0005327993,0.00046091824,0.0019270643,0.165463,0.027431795,0.2581331,0.022723656,0.5082371],"study_design_scores_gemma":[0.00007123703,0.000061914056,0.00039301955,0.000054024862,0.00009104424,0.00012356936,0.00024824942,0.6054031,0.011899557,0.3764156,0.0052002724,0.00003841707],"about_ca_topic_score_codex":0.0043692407,"about_ca_topic_score_gemma":0.008204532,"teacher_disagreement_score":0.009263448,"about_ca_system_score_codex":0.0014274748,"about_ca_system_score_gemma":0.0055312444,"threshold_uncertainty_score":0.04899037},"labels":[],"label_agreement":null},{"id":"W4409880954","doi":"10.1007/s10994-025-06777-2","title":"Prioritizing the essential: A robust evaluation framework for novelty detection","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Novelty; Novelty detection; Computer science; Artificial intelligence; Machine learning; Psychology","score_opus":0.025304891856278728,"score_gpt":0.32635983173837857,"score_spread":0.30105493988209986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409880954","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.012268319,0.0006039861,0.9843945,0.0003287858,0.000101743964,0.00021072774,0.0001959607,0.0010621796,0.0008338208],"genre_scores_gemma":[0.39568332,0.0003943354,0.5987563,0.00034028222,0.00037558845,0.00043344128,0.0008421829,0.0004894053,0.002685061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9790958,0.006054903,0.0018587573,0.0028632912,0.009004175,0.0011231506],"domain_scores_gemma":[0.9526952,0.02155027,0.0035580131,0.004644008,0.015293785,0.0022586987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031142117,0.0030086893,0.0034548184,0.005759302,0.0014986699,0.0064500915,0.0047794664,0.0034272792,0.0027950092],"category_scores_gemma":[0.07182389,0.00075216463,0.0018857248,0.0024503106,0.0020952339,0.0074874703,0.0062285457,0.0040885415,0.0009863948],"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.0027050257,0.00091080304,0.016709063,0.00085660483,0.0006482695,0.00032809848,0.00034017072,0.083132625,0.026959399,0.06363837,0.0106951,0.7930764],"study_design_scores_gemma":[0.00010173154,0.0008825134,0.0029349076,0.000087746,0.00017941114,0.0002768313,0.000087051034,0.9141004,0.016174037,0.06188001,0.0032032903,0.0000920416],"about_ca_topic_score_codex":0.0024469576,"about_ca_topic_score_gemma":0.003047774,"teacher_disagreement_score":0.031142117,"about_ca_system_score_codex":0.0020072553,"about_ca_system_score_gemma":0.0043762657,"threshold_uncertainty_score":0.16469723},"labels":[],"label_agreement":null},{"id":"W4409921902","doi":"10.1007/s10994-025-06766-5","title":"Imbalanced regression pipeline recommendation","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Data Classification","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Pipeline (software); Regression; Computer science; Artificial intelligence; Machine learning; Regression analysis; Statistics; Mathematics","score_opus":0.011448653263013342,"score_gpt":0.28772038332406075,"score_spread":0.2762717300610474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409921902","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.048191477,0.0029034351,0.8486256,0.0033713167,0.0020283738,0.00083686295,0.016559305,0.05460526,0.02287834],"genre_scores_gemma":[0.34321553,0.0011539863,0.53839415,0.0012627647,0.0011949346,0.00045591404,0.03833204,0.0019297088,0.07406096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983499,0.00024412785,0.00008511255,0.00046819318,0.00062406325,0.0002285849],"domain_scores_gemma":[0.99761885,0.00035613158,0.00006468287,0.0010369503,0.0007996411,0.00012365109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011912964,0.0015351739,0.0017887896,0.0019714874,0.00085604907,0.001825697,0.0021221582,0.001711028,0.026925232],"category_scores_gemma":[0.005589978,0.0006425379,0.0012791766,0.0025840153,0.00027236485,0.0024000395,0.001125512,0.0022515506,0.021372452],"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.0010758722,0.0007208379,0.0034943565,0.00016357121,0.0001986138,0.0001378843,0.000040332605,0.027658306,0.010928757,0.0047068973,0.18746804,0.76340663],"study_design_scores_gemma":[0.00021265155,0.00021066771,0.0017438397,0.000027222406,0.00009783393,0.00015596884,0.00005327032,0.94071364,0.010793565,0.013590503,0.032351535,0.000049220973],"about_ca_topic_score_codex":0.015769655,"about_ca_topic_score_gemma":0.031295504,"teacher_disagreement_score":0.026925232,"about_ca_system_score_codex":0.0008393735,"about_ca_system_score_gemma":0.0021947569,"threshold_uncertainty_score":0.09007388},"labels":[],"label_agreement":null},{"id":"W4413681322","doi":"10.1007/s10994-025-06858-2","title":"Cluster weighted models for functional data","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster (spacecraft); Computer science; Data mining; Artificial intelligence; Programming language","score_opus":0.04294268084520292,"score_gpt":0.30349957117040394,"score_spread":0.260556890325201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413681322","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.002075424,0.00020795786,0.9969568,0.0001205416,0.00001901582,0.00002282621,0.00011119607,0.0001391058,0.00034700424],"genre_scores_gemma":[0.28078786,0.0018814397,0.69602966,0.00035996793,0.0003608573,0.0012348094,0.0034118039,0.0013506254,0.014582955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582976,0.002406658,0.00016069444,0.0007226125,0.00065362337,0.00022661465],"domain_scores_gemma":[0.9835566,0.011090561,0.0009213638,0.0024290648,0.0016309276,0.00037149768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00903992,0.0017860587,0.0029167691,0.0042216615,0.0012684308,0.003254752,0.0072847726,0.0032416712,0.005302609],"category_scores_gemma":[0.030123997,0.0017785999,0.0029366643,0.004875205,0.0028043292,0.005623622,0.0031309384,0.0038270059,0.001581823],"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.0001243873,0.000071610775,0.00090865843,0.00019425212,0.00024200189,0.000058669044,0.00021424939,0.48271912,0.00069564686,0.47117886,0.0039601387,0.039632384],"study_design_scores_gemma":[0.000008680774,0.0000074537934,0.00017198421,0.000016143014,0.000017731694,0.000020557733,0.000016428423,0.7753135,0.00013502878,0.22307444,0.0012006348,0.000017447388],"about_ca_topic_score_codex":0.009846373,"about_ca_topic_score_gemma":0.009618805,"teacher_disagreement_score":0.009846373,"about_ca_system_score_codex":0.0027671037,"about_ca_system_score_gemma":0.0016405947,"threshold_uncertainty_score":0.04780823},"labels":[],"label_agreement":null},{"id":"W4413681754","doi":"10.1007/s10994-025-06863-5","title":"Source-free domain adaptation requires penalized diversity","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; University of Calgary; Concordia University; Cybernet Systems Corporation (Canada)","funders":"Mitacs","keywords":"Adaptation (eye); Diversity (politics); Computer science; Domain adaptation; Mathematics; Artificial intelligence; Biology; Classifier (UML); Neuroscience","score_opus":0.016075978593558173,"score_gpt":0.24294979446534526,"score_spread":0.2268738158717871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413681754","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.0097697275,0.00036888797,0.9882299,0.00021794831,0.00005393107,0.000030370735,0.00006740503,0.00046234005,0.00079949904],"genre_scores_gemma":[0.63421416,0.0009210391,0.35232732,0.0008679871,0.00034912824,0.00028442318,0.0012634493,0.0005836397,0.009188857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875474,0.00045525053,0.000056725745,0.0003581128,0.0002673377,0.00010790299],"domain_scores_gemma":[0.9951277,0.003202199,0.0001444498,0.0008399764,0.0004991388,0.00018650884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028249423,0.0010200245,0.0017684721,0.0007958926,0.00063582783,0.0011093793,0.002122542,0.002410615,0.0022258817],"category_scores_gemma":[0.01189956,0.0006362861,0.0009750563,0.00092812703,0.001209475,0.002835671,0.003921879,0.0034521928,0.0011064718],"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.000574903,0.0002898262,0.0020324092,0.00034317223,0.00030445895,0.00037247743,0.00022181582,0.65294826,0.020583868,0.042549923,0.011184019,0.2685949],"study_design_scores_gemma":[0.0000134064685,0.000028967306,0.00022864524,0.000010034586,0.000013897302,0.000101735786,0.000014462515,0.97694415,0.002190093,0.019773576,0.0006679378,0.000012976459],"about_ca_topic_score_codex":0.0024230003,"about_ca_topic_score_gemma":0.0030560321,"teacher_disagreement_score":0.0028249423,"about_ca_system_score_codex":0.0006157635,"about_ca_system_score_gemma":0.0010257908,"threshold_uncertainty_score":0.014939904},"labels":[],"label_agreement":null},{"id":"W4416408141","doi":"10.1007/s10994-025-06909-8","title":"MetaML: a multi-label meta-learning approach for pipeline recommendation","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Data Classification","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":"École de Technologie Supérieure","funders":"","keywords":"Pipeline (software); Preprocessor; Computational complexity theory; Pipeline transport; Sequence (biology); Code (set theory); Bayesian probability; Source code","score_opus":0.07266868996257791,"score_gpt":0.33080450384217086,"score_spread":0.25813581387959295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416408141","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.0062458897,0.0013546463,0.9649647,0.0007620111,0.00025397475,0.00025118372,0.003180495,0.021149581,0.0018375022],"genre_scores_gemma":[0.097547434,0.0004806827,0.8858719,0.00083279295,0.00021564336,0.00035256267,0.006372467,0.00095034676,0.0073762443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750996,0.00089829066,0.00016379413,0.0005721439,0.0006658861,0.00018993333],"domain_scores_gemma":[0.9955226,0.0018849395,0.00017157127,0.0014377864,0.0007555774,0.00022745396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003445824,0.0018730904,0.0024634956,0.00540327,0.0014756935,0.0025356563,0.0055335537,0.00397424,0.009851424],"category_scores_gemma":[0.009507593,0.0012417058,0.0028982647,0.0041966704,0.00053847424,0.004951215,0.002653274,0.003677667,0.00554977],"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.00089170045,0.0012671178,0.004177625,0.00042926666,0.0010643245,0.00019962518,0.00016977196,0.064877,0.0048536686,0.00916436,0.078293465,0.834612],"study_design_scores_gemma":[0.000096709846,0.00012721086,0.00036820956,0.00005914286,0.00013968382,0.00008372845,0.000050355426,0.965185,0.0030707053,0.021071097,0.00968974,0.00005848076],"about_ca_topic_score_codex":0.019416228,"about_ca_topic_score_gemma":0.0545252,"teacher_disagreement_score":0.019416228,"about_ca_system_score_codex":0.0018579556,"about_ca_system_score_gemma":0.0022929823,"threshold_uncertainty_score":0.038606405},"labels":[],"label_agreement":null},{"id":"W68132019","doi":"10.1007/s10994-013-5363-6","title":"A semantic matching energy function for learning with multi-relational data","year":2013,"lang":"en","type":"article","venue":"Machine Learning","topic":"Topic Modeling","field":"Computer Science","cited_by":687,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Agence Nationale de la Recherche; Compute Canada; Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research","keywords":"Computer science; WordNet; Artificial intelligence; Statistical relational learning; Natural language processing; Sentence; Relational database; Relation (database); Semantic matching; Semantics (computer science); Parsing; Word (group theory); Context (archaeology); Information retrieval; Matching (statistics); Data mining","score_opus":0.03555843756672505,"score_gpt":0.24708839161885043,"score_spread":0.21152995405212538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68132019","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.0060327277,0.0003473289,0.9916203,0.00027482503,0.00006110873,0.00005359745,0.00017758137,0.0003534572,0.0010790235],"genre_scores_gemma":[0.256939,0.00078970235,0.7314159,0.00041199662,0.0002138751,0.0005567508,0.001829553,0.0007069246,0.0071363025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821424,0.0005729099,0.00016400045,0.00035290676,0.0005693087,0.00012674244],"domain_scores_gemma":[0.9982937,0.000853479,0.00008196442,0.00042262586,0.0002750463,0.00007316673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034982867,0.0005632806,0.0014756514,0.002029199,0.0007871725,0.0019347112,0.0025056242,0.002531923,0.005321831],"category_scores_gemma":[0.009402822,0.00049657456,0.0016091021,0.0032342058,0.00088537496,0.0050688186,0.0028691085,0.002297066,0.0015143495],"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.00028063057,0.0004413804,0.0017621187,0.00037990883,0.000263755,0.00016921412,0.00023550414,0.20191793,0.0076524517,0.23260112,0.013289945,0.541006],"study_design_scores_gemma":[0.00001461601,0.000047440673,0.00041003738,0.00003027364,0.0000341292,0.00009620668,0.000044760447,0.8326504,0.0014688442,0.16193864,0.003243565,0.000021069123],"about_ca_topic_score_codex":0.0015199851,"about_ca_topic_score_gemma":0.0018990347,"teacher_disagreement_score":0.005321831,"about_ca_system_score_codex":0.001106068,"about_ca_system_score_gemma":0.0010790655,"threshold_uncertainty_score":0.018500924},"labels":[],"label_agreement":null},{"id":"W7117323897","doi":"10.1007/s10994-025-06943-6","title":"Extended UCB Policies for Multi-armed Bandit Problems","year":2025,"lang":"en","type":"article","venue":"Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Novelis (Canada)","funders":"","keywords":"Regret; Process (computing); Markov decision process; Simplicity; Order (exchange); Reinforcement learning; Extension (predicate logic)","score_opus":0.15270853510586288,"score_gpt":0.48696366916655853,"score_spread":0.3342551340606956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117323897","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.018022189,0.0019670578,0.969257,0.0010963611,0.00022861769,0.00011618842,0.00019313788,0.0004153303,0.008704057],"genre_scores_gemma":[0.6957247,0.0035886972,0.27374986,0.0009805163,0.0005851321,0.0011047948,0.0007270842,0.00052546733,0.023013832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609417,0.002332142,0.00018084004,0.00035201685,0.0005921317,0.00044869093],"domain_scores_gemma":[0.9830089,0.0126418155,0.0009575584,0.0012408815,0.0014323243,0.0007184897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007665602,0.0017153616,0.0033120434,0.00148158,0.001006124,0.003590556,0.002785838,0.0031732302,0.009099055],"category_scores_gemma":[0.028091291,0.0011078966,0.00088275643,0.0021254597,0.0020538052,0.0036780792,0.0029515042,0.004284423,0.00223261],"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.00034176814,0.00017852047,0.00053059123,0.00027363648,0.00008131799,0.00008138409,0.00014559942,0.78422636,0.00065066956,0.15481259,0.006997162,0.051680434],"study_design_scores_gemma":[0.000037151094,0.00003881512,0.00006825851,0.00005388462,0.000010311489,0.0000170678,0.000014652116,0.9495411,0.00015794268,0.048982147,0.0010663475,0.000012198016],"about_ca_topic_score_codex":0.0035900443,"about_ca_topic_score_gemma":0.002302555,"teacher_disagreement_score":0.009099055,"about_ca_system_score_codex":0.0018440448,"about_ca_system_score_gemma":0.0025857538,"threshold_uncertainty_score":0.0405401},"labels":[],"label_agreement":null}]}