{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001183026,0.0005553043,0.0006031555,0.000368702,0.0002430365,0.0004599111,0.001910192,0.0003485878,0.0005783612],"category_scores_gemma":[0.0001985207,0.0004761644,0.0001814652,0.0002457589,0.00005332942,0.0002072788,0.001070353,0.00145295,0.001675028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006739604,"about_ca_system_score_gemma":0.0005034031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000182611,"about_ca_topic_score_gemma":0.00002525966,"domain_scores_codex":[0.9967953,0.0003023896,0.0003890543,0.001092887,0.0008936136,0.0005267675],"domain_scores_gemma":[0.9976831,0.0004977973,0.0002105393,0.0009733983,0.0001108055,0.0005243596],"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.00002053187,0.0000487174,0.00003512403,0.00002393851,0.0002292887,0.0001817531,0.002027724,0.002377881,0.000005279608,0.5754282,0.3067943,0.1128273],"study_design_scores_gemma":[0.0002678128,0.0001725467,0.000003072083,0.00008159287,0.00002142496,0.00001064561,0.00003180444,0.1177141,0.000004525726,0.2826201,0.5984801,0.0005922787],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[2.56972e-7,0.0003444442,0.5819515,0.0005759883,0.000714417,0.0001331092,0.00001175025,0.0006268252,0.4156417],"genre_scores_gemma":[0.00008448556,0.00002156742,0.1013009,0.0008005219,0.0008354648,0.000008855139,0.0001619736,0.00007715447,0.8967091],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.4810674,"threshold_uncertainty_score":0.999769,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095427,0.0001172643,0.000111171,0.00008305055,0.0005629025,0.0004508882,0.001175757,0.00003689817,0.000007240767],"category_scores_gemma":[0.0005617841,0.00009909357,0.00002744946,0.001326147,0.0005772489,0.00123429,0.0003408834,0.0003396233,0.00008207423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008917859,"about_ca_system_score_gemma":0.0003166442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001062274,"about_ca_topic_score_gemma":0.000002696591,"domain_scores_codex":[0.9980693,0.00008618199,0.0001637027,0.0005633221,0.0007030825,0.000414452],"domain_scores_gemma":[0.9990672,0.00002042016,0.0001014085,0.0003883528,0.0002519213,0.0001706346],"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.000002506183,0.0003274163,0.00182072,0.0000200242,0.000006856016,0.00002325794,0.01905541,0.02409254,0.003248185,0.1553042,0.001035667,0.7950633],"study_design_scores_gemma":[0.001698648,0.003006411,0.02534586,0.0001285672,0.00001467757,0.0002568079,0.001772718,0.7801841,0.004857319,0.08727501,0.09397063,0.00148922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2822622,0.0002862889,0.6636225,0.002854461,0.003837114,0.001044325,0.00000137863,0.003066015,0.04302575],"genre_scores_gemma":[0.8876891,4.705834e-7,0.1100329,0.00008540254,0.0001578677,0.00002549708,0.000001173805,0.000005990415,0.002001619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.793574,"threshold_uncertainty_score":0.4347925,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001091528,0.000268665,0.0004068238,0.0007135202,0.004608584,0.0003033702,0.01011201,0.0001061375,0.0001285667],"category_scores_gemma":[0.000269325,0.0003062625,0.0001276212,0.000581176,0.001604864,0.003616564,0.008292281,0.001558236,0.00002299595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001404444,"about_ca_system_score_gemma":0.0004342257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002344463,"about_ca_topic_score_gemma":0.001939824,"domain_scores_codex":[0.9961493,0.0006870968,0.0001152276,0.001112097,0.001022332,0.0009139333],"domain_scores_gemma":[0.9954668,0.000410533,0.0003460235,0.002868492,0.0004356788,0.0004724502],"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.003719481,0.001156765,0.07445087,0.0004320735,0.00129987,0.00762985,0.02240635,0.002024879,0.001806185,0.07805416,0.006798428,0.8002211],"study_design_scores_gemma":[0.003593843,0.001342493,0.06292744,0.0001894238,0.00006410134,0.00005380858,0.0128875,0.6092649,0.00007817204,0.002341635,0.3064787,0.0007779024],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0215874,0.00001350232,0.866635,0.00289184,0.0000657415,0.0003453198,0.00009031235,0.0001758837,0.108195],"genre_scores_gemma":[0.6893667,0.0006388703,0.297684,0.00001995225,0.00009712405,1.838592e-7,0.0001965234,0.00003924254,0.01195735],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7994432,"threshold_uncertainty_score":0.999939,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005991665,0.00007211404,0.0001636633,0.00007419771,0.0001006047,0.000142088,0.0001582609,0.00004130724,0.000003398053],"category_scores_gemma":[0.0001253672,0.00006492138,0.00002676885,0.0002758492,0.00003075425,0.001070598,0.0001320175,0.0001134388,0.00004922884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001013606,"about_ca_system_score_gemma":0.00005646752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006306011,"about_ca_topic_score_gemma":0.00001521194,"domain_scores_codex":[0.9991813,0.0001823727,0.0003109242,0.00009015535,0.0001292952,0.0001060054],"domain_scores_gemma":[0.9991612,0.00006477844,0.0001422934,0.0001814776,0.0003945134,0.00005568634],"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.00001365936,0.0001501156,0.02834709,0.001179396,0.00008054642,0.000002432376,0.03528959,0.05226162,0.0001498796,0.6317839,0.002073729,0.2486681],"study_design_scores_gemma":[0.0001868465,0.00002085397,0.008182041,0.00002110583,0.000001361786,0.00001474394,0.0001117068,0.9789101,0.00005589762,0.00009591159,0.01232306,0.0000763204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01263126,0.0009045778,0.9428683,0.00004752743,0.0002997088,0.00007268301,0.00000530989,0.00008948745,0.04308116],"genre_scores_gemma":[0.99685,0.00003055525,0.002403842,0.00002074509,0.00002209132,0.00000392475,0.00003615395,0.000002155658,0.0006305463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9842187,"threshold_uncertainty_score":0.2647417,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000159874,0.00006069377,0.00009854441,0.0000428799,0.00008242013,0.00001856946,0.001084857,0.00002348475,0.00007485273],"category_scores_gemma":[0.00008425421,0.00004978096,0.00002274375,0.0001963346,0.00002139255,0.0002343117,0.0004919551,0.0001592966,0.00008892106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003519089,"about_ca_system_score_gemma":0.00006842459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004812711,"about_ca_topic_score_gemma":0.000001641387,"domain_scores_codex":[0.9993047,0.00003580925,0.0001212697,0.0002325708,0.0001742257,0.0001314977],"domain_scores_gemma":[0.9991822,0.00004503943,0.00005327794,0.0006298606,0.00002101077,0.00006856318],"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.000004354968,0.00009521363,0.02963994,0.00001810318,0.00003648422,0.00006354901,0.002730187,0.005216585,0.0007269965,0.0365022,0.1129017,0.8120646],"study_design_scores_gemma":[0.0003575496,0.0001187918,0.008881893,0.00001204555,0.000002813453,0.00009090437,0.0000150073,0.8573156,0.0008833537,0.0008508827,0.131288,0.0001832224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007570282,0.00008209014,0.976363,0.0006387034,0.000112345,0.00002288034,3.151847e-7,0.000178155,0.01503223],"genre_scores_gemma":[0.6927438,0.00002582101,0.2682598,0.0001504828,0.00009552092,3.091531e-7,0.000006344809,0.00000606174,0.0387118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.852099,"threshold_uncertainty_score":0.2030009,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003368336,0.00009883271,0.00009454341,0.00008102328,0.0001638109,0.00007058459,0.0003942896,0.00003421881,0.00004949548],"category_scores_gemma":[0.00008026758,0.00007854146,0.00004262099,0.000248557,0.00002484093,0.0003154708,0.0001715109,0.0003229897,0.0001020478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002984159,"about_ca_system_score_gemma":0.00001866624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002171525,"about_ca_topic_score_gemma":0.00002148534,"domain_scores_codex":[0.999074,0.00005398362,0.000110654,0.000273114,0.0002054446,0.0002827851],"domain_scores_gemma":[0.9994594,0.0001662694,0.000048318,0.0001865784,0.00005162707,0.00008782247],"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.00000691301,0.00004983668,0.0008386519,0.000003926789,0.00001462022,0.00002807614,0.006187047,0.001296883,0.0004552338,0.1068882,0.0002590453,0.8839716],"study_design_scores_gemma":[0.0005191315,0.0002548235,0.02308307,0.00001889588,0.000006284038,0.00002791256,0.001625237,0.9332914,0.01740524,0.008199351,0.01508728,0.0004813228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01573581,0.000007892023,0.8634403,0.0006259863,0.0001480887,0.00003988174,1.70171e-7,0.0002800716,0.1197218],"genre_scores_gemma":[0.916531,0.000001850529,0.07235211,0.0001595013,0.00008306801,0.000001818411,0.000001480302,0.000006453759,0.01086267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9319946,"threshold_uncertainty_score":0.3202828,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002647943,0.0002612958,0.0002496045,0.0002141953,0.0003445056,0.0003199905,0.0005324401,0.00008230124,0.0001285725],"category_scores_gemma":[0.00005195591,0.0002002869,0.00007577141,0.0009013821,0.00009938961,0.0004929939,0.0000773053,0.0004125935,0.00009199435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004901581,"about_ca_system_score_gemma":0.0001747229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001274272,"about_ca_topic_score_gemma":0.0000135155,"domain_scores_codex":[0.9981521,0.000107686,0.0002675858,0.000602909,0.0003685832,0.0005011574],"domain_scores_gemma":[0.9988247,0.0001074574,0.0001120559,0.0005927125,0.0001717818,0.0001912739],"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.00001039979,0.0003065427,0.00008350235,0.000005701094,0.00003737693,0.00006989203,0.000711828,0.001628554,0.0001950757,0.002893948,0.003751786,0.9903054],"study_design_scores_gemma":[0.001413362,0.00165509,0.001263956,0.00005064957,0.00002336504,0.0003353651,0.0005062131,0.9841338,0.0004504256,0.0003774456,0.00919426,0.0005960356],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001683348,0.00004668288,0.9740625,0.002816768,0.0001556856,0.0002914229,0.000005598838,0.001212025,0.01972595],"genre_scores_gemma":[0.1608377,0.000008938398,0.8298716,0.002356046,0.0002501695,0.00002898721,0.00004367917,0.00002592982,0.006576906],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9897094,"threshold_uncertainty_score":0.8167462,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001524755,0.00009424842,0.0001007527,0.00004037277,0.00009885225,0.00009605048,0.001149316,0.00004127081,0.001044988],"category_scores_gemma":[0.00006729605,0.00008052059,0.00005641572,0.0002057928,0.00001443976,0.0002345867,0.0001086314,0.000190283,0.001220989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001009078,"about_ca_system_score_gemma":0.0000205704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001240357,"about_ca_topic_score_gemma":0.00000453637,"domain_scores_codex":[0.999175,0.0000498735,0.0001214791,0.0002833513,0.0001452545,0.0002250562],"domain_scores_gemma":[0.9989718,0.0001027935,0.00002926505,0.0008043212,0.00001513503,0.00007670466],"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.000001830345,0.00002219204,0.0008164868,0.000001631322,0.000004208011,0.00001372079,0.00009363781,0.00005610891,0.00004851586,0.0005378108,0.0031812,0.9952226],"study_design_scores_gemma":[0.0004037672,0.0002190958,0.01126388,0.00002030612,0.000004797553,0.00006100355,0.000005217439,0.1182701,0.000361894,0.01502964,0.8539644,0.0003958909],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5872807,0.0003648837,0.2258428,0.01416038,0.002206501,0.0002631627,0.000002473473,0.001847912,0.1680312],"genre_scores_gemma":[0.726635,0.00008602018,0.2317421,0.001261142,0.0005659762,0.00001270197,0.000003198482,0.00002059106,0.03967332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9948268,"threshold_uncertainty_score":0.9998682,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002003967,0.00007491621,0.0001132778,0.0000701076,0.00008152224,0.00003047992,0.0003640652,0.00003691103,0.00004162009],"category_scores_gemma":[0.00005392655,0.00006096771,0.00005313992,0.000248945,0.00001736459,0.0001263858,0.00004010972,0.0002081548,0.00002815239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006657675,"about_ca_system_score_gemma":0.00002368375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002416235,"about_ca_topic_score_gemma":4.72384e-7,"domain_scores_codex":[0.9992852,0.00005522539,0.0001407064,0.0001840762,0.0001662496,0.0001685826],"domain_scores_gemma":[0.9995735,0.00003657468,0.00006237601,0.0002287503,0.00003256287,0.00006626197],"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.000003991537,0.00007834155,0.002794993,0.000008634851,0.00001151443,0.00001485522,0.001148052,0.005304967,0.001697838,0.1730581,0.0009379645,0.8149408],"study_design_scores_gemma":[0.0001918067,0.0002886834,0.00433504,0.00001188845,0.0000020254,0.000007655192,0.0000518788,0.9826974,0.001756877,0.001985361,0.008541153,0.0001302817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004672671,0.00002472105,0.9493256,0.002356316,0.00009057925,0.00002887261,7.409043e-8,0.0002219328,0.04327927],"genre_scores_gemma":[0.8736135,0.000004198271,0.1222161,0.0002727851,0.00005657351,2.184464e-7,6.564122e-7,0.000002903519,0.003833107],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9773924,"threshold_uncertainty_score":0.2486191,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004152209,0.00005139152,0.00006455649,0.00002192488,0.0004430758,0.0003464298,0.0003419796,0.00001873197,0.00001069161],"category_scores_gemma":[0.0004215202,0.00004335913,0.00001205991,0.00002067799,0.00002061632,0.000119895,0.0001558818,0.000177453,0.00004793387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002965611,"about_ca_system_score_gemma":0.000007670036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002931945,"about_ca_topic_score_gemma":0.00001163378,"domain_scores_codex":[0.9995207,0.00007503651,0.00004403861,0.0001699149,0.00008307377,0.0001072817],"domain_scores_gemma":[0.9995033,0.0001059416,0.00004870357,0.0002879138,0.0000115405,0.00004265852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000006453409,0.00002347402,0.1878214,0.000007773461,0.000008176416,0.0000204575,0.0007220657,0.0001562122,0.000065472,0.02946911,0.0005178137,0.7811816],"study_design_scores_gemma":[0.0003403855,0.0001373754,0.852801,0.00002254984,0.000001043069,0.000009612394,0.000003063278,0.1312699,0.00009889476,0.00274663,0.01240902,0.0001605911],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8591509,0.00007560853,0.1054705,0.001725085,0.0004529786,0.00005101064,5.95251e-7,0.0002036184,0.03286968],"genre_scores_gemma":[0.9940625,0.000004431728,0.002138198,0.00008508097,0.00004644271,7.296581e-7,4.93617e-7,0.000003323399,0.003658749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.781021,"threshold_uncertainty_score":0.3407826,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000567401,0.0002726226,0.0002363999,0.00009913158,0.0008106562,0.0004300268,0.001088717,0.0001126614,0.0009394268],"category_scores_gemma":[0.0005289872,0.0002050944,0.0001293666,0.0006568098,0.0003432813,0.0005659686,0.0003044081,0.001012352,0.001338886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006664373,"about_ca_system_score_gemma":0.00004871639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002439927,"about_ca_topic_score_gemma":0.00006124699,"domain_scores_codex":[0.9974682,0.0003959344,0.0003879243,0.0006903132,0.0004829713,0.00057468],"domain_scores_gemma":[0.9982096,0.0006073795,0.0001206509,0.0006257695,0.0002437025,0.0001929279],"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.000009237981,0.00006067799,0.0000711493,0.00000260585,0.00002210851,0.00004333413,0.006772919,0.001478774,0.0008297494,0.07999275,0.0006167981,0.9100999],"study_design_scores_gemma":[0.00002450529,0.0002144511,0.0003626425,0.00002945295,0.00001489091,0.00005551875,0.00204995,0.9418425,0.01747693,0.007669316,0.02982787,0.0004319684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005762571,0.0001306219,0.9348206,0.009754586,0.0009635849,0.0003894438,0.00000398019,0.0004653013,0.04770934],"genre_scores_gemma":[0.9926005,0.0001153051,0.002716369,0.00103137,0.0002526861,0.00003818273,0.000002847406,0.00001762943,0.003225112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9868379,"threshold_uncertainty_score":0.9999738,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001068547,0.0006947024,0.0007133132,0.0009418793,0.0003637475,0.0008988165,0.005318376,0.0004880122,0.0000115893],"category_scores_gemma":[0.0001323132,0.0006165269,0.0001773917,0.0006663598,0.0004312828,0.0003948074,0.002106877,0.002150371,0.0001142007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001390138,"about_ca_system_score_gemma":0.0005342826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003123652,"about_ca_topic_score_gemma":0.00001990105,"domain_scores_codex":[0.9950219,0.00003525862,0.0005067883,0.002240356,0.001237318,0.0009583849],"domain_scores_gemma":[0.9968556,0.0002020174,0.00023103,0.002032118,0.0002564093,0.0004228165],"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.000003154321,0.00004174446,0.000009487925,0.00002085955,0.000006288636,0.00003513563,0.001010294,0.3724018,0.0001441763,0.01138799,0.0000395003,0.6148996],"study_design_scores_gemma":[0.0001900328,0.0001100514,0.00001819946,0.0001101483,0.000004977923,0.0001061912,7.025015e-8,0.9310489,0.0002289185,0.06511028,0.00235405,0.0007182377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000420647,0.0001079666,0.9767497,0.001052859,0.001667946,0.0004625482,0.000007154815,0.000344455,0.01956537],"genre_scores_gemma":[0.02012119,0.000005674197,0.9736573,0.002928232,0.0006353715,0.00001721193,0.000005924725,0.00005099556,0.002578165],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6141813,"threshold_uncertainty_score":0.9996286,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003777781,0.00006514929,0.00005892947,0.000100638,0.0001537958,0.0001171225,0.000205773,0.0000350987,0.0000346327],"category_scores_gemma":[0.0001160865,0.00005742385,0.0000233134,0.0002169256,0.00001236765,0.0008581241,0.00009254906,0.0002205474,0.0001136421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003321525,"about_ca_system_score_gemma":0.00002498388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006901158,"about_ca_topic_score_gemma":0.000001186891,"domain_scores_codex":[0.9993979,0.00002568911,0.0001298154,0.00009491819,0.0001617065,0.0001899561],"domain_scores_gemma":[0.9996314,0.00008434662,0.00006353892,0.0001123392,0.00005011517,0.00005823173],"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.000007867299,0.00001521081,0.0006069482,0.000007279964,0.000009877524,0.000008380994,0.002791783,0.05483922,0.0002259586,0.02109566,0.00005916021,0.9203327],"study_design_scores_gemma":[0.0001405376,0.00005155876,0.001496062,0.00000518515,0.000001651345,0.00002214695,0.0001839763,0.993033,0.0006568345,0.0001160572,0.004193332,0.00009968848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.032492,0.000002991873,0.9393884,0.00004756896,0.0001576678,0.00003171943,9.104698e-8,0.0002105761,0.02766901],"genre_scores_gemma":[0.7713863,4.903997e-7,0.2279175,0.0001310872,0.00006136985,3.425711e-7,0.000002118623,0.000002465921,0.000498319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9381937,"threshold_uncertainty_score":0.2341677,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002128,0.000101172,0.0001054149,0.00006708462,0.0002078339,0.00009485043,0.0002877557,0.00004785378,0.000006187975],"category_scores_gemma":[0.0001759507,0.00008438536,0.00004443112,0.0001906497,0.00001229525,0.0002666574,0.0000303956,0.0001964952,0.00005785715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003479723,"about_ca_system_score_gemma":0.00001748809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001176584,"about_ca_topic_score_gemma":0.000001275171,"domain_scores_codex":[0.9991907,0.00008108048,0.00009984386,0.0003240888,0.0001068207,0.0001974285],"domain_scores_gemma":[0.9994053,0.0002039857,0.00007048712,0.0001818509,0.00008362214,0.00005475363],"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.000006813072,0.00007827853,0.00009260883,0.000002435976,0.000006126634,4.469678e-7,0.0004249945,0.000188748,0.002544017,0.01739398,0.000133572,0.979128],"study_design_scores_gemma":[0.0007163394,0.0003429208,0.03296718,0.000006736319,0.000003088187,0.000002371808,0.00004402555,0.9607892,0.001831934,0.0008161592,0.002355283,0.0001247467],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004584838,0.00001694047,0.988623,0.001595372,0.0001153056,0.0003155497,3.05443e-7,0.0003384183,0.004410244],"genre_scores_gemma":[0.7222141,0.000002105412,0.2735554,0.0002920317,0.00008086905,0.00003932298,0.000004179757,0.000005441153,0.003806594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9790033,"threshold_uncertainty_score":0.3441135,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004522724,0.0004656551,0.0007229263,0.0002836389,0.0003860286,0.0004884303,0.0005274648,0.000213215,0.00007368338],"category_scores_gemma":[0.00003380921,0.0004450493,0.0001431374,0.0003785773,0.0002256377,0.000199657,0.00002997625,0.000767273,0.00005297199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002985034,"about_ca_system_score_gemma":0.0000311005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000600879,"about_ca_topic_score_gemma":0.00002326478,"domain_scores_codex":[0.9968707,0.0004225138,0.0007406412,0.0007808884,0.0006352651,0.0005499944],"domain_scores_gemma":[0.9983394,0.0002613612,0.0003546793,0.0005694779,0.0001082005,0.0003668958],"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.0002036278,0.001313779,0.004604693,0.00121759,0.001262191,0.0001490651,0.02746672,0.1421283,0.008868898,0.0319346,0.005465541,0.775385],"study_design_scores_gemma":[0.003702391,0.001113475,0.0005603384,0.0004984172,0.0001501963,0.000179685,0.0007275753,0.8848,0.00185115,0.0001369797,0.1053266,0.0009532051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2937404,0.004363579,0.691874,0.0007612052,0.001557406,0.0008275563,0.00001691572,0.0009248275,0.005934108],"genre_scores_gemma":[0.9540469,0.002570115,0.005138693,0.00005344396,0.00014563,0.00003147321,0.000004151961,0.00005674278,0.03795286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7744318,"threshold_uncertainty_score":0.9998001,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001865551,0.0003214428,0.0003443994,0.0001693095,0.0005414392,0.0003485593,0.003385455,0.0002911416,0.000001694184],"category_scores_gemma":[0.00003236037,0.0003713817,0.000204468,0.00001119993,0.0002180235,0.0001997548,0.001316597,0.000787331,0.0000844039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001584031,"about_ca_system_score_gemma":0.0003914827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001283264,"about_ca_topic_score_gemma":0.000001179658,"domain_scores_codex":[0.9983683,0.0000819425,0.0001722923,0.0007040038,0.0003281269,0.0003453498],"domain_scores_gemma":[0.9977723,0.00007942491,0.0003249625,0.00152015,0.0001202691,0.0001829085],"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.000006315823,0.000008298506,2.861264e-7,0.00003077957,0.00003390071,0.000374043,0.00004491827,0.00001157202,0.000002846196,0.8487894,0.05907075,0.0916269],"study_design_scores_gemma":[0.00004040006,0.00004561006,0.000004085525,0.000105284,0.00003477831,0.00002000405,0.000004128593,0.0117877,0.0002111703,0.0002141251,0.9870959,0.000436819],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00000242035,0.00004865878,0.2278405,0.00004903766,0.0006460005,0.0001357461,0.0000261352,0.0002635925,0.7709879],"genre_scores_gemma":[0.000142505,0.00002202568,0.00287935,0.00004418346,0.0003911071,4.390733e-7,0.00001779687,0.00002101697,0.9964816],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9280251,"threshold_uncertainty_score":0.9998738,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002487365,0.000205248,0.0002003396,0.00009604063,0.0001586522,0.000207636,0.0005644874,0.00006741639,0.0003711784],"category_scores_gemma":[0.0000388821,0.0001621973,0.00006086172,0.0002222795,0.00003989677,0.0004256033,0.0002618274,0.000208011,0.0002310292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001767178,"about_ca_system_score_gemma":0.0000404581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001117204,"about_ca_topic_score_gemma":0.00004261576,"domain_scores_codex":[0.9986612,0.00007227415,0.0002207611,0.0004770579,0.0002266317,0.0003420685],"domain_scores_gemma":[0.9991904,0.00007366582,0.00003765595,0.0004521555,0.00004769173,0.0001983691],"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.00001079178,0.0003479291,0.01642119,0.00005421973,0.00005429153,0.00004559185,0.00256938,0.0007540329,0.004699246,0.01193508,0.006201328,0.9569069],"study_design_scores_gemma":[0.000926499,0.00007124999,0.008474882,0.000006480078,0.000004662936,0.00004211555,0.00001443765,0.953925,0.00061341,0.00004881153,0.03561622,0.0002562389],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2660221,0.0005641021,0.6767638,0.02939032,0.0008561829,0.0005074887,0.00001183529,0.002324372,0.02355985],"genre_scores_gemma":[0.7578004,0.00003084594,0.2252464,0.002486012,0.0003025835,0.00001308023,0.000008440843,0.00002284494,0.01408939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9566507,"threshold_uncertainty_score":0.6614216,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002990904,0.0001278287,0.0001432245,0.00008037543,0.0001255668,0.0001330007,0.0003336525,0.00004845013,0.0005335723],"category_scores_gemma":[0.00001802134,0.0001080576,0.00005433102,0.0002168848,0.00002082135,0.0002652172,0.00007024902,0.0001655181,0.0002188375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001934624,"about_ca_system_score_gemma":0.00003452211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004589467,"about_ca_topic_score_gemma":0.000039373,"domain_scores_codex":[0.9989322,0.00004608594,0.0002101958,0.0003120736,0.0002326713,0.0002667158],"domain_scores_gemma":[0.9994895,0.00005937517,0.00006893845,0.0002794995,0.00003841753,0.00006420934],"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.00001485362,0.0003593774,0.0319304,0.00004516133,0.00006441153,0.0001517627,0.003459627,0.05766181,0.0029191,0.1498537,0.02203875,0.731501],"study_design_scores_gemma":[0.0003211614,0.00006628378,0.02008806,0.000003549278,0.000003706734,0.00003278485,0.00001024142,0.9658875,0.0002595996,0.001427993,0.0116989,0.0002002604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003152783,0.00001749432,0.9502654,0.00139125,0.0003753803,0.00007037314,0.000001257254,0.000435673,0.04429037],"genre_scores_gemma":[0.8766412,5.256658e-7,0.1100839,0.0003620883,0.0002534662,0.000004411163,0.00001781873,0.00001129717,0.0126253],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9082257,"threshold_uncertainty_score":0.5842243,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00171185,0.0002685472,0.0003701047,0.0009449869,0.001570848,0.00008957129,0.005939564,0.0001122113,0.00008412717],"category_scores_gemma":[0.0002171676,0.0002966062,0.0001029697,0.001799877,0.0009180159,0.002145641,0.005115379,0.001729702,0.00001594133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001734041,"about_ca_system_score_gemma":0.0004225116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00236945,"about_ca_topic_score_gemma":0.002883895,"domain_scores_codex":[0.9958591,0.0006328844,0.0001436161,0.001111949,0.001189331,0.001063075],"domain_scores_gemma":[0.9961798,0.001133243,0.0002307663,0.001517737,0.0004259267,0.0005124791],"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.005419394,0.001097434,0.1621698,0.0004556313,0.001145364,0.003398527,0.02375564,0.003108786,0.002031711,0.1115736,0.00501564,0.6808285],"study_design_scores_gemma":[0.003202833,0.001917728,0.1391904,0.0002437698,0.00006063485,0.00003981545,0.01476553,0.1050443,0.0001482089,0.001209841,0.7333384,0.0008386425],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09742968,0.00002066109,0.8237294,0.001001885,0.00005742731,0.000390651,0.0001145092,0.0002286061,0.07702719],"genre_scores_gemma":[0.8584803,0.0004171077,0.1293827,0.00002186303,0.00008280851,1.088627e-7,0.0002418018,0.00002877769,0.01134449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7610506,"threshold_uncertainty_score":0.9999486,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654249,0.00006569723,0.0001065669,0.00004867202,0.0002383133,0.00007788704,0.002446723,0.00002784036,0.0001909408],"category_scores_gemma":[0.001256596,0.00004001059,0.0001401174,0.0002656621,0.00002189161,0.0002365719,0.0004523717,0.0005487103,0.0001136924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001951309,"about_ca_system_score_gemma":0.00004153665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007064925,"about_ca_topic_score_gemma":9.83056e-7,"domain_scores_codex":[0.9990674,0.0001822338,0.0002166753,0.0001047562,0.0003005928,0.0001282889],"domain_scores_gemma":[0.998597,0.0001061797,0.0002047172,0.0009616336,0.00006710487,0.00006332965],"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.00008236767,0.0003835558,0.03521807,0.00001168812,0.0001891226,0.0001428375,0.004339571,0.06140152,0.00155353,0.0003535369,0.03706713,0.859257],"study_design_scores_gemma":[0.001721352,0.0006832404,0.2088873,0.0001586704,0.00005264183,0.002650516,0.0002164571,0.6010357,0.001366757,0.009028387,0.1738675,0.0003315138],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9512632,0.00008056659,0.01844213,0.01749693,0.00104837,0.00006746977,4.336417e-7,0.0001446274,0.01145624],"genre_scores_gemma":[0.9471633,0.00002231478,0.03342057,0.0003487337,0.0003169806,7.025063e-7,1.490163e-7,0.00000814426,0.01871913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8589256,"threshold_uncertainty_score":0.454666,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004668417,0.00008080779,0.0000681774,0.00003044594,0.0002636666,0.0001290968,0.000612858,0.00002359756,0.0007210474],"category_scores_gemma":[0.00005647315,0.00004590794,0.00004555165,0.0001912928,0.00002978828,0.0001470134,0.0001478218,0.0002988236,0.0007843585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006701034,"about_ca_system_score_gemma":0.000002915948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000310955,"about_ca_topic_score_gemma":6.789194e-7,"domain_scores_codex":[0.9991673,0.0002056836,0.00009013724,0.000192125,0.0001546586,0.0001901026],"domain_scores_gemma":[0.9993409,0.0002125746,0.00003598508,0.0003516153,0.00001601001,0.00004294622],"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":[8.201862e-7,0.0000322163,0.0005387707,0.000002042946,0.00001236709,0.000009005875,0.001444787,0.001931387,0.0001365947,0.106474,0.001650249,0.8877678],"study_design_scores_gemma":[0.00009344391,0.00004485922,0.0008729031,0.000002669614,0.000001847877,0.00002265856,0.00003150897,0.9535322,0.000184001,0.005185391,0.03992733,0.0001011896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002372425,0.000188242,0.913259,0.002722113,0.0001423559,0.00004626039,2.983429e-8,0.0003398818,0.08092973],"genre_scores_gemma":[0.9473156,0.0000176335,0.008227618,0.0006854563,0.0001085232,0.000005329136,1.927875e-7,0.000006643672,0.04363304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9516008,"threshold_uncertainty_score":0.9999936,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004776003,0.00009951978,0.0001238782,0.00005297847,0.0004903695,0.00004727019,0.0008825004,0.00004177491,0.0001992544],"category_scores_gemma":[0.00005725473,0.00009229253,0.00009078936,0.0002218171,0.0001025951,0.0001776887,0.0002875237,0.0002132876,0.0002153772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002427426,"about_ca_system_score_gemma":0.00004179872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003071401,"about_ca_topic_score_gemma":0.00003281944,"domain_scores_codex":[0.9991003,0.0001112394,0.00008567458,0.0002584805,0.0002216415,0.000222619],"domain_scores_gemma":[0.9991441,0.00009879895,0.0001073447,0.0005227505,0.00004548844,0.00008153971],"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.00008089533,0.0003133264,0.1093191,0.0001080191,0.0003631863,0.0001993287,0.03724388,0.005867715,0.00122741,0.5677016,0.002791203,0.2747844],"study_design_scores_gemma":[0.003022389,0.0002088807,0.06217112,0.00009486881,0.00003690099,0.00008879776,0.006282,0.2206274,0.002320562,0.01534888,0.6887193,0.001078855],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2822849,0.0001108486,0.6824196,0.001145561,0.0004750995,0.0001698956,0.000007352203,0.0002127279,0.03317402],"genre_scores_gemma":[0.9822287,0.0000281901,0.01353858,0.00003711264,0.00001170325,1.549218e-7,0.000001407511,0.00000567531,0.004148448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6999438,"threshold_uncertainty_score":0.3771575,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001751091,0.0003706401,0.0008436051,0.001137721,0.0002010796,0.0002920131,0.0007839818,0.0002180631,0.000002584104],"category_scores_gemma":[0.0001661811,0.0003083479,0.00007912937,0.0005631772,0.0009509299,0.0004464347,0.0006324704,0.0005754652,0.000001457649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005538249,"about_ca_system_score_gemma":0.0001335302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000715698,"about_ca_topic_score_gemma":0.000002440061,"domain_scores_codex":[0.9973471,0.00007628862,0.0005997792,0.0009509694,0.0006624485,0.0003633919],"domain_scores_gemma":[0.9980072,0.000810422,0.0004087688,0.0005102162,0.0001608864,0.0001025052],"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.0000813424,0.00002006057,0.0006939908,0.0001300885,0.00002298879,0.00001709466,0.0004759434,0.08411152,0.00003487439,0.001160534,0.00001251772,0.9132391],"study_design_scores_gemma":[0.004732406,0.0001339019,0.0009538894,0.0003349478,0.00001631054,0.00008572252,5.485158e-8,0.989036,0.0001029288,0.00425984,0.00006288395,0.0002810752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002929531,0.001037939,0.9934807,0.0001256883,0.0005951587,0.0003527629,0.000003895039,0.0003147085,0.001159646],"genre_scores_gemma":[0.5425023,0.0003071047,0.4565338,0.0001134716,0.0002175802,0.000009203555,0.000007020246,0.00002490912,0.000284665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.912958,"threshold_uncertainty_score":0.9999369,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009342417,0.0003404049,0.0004827071,0.0003560024,0.0009195814,0.0000977481,0.0007863823,0.0001618163,0.00004000752],"category_scores_gemma":[0.001192423,0.0003204628,0.0001877897,0.000895884,0.00009808132,0.0005885282,0.0003863711,0.001527329,0.00007131031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005040608,"about_ca_system_score_gemma":0.00007679407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000850002,"about_ca_topic_score_gemma":0.00001337496,"domain_scores_codex":[0.9970704,0.0004870683,0.000581018,0.0006990426,0.0005698424,0.0005926701],"domain_scores_gemma":[0.9983854,0.0004102279,0.0004785217,0.0004520465,0.0001518019,0.0001219931],"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.00007993837,0.0002903795,0.3822595,0.0002241046,0.0001355094,0.0002538717,0.01375176,0.4649151,0.03089488,0.002020499,0.0001494264,0.105025],"study_design_scores_gemma":[0.0009857407,0.0003508611,0.009582072,0.0001634652,0.00001519524,0.0002156543,0.00009759334,0.9761927,0.001442779,0.00009566322,0.0104294,0.0004288401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5518563,0.0007758206,0.4411004,0.0004991053,0.0004786489,0.0002590209,0.000001719363,0.001077449,0.003951583],"genre_scores_gemma":[0.977063,0.00008185967,0.01861227,0.00005511349,0.0001318206,0.00001523727,0.00002373519,0.00004572585,0.003971269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5112776,"threshold_uncertainty_score":0.9999247,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00005634694,0.00002819398,0.00002720657,0.00001156176,0.00003464667,0.00005035847,0.0002439891,0.000009431301,0.002161523],"category_scores_gemma":[0.000002680133,0.00002109423,0.00001567819,0.0000791663,0.000004103782,0.0001069261,0.00001415341,0.00004973081,0.001529958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001902234,"about_ca_system_score_gemma":0.000005481342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003401853,"about_ca_topic_score_gemma":5.43595e-7,"domain_scores_codex":[0.9997143,0.0000113065,0.00003689397,0.00009453314,0.0000627787,0.00008023702],"domain_scores_gemma":[0.9997869,0.00001239957,0.000004434835,0.0001629324,0.000004089094,0.00002922495],"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":[1.571451e-7,0.000009049428,0.0001225928,3.090089e-7,8.337163e-7,0.000003898117,0.00004245047,0.0001062186,0.00001197044,0.01399746,0.002062906,0.9836422],"study_design_scores_gemma":[0.0001238842,0.00003885697,0.008358736,0.000002183266,5.338103e-7,0.00002761008,0.000001740353,0.4061021,0.0002666842,0.002880707,0.5820799,0.0001170941],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01496333,0.00002398234,0.3067812,0.002404749,0.00009070594,0.00001809124,6.381855e-8,0.0004006951,0.6753172],"genre_scores_gemma":[0.7271599,0.000007627713,0.142272,0.001260089,0.0001039236,0.000001445178,3.702176e-7,0.000003168155,0.1291914],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.983525,"threshold_uncertainty_score":0.9992475,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783503,0.0001224319,0.0001172102,0.00005846149,0.0002280273,0.0001279113,0.0004289687,0.00003984343,0.000135107],"category_scores_gemma":[0.00002205703,0.00008854469,0.00007568939,0.0002135473,0.0000164738,0.000164557,0.00003371323,0.0001073769,0.00005886533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001490881,"about_ca_system_score_gemma":0.00003234112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005778274,"about_ca_topic_score_gemma":0.000001939119,"domain_scores_codex":[0.9989678,0.00003891387,0.0001626015,0.0003542923,0.0001726935,0.000303697],"domain_scores_gemma":[0.9994098,0.0001024855,0.00004713509,0.0003102932,0.00004027114,0.00009003546],"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.000001163604,0.00003494683,0.00004653321,0.000009063201,0.000002569186,0.000002336614,0.00008786259,0.0009404657,0.00003484478,0.000727249,0.001002474,0.9971105],"study_design_scores_gemma":[0.0004761911,0.0001260644,0.0001018453,0.00004903501,0.000002051283,0.000006886783,0.000003442068,0.9507967,0.0003704362,0.0008212736,0.04710742,0.0001386943],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001149488,0.00006489256,0.9910221,0.001216705,0.0001554756,0.0002206538,0.00000165789,0.0004566244,0.00571243],"genre_scores_gemma":[0.01370346,0.000003338698,0.9727112,0.0006287554,0.0001426983,0.00005722236,0.000009043149,0.00001367172,0.01273063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9969718,"threshold_uncertainty_score":0.3610747,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001629073,0.0001150401,0.0001084624,0.0001316593,0.000109056,0.0001165484,0.0002490995,0.00003013928,0.00000916588],"category_scores_gemma":[0.00007306415,0.0001048556,0.0000290441,0.0006198479,0.000005067238,0.0001684895,0.00009507996,0.0003034959,0.0003453417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000025286,"about_ca_system_score_gemma":0.00002408616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009823089,"about_ca_topic_score_gemma":0.000001520819,"domain_scores_codex":[0.9988943,0.0001492022,0.0001505433,0.000325533,0.0002809907,0.0001993861],"domain_scores_gemma":[0.999473,0.0001195272,0.0000711481,0.0001375643,0.0001126268,0.00008613487],"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.00001888318,0.00002449101,0.001950737,0.000009469662,0.00000450145,0.000005021219,0.0005970645,0.5443528,0.0002437735,0.002666009,0.0004811285,0.4496462],"study_design_scores_gemma":[0.0002523657,0.0008756903,0.008366786,0.00002652948,0.000001261291,0.000006874576,0.00001819609,0.9846373,0.0001079924,0.0002335488,0.005333672,0.0001397504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8281415,0.000008121241,0.1682651,0.001152248,0.0008474666,0.0001704903,7.652407e-7,0.0003099566,0.001104304],"genre_scores_gemma":[0.9930192,5.368529e-7,0.005779626,0.000605056,0.00007571565,0.00000285304,0.00002914579,0.000009325608,0.0004785828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4495064,"threshold_uncertainty_score":0.4438785,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009046992,0.00006578705,0.00006873995,0.00004464149,0.00007548991,0.00007050457,0.0003744773,0.00002159683,0.00006010278],"category_scores_gemma":[0.0001099943,0.00005208689,0.00003005803,0.0001858111,0.00000676116,0.0001147687,0.00004606944,0.0001913796,0.0001938459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000056556,"about_ca_system_score_gemma":0.00001083391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001567815,"about_ca_topic_score_gemma":0.000001052259,"domain_scores_codex":[0.9994206,0.00003475174,0.0000821835,0.0001804285,0.0001242794,0.0001577853],"domain_scores_gemma":[0.9996415,0.00005626381,0.0000238059,0.0001960021,0.00002176177,0.00006060474],"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":[6.939118e-7,0.00009514412,0.0008192226,0.000001198641,0.000002520428,0.00002348757,0.0001523459,0.002697347,0.000139717,0.03470404,0.001938542,0.9594257],"study_design_scores_gemma":[0.0002761561,0.0004340811,0.05578532,0.00001089879,0.000002317724,0.00003604942,0.00001164532,0.877015,0.0001875311,0.005170465,0.06084622,0.0002242993],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02663577,0.00009332748,0.9227694,0.0103255,0.0002039542,0.00004397592,1.860147e-7,0.0009719951,0.03895589],"genre_scores_gemma":[0.8937348,0.00000838688,0.09112065,0.001622916,0.0001184989,3.909119e-7,0.000002798554,0.000002617108,0.013389],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9592015,"threshold_uncertainty_score":0.2491561,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007455516,0.0001935214,0.0002556866,0.0002428337,0.0005496698,0.0002383727,0.00122427,0.0000799953,0.00001115831],"category_scores_gemma":[0.0002338043,0.0001659447,0.0002582805,0.002231292,0.0000548117,0.0002943964,0.000358858,0.0003804764,0.00005127529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001036576,"about_ca_system_score_gemma":0.00008577864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004776123,"about_ca_topic_score_gemma":0.0004441171,"domain_scores_codex":[0.9983518,0.0002589658,0.0001426781,0.0007255552,0.0001402873,0.0003807715],"domain_scores_gemma":[0.9981632,0.0004346385,0.0001479093,0.0007554163,0.0001723905,0.0003264081],"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.00007899753,0.0001454938,0.08702463,0.000004939442,0.001532246,0.0001303796,0.003621144,0.7516295,0.000008635026,0.01586757,0.001703489,0.138253],"study_design_scores_gemma":[0.0005359821,0.0001361471,0.006244583,0.000003501857,0.0003644039,0.000001092006,0.0003124152,0.9752886,0.00001180344,0.006463458,0.01040372,0.0002343014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03887625,0.0000475248,0.9596604,0.0004675833,0.0002446683,0.0001723397,0.00002556172,0.0002206978,0.0002850433],"genre_scores_gemma":[0.9522291,0.000011423,0.04481906,0.0001479024,0.0001755761,0.000001384498,0.00001284845,0.00001182658,0.002590907],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9148413,"threshold_uncertainty_score":0.7220102,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003191387,0.0001225242,0.0001159628,0.00008472979,0.0002575897,0.000249188,0.0006214365,0.00002770864,2.377048e-7],"category_scores_gemma":[0.00002270419,0.00008976582,0.00001245904,0.0004118881,0.0001491573,0.000477184,0.00006135413,0.0001562984,0.000006052335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001194024,"about_ca_system_score_gemma":0.00002898669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00014069,"about_ca_topic_score_gemma":0.000008733045,"domain_scores_codex":[0.9986579,0.00004315586,0.0001204631,0.0006105036,0.0002752313,0.0002927207],"domain_scores_gemma":[0.998949,0.00003251263,0.00008252166,0.0008195505,0.00002893468,0.00008751877],"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.000003703493,0.00000695722,0.00003871868,0.000003146161,0.000002297799,0.00003843048,0.0002367268,0.00007512911,0.07544196,0.00005891253,0.0006972666,0.9233968],"study_design_scores_gemma":[0.0001999313,0.00007800688,0.01216234,0.0000486965,0.000004381924,0.0001912963,0.0000156924,0.9847521,0.00049559,0.0001204658,0.001745356,0.0001860945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2036134,0.00002182989,0.7693011,0.02645465,0.0002398912,0.0000527281,7.029449e-7,0.0001191852,0.0001964989],"genre_scores_gemma":[0.5012035,0.0000184607,0.4911604,0.007246634,0.0001628069,1.435682e-8,0.000005513935,0.000004796436,0.0001978785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.984677,"threshold_uncertainty_score":0.3660544,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004428555,0.00008363697,0.0001613076,0.00004534252,0.00008400209,0.00002787218,0.0003455994,0.00005377305,0.00005027177],"category_scores_gemma":[0.0004040849,0.00005228663,0.00005757308,0.0001389468,0.00004985946,0.0002363538,0.00007636541,0.00008652566,0.00003426589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003310929,"about_ca_system_score_gemma":0.00003745252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001156269,"about_ca_topic_score_gemma":0.000003304365,"domain_scores_codex":[0.9990745,0.00007147706,0.0002030963,0.0003259589,0.0001409682,0.0001839646],"domain_scores_gemma":[0.9988586,0.0004257918,0.0001450857,0.0003266491,0.0001932219,0.00005067678],"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.00002808352,0.00008928977,0.00615278,0.0000201889,0.000014016,1.975525e-7,0.0001613067,0.0001054482,0.01479779,0.06874889,0.0008304944,0.9090515],"study_design_scores_gemma":[0.004102294,0.001691565,0.2498337,0.0001819974,0.00002818947,0.000007244379,0.0002011434,0.5238334,0.09612308,0.03024779,0.0929279,0.0008217442],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06792028,0.000007363719,0.9254837,0.002712133,0.0002031506,0.0001709432,0.000001336314,0.0001693362,0.003331784],"genre_scores_gemma":[0.925589,0.00000361721,0.06386219,0.00003373631,0.00004512757,0.00002174977,0.000001619143,0.000006174224,0.01043684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9082298,"threshold_uncertainty_score":0.2132187,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001385059,0.0001187236,0.0001538358,0.0001578411,0.0001529376,0.00003276511,0.0006665845,0.00006412349,0.0001120037],"category_scores_gemma":[0.00005998961,0.0001275899,0.00009614891,0.0007604073,0.00008085258,0.0003039996,0.0001670973,0.0002729447,0.0001340441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002975495,"about_ca_system_score_gemma":0.00001371905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006397952,"about_ca_topic_score_gemma":0.000002759671,"domain_scores_codex":[0.9990622,0.0001222145,0.0001151221,0.0003880259,0.00007441865,0.000237956],"domain_scores_gemma":[0.9992573,0.00009550188,0.0001222859,0.0003597533,0.00006438749,0.0001008248],"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.00002681743,0.0003540498,0.05300709,0.00007235687,0.0001613114,0.0004782017,0.002529903,0.2113894,0.001224523,0.6648245,0.00176427,0.06416756],"study_design_scores_gemma":[0.0003713958,0.0001165409,0.001248467,0.00001601184,0.00001009221,0.000004960117,0.0000854605,0.9928918,0.0003126861,0.001123248,0.003651909,0.00016745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2792441,0.00005978831,0.7057334,0.0002000937,0.0002185185,0.00005818382,8.135092e-7,0.0003085693,0.01417657],"genre_scores_gemma":[0.9901696,0.00003467243,0.002045585,0.00004095137,0.00002222314,9.710601e-8,8.85347e-7,0.000007244098,0.007678749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7815024,"threshold_uncertainty_score":0.5202964,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001718215,0.000242945,0.0002216444,0.00007227099,0.0007464762,0.0007004591,0.002364335,0.0000666255,0.0001050731],"category_scores_gemma":[0.0001360479,0.0001820369,0.00008868646,0.0009100332,0.001845172,0.001623845,0.00128945,0.0003613023,0.0003297261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009280829,"about_ca_system_score_gemma":0.000100519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001131125,"about_ca_topic_score_gemma":1.907628e-7,"domain_scores_codex":[0.9968112,0.0001641061,0.0002873303,0.0006634257,0.0009938256,0.001080072],"domain_scores_gemma":[0.9981725,0.0002696075,0.00008314191,0.0009244485,0.0001313194,0.0004190342],"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.000002217257,0.00009024984,0.0009963779,0.000004459297,0.000004056938,0.000004680355,0.0009505499,0.00003771582,0.00007716427,0.9771399,0.0002024345,0.02049019],"study_design_scores_gemma":[0.0007489324,0.0005223737,0.02299117,0.00007853509,0.00002164681,0.000326439,0.00003166495,0.6901739,0.008959381,0.2583167,0.01651208,0.001317202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03543137,0.00008223927,0.9567222,0.001711171,0.001715131,0.0001117179,0.000004124612,0.0003447822,0.00387728],"genre_scores_gemma":[0.8878042,0.000004491978,0.1110013,0.0006119059,0.0005056043,0.00000644599,0.000003634863,0.000008424866,0.00005406696],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8523728,"threshold_uncertainty_score":0.7423248,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003553945,0.00009228518,0.0002160419,0.0005382213,0.0002984925,0.00007056279,0.0008559627,0.00004627031,0.0001593986],"category_scores_gemma":[0.0007806726,0.00007450004,0.0001406391,0.0007414942,0.0003613017,0.0004179076,0.0001418988,0.001002502,0.0001041064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005784808,"about_ca_system_score_gemma":0.0004574082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000130402,"about_ca_topic_score_gemma":0.00001061241,"domain_scores_codex":[0.997286,0.000565259,0.0005886029,0.0001730534,0.001021654,0.0003654667],"domain_scores_gemma":[0.9970516,0.0009268462,0.0003040064,0.0002688285,0.001273875,0.000174836],"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.0001723589,0.0005441619,0.0002682123,0.00001589393,0.00008967794,0.0005479311,0.007541164,0.01600841,0.01023638,0.1303398,0.001402961,0.8328331],"study_design_scores_gemma":[0.0001609238,0.003119487,0.005095238,0.0002086719,0.00001492016,0.001710796,0.004335576,0.2078617,0.4306974,0.3353921,0.01090967,0.0004934971],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2723779,0.0001855546,0.724708,0.001024786,0.0003564429,0.00007800006,0.000004475707,0.00001500952,0.001249844],"genre_scores_gemma":[0.9700024,0.0004012767,0.02801303,0.00001524882,0.0003927709,0.000002032585,3.64393e-7,0.000008883191,0.001163993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8323396,"threshold_uncertainty_score":0.4355428,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006932903,0.0002419334,0.0002156577,0.00012872,0.000324618,0.0002068975,0.00181613,0.0002405202,0.0003310351],"category_scores_gemma":[0.0005930588,0.0001984342,0.00009920249,0.0008457843,0.0001940824,0.0002227107,0.0004541575,0.001404766,0.000192886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007437233,"about_ca_system_score_gemma":0.0001098138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000631016,"about_ca_topic_score_gemma":0.0003378981,"domain_scores_codex":[0.9979159,0.000144994,0.0002807464,0.0007128168,0.0004826731,0.0004629232],"domain_scores_gemma":[0.9982319,0.0001944108,0.0001038232,0.001034592,0.0002541131,0.0001811047],"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.00002751386,0.0002338602,0.00852242,0.00003768569,0.00004588134,0.0000495873,0.001611516,0.0005632949,0.0004873136,0.2408354,0.006785316,0.7408003],"study_design_scores_gemma":[0.0002472288,0.0008381286,0.006821018,0.00005896688,0.00001607583,0.0001652604,0.00006385271,0.5426968,0.05425397,0.08817215,0.3055761,0.001090415],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006097136,0.0006241893,0.9527835,0.01372028,0.001898538,0.0002067453,0.000008994377,0.0006258376,0.02403475],"genre_scores_gemma":[0.9531845,0.00001516014,0.04078117,0.002876812,0.00046797,0.000007376589,0.000005144361,0.0000157424,0.002646097],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9470874,"threshold_uncertainty_score":0.809191,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001163544,0.0005660891,0.0005987408,0.0009079109,0.0003063457,0.0006652409,0.003152302,0.000332385,0.00004716178],"category_scores_gemma":[0.0006070851,0.0005143266,0.00009648552,0.001222458,0.0002991029,0.0009858296,0.001369075,0.001889099,0.00006840955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003289825,"about_ca_system_score_gemma":0.001110074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006381712,"about_ca_topic_score_gemma":0.0006511511,"domain_scores_codex":[0.9955652,0.00007106752,0.0005853737,0.001782924,0.001143677,0.0008517799],"domain_scores_gemma":[0.9972443,0.001092363,0.0003327482,0.0008822086,0.0002704364,0.0001779209],"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.000009928291,0.00002517902,0.0003148177,0.00002913683,0.000003402778,0.00007616907,0.000620189,0.2155242,0.0000133175,0.0006004876,0.000007258394,0.7827759],"study_design_scores_gemma":[0.0004685749,0.0002443921,0.001229261,0.001057974,0.000004885896,0.00005993928,4.095691e-7,0.9502536,0.0005294633,0.03459003,0.01070389,0.0008575473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004691335,0.0005527925,0.9927317,0.0008627181,0.0008734385,0.0002897067,0.000001441054,0.0002426221,0.003976429],"genre_scores_gemma":[0.1430684,0.0002325129,0.8518764,0.001258884,0.001030211,0.00002213562,0.000008278728,0.00006977779,0.002433432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7819184,"threshold_uncertainty_score":0.9997308,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001822573,0.0003736505,0.0005136295,0.000187309,0.00006433875,0.00009950506,0.0005309404,0.0001349105,0.00004459985],"category_scores_gemma":[0.00003168579,0.0003541743,0.00008107786,0.0001400604,0.00007432257,0.0007455806,0.0002562712,0.0006061158,0.00004075027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004182472,"about_ca_system_score_gemma":0.00003490536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001273468,"about_ca_topic_score_gemma":0.000001451484,"domain_scores_codex":[0.9983639,0.00001471912,0.0004482919,0.0005920803,0.0002291128,0.000351928],"domain_scores_gemma":[0.9992394,0.00014598,0.00009673861,0.0003642123,0.00004986134,0.000103812],"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.000003652501,0.000007907935,9.52126e-7,0.000404671,0.00001225379,0.00004544928,0.00004592996,0.001553847,9.072538e-7,0.3132892,0.0003686482,0.6842666],"study_design_scores_gemma":[0.00002357778,0.0003469951,0.000003210159,0.001816373,0.00001065776,0.0001166646,1.069637e-7,0.2229548,0.00003501735,0.0382803,0.7358658,0.0005465014],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[5.768151e-7,0.1562195,0.8342152,0.0003305138,0.0005425939,0.0001564416,0.00000124604,0.000248623,0.008285307],"genre_scores_gemma":[0.0001827733,0.5889747,0.3548661,0.002739358,0.002766738,0.00005105116,0.00002247301,0.0001472413,0.05024953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7354971,"threshold_uncertainty_score":0.999891,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005665021,0.0004652201,0.0005210948,0.0002880801,0.001266601,0.0004976204,0.002878323,0.0004079859,0.00002113065],"category_scores_gemma":[0.0004038648,0.0005408055,0.0004227379,0.0002077971,0.0001248698,0.000520548,0.002598894,0.002294842,0.00008757778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001821045,"about_ca_system_score_gemma":0.0002491923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002521866,"about_ca_topic_score_gemma":0.000009441924,"domain_scores_codex":[0.9971296,0.0002857727,0.0002069848,0.001618611,0.0001370107,0.0006220222],"domain_scores_gemma":[0.9972817,0.0003125191,0.0006873617,0.001218496,0.0002739235,0.0002260438],"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.00005233795,0.00008576377,0.001799326,0.0001460955,0.000246644,0.0002521064,0.001191217,0.8253428,0.00002241278,0.03563086,0.0002386041,0.1349918],"study_design_scores_gemma":[0.0007139374,0.0002054504,0.0006614131,0.0001210846,0.0000624008,0.000006724168,0.0001301837,0.967662,0.00009616631,0.01560889,0.01408292,0.0006488558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03059206,0.00005523186,0.9608918,0.0002356804,0.001203048,0.0004018718,0.00001028802,0.0007320124,0.005878006],"genre_scores_gemma":[0.9602466,0.0001324237,0.01229187,0.00003566841,0.0004205298,0.000005223322,0.00005220835,0.00004781696,0.0267677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9485999,"threshold_uncertainty_score":0.9997044,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001472149,0.0001181216,0.0001334026,0.00003789052,0.0008759761,0.0004320459,0.001004882,0.00004721798,0.0001250104],"category_scores_gemma":[0.000255454,0.00009929814,0.00005573104,0.00004656709,0.0000591378,0.0006512792,0.0005695403,0.0003579242,0.0003925159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003371137,"about_ca_system_score_gemma":0.00001939721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055957,"about_ca_topic_score_gemma":0.00004214226,"domain_scores_codex":[0.999056,0.0001032792,0.00007087618,0.0003683666,0.0001781473,0.0002232908],"domain_scores_gemma":[0.9989763,0.0001761148,0.0001266053,0.0005756987,0.00004990685,0.00009533972],"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.000005181825,0.0000234389,0.01035138,0.000001211062,0.00003774859,0.00002099938,0.001343969,0.0004427363,0.0001758402,0.002906287,0.000368255,0.984323],"study_design_scores_gemma":[0.001715713,0.0002279592,0.3914723,0.00003772179,0.00001833228,0.000004794479,0.0005172521,0.5477997,0.004593134,0.002402133,0.05064572,0.0005652045],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1418097,0.00002712827,0.7672159,0.002112615,0.001268603,0.0006634908,0.000004670859,0.0007079789,0.08618994],"genre_scores_gemma":[0.979122,0.000005754502,0.01619864,0.0001596986,0.0001527024,0.00003581629,0.000003428866,0.000007829218,0.004314164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9837577,"threshold_uncertainty_score":0.6737388,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002368665,0.0001894726,0.000171512,0.000213695,0.0002700262,0.0003126774,0.000616536,0.00004559015,0.00002190975],"category_scores_gemma":[0.00004276154,0.0001560321,0.00006896237,0.0008068171,0.00005804997,0.001212194,0.0002063568,0.0003128414,0.0001069698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006139259,"about_ca_system_score_gemma":0.0001197072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001315199,"about_ca_topic_score_gemma":7.223324e-7,"domain_scores_codex":[0.9983897,0.00002915644,0.0001994794,0.0004466695,0.0006289641,0.0003060487],"domain_scores_gemma":[0.99928,0.0001173543,0.0001166598,0.0002579419,0.000103749,0.0001242432],"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.0000107882,0.00004991479,0.00146107,0.00002465291,0.00004925363,0.00006198059,0.001596704,0.8013075,0.00003748242,0.1827022,0.0000646519,0.01263382],"study_design_scores_gemma":[0.002763709,0.0004235685,0.04771915,0.0002445238,0.00002224744,0.000381961,0.000185621,0.8319869,0.0002932661,0.1105192,0.004345278,0.001114608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.066867,0.00007270228,0.9274619,0.002374022,0.0001715158,0.00008054327,0.000002306154,0.000340487,0.002629552],"genre_scores_gemma":[0.7209353,0.000001514072,0.2775156,0.001284558,0.00007799036,0.000004803258,0.0000218687,0.00001407381,0.0001442413],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6540684,"threshold_uncertainty_score":0.6362803,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004034567,0.0001593793,0.0001997687,0.0001386286,0.0001169194,0.0001310276,0.0006691326,0.000129741,0.0002407004],"category_scores_gemma":[0.00008595475,0.0001308923,0.00005561189,0.0002926695,0.00004116034,0.0004089054,0.0002350198,0.001027005,0.00004863063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008457108,"about_ca_system_score_gemma":0.00005656023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002115751,"about_ca_topic_score_gemma":0.00009914464,"domain_scores_codex":[0.9986593,0.000104299,0.0002300776,0.0004216275,0.0002536901,0.0003310666],"domain_scores_gemma":[0.999289,0.00007247493,0.00007368106,0.0004019284,0.0000544138,0.0001085253],"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.00001629228,0.0001951005,0.01662324,0.0000528873,0.00004592126,0.0002027154,0.004397702,0.3086929,0.04586332,0.2129561,0.002589862,0.4083639],"study_design_scores_gemma":[0.0003359771,0.00003858242,0.001160994,0.000005329636,0.000001991654,0.00002327767,0.00002614942,0.9756582,0.001168679,0.01838122,0.003000332,0.0001992373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2812397,0.00004973119,0.7044199,0.002789495,0.001006566,0.0001499568,0.000001948286,0.0005989212,0.009743818],"genre_scores_gemma":[0.8898196,0.000002886194,0.1065677,0.0004933665,0.0001500953,0.000002548736,0.000005088962,0.00001189587,0.002946795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6669653,"threshold_uncertainty_score":0.5337633,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715693,0.0001714378,0.0002891936,0.0001664793,0.0004275411,0.000125308,0.003651391,0.00005050337,0.00001626942],"category_scores_gemma":[0.00067835,0.0001403278,0.00003939086,0.001109308,0.002655466,0.0006535065,0.002247555,0.0003917819,0.00003144773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002189718,"about_ca_system_score_gemma":0.0001625402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005003287,"about_ca_topic_score_gemma":0.000005507226,"domain_scores_codex":[0.9972771,0.000508542,0.000263042,0.000830674,0.000717856,0.0004027431],"domain_scores_gemma":[0.9972344,0.00112934,0.0001306077,0.00108475,0.0002553539,0.0001655433],"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.00005170982,0.0002239914,0.02577496,0.00001036141,0.00004369628,0.0001553464,0.01347783,0.001545722,0.001033769,0.8160353,0.0001841928,0.1414631],"study_design_scores_gemma":[0.0003546126,0.0004398632,0.2093687,0.00006070497,0.000005901372,0.00004942551,0.00007059231,0.7761021,0.003434769,0.009734146,0.00004236821,0.0003368483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3230104,0.00005043996,0.6752309,0.00017255,0.0002230882,0.0000654184,0.00002346339,0.0001140348,0.001109643],"genre_scores_gemma":[0.8738521,0.00001704883,0.1258637,0.0001223361,0.00009430369,9.862924e-7,0.00002657653,0.000006380314,0.00001647173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8063012,"threshold_uncertainty_score":0.9784176,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009077156,0.0005181007,0.000484281,0.000686467,0.0004876313,0.0008659538,0.001679982,0.0002998954,0.00002975315],"category_scores_gemma":[0.00009562846,0.0004731285,0.00009539134,0.0003715074,0.0005271925,0.0005132417,0.001458593,0.001809459,0.00005389884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001772254,"about_ca_system_score_gemma":0.0002612363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001728579,"about_ca_topic_score_gemma":0.00002187222,"domain_scores_codex":[0.9964516,0.00005759738,0.0003970192,0.001592325,0.0008097432,0.0006917621],"domain_scores_gemma":[0.9982899,0.0004467308,0.0002478235,0.0006763204,0.0001210995,0.0002181051],"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.000001407494,0.00000856502,0.0001683,0.00002054286,0.000007625863,0.00003991328,0.0004624705,0.03929444,0.00005791919,0.009724664,0.000008910671,0.9502052],"study_design_scores_gemma":[0.0002814469,0.0001843167,0.0005629858,0.0003335888,0.000007327516,0.0001645594,3.636998e-7,0.9403865,0.0001210857,0.04274105,0.01444422,0.0007725024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001518318,0.0009853133,0.9889373,0.002182304,0.001003067,0.0001542846,7.169818e-7,0.0002935946,0.006291559],"genre_scores_gemma":[0.1481174,0.00026719,0.8410378,0.002546547,0.001509264,0.000006621602,0.000004395039,0.00007302905,0.006437722],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9494327,"threshold_uncertainty_score":0.999772,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001645625,0.0004677875,0.0004792243,0.0007958919,0.000404659,0.0004701007,0.001782785,0.0003164934,0.00001755365],"category_scores_gemma":[0.0003738414,0.0004091458,0.00009461839,0.0005567138,0.0006489796,0.0005358562,0.001627779,0.001775353,0.00002233856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002173136,"about_ca_system_score_gemma":0.0002605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004301511,"about_ca_topic_score_gemma":0.0001216531,"domain_scores_codex":[0.996309,0.00005473297,0.0004241846,0.001658983,0.0009503731,0.0006027702],"domain_scores_gemma":[0.997214,0.001249191,0.0002438719,0.0008910979,0.0001826318,0.0002191842],"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.000007910422,0.00001263999,0.0002143642,0.0000123262,0.000003994362,0.00004593281,0.000644216,0.009342751,0.00001523861,0.003398461,0.000001576364,0.9863006],"study_design_scores_gemma":[0.0004031318,0.0003273786,0.003252157,0.0003343093,0.000006013031,0.0001086657,4.246429e-7,0.8750774,0.0003168366,0.1152539,0.004174947,0.0007448735],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001052127,0.0003132671,0.9891156,0.0002558937,0.001050445,0.0002065514,0.000001127306,0.0001948366,0.007810146],"genre_scores_gemma":[0.2278684,0.00007130153,0.7703118,0.0006529043,0.0004949307,0.000003438972,0.000003335326,0.00003834558,0.0005555669],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9855557,"threshold_uncertainty_score":0.999836,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003254881,0.0000871286,0.000115067,0.00008827681,0.00006766014,0.00003333206,0.0003592783,0.0000334433,0.00002163475],"category_scores_gemma":[0.00159057,0.000055727,0.00003423625,0.0004265029,0.00004111258,0.0001176237,0.00007730517,0.00006001854,0.00005059052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004268587,"about_ca_system_score_gemma":0.0000948209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001051978,"about_ca_topic_score_gemma":0.000006090405,"domain_scores_codex":[0.999008,0.00003975536,0.0002404723,0.0003290005,0.0002247535,0.0001580167],"domain_scores_gemma":[0.9983224,0.0006992049,0.0001739104,0.0005106538,0.0002015158,0.00009236885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000005339383,0.0001135533,0.03988271,0.00001037749,0.000006726845,0.00002489197,0.00009277963,0.0004752777,0.09664745,0.002061241,0.000452617,0.860227],"study_design_scores_gemma":[0.0004619863,0.0003210584,0.535162,0.0001327824,0.000005942661,0.00004267709,0.00003408427,0.3630053,0.09703204,0.0003467762,0.003165163,0.0002902033],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0203313,9.635038e-7,0.965486,0.003333152,0.00006708536,0.00007625498,0.00000130982,0.0001968425,0.01050702],"genre_scores_gemma":[0.8790972,2.767516e-8,0.1189749,0.0001367718,0.00002873959,0.000008695157,7.782915e-7,0.000005786426,0.001747185],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8599368,"threshold_uncertainty_score":0.2272481,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01115484,0.000196795,0.0004006775,0.0006561186,0.001083063,0.0003269939,0.0008330618,0.0001052771,0.00002780347],"category_scores_gemma":[0.006953037,0.0001459786,0.0001027246,0.0003838959,0.0001150051,0.0004690214,0.0007943188,0.004100969,0.00002089076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006078812,"about_ca_system_score_gemma":0.0000738665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003491336,"about_ca_topic_score_gemma":0.000004333811,"domain_scores_codex":[0.9939112,0.003267958,0.0005172269,0.0003900715,0.001375379,0.0005381677],"domain_scores_gemma":[0.9941788,0.004112975,0.0004136602,0.0003822812,0.0005668779,0.0003454275],"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.0002409238,0.0003747457,0.05462037,0.0001330123,0.0001019319,0.0001687,0.007592945,0.01447337,0.01606786,0.02086479,0.006828056,0.8785333],"study_design_scores_gemma":[0.001867021,0.002812125,0.01208025,0.0006415533,0.00001604046,0.0006498626,0.0002372836,0.8718269,0.0008282845,0.01402705,0.09462915,0.0003844673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5955049,0.00172995,0.3899291,0.009969783,0.000737942,0.0002095333,0.000001259,0.000147422,0.001770198],"genre_scores_gemma":[0.9018227,0.0001171426,0.09698966,0.0001229367,0.0003922635,0.000001305292,0.000002224596,0.0000253029,0.000526475],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8781489,"threshold_uncertainty_score":0.9981966,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002944693,0.000203739,0.0001566015,0.0003728735,0.0006326417,0.000591451,0.0009284702,0.00005957093,0.0006472527],"category_scores_gemma":[0.0006149482,0.0001852582,0.00006079061,0.0004504758,0.0001470191,0.0004847674,0.000233455,0.000708896,0.001465864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000718602,"about_ca_system_score_gemma":0.0001560284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000124376,"about_ca_topic_score_gemma":0.00004368557,"domain_scores_codex":[0.9976991,0.0002113719,0.0002531842,0.0006570443,0.0008598489,0.0003194433],"domain_scores_gemma":[0.9982767,0.0002609367,0.0001646624,0.0003151987,0.0008047437,0.0001777471],"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.0001346775,0.0002041882,0.03761658,0.000007569284,0.0002112264,0.00008783984,0.01140523,0.09083288,0.003206542,0.7975172,0.002164984,0.05661108],"study_design_scores_gemma":[0.001220534,0.002626196,0.05205874,0.000168583,0.0000178871,0.0001817984,0.002909735,0.8354447,0.001826244,0.01110489,0.09159653,0.0008441579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1089965,0.000004418586,0.6647187,0.02219601,0.0007881995,0.000258786,0.000007618108,0.0007879594,0.2022418],"genre_scores_gemma":[0.9616747,0.000004494149,0.0125623,0.0005268492,0.0003989635,0.00005398352,0.00005976012,0.00001901584,0.02469995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8526782,"threshold_uncertainty_score":0.9993116,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005665021,0.0004652201,0.0005210948,0.0002880801,0.001266601,0.0004976204,0.002878323,0.0004079859,0.00002113065],"category_scores_gemma":[0.0004038648,0.0005408055,0.0004227379,0.0002077971,0.0001248698,0.000520548,0.002598894,0.002294842,0.00008757778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001821045,"about_ca_system_score_gemma":0.0002491923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002521866,"about_ca_topic_score_gemma":0.000009441924,"domain_scores_codex":[0.9971296,0.0002857727,0.0002069848,0.001618611,0.0001370107,0.0006220222],"domain_scores_gemma":[0.9972817,0.0003125191,0.0006873617,0.001218496,0.0002739235,0.0002260438],"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.00005233795,0.00008576377,0.001799326,0.0001460955,0.000246644,0.0002521064,0.001191217,0.8253428,0.00002241278,0.03563086,0.0002386041,0.1349918],"study_design_scores_gemma":[0.0007139374,0.0002054504,0.0006614131,0.0001210846,0.0000624008,0.000006724168,0.0001301837,0.967662,0.00009616631,0.01560889,0.01408292,0.0006488558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03059206,0.00005523186,0.9608918,0.0002356804,0.001203048,0.0004018718,0.00001028802,0.0007320124,0.005878006],"genre_scores_gemma":[0.9602466,0.0001324237,0.01229187,0.00003566841,0.0004205298,0.000005223322,0.00005220835,0.00004781696,0.0267677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9485999,"threshold_uncertainty_score":0.9997044,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003846339,0.00003685399,0.00003167212,0.00002817383,0.00006072295,0.00003642451,0.0001521008,0.00001566636,0.000008155213],"category_scores_gemma":[0.000006408323,0.00003005121,0.00001654545,0.0001341678,0.000004418784,0.0001910258,0.0000354602,0.00007625666,0.00006864548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002302499,"about_ca_system_score_gemma":0.00003499752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000752242,"about_ca_topic_score_gemma":0.000005889771,"domain_scores_codex":[0.9996707,0.000006619677,0.00003581464,0.0001239432,0.0000758481,0.00008709796],"domain_scores_gemma":[0.999851,0.000004826902,0.00001206542,0.00008538186,0.00001879663,0.00002790981],"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.000001275764,0.00003808346,0.00003482039,0.000001219213,0.000004702801,0.000001271279,0.0005108258,0.4920393,0.0006883881,0.3837922,0.0001867488,0.1227011],"study_design_scores_gemma":[0.0001207347,0.00002376008,0.0002052877,0.000001276864,4.498417e-7,0.000006302204,0.000003184516,0.9683174,0.003995001,0.02706185,0.0002163103,0.00004837455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006899516,0.000002016701,0.9693706,0.001158216,0.00005135139,0.00001988303,6.45911e-8,0.000242627,0.02225572],"genre_scores_gemma":[0.7128155,6.754788e-7,0.2849158,0.0002622248,0.00002814265,0.000001867382,2.054204e-7,0.000001918707,0.001973673],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.705916,"threshold_uncertainty_score":0.1225453,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002858464,0.0001327119,0.0001962505,0.0001203107,0.0001487142,0.0001942113,0.002349451,0.00002701435,0.00001375641],"category_scores_gemma":[0.0001100541,0.00007536942,0.00002402854,0.00125251,0.003024637,0.0003390787,0.0004477185,0.0002835691,0.00001943531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002764321,"about_ca_system_score_gemma":0.0001784649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005971465,"about_ca_topic_score_gemma":0.000002647066,"domain_scores_codex":[0.9978005,0.0002627549,0.0002107656,0.000427013,0.0008994826,0.0003995228],"domain_scores_gemma":[0.9985755,0.0002523753,0.00006843941,0.0007926527,0.0001349003,0.0001761401],"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.00001480618,0.00005198616,0.0006988212,0.000004744068,0.00000150814,0.00002876249,0.001853137,0.00343792,0.00002243137,0.9901081,0.00005068062,0.003727145],"study_design_scores_gemma":[0.0005219402,0.000519886,0.004034667,0.00003411336,0.000002457218,0.0001210252,0.00004691403,0.8449645,0.0008138203,0.1485734,0.0001830035,0.0001842654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1788793,0.00001310961,0.8121896,0.001519791,0.0001821968,0.0001302929,0.000001915167,0.00006242374,0.007021347],"genre_scores_gemma":[0.9153817,7.262957e-7,0.08416691,0.0003852379,0.00005001825,0.000002314063,7.635612e-7,0.000003694765,0.000008639263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8415347,"threshold_uncertainty_score":0.9996886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}