{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002668636,0.0002872378,0.0002324822,0.000204797,0.0005726088,0.0001774531,0.0002887402,0.0001104889,0.00001423683],"category_scores_gemma":[0.0003514225,0.0003226809,0.00007174881,0.0005497517,0.0001337101,0.001877922,0.0001597409,0.0002205408,0.00000953096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499491,"about_ca_system_score_gemma":0.0001470898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001504783,"about_ca_topic_score_gemma":0.00001225267,"domain_scores_codex":[0.9979458,0.0001120448,0.0004447569,0.0007999396,0.0003186546,0.0003787593],"domain_scores_gemma":[0.9981132,0.0002891363,0.0002979272,0.0003171945,0.0008023201,0.000180189],"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.00002386605,0.0001920075,0.0003072751,0.00001169378,0.0000215363,0.000002152741,0.000308235,0.9873229,0.0002141294,0.004065083,0.0001156514,0.007415522],"study_design_scores_gemma":[0.001820532,0.0001559819,0.002771425,0.00001228228,0.00001738613,0.00004308869,0.00006685068,0.9925848,0.0008925755,0.001172678,0.00009326395,0.000369104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006141757,0.00009438154,0.9909244,0.0003655588,0.0008696435,0.001029777,0.00004218265,0.0004693581,0.00006291154],"genre_scores_gemma":[0.2819073,0.00002170283,0.7174283,0.00009642571,0.0001145513,0.000131976,0.0002036962,0.00002922336,0.00006687657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2757655,"threshold_uncertainty_score":0.9999225,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736202,0.0001485462,0.0001447394,0.0000558317,0.001009395,0.0001176625,0.0001912784,0.00005257606,0.0001343378],"category_scores_gemma":[0.00008118964,0.000179879,0.00005175093,0.00006952928,0.00005327137,0.0005808237,0.00009442567,0.0002542417,0.00005965211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001897582,"about_ca_system_score_gemma":0.00001916509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001552254,"about_ca_topic_score_gemma":0.000008511499,"domain_scores_codex":[0.9990171,0.00009154728,0.0002470108,0.0002000908,0.0002172496,0.0002270133],"domain_scores_gemma":[0.9994721,0.00008306417,0.000108982,0.0002132435,0.00007939268,0.00004323333],"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.000004081627,0.00001398674,0.02457686,0.00002169858,0.00002732128,0.000002638124,0.000427149,0.9683162,0.0001848883,0.0004439739,0.00124448,0.004736722],"study_design_scores_gemma":[0.0004091258,0.00001388782,0.09565871,0.00001912557,0.00001106046,0.00000911915,0.00004088405,0.8980545,0.00008860525,0.001871277,0.003646735,0.0001770157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05455368,0.0002084068,0.9364676,0.0002860448,0.0006336697,0.0001417222,0.000007888912,0.0006010088,0.007099938],"genre_scores_gemma":[0.7643672,0.00001814671,0.2351784,0.00003861032,0.0001226409,0.000005624232,0.0001436789,0.00002701178,0.0000986774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7098135,"threshold_uncertainty_score":0.7763554,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004250559,0.0003965878,0.0002999868,0.0003332872,0.0005048511,0.0001232092,0.0008589042,0.0001482114,0.00002376775],"category_scores_gemma":[0.0002006671,0.0003043187,0.00009582197,0.001403968,0.0001649668,0.002997551,0.0004242404,0.0001596902,0.0001386461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001932576,"about_ca_system_score_gemma":0.0003019436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009557224,"about_ca_topic_score_gemma":0.00003570601,"domain_scores_codex":[0.9963737,0.0005028106,0.0006340254,0.001141394,0.0007298079,0.0006182534],"domain_scores_gemma":[0.9979016,0.0002371721,0.0002671007,0.000613448,0.0007397973,0.0002408449],"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.00004492635,0.0002538449,0.0006917723,0.000003169409,0.00001792465,0.00001194242,0.0006302462,0.9339746,0.00003742112,0.001508344,0.0006319149,0.06219386],"study_design_scores_gemma":[0.001330497,0.0002152039,0.05697868,0.00004818572,0.000007405974,0.00006030636,0.0002108533,0.9366601,0.00002148092,0.003787943,0.0002519996,0.0004273483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001319493,0.0001699851,0.9935114,0.002258017,0.0007348978,0.001227344,0.0001280062,0.0004531177,0.0001977192],"genre_scores_gemma":[0.1125193,0.0000162127,0.8864199,0.0002864432,0.0001935134,0.0002657716,0.0001338003,0.00003077637,0.0001342238],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1111999,"threshold_uncertainty_score":0.9999409,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001690616,0.000137548,0.0001378905,0.000182904,0.0002913092,0.00004744904,0.000195515,0.00008974267,0.000004920004],"category_scores_gemma":[0.00002500467,0.0001361971,0.00006342253,0.00046375,0.00003921014,0.0002856961,0.0000319239,0.0001198154,0.0001108115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004016058,"about_ca_system_score_gemma":0.000182296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001773542,"about_ca_topic_score_gemma":0.00006061909,"domain_scores_codex":[0.998784,0.0001409176,0.000224112,0.0003828713,0.0002396804,0.0002284176],"domain_scores_gemma":[0.9994203,0.0001062969,0.00009902454,0.0001863503,0.0001224228,0.00006562399],"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.00002696767,0.000146382,0.0002482562,0.00001064203,0.000009017727,0.0003025447,0.0001142575,0.9203285,0.00007563615,0.07392583,0.0003890951,0.004422859],"study_design_scores_gemma":[0.001024611,0.0003145129,0.00853592,0.00001538507,0.000004544265,0.001371241,0.00002058781,0.9415974,0.000008882549,0.0468575,0.00009335321,0.0001560537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05006457,0.0000720192,0.9444633,0.002496963,0.0006947714,0.0002446064,0.000004214987,0.0003161426,0.001643454],"genre_scores_gemma":[0.9727857,7.220385e-7,0.0265196,0.0005065025,0.00006273264,0.00003657283,0.00003248623,0.000007070793,0.00004858345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9227211,"threshold_uncertainty_score":0.5553955,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002625594,0.0002472762,0.0002161705,0.0002320046,0.0001874718,0.00003672968,0.0001465619,0.0001482501,0.000005913527],"category_scores_gemma":[0.0000209242,0.0002784049,0.00009656926,0.0002762171,0.00007400846,0.0002081987,0.00003912517,0.0001782821,0.00004046664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006367581,"about_ca_system_score_gemma":0.00006294069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003060666,"about_ca_topic_score_gemma":0.000004070431,"domain_scores_codex":[0.9986438,0.00008125087,0.0003072433,0.0003233137,0.0002572416,0.0003872015],"domain_scores_gemma":[0.9993624,0.0001933326,0.00003446858,0.0001354164,0.0001744355,0.00009991862],"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.00001369841,0.00004975439,0.00000891306,0.0000724475,0.0000375192,0.000007278313,0.0002280069,0.8079615,0.00190738,0.00002884419,0.0001991274,0.1894855],"study_design_scores_gemma":[0.001175358,0.0002918268,0.008049383,0.00006465291,0.00002593915,0.00005291772,0.00005235766,0.9815669,0.006271571,0.002076031,0.00005474306,0.0003183415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001920321,0.0005851784,0.9946311,0.00003358817,0.0003490764,0.001580629,0.00003472888,0.0008302969,0.00003509611],"genre_scores_gemma":[0.4869851,0.00001591658,0.5125206,0.00001699873,0.000118097,0.0002393369,0.00004763043,0.00004267523,0.00001362813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4850648,"threshold_uncertainty_score":0.9999668,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002746488,0.0001956414,0.0001429476,0.0002654383,0.00135065,0.00006164236,0.0004401412,0.00006689722,0.0001397196],"category_scores_gemma":[0.00005508945,0.0002137004,0.00007929519,0.0009667808,0.00009432121,0.0005914046,0.0004549132,0.0001640617,0.001846505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002791773,"about_ca_system_score_gemma":0.0001636782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001224395,"about_ca_topic_score_gemma":0.000009473189,"domain_scores_codex":[0.9979085,0.00009541248,0.0004189473,0.0005778601,0.0005504463,0.0004487849],"domain_scores_gemma":[0.9986625,0.00008145271,0.0001257262,0.0003439489,0.0005583519,0.0002279705],"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.00001384418,0.0002105108,0.0001810954,0.000005280993,0.00003743543,0.000002978474,0.0003939574,0.7914453,0.00198369,0.1497199,0.04368608,0.01231993],"study_design_scores_gemma":[0.0003461028,0.0003211157,0.02925958,0.00001862213,0.000008172581,0.00002394164,0.00002454386,0.9467399,0.0001692454,0.009381225,0.01341583,0.0002916905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0127245,0.00008103146,0.9796234,0.005158413,0.0008359863,0.0003984697,0.000005441335,0.0004309746,0.0007418345],"genre_scores_gemma":[0.7542732,0.000004107632,0.2439647,0.0004025134,0.0004120726,0.00009062533,0.000120829,0.00001143799,0.0007204933],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7415487,"threshold_uncertainty_score":0.9999495,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004526442,0.0001172311,0.0002137944,0.000189827,0.0001000486,0.00002322388,0.000375116,0.00005982887,0.00003967653],"category_scores_gemma":[0.0002128875,0.0001270715,0.00006910979,0.0008624064,0.0002141746,0.000684777,0.0001484603,0.00009930415,0.00003452829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000155514,"about_ca_system_score_gemma":0.0001616577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003478484,"about_ca_topic_score_gemma":0.000001160342,"domain_scores_codex":[0.9981006,0.0001838121,0.0005448316,0.0002773797,0.0007109288,0.0001824738],"domain_scores_gemma":[0.9984626,0.0001788533,0.0003458917,0.0002947279,0.0006434317,0.00007451951],"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.00001092699,0.0002330115,0.00009359734,0.00004007572,0.00001756708,6.480081e-7,0.0001626391,0.8226647,0.0001818209,0.1094897,0.001633246,0.06547207],"study_design_scores_gemma":[0.0003656992,0.0000835726,0.01857568,0.00001973012,0.000005907876,0.00001071981,0.000009668091,0.9677941,0.001701985,0.01111568,0.0002156643,0.0001016195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004259702,0.0001278899,0.9932986,0.001355968,0.0001524764,0.0002468973,0.00005029461,0.00009097258,0.000417191],"genre_scores_gemma":[0.5093231,0.000007090661,0.4903965,0.000007564151,0.00003176597,0.000004739913,0.0001850202,0.000003960557,0.00004026925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5050634,"threshold_uncertainty_score":0.5181828,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002709088,0.0001678078,0.0001437248,0.0003097725,0.0003212798,0.0003558215,0.0003919134,0.00006163509,0.00002872545],"category_scores_gemma":[0.0000257979,0.000157306,0.00004167505,0.001004225,0.00009196152,0.001871942,0.00008843902,0.0001529921,0.00009760763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002502051,"about_ca_system_score_gemma":0.0003791508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009944594,"about_ca_topic_score_gemma":0.000008004761,"domain_scores_codex":[0.9980052,0.0001574752,0.000313642,0.0004518097,0.0007438911,0.0003279685],"domain_scores_gemma":[0.9988622,0.0001323379,0.0001379353,0.0002760149,0.000521187,0.00007032094],"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.00001103095,0.0001001024,0.0004343008,0.00001161994,0.0000102433,0.00001672902,0.00004748335,0.804158,0.0001257109,0.190244,0.001794007,0.003046721],"study_design_scores_gemma":[0.0004194214,0.00009957353,0.06499462,0.00001518179,0.000004894056,0.0000670256,0.00004604388,0.9056069,0.00004205585,0.02824003,0.0002727527,0.0001915251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003167661,0.0002109151,0.9887429,0.0005774709,0.0001996517,0.0002593443,0.000003006718,0.0004204129,0.006418642],"genre_scores_gemma":[0.6059794,0.00000183911,0.3935764,0.00001577446,0.0001098475,0.00001665794,0.00004869111,0.00001024163,0.0002411401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6028118,"threshold_uncertainty_score":0.6414751,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002493191,0.0001579448,0.0001398487,0.0004033897,0.0006333226,0.00006011096,0.0003640257,0.00006682418,0.00007352488],"category_scores_gemma":[0.0001768183,0.0001667537,0.00006866571,0.0009592029,0.00008082597,0.000721788,0.0001012614,0.0002018743,0.001168808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002055514,"about_ca_system_score_gemma":0.000264496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002594149,"about_ca_topic_score_gemma":0.000001532836,"domain_scores_codex":[0.9978343,0.0002469031,0.0003312987,0.0004768583,0.0008387615,0.0002718307],"domain_scores_gemma":[0.9986502,0.0003051999,0.0001209263,0.0003556298,0.0004333847,0.0001346763],"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.00002736199,0.0003351168,0.0002523899,0.000009180369,0.00003172813,0.00003584151,0.0005104935,0.8718226,0.000027666,0.02907776,0.05686718,0.04100272],"study_design_scores_gemma":[0.0004478809,0.0001749416,0.02322641,0.000007778877,0.000003300383,0.00007550207,0.00002896478,0.9700398,0.00001421364,0.0009599435,0.004856035,0.000165227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002634856,0.00007884064,0.9900254,0.001068647,0.0007419896,0.0002906459,0.00001330503,0.0003922722,0.004754046],"genre_scores_gemma":[0.5747187,0.00003625511,0.4223507,0.0002258362,0.0002043313,0.00004790098,0.0002022566,0.00001776646,0.00219628],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5720838,"threshold_uncertainty_score":0.9996089,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519619,0.0002264401,0.0001740168,0.0001849845,0.0006412557,0.0001558009,0.0006203022,0.0001327451,0.00004069699],"category_scores_gemma":[0.00005849807,0.0002379276,0.00008430666,0.0007868877,0.0001590035,0.001022253,0.0001985514,0.0003900269,0.0004120528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001160403,"about_ca_system_score_gemma":0.0002645208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003459875,"about_ca_topic_score_gemma":0.00001252654,"domain_scores_codex":[0.99808,0.00011485,0.0003780498,0.0006986448,0.000425459,0.0003029927],"domain_scores_gemma":[0.9985918,0.0001469163,0.0001753778,0.0004768032,0.0004503206,0.0001588101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001042133,0.0004193661,0.0005399204,0.0000115922,0.00002339866,0.000003124413,0.0005336771,0.01444396,0.003363834,0.9699543,0.003166327,0.007530102],"study_design_scores_gemma":[0.0003496135,0.00007327253,0.08481483,0.000007450159,0.000006268199,0.0001348071,0.0001605437,0.8908066,0.00003053774,0.01519182,0.008151725,0.0002725754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009073727,0.00006308599,0.9621566,0.002299969,0.0005423691,0.0004984883,0.00001271822,0.0004566742,0.02489636],"genre_scores_gemma":[0.7660471,0.00000744776,0.2326953,0.000201824,0.000243956,0.0001821733,0.0002304565,0.00001401267,0.0003777582],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9547625,"threshold_uncertainty_score":0.9702408,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009325144,0.0001365751,0.0002353638,0.0001629145,0.0003410267,0.00007744529,0.0004932021,0.0000561823,0.00002135675],"category_scores_gemma":[0.0004602514,0.0001090805,0.000080996,0.0003835548,0.0001578689,0.0001685222,0.00009367467,0.0001236195,0.00001468805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005110083,"about_ca_system_score_gemma":0.0001552486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007339454,"about_ca_topic_score_gemma":0.000001444271,"domain_scores_codex":[0.9982091,0.0002138659,0.0004736777,0.0003294455,0.0005298288,0.0002440602],"domain_scores_gemma":[0.9964524,0.002437488,0.0002625352,0.0002820457,0.0004975235,0.00006801384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001978605,0.0001153088,0.00005233865,0.0000333336,0.00002968131,2.211526e-7,0.0002249981,0.4165564,0.0003025887,0.5342335,0.00124227,0.04718965],"study_design_scores_gemma":[0.0005957329,0.0003569152,0.0005712431,0.00002033842,0.000009650335,0.000005341337,0.00007948673,0.929441,0.0005648815,0.06763884,0.0006092721,0.0001072909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004323197,0.00004870763,0.9965094,0.001247754,0.0002370754,0.0007784315,0.00001679282,0.0001064706,0.0006230091],"genre_scores_gemma":[0.5805131,0.000001517552,0.4192688,0.00006758232,0.00004036469,0.00004389037,0.00003233071,0.000006692613,0.00002571202],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5800807,"threshold_uncertainty_score":0.4448174,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004826297,0.0002998919,0.0002714543,0.0002552904,0.0004609468,0.0002752817,0.0006556539,0.0001225491,0.00004040916],"category_scores_gemma":[0.0002448142,0.0002524281,0.0001035176,0.0005337737,0.00009768206,0.002178736,0.0001733574,0.0001151285,0.00002767432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006759319,"about_ca_system_score_gemma":0.0006378563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001747347,"about_ca_topic_score_gemma":3.43676e-7,"domain_scores_codex":[0.9969262,0.0003294306,0.0006232797,0.0007789502,0.0008479852,0.0004941935],"domain_scores_gemma":[0.9973058,0.000484902,0.0003516746,0.0003799877,0.001308879,0.0001687241],"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.00004666693,0.0002098835,0.00003922722,0.00003413589,0.00007714238,0.000001775084,0.0001120353,0.5753066,0.0003597231,0.3911944,0.02745375,0.005164613],"study_design_scores_gemma":[0.00172699,0.0002789752,0.0003224382,0.0000207498,0.00001356196,0.00001837694,0.00001643635,0.7756553,0.000134284,0.2211131,0.0004281846,0.0002715517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001863482,0.0002536406,0.9947437,0.0009983516,0.001335483,0.001297152,0.00009216671,0.0006080425,0.0004851024],"genre_scores_gemma":[0.422995,0.00002932014,0.5762033,0.00003376998,0.0002378374,0.0001692129,0.0001909841,0.00003017192,0.0001104377],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4228086,"threshold_uncertainty_score":0.9999928,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008750145,0.0001527974,0.0001586767,0.0002835929,0.0004099654,0.00004057698,0.0004968412,0.00007285051,0.000009457912],"category_scores_gemma":[0.00006251336,0.0001417087,0.00008554868,0.002313217,0.0001831999,0.0005088951,0.0001854135,0.0002192066,0.000007406554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001870751,"about_ca_system_score_gemma":0.0003836245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006571775,"about_ca_topic_score_gemma":0.00007687454,"domain_scores_codex":[0.9978766,0.0001726674,0.0006456822,0.00042824,0.0005365153,0.0003403013],"domain_scores_gemma":[0.9985862,0.000357512,0.000248513,0.0004308436,0.0002995412,0.00007738565],"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.00003929128,0.001224779,0.04381512,0.00007375124,0.00007051774,0.00003253527,0.002171354,0.7540593,0.00417307,0.105507,0.0004025664,0.08843073],"study_design_scores_gemma":[0.000372938,0.0000181777,0.3383744,0.00005723426,0.00001495686,0.0001369628,0.0001174226,0.6442813,0.00007904026,0.0163215,0.00006674377,0.0001593328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.306343,0.0002543308,0.6924085,0.0003164888,0.0001479269,0.0003898829,0.000007003517,0.0000536774,0.00007915989],"genre_scores_gemma":[0.6624811,0.000006611101,0.3373361,0.00002252092,0.0000618164,0.00003544675,0.00004164076,0.000007544532,0.000007213812],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3561381,"threshold_uncertainty_score":0.5778715,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001150623,0.00007528372,0.0001561355,0.0002471805,0.0001189477,0.00001031843,0.000312291,0.00004215636,0.000002224618],"category_scores_gemma":[0.0000377151,0.00007044433,0.00009900972,0.004048141,0.00009734347,0.0003504452,0.0001051953,0.00009007795,0.000001090236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007971967,"about_ca_system_score_gemma":0.0002080691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001510741,"about_ca_topic_score_gemma":0.00007321491,"domain_scores_codex":[0.9988645,0.0001656096,0.0003456043,0.0002683577,0.0002477355,0.0001082362],"domain_scores_gemma":[0.99889,0.0001063886,0.0001859194,0.0003664602,0.0004203424,0.00003083685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.000001353299,0.0002158921,0.05543455,0.000007432618,0.00004676318,8.428051e-7,0.0003172868,0.9255798,0.001300541,0.01204698,0.000002634484,0.005045864],"study_design_scores_gemma":[0.00007013643,0.0000177952,0.5207363,0.000008895938,0.0000261101,0.000005263733,0.00003560152,0.4770714,0.0001036416,0.001879406,0.000009503203,0.00003599194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6141651,0.00006457777,0.3854537,0.0001048289,0.00005642641,0.000116507,0.000007434596,0.00001774577,0.00001365908],"genre_scores_gemma":[0.806205,0.000004822367,0.19371,0.00001266567,0.00001285968,0.00002450248,0.00002209447,0.000002623361,0.000005401468],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4653017,"threshold_uncertainty_score":0.2872636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575513,0.0001304807,0.0001206401,0.0002619702,0.0004033715,0.0001363599,0.0005240969,0.00007710917,0.0001345309],"category_scores_gemma":[0.0002791931,0.0001060318,0.00007161181,0.0007928252,0.0001571874,0.0006191915,0.0001237801,0.000366433,0.00009129177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007603343,"about_ca_system_score_gemma":0.0003409124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004364574,"about_ca_topic_score_gemma":0.000005495025,"domain_scores_codex":[0.9982811,0.0001878154,0.0003361691,0.0003159392,0.0006673454,0.000211615],"domain_scores_gemma":[0.9982231,0.0005440072,0.0001776079,0.0004491794,0.0005361029,0.00006996507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001014273,0.0001728816,0.0002190757,0.000006292529,0.0000174181,0.000002133721,0.0001516095,0.3309491,0.001431605,0.6604006,0.004418184,0.002220898],"study_design_scores_gemma":[0.0001843568,0.0000970851,0.029895,0.00001134282,0.000007143865,0.00001876294,0.00009682087,0.9304712,0.0001320152,0.038901,0.00007217829,0.0001131215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03335086,0.00002668458,0.9607675,0.001228769,0.0008250314,0.0002708268,0.00001035703,0.0001335226,0.003386454],"genre_scores_gemma":[0.863685,0.000001718565,0.1359616,0.00003774262,0.0000737549,0.00001828114,0.00002854291,0.000009086814,0.0001843384],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8303341,"threshold_uncertainty_score":0.4323853,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009575846,0.0001809577,0.0001948237,0.0005812565,0.0001853825,0.00007017731,0.0003550177,0.00009161822,0.00002357274],"category_scores_gemma":[0.0002057164,0.0002023651,0.0000552085,0.001608868,0.00006155727,0.001088999,0.0002242844,0.0002161186,0.00022001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005157765,"about_ca_system_score_gemma":0.000412027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005427649,"about_ca_topic_score_gemma":0.000008138104,"domain_scores_codex":[0.9976653,0.000198127,0.0004882932,0.0004562594,0.0006368008,0.0005551683],"domain_scores_gemma":[0.9987481,0.0003445819,0.0001103798,0.0003100076,0.0002634388,0.000223537],"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.0001090758,0.000198793,0.0004675666,0.0000306061,0.00002012692,0.000003740286,0.0009536733,0.770634,0.0002251287,0.2222421,0.001301314,0.003813808],"study_design_scores_gemma":[0.001020789,0.0001085882,0.02135242,0.00002352483,0.000004494363,0.00001039395,0.0002639144,0.9709266,0.00001720097,0.00538893,0.0006378928,0.0002452025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004110784,0.0001285674,0.9896103,0.0005032622,0.0005297833,0.0007111591,0.000007359241,0.0004583406,0.003940476],"genre_scores_gemma":[0.4903013,0.000001981718,0.5094004,0.00003428325,0.0001242212,0.00006181486,0.00002971815,0.000009324272,0.000036975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4861905,"threshold_uncertainty_score":0.8252208,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003141432,0.000124563,0.0001119325,0.0001254197,0.001122335,0.00006458646,0.0001782662,0.0001214695,0.0001126211],"category_scores_gemma":[0.0003018673,0.000112177,0.00004356417,0.0006244478,0.0005648948,0.0007869229,0.00004192859,0.0002202777,0.00003610788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003856007,"about_ca_system_score_gemma":0.0002116766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007948522,"about_ca_topic_score_gemma":0.001120149,"domain_scores_codex":[0.9977247,0.0007171531,0.0003514303,0.00030334,0.0005496328,0.0003537548],"domain_scores_gemma":[0.9987376,0.000759355,0.00009151792,0.000138421,0.0001979704,0.00007512434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0005621913,0.0007143468,0.1818256,0.00002936085,0.00002223179,0.00002736867,0.03713045,0.005667054,0.0002540895,0.750914,0.006179905,0.01667348],"study_design_scores_gemma":[0.0004254802,0.00005958969,0.9063321,0.00001315753,0.000007622183,0.00001447069,0.006072495,0.003799095,0.000003364676,0.06985436,0.01324842,0.0001698724],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9638377,0.0006345693,0.01715084,0.003145724,0.0003109177,0.0005825073,0.00001006816,0.0001008257,0.0142268],"genre_scores_gemma":[0.9973165,0.00003557997,0.001747431,0.0003246769,0.0003364846,0.00002128066,0.00006154493,0.000007350534,0.0001491241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7245065,"threshold_uncertainty_score":0.8632208,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008062838,0.00009208719,0.000114782,0.00006070578,0.0002643667,0.00003979621,0.0006690443,0.00004374812,0.00001764479],"category_scores_gemma":[0.0009375006,0.00005599047,0.00008158297,0.0003512859,0.0001808747,0.0001061684,0.0001294016,0.0001185418,0.00001457551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003701469,"about_ca_system_score_gemma":0.0001663138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004325002,"about_ca_topic_score_gemma":8.351123e-7,"domain_scores_codex":[0.9985139,0.0003135407,0.0003062304,0.0002328078,0.0004721221,0.0001614092],"domain_scores_gemma":[0.9973782,0.001565518,0.0001802421,0.0003536567,0.0004823328,0.00004000623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001070055,0.0001281261,0.0002210616,0.00002035016,0.00001731397,1.77129e-7,0.0001298152,0.3249761,0.0001204757,0.6663908,0.003691435,0.004293641],"study_design_scores_gemma":[0.0003402917,0.0001442545,0.007660629,0.00002099011,0.000005100201,0.000005068393,0.000006522723,0.9618547,0.00009394081,0.02937776,0.0004267662,0.00006399633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004873687,0.00001669422,0.9885793,0.004955853,0.0002852693,0.000730756,0.00001206024,0.00005051584,0.0004958783],"genre_scores_gemma":[0.8460296,0.000001527511,0.1533705,0.0002600002,0.00005232307,0.00005838465,0.00001348418,0.000007422757,0.0002067552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8411559,"threshold_uncertainty_score":0.2283225,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004575893,0.000996033,0.0007966701,0.0005471338,0.00153626,0.0005983968,0.001536903,0.0005379081,0.00003329493],"category_scores_gemma":[0.0001312528,0.0009135124,0.0003512251,0.001309377,0.0004320683,0.002169695,0.002429827,0.001725666,0.00003585119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002163345,"about_ca_system_score_gemma":0.00113956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003757911,"about_ca_topic_score_gemma":0.00001584122,"domain_scores_codex":[0.9934207,0.0009326165,0.0009200064,0.002196223,0.001707193,0.0008233042],"domain_scores_gemma":[0.9937002,0.0006659213,0.001094037,0.001234586,0.003065535,0.0002396877],"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.000042305,0.0007326147,0.0006035536,0.00005320754,0.000246195,0.0001644791,0.002234121,0.9583483,0.0001197687,0.0006602832,0.0002262303,0.03656892],"study_design_scores_gemma":[0.001723955,0.0001524697,0.1154321,0.0002003557,0.0001191944,0.000331335,0.0005015761,0.8787851,0.00005307042,0.001665761,0.00004995812,0.0009851501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002705961,0.001596605,0.9861048,0.0006283002,0.005244621,0.002616055,0.0000753956,0.0008778846,0.0001504046],"genre_scores_gemma":[0.33616,0.00002826242,0.6614496,0.0001021686,0.0006140276,0.0007290889,0.0007161223,0.00008942353,0.0001113144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.333454,"threshold_uncertainty_score":0.9997636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004974449,0.0001978794,0.0002061696,0.0004699485,0.001254776,0.00008736319,0.0006698628,0.00005522307,0.0003294722],"category_scores_gemma":[0.0002289002,0.0002430581,0.000114004,0.001157188,0.00008413893,0.0008194528,0.000462552,0.0002270882,0.00002623513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006374611,"about_ca_system_score_gemma":0.000578603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001173097,"about_ca_topic_score_gemma":2.981762e-7,"domain_scores_codex":[0.9971606,0.0004177878,0.0004482455,0.0006548184,0.0009218501,0.0003967006],"domain_scores_gemma":[0.9981239,0.0005470977,0.000240591,0.0003349541,0.0006168229,0.0001365716],"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.00005442771,0.0001731875,0.00001941723,0.00001161024,0.00003041756,0.00000513945,0.0002401251,0.9548139,0.000033987,0.02156444,0.01205199,0.01100137],"study_design_scores_gemma":[0.001031238,0.000248551,0.001006917,0.000004312076,0.000008982462,0.0000811502,0.0001499782,0.9841738,0.00001861062,0.0101779,0.002846167,0.0002523594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003035541,0.0001425088,0.9937055,0.002291948,0.0008013233,0.001141402,0.0001800811,0.0003606965,0.001073043],"genre_scores_gemma":[0.1400664,0.000009124254,0.8570597,0.000310022,0.0001095599,0.0007706173,0.001154112,0.00002801827,0.0004923532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1397629,"threshold_uncertainty_score":0.9911621,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279818,0.0001512052,0.0001805549,0.0005264726,0.000457345,0.0001630883,0.0002814754,0.0001184593,0.0000935034],"category_scores_gemma":[0.0002528605,0.0001463192,0.0001260176,0.001218439,0.0001049079,0.0004323388,0.00005113446,0.0001314535,0.0001650937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002487176,"about_ca_system_score_gemma":0.0003206705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004670216,"about_ca_topic_score_gemma":0.000004198969,"domain_scores_codex":[0.9977428,0.0001758624,0.0006444312,0.000526072,0.00074058,0.0001701938],"domain_scores_gemma":[0.9977376,0.0006209509,0.0002291014,0.0002633946,0.001091288,0.00005770674],"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.00002084287,0.00009808924,0.0002028693,0.000002230644,0.00001011962,3.774188e-7,0.00006769386,0.7193285,0.0005166541,0.03025874,0.01269812,0.2367958],"study_design_scores_gemma":[0.0003800982,0.00001973147,0.005813973,0.00000902413,0.00001046191,8.020578e-7,0.00005222462,0.7818143,0.0008458518,0.208329,0.002616278,0.0001082625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003129738,0.00007400347,0.9876664,0.001195796,0.0002446799,0.000573134,0.00005366969,0.0002771785,0.006785352],"genre_scores_gemma":[0.8457808,0.000001845148,0.1517484,0.0004334103,0.00006549676,0.0001029504,0.0001788672,0.00000811278,0.001680124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8426511,"threshold_uncertainty_score":0.5966724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}