{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"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":"cfb1eff8977b","filters":{"venue":"Evolutionary Computation"}},"results":[{"id":"W2084165293","doi":"10.1162/evco.2010.18.1.18105","title":"Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization","year":2010,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Particle swarm optimization; Evolutionary algorithm; Mathematical optimization; Pareto principle; Multi-swarm optimization; Convergence (economics); Imperialist competitive algorithm; Multi-objective optimization; Computer science; Metaheuristic; Mathematics; Algorithm","authors":[{"name":"Ahmed Elhossini","is_ca":true},{"name":"Shawki Areibi","is_ca":true},{"name":"R.D. Dony","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01579169677716093,"gpt":0.2768926140270181,"spread":0.2611009172498572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104789,0.0008467049,0.000661664,0.0009676185,0.0004317499,0.0009154942,0.0008962252,0.001100521,0.001393619],"category_scores_gemma":[0.002226365,0.000306808,0.0009975923,0.000989027,0.0004899783,0.001170522,0.0008392724,0.0009036878,0.0005443759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003420499,"about_ca_system_score_gemma":0.0005726683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009460457,"about_ca_topic_score_gemma":0.001015317,"domain_scores_codex":[0.9992198,0.0002448916,0.00004569973,0.00007481304,0.0003805539,0.00003419688],"domain_scores_gemma":[0.9993967,0.0002928461,0.00005999121,0.00007674121,0.0001481821,0.00002543899],"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.0001075672,0.0001157185,0.001752582,0.0003654931,0.0002876187,0.0002133963,0.00008273021,0.5848208,0.01257445,0.06880432,0.00295482,0.3279205],"study_design_scores_gemma":[0.00002176923,0.0001012866,0.0007393072,0.00002320005,0.00003350445,0.0001908692,0.00001614561,0.9730889,0.003873237,0.01310466,0.008787201,0.00001987253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009955412,0.001291032,0.9807361,0.0001435278,0.0000997454,0.00005750151,0.00002699348,0.0001865693,0.007503042],"genre_scores_gemma":[0.3950142,0.001862413,0.5939463,0.0001970186,0.0001375677,0.0003455787,0.000209229,0.0001297811,0.008158007],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001393619,"threshold_uncertainty_score":0.005541861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2734645630","doi":"10.1162/evco_a_00215","title":"Leveraging TSP Solver Complementarity through Machine Learning","year":2017,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Solver; Leverage (statistics); Computer science; Benchmark (surveying); Complementarity (molecular biology); Euclidean geometry; Mathematical optimization; Problem solver; Set (abstract data type); Travelling salesman problem; Parallel computing; Algorithm; Artificial intelligence; Mathematics; Computational science","authors":[{"name":"Pascal Kerschke","is_ca":false},{"name":"Lars Kotthoff","is_ca":true},{"name":"Jakob Bossek","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Heike Trautmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04305681618019019,"gpt":0.305783714799549,"spread":0.2627268986193588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002905632,0.001299632,0.001339929,0.00132067,0.0006065547,0.001528222,0.00170428,0.001361581,0.002770838],"category_scores_gemma":[0.01084912,0.0004673853,0.0007312036,0.001456839,0.001127102,0.001934953,0.001708994,0.001802451,0.0006544723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008118157,"about_ca_system_score_gemma":0.002078843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003035596,"about_ca_topic_score_gemma":0.004281706,"domain_scores_codex":[0.9981511,0.0007321557,0.00008529182,0.0002685448,0.000564967,0.0001978653],"domain_scores_gemma":[0.9949158,0.003561232,0.0004665187,0.0004897384,0.0004453743,0.0001213158],"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.00009664924,0.0001368915,0.001914828,0.000178416,0.00005636161,0.0000619424,0.00003811319,0.8986169,0.001081776,0.009724985,0.002829649,0.08526354],"study_design_scores_gemma":[0.00001047665,0.0000336024,0.0001005341,0.00000858957,0.000006807401,0.00001337156,0.000008808895,0.9962885,0.0005001024,0.002360066,0.0006658383,0.000003298104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2343079,0.003776695,0.7232198,0.001761684,0.0003584524,0.0002799329,0.0003656948,0.004779456,0.03115038],"genre_scores_gemma":[0.762931,0.000705101,0.2313084,0.0005155154,0.0001696008,0.0001959951,0.000659795,0.0003496003,0.003164881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003035596,"threshold_uncertainty_score":0.01536667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293460382","doi":"10.1162/evco_a_00175","title":"Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front","year":2016,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Ministry of Economic Affairs","keywords":"Multi-objective optimization; Evolutionary algorithm; Weighting; Mathematical optimization; Nadir; Weight; Metric (unit); Mathematics; Set (abstract data type); Function (biology); Genetic algorithm; Pareto principle; Algorithm; Weight function; Global optimization; Computer science; Statistics","authors":[{"name":"Rubén Saborido","is_ca":true},{"name":"Ana Belén Mirete Ruíz","is_ca":false},{"name":"Mariano Luque","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0103177407854844,"gpt":0.2659637535761507,"spread":0.2556460127906662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282548,0.001362598,0.001223993,0.001349583,0.0005311359,0.0008552,0.001174964,0.001242678,0.001455793],"category_scores_gemma":[0.001409401,0.0003385538,0.001437442,0.001208571,0.0005558973,0.0009062492,0.0009205666,0.001168859,0.0003654801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005604441,"about_ca_system_score_gemma":0.001069209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002557947,"about_ca_topic_score_gemma":0.002293789,"domain_scores_codex":[0.9994575,0.0001689236,0.00002260949,0.00009050345,0.0002057208,0.0000546874],"domain_scores_gemma":[0.9996961,0.0001234624,0.00003049284,0.00003784086,0.00009384944,0.00001814477],"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.00004753794,0.00005147882,0.001102973,0.0001320483,0.0001331617,0.000119496,0.00009926739,0.8103809,0.005098554,0.01547043,0.001515538,0.1658486],"study_design_scores_gemma":[0.00001834129,0.00008026058,0.0002912719,0.00002599068,0.00002887249,0.00009015304,0.00002060523,0.9879154,0.001555575,0.005270364,0.004688466,0.00001458372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008262783,0.0004289896,0.9888905,0.00005898923,0.00005180789,0.00004947723,0.00002211174,0.0002589037,0.00197646],"genre_scores_gemma":[0.2027866,0.0006928256,0.7914828,0.0001338141,0.00005166303,0.0003660962,0.0002190787,0.0001460774,0.004120967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002557947,"threshold_uncertainty_score":0.00678283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160074397","doi":"10.1162/106365604773955157","title":"Dynamic Subset Selection Based on a Fitness Case Topology","year":2004,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Deutsche Forschungsgemeinschaft","keywords":"Selection (genetic algorithm); Topology (electrical circuits); Computer science; Mathematical optimization; Mathematics; Evolutionary biology; Artificial intelligence; Biology; Combinatorics","authors":[{"name":"Christian W. G. Lasarczyk","is_ca":false},{"name":"Peter Dittrich","is_ca":false},{"name":"Wolfgang Banzhaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00830617923354352,"gpt":0.2372366914280711,"spread":0.2289305121945276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868472,0.0006399863,0.0008711166,0.001405511,0.0005290514,0.0009279466,0.00102596,0.0006527861,0.001942363],"category_scores_gemma":[0.009399509,0.000378353,0.0007695438,0.000716863,0.0006428656,0.001533822,0.0009947395,0.0006725573,0.0003884218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000480243,"about_ca_system_score_gemma":0.0006016452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007313173,"about_ca_topic_score_gemma":0.000998179,"domain_scores_codex":[0.9988551,0.0004075016,0.00008284938,0.0001535943,0.0004317393,0.00006911578],"domain_scores_gemma":[0.9952833,0.002735578,0.0002704315,0.0008301754,0.0006934173,0.0001872017],"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.0002991869,0.0003205866,0.01360083,0.000138893,0.0001756931,0.0005018429,0.0004259001,0.4606825,0.04839829,0.01701242,0.001735238,0.4567088],"study_design_scores_gemma":[0.0000387013,0.0003621931,0.003275934,0.00002607818,0.00007915813,0.0004233634,0.0001157628,0.9702156,0.01331745,0.008577106,0.003541423,0.00002724613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2666842,0.0002057858,0.7267283,0.0003489227,0.00004572301,0.0002720306,0.000091621,0.0007821883,0.004841199],"genre_scores_gemma":[0.7144206,0.0001570165,0.2828662,0.00007474969,0.00003675355,0.0003465884,0.0003032435,0.0001075801,0.001687318],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001942363,"threshold_uncertainty_score":0.009881556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011407463","doi":"10.1162/1063656041774947","title":"Effective Memetic Algorithms for VLSI Design = Genetic Algorithms + Local Search + Multi-Level Clustering","year":2004,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Memetic algorithm; Local search (optimization); Cluster analysis; Computer science; Very-large-scale integration; Algorithm; sort; Population; Genetic algorithm; Tabu search; Constructive; Evolutionary algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Process (computing)","authors":[{"name":"Shawki Areibi","is_ca":true},{"name":"Zhen Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05058610068939799,"gpt":0.2879042889180118,"spread":0.2373181882286139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004682914,0.0007065806,0.0006354062,0.000653378,0.0003344823,0.001117178,0.00091958,0.00113583,0.004582126],"category_scores_gemma":[0.0009868762,0.0002476106,0.0004687917,0.001268819,0.0007335728,0.001051432,0.0005438459,0.0009309984,0.001875177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005947622,"about_ca_system_score_gemma":0.0004772575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007550746,"about_ca_topic_score_gemma":0.000993547,"domain_scores_codex":[0.9997264,0.00009092251,0.00001005248,0.00004067865,0.0001161983,0.00001587662],"domain_scores_gemma":[0.9997744,0.0001090613,0.00002491537,0.00003775194,0.00004779676,0.000006089798],"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.00004255283,0.00005508163,0.0004169225,0.0005911448,0.0001133148,0.0001328533,0.0001156225,0.3849849,0.007948953,0.1271233,0.01094824,0.4675271],"study_design_scores_gemma":[0.00006401434,0.00009869632,0.0004990897,0.0001485553,0.00005481811,0.000535202,0.00005230202,0.7795419,0.007912289,0.1328207,0.07823411,0.00003830759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005123288,0.006934913,0.9648207,0.000970651,0.0002710402,0.00009690051,0.00005962681,0.0006465343,0.02107643],"genre_scores_gemma":[0.2158294,0.009299618,0.7498239,0.0006967965,0.0003851573,0.0004967304,0.000231808,0.000238373,0.02299829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004582126,"threshold_uncertainty_score":0.01532876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2809097245","doi":"10.1162/evco_a_00232","title":"Emergent Solutions to High-Dimensional Multitask Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":39,"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":"Reinforcement learning; Computer science; Artificial intelligence; Task (project management); Neuroevolution; Representation (politics); Face (sociological concept); Machine learning; A priori and a posteriori; Artificial neural network","authors":[{"name":"Stephen Kelly","is_ca":true},{"name":"Malcolm I. Heywood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01805246211504712,"gpt":0.2633443572435885,"spread":0.2452918951285413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009203601,0.0006009598,0.0006759759,0.000314115,0.0003926518,0.0007592522,0.0009821025,0.0009939437,0.001961748],"category_scores_gemma":[0.003287642,0.0003147667,0.0004715197,0.0002096687,0.001079871,0.0006723561,0.001337981,0.001138829,0.0001568022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008437319,"about_ca_system_score_gemma":0.0008087515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00210814,"about_ca_topic_score_gemma":0.002480783,"domain_scores_codex":[0.9996849,0.0001292879,0.00001558064,0.00005881278,0.00005224182,0.00005919333],"domain_scores_gemma":[0.9986674,0.0008096903,0.000188879,0.00009691218,0.0001215011,0.0001155768],"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.0000301525,0.00002966369,0.0006226606,0.00003207452,0.00003149464,0.00006853536,0.00005430359,0.960117,0.0007133347,0.0307063,0.0005324724,0.007061993],"study_design_scores_gemma":[0.000009063062,0.000009807471,0.00006835898,0.000002333988,0.000002486153,0.000006955069,0.000009607675,0.9829914,0.00009244428,0.01658435,0.0002209319,0.000002230742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0811915,0.00017165,0.9124926,0.000597336,0.00005113515,0.00004180891,0.00005849081,0.0002400867,0.005155415],"genre_scores_gemma":[0.9250739,0.0001279855,0.07076025,0.0001254922,0.00003067999,0.0001794286,0.00007241527,0.00005420003,0.003575792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00210814,"threshold_uncertainty_score":0.00656265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124261928","doi":"10.1162/1063656053583423","title":"Space Complexity of Estimation of Distribution Algorithms","year":2005,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":37,"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":"EDAS; Estimation of distribution algorithm; Algorithm; Bayesian network; Mathematics; Computational complexity theory; Mathematical optimization; Computer science; Evolutionary algorithm; Distribution (mathematics); Space (punctuation); Genetic algorithm; Artificial intelligence","authors":[{"name":"Yong Gao","is_ca":true},{"name":"Joseph Culberson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03556767208343314,"gpt":0.3086057288146757,"spread":0.2730380567312425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006792772,0.001080369,0.001607506,0.001534428,0.0009975529,0.003633027,0.001829717,0.001695127,0.005276692],"category_scores_gemma":[0.05170126,0.0006187924,0.001134401,0.001809519,0.002152626,0.006881652,0.002853932,0.00282796,0.0009457159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002516453,"about_ca_system_score_gemma":0.002728899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00338147,"about_ca_topic_score_gemma":0.002340961,"domain_scores_codex":[0.9904717,0.005033244,0.0005601854,0.001000769,0.002485918,0.0004481835],"domain_scores_gemma":[0.9413996,0.04980444,0.001638368,0.003940267,0.002807372,0.0004099505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00069423,0.0001599979,0.004079658,0.0004239774,0.0001523114,0.0001165741,0.0003864517,0.6342404,0.002635574,0.1914137,0.00322968,0.1624674],"study_design_scores_gemma":[0.00004522009,0.00007219235,0.0004431935,0.00002823458,0.0000212282,0.00005125247,0.00007282097,0.9049729,0.001289867,0.09174398,0.001242061,0.00001710208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06274954,0.001243504,0.9265388,0.001844019,0.00007187196,0.0001823444,0.0002830202,0.0008206514,0.006266286],"genre_scores_gemma":[0.6419573,0.00123843,0.3508425,0.000390842,0.0001648779,0.0005404531,0.0008755919,0.0003856713,0.003604386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006792772,"threshold_uncertainty_score":0.03592402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139068682","doi":"10.1162/evco.2006.14.3.291","title":"Optimum Tracking with Evolution Strategies","year":2006,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":29,"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; Deutsche Forschungsgemeinschaft","keywords":"Evolution strategy; Mathematical optimization; Simple (philosophy); Adaptation (eye); Tracking (education); Computer science; Population; Contrast (vision); Task (project management); Scaling; Evolutionary algorithm; Optimization problem; Mathematics; Artificial intelligence; Engineering","authors":[{"name":"Dirk V. Arnold","is_ca":true},{"name":"Hans-Georg Beyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01297041171166444,"gpt":0.2595837582958538,"spread":0.2466133465841894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006551,0.0007652722,0.000812789,0.0006872627,0.0003371616,0.001079483,0.0006730892,0.001233044,0.001783155],"category_scores_gemma":[0.004295809,0.000463009,0.0005664682,0.000789439,0.0008691272,0.001277976,0.001051119,0.0007667741,0.0004551721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000717163,"about_ca_system_score_gemma":0.0006521195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001166707,"about_ca_topic_score_gemma":0.0007896944,"domain_scores_codex":[0.9994773,0.000211008,0.0000288262,0.00008400035,0.0001664713,0.00003244685],"domain_scores_gemma":[0.9993064,0.0004682852,0.00007832925,0.00006318379,0.0000675024,0.0000161977],"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.00003685989,0.0000280399,0.0003267238,0.0001025895,0.00005056755,0.00006460573,0.00007985553,0.8116509,0.002356339,0.1146841,0.001013909,0.06960556],"study_design_scores_gemma":[0.00001924054,0.00004059308,0.0001052438,0.00001852942,0.00001377612,0.00004144502,0.000009261826,0.9546034,0.0006663197,0.04112504,0.003346883,0.00001038762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009202098,0.0008743079,0.9812525,0.00018365,0.00004272986,0.00003628249,0.00001288452,0.0001624241,0.008233134],"genre_scores_gemma":[0.4310774,0.002196375,0.5566168,0.0002284952,0.00009973893,0.0004215014,0.00007103,0.0001365519,0.009152131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001783155,"threshold_uncertainty_score":0.005965292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099840809","doi":"10.1162/evco.2008.16.2.151","title":"Step Length Adaptation on Ridge Functions","year":2008,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Adaptation (eye); Ridge; Computer science; Scaling; Point (geometry); Local adaptation; Selection (genetic algorithm); Algorithm; Mathematics; Artificial intelligence; Biology; Geography; Cartography; Neuroscience; Population; Geometry","authors":[{"name":"Dirk V. Arnold","is_ca":true},{"name":"Alexander MacLeod","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05075956929484279,"gpt":0.2727213170812062,"spread":0.2219617477863634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054164,0.0004428528,0.0004609641,0.0004683944,0.0002939311,0.0007039117,0.000776363,0.0007743078,0.001095206],"category_scores_gemma":[0.005834291,0.000209405,0.0004931507,0.0005158962,0.0008439441,0.001147271,0.0007400711,0.0009047631,0.000413309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004027816,"about_ca_system_score_gemma":0.000396203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006509865,"about_ca_topic_score_gemma":0.000508424,"domain_scores_codex":[0.9995222,0.000164632,0.00002379531,0.00009589986,0.000153372,0.00004013041],"domain_scores_gemma":[0.9980872,0.001155489,0.0001901072,0.0002552713,0.0002530118,0.00005883981],"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.00007607725,0.00005745285,0.001297564,0.00009042577,0.00006216408,0.00009261271,0.0001156816,0.7157131,0.02413574,0.06973121,0.0007739768,0.187854],"study_design_scores_gemma":[0.000006131959,0.00005056489,0.0003109533,0.000008500961,0.000007074075,0.00004375313,0.000008527911,0.9825716,0.003168921,0.01277664,0.001037342,0.000009840469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02884261,0.0003642033,0.9680737,0.00008961177,0.00002908059,0.00002793795,0.000008807262,0.000161795,0.002402244],"genre_scores_gemma":[0.7143202,0.0006339177,0.2794206,0.0001415255,0.00007502098,0.0001311755,0.0000482924,0.0001575235,0.005071659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001095206,"threshold_uncertainty_score":0.005575061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049783455","doi":"10.1162/evco_a_00016","title":"Classification as Clustering: A Pareto Cooperative-Competitive GP Approach","year":2010,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Benchmarking; Computer science; Machine learning; Cluster analysis; Artificial intelligence; Pareto principle; Benchmark (surveying); Coevolution; Task (project management); Population; Evolutionary algorithm; Genetic programming; Multi-objective optimization; Mathematical optimization; Mathematics","authors":[{"name":"Andrew R. McIntyre","is_ca":true},{"name":"Malcolm I. Heywood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01837479317535437,"gpt":0.2662653856347845,"spread":0.2478905924594302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001918521,0.0008958943,0.001265908,0.001469875,0.0008490074,0.001551975,0.00237593,0.002109097,0.0014485],"category_scores_gemma":[0.004024204,0.0004450425,0.000839106,0.001394413,0.001226977,0.001327245,0.001420543,0.001141608,0.0003819968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001511629,"about_ca_system_score_gemma":0.001223941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004318358,"about_ca_topic_score_gemma":0.003226435,"domain_scores_codex":[0.9991022,0.0003389974,0.00002791674,0.0001707585,0.0002719023,0.00008829009],"domain_scores_gemma":[0.9990357,0.0004559626,0.00008879888,0.000115918,0.0002404671,0.00006316854],"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.00002368211,0.00005531803,0.0006937635,0.00004596517,0.00006372557,0.00009782448,0.0001659376,0.89892,0.001092058,0.04637014,0.001520515,0.05095109],"study_design_scores_gemma":[0.000006185287,0.00001207074,0.00007866952,0.000004564461,0.000006550634,0.00002208077,0.00001726111,0.9848615,0.0001589277,0.0141973,0.0006310609,0.000003912905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02235752,0.0002261005,0.9696202,0.000556644,0.0000306946,0.0000857348,0.00003392952,0.0001494902,0.006939683],"genre_scores_gemma":[0.5905125,0.0004168416,0.3985101,0.0004524722,0.00009664737,0.000461904,0.0001651099,0.000116024,0.009268216],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004318358,"threshold_uncertainty_score":0.01096773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085361024","doi":"10.1162/evco_a_00139","title":"Comparison of Constraint-Handling Mechanisms for the (1,λ)-ES on a Simple Constrained Problem","year":2014,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","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":"Dalhousie University","funders":"","keywords":"Constraint (computer-aided design); Mathematical optimization; Truncation (statistics); Computation; Computer science; Simple (philosophy); Adaptation (eye); Fitness function; Mathematics; Evolutionary computation; Function (biology); Field (mathematics); Algorithm; Genetic algorithm; Machine learning","authors":[{"name":"Michael Hellwig","is_ca":false},{"name":"Dirk V. Arnold","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04126876681934524,"gpt":0.3392185741248197,"spread":0.2979498073054745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144434,0.000728647,0.0007520366,0.0008362732,0.0003050542,0.0009667244,0.001490424,0.001572282,0.001683681],"category_scores_gemma":[0.007514602,0.0002236035,0.0006192547,0.0008167851,0.0006079027,0.001305829,0.0007362239,0.0008091289,0.0002048478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007566541,"about_ca_system_score_gemma":0.0006943865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001323645,"about_ca_topic_score_gemma":0.001212506,"domain_scores_codex":[0.9994258,0.0002560504,0.00003472729,0.00006717893,0.0001557628,0.00006060262],"domain_scores_gemma":[0.9956858,0.00357916,0.0002411521,0.0002224154,0.0001976263,0.00007379688],"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.0002219447,0.0001254422,0.0005404061,0.000223886,0.00006372019,0.00008407825,0.0001230613,0.899199,0.00407995,0.03300346,0.000353709,0.06198137],"study_design_scores_gemma":[0.00002469097,0.00009934217,0.0001777744,0.00001240253,0.00001234459,0.00002926652,0.00002205679,0.9954951,0.001149322,0.002577117,0.0003906643,0.000009906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2135536,0.001460336,0.772787,0.0002682024,0.0000630251,0.0001820032,0.00004543785,0.0003997176,0.01124069],"genre_scores_gemma":[0.7613796,0.0007392133,0.2354787,0.00008874905,0.00002874579,0.0001616673,0.00005298573,0.0001120972,0.001958254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002144434,"threshold_uncertainty_score":0.01134104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2409271889","doi":"10.1162/evco_a_00187","title":"Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems","year":2016,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","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":"McGill University","funders":"","keywords":"Mathematical optimization; Computer science; Combinatorial optimization; Local search (optimization); Memetic algorithm; Evolutionary algorithm; Population; Optimization problem; Context (archaeology); Greedy randomized adaptive search procedure; Greedy algorithm; Mathematics","authors":[{"name":"Vitor N. Coelho","is_ca":false},{"name":"Igor Machado Coelho","is_ca":false},{"name":"Marcone Jamilson Freitas Souza","is_ca":false},{"name":"Thiago Azevedo de Oliveira","is_ca":false},{"name":"Luciano Perdig�ão Cota","is_ca":false},{"name":"Marwan Haddad","is_ca":false},{"name":"Nenad Mladenović","is_ca":false},{"name":"Rodrigo Silva","is_ca":true},{"name":"Frederico Gadelha Guimarães","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01641355486136202,"gpt":0.2668385528779645,"spread":0.2504249980166025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866382,0.0005328056,0.000523938,0.0005912822,0.0002544146,0.0005260652,0.0009957004,0.0005891353,0.000663096],"category_scores_gemma":[0.001580036,0.0002194289,0.0004280658,0.0005067296,0.0005928077,0.0005814263,0.0006475421,0.0004596657,0.0001311478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004804886,"about_ca_system_score_gemma":0.0004208648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00158605,"about_ca_topic_score_gemma":0.001414803,"domain_scores_codex":[0.9997765,0.00009699733,0.000009339309,0.00002527874,0.00007486944,0.00001699971],"domain_scores_gemma":[0.9995961,0.0002553514,0.00004676191,0.0000329544,0.00005088161,0.00001800188],"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.00002506823,0.00003997518,0.0005594632,0.00003461709,0.00005627794,0.00006217832,0.00008436194,0.9271333,0.002692772,0.02562206,0.0004770756,0.04321291],"study_design_scores_gemma":[0.000006160805,0.00002242372,0.00005586726,0.00000334984,0.000004617513,0.00001480489,0.000006157169,0.9963141,0.0002920718,0.002896294,0.0003815379,0.000002638322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0466682,0.0003959447,0.948863,0.0001370694,0.00002799771,0.000046444,0.00001143181,0.0001366622,0.003713283],"genre_scores_gemma":[0.6880773,0.0003872411,0.3075723,0.0001321843,0.00003122847,0.0002863357,0.00005254912,0.00007740075,0.003383375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00158605,"threshold_uncertainty_score":0.003631353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123251383","doi":"10.1162/evco.2007.15.2.199","title":"Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database","year":2007,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genetic programming; Computer science; Graph; Graph database; Theoretical computer science; Artificial intelligence","authors":[{"name":"Jens Niehaus","is_ca":false},{"name":"Christian Igel","is_ca":false},{"name":"Wolfgang Banzhaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03178961716159892,"gpt":0.339221223998637,"spread":0.3074316068370381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742172,0.0004628611,0.0007523843,0.0006462418,0.0004153575,0.001450323,0.001460562,0.0009401297,0.00263504],"category_scores_gemma":[0.008380109,0.0003194216,0.0004381003,0.001154183,0.001025846,0.003160293,0.001617103,0.001137398,0.0004462771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008509139,"about_ca_system_score_gemma":0.001450036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004017024,"about_ca_topic_score_gemma":0.004009758,"domain_scores_codex":[0.9989873,0.0004390924,0.00004793348,0.0001869157,0.000253594,0.00008523596],"domain_scores_gemma":[0.9970861,0.001889845,0.0001312474,0.0005120051,0.0002899347,0.00009094081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001888924,0.0001968945,0.003965044,0.0001150388,0.00004700075,0.0002044987,0.0002524553,0.6167067,0.006852253,0.1030324,0.00178356,0.2666553],"study_design_scores_gemma":[0.00003569069,0.00008604168,0.0004451045,0.00001083482,0.00003468536,0.00008239576,0.00008658528,0.9372287,0.004432701,0.0555523,0.001989244,0.00001573119],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.163701,0.0002276009,0.8292408,0.0004439365,0.00004777718,0.00009744071,0.00007788241,0.001431982,0.004731662],"genre_scores_gemma":[0.598004,0.0003124228,0.3984607,0.0001499975,0.00001994663,0.0001884715,0.0002236772,0.0002814156,0.00235939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004017024,"threshold_uncertainty_score":0.009213567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3194342044","doi":"10.1162/evco_a_00296","title":"An Analysis of the Influence of Noneffective Instructions in Linear Genetic Programming","year":2021,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Aga Khan Foundation","funders":"","keywords":"Computer science; Genetic programming; Intron; Theoretical computer science; Population; Artificial intelligence; Biology; Genetics; Gene","authors":[{"name":"Léo Françoso Dal Piccol Sotto","is_ca":false},{"name":"Franz Rothlauf","is_ca":false},{"name":"Vinícius Veloso de Melo","is_ca":true},{"name":"Márcio P. Basgalupp","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006479678093372881,"gpt":0.2599060293352423,"spread":0.2534263512418694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00164961,0.0005364395,0.0003936465,0.0005608225,0.0003304803,0.0008422201,0.0006054885,0.0005226085,0.0009032717],"category_scores_gemma":[0.01937573,0.0002830097,0.0004064906,0.0004083646,0.0009827806,0.0006771255,0.000406445,0.0008867363,0.00007298528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008544038,"about_ca_system_score_gemma":0.0008365888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003699128,"about_ca_topic_score_gemma":0.002647185,"domain_scores_codex":[0.9990712,0.0003951193,0.00003375367,0.0001203883,0.0002242469,0.0001552029],"domain_scores_gemma":[0.9743843,0.0230775,0.0009962879,0.0004445259,0.0007853802,0.0003120965],"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.0001926543,0.0001135368,0.003985212,0.00009170284,0.00005318693,0.0001579358,0.00007360053,0.96616,0.008712093,0.006033244,0.0001935365,0.01423333],"study_design_scores_gemma":[0.000007458783,0.00009478385,0.001338536,0.000006677134,0.0000236275,0.00002493789,0.00001558313,0.9943454,0.002632157,0.001384308,0.0001204703,0.000006077258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9126976,0.0006854873,0.07963596,0.0002722128,0.00002673968,0.00003102038,0.00005408956,0.0002892113,0.006307731],"genre_scores_gemma":[0.9922637,0.0001134501,0.007200186,0.00002369306,0.000006621108,0.00001573555,0.00003642057,0.00004294672,0.0002972843],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003699128,"threshold_uncertainty_score":0.008724034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040927350","doi":"10.1162/evco_a_00023","title":"On the Behaviour of Evolution Strategies Optimising Cigar Functions","year":2010,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"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":"Hessian matrix; Eigenvalues and eigenvectors; Quadratic equation; Mathematics; Regular polygon; Applied mathematics; Mathematical optimization; Adaptation (eye); Multiplicity (mathematics); Convex function; Computer science; Mathematical analysis; Geometry; Physics","authors":[{"name":"Dirk V. Arnold","is_ca":true},{"name":"Hans-Georg Beyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01765822765419333,"gpt":0.2767643156877009,"spread":0.2591060880335075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480014,0.0006733804,0.0007103934,0.0008142808,0.0003714924,0.0008769028,0.0005138636,0.001047112,0.0008068176],"category_scores_gemma":[0.008145447,0.0002554683,0.0004052102,0.000533601,0.0009572689,0.0007203683,0.000395002,0.0005495724,0.0002063144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006564292,"about_ca_system_score_gemma":0.0003922876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002951654,"about_ca_topic_score_gemma":0.001365423,"domain_scores_codex":[0.9996469,0.0001509475,0.00001543311,0.00003867169,0.00009326257,0.00005466835],"domain_scores_gemma":[0.9967314,0.002642841,0.0001989139,0.0001108017,0.0002668261,0.00004916854],"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.0000609531,0.00003924817,0.000780094,0.00005252727,0.00003916674,0.00008839712,0.00009404989,0.9650086,0.00645637,0.009838979,0.0001430367,0.01739858],"study_design_scores_gemma":[0.000005647256,0.00005993009,0.0002557796,0.000007517674,0.000009381611,0.00002566562,0.00001631974,0.9954901,0.002113185,0.001819385,0.0001895363,0.000007388937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6559212,0.001976256,0.3245998,0.0003498382,0.00005362506,0.00007460127,0.00002301876,0.000247401,0.01675418],"genre_scores_gemma":[0.9732336,0.0006095124,0.02441092,0.00005879441,0.00001171422,0.0000361958,0.00003290006,0.00004967055,0.001556734],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002951654,"threshold_uncertainty_score":0.007827163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142265433","doi":"10.1162/evco_a_00088","title":"Resampling versus Repair in Evolution Strategies Applied to a Constrained Linear Problem","year":2012,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Resampling; Mathematical optimization; Computer science; Mathematics; Algorithm","authors":[{"name":"Dirk V. Arnold","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03848341631278938,"gpt":0.3212428018295873,"spread":0.2827593855167979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002865323,0.0006106651,0.000613047,0.0006420498,0.0002918613,0.0006141783,0.0007153425,0.001043043,0.0008497832],"category_scores_gemma":[0.01247957,0.0002445684,0.000522404,0.0004688342,0.001004857,0.0007479745,0.0005065408,0.0005903643,0.0001105883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006570888,"about_ca_system_score_gemma":0.0003273158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001903704,"about_ca_topic_score_gemma":0.001168947,"domain_scores_codex":[0.9993227,0.0004203939,0.0000225755,0.00006579995,0.0001073072,0.00006124823],"domain_scores_gemma":[0.9923644,0.006760254,0.0004270734,0.0001855988,0.000177512,0.0000851121],"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.00008260761,0.00006324063,0.0008162679,0.00007317861,0.00005281444,0.0001058861,0.0001703988,0.934278,0.003725146,0.03241257,0.000178097,0.02804184],"study_design_scores_gemma":[0.00000905506,0.00009896886,0.0001440711,0.000006355514,0.000008370283,0.00002545583,0.00001566182,0.9941414,0.0008653598,0.004504921,0.0001742751,0.000006087953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2476666,0.0008793866,0.7465411,0.0003540137,0.00003694078,0.00008735275,0.000009392174,0.0001643331,0.004260968],"genre_scores_gemma":[0.8893317,0.0003028115,0.1084004,0.00008728734,0.00001747491,0.0001061777,0.00001854469,0.0000492353,0.001686302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002865323,"threshold_uncertainty_score":0.01515347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054273750","doi":"10.1162/evco.2007.15.3.321","title":"Crossover and Evolutionary Stability in the Prisoner's Dilemma","year":2007,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":8,"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; McGill University; Université du Québec à Montréal","funders":"","keywords":"Crossover; Population; Stability (learning theory); Prisoner's dilemma; Evolutionary algorithm; Metastability; Dilemma; Iterated function; Mathematics; Evolutionary biology; Mathematical optimization; Statistical physics; Computer science; Biology; Physics; Artificial intelligence; Machine learning; Demography","authors":[{"name":"Xavier Thibert‐Plante","is_ca":true},{"name":"Paul Charbonneau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0231972942465351,"gpt":0.3073521020775724,"spread":0.2841548078310372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002262977,0.0003515081,0.000538658,0.0007029866,0.0008190582,0.001071944,0.0004887476,0.0007484939,0.001132114],"category_scores_gemma":[0.01508224,0.0002089936,0.000333583,0.0003586638,0.001611642,0.001284125,0.0008323356,0.0006192503,0.00007907166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009210623,"about_ca_system_score_gemma":0.0004995308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001543945,"about_ca_topic_score_gemma":0.0008401285,"domain_scores_codex":[0.9995193,0.0002872969,0.00001670786,0.00004620388,0.00006429423,0.00006613699],"domain_scores_gemma":[0.9927717,0.005905846,0.0006247422,0.0002181958,0.0002154114,0.0002641373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003763209,0.0001206699,0.01474278,0.00006370037,0.0001129096,0.0005159425,0.0009507404,0.8881297,0.005685834,0.07607275,0.0003506042,0.01287805],"study_design_scores_gemma":[0.0001515006,0.0003196397,0.003777868,0.00002084913,0.00004823854,0.0001556934,0.0002369159,0.9267275,0.001176832,0.06685844,0.0004905722,0.00003594009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9823372,0.0001972242,0.01477859,0.0002248229,0.00001193765,0.00001747994,0.00001244172,0.00004008875,0.002380151],"genre_scores_gemma":[0.9978611,0.00005178029,0.001862669,0.00001247826,0.000003143976,0.00001190506,0.000006127464,0.000006099833,0.0001846877],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002262977,"threshold_uncertainty_score":0.0119679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123535420","doi":"10.1162/evco_a_00125","title":"On the Behaviour of the (1, λ)-ES for Conically Constrained Linear Problems","year":2014,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"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":"Mathematics; Mathematical optimization; Convergence (economics); Applied mathematics; Rate of convergence; Invariant (physics); Resampling; Computer science; Algorithm; Key (lock)","authors":[{"name":"Dirk V. Arnold","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02691793149104574,"gpt":0.2819890344616228,"spread":0.2550711029705771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003973251,0.0007296977,0.0007139447,0.0007971199,0.0004422752,0.000943394,0.0009289804,0.001357545,0.001823587],"category_scores_gemma":[0.02417408,0.0003039183,0.0004835817,0.0006301888,0.001474311,0.001279172,0.0009383846,0.001101434,0.0002230377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008586789,"about_ca_system_score_gemma":0.0006719787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731227,"about_ca_topic_score_gemma":0.001568547,"domain_scores_codex":[0.9995845,0.000206909,0.00002000259,0.00005322642,0.00008643985,0.00004901886],"domain_scores_gemma":[0.9861664,0.0122862,0.0006243881,0.0002213235,0.0004915215,0.000210278],"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.00006258673,0.00003305296,0.0008217479,0.00008391267,0.00003147914,0.0001156936,0.0001158687,0.9521874,0.002586686,0.03111956,0.000562746,0.01227935],"study_design_scores_gemma":[0.00000483302,0.00003424019,0.0001735143,0.00001644006,0.000004935817,0.00003136826,0.00001953848,0.9936572,0.0003487543,0.005569368,0.0001344002,0.000005510803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3124778,0.001795039,0.6670973,0.001063132,0.00007441418,0.0001034059,0.00007542574,0.0002860119,0.01702755],"genre_scores_gemma":[0.9182925,0.0006982352,0.07761445,0.000240233,0.0000332579,0.00009768293,0.00008594205,0.0001188062,0.002818795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003973251,"threshold_uncertainty_score":0.02101278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2860358344","doi":"10.1162/evco_a_00301","title":"Evolving Multimodal Robot Behavior via Many Stepping Stones with the Combinatorial Multiobjective Evolutionary Algorithm","year":2021,"lang":"en","type":"preprint","venue":"Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":7,"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":"National Science Foundation","keywords":"Leverage (statistics); Artificial intelligence; Evolutionary robotics; Robotics; Computer science; Reinforcement learning; Evolutionary algorithm; Task (project management); Selection (genetic algorithm); Machine learning; Process (computing); Robot; Mathematical optimization; Mathematics","authors":[{"name":"Joost Huizinga","is_ca":false},{"name":"Jeff Clune","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01092838049621494,"gpt":0.2596300563978829,"spread":0.2487016759016679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105123,0.0008981062,0.0008645065,0.0006807947,0.0003835109,0.0007243856,0.001001734,0.0009491429,0.001419079],"category_scores_gemma":[0.002158269,0.0003990502,0.0008038312,0.0004597433,0.0008699122,0.0006189771,0.0009958873,0.0008275022,0.000186893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006259296,"about_ca_system_score_gemma":0.0007911285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002116641,"about_ca_topic_score_gemma":0.001859338,"domain_scores_codex":[0.9996589,0.0001667291,0.00001602365,0.00004723968,0.00007820056,0.00003291878],"domain_scores_gemma":[0.9994325,0.0003546715,0.00005416415,0.00004892142,0.00006705265,0.00004263516],"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.00001314704,0.00002175871,0.0003010227,0.00002080548,0.00002725201,0.000037933,0.00002706157,0.9798957,0.001010517,0.007192671,0.0001786457,0.01127352],"study_design_scores_gemma":[0.000006900445,0.00001432347,0.00004555967,0.000003036863,0.000003825736,0.000006716547,0.000004463904,0.9971734,0.0001351596,0.002410424,0.0001936632,0.000002583273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05799733,0.0002589624,0.9365528,0.0002254206,0.00003936907,0.00008805527,0.00002399657,0.0002369237,0.004577145],"genre_scores_gemma":[0.555726,0.0002262785,0.4403898,0.000179648,0.00002557045,0.0004831807,0.00007935884,0.00008747833,0.002802816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002116641,"threshold_uncertainty_score":0.005559504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225154779","doi":"10.1162/evco_a_00311","title":"Active Sets for Explicitly Constrained Evolutionary Optimization","year":2022,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Set (abstract data type); Active set method; Computer science; Mathematical optimization; Evolutionary algorithm; Optimization problem; Black box; Constrained optimization problem; Evolution strategy; Mathematics; Algorithm; Artificial intelligence; Nonlinear programming","authors":[{"name":"Patrick Spettel","is_ca":false},{"name":"Zehao Ba","is_ca":true},{"name":"Dirk V. Arnold","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02966400640887645,"gpt":0.3041633975792627,"spread":0.2744993911703862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002252367,0.001759563,0.001349329,0.001322141,0.0006699357,0.00199277,0.002113576,0.002709978,0.009744567],"category_scores_gemma":[0.007099298,0.0007783371,0.001372728,0.001642335,0.001854052,0.002034498,0.002589501,0.004766849,0.002610978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007711473,"about_ca_system_score_gemma":0.000994151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008859121,"about_ca_topic_score_gemma":0.0008716056,"domain_scores_codex":[0.9987727,0.0005676965,0.00006547511,0.000102366,0.0004486701,0.0000430666],"domain_scores_gemma":[0.9971099,0.002177041,0.0001771992,0.0002175953,0.000259198,0.00005895658],"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.00005148379,0.00006181532,0.0002110077,0.0004421291,0.00009715265,0.0001005059,0.00011749,0.5498977,0.004763643,0.3424823,0.005043394,0.09673134],"study_design_scores_gemma":[0.00001733275,0.00002315449,0.00004479255,0.00006419119,0.00001175474,0.00004744686,0.000009954237,0.8937387,0.001482753,0.09177741,0.01276355,0.00001893231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000474549,0.0005063246,0.9954482,0.0001396153,0.00006128228,0.00003833623,0.00003122792,0.0001284873,0.003172042],"genre_scores_gemma":[0.08734869,0.002153359,0.8998687,0.0004387042,0.0002299802,0.001096588,0.0002957474,0.0003853722,0.008182908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009744567,"threshold_uncertainty_score":0.03259879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408508783","doi":"10.1162/evco_a_00371","title":"MO-SMAC: Multiobjective Sequential Model-Based Algorithm Configuration","year":2025,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":3,"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":"Algorithm; Computer science; Mathematical optimization; Mathematics","authors":[{"name":"Jeroen Rook","is_ca":false},{"name":"Carolin Benjamins","is_ca":false},{"name":"Jakob Bossek","is_ca":false},{"name":"Heike Trautmann","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Marius Lindauer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0628140366402647,"gpt":0.4098796084638666,"spread":0.3470655718236019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001919671,0.001894924,0.00151565,0.001601466,0.0007455361,0.001170379,0.002747491,0.00166595,0.005623864],"category_scores_gemma":[0.004392134,0.0008343816,0.001289234,0.0009645995,0.001060865,0.00126268,0.002193157,0.001665672,0.0009247913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189443,"about_ca_system_score_gemma":0.002191025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003423796,"about_ca_topic_score_gemma":0.005427985,"domain_scores_codex":[0.9989318,0.0004285902,0.00004261348,0.0001609098,0.0003192417,0.0001167504],"domain_scores_gemma":[0.9978369,0.001208095,0.0001998436,0.0003507833,0.0002937407,0.0001107741],"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.00007879861,0.00007292268,0.0006180911,0.00007531539,0.00005275044,0.00004725129,0.00004069479,0.9421037,0.001479094,0.004557179,0.001282434,0.04959178],"study_design_scores_gemma":[0.0000143753,0.0000384436,0.00006035322,0.000007022711,0.000006610774,0.00001583871,0.000005577352,0.9971845,0.0005537581,0.001613235,0.0004951102,0.000005122832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02978201,0.0002863524,0.959715,0.0001814674,0.00006309192,0.0002669727,0.0001190443,0.003171897,0.00641413],"genre_scores_gemma":[0.4679017,0.0001577697,0.5272287,0.0001961707,0.00004326062,0.0007845011,0.0004183683,0.0005091759,0.002760258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005623864,"threshold_uncertainty_score":0.01881373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}