{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"d17634a7629d","filters":{"venue":"ACM Transactions on Evolutionary Learning and Optimization"}},"results":[{"id":"W4294237904","doi":"10.1145/3558774","title":"AutoML Loss Landscapes","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Oracle (Canada); University of British Columbia","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Set (abstract data type); Convexity; Bayesian probability; Biology","authors":[{"name":"Yasha Pushak","is_ca":true},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008214584684334612,"gpt":0.2314862547169162,"spread":0.2232716700325816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008143367,0.001990803,0.00183015,0.002647149,0.001132484,0.004159973,0.002298668,0.002922827,0.005469622],"category_scores_gemma":[0.03614955,0.0006774479,0.00107878,0.001150221,0.002348041,0.003800753,0.003382997,0.003328017,0.001185149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002627954,"about_ca_system_score_gemma":0.001126518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001341265,"about_ca_topic_score_gemma":0.001239792,"domain_scores_codex":[0.9957874,0.001915902,0.0002210226,0.0006129192,0.001131011,0.0003316067],"domain_scores_gemma":[0.982062,0.01311958,0.00105033,0.00151176,0.00172879,0.0005274515],"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.0003763084,0.0002722792,0.007389782,0.0006186503,0.0002205344,0.0003489233,0.0002424306,0.7273287,0.003482257,0.1357947,0.02149707,0.1024284],"study_design_scores_gemma":[0.00002999068,0.0001942411,0.001899333,0.0001360083,0.0000318866,0.0002779978,0.0001173896,0.8878391,0.001417478,0.1016996,0.006311655,0.00004534672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1363405,0.005587509,0.8120055,0.00472759,0.0002404303,0.0003920779,0.001500054,0.00183626,0.03737005],"genre_scores_gemma":[0.7802649,0.001755595,0.1999508,0.00211926,0.0001874443,0.001043742,0.003072708,0.001289683,0.010316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008143367,"threshold_uncertainty_score":0.04306674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3194234892","doi":"10.1145/3468857","title":"Emergent Tangled Program Graphs in Partially Observable Recursive Forecasting and ViZDoom Navigation Tasks","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Compute Canada","keywords":"Computer science; Modularity (biology); Representation (politics); Process (computing); Theoretical computer science; Theme (computing); Graph; Artificial intelligence; Task (project management); State (computer science); Programming language; Systems engineering","authors":[{"name":"Stephen Kelly","is_ca":false},{"name":"Robert J. Smith","is_ca":true},{"name":"Malcolm I. Heywood","is_ca":true},{"name":"Wolfgang Banzhaf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02006204693976415,"gpt":0.2547973784544936,"spread":0.2347353315147294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039578,0.0004802194,0.000388129,0.0004634967,0.0003586891,0.0006656586,0.0008556719,0.0007396896,0.002775865],"category_scores_gemma":[0.007445902,0.0002443027,0.0004369286,0.0004013222,0.0007357249,0.002226887,0.0009928468,0.000810548,0.0001849034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007155109,"about_ca_system_score_gemma":0.0007222308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006783362,"about_ca_topic_score_gemma":0.007592075,"domain_scores_codex":[0.9994738,0.0002348034,0.00002512548,0.0001544691,0.00005307314,0.00005882879],"domain_scores_gemma":[0.9965754,0.002487846,0.0003437414,0.0002685341,0.0001340553,0.0001904296],"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.0004030166,0.0002226781,0.0105433,0.0002467656,0.00006569408,0.0004817897,0.001262678,0.8104281,0.004874809,0.05132857,0.00144386,0.1186988],"study_design_scores_gemma":[0.00002555373,0.00007826041,0.001475574,0.00001203063,0.00001113619,0.00003842776,0.0001453525,0.9324676,0.00107066,0.06378095,0.0008816216,0.00001284019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6301133,0.0002224065,0.3651053,0.0003232864,0.00002150249,0.00008557501,0.0002828092,0.0008474181,0.002998312],"genre_scores_gemma":[0.9344031,0.00006947496,0.06377899,0.0000371503,0.000005625639,0.00007928034,0.0003228667,0.00007057496,0.001232725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006783362,"threshold_uncertainty_score":0.01348776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390751793","doi":"10.1145/3637065","title":"Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"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":"Guangdong Provincial Pearl River Talents Program; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Human multitasking; Task (project management); Surrogate model; Computer science; Curse of dimensionality; Dimension (graph theory); Evolutionary algorithm; Dimensionality reduction; Artificial intelligence; Machine learning; Convergence (economics); Mathematical optimization; Optimization problem; Algorithm; Mathematics; Engineering","authors":[{"name":"Xunfeng Wu","is_ca":false},{"name":"Qiuzhen Lin","is_ca":false},{"name":"Junwei Zhou","is_ca":false},{"name":"Songbai Liu","is_ca":false},{"name":"Carlos A. Coello Coello","is_ca":false},{"name":"Victor C. M. Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009643095064869094,"gpt":0.2436016841010651,"spread":0.233958589036196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002046743,0.001309047,0.00142215,0.0006335721,0.0004952422,0.0008965868,0.001419475,0.001440568,0.002225703],"category_scores_gemma":[0.004317218,0.0005236594,0.001098043,0.0005907416,0.0007616919,0.0009551839,0.001522309,0.00172466,0.0004247586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004434306,"about_ca_system_score_gemma":0.0009606947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002104349,"about_ca_topic_score_gemma":0.002189543,"domain_scores_codex":[0.9992148,0.000368296,0.00004436271,0.0001165258,0.0001810996,0.00007507032],"domain_scores_gemma":[0.9984095,0.0009248551,0.0001196123,0.0002141192,0.0002345185,0.000097579],"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.00004634478,0.0000778481,0.0004970945,0.00006813364,0.00003790701,0.00007889077,0.00004373605,0.9664215,0.001494472,0.004700392,0.0007332109,0.0258006],"study_design_scores_gemma":[0.000009864816,0.0000293426,0.00006304688,0.000003902152,0.000004940832,0.00001332039,0.000006169371,0.9980021,0.0002376988,0.001196869,0.0004296096,0.00000316124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03962944,0.000378082,0.9561446,0.000258991,0.0000728007,0.00009367285,0.000049186,0.0003487452,0.003024417],"genre_scores_gemma":[0.5329782,0.0003296864,0.4613487,0.000306503,0.00008299542,0.0005368595,0.0003484601,0.0001660476,0.00390265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002225703,"threshold_uncertainty_score":0.01082438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4318477412","doi":"10.1145/3582276","title":"The Generation of Visually Credible Adversarial Examples with Genetic Algorithms","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Adversarial system; Computer science; Artificial intelligence; MNIST database; Artificial neural network; Similarity (geometry); Machine learning; Perspective (graphical); Quality (philosophy); Perception; Image (mathematics); Psychology","authors":[{"name":"James R. Bradley","is_ca":false},{"name":"A. Paul Blossom","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02146943322609578,"gpt":0.259577918311435,"spread":0.2381084850853392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002297106,0.001119116,0.0007671118,0.0009796073,0.0005694871,0.0009511477,0.001391683,0.001572932,0.00140299],"category_scores_gemma":[0.01151566,0.0004851588,0.0007576675,0.0004849022,0.001656697,0.00116239,0.001506587,0.001550893,0.0002975341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001219443,"about_ca_system_score_gemma":0.0008655178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002713666,"about_ca_topic_score_gemma":0.002874733,"domain_scores_codex":[0.9988928,0.0004738764,0.00004741227,0.0001970655,0.0002999707,0.00008889234],"domain_scores_gemma":[0.9941889,0.004220827,0.000420154,0.0006162662,0.0004401266,0.0001137023],"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.00007696269,0.0000562293,0.001074382,0.00006508136,0.00003809959,0.00009870564,0.0001177196,0.9381089,0.002489161,0.01352773,0.001082715,0.04326432],"study_design_scores_gemma":[0.0000160131,0.00003227971,0.0001229118,0.00001621806,0.000008323697,0.00003731629,0.00002387919,0.9874938,0.001336437,0.01026623,0.0006378472,0.000008734898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1234877,0.0004740393,0.8670696,0.0006619119,0.0000796644,0.00022043,0.00009042394,0.0009230584,0.006993087],"genre_scores_gemma":[0.6454132,0.0002174297,0.3513338,0.0003348459,0.00003030702,0.0002351884,0.0001649779,0.0001487835,0.00212137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002713666,"threshold_uncertainty_score":0.01214838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407410817","doi":"10.1145/3716862","title":"Dynamic Task Allocation in Intelligent Warehouses with Hybrid Workforce of Automated Guided Vehicles and Human Pickers","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Workforce; Task (project management); Computer science; Operations research; Manufacturing engineering; Industrial engineering; Engineering; Economics; Systems engineering","authors":[{"name":"Arash Dehghan","is_ca":true},{"name":"Mücahit Çevik","is_ca":true},{"name":"Merve Bodur","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007638214342185424,"gpt":0.2441329397007349,"spread":0.2364947253585494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274277,0.0007165007,0.0009163495,0.0004105261,0.0005185869,0.001167088,0.001123681,0.001170613,0.002344339],"category_scores_gemma":[0.002466979,0.0004495734,0.0004904792,0.0004577918,0.0007180041,0.0009515763,0.00122637,0.0007014972,0.0002771085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008300471,"about_ca_system_score_gemma":0.001229318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007745218,"about_ca_topic_score_gemma":0.005244784,"domain_scores_codex":[0.9994085,0.0002033418,0.00001932879,0.0001220675,0.00005587251,0.0001909913],"domain_scores_gemma":[0.999111,0.0004703669,0.0001278797,0.00004600626,0.00007907197,0.0001656518],"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.0001221295,0.00005856124,0.0007439112,0.00002722073,0.00002280237,0.00009742635,0.00005221226,0.9883705,0.0005769257,0.00212177,0.0002786239,0.007527922],"study_design_scores_gemma":[0.00001459414,0.00005900643,0.0002437334,0.00000410936,0.000006665145,0.00001262364,0.00005134464,0.9975915,0.000112207,0.001675848,0.0002244289,0.000003983358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4450442,0.0005578506,0.5465292,0.0006431864,0.00009960485,0.0001129855,0.0001230448,0.0002017268,0.006688126],"genre_scores_gemma":[0.9779907,0.00009570151,0.01978119,0.00007213045,0.00001375286,0.00006474994,0.00003714406,0.00001292433,0.001931571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007745218,"threshold_uncertainty_score":0.01540023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405639190","doi":"10.1145/3709013","title":"Data Mining-Driven Shift Enumeration for Accelerating the Solution of Large-Scale Personnel Scheduling Problems","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Scheduling (production processes); Scale (ratio); Computer science; Operations research; Operations management; Engineering; Mathematics; Geography; Cartography","authors":[{"name":"Farin Rastgar-Amini","is_ca":true},{"name":"Daniel Aloise","is_ca":true},{"name":"Claudio Contardo","is_ca":true},{"name":"Guy Desaulniers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1120187096598312,"gpt":0.3617451143697751,"spread":0.2497264047099439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216715,0.001206536,0.0009333832,0.001057713,0.000590467,0.0008199794,0.001344558,0.0008311717,0.002718334],"category_scores_gemma":[0.003612395,0.0006094365,0.001310083,0.001375552,0.0003785365,0.001036709,0.0008838882,0.001525703,0.0005564661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007287918,"about_ca_system_score_gemma":0.002183859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006478704,"about_ca_topic_score_gemma":0.007461315,"domain_scores_codex":[0.9994155,0.0001916472,0.0000388335,0.0001323224,0.0001360921,0.0000856474],"domain_scores_gemma":[0.9986137,0.0007799437,0.0001490884,0.000127881,0.0002248317,0.0001045341],"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.0001682121,0.0003575639,0.002898036,0.0002986957,0.0000814829,0.0001136114,0.0001273214,0.8586963,0.003629577,0.005118849,0.00336914,0.1251413],"study_design_scores_gemma":[0.00002897266,0.00004369558,0.0002128658,0.000009625899,0.0000091569,0.00001625658,0.00005035647,0.9948566,0.0009171919,0.002844701,0.001006457,0.000004075684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1321138,0.0009340429,0.8574968,0.0009203453,0.0002169604,0.0003586569,0.0007837762,0.002447922,0.004727697],"genre_scores_gemma":[0.2824925,0.0002523472,0.7140555,0.0001737172,0.00005166864,0.0002724168,0.001363708,0.0001602802,0.001177794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006478704,"threshold_uncertainty_score":0.01288199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405245753","doi":"10.1145/3707465","title":"An Evolutionary Algorithm for Expensive Mixed-Integer Black-Box Optimization with Explicit Constraints","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Black box; Mathematical optimization; Integer (computer science); Evolutionary algorithm; Set (abstract data type); Algorithm; Exploit; Computer science; Constraint (computer-aided design); Function (biology); Optimization problem; Integer programming; Constrained optimization problem; Process (computing); Mathematics; Artificial intelligence","authors":[{"name":"Yuan Hong","is_ca":true},{"name":"Dirk V. Arnold","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01462903731252253,"gpt":0.2775491560978298,"spread":0.2629201187853073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149132,0.0009915291,0.001040317,0.0006447505,0.0006201394,0.0009100288,0.001449854,0.001808794,0.003575488],"category_scores_gemma":[0.003463842,0.0006190806,0.0008019048,0.0007305201,0.0008384415,0.0009342119,0.001410776,0.001789942,0.0004957538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007431662,"about_ca_system_score_gemma":0.001411129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002336722,"about_ca_topic_score_gemma":0.002731175,"domain_scores_codex":[0.9994428,0.000184468,0.00002462632,0.00009256565,0.0001916633,0.00006380043],"domain_scores_gemma":[0.9988151,0.0008430149,0.00007660151,0.00007485359,0.0001361296,0.00005446608],"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.00005743179,0.00007615851,0.0003676786,0.00005975618,0.00004146365,0.00008745659,0.00006171341,0.8872455,0.002465411,0.03245998,0.00127727,0.07580017],"study_design_scores_gemma":[0.00001939024,0.00001587078,0.0000291465,0.000005728251,0.000004979549,0.00001562221,0.00000417806,0.9952047,0.0002702281,0.00382766,0.000598864,0.000003681416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007421163,0.0001109361,0.9896041,0.0001222449,0.00003104213,0.00005270504,0.00001749879,0.0001920484,0.002448339],"genre_scores_gemma":[0.1114346,0.0001128135,0.8847524,0.0001227594,0.00002419715,0.0003029808,0.00006872535,0.00008446923,0.00309699],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003575488,"threshold_uncertainty_score":0.01196116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411022335","doi":"10.1145/3742796","title":"Gradient Boosted Programming for Low Cardinality Classification","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Computer science; Artificial intelligence; Data mining","authors":[{"name":"Zhilei Zhou","is_ca":true},{"name":"Malcolm I. Heywood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01223234041435819,"gpt":0.270142507485868,"spread":0.2579101670715098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00339865,0.0008615128,0.001463313,0.0008045167,0.0005245844,0.001171726,0.001557467,0.001271487,0.002305802],"category_scores_gemma":[0.006178228,0.0005230333,0.0009213366,0.001134463,0.0008185734,0.001499802,0.001307402,0.002845433,0.0007778158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007472813,"about_ca_system_score_gemma":0.001308792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001440621,"about_ca_topic_score_gemma":0.001796938,"domain_scores_codex":[0.9985259,0.0006409849,0.00005121689,0.0002275504,0.0004252791,0.0001291432],"domain_scores_gemma":[0.9978289,0.001397723,0.0001258725,0.0002232207,0.000338303,0.0000860548],"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.00007763279,0.0001052164,0.0009479634,0.00009630831,0.0000630673,0.00006766269,0.00007203439,0.8114957,0.001752582,0.05013619,0.003400771,0.1317848],"study_design_scores_gemma":[0.000003668067,0.00001454854,0.0000452652,0.000004303121,0.000003481246,0.000009659537,0.000002901974,0.9803205,0.0003051667,0.01872187,0.0005664114,0.000002408249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003843471,0.0001302893,0.9946316,0.0001140047,0.00002043963,0.0000260247,0.00002592235,0.0002469722,0.000961135],"genre_scores_gemma":[0.2326745,0.0003541395,0.7612092,0.0002836389,0.0001622518,0.0004109608,0.0003244544,0.0002486996,0.004332069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00339865,"threshold_uncertainty_score":0.01797402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}