{"meta":{"query_hash":"cfb1eff8977b","filters":{"venue":"Evolutionary Computation"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/cfb1eff8977b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Evolutionary+Computation"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.050586100689397985,"score_gpt":0.28790428891801184,"score_spread":0.23731818822861386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011407463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019203209,0.0005851784,0.9946311,0.00003358817,0.0003490764,0.0015806291,0.00003472888,0.0008302969,0.000035096105],"genre_scores_gemma":[0.4869851,0.000015916585,0.5125206,0.000016998732,0.00011809701,0.00023933688,0.000047630427,0.00004267523,0.000013628125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864376,0.000081250866,0.00030724326,0.00032331367,0.00025724157,0.00038720146],"domain_scores_gemma":[0.9993624,0.00019333255,0.000034468576,0.00013541637,0.00017443552,0.000099918616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026255942,0.00024727624,0.00021617049,0.00023200458,0.00018747184,0.000036729678,0.00014656186,0.00014825012,0.0000059135273],"category_scores_gemma":[0.000020924203,0.0002784049,0.00009656926,0.00027621715,0.00007400846,0.00020819872,0.000039125167,0.0001782821,0.00004046664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013698406,0.000049754388,0.00000891306,0.000072447496,0.000037519196,0.000007278313,0.00022800686,0.8079615,0.0019073802,0.000028844186,0.00019912743,0.18948548],"study_design_scores_gemma":[0.0011753581,0.00029182684,0.008049383,0.00006465291,0.000025939155,0.000052917723,0.00005235766,0.9815669,0.006271571,0.0020760307,0.000054743057,0.0003183415],"about_ca_topic_score_codex":0.000030606665,"about_ca_topic_score_gemma":0.000004070431,"teacher_disagreement_score":0.48506477,"about_ca_system_score_codex":0.0006367581,"about_ca_system_score_gemma":0.000062940686,"threshold_uncertainty_score":0.9999668},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017658227654193327,"score_gpt":0.2767643156877009,"score_spread":0.25910608803350754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040927350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033350863,0.000026684584,0.9607675,0.0012287694,0.0008250314,0.00027082677,0.000010357032,0.00013352261,0.0033864542],"genre_scores_gemma":[0.86368495,0.0000017185649,0.13596159,0.000037742622,0.0000737549,0.000018281136,0.000028542907,0.000009086814,0.00018433838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982811,0.00018781536,0.00033616915,0.0003159392,0.0006673454,0.00021161504],"domain_scores_gemma":[0.9982231,0.00054400717,0.00017760786,0.00044917944,0.0005361029,0.00006996507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575513,0.00013048066,0.00012064014,0.0002619702,0.00040337146,0.00013635986,0.0005240969,0.00007710917,0.00013453086],"category_scores_gemma":[0.00027919313,0.00010603183,0.00007161181,0.0007928252,0.00015718737,0.0006191915,0.00012378008,0.00036643303,0.000091291775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010142732,0.00017288163,0.00021907566,0.0000062925287,0.000017418104,0.000002133721,0.00015160946,0.3309491,0.0014316052,0.6604006,0.004418184,0.002220898],"study_design_scores_gemma":[0.00018435685,0.000097085096,0.029895002,0.00001134282,0.000007143865,0.000018762938,0.00009682087,0.9304712,0.00013201518,0.038901,0.000072178285,0.00011312146],"about_ca_topic_score_codex":0.00004364574,"about_ca_topic_score_gemma":0.000005495025,"teacher_disagreement_score":0.83033407,"about_ca_system_score_codex":0.00007603343,"about_ca_system_score_gemma":0.00034091243,"threshold_uncertainty_score":0.43238527},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01837479317535437,"score_gpt":0.2662653856347845,"score_spread":0.24789059245943015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049783455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009073727,0.000063085994,0.9621566,0.0022999693,0.00054236915,0.00049848825,0.000012718225,0.00045667417,0.024896361],"genre_scores_gemma":[0.76604706,0.0000074477603,0.23269528,0.000201824,0.00024395596,0.00018217327,0.00023045646,0.000014012671,0.00037775817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808,0.00011484996,0.0003780498,0.0006986448,0.00042545903,0.00030299273],"domain_scores_gemma":[0.9985918,0.00014691627,0.00017537782,0.00047680316,0.00045032063,0.00015881009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025196193,0.00022644008,0.00017401678,0.00018498454,0.0006412557,0.00015580085,0.00062030216,0.00013274515,0.00004069699],"category_scores_gemma":[0.00005849807,0.00023792764,0.00008430666,0.0007868877,0.00015900351,0.0010222527,0.00019855138,0.00039002692,0.00041205285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104213295,0.00041936606,0.00053992035,0.000011592202,0.000023398663,0.000003124413,0.00053367706,0.014443957,0.0033638342,0.96995425,0.0031663268,0.0075301016],"study_design_scores_gemma":[0.0003496135,0.00007327253,0.08481483,0.000007450159,0.000006268199,0.00013480705,0.00016054366,0.89080656,0.000030537743,0.0151918195,0.008151725,0.0002725754],"about_ca_topic_score_codex":0.00003459875,"about_ca_topic_score_gemma":0.00001252654,"teacher_disagreement_score":0.95476246,"about_ca_system_score_codex":0.00011604035,"about_ca_system_score_gemma":0.0002645208,"threshold_uncertainty_score":0.9702408},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023197294246535098,"score_gpt":0.30735210207757235,"score_spread":0.28415480783103725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054273750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96383774,0.00063456927,0.01715084,0.0031457236,0.00031091768,0.0005825073,0.000010068158,0.00010082568,0.014226797],"genre_scores_gemma":[0.99731654,0.00003557997,0.0017474309,0.00032467695,0.0003364846,0.000021280655,0.00006154493,0.000007350534,0.00014912408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977247,0.00071715313,0.00035143032,0.00030334,0.0005496328,0.00035375485],"domain_scores_gemma":[0.99873763,0.00075935497,0.00009151792,0.00013842098,0.00019797041,0.000075124335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031414316,0.00012456295,0.00011193253,0.0001254197,0.0011223351,0.00006458646,0.00017826616,0.00012146951,0.00011262109],"category_scores_gemma":[0.00030186726,0.00011217696,0.000043564167,0.0006244478,0.0005648948,0.00078692293,0.000041928593,0.00022027767,0.00003610788],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005621913,0.00071434677,0.18182558,0.000029360854,0.000022231792,0.000027368671,0.03713045,0.0056670536,0.00025408954,0.750914,0.0061799046,0.016673481],"study_design_scores_gemma":[0.00042548016,0.000059589685,0.9063321,0.000013157533,0.0000076221827,0.000014470695,0.006072495,0.0037990953,0.000003364676,0.069854364,0.01324842,0.00016987242],"about_ca_topic_score_codex":0.00079485215,"about_ca_topic_score_gemma":0.0011201492,"teacher_disagreement_score":0.7245065,"about_ca_system_score_codex":0.0003856007,"about_ca_system_score_gemma":0.00021167658,"threshold_uncertainty_score":0.8632208},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01579169677716093,"score_gpt":0.2768926140270181,"score_spread":0.2611009172498572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084165293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061417567,0.00009438154,0.9909244,0.00036555884,0.00086964347,0.0010297772,0.000042182648,0.00046935808,0.00006291154],"genre_scores_gemma":[0.2819073,0.00002170283,0.71742827,0.00009642571,0.00011455129,0.00013197598,0.00020369621,0.000029223364,0.00006687657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794585,0.000112044814,0.0004447569,0.00079993956,0.00031865455,0.0003787593],"domain_scores_gemma":[0.9981132,0.00028913625,0.00029792718,0.0003171945,0.00080232014,0.00018018899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002668636,0.00028723778,0.00023248224,0.00020479702,0.00057260884,0.0001774531,0.00028874018,0.000110488916,0.000014236832],"category_scores_gemma":[0.0003514225,0.00032268095,0.000071748815,0.0005497517,0.00013371014,0.0018779219,0.00015974087,0.00022054078,0.00000953096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023866052,0.00019200746,0.00030727507,0.000011693781,0.000021536303,0.000002152741,0.000308235,0.98732287,0.00021412938,0.004065083,0.0001156514,0.0074155224],"study_design_scores_gemma":[0.001820532,0.00015598186,0.0027714253,0.000012282281,0.000017386128,0.00004308869,0.000066850684,0.9925848,0.00089257554,0.0011726776,0.00009326395,0.000369104],"about_ca_topic_score_codex":0.000015047833,"about_ca_topic_score_gemma":0.000012252667,"teacher_disagreement_score":0.27576554,"about_ca_system_score_codex":0.00014994906,"about_ca_system_score_gemma":0.00014708981,"threshold_uncertainty_score":0.9999225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041268766819345236,"score_gpt":0.3392185741248197,"score_spread":0.2979498073054745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085361024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004323197,0.000048707632,0.99650943,0.0012477543,0.00023707536,0.0007784315,0.00001679282,0.000106470616,0.0006230091],"genre_scores_gemma":[0.58051306,0.0000015175524,0.41926885,0.00006758232,0.000040364688,0.000043890373,0.00003233071,0.0000066926127,0.000025712017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982091,0.00021386592,0.00047367768,0.00032944547,0.0005298288,0.00024406015],"domain_scores_gemma":[0.9964524,0.002437488,0.0002625352,0.00028204566,0.00049752346,0.00006801384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009325144,0.0001365751,0.00023536378,0.00016291445,0.00034102667,0.00007744529,0.00049320207,0.000056182296,0.000021356747],"category_scores_gemma":[0.00046025144,0.00010908051,0.000080996004,0.00038355484,0.0001578689,0.00016852218,0.000093674666,0.00012361954,0.000014688052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019786048,0.0001153088,0.00005233865,0.0000333336,0.00002968131,2.2115263e-7,0.00022499812,0.41655636,0.00030258868,0.53423345,0.00124227,0.047189645],"study_design_scores_gemma":[0.0005957329,0.00035691517,0.00057124306,0.000020338424,0.000009650335,0.0000053413373,0.00007948673,0.92944103,0.0005648815,0.06763884,0.0006092721,0.000107290885],"about_ca_topic_score_codex":0.0000073394544,"about_ca_topic_score_gemma":0.0000014442714,"teacher_disagreement_score":0.58008075,"about_ca_system_score_codex":0.000051100826,"about_ca_system_score_gemma":0.00015524856,"threshold_uncertainty_score":0.4448174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.050759569294842787,"score_gpt":0.2727213170812062,"score_spread":0.22196174778636343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099840809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002634856,0.00007884064,0.9900254,0.0010686466,0.00074198964,0.00029064587,0.000013305029,0.00039227217,0.0047540455],"genre_scores_gemma":[0.5747187,0.000036255115,0.42235067,0.00022583622,0.00020433134,0.000047900976,0.0002022566,0.000017766464,0.0021962803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978343,0.00024690313,0.00033129865,0.00047685835,0.0008387615,0.00027183068],"domain_scores_gemma":[0.9986502,0.00030519985,0.000120926314,0.0003556298,0.00043338473,0.00013467632],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024931913,0.00015794483,0.00013984866,0.00040338974,0.0006333226,0.000060110964,0.00036402568,0.000066824185,0.00007352488],"category_scores_gemma":[0.00017681826,0.00016675369,0.00006866571,0.00095920294,0.00008082597,0.00072178803,0.00010126137,0.00020187431,0.0011688075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027361988,0.00033511678,0.00025238993,0.0000091803695,0.000031728134,0.00003584151,0.0005104935,0.8718226,0.000027666,0.029077755,0.05686718,0.041002717],"study_design_scores_gemma":[0.00044788086,0.00017494163,0.023226406,0.000007778877,0.000003300383,0.000075502074,0.00002896478,0.9700398,0.00001421364,0.00095994346,0.0048560346,0.00016522697],"about_ca_topic_score_codex":0.000025941492,"about_ca_topic_score_gemma":0.0000015328358,"teacher_disagreement_score":0.57208383,"about_ca_system_score_codex":0.00020555139,"about_ca_system_score_gemma":0.00026449602,"threshold_uncertainty_score":0.9996089},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03178961716159892,"score_gpt":0.33922122399863697,"score_spread":0.3074316068370381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123251383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.306343,0.00025433078,0.6924085,0.0003164888,0.0001479269,0.0003898829,0.000007003517,0.0000536774,0.00007915989],"genre_scores_gemma":[0.6624811,0.000006611101,0.33733606,0.000022520915,0.000061816405,0.000035446752,0.000041640757,0.000007544532,0.0000072138123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978766,0.00017266741,0.0006456822,0.00042824,0.0005365153,0.00034030125],"domain_scores_gemma":[0.9985862,0.00035751204,0.00024851295,0.00043084365,0.0002995412,0.00007738565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008750145,0.00015279741,0.00015867666,0.00028359293,0.00040996543,0.000040576982,0.00049684115,0.00007285051,0.000009457912],"category_scores_gemma":[0.00006251336,0.00014170875,0.00008554868,0.0023132167,0.00018319993,0.0005088951,0.00018541352,0.00021920656,0.0000074065542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039291284,0.0012247787,0.043815125,0.00007375124,0.00007051774,0.000032535274,0.0021713541,0.75405926,0.00417307,0.105507046,0.00040256637,0.088430725],"study_design_scores_gemma":[0.00037293803,0.000018177703,0.33837438,0.000057234258,0.000014956861,0.00013696277,0.00011742263,0.6442813,0.00007904026,0.0163215,0.00006674377,0.00015933278],"about_ca_topic_score_codex":0.0006571775,"about_ca_topic_score_gemma":0.00007687454,"teacher_disagreement_score":0.35613814,"about_ca_system_score_codex":0.0001870751,"about_ca_system_score_gemma":0.00038362446,"threshold_uncertainty_score":0.5778715},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.026917931491045745,"score_gpt":0.2819890344616228,"score_spread":0.25507110297057706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123535420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004873687,0.000016694215,0.9885793,0.0049558533,0.00028526929,0.00073075603,0.000012060236,0.000050515842,0.00049587834],"genre_scores_gemma":[0.8460296,0.0000015275109,0.1533705,0.00026000018,0.00005232307,0.000058384652,0.000013484176,0.000007422757,0.00020675521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985139,0.00031354075,0.0003062304,0.00023280783,0.00047212208,0.00016140922],"domain_scores_gemma":[0.99737823,0.001565518,0.00018024215,0.00035365668,0.0004823328,0.000040006234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080628385,0.00009208719,0.00011478204,0.00006070578,0.0002643667,0.00003979621,0.00066904427,0.000043748118,0.000017644788],"category_scores_gemma":[0.00093750056,0.000055990473,0.00008158297,0.00035128594,0.00018087472,0.000106168394,0.00012940161,0.000118541815,0.000014575508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010700551,0.00012812606,0.00022106164,0.000020350162,0.000017313969,1.7712904e-7,0.00012981516,0.32497615,0.00012047571,0.6663908,0.0036914349,0.0042936406],"study_design_scores_gemma":[0.00034029168,0.00014425449,0.0076606288,0.000020990106,0.0000051002007,0.0000050683925,0.000006522723,0.9618547,0.00009394081,0.029377764,0.0004267662,0.000063996325],"about_ca_topic_score_codex":0.0000043250016,"about_ca_topic_score_gemma":8.351123e-7,"teacher_disagreement_score":0.8411559,"about_ca_system_score_codex":0.000037014688,"about_ca_system_score_gemma":0.00016631378,"threshold_uncertainty_score":0.22832252},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035567672083433144,"score_gpt":0.3086057288146757,"score_spread":0.27303805673124254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124261928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004259702,0.00012788987,0.9932986,0.0013559682,0.00015247638,0.00024689725,0.000050294606,0.00009097258,0.00041719104],"genre_scores_gemma":[0.50932306,0.000007090661,0.49039653,0.000007564151,0.00003176597,0.0000047399135,0.00018502024,0.0000039605566,0.00004026925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981006,0.00018381212,0.0005448316,0.00027737973,0.0007109288,0.00018247378],"domain_scores_gemma":[0.99846256,0.00017885325,0.00034589172,0.00029472786,0.0006434317,0.000074519514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045264425,0.000117231146,0.00021379438,0.00018982704,0.000100048645,0.00002322388,0.00037511595,0.000059828868,0.000039676528],"category_scores_gemma":[0.00021288746,0.00012707154,0.00006910979,0.0008624064,0.0002141746,0.00068477704,0.0001484603,0.00009930415,0.000034528286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010926992,0.00023301145,0.00009359734,0.00004007572,0.000017567085,6.480081e-7,0.00016263909,0.82266474,0.00018182088,0.10948967,0.001633246,0.06547207],"study_design_scores_gemma":[0.00036569918,0.0000835726,0.018575683,0.000019730123,0.0000059078757,0.000010719815,0.000009668091,0.96779406,0.0017019854,0.011115679,0.00021566427,0.00010161945],"about_ca_topic_score_codex":0.00003478484,"about_ca_topic_score_gemma":0.0000011603418,"teacher_disagreement_score":0.50506335,"about_ca_system_score_codex":0.00015551399,"about_ca_system_score_gemma":0.00016165772,"threshold_uncertainty_score":0.51818275},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012970411711664439,"score_gpt":0.25958375829585384,"score_spread":0.2466133465841894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139068682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031676607,0.00021091514,0.9887429,0.0005774709,0.00019965172,0.0002593443,0.0000030067183,0.00042041286,0.0064186417],"genre_scores_gemma":[0.60597944,0.0000018391097,0.39357635,0.00001577446,0.00010984754,0.000016657943,0.000048691112,0.00001024163,0.00024114012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980052,0.00015747518,0.00031364197,0.00045180973,0.00074389105,0.00032796848],"domain_scores_gemma":[0.9988622,0.00013233785,0.00013793535,0.00027601488,0.000521187,0.00007032094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002709088,0.00016780783,0.00014372478,0.0003097725,0.0003212798,0.0003558215,0.00039191337,0.00006163509,0.000028725446],"category_scores_gemma":[0.0000257979,0.00015730597,0.000041675048,0.0010042249,0.00009196152,0.0018719417,0.00008843902,0.00015299207,0.000097607626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001103095,0.00010010244,0.0004343008,0.000011619944,0.000010243296,0.000016729024,0.00004748335,0.804158,0.00012571093,0.19024405,0.0017940074,0.0030467208],"study_design_scores_gemma":[0.0004194214,0.00009957353,0.06499462,0.00001518179,0.0000048940556,0.000067025605,0.000046043882,0.90560687,0.00004205585,0.028240025,0.00027275272,0.00019152506],"about_ca_topic_score_codex":0.00009944594,"about_ca_topic_score_gemma":0.000008004761,"teacher_disagreement_score":0.6028118,"about_ca_system_score_codex":0.00025020508,"about_ca_system_score_gemma":0.0003791508,"threshold_uncertainty_score":0.64147514},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Resampling; Mathematical optimization; Computer science; Mathematics; Algorithm","score_opus":0.038483416312789384,"score_gpt":0.3212428018295873,"score_spread":0.2827593855167979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142265433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004110784,0.0001285674,0.98961025,0.00050326216,0.0005297833,0.00071115914,0.0000073592414,0.00045834057,0.003940476],"genre_scores_gemma":[0.4903013,0.0000019817176,0.50940037,0.00003428325,0.00012422117,0.00006181486,0.000029718154,0.000009324272,0.000036974998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766535,0.00019812699,0.0004882932,0.00045625938,0.0006368008,0.00055516826],"domain_scores_gemma":[0.99874806,0.00034458187,0.00011037983,0.0003100076,0.00026343882,0.00022353703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095758465,0.00018095768,0.0001948237,0.0005812565,0.00018538248,0.00007017731,0.0003550177,0.00009161822,0.000023572737],"category_scores_gemma":[0.00020571635,0.00020236507,0.0000552085,0.0016088681,0.00006155727,0.001088999,0.00022428445,0.00021611864,0.00022001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010907575,0.00019879296,0.00046756663,0.000030606105,0.000020126923,0.0000037402863,0.0009536733,0.770634,0.00022512871,0.22224215,0.0013013138,0.0038138076],"study_design_scores_gemma":[0.0010207894,0.00010858825,0.021352416,0.000023524826,0.000004494363,0.00001039395,0.0002639144,0.97092664,0.000017200971,0.00538893,0.00063789275,0.00024520248],"about_ca_topic_score_codex":0.00005427649,"about_ca_topic_score_gemma":0.000008138104,"teacher_disagreement_score":0.48619053,"about_ca_system_score_codex":0.00051577645,"about_ca_system_score_gemma":0.00041202697,"threshold_uncertainty_score":0.8252208},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00830617923354352,"score_gpt":0.23723669142807108,"score_spread":0.22893051219452756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160074397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050064575,0.0000720192,0.94446325,0.0024969631,0.00069477136,0.0002446064,0.0000042149873,0.0003161426,0.001643454],"genre_scores_gemma":[0.9727857,7.2203846e-7,0.026519598,0.00050650246,0.000062732644,0.000036572827,0.000032486227,0.0000070707933,0.000048583453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998784,0.00014091763,0.00022411197,0.00038287128,0.00023968036,0.00022841763],"domain_scores_gemma":[0.9994203,0.000106296924,0.00009902454,0.00018635028,0.00012242277,0.00006562399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016906158,0.00013754799,0.00013789049,0.00018290397,0.00029130923,0.000047449037,0.00019551504,0.000089742665,0.000004920004],"category_scores_gemma":[0.000025004667,0.00013619706,0.00006342253,0.00046374995,0.000039210136,0.0002856961,0.0000319239,0.0001198154,0.00011081149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026967673,0.00014638196,0.0002482562,0.000010642031,0.000009017727,0.0003025447,0.000114257506,0.9203285,0.00007563615,0.07392583,0.00038909508,0.0044228593],"study_design_scores_gemma":[0.0010246113,0.00031451287,0.00853592,0.000015385067,0.0000045442653,0.0013712411,0.000020587811,0.9415974,0.000008882549,0.046857502,0.000093353214,0.00015605372],"about_ca_topic_score_codex":0.00017735416,"about_ca_topic_score_gemma":0.000060619088,"teacher_disagreement_score":0.92272115,"about_ca_system_score_codex":0.00040160576,"about_ca_system_score_gemma":0.00018229603,"threshold_uncertainty_score":0.55539554},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010317740785484399,"score_gpt":0.26596375357615065,"score_spread":0.25564601279066623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293460382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001319493,0.00016998514,0.99351144,0.0022580172,0.0007348978,0.0012273442,0.00012800624,0.00045311774,0.00019771917],"genre_scores_gemma":[0.112519346,0.000016212698,0.8864199,0.00028644325,0.00019351344,0.0002657716,0.00013380029,0.000030776373,0.00013422377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963737,0.00050281064,0.0006340254,0.0011413941,0.0007298079,0.0006182534],"domain_scores_gemma":[0.9979016,0.00023717212,0.00026710067,0.00061344804,0.0007397973,0.00024084492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042505594,0.0003965878,0.00029998677,0.00033328723,0.00050485105,0.00012320917,0.00085890415,0.00014821136,0.000023767749],"category_scores_gemma":[0.0002006671,0.0003043187,0.00009582197,0.0014039684,0.00016496678,0.0029975509,0.00042424037,0.00015969023,0.00013864614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044926353,0.00025384492,0.00069177226,0.0000031694087,0.00001792465,0.000011942419,0.0006302462,0.9339746,0.000037421123,0.0015083444,0.00063191494,0.06219386],"study_design_scores_gemma":[0.0013304966,0.00021520387,0.056978676,0.000048185724,0.0000074059744,0.000060306364,0.00021085334,0.9366601,0.000021480915,0.003787943,0.00025199962,0.0004273483],"about_ca_topic_score_codex":0.000095572235,"about_ca_topic_score_gemma":0.000035706005,"teacher_disagreement_score":0.111199856,"about_ca_system_score_codex":0.0019325756,"about_ca_system_score_gemma":0.0003019436,"threshold_uncertainty_score":0.9999409},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016413554861362017,"score_gpt":0.2668385528779645,"score_spread":0.25042499801660245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409271889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018634816,0.0002536406,0.9947437,0.0009983516,0.0013354828,0.001297152,0.00009216671,0.00060804246,0.0004851024],"genre_scores_gemma":[0.422995,0.000029320145,0.5762033,0.00003376998,0.00023783738,0.00016921287,0.00019098406,0.00003017192,0.000110437664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969262,0.00032943056,0.00062327966,0.00077895017,0.0008479852,0.0004941935],"domain_scores_gemma":[0.9973058,0.000484902,0.0003516746,0.00037998773,0.001308879,0.00016872412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048262972,0.0002998919,0.00027145434,0.0002552904,0.00046094685,0.00027528167,0.00065565394,0.00012254913,0.000040409162],"category_scores_gemma":[0.00024481423,0.00025242806,0.0001035176,0.00053377374,0.00009768206,0.0021787365,0.00017335745,0.00011512849,0.000027674316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046666933,0.00020988354,0.000039227223,0.000034135894,0.00007714238,0.0000017750842,0.0001120353,0.5753066,0.0003597231,0.39119443,0.027453749,0.0051646135],"study_design_scores_gemma":[0.0017269896,0.0002789752,0.00032243817,0.0000207498,0.000013561964,0.000018376943,0.000016436348,0.7756553,0.00013428395,0.2211131,0.0004281846,0.0002715517],"about_ca_topic_score_codex":0.000017473474,"about_ca_topic_score_gemma":3.43676e-7,"teacher_disagreement_score":0.42280865,"about_ca_system_score_codex":0.00067593186,"about_ca_system_score_gemma":0.00063785625,"threshold_uncertainty_score":0.9999928},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04305681618019019,"score_gpt":0.305783714799549,"score_spread":0.26272689861935883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734645630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054553684,0.00020840683,0.93646765,0.0002860448,0.00063366967,0.00014172224,0.0000078889125,0.00060100877,0.007099938],"genre_scores_gemma":[0.76436716,0.000018146706,0.23517843,0.00003861032,0.00012264086,0.0000056242316,0.00014367887,0.000027011782,0.000098677396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901706,0.000091547285,0.00024701082,0.00020009078,0.0002172496,0.00022701327],"domain_scores_gemma":[0.9994721,0.00008306417,0.00010898203,0.00021324347,0.00007939268,0.000043233333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736202,0.00014854621,0.00014473943,0.000055831697,0.0010093952,0.00011766253,0.00019127844,0.00005257606,0.00013433781],"category_scores_gemma":[0.00008118964,0.00017987899,0.00005175093,0.000069529284,0.000053271368,0.0005808237,0.00009442567,0.00025424175,0.000059652106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040816267,0.000013986741,0.024576856,0.000021698575,0.00002732128,0.000002638124,0.000427149,0.9683162,0.0001848883,0.0004439739,0.00124448,0.004736722],"study_design_scores_gemma":[0.00040912585,0.000013887822,0.09565871,0.00001912557,0.000011060457,0.0000091191505,0.000040884053,0.8980545,0.00008860525,0.0018712765,0.0036467353,0.00017701571],"about_ca_topic_score_codex":0.00015522535,"about_ca_topic_score_gemma":0.000008511499,"teacher_disagreement_score":0.7098135,"about_ca_system_score_codex":0.00018975821,"about_ca_system_score_gemma":0.000019165087,"threshold_uncertainty_score":0.7763554},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018052462115047116,"score_gpt":0.26334435724358846,"score_spread":0.24529189512854133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809097245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012724499,0.00008103146,0.9796234,0.0051584127,0.0008359863,0.00039846965,0.000005441335,0.00043097456,0.0007418345],"genre_scores_gemma":[0.75427324,0.000004107632,0.2439647,0.00040251337,0.00041207258,0.000090625326,0.00012082903,0.000011437985,0.0007204933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790853,0.000095412484,0.0004189473,0.0005778601,0.00055044633,0.00044878488],"domain_scores_gemma":[0.99866253,0.00008145271,0.00012572625,0.0003439489,0.00055835187,0.0002279705],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027464883,0.00019564143,0.00014294761,0.00026543828,0.0013506501,0.00006164236,0.00044014124,0.00006689722,0.00013971956],"category_scores_gemma":[0.000055089447,0.00021370039,0.00007929519,0.00096678076,0.000094321214,0.00059140456,0.00045491324,0.00016406171,0.0018465053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013844183,0.00021051076,0.00018109535,0.0000052809933,0.000037435428,0.0000029784742,0.00039395742,0.79144526,0.0019836898,0.14971992,0.04368608,0.012319926],"study_design_scores_gemma":[0.00034610284,0.00032111572,0.029259583,0.000018622133,0.000008172581,0.000023941642,0.00002454386,0.9467399,0.0001692454,0.009381225,0.013415832,0.0002916905],"about_ca_topic_score_codex":0.00012243954,"about_ca_topic_score_gemma":0.0000094731895,"teacher_disagreement_score":0.7415487,"about_ca_system_score_codex":0.00027917727,"about_ca_system_score_gemma":0.00016367823,"threshold_uncertainty_score":0.99994946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010928380496214942,"score_gpt":0.2596300563978829,"score_spread":0.24870167590166795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2860358344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002705961,0.0015966052,0.9861048,0.00062830024,0.0052446206,0.0026160553,0.000075395605,0.0008778846,0.00015040458],"genre_scores_gemma":[0.33615997,0.000028262417,0.6614496,0.00010216862,0.00061402755,0.0007290889,0.0007161223,0.000089423535,0.00011131444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99342066,0.00093261653,0.0009200064,0.0021962228,0.0017071925,0.0008233042],"domain_scores_gemma":[0.9937002,0.0006659213,0.0010940366,0.0012345859,0.0030655349,0.00023968771],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004575893,0.000996033,0.0007966701,0.0005471338,0.0015362601,0.0005983968,0.0015369029,0.0005379081,0.000033294935],"category_scores_gemma":[0.00013125283,0.0009135124,0.00035122508,0.0013093773,0.0004320683,0.0021696954,0.0024298267,0.0017256665,0.000035851186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042305,0.00073261466,0.0006035536,0.00005320754,0.00024619504,0.00016447912,0.002234121,0.95834833,0.00011976867,0.0006602832,0.00022623032,0.036568925],"study_design_scores_gemma":[0.0017239546,0.00015246974,0.11543206,0.00020035567,0.00011919436,0.00033133503,0.00050157605,0.87878513,0.00005307042,0.0016657605,0.00004995812,0.0009851501],"about_ca_topic_score_codex":0.00037579107,"about_ca_topic_score_gemma":0.000015841224,"teacher_disagreement_score":0.333454,"about_ca_system_score_codex":0.0021633452,"about_ca_system_score_gemma":0.0011395604,"threshold_uncertainty_score":0.9997636},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Aga Khan Foundation","funders":"","keywords":"Computer science; Genetic programming; Intron; Theoretical computer science; Population; Artificial intelligence; Biology; Genetics; Gene","score_opus":0.0064796780933728815,"score_gpt":0.2599060293352423,"score_spread":0.2534263512418694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194342044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61416507,0.00006457777,0.38545373,0.00010482892,0.00005642641,0.000116506955,0.000007434596,0.00001774577,0.00001365908],"genre_scores_gemma":[0.806205,0.000004822367,0.19371003,0.00001266567,0.000012859684,0.000024502478,0.000022094471,0.0000026233608,0.000005401468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988645,0.0001656096,0.00034560435,0.00026835772,0.00024773547,0.0001082362],"domain_scores_gemma":[0.99889004,0.00010638858,0.00018591945,0.00036646024,0.00042034237,0.00003083685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011506234,0.00007528372,0.00015613549,0.00024718046,0.000118947675,0.0000103184275,0.00031229097,0.00004215636,0.000002224618],"category_scores_gemma":[0.0000377151,0.00007044433,0.00009900972,0.004048141,0.00009734347,0.0003504452,0.00010519532,0.00009007795,0.0000010902361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013532992,0.00021589205,0.05543455,0.0000074326176,0.000046763176,8.428051e-7,0.00031728685,0.92557985,0.0013005406,0.012046984,0.0000026344842,0.005045864],"study_design_scores_gemma":[0.00007013643,0.000017795195,0.5207363,0.000008895938,0.000026110105,0.000005263733,0.000035601523,0.47707137,0.000103641556,0.0018794062,0.000009503203,0.00003599194],"about_ca_topic_score_codex":0.0001510741,"about_ca_topic_score_gemma":0.00007321491,"teacher_disagreement_score":0.46530172,"about_ca_system_score_codex":0.00007971967,"about_ca_system_score_gemma":0.00020806913,"threshold_uncertainty_score":0.28726363},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029664006408876446,"score_gpt":0.3041633975792627,"score_spread":0.27449939117038624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225154779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030355406,0.0001425088,0.99370545,0.0022919476,0.00080132333,0.0011414022,0.00018008112,0.00036069655,0.0010730432],"genre_scores_gemma":[0.14006644,0.000009124254,0.8570597,0.00031002198,0.00010955994,0.00077061733,0.0011541116,0.000028018267,0.00049235317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971606,0.0004177878,0.00044824547,0.00065481843,0.0009218501,0.0003967006],"domain_scores_gemma":[0.99812394,0.0005470977,0.00024059099,0.00033495412,0.00061682286,0.00013657162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049744494,0.00019787943,0.00020616964,0.00046994854,0.0012547758,0.00008736319,0.00066986284,0.00005522307,0.00032947218],"category_scores_gemma":[0.00022890016,0.00024305806,0.000114003975,0.0011571884,0.000084138934,0.0008194528,0.000462552,0.00022708821,0.000026235133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005442771,0.00017318748,0.000019417226,0.000011610236,0.000030417561,0.0000051394495,0.00024012507,0.9548139,0.000033987002,0.021564445,0.012051986,0.011001371],"study_design_scores_gemma":[0.0010312385,0.00024855105,0.0010069169,0.000004312076,0.000008982462,0.0000811502,0.00014997815,0.98417383,0.000018610623,0.010177897,0.0028461674,0.00025235937],"about_ca_topic_score_codex":0.000011730974,"about_ca_topic_score_gemma":2.9817622e-7,"teacher_disagreement_score":0.1397629,"about_ca_system_score_codex":0.0006374611,"about_ca_system_score_gemma":0.000578603,"threshold_uncertainty_score":0.99116206},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Algorithm; Computer science; Mathematical optimization; Mathematics","score_opus":0.0628140366402647,"score_gpt":0.40987960846386656,"score_spread":0.34706557182360187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408508783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031297382,0.00007400347,0.9876664,0.0011957961,0.00024467986,0.000573134,0.000053669693,0.0002771785,0.006785352],"genre_scores_gemma":[0.8457808,0.0000018451478,0.15174842,0.00043341029,0.00006549676,0.000102950384,0.00017886715,0.00000811278,0.0016801244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774283,0.00017586241,0.0006444312,0.000526072,0.00074058,0.00017019383],"domain_scores_gemma":[0.9977376,0.00062095094,0.00022910137,0.00026339464,0.0010912883,0.000057706737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279818,0.00015120521,0.00018055494,0.00052647264,0.00045734496,0.00016308835,0.00028147537,0.000118459306,0.000093503404],"category_scores_gemma":[0.00025286054,0.0001463192,0.00012601758,0.0012184386,0.000104907886,0.00043233877,0.000051134462,0.0001314535,0.00016509375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002084287,0.00009808924,0.00020286925,0.0000022306444,0.000010119625,3.7741881e-7,0.00006769386,0.71932846,0.00051665405,0.030258741,0.012698117,0.23679583],"study_design_scores_gemma":[0.00038009815,0.000019731466,0.005813973,0.00000902413,0.000010461906,8.020578e-7,0.00005222462,0.7818143,0.00084585184,0.20832902,0.0026162784,0.0001082625],"about_ca_topic_score_codex":0.000046702156,"about_ca_topic_score_gemma":0.0000041989692,"teacher_disagreement_score":0.84265107,"about_ca_system_score_codex":0.0002487176,"about_ca_system_score_gemma":0.00032067052,"threshold_uncertainty_score":0.5966724},"labels":[],"label_agreement":null}]}