{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":587,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":587,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"bd88de5e8e3e","filters":{"topic":"Machine Learning and Algorithms"}},"results":[{"id":"W607505555","doi":"10.1017/cbo9781107298019","title":"Understanding Machine Learning: From Theory To Algorithms","year":2015,"lang":"en","type":"book","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3092,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Field (mathematics); Machine learning; Computational learning theory; Stability (learning theory); Algorithmic learning theory; Stochastic gradient descent; Algorithm; Presentation (obstetrics); Convexity; Online machine learning; Artificial neural network; Mathematics","authors":[{"name":"Shai Shalev‐Shwartz","is_ca":false},{"name":"Shai Ben-David","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08769515514832724,"gpt":0.2691373180682896,"spread":0.1814421629199624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167475,0.001164804,0.001068362,0.00179477,0.0007316839,0.006891694,0.001856555,0.001963809,0.01433873],"category_scores_gemma":[0.006662746,0.0007458872,0.0007642162,0.002713166,0.003305907,0.009513234,0.002050336,0.005000899,0.007195092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180071,"about_ca_system_score_gemma":0.001494728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001257229,"about_ca_topic_score_gemma":0.0009176828,"domain_scores_codex":[0.9990528,0.0002726689,0.00004310416,0.0001431901,0.0004335697,0.00005468069],"domain_scores_gemma":[0.9980024,0.001494412,0.00007254169,0.000155964,0.0002129745,0.00006173614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001048263,0.00002269178,0.0001990693,0.0006703234,0.00003053263,0.00006720437,0.0003795416,0.006166649,0.0002981108,0.7809656,0.08655315,0.1246366],"study_design_scores_gemma":[0.000003751836,0.00001091729,0.0001865239,0.0003365874,0.000006747557,0.0001011605,0.0001106069,0.005795313,0.0001372964,0.7633676,0.2299319,0.00001165215],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003308508,0.2112665,0.5012818,0.03339028,0.004599967,0.0001517692,0.0009490849,0.001190448,0.2438617],"genre_scores_gemma":[0.1125709,0.3235836,0.3534169,0.01393586,0.0109342,0.0007105184,0.003079225,0.001276074,0.1804927],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01433873,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2194321275","doi":"10.1126/science.aab3050","title":"Human-level concept learning through probabilistic program induction","year":2015,"lang":"en","type":"article","venue":"Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2930,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Army Research Office; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Alphabet; Artificial intelligence; Probabilistic logic; Turing; Natural language processing; Machine learning; Programming language; Linguistics","authors":[{"name":"Brenden M. Lake","is_ca":false},{"name":"Ruslan Salakhutdinov","is_ca":true},{"name":"Joshua B. Tenenbaum","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08790062134160331,"gpt":0.3568765479819589,"spread":0.2689759266403556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137606,0.0005862978,0.000456491,0.0005217223,0.0004270935,0.0009554061,0.001979226,0.0007705244,0.003336357],"category_scores_gemma":[0.006216398,0.0004005588,0.0008089835,0.0005583171,0.001421365,0.002670102,0.001461319,0.002121679,0.0007415737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009249291,"about_ca_system_score_gemma":0.001043139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002478987,"about_ca_topic_score_gemma":0.004061829,"domain_scores_codex":[0.9995297,0.0001532395,0.00001518824,0.0001685258,0.0001020594,0.0000313109],"domain_scores_gemma":[0.9968842,0.002087188,0.000214081,0.0004799764,0.0002233595,0.0001112624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00023731,0.0003462886,0.00461263,0.0002368768,0.0001064363,0.0001578637,0.0004544803,0.5284888,0.007181862,0.1522976,0.009606091,0.2962736],"study_design_scores_gemma":[0.00001039095,0.00002223955,0.0001466318,0.000008880661,0.000006287802,0.00002387936,0.00001069877,0.9359944,0.001360743,0.06157638,0.0008335547,0.000005804284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03114822,0.00009986915,0.9638201,0.000590424,0.00002032371,0.00005825394,0.0001580911,0.001217752,0.002886912],"genre_scores_gemma":[0.6250239,0.00022816,0.3690214,0.0003126681,0.00004325946,0.0002859587,0.0006471467,0.00015829,0.004279123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003336357,"threshold_uncertainty_score":0.01116127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2597787948","doi":"10.17863/cam.11070","title":"Deep Bayesian Active Learning with Image Data","year":2017,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":435,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Artificial intelligence; Deep learning; Computer science; Machine learning; MNIST database; Active learning (machine learning); Convolutional neural network; Multi-task learning; Instance-based learning; Unsupervised learning; Semi-supervised learning; Task (project management)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02947164731053246,"gpt":0.2792919809015813,"spread":0.2498203335910489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004991504,0.001088484,0.001586878,0.001166995,0.0005211565,0.002407459,0.003258167,0.003349913,0.002940757],"category_scores_gemma":[0.01450432,0.001224958,0.001233804,0.001106721,0.002410498,0.003803186,0.003529785,0.003843376,0.0008436783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001509702,"about_ca_system_score_gemma":0.001303211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003286015,"about_ca_topic_score_gemma":0.003835364,"domain_scores_codex":[0.9986061,0.0006620623,0.00007083581,0.000240116,0.0003356416,0.0000853368],"domain_scores_gemma":[0.9927896,0.005280827,0.0004582434,0.0006561533,0.0006012422,0.0002140116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001674476,0.00008796613,0.0007373617,0.00014727,0.00005493787,0.00009902132,0.0001613682,0.8290335,0.002088892,0.07702884,0.003144529,0.08724873],"study_design_scores_gemma":[0.000007891866,0.000007475561,0.00002406474,0.000006928205,0.000002029644,0.000008705859,0.00000392442,0.9810528,0.000398949,0.01799058,0.0004925202,0.000004065664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004362925,0.0002345082,0.9935775,0.0004143445,0.00002904071,0.00002932,0.0000747069,0.0002837963,0.0009937587],"genre_scores_gemma":[0.465932,0.0008066082,0.5213574,0.0007815808,0.000296994,0.0006278263,0.0009169398,0.000326359,0.008954235],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004991504,"threshold_uncertainty_score":0.02639788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3195438473","doi":"10.1007/s10115-021-01605-0","title":"Model complexity of deep learning: a survey","year":2021,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":388,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Deep learning; Artificial intelligence; Generalization; Machine learning; Model selection; Game complexity; Process (computing); Computational complexity theory; Worst-case complexity; Algorithm; Mathematics","authors":[{"name":"Xia Hu","is_ca":true},{"name":"Lingyang Chu","is_ca":true},{"name":"Jian Pei","is_ca":true},{"name":"Weiqing Liu","is_ca":false},{"name":"Jiang Bian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04158325762783575,"gpt":0.2735118115492377,"spread":0.2319285539214019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004316606,0.001624215,0.002834076,0.001899191,0.0006552453,0.004785905,0.003301958,0.00230685,0.004022646],"category_scores_gemma":[0.02343692,0.001209669,0.001400076,0.002821492,0.001907154,0.01075548,0.003146238,0.004528206,0.0008751925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003635771,"about_ca_system_score_gemma":0.002586847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003919233,"about_ca_topic_score_gemma":0.003194188,"domain_scores_codex":[0.9976375,0.0007653854,0.0001987967,0.0004365774,0.0008244429,0.0001372847],"domain_scores_gemma":[0.9797282,0.01683488,0.000619177,0.001276113,0.001278175,0.000263439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001870128,0.0002114612,0.003924327,0.002181076,0.0002691566,0.0001103814,0.0001261386,0.2328888,0.0005905586,0.4925283,0.01610288,0.2508798],"study_design_scores_gemma":[0.00001389993,0.00004529257,0.0004391911,0.0002021849,0.00004001289,0.00008750469,0.00003961769,0.3804627,0.000447263,0.6098202,0.008378144,0.0000240263],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.01982539,0.1345303,0.8135599,0.01596766,0.0006585559,0.000075305,0.001326505,0.0005445912,0.01351179],"genre_scores_gemma":[0.5074816,0.2361419,0.2332387,0.003686212,0.005305241,0.0005302477,0.003537014,0.0006843341,0.009394791],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004785905,"threshold_uncertainty_score":0.02637947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W27961112","doi":"","title":"Zero-data learning of new tasks","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":353,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Generalization; Zero (linguistics); Context (archaeology); Machine learning; Multi-task learning; Ranking (information retrieval); Perspective (graphical); Set (abstract data type); Task (project management); Mathematics","authors":[{"name":"Hugo Larochelle","is_ca":true},{"name":"Dumitru Erhan","is_ca":true},{"name":"Yoshua Bengio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04672579905843802,"gpt":0.2816601494586466,"spread":0.2349343504002086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008188944,0.001413951,0.002122038,0.001385797,0.001046711,0.00349573,0.004502588,0.002504839,0.004631037],"category_scores_gemma":[0.04014746,0.000833938,0.002533753,0.00117292,0.005294612,0.01074721,0.008456003,0.005987128,0.001080954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001632927,"about_ca_system_score_gemma":0.001563146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00129476,"about_ca_topic_score_gemma":0.00124984,"domain_scores_codex":[0.9930608,0.003222019,0.0004989916,0.001761467,0.001015282,0.0004415463],"domain_scores_gemma":[0.9783338,0.01248945,0.001169739,0.005776445,0.001288311,0.0009422636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000544221,0.0004547659,0.006862555,0.0006882224,0.0002275349,0.0004707851,0.001208482,0.1898475,0.00235057,0.6172179,0.005869751,0.1742577],"study_design_scores_gemma":[0.00004714941,0.0001045294,0.0003383103,0.0000624091,0.00001986787,0.0001027365,0.0001117233,0.3747403,0.001134001,0.6190491,0.004256999,0.00003298755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02031893,0.0004112169,0.9733015,0.001481806,0.00009249757,0.0001204112,0.0003033104,0.0003539105,0.003616458],"genre_scores_gemma":[0.5620531,0.0006372725,0.4280892,0.001043034,0.0002653539,0.0009884108,0.001608969,0.0001880708,0.00512665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008188944,"threshold_uncertainty_score":0.04330784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137795521","doi":"","title":"Discriminative Batch Mode Active Learning","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":234,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Discriminative model; Computer science; Artificial intelligence; Machine learning; Classifier (UML); Active learning (machine learning); Semi-supervised learning; Pattern recognition (psychology)","authors":[{"name":"Yuhong Guo","is_ca":true},{"name":"Dale Schuurmans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008560599392563007,"gpt":0.290796157520392,"spread":0.282235558127829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002710728,0.001412821,0.002147209,0.0006617192,0.0004344464,0.001399563,0.003882709,0.001940891,0.003187972],"category_scores_gemma":[0.005763224,0.0007577513,0.0008383731,0.001012476,0.001425291,0.002339864,0.001305809,0.002321292,0.001202725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008428118,"about_ca_system_score_gemma":0.0008717194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001353462,"about_ca_topic_score_gemma":0.001779735,"domain_scores_codex":[0.9987174,0.0005698772,0.00005722475,0.0003002901,0.0002678263,0.00008724651],"domain_scores_gemma":[0.9959259,0.002607094,0.0002999126,0.0004353056,0.0005925435,0.0001393125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006527334,0.0003916769,0.001701529,0.0003592961,0.00013929,0.0001424059,0.0002007442,0.535377,0.01189801,0.05142433,0.01077115,0.3869418],"study_design_scores_gemma":[0.00001440764,0.00003736783,0.00005336756,0.000005414492,0.000006946447,0.00002049501,0.000005341581,0.9914773,0.001420111,0.006106426,0.0008462145,0.000006672883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003463873,0.0002226799,0.9942833,0.0001276346,0.0000458161,0.0000500697,0.00003953959,0.0003682619,0.001398838],"genre_scores_gemma":[0.4198179,0.0006021349,0.5675786,0.0005617356,0.0003569641,0.0006062617,0.0004800499,0.0002431323,0.009753256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003882709,"threshold_uncertainty_score":0.01433587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118163005","doi":"","title":"Optimizing Costly Functions with Simple Constraints: A Limited-Memory Projected Quasi-Newton Algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":222,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematical optimization; Algorithm; Orthant; Descent direction; Mathematics; Convex function; Stochastic gradient descent; Broyden–Fletcher–Goldfarb–Shanno algorithm; Quadratic equation; Computer science; Gradient descent; Regular polygon; Applied mathematics; Artificial intelligence","authors":[{"name":"Mark Schmidt","is_ca":true},{"name":"E. van den Berg","is_ca":true},{"name":"Michael P. Friedlander","is_ca":true},{"name":"Kevin P. Murphy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01017784147900268,"gpt":0.2421697917682596,"spread":0.2319919502892569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148747,0.001217369,0.001659649,0.000647564,0.0004833816,0.0008849313,0.00209899,0.002098422,0.004079922],"category_scores_gemma":[0.004097518,0.00128833,0.0006674204,0.0007733511,0.001018715,0.001112573,0.001307845,0.001630231,0.001541158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007994476,"about_ca_system_score_gemma":0.002242841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006509001,"about_ca_topic_score_gemma":0.00825369,"domain_scores_codex":[0.9994414,0.0002494626,0.0000180937,0.00006202098,0.0001865965,0.00004242273],"domain_scores_gemma":[0.9986279,0.0008845103,0.00008721124,0.0001160868,0.0002186381,0.00006561651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008150313,0.00005919732,0.0002219384,0.0001373755,0.00005208346,0.00009342437,0.00005686103,0.9187517,0.00126098,0.02415222,0.004537421,0.05059533],"study_design_scores_gemma":[0.00001515903,0.000008355771,0.00001883185,0.000004945939,0.000001905339,0.000006533884,0.000002147817,0.9960445,0.00009364764,0.003365003,0.0004355045,0.000003509401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002701067,0.0001365605,0.9951425,0.0001552897,0.00003327944,0.00005319018,0.00004114313,0.0003254747,0.001411542],"genre_scores_gemma":[0.07125906,0.0001605916,0.9237871,0.0001775191,0.000052476,0.0003767744,0.0001608597,0.0002873853,0.00373835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006509001,"threshold_uncertainty_score":0.01364863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116493296","doi":"10.1145/335191.335409","title":"XTRACT","year":2000,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; XML validation; Document Structure Description; Document type definition; RELAX NG; XML Schema Editor; Well-formed document; XML Schema (W3C); Streaming XML; XML; Information retrieval; Programming language; Simple API for XML; Efficient XML Interchange; XML database; XML Signature; World Wide Web","authors":[{"name":"Minos Garofalakis","is_ca":true},{"name":"Aristides Gionis","is_ca":false},{"name":"Rajeev Rastogi","is_ca":true},{"name":"S. Seshadri","is_ca":true},{"name":"Kyuseok Shim","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01034075916582253,"gpt":0.2474894671120009,"spread":0.2371487079461783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003011334,0.001604923,0.001128786,0.002647802,0.001335056,0.005994667,0.004426261,0.002401274,0.09221158],"category_scores_gemma":[0.0151993,0.001108234,0.002146529,0.00318995,0.0009739241,0.006280416,0.003505659,0.00289128,0.08255686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152956,"about_ca_system_score_gemma":0.002537347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005217343,"about_ca_topic_score_gemma":0.00403341,"domain_scores_codex":[0.9964511,0.0005564816,0.0003374189,0.0007868955,0.001599442,0.0002685711],"domain_scores_gemma":[0.9952721,0.001332456,0.000336269,0.001680015,0.001141871,0.0002373951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006169067,0.00009769524,0.001596433,0.0007872212,0.0001140198,0.0005178604,0.0002718069,0.006792795,0.004527397,0.05063822,0.6613179,0.2727217],"study_design_scores_gemma":[0.0001031552,0.00009399517,0.0006987663,0.0001451918,0.00004608314,0.000500553,0.00005982536,0.04813132,0.007669599,0.04086041,0.9016063,0.00008482553],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.003842016,0.001687434,0.4649233,0.002109818,0.001510993,0.0007643225,0.04742679,0.3905589,0.0871764],"genre_scores_gemma":[0.06455163,0.003288749,0.4550554,0.002851344,0.0009071946,0.001404024,0.2923391,0.06987658,0.1097261],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.09221158,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149991487","doi":"10.1145/1553374.1553419","title":"PAC-Bayesian learning of linear classifiers","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"AdaBoost; Artificial intelligence; Bayes' theorem; Computer science; Machine learning; Bayesian probability; Support vector machine; Naive Bayes classifier; Pattern recognition (psychology)","authors":[{"name":"Pascal Germain","is_ca":true},{"name":"Alexandre Lacasse","is_ca":true},{"name":"François Laviolette","is_ca":true},{"name":"Mario Marchand","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008686252362798613,"gpt":0.2537386351808741,"spread":0.2450523828180755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007573997,0.001908687,0.002732955,0.002157913,0.001337721,0.004810332,0.003924963,0.002771783,0.008081133],"category_scores_gemma":[0.04714764,0.001559809,0.001818142,0.00294755,0.002743898,0.008618786,0.003543067,0.005196902,0.004094131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00215075,"about_ca_system_score_gemma":0.002083454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00224995,"about_ca_topic_score_gemma":0.002267859,"domain_scores_codex":[0.9916146,0.003128391,0.0003530063,0.001200314,0.003265662,0.000438083],"domain_scores_gemma":[0.984787,0.01036023,0.0008307516,0.001648032,0.002074522,0.0002994014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001165022,0.00009730727,0.000705729,0.0004079993,0.000132175,0.0001304066,0.000183882,0.1738807,0.001056593,0.6057964,0.01220326,0.2052892],"study_design_scores_gemma":[0.00001220571,0.00003344893,0.0001277965,0.0000723665,0.00002934175,0.000144641,0.00001643389,0.6069853,0.001256358,0.3841229,0.007174048,0.00002506604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006685971,0.0007000047,0.9947149,0.0002231054,0.00006611407,0.00002591295,0.0000489948,0.0001569945,0.003395445],"genre_scores_gemma":[0.176792,0.004503197,0.8006624,0.001221002,0.001214443,0.0006825219,0.000800873,0.0005608292,0.01356275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008081133,"threshold_uncertainty_score":0.04005557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626188202","doi":"10.1007/s11750-017-0451-6","title":"On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Integer programming; Artificial intelligence; Branching (polymer chemistry); Heuristic; Machine learning; Field (mathematics); Branch and bound; Variable (mathematics); Computational learning theory; Mathematical optimization; Theoretical computer science; Active learning (machine learning); Algorithm; Mathematics","authors":[{"name":"Andrea Lodi","is_ca":true},{"name":"Giulia Zarpellon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01682463045290404,"gpt":0.2971222359018433,"spread":0.2802976054489392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004182342,0.001974576,0.004471516,0.004327898,0.001947443,0.007631264,0.00361677,0.002860167,0.01365822],"category_scores_gemma":[0.01402655,0.001490597,0.001851895,0.01440863,0.003641752,0.01540475,0.004254254,0.006183392,0.005151115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002939692,"about_ca_system_score_gemma":0.003384621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003547651,"about_ca_topic_score_gemma":0.003028014,"domain_scores_codex":[0.9971571,0.0007058427,0.0002183914,0.0006857795,0.0009692444,0.000263644],"domain_scores_gemma":[0.9884413,0.008725218,0.0003079345,0.001145113,0.0009977891,0.0003826678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001274732,0.0002179513,0.002971446,0.002671805,0.0001072246,0.00007634316,0.0002139351,0.01175048,0.0003646535,0.3565806,0.03494106,0.5899771],"study_design_scores_gemma":[0.0000489636,0.000130969,0.001309886,0.00100069,0.0001151802,0.000538503,0.0002087748,0.03665902,0.0006745448,0.7973435,0.1619077,0.00006224491],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.007563489,0.5649549,0.3722674,0.008646648,0.001294303,0.00008890792,0.0008131784,0.0009126234,0.04345861],"genre_scores_gemma":[0.1067484,0.6345876,0.2292341,0.003940454,0.009996878,0.0002679935,0.00206996,0.0007707404,0.01238384],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01365822,"threshold_uncertainty_score":0.04569131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519196800","doi":"10.1016/s0004-3702(02)00209-6","title":"Learning cost-sensitive active classifiers☆☆This extends the short conference paper [19].","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":164,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Machine learning; Pattern recognition (psychology)","authors":[{"name":"Russell Greiner","is_ca":true},{"name":"Adam J. Grove","is_ca":false},{"name":"Dan Roth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0815979204633624,"gpt":0.3055369991129953,"spread":0.2239390786496329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003049554,0.001787412,0.002367697,0.00123157,0.0008768698,0.002189835,0.004444893,0.002688295,0.009035569],"category_scores_gemma":[0.01270311,0.0008396059,0.001167813,0.001653475,0.001457822,0.005136041,0.002630525,0.004336819,0.002639685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086919,"about_ca_system_score_gemma":0.001256403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002830168,"about_ca_topic_score_gemma":0.003047507,"domain_scores_codex":[0.9981059,0.0006443898,0.0001126257,0.0004500662,0.0005477481,0.0001391775],"domain_scores_gemma":[0.9940597,0.003271148,0.0002400755,0.001044637,0.001100198,0.0002842825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005279341,0.0004914178,0.001440494,0.0005707774,0.000457907,0.0001554267,0.0002308766,0.1698136,0.005667005,0.1153154,0.02798743,0.6773417],"study_design_scores_gemma":[0.00005035935,0.0001956284,0.0003292598,0.00005638845,0.0001030066,0.0001163572,0.00002073879,0.8976774,0.003764231,0.08457016,0.01306901,0.00004739612],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00675571,0.001556098,0.9839626,0.001552074,0.000785191,0.0001354946,0.0001576812,0.0003558678,0.004739281],"genre_scores_gemma":[0.4956595,0.004454439,0.4391664,0.003345904,0.005443095,0.0005983348,0.001667578,0.0008565962,0.04880807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009035569,"threshold_uncertainty_score":0.03022695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1606763436","doi":"10.1007/978-3-642-15567-3_28","title":"A Continuous Max-Flow Approach to Potts Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Potts model; Computer science; Simplex; Perimeter; Regular polygon; Computation; Flow (mathematics); Mathematical optimization; Algorithm; Mathematics; Combinatorics; Geometry; Statistical physics","authors":[{"name":"Jing Yuan","is_ca":true},{"name":"Egil Bae","is_ca":false},{"name":"Xue‐Cheng Tai","is_ca":false},{"name":"Yuri Boykov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01228348521606565,"gpt":0.2334714443956948,"spread":0.2211879591796292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193814,0.0009363172,0.001387393,0.0008296718,0.0007600268,0.001924727,0.002757956,0.001955082,0.01092308],"category_scores_gemma":[0.003857052,0.0006412935,0.001418518,0.001135363,0.001289661,0.003583073,0.001982705,0.003305946,0.001446424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001492051,"about_ca_system_score_gemma":0.001197812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003626189,"about_ca_topic_score_gemma":0.002357954,"domain_scores_codex":[0.9995888,0.0001716093,0.00001782485,0.00007962084,0.0001017125,0.00004033599],"domain_scores_gemma":[0.9992979,0.0004014971,0.00004610773,0.00007356795,0.0001033958,0.00007755746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003592592,0.00004172004,0.0001061701,0.00007954717,0.00002679746,0.00007294642,0.00006175145,0.2693559,0.0005130354,0.7061956,0.005210604,0.01829995],"study_design_scores_gemma":[0.000006635873,0.00001163524,0.00002375459,0.000007633517,0.000006670923,0.00001324241,0.000007186807,0.7238932,0.0001046629,0.2739935,0.001923808,0.000008131946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004873342,0.0005505878,0.979619,0.0007101427,0.0002037023,0.0000382098,0.0001766674,0.0001754953,0.01365283],"genre_scores_gemma":[0.5567391,0.002704761,0.3626637,0.0007071247,0.001012909,0.0004171904,0.0008619386,0.0006386383,0.07425462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01092308,"threshold_uncertainty_score":0.03654134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W120286951","doi":"","title":"Optimistic active learning using mutual information","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Exploit; Discriminative model; Classifier (UML); Artificial intelligence; Mutual information; Machine learning; Partition (number theory); Labeled data; Data mining; Pattern recognition (psychology); Mathematics","authors":[{"name":"Yuhong Guo","is_ca":true},{"name":"Russell Greiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009377063046125823,"gpt":0.2622407538792871,"spread":0.2528636908331612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007700516,0.001554781,0.002365538,0.001551248,0.001092253,0.003164441,0.004371618,0.001980122,0.002869469],"category_scores_gemma":[0.01892828,0.001278787,0.0009132865,0.001332921,0.002365954,0.00622345,0.004891334,0.003017681,0.0008322345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001855431,"about_ca_system_score_gemma":0.001571817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001937785,"about_ca_topic_score_gemma":0.001814163,"domain_scores_codex":[0.9948004,0.002526439,0.0002240223,0.0006777243,0.001444503,0.0003268152],"domain_scores_gemma":[0.9846343,0.01122308,0.0009898931,0.001624463,0.001125516,0.0004027367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001031823,0.0002403795,0.003330397,0.0002679293,0.0002042067,0.0001925723,0.0006235348,0.7117475,0.003214977,0.104529,0.005602559,0.1690152],"study_design_scores_gemma":[0.00002568428,0.00004009053,0.0001000725,0.00001072817,0.00001658398,0.00003053596,0.00001704756,0.9658792,0.001289594,0.03181699,0.0007593131,0.00001410278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01689209,0.0006048789,0.9776078,0.0005812306,0.00003999799,0.00007560448,0.00007870655,0.0007431685,0.003376576],"genre_scores_gemma":[0.8028415,0.0004929626,0.1907962,0.0005042588,0.0002469216,0.0003688142,0.000450621,0.0001926442,0.004106163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007700516,"threshold_uncertainty_score":0.04072469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169863116","doi":"10.1145/1557019.1557119","title":"Effective multi-label active learning for text classification","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University","keywords":"Computer science; Multi-label classification; Support vector machine; Labeled data; Reduction (mathematics); Artificial intelligence; Machine learning; Active learning (machine learning); Point (geometry); Semi-supervised learning; Data reduction; Data mining; Pattern recognition (psychology); Mathematics","authors":[{"name":"Bishan Yang","is_ca":false},{"name":"Jian-Tao Sun","is_ca":false},{"name":"Tengjiao Wang","is_ca":false},{"name":"Zheng Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02444210877789751,"gpt":0.3137702215281998,"spread":0.2893281127503023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008279143,0.001715288,0.0024561,0.002838794,0.001305513,0.002792038,0.006549824,0.004035273,0.002327968],"category_scores_gemma":[0.01612554,0.0009666382,0.001548524,0.002573651,0.002242641,0.007726616,0.002993714,0.004497479,0.001361997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321071,"about_ca_system_score_gemma":0.0009644994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000909741,"about_ca_topic_score_gemma":0.001285484,"domain_scores_codex":[0.9936098,0.00303203,0.0003559935,0.00103486,0.001713551,0.0002537356],"domain_scores_gemma":[0.9823639,0.01222053,0.001182221,0.001839467,0.002035884,0.0003580224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006624349,0.0006528007,0.001460317,0.0003782133,0.0001547868,0.0001731811,0.0003967032,0.2409996,0.01263645,0.03353859,0.008434546,0.7005124],"study_design_scores_gemma":[0.00001992112,0.00003189369,0.00006270243,0.00001013451,0.000008890358,0.00002386525,0.00001439761,0.9806157,0.002637119,0.01592086,0.0006436359,0.00001090747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003403928,0.0003098061,0.9951007,0.0002135301,0.00005535627,0.00004736336,0.00004534307,0.0004601107,0.0003638635],"genre_scores_gemma":[0.2489978,0.0005503778,0.7438403,0.0005894415,0.0004352516,0.0007524953,0.0008188804,0.0002064484,0.003809003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008279143,"threshold_uncertainty_score":0.0437848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138041254","doi":"10.1109/tsmcb.2002.1049608","title":"Generalized pursuit learning schemes: new families of continuous and discretized learning automata","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Action (physics); Learning automata; Discretization; Computer science; Scheme (mathematics); Artificial intelligence; Estimator; Algorithm; Automaton; Machine learning; Mathematical optimization; Mathematics; Statistics","authors":[{"name":"M. Agache","is_ca":true},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01679405674685146,"gpt":0.2287138098760468,"spread":0.2119197531291953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042816,0.0006668268,0.0008576555,0.0008474721,0.0005245333,0.001652657,0.001951355,0.001387281,0.002289214],"category_scores_gemma":[0.009335551,0.000384301,0.0008622396,0.0008741737,0.002043102,0.00284361,0.002414386,0.002140233,0.0005638134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00103278,"about_ca_system_score_gemma":0.0009688419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001377335,"about_ca_topic_score_gemma":0.001247163,"domain_scores_codex":[0.998957,0.0003625512,0.00007379297,0.0001716366,0.0003626955,0.00007223294],"domain_scores_gemma":[0.9970085,0.001713147,0.0002649273,0.0005194044,0.0003634499,0.0001305735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001467498,0.00006735735,0.001195988,0.0002251085,0.00007250909,0.00009499832,0.0002755803,0.484736,0.004067981,0.3260832,0.002844913,0.1801895],"study_design_scores_gemma":[0.00002271646,0.00006065736,0.00009128563,0.00002004474,0.000007476705,0.00004845361,0.00001599907,0.9362759,0.0005227294,0.06059189,0.002328503,0.00001444719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01472817,0.000944629,0.9811425,0.0002618261,0.00007146558,0.00008322273,0.00006200646,0.0003292377,0.002377026],"genre_scores_gemma":[0.4015464,0.001389711,0.5914036,0.0002995137,0.000147065,0.0005065124,0.0001814867,0.0001115226,0.004414235],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002289214,"threshold_uncertainty_score":0.01080358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4211108110","doi":"10.1017/9781108164085","title":"Artificial Intelligence","year":2017,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Artificial intelligence; Appeal; Space (punctuation); Comprehension; Psychology","authors":[{"name":"David Poole","is_ca":true},{"name":"Alan K. Mackworth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03170559268435974,"gpt":0.2357374996826926,"spread":0.2040319069983329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005409719,0.001038526,0.0006991343,0.00158895,0.001094284,0.007086443,0.001090627,0.001663102,0.07903514],"category_scores_gemma":[0.002073916,0.0003995445,0.0005162359,0.002028119,0.002056909,0.004581828,0.00253944,0.003213851,0.05245742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001852945,"about_ca_system_score_gemma":0.001860317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009506064,"about_ca_topic_score_gemma":0.00166251,"domain_scores_codex":[0.9990068,0.0001508554,0.0000536754,0.0001821815,0.0005522065,0.0000541918],"domain_scores_gemma":[0.9993845,0.0002029694,0.00003030623,0.0001576333,0.0001550372,0.0000696413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001554127,0.00002909322,0.0001958262,0.0005312655,0.00002362521,0.00008791587,0.0003325249,0.0004368096,0.000438122,0.286483,0.4869635,0.2244629],"study_design_scores_gemma":[0.000001647792,0.000004405089,0.0001138753,0.000182237,0.000002210308,0.00008809498,0.00003748098,0.0001173203,0.00007188663,0.04096409,0.9584132,0.000003566955],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0005048775,0.04344187,0.008863442,0.005882986,0.003770557,0.00006903846,0.0004291553,0.0004427636,0.9365953],"genre_scores_gemma":[0.01322659,0.04262733,0.01107904,0.00487903,0.002536713,0.0001641041,0.001277303,0.0003799075,0.9238299],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.07903514,"threshold_uncertainty_score":0.2643989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W158976495","doi":"","title":"Unsupervised and semi-supervised multi-class support vector machines","year":2005,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Support vector machine; Machine learning; Artificial intelligence; Computer science; Generalization; Semidefinite programming; Unsupervised learning; Class (philosophy); Semi-supervised learning; Classifier (UML); Supervised learning; Structured support vector machine; Margin classifier; Pattern recognition (psychology); Artificial neural network; Mathematical optimization; Mathematics","authors":[{"name":"Linli Xu","is_ca":false},{"name":"Dale Schuurmans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01343463304260148,"gpt":0.2518975854423464,"spread":0.2384629523997449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831575,0.00106852,0.001151416,0.0009396014,0.0005159552,0.001576061,0.002397903,0.001256561,0.003347747],"category_scores_gemma":[0.009819808,0.0005459314,0.001049706,0.001050673,0.00123834,0.002924983,0.001940149,0.002609747,0.001787989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004007266,"about_ca_system_score_gemma":0.0006823182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003351855,"about_ca_topic_score_gemma":0.0007600199,"domain_scores_codex":[0.9971291,0.001034129,0.0001722313,0.0006405286,0.0008847027,0.0001392735],"domain_scores_gemma":[0.9932956,0.002720047,0.0008766483,0.001457733,0.001427735,0.0002222044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002259132,0.0003856876,0.001985559,0.0003954934,0.0001657813,0.0001832216,0.0002869972,0.2844281,0.009589868,0.1085842,0.01238795,0.5813813],"study_design_scores_gemma":[0.0000100495,0.00005049539,0.0002514425,0.00001886756,0.000008775285,0.0001023457,0.00001595279,0.9597104,0.003363895,0.0329909,0.003459815,0.00001710824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002904132,0.0001238906,0.9951069,0.0001202873,0.00003165917,0.00003796833,0.00006487088,0.0002478112,0.001362537],"genre_scores_gemma":[0.1570479,0.0003478109,0.8356566,0.0002751051,0.0002684472,0.0003715339,0.0009166944,0.0002427803,0.00487304],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003347747,"threshold_uncertainty_score":0.01497501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W149581298","doi":"","title":"Robust support vector machine training via convex outlier ablation","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Support vector machine; Outlier; Hinge loss; Anomaly detection; Margin (machine learning); Computer science; Pattern recognition (psychology); Margin classifier; Artificial intelligence; Boosting (machine learning); Sensitivity (control systems); Robustness (evolution); Machine learning; Data mining; Engineering","authors":[{"name":"Linli Xu","is_ca":true},{"name":"Koby Crammer","is_ca":false},{"name":"Dale Schuurmans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01988422074986319,"gpt":0.225768737818676,"spread":0.2058845170688128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661938,0.001073505,0.001547179,0.0005590634,0.0003514527,0.0009603593,0.001590329,0.001554584,0.001491423],"category_scores_gemma":[0.01239066,0.0005888341,0.0006094876,0.0008638226,0.001073032,0.001799707,0.002065034,0.002333468,0.0008783395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004263415,"about_ca_system_score_gemma":0.0008412893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006182398,"about_ca_topic_score_gemma":0.0005267519,"domain_scores_codex":[0.9980506,0.0008268745,0.00009103381,0.0002627196,0.000641206,0.0001277053],"domain_scores_gemma":[0.9963918,0.00201974,0.0004389778,0.0005328457,0.0005164691,0.0001001462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000174912,0.00008666085,0.0005700959,0.00008583766,0.00004931678,0.000119835,0.00008015025,0.8425806,0.009612747,0.0239865,0.002137607,0.1205157],"study_design_scores_gemma":[0.000004810975,0.00001702334,0.00002944742,0.000002300738,0.000001390146,0.00001191348,0.000003011892,0.9934158,0.001438354,0.004861305,0.000211548,0.000003001069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005685358,0.00004669717,0.9933406,0.00008462049,0.000008120728,0.00001322651,0.00001318539,0.0003867293,0.0004215069],"genre_scores_gemma":[0.4784835,0.0001635494,0.5180175,0.0001962212,0.0000725071,0.0002473792,0.0002647965,0.0003095928,0.002244956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002661938,"threshold_uncertainty_score":0.01407784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161735965","doi":"","title":"Active Preference Learning with Discrete Choice Data","year":2007,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Exploit; Valuation (finance); Rendering (computer graphics); Machine learning; Artificial intelligence; Mathematical optimization; Mathematics","authors":[{"name":"Eric Brochu","is_ca":true},{"name":"Nando de Freitas","is_ca":true},{"name":"Abhijeet Ghosh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04787942694329,"gpt":0.2862609970477648,"spread":0.2383815701044747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008188049,0.001113889,0.002354959,0.001417201,0.0005881175,0.00265104,0.004594668,0.002812612,0.004132792],"category_scores_gemma":[0.02888148,0.001012623,0.0014693,0.002097485,0.00192421,0.005857422,0.002025853,0.004400119,0.0008292051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001371984,"about_ca_system_score_gemma":0.001036339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002263969,"about_ca_topic_score_gemma":0.002343162,"domain_scores_codex":[0.9952167,0.003022157,0.0002048215,0.0006643707,0.0006822007,0.0002098237],"domain_scores_gemma":[0.9685478,0.0268247,0.001158037,0.001567181,0.00127994,0.0006222698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006641535,0.0005406847,0.003490981,0.0002993258,0.0002435829,0.0001245995,0.0003108558,0.7011273,0.001255199,0.06689432,0.003343679,0.2217053],"study_design_scores_gemma":[0.00003347585,0.00003303713,0.0000663059,0.000007921391,0.000007263651,0.00001172619,0.000008408027,0.9776827,0.0002930317,0.02156855,0.0002805504,0.000007168321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01426017,0.0002305475,0.9837772,0.0004416006,0.00003222051,0.00007356016,0.0001034442,0.0002211791,0.0008601077],"genre_scores_gemma":[0.5856068,0.000332451,0.4098106,0.0004068835,0.0001468592,0.0005558917,0.0004743054,0.00007528323,0.002590841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008188049,"threshold_uncertainty_score":0.04330307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050570613","doi":"10.1145/337244.337257","title":"Learning functions represented as multiplicity automata","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Mathematics; Discrete mathematics; Multiplicity (mathematics); Disjoint sets; Combinatorics; Computer science; Artificial intelligence","authors":[{"name":"Amos Beimel","is_ca":false},{"name":"Francesco Bergadano","is_ca":false},{"name":"Nader H. Bshouty","is_ca":true},{"name":"Eyal Kushilevitz","is_ca":false},{"name":"Stefano Varricchio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008940393291089208,"gpt":0.2585674569749757,"spread":0.2496270636838865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001406796,0.0005548053,0.00102096,0.0009084996,0.0007636292,0.001195746,0.002143541,0.001182069,0.003299191],"category_scores_gemma":[0.01314833,0.0003638208,0.0009472074,0.0009731338,0.00149699,0.006509809,0.001685351,0.001975204,0.0004307005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001853962,"about_ca_system_score_gemma":0.000782278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002138838,"about_ca_topic_score_gemma":0.002217648,"domain_scores_codex":[0.9989859,0.0002320993,0.00006571834,0.0003434066,0.0002211913,0.000151606],"domain_scores_gemma":[0.9931366,0.004886003,0.0005704183,0.0008668691,0.000366849,0.0001731491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003846436,0.0001458336,0.005441482,0.0001846381,0.00005703388,0.0003065666,0.0003363865,0.3411321,0.006280007,0.523066,0.001878838,0.1207863],"study_design_scores_gemma":[0.00001187339,0.00003702882,0.0001366054,0.000006837374,0.000008553747,0.00005161167,0.00001648882,0.828723,0.001540238,0.1689597,0.0004981069,0.00001005266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1372405,0.0002388704,0.8582624,0.0005686405,0.00004196989,0.00004700225,0.0001871047,0.0006980248,0.002715655],"genre_scores_gemma":[0.8409901,0.0001954903,0.1544117,0.0001920075,0.00008210597,0.0001344955,0.0003152884,0.00008038546,0.003598384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003299191,"threshold_uncertainty_score":0.01345146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160163251","doi":"10.1109/sfcs.1993.366857","title":"Exact learning via the Monotone theory","year":2002,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Boolean function; Equivalence (formal languages); Monotone polygon; Mathematics; Function (biology); Discrete mathematics; Decision tree; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence","authors":[{"name":"Nader H. Bshouty","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01012532580674908,"gpt":0.222700719415757,"spread":0.212575393609008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006819772,0.0009765811,0.001369389,0.002777356,0.001079424,0.002883618,0.002690143,0.002050105,0.006804221],"category_scores_gemma":[0.03848279,0.000820424,0.001836801,0.002032688,0.004346348,0.01272973,0.004324456,0.003977637,0.0006551108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002913968,"about_ca_system_score_gemma":0.001407205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002418003,"about_ca_topic_score_gemma":0.001672886,"domain_scores_codex":[0.9942822,0.002287691,0.0002429892,0.001088189,0.001679759,0.0004191927],"domain_scores_gemma":[0.9645582,0.03052609,0.001213446,0.001808287,0.00143312,0.0004607647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000828745,0.00009226628,0.001194763,0.000282577,0.00008205535,0.00009630834,0.0002356401,0.04180615,0.000718625,0.8915337,0.003019349,0.06085571],"study_design_scores_gemma":[0.00001373806,0.00003341988,0.0001558031,0.0000176328,0.0000092205,0.0000525377,0.00001526418,0.1306087,0.0002941501,0.8680024,0.0007886182,0.000008579923],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04036648,0.001519259,0.9448953,0.002413363,0.00009166005,0.00005940245,0.0003428487,0.0003018737,0.01000977],"genre_scores_gemma":[0.7812334,0.002225297,0.2038726,0.001453794,0.0008592242,0.0003295614,0.001223563,0.0001692725,0.008633357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006819772,"threshold_uncertainty_score":0.03606683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170708028","doi":"10.5555/944919.944952","title":"The set covering machine","year":2003,"lang":"en","type":"article","venue":"ePrints Soton (University of Southampton)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Generalization; Set (abstract data type); Artificial intelligence; Machine learning; Generalization error; Support vector machine; Function (biology); Upper and lower bounds; Data set; Online machine learning; Algorithm; Active learning (machine learning); Artificial neural network; Mathematics","authors":[{"name":"Mario Marchand","is_ca":true},{"name":"John Shawe‐Taylor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008750570278197119,"gpt":0.1916936409724109,"spread":0.1829430706942138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001773528,0.0009027614,0.001743724,0.001767088,0.00095914,0.001958986,0.001993179,0.00177533,0.004347568],"category_scores_gemma":[0.01155806,0.0005101079,0.001408337,0.002395843,0.001967484,0.003883868,0.00340991,0.002064367,0.00169045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008948203,"about_ca_system_score_gemma":0.0007797561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006697145,"about_ca_topic_score_gemma":0.0004439881,"domain_scores_codex":[0.997588,0.0008616052,0.0001191594,0.0004573196,0.0007784329,0.0001953959],"domain_scores_gemma":[0.9964526,0.001949527,0.0002189561,0.0008755298,0.0003489845,0.0001544605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001894197,0.00007899511,0.001428238,0.0002997895,0.0001302431,0.0001978889,0.0003146744,0.1278635,0.00335315,0.3120604,0.01922253,0.5348611],"study_design_scores_gemma":[0.00002533091,0.0001139645,0.0004820079,0.00006445769,0.00003658778,0.0004028006,0.00004028139,0.6034234,0.003290397,0.3691534,0.02292934,0.00003808793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0129509,0.001347221,0.977212,0.0006659473,0.0002005893,0.00007604838,0.0002671389,0.0009199011,0.006360191],"genre_scores_gemma":[0.3726193,0.002128403,0.6142649,0.000865355,0.0005884484,0.0003990613,0.001394217,0.0003018772,0.007438405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004347568,"threshold_uncertainty_score":0.01454407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1956666728","doi":"10.1007/11889205_17","title":"Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Parametric statistics; Novelty; Machine learning; Local search (optimization); Artificial intelligence; Mathematics","authors":[{"name":"Frank Hutter","is_ca":true},{"name":"Youssef Hamadi","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007564657004435706,"gpt":0.2255491661934901,"spread":0.2179845091890544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008953182,0.001299091,0.00176241,0.001326438,0.0008037787,0.002309574,0.003542041,0.001997295,0.003671291],"category_scores_gemma":[0.05692054,0.0008768402,0.000979027,0.001324351,0.001898834,0.004180431,0.002429933,0.002891226,0.001084961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550641,"about_ca_system_score_gemma":0.002363444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00207419,"about_ca_topic_score_gemma":0.001763538,"domain_scores_codex":[0.9913133,0.003974086,0.0004143807,0.001615403,0.001929763,0.0007530387],"domain_scores_gemma":[0.962976,0.02461534,0.002078506,0.007698261,0.002195411,0.0004365092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006742442,0.0002410373,0.002314074,0.0001221059,0.00008145881,0.00004666855,0.00009292603,0.7361171,0.004783698,0.04727403,0.003646713,0.2046059],"study_design_scores_gemma":[0.00002441472,0.00004386519,0.0002341833,0.00000894086,0.000008285843,0.00001556645,0.000006586185,0.9781644,0.001240882,0.01992255,0.0003195026,0.00001081719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02909838,0.0005501824,0.9647375,0.0002681994,0.0001054018,0.00005709484,0.00007667608,0.0023338,0.002772733],"genre_scores_gemma":[0.7263855,0.0002651534,0.2698191,0.0001443439,0.0002118501,0.0002154918,0.0002955765,0.0006013536,0.002061557],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008953182,"threshold_uncertainty_score":0.04734951,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shai Ben-David","is_ca":true},{"name":"Reba Schuller Borbely","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01261317721952781,"gpt":0.2234001724758154,"spread":0.2107869952562876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0146333,0.003107342,0.004442395,0.001800215,0.004025043,0.00693081,0.01026371,0.008438602,0.01063525],"category_scores_gemma":[0.09412395,0.00275671,0.003657799,0.003766638,0.007129306,0.02639407,0.02183235,0.02187968,0.004312022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002674509,"about_ca_system_score_gemma":0.004428971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007992115,"about_ca_topic_score_gemma":0.001172828,"domain_scores_codex":[0.9774023,0.006937892,0.001237197,0.005594496,0.006082751,0.002745309],"domain_scores_gemma":[0.8949858,0.06161293,0.004586322,0.0290208,0.005170737,0.0046234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001799993,0.000676542,0.001260561,0.0009137468,0.0002245036,0.0004299323,0.0007821655,0.07264912,0.00824031,0.796269,0.02901591,0.08773822],"study_design_scores_gemma":[0.0001012336,0.0001069215,0.0001488294,0.00003920035,0.00005254358,0.0001908487,0.00004900581,0.1073589,0.002039037,0.8871142,0.002765785,0.00003340841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01285719,0.0007073443,0.9680093,0.004612029,0.0003470656,0.0001023075,0.0003838243,0.002158306,0.01082261],"genre_scores_gemma":[0.6339337,0.001056529,0.3406974,0.005465011,0.002443323,0.0007939923,0.001482986,0.002388004,0.01173899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0146333,"threshold_uncertainty_score":0.07738918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4248809068","doi":"10.1145/342009.335409","title":"XTRACT","year":2000,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; XML validation; Document Structure Description; RELAX NG; Document type definition; XML Schema Editor; Well-formed document; XML Schema (W3C); XML; Streaming XML; Information retrieval; Programming language; Simple API for XML; Efficient XML Interchange; XML Signature; World Wide Web","authors":[{"name":"Minos Garofalakis","is_ca":true},{"name":"Aristides Gionis","is_ca":false},{"name":"Rajeev Rastogi","is_ca":true},{"name":"S. Seshadri","is_ca":true},{"name":"Kyuseok Shim","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003759429383309652,"gpt":0.2165159432663935,"spread":0.2127565138830839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002902595,0.00148043,0.001038659,0.002591496,0.001256764,0.005493193,0.003983581,0.002289868,0.07592473],"category_scores_gemma":[0.01545788,0.001036901,0.001997599,0.003109919,0.0009235136,0.005746903,0.003145984,0.002609062,0.06446952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414077,"about_ca_system_score_gemma":0.002373069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005036589,"about_ca_topic_score_gemma":0.003885039,"domain_scores_codex":[0.9966968,0.0005450408,0.0003283171,0.0007295407,0.001467163,0.0002332155],"domain_scores_gemma":[0.9952807,0.00138526,0.0003523652,0.001637331,0.00113372,0.0002106237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006248241,0.00009999503,0.0018468,0.0008457943,0.0001273796,0.0005756992,0.000307669,0.009333481,0.005245637,0.06208796,0.5776484,0.3412564],"study_design_scores_gemma":[0.00009840054,0.0000926579,0.0007552201,0.0001546253,0.00004982356,0.0005767029,0.00006664008,0.068083,0.009329205,0.04832224,0.8723844,0.00008702221],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.004143927,0.001471852,0.5659677,0.001805346,0.001200253,0.0007246647,0.03895768,0.3142181,0.07151052],"genre_scores_gemma":[0.06919917,0.003009988,0.536665,0.002404437,0.000762875,0.001344469,0.2427288,0.05306061,0.09082482],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9240752,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100559472","doi":"","title":"A Gradient-Based Boosting Algorithm for Regression Problems","year":2000,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Boosting (machine learning); Gradient boosting; Gradient descent; Regression; Computer science; Artificial intelligence; Machine learning; Algorithm; Mathematical optimization; Mathematics; Artificial neural network; Statistics","authors":[{"name":"Richard S. Zemel","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01334868455458278,"gpt":0.2550972427902804,"spread":0.2417485582356976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003741366,0.001792389,0.002922216,0.001400092,0.0007843079,0.001704599,0.002558864,0.002471814,0.004524992],"category_scores_gemma":[0.005423689,0.0009478033,0.00152853,0.002289371,0.001018399,0.001830468,0.001926187,0.003713322,0.005640467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006476979,"about_ca_system_score_gemma":0.001181639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00149034,"about_ca_topic_score_gemma":0.001183763,"domain_scores_codex":[0.9974931,0.001041392,0.0001165489,0.0003379388,0.000887065,0.0001239793],"domain_scores_gemma":[0.9989103,0.0005440409,0.00007454818,0.0001257894,0.0002837733,0.00006155374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001217043,0.0001913249,0.0008084289,0.0006210353,0.0003160347,0.0001520993,0.0001189501,0.3064671,0.005594749,0.1140519,0.02807488,0.5434818],"study_design_scores_gemma":[0.00006303613,0.0001201814,0.0002701288,0.00007171324,0.00004879763,0.0001818337,0.00001272178,0.881254,0.00184508,0.07634361,0.03975096,0.00003807114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004327326,0.001035156,0.9965004,0.0001504547,0.00009721304,0.00007345791,0.00003025193,0.0003725214,0.001307823],"genre_scores_gemma":[0.04148035,0.002563661,0.9487206,0.0003854712,0.0005066749,0.0005510649,0.0003013156,0.0002299566,0.005261024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004524992,"threshold_uncertainty_score":0.01978648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626194254","doi":"10.1162/neco_a_01174","title":"Gated Orthogonal Recurrent Units: On Learning to Forget","year":2019,"lang":"en","type":"article","venue":"Neural Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Army Research Office; Semiconductor Research Corporation; National Science Foundation","keywords":"Artificial intelligence; Computer science; Psychology; Pattern recognition (psychology); Machine learning; Mathematics; Combinatorics","authors":[{"name":"Li Jing","is_ca":false},{"name":"Çağlar Gülçehre","is_ca":true},{"name":"John Peurifoy","is_ca":false},{"name":"Yichen Shen","is_ca":false},{"name":"Max Tegmark","is_ca":false},{"name":"Marin Soljačić","is_ca":false},{"name":"Yoshua Bengio","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01709036190143093,"gpt":0.2741854236455876,"spread":0.2570950617441566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009765513,0.0008391357,0.0008807162,0.0003085545,0.0002869249,0.0006525381,0.002175958,0.0009322104,0.002325169],"category_scores_gemma":[0.004051514,0.0004554329,0.0005530661,0.000364,0.001085266,0.002299114,0.001139845,0.001360957,0.0005809756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005672416,"about_ca_system_score_gemma":0.0005853371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003135764,"about_ca_topic_score_gemma":0.003895453,"domain_scores_codex":[0.9996537,0.00009082534,0.00002208178,0.0001007915,0.00007166981,0.00006107258],"domain_scores_gemma":[0.9988843,0.0005294334,0.0001263698,0.0002035251,0.0001930769,0.00006346218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002570505,0.00008599485,0.001070246,0.000127949,0.00009751206,0.0002184334,0.0001527551,0.7709413,0.01208097,0.05990752,0.002897024,0.1521633],"study_design_scores_gemma":[0.00000528175,0.00003208159,0.00005949977,0.000004244556,0.000009680306,0.00001927788,0.000003306912,0.9888417,0.001246195,0.009389327,0.0003839197,0.000005569401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05099878,0.0006842622,0.9433877,0.0003761417,0.0001415979,0.00003578145,0.0001028681,0.001021838,0.003251037],"genre_scores_gemma":[0.8665729,0.0006637243,0.122654,0.0004195621,0.0001161646,0.0001237575,0.0003089015,0.0002371498,0.008903806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003135764,"threshold_uncertainty_score":0.007778466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1790582767","doi":"","title":"Agnostic Online Learning.","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Learnability; Regret; Margin (machine learning); VC dimension; Computer science; Class (philosophy); Dimension (graph theory); Characterization (materials science); Sample complexity; Theoretical computer science; Probably approximately correct learning; Artificial intelligence; Mathematics; Discrete mathematics; Machine learning; Stability (learning theory); Algorithmic learning theory; Combinatorics","authors":[{"name":"Shai Ben-David","is_ca":true},{"name":"Dávid Pál","is_ca":true},{"name":"Shai Shalev‐Shwartz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007886918989418094,"gpt":0.2558941338960841,"spread":0.248007214906666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005645711,0.001776898,0.001784175,0.0009898145,0.0007146798,0.002483967,0.003750085,0.002824596,0.006113456],"category_scores_gemma":[0.03219464,0.001021919,0.001489044,0.001260135,0.002738706,0.007430803,0.00380227,0.005644486,0.001025605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002532968,"about_ca_system_score_gemma":0.001136885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008402694,"about_ca_topic_score_gemma":0.0009474385,"domain_scores_codex":[0.9946705,0.002412915,0.0001408919,0.001191669,0.001116106,0.0004679545],"domain_scores_gemma":[0.9653794,0.02587055,0.002973312,0.004153744,0.0008080099,0.0008151336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005055835,0.0007002314,0.002922581,0.0004693545,0.0002920741,0.0002511062,0.0002112794,0.4820926,0.001579293,0.4283594,0.008264,0.07435251],"study_design_scores_gemma":[0.00003466825,0.0001153511,0.0002779101,0.00002209536,0.00003122311,0.0001017368,0.00001484757,0.7470548,0.0006135053,0.2502641,0.001454278,0.00001558246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02689239,0.0008497362,0.9612924,0.001663926,0.00009349715,0.0001221317,0.0003359895,0.0004142674,0.00833562],"genre_scores_gemma":[0.8482614,0.0008827316,0.136823,0.001609514,0.0005541157,0.0004627828,0.000870145,0.0001830493,0.01035327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006113456,"threshold_uncertainty_score":0.0298577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163187564","doi":"10.48550/arxiv.1503.08329","title":"Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bayesian probability; Statistical learning theory; Computer science; Upper and lower bounds; Divergence (linguistics); AdaBoost; Artificial intelligence; Probably approximately correct learning; Machine learning; Algorithm; Bayesian statistics; Mathematics; Support vector machine; Bayesian inference; Algorithmic learning theory; Unsupervised learning","authors":[{"name":"Pascal Germain","is_ca":true},{"name":"Alexandre Lacasse","is_ca":true},{"name":"François Laviolette","is_ca":true},{"name":"Mario Marchand","is_ca":true},{"name":"Jean-Francis Roy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03610584429556141,"gpt":0.1980005763968624,"spread":0.161894732101301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01222439,0.001542801,0.002725257,0.001920375,0.001443888,0.004670459,0.003599334,0.002962837,0.006149835],"category_scores_gemma":[0.05093639,0.001138587,0.001585195,0.00198084,0.005003858,0.008803708,0.005063034,0.007071361,0.001496803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002880581,"about_ca_system_score_gemma":0.002398715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001492652,"about_ca_topic_score_gemma":0.0009294066,"domain_scores_codex":[0.9904795,0.004597498,0.0002743212,0.00122407,0.002836426,0.0005882059],"domain_scores_gemma":[0.9745907,0.01948186,0.001091052,0.002137594,0.002217453,0.0004814421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000126429,0.00007063209,0.00074621,0.0001903824,0.00008191809,0.00007104417,0.0002642788,0.222528,0.0009186438,0.6907874,0.006557565,0.07765753],"study_design_scores_gemma":[0.00001478312,0.00004858782,0.0002005704,0.00006781596,0.00001444443,0.00006113068,0.00003055443,0.5207208,0.0007923243,0.4745091,0.003512532,0.00002718033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004089502,0.0009711621,0.9887562,0.001213816,0.00006565113,0.00003516097,0.00004670343,0.0001277697,0.004693949],"genre_scores_gemma":[0.457112,0.003357322,0.5220872,0.002024133,0.0013228,0.0007200622,0.0003580766,0.0009039359,0.01211451],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01222439,"threshold_uncertainty_score":0.06464952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119480209","doi":"10.1109/lgrs.2009.2021964","title":"Mine Classification With Imbalanced Data","year":2009,"lang":"en","type":"article","venue":"IEEE Geoscience and Remote Sensing Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Clutter; Computer science; Sonar; One-class classification; Data mining; Statistical classification; Class (philosophy); Data set; Radar; Logistic regression; Support vector machine; Set (abstract data type); Classification rule; Artificial intelligence; Remote sensing; Pattern recognition (psychology); Machine learning; Geology","authors":[{"name":"David P. Williams","is_ca":false},{"name":"Vincent Myers","is_ca":true},{"name":"Miranda Schatten Silvious","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02251171805911829,"gpt":0.2586820343499466,"spread":0.2361703162908284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079179,0.0009870275,0.001596578,0.00252016,0.000884413,0.002047805,0.001654448,0.001638232,0.0006915629],"category_scores_gemma":[0.0213571,0.0004579384,0.0008244893,0.002480191,0.001076514,0.003223121,0.002267132,0.001677631,0.0006770493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008853931,"about_ca_system_score_gemma":0.000590789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001226866,"about_ca_topic_score_gemma":0.0009150264,"domain_scores_codex":[0.9957093,0.001479374,0.0003339016,0.0009171905,0.001234029,0.0003262364],"domain_scores_gemma":[0.9889216,0.006105804,0.001305295,0.001758996,0.00166343,0.0002448272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001985074,0.0008399546,0.0694162,0.0003258487,0.0002985264,0.0009752067,0.0006497305,0.3507281,0.01165956,0.007411036,0.008994017,0.5467168],"study_design_scores_gemma":[0.00004293911,0.0001270584,0.007580229,0.00002107473,0.00002696022,0.0002339927,0.0002011895,0.972349,0.004599001,0.01294946,0.001838345,0.00003067766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3168711,0.0009914254,0.6751972,0.001412349,0.0003062606,0.0001959315,0.0009159952,0.00138822,0.002721501],"genre_scores_gemma":[0.8864639,0.0003077005,0.1094817,0.0003150777,0.0003375196,0.0001668978,0.001792091,0.00006886125,0.001066311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0079179,"threshold_uncertainty_score":0.04187435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2533861448","doi":"10.1145/2983323.2983776","title":"Scalability of Continuous Active Learning for Reliable High-Recall Text Classification","year":2016,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalability; Classifier (UML); Limiting; Computer science; Recall; Artificial intelligence; Machine learning; Binary logarithm; Precision and recall; Class (philosophy); Information retrieval; Mathematics; Discrete mathematics; Database","authors":[{"name":"Gordon V. Cormack","is_ca":true},{"name":"Maura R. Grossman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0129889152481545,"gpt":0.2532292927712201,"spread":0.2402403775230657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01156597,0.001625118,0.001917777,0.002086417,0.0009469083,0.003515176,0.005207991,0.002492375,0.003839417],"category_scores_gemma":[0.04534916,0.001023922,0.001016799,0.002024318,0.002286736,0.007220058,0.004738386,0.003560989,0.002283967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001729518,"about_ca_system_score_gemma":0.001827554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003342862,"about_ca_topic_score_gemma":0.003131978,"domain_scores_codex":[0.9933831,0.001970976,0.0003916211,0.001438715,0.002501895,0.0003136603],"domain_scores_gemma":[0.9689741,0.02023782,0.001288891,0.005603043,0.003244341,0.0006518493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001189237,0.0006634304,0.004407856,0.0005225536,0.0001713523,0.0002780333,0.0005261101,0.3180613,0.01363162,0.01969392,0.0119768,0.6288778],"study_design_scores_gemma":[0.00005066864,0.00005209866,0.0002780664,0.00001322762,0.00001070722,0.00005443837,0.00003355108,0.9835159,0.002423139,0.01261725,0.0009388205,0.00001210084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03814657,0.001385567,0.9471282,0.001111782,0.0001180941,0.0002658803,0.0003891965,0.007909627,0.003545131],"genre_scores_gemma":[0.6040124,0.0005846552,0.3896445,0.000535611,0.0003986055,0.0006506123,0.001389188,0.0004656987,0.002318758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01156597,"threshold_uncertainty_score":0.06116742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964075712","doi":"","title":"Budgeted learning of nailve-bayes classifiers","year":2002,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Feature (linguistics); Naive Bayes classifier; Machine learning; Feature selection; Artificial intelligence; Process (computing); Value (mathematics); Selection (genetic algorithm); Bayes' theorem; Bayesian probability","authors":[{"name":"Daniel J. Lizotte","is_ca":true},{"name":"Omid Madani","is_ca":true},{"name":"Russell Greiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04903405411588053,"gpt":0.1643136255895137,"spread":0.1152795714736331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009393721,0.001092694,0.003418171,0.00124026,0.0009148617,0.002266923,0.004035179,0.003158552,0.005233907],"category_scores_gemma":[0.02837174,0.001642889,0.000968224,0.001229966,0.001554516,0.006143269,0.002707077,0.002755577,0.001170021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00212257,"about_ca_system_score_gemma":0.002119766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006276023,"about_ca_topic_score_gemma":0.006669234,"domain_scores_codex":[0.9965531,0.001624832,0.0002449997,0.0006233759,0.0005884242,0.0003654111],"domain_scores_gemma":[0.9872997,0.01005866,0.0005451315,0.0008250432,0.0009306652,0.0003407572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001467352,0.0003803144,0.004326053,0.0002824115,0.0001378467,0.0001050117,0.0004172073,0.6055051,0.001244159,0.06152521,0.005667001,0.3189423],"study_design_scores_gemma":[0.00005452343,0.00005999951,0.0001957933,0.00003880874,0.00001541922,0.0000232525,0.00002563465,0.9570603,0.0004723578,0.04132282,0.0007189697,0.00001212015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05841257,0.001612367,0.9338756,0.0009397648,0.00008848613,0.0002426413,0.0002450902,0.0006626165,0.00392084],"genre_scores_gemma":[0.6442587,0.0008144351,0.3451215,0.0005338945,0.0001928914,0.0006677845,0.0007380086,0.0001523876,0.007520336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009393721,"threshold_uncertainty_score":0.04967934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999376700","doi":"10.1016/j.tcs.2012.10.013","title":"Tighter PAC-Bayes bounds through distribution-dependent priors","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Prior probability; Bayes' theorem; Mathematics; Reproducing kernel Hilbert space; Regularization (linguistics); Mathematical optimization; Applied mathematics; Exponential family; Algorithm; Class (philosophy); Function (biology); Distribution (mathematics); Computer science; Hilbert space; Artificial intelligence; Bayesian probability; Statistics; Mathematical analysis","authors":[{"name":"Guy Lever","is_ca":false},{"name":"François Laviolette","is_ca":true},{"name":"John Shawe‐Taylor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007516441666955032,"gpt":0.2596614497271334,"spread":0.2521450080601784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02442865,0.004749354,0.005889921,0.003936542,0.00308106,0.008727347,0.006537524,0.005706833,0.01590188],"category_scores_gemma":[0.1343143,0.004338477,0.002848298,0.004736926,0.007082033,0.02396195,0.01111773,0.01905622,0.004234355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006213488,"about_ca_system_score_gemma":0.005962928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004283873,"about_ca_topic_score_gemma":0.007330006,"domain_scores_codex":[0.9804388,0.008498205,0.0007061744,0.002843843,0.005839943,0.001673024],"domain_scores_gemma":[0.8885446,0.09400424,0.002146596,0.009916694,0.003787975,0.00159982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005863367,0.0002329041,0.001248819,0.000487281,0.0002028034,0.0002079119,0.0003703079,0.1478463,0.001267381,0.7673877,0.01787676,0.06228544],"study_design_scores_gemma":[0.00004821291,0.00002558289,0.00017641,0.0001031954,0.00004538459,0.00008545606,0.00003064179,0.2086903,0.0005522135,0.7875804,0.002632376,0.00002997053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008352932,0.005144183,0.9587742,0.00471911,0.0005491191,0.00008820871,0.0004673567,0.000852181,0.02105268],"genre_scores_gemma":[0.4263748,0.008062733,0.5233052,0.00744865,0.003554808,0.0009455394,0.002078983,0.002656586,0.02557284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02442865,"threshold_uncertainty_score":0.1291926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136791927","doi":"10.1613/jair.2486","title":"A General Theory of Additive State Space Abstractions","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Disjoint sets; Heuristics; Computer science; State (computer science); Space (punctuation); Heuristic; State space; Cube (algebra); Set (abstract data type); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Programming language; Artificial intelligence","authors":[{"name":"Fan Yang","is_ca":true},{"name":"Joseph Culberson","is_ca":true},{"name":"Robert C. Holte","is_ca":true},{"name":"Uzi Zahavi","is_ca":false},{"name":"Ariel Felner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1425791225320405,"gpt":0.4123511718843479,"spread":0.2697720493523074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003332542,0.001352732,0.001135884,0.002226278,0.001325355,0.004986197,0.003079406,0.001647418,0.007131952],"category_scores_gemma":[0.01494511,0.001234537,0.003186666,0.002591122,0.005380559,0.007954082,0.005359334,0.004385013,0.001136872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002117167,"about_ca_system_score_gemma":0.00244456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002073406,"about_ca_topic_score_gemma":0.001374298,"domain_scores_codex":[0.9947721,0.00111443,0.0006381673,0.001293992,0.001529047,0.0006522334],"domain_scores_gemma":[0.9913825,0.004386978,0.0008628855,0.002309873,0.0007568464,0.0003009686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005760953,0.00003956678,0.0005547292,0.0001468056,0.00004517385,0.0001009832,0.0002629055,0.07043266,0.001557947,0.9049677,0.0009500323,0.02088381],"study_design_scores_gemma":[0.0000317487,0.0001228897,0.0002300987,0.00007472378,0.0000537062,0.0001667675,0.0001026443,0.1805363,0.002920067,0.8057384,0.009983605,0.00003903816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009922077,0.0002416133,0.9839115,0.0002780721,0.00004620013,0.00009671562,0.0002373463,0.0005993187,0.004667141],"genre_scores_gemma":[0.3975696,0.0007414817,0.5933116,0.0005922919,0.000160772,0.001108361,0.0008769404,0.0002562948,0.005382618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007131952,"threshold_uncertainty_score":0.02385879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903822982","doi":"10.1038/s42256-018-0002-3","title":"Learnability can be undecidable","year":2018,"lang":"en","type":"article","venue":"Nature Machine Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation; Blavatnik Family Foundation","keywords":"Learnability; Undecidable problem; Axiom; Equivalence (formal languages); Computer science; Simple (philosophy); Theoretical computer science; Mathematical economics; Calculus (dental); Discrete mathematics; Mathematics; Artificial intelligence; Epistemology; Philosophy","authors":[{"name":"Shai Ben-David","is_ca":true},{"name":"Pavel Hrubeš","is_ca":false},{"name":"Shay Moran","is_ca":false},{"name":"Amir Yehudayoff","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01066293481570787,"gpt":0.2962755317636216,"spread":0.2856125969479138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003663613,0.001288065,0.001312424,0.001655613,0.002879253,0.00619203,0.003153342,0.003786027,0.01284971],"category_scores_gemma":[0.03795297,0.001146875,0.002712643,0.001785804,0.008218228,0.01751988,0.005508211,0.01186885,0.001583086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003317735,"about_ca_system_score_gemma":0.003076082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002719257,"about_ca_topic_score_gemma":0.002697228,"domain_scores_codex":[0.9940841,0.00105427,0.0004178032,0.001672352,0.001765019,0.001006515],"domain_scores_gemma":[0.9408681,0.04745974,0.001759687,0.004816121,0.003774998,0.001321389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000184827,0.0001596408,0.001312978,0.0003214752,0.00007220803,0.0003106877,0.0004797626,0.008978446,0.0009512417,0.9568822,0.01201329,0.01833309],"study_design_scores_gemma":[0.00002831718,0.000009022774,0.00007453351,0.00001773959,0.00001623469,0.00005213415,0.00005054177,0.006594499,0.000572313,0.9906383,0.00193603,0.0000104052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2841479,0.002319994,0.4750483,0.05621612,0.002271598,0.0003814723,0.00489325,0.004947103,0.1697742],"genre_scores_gemma":[0.9313591,0.0009744255,0.0340606,0.004202155,0.0009586914,0.0004514394,0.003126891,0.0007760884,0.02409058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01284971,"threshold_uncertainty_score":0.04298657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526144783","doi":"10.1007/11564096_59","title":"Active Learning in Partially Observable Markov Decision Processes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Markov decision process; Observable; Computer science; Process (computing); Markov process; Mathematical optimization; Decision problem; Artificial intelligence; Decision process; Markov chain; Markov model; Machine learning; Mathematics; Algorithm; Engineering; Management science; Statistics","authors":[{"name":"Robin Jaulmes","is_ca":true},{"name":"Joëlle Pineau","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0136294422937688,"gpt":0.2560121948938667,"spread":0.2423827526000979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002593889,0.0009912386,0.00135056,0.0006403939,0.0006429615,0.001772182,0.001546568,0.001736069,0.002260913],"category_scores_gemma":[0.007850461,0.0008999797,0.0008629856,0.001083223,0.002185617,0.002603168,0.001704364,0.002739765,0.0003081673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001527847,"about_ca_system_score_gemma":0.001171755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003932287,"about_ca_topic_score_gemma":0.003079704,"domain_scores_codex":[0.9986945,0.0006810311,0.00005412363,0.0002182841,0.0002430321,0.0001090497],"domain_scores_gemma":[0.9926869,0.006604554,0.0002573535,0.0001427044,0.0001766175,0.0001319766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001132173,0.00007334983,0.0005651047,0.0002024165,0.00006461769,0.0001278008,0.0001935875,0.7504304,0.0005468628,0.2079193,0.001298659,0.0384647],"study_design_scores_gemma":[0.00002210705,0.00001889343,0.00004608016,0.00001438864,0.000007600721,0.00001049807,0.0000105425,0.8820075,0.0001765746,0.116915,0.0007650074,0.000005754785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01240617,0.002290606,0.9794745,0.0005984801,0.00008777907,0.00003779648,0.00006067392,0.0002231508,0.004820708],"genre_scores_gemma":[0.7597335,0.003759789,0.2271774,0.0002448112,0.0003879645,0.0003452964,0.0002691055,0.0001094291,0.00797262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003932287,"threshold_uncertainty_score":0.01371795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4252287331","doi":"10.4018/978-1-5225-7368-5.ch003","title":"Artificial Intelligence Review","year":2018,"lang":"en","type":"book-chapter","venue":"Advances in computer and electrical engineering book series","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Turing test; Artificial intelligence; Computer science; Fuzzy logic; Artificial Intelligence System; Applications of artificial intelligence; Artificial neural network; Cover (algebra); Machine learning; Engineering","authors":[{"name":"Amal Kilani","is_ca":false},{"name":"Ahmed Ben Hamida","is_ca":false},{"name":"Habib Hamam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007932784901009269,"gpt":0.2372539404540633,"spread":0.229321155553054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009245578,0.0009242416,0.0009986792,0.004064584,0.0008973189,0.00407191,0.001539916,0.001767315,0.04654704],"category_scores_gemma":[0.003207295,0.0003646985,0.0006742278,0.005355368,0.00101259,0.003430285,0.001476344,0.002726609,0.02984922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00234793,"about_ca_system_score_gemma":0.002469585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001832959,"about_ca_topic_score_gemma":0.002704078,"domain_scores_codex":[0.9990938,0.0001519953,0.00008282351,0.0001496414,0.0004528166,0.00006904723],"domain_scores_gemma":[0.9985079,0.000690577,0.0000766478,0.000096062,0.0005246979,0.0001041217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000238954,0.00004647027,0.0001886109,0.003551452,0.00003835657,0.0001705112,0.0002058564,0.0004925014,0.0003624163,0.04864007,0.4720517,0.4742281],"study_design_scores_gemma":[0.000001283816,0.000006284576,0.0001192316,0.00075244,0.000005155991,0.0002249508,0.00003088495,0.00003458693,0.00004264017,0.004198403,0.9945798,0.000004385743],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0004337736,0.8641354,0.002002364,0.008761857,0.007609088,0.00003351893,0.0002976836,0.0001228838,0.1166035],"genre_scores_gemma":[0.005149048,0.9006563,0.002720954,0.00748545,0.006082753,0.0000594862,0.0007800311,0.0001157839,0.07695009],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.04654704,"threshold_uncertainty_score":0.1557153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951025196","doi":"","title":"Learning Algorithms for Active Learning","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Microsoft (Canada)","funders":"","keywords":"MovieLens; Heuristic; Computer science; Artificial intelligence; Machine learning; Construct (python library); Selection (genetic algorithm); Representation (politics); Model selection; Algorithm; Training set; Active learning (machine learning); Recommender system; Collaborative filtering","authors":[{"name":"Philip Bachman","is_ca":true},{"name":"Alessandro Sordoni","is_ca":true},{"name":"Adam Trischler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07412385670808344,"gpt":0.2285695936773584,"spread":0.1544457369692749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00675932,0.002511309,0.002642573,0.002619644,0.00110072,0.004721615,0.005889712,0.003792472,0.01150707],"category_scores_gemma":[0.02813838,0.001338094,0.002226555,0.003664591,0.002501585,0.006367368,0.004819088,0.007016813,0.006022591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001817984,"about_ca_system_score_gemma":0.001964147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001940331,"about_ca_topic_score_gemma":0.001866973,"domain_scores_codex":[0.9942287,0.002768627,0.0003916882,0.001097827,0.001250243,0.0002628209],"domain_scores_gemma":[0.9867778,0.0095128,0.0005320979,0.001727274,0.001175007,0.0002749789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007638871,0.0001736308,0.000927404,0.0005196666,0.0002261157,0.00009123718,0.0001684815,0.1606322,0.0005509347,0.5856603,0.02052595,0.2304478],"study_design_scores_gemma":[0.00004048906,0.00002965369,0.00006660751,0.00006972782,0.00002326987,0.00005911727,0.00001893313,0.470939,0.0003081845,0.5157132,0.01271488,0.00001688369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003183744,0.000825163,0.9956188,0.0004305408,0.0001134917,0.00005646303,0.0001220521,0.000360123,0.002155033],"genre_scores_gemma":[0.08177865,0.003925791,0.8972024,0.001281633,0.00130554,0.001822301,0.00156713,0.00059794,0.01051859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01150707,"threshold_uncertainty_score":0.03849494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2740505281","doi":"10.24963/ijcai.2017/261","title":"Cost-Effective Active Learning from Diverse Labelers","year":2017,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Novelis (Canada)","funders":"National Key Research and Development Program of China; Nanjing University; National Natural Science Foundation of China","keywords":"Computer science; Crowdsourcing; Artificial intelligence; Selection (genetic algorithm); Quality (philosophy); Machine learning; Supervised learning; Ground truth; Artificial neural network","authors":[{"name":"Sheng-Jun Huang","is_ca":true},{"name":"Jia-Lve Chen","is_ca":true},{"name":"Xin Mu","is_ca":true},{"name":"Zhi‐Hua Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03486200667316531,"gpt":0.3052119527193748,"spread":0.2703499460462095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009922205,0.002484715,0.003453064,0.001685479,0.001807439,0.003063421,0.006927292,0.005013816,0.002891553],"category_scores_gemma":[0.02246239,0.0008713939,0.001385833,0.001918442,0.002851504,0.005749993,0.004210357,0.003747419,0.0009915073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001516526,"about_ca_system_score_gemma":0.001638845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002230724,"about_ca_topic_score_gemma":0.003107661,"domain_scores_codex":[0.9938069,0.003220031,0.0002746038,0.001102431,0.001210875,0.0003850654],"domain_scores_gemma":[0.9710153,0.02311806,0.001213815,0.002013473,0.00195912,0.000680175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002103536,0.001276273,0.006300773,0.0005018945,0.0002515784,0.0005008717,0.00112991,0.5282317,0.01138615,0.03928551,0.01216819,0.3968636],"study_design_scores_gemma":[0.00008844869,0.0000807641,0.0001039075,0.00001483224,0.00002148473,0.00004549936,0.00006429798,0.9785964,0.002048748,0.01826363,0.0006599275,0.00001205439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04778524,0.0007110923,0.9461551,0.001312111,0.00008720461,0.0002803474,0.0001759107,0.00102298,0.002469961],"genre_scores_gemma":[0.7559428,0.0002877811,0.2349313,0.001479138,0.0004356877,0.0008468955,0.0007369817,0.0002601287,0.005079243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009922205,"threshold_uncertainty_score":0.05247426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968541942","doi":"10.1007/s00454-004-1108-4","title":"Covering Things with Things","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Running time; Time complexity; Discrete mathematics; Computational geometry; Notation; Algorithm","authors":[{"name":"Stefan Langerman","is_ca":false},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005501027611406248,"gpt":0.2283880361121284,"spread":0.2228870085007222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192581,0.0008360358,0.000857097,0.001424336,0.003302268,0.005442217,0.000782045,0.001593287,0.03771838],"category_scores_gemma":[0.004439026,0.000499505,0.00109405,0.002048308,0.006324387,0.01274187,0.005518472,0.003626136,0.008194515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00112493,"about_ca_system_score_gemma":0.0006033519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008732948,"about_ca_topic_score_gemma":0.0007568297,"domain_scores_codex":[0.9986269,0.0005060196,0.00006079721,0.0003901855,0.0002861933,0.0001297925],"domain_scores_gemma":[0.9984573,0.0004814735,0.00007352472,0.0006436139,0.0001840722,0.0001600094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004780768,0.000001690106,0.00003955634,0.00002036203,0.000004290135,0.00002100044,0.0002318008,0.0001231741,0.00007728945,0.9857465,0.007936304,0.00579332],"study_design_scores_gemma":[0.000002335699,0.000004067328,0.00005158241,0.00001495562,0.000004973685,0.00008787535,0.0001800104,0.0002750242,0.00006742554,0.9032963,0.09601092,0.000004557359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01647739,0.0100048,0.2736001,0.02419771,0.004770334,0.0001055202,0.000910284,0.001091895,0.6688421],"genre_scores_gemma":[0.5626434,0.01020881,0.095575,0.009725685,0.0043922,0.0004222369,0.002336039,0.001461085,0.3132355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03771838,"threshold_uncertainty_score":0.1261806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1961366647","doi":"","title":"Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials","year":2010,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise comparison; Subroutine; Regularization (linguistics); Projection (relational algebra); Mathematics; Constraint (computer-aided design); Mathematical optimization; Computer science; Algorithm; Applied mathematics; Artificial intelligence","authors":[{"name":"Mark Schmidt","is_ca":true},{"name":"Kevin P. Murphy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008306696626368059,"gpt":0.237808589320126,"spread":0.229501892693758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004106607,0.001570444,0.001881595,0.000855414,0.000853717,0.001905191,0.0028475,0.002413396,0.002190955],"category_scores_gemma":[0.02093441,0.0007459628,0.001062899,0.001429217,0.002230065,0.006368991,0.004186041,0.004479615,0.0007604698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001333227,"about_ca_system_score_gemma":0.001156726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002770224,"about_ca_topic_score_gemma":0.004128442,"domain_scores_codex":[0.9971797,0.001877319,0.00005876927,0.0002731364,0.000486405,0.0001247035],"domain_scores_gemma":[0.9861232,0.01076675,0.0007701258,0.00133117,0.0005915649,0.0004172287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001064544,0.0001245307,0.0009408626,0.000120792,0.00007262512,0.0001240891,0.0001430317,0.8415926,0.001459489,0.08247694,0.002449468,0.07038926],"study_design_scores_gemma":[0.000003399887,0.00001495476,0.00004119083,0.000003635939,0.000001997294,0.0000103978,0.000005336315,0.9636698,0.0002081151,0.03588701,0.0001505981,0.000003486466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01779673,0.0004171585,0.9792762,0.0008042762,0.00001939855,0.00003317418,0.00004860767,0.0003364981,0.001267988],"genre_scores_gemma":[0.6345219,0.000863492,0.358323,0.0006298698,0.0002304955,0.0002429468,0.0005357335,0.0003648253,0.004287682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004106607,"threshold_uncertainty_score":0.02171808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024502076","doi":"10.1016/j.tcs.2008.02.030","title":"Learning indexed families of recursive languages from positive data: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Inductive reasoning; Recursion (computer science); Computer science; Decidability; Artificial intelligence; Computability theory; Naturalness; String (physics); Theoretical computer science; Natural language processing; Mathematics; Algorithm","authors":[{"name":"Steffen Lange","is_ca":false},{"name":"Thomas Zeugmann","is_ca":false},{"name":"Sandra Zilles","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01794179412045612,"gpt":0.279540050806685,"spread":0.2615982566862289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01242019,0.001023457,0.002613572,0.00386755,0.00109971,0.004509422,0.004324635,0.00211708,0.003140323],"category_scores_gemma":[0.05423117,0.001348329,0.002136354,0.0056236,0.002987192,0.01948285,0.004088407,0.003236976,0.001480619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626726,"about_ca_system_score_gemma":0.003070677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001048978,"about_ca_topic_score_gemma":0.001373154,"domain_scores_codex":[0.9920522,0.002981343,0.0008714498,0.001803158,0.002017166,0.0002746664],"domain_scores_gemma":[0.9262694,0.06164993,0.001886529,0.006311303,0.00330069,0.0005821754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002662751,0.0003450038,0.01429022,0.002133785,0.0001490397,0.0001461593,0.0008080967,0.02986162,0.001748099,0.1540888,0.009309815,0.786853],"study_design_scores_gemma":[0.00006706902,0.000352898,0.002895933,0.0007653167,0.00009625058,0.0011192,0.0006483904,0.3096121,0.003220732,0.6470532,0.03406512,0.0001036841],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.03750618,0.04165713,0.9086388,0.004006153,0.0001407609,0.0001419646,0.001305602,0.001723852,0.004879591],"genre_scores_gemma":[0.3780954,0.06418295,0.5397565,0.001957295,0.001741843,0.0006320293,0.007956876,0.001019542,0.004657558],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01242019,"threshold_uncertainty_score":0.06568503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562418542","doi":"10.1007/11564096_20","title":"Learning and Classifying Under Hard Budgets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Classifier (UML); Purchasing; Feature (linguistics); Artificial intelligence; Machine learning; Variety (cybernetics)","authors":[{"name":"Aloak Kapoor","is_ca":true},{"name":"Russell Greiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01588892784920567,"gpt":0.2573441023372715,"spread":0.2414551744880658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003002251,0.000932257,0.001771001,0.001395571,0.0007181512,0.003555343,0.001990063,0.001874691,0.008150267],"category_scores_gemma":[0.02204253,0.0006198318,0.000745573,0.002131118,0.001921529,0.01024175,0.002302049,0.003042743,0.001283258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001279031,"about_ca_system_score_gemma":0.0009644149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001291691,"about_ca_topic_score_gemma":0.0009909633,"domain_scores_codex":[0.9981605,0.000646745,0.0001156544,0.0004612375,0.0003560622,0.0002598116],"domain_scores_gemma":[0.9882641,0.008604867,0.0008437657,0.001311343,0.0005156882,0.0004603252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005828316,0.000184175,0.006089951,0.000401429,0.0001056845,0.0001545756,0.0003490108,0.1047971,0.001524195,0.4740149,0.03762379,0.3741724],"study_design_scores_gemma":[0.00002448831,0.00003824821,0.0006230632,0.00004496085,0.00001625524,0.00005961931,0.00008081785,0.2541636,0.0007476897,0.7407147,0.003475486,0.00001116632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.156562,0.002699787,0.8021575,0.008726089,0.0004932035,0.0001382961,0.001387317,0.0009095009,0.02692644],"genre_scores_gemma":[0.7583194,0.003380121,0.1814713,0.001178835,0.002307347,0.0004636832,0.00334631,0.0005586478,0.04897433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008150267,"threshold_uncertainty_score":0.02726543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1483994939","doi":"10.1007/978-3-540-74958-5_15","title":"Decision Tree Instability and Active Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decision tree; Computer science; Stability (learning theory); Tree (set theory); Machine learning; Context (archaeology); Incremental decision tree; Active learning (machine learning); Artificial intelligence; Domain (mathematical analysis); ID3 algorithm; Instability; Decision tree learning; Mathematics","authors":[{"name":"Kenneth Dwyer","is_ca":true},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01589490901043121,"gpt":0.2716418455757377,"spread":0.2557469365653065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002343569,0.0004996482,0.0009093496,0.001156536,0.0006512725,0.00206462,0.00147039,0.001721767,0.004154178],"category_scores_gemma":[0.02033652,0.0003912169,0.000498828,0.001310022,0.001937856,0.004735843,0.001517455,0.003731073,0.0007931144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007933869,"about_ca_system_score_gemma":0.0004013092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004585445,"about_ca_topic_score_gemma":0.0003411462,"domain_scores_codex":[0.9989263,0.0003494381,0.00005959129,0.0001664474,0.0004172617,0.00008093563],"domain_scores_gemma":[0.9891505,0.008215084,0.0007225954,0.0007665676,0.0008335866,0.000311811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001014313,0.00008374597,0.0007938294,0.0001434675,0.0000409958,0.0001197089,0.0001870946,0.08259212,0.002518195,0.7839832,0.007510602,0.1219255],"study_design_scores_gemma":[0.00001175373,0.00002494218,0.0001647641,0.00001809062,0.000009249507,0.00008265187,0.0000146153,0.3056619,0.001345662,0.6895683,0.003087705,0.00001039949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03400282,0.005345859,0.933785,0.002370872,0.0004978336,0.00005260681,0.00008952706,0.0003573947,0.02349817],"genre_scores_gemma":[0.8460893,0.00339004,0.1137233,0.0006015704,0.001408815,0.0001554999,0.0002678516,0.0002906938,0.03407295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004154178,"threshold_uncertainty_score":0.01389712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2514090203","doi":"10.1145/2970276.2970300","title":"Local-based active classification of test report to assist crowdsourced testing","year":2016,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Machine learning; Classifier (UML); Artificial intelligence; Crowdsourcing; Task (project management); Labeled data; Training set; Process (computing); Test data; Test (biology); Supervised learning; Data mining; Engineering; Artificial neural network; Software engineering","authors":[{"name":"Junjie Wang","is_ca":false},{"name":"Song Wang","is_ca":true},{"name":"Qiang Cui","is_ca":false},{"name":"Qing Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02679950523859292,"gpt":0.2768267888599649,"spread":0.250027283621372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005447642,0.002134967,0.002192847,0.003310692,0.0007711643,0.00184859,0.004317307,0.001702742,0.001734542],"category_scores_gemma":[0.01925476,0.0003882143,0.000879688,0.002091353,0.0009750638,0.002280725,0.002300657,0.001663551,0.001340235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110811,"about_ca_system_score_gemma":0.001092077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004095014,"about_ca_topic_score_gemma":0.005798416,"domain_scores_codex":[0.9949096,0.001611839,0.000330712,0.001483176,0.001284679,0.0003800878],"domain_scores_gemma":[0.9740645,0.0138492,0.00321515,0.002606717,0.005205344,0.001059153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001859325,0.001390862,0.05174527,0.0007347256,0.0002526575,0.001002585,0.002020312,0.1375442,0.02373523,0.002835944,0.02629254,0.7505865],"study_design_scores_gemma":[0.00005759195,0.0002113573,0.005043348,0.00005942868,0.00006294069,0.0001776991,0.0004815486,0.9713905,0.01256969,0.00523259,0.004667853,0.00004537929],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1888351,0.001675318,0.7851619,0.001607483,0.0004562212,0.0005824495,0.001778338,0.01305559,0.006847523],"genre_scores_gemma":[0.8835,0.0002046034,0.1095257,0.0005146901,0.0001942585,0.0004118359,0.001953852,0.0003250719,0.003370033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005447642,"threshold_uncertainty_score":0.0288102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146250995","doi":"10.5555/2627435.2697064","title":"Recursive teaching dimension, VC-dimension and sample compression","year":2014,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Dimension (graph theory); VC dimension; Intersection (aeronautics); Mathematics; Matching (statistics); Concept class; Class (philosophy); Bounded function; Sample (material); Theoretical computer science; Discrete mathematics; Computer science; Algorithm; Combinatorics; Artificial intelligence","authors":[{"name":"Thorsten Doliwa","is_ca":false},{"name":"Gaojian Fan","is_ca":true},{"name":"Hans Ulrich Simon","is_ca":false},{"name":"Sandra Zilles","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02693260769113972,"gpt":0.345164434175636,"spread":0.3182318264844963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002490527,0.0007672342,0.001212714,0.002169978,0.00133725,0.004016347,0.001940919,0.001469132,0.005919273],"category_scores_gemma":[0.02405785,0.0004869319,0.001005515,0.002055084,0.004658222,0.007648393,0.002881134,0.003591542,0.0005285849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003215333,"about_ca_system_score_gemma":0.001245235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009872763,"about_ca_topic_score_gemma":0.0009988087,"domain_scores_codex":[0.9971269,0.0007582843,0.0001388538,0.000690925,0.000874312,0.0004108532],"domain_scores_gemma":[0.9694579,0.02273442,0.001582879,0.004043048,0.00103116,0.001150555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001404542,0.0000676516,0.002921507,0.0001802225,0.00003371622,0.00008475358,0.0002631845,0.03537169,0.00151653,0.9139168,0.002597356,0.04290624],"study_design_scores_gemma":[0.00003549369,0.00007136706,0.001074096,0.00006113455,0.00002521206,0.0002343848,0.000071709,0.135062,0.002217383,0.8558816,0.005220465,0.00004528344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2631215,0.003619595,0.6933656,0.003005448,0.0001071086,0.0002132439,0.00164657,0.001184783,0.03373607],"genre_scores_gemma":[0.9083623,0.001201456,0.08318546,0.0004219378,0.0002464681,0.0003888314,0.001125076,0.0002335651,0.004834779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005919273,"threshold_uncertainty_score":0.02332896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911248322","doi":"","title":"Learning to Learn with Conditional Class Dependencies","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université de Sherbrooke; Dalhousie University","funders":"","keywords":"Computer science; Class (philosophy); Artificial intelligence; Machine learning; Theoretical computer science","authors":[{"name":"Xiang Jiang","is_ca":true},{"name":"Mohammad Havaei","is_ca":true},{"name":"Farshid Varno","is_ca":true},{"name":"Gabriel Chartrand","is_ca":true},{"name":"Nicolas Chapados","is_ca":true},{"name":"Stan Matwin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03035484499736908,"gpt":0.3326982328008643,"spread":0.3023433878034952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002131495,0.001127693,0.001360114,0.001126715,0.0006107151,0.001425078,0.002212648,0.002378585,0.004691888],"category_scores_gemma":[0.0122385,0.0008557086,0.00137995,0.001652828,0.001298311,0.00621838,0.002921241,0.00501928,0.001219246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001080342,"about_ca_system_score_gemma":0.001847632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00332077,"about_ca_topic_score_gemma":0.004520895,"domain_scores_codex":[0.9987283,0.0003883714,0.00007931783,0.0004406915,0.0002271072,0.0001361782],"domain_scores_gemma":[0.9938582,0.004026298,0.0002873745,0.00120998,0.000456203,0.0001618769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006252598,0.0005433543,0.005990464,0.0003388124,0.0003574176,0.0002262721,0.0002305695,0.2481797,0.003812747,0.09968732,0.02940452,0.6106036],"study_design_scores_gemma":[0.00004450895,0.00005962634,0.0003152109,0.00002451657,0.00003817727,0.00005558496,0.00002203313,0.9125011,0.0009964675,0.084748,0.00118365,0.00001113698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04842542,0.0006465808,0.9442568,0.001760358,0.0001868108,0.00008439645,0.0006620078,0.001658129,0.002319618],"genre_scores_gemma":[0.7622771,0.0009484813,0.2203787,0.001380819,0.0004735006,0.0004297335,0.004233546,0.0003191879,0.009558821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004691888,"threshold_uncertainty_score":0.01569599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2740275380","doi":"10.48550/arxiv.1708.00088","title":"Learning Algorithms for Active Learning","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Microsoft (Canada)","funders":"","keywords":"Active learning (machine learning); Computer science; Algorithm; Artificial intelligence; Machine learning","authors":[{"name":"Philip Bachman","is_ca":true},{"name":"Alessandro Sordoni","is_ca":true},{"name":"Adam Trischler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07412385670808344,"gpt":0.2285695936773584,"spread":0.1544457369692749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00675932,0.002511309,0.002642573,0.002619644,0.00110072,0.004721615,0.005889712,0.003792472,0.01150707],"category_scores_gemma":[0.02813838,0.001338094,0.002226555,0.003664591,0.002501585,0.006367368,0.004819088,0.007016813,0.006022591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001817984,"about_ca_system_score_gemma":0.001964147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001940331,"about_ca_topic_score_gemma":0.001866973,"domain_scores_codex":[0.9942287,0.002768627,0.0003916882,0.001097827,0.001250243,0.0002628209],"domain_scores_gemma":[0.9867778,0.0095128,0.0005320979,0.001727274,0.001175007,0.0002749789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007638871,0.0001736308,0.000927404,0.0005196666,0.0002261157,0.00009123718,0.0001684815,0.1606322,0.0005509347,0.5856603,0.02052595,0.2304478],"study_design_scores_gemma":[0.00004048906,0.00002965369,0.00006660751,0.00006972782,0.00002326987,0.00005911727,0.00001893313,0.470939,0.0003081845,0.5157132,0.01271488,0.00001688369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003183744,0.000825163,0.9956188,0.0004305408,0.0001134917,0.00005646303,0.0001220521,0.000360123,0.002155033],"genre_scores_gemma":[0.08177865,0.003925791,0.8972024,0.001281633,0.00130554,0.001822301,0.00156713,0.00059794,0.01051859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01150707,"threshold_uncertainty_score":0.03849494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140407154","doi":"10.5555/1036843.1036887","title":"Active model selection","year":2004,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Task (project management); Simple (philosophy); Set (abstract data type); Selection (genetic algorithm); Artificial intelligence; Model selection; Sample (material); Machine learning; Active learning (machine learning); Field (mathematics); Sample complexity; Mathematics","authors":[{"name":"Omid Madani","is_ca":false},{"name":"Daniel J. Lizotte","is_ca":true},{"name":"Russell Greiner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008331924834581646,"gpt":0.2432273949317493,"spread":0.2348954700971677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004896578,0.002069718,0.002957352,0.001681949,0.0009777909,0.002498801,0.00633349,0.003858225,0.008641331],"category_scores_gemma":[0.01565553,0.001245449,0.002161889,0.001611858,0.001731333,0.004515958,0.003859431,0.003038747,0.002703748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009687057,"about_ca_system_score_gemma":0.001507939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001582435,"about_ca_topic_score_gemma":0.002211695,"domain_scores_codex":[0.9958204,0.002294337,0.0001573116,0.000714138,0.0007327709,0.000281058],"domain_scores_gemma":[0.9901349,0.006801862,0.0004381735,0.001650985,0.0006891291,0.0002850083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006995367,0.0004979633,0.002091739,0.0003642599,0.0004220563,0.000305255,0.0002462712,0.4401829,0.003502954,0.1022155,0.02305373,0.4264178],"study_design_scores_gemma":[0.0000590486,0.00004941097,0.00007691935,0.00001991645,0.000030946,0.00007019521,0.00001952214,0.9556789,0.001335719,0.03994855,0.002697358,0.00001352833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003971827,0.0003636452,0.9924306,0.0003127537,0.00007623719,0.0001155214,0.0001028167,0.0007155807,0.001911035],"genre_scores_gemma":[0.3704377,0.0007849774,0.6136156,0.00135534,0.0005549926,0.0011043,0.001485692,0.0004821891,0.0101791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008641331,"threshold_uncertainty_score":0.02890813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2180483632","doi":"10.1016/j.tcs.2015.02.006","title":"Complexity of barrier coverage with relocatable sensors in the plane","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Waterloo; Concordia University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Minimax; Plane (geometry); Set (abstract data type); Perpendicular; Range (aeronautics); Time complexity; Computer science; Line (geometry); Mathematical optimization; Algorithm; Mathematics; Topology (electrical circuits); Combinatorics; Geometry; Engineering","authors":[{"name":"Stefan Dobrev","is_ca":false},{"name":"Stéphane Durocher","is_ca":true},{"name":"Mohsen Eftekhari","is_ca":true},{"name":"Konstantinos Georgiou","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Lata Narayanan","is_ca":true},{"name":"Jaroslav Opatrny","is_ca":true},{"name":"Sunil Shende","is_ca":false},{"name":"Jorge Urrutia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02026860201361268,"gpt":0.2532846675983693,"spread":0.2330160655847566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00150985,0.001236936,0.00244944,0.001167154,0.001307123,0.004232689,0.003228518,0.003149534,0.01553787],"category_scores_gemma":[0.02114505,0.001172136,0.001344498,0.001921628,0.001791621,0.005840382,0.00382369,0.00256687,0.0008914057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002286521,"about_ca_system_score_gemma":0.001891216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00726393,"about_ca_topic_score_gemma":0.003599063,"domain_scores_codex":[0.9979814,0.0005815333,0.00009490707,0.0003385272,0.0004967137,0.0005069244],"domain_scores_gemma":[0.9762369,0.01983281,0.001359526,0.0008678288,0.0006290702,0.001073871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001046693,0.000135542,0.003101606,0.0004480582,0.0001212335,0.0004218601,0.0003597058,0.8689179,0.002227938,0.1003186,0.00887815,0.01402268],"study_design_scores_gemma":[0.0001533448,0.00007924301,0.0007123399,0.00003138197,0.00004814007,0.0001826274,0.0002169167,0.8848271,0.0006848444,0.1118936,0.001147985,0.00002247704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6279784,0.001428764,0.3169191,0.006701109,0.0001883355,0.0003498933,0.00422217,0.0009407811,0.04127143],"genre_scores_gemma":[0.9437791,0.0009574011,0.04319604,0.0003533792,0.000176554,0.0002781945,0.001999975,0.000349078,0.008910182],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01553787,"threshold_uncertainty_score":0.0519793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}