{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005123288,0.006934913,0.96482074,0.000970651,0.00027104025,0.000096900505,0.00005962681,0.0006465343,0.021076433],"genre_scores_gemma":[0.21582945,0.009299618,0.74982387,0.0006967965,0.0003851573,0.0004967304,0.00023180801,0.00023837303,0.02299829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972636,0.00009092251,0.000010052478,0.000040678653,0.000116198324,0.000015876618],"domain_scores_gemma":[0.9997744,0.00010906128,0.000024915365,0.00003775194,0.000047796755,0.0000060897983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046829143,0.00070658064,0.0006354062,0.00065337797,0.0003344823,0.0011171785,0.00091958,0.0011358297,0.0045821257],"category_scores_gemma":[0.0009868762,0.00024761056,0.0004687917,0.0012688187,0.0007335728,0.0010514321,0.0005438459,0.00093099836,0.0018751775],"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.000042552827,0.000055081633,0.0004169225,0.00059114484,0.0001133148,0.00013285331,0.000115622504,0.3849849,0.007948953,0.12712327,0.010948239,0.46752712],"study_design_scores_gemma":[0.00006401434,0.00009869632,0.00049908966,0.00014855534,0.000054818112,0.000535202,0.000052302024,0.77954185,0.007912289,0.13282073,0.078234114,0.000038307586],"about_ca_topic_score_codex":0.00075507455,"about_ca_topic_score_gemma":0.000993547,"teacher_disagreement_score":0.0045821257,"about_ca_system_score_codex":0.00059476215,"about_ca_system_score_gemma":0.0004772575,"threshold_uncertainty_score":0.015328765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65592116,0.0019762563,0.32459983,0.00034983823,0.000053625055,0.00007460127,0.000023018758,0.00024740098,0.016754184],"genre_scores_gemma":[0.9732336,0.0006095124,0.024410916,0.00005879441,0.000011714222,0.0000361958,0.000032900065,0.000049670554,0.0015567339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.00015094748,0.000015433114,0.00003867169,0.00009326257,0.00005466835],"domain_scores_gemma":[0.9967314,0.0026428413,0.00019891391,0.00011080173,0.0002668261,0.000049168535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480014,0.00067338045,0.0007103934,0.0008142808,0.00037149238,0.00087690284,0.00051386363,0.0010471117,0.00080681755],"category_scores_gemma":[0.008145447,0.0002554683,0.00040521016,0.00053360104,0.00095726893,0.0007203683,0.00039500202,0.0005495724,0.00020631445],"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.000060953098,0.00003924817,0.000780094,0.000052527274,0.000039166738,0.00008839712,0.00009404989,0.96500856,0.0064563705,0.009838979,0.00014303674,0.017398585],"study_design_scores_gemma":[0.0000056472563,0.000059930095,0.00025577963,0.000007517674,0.000009381611,0.000025665624,0.000016319744,0.99549013,0.002113185,0.001819385,0.00018953627,0.000007388937],"about_ca_topic_score_codex":0.0029516544,"about_ca_topic_score_gemma":0.0013654233,"teacher_disagreement_score":0.0029516544,"about_ca_system_score_codex":0.00065642915,"about_ca_system_score_gemma":0.00039228756,"threshold_uncertainty_score":0.007827163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022357522,0.00022610053,0.96962017,0.000556644,0.0000306946,0.0000857348,0.000033929522,0.00014949022,0.006939683],"genre_scores_gemma":[0.5905125,0.00041684162,0.39851013,0.00045247216,0.00009664737,0.00046190395,0.00016510992,0.000116023955,0.009268216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910223,0.00033899743,0.000027916736,0.00017075847,0.00027190233,0.00008829009],"domain_scores_gemma":[0.9990357,0.0004559626,0.00008879888,0.000115917996,0.00024046707,0.00006316854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019185205,0.0008958943,0.0012659084,0.0014698746,0.0008490074,0.0015519749,0.00237593,0.0021090966,0.0014485002],"category_scores_gemma":[0.004024204,0.00044504253,0.00083910604,0.001394413,0.0012269772,0.0013272453,0.0014205431,0.0011416081,0.00038199683],"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.000023682105,0.000055318033,0.0006937635,0.000045965167,0.00006372557,0.00009782448,0.00016593756,0.89892,0.001092058,0.046370145,0.001520515,0.050951093],"study_design_scores_gemma":[0.0000061852875,0.000012070737,0.00007866952,0.000004564461,0.000006550634,0.000022080767,0.000017261107,0.9848615,0.00015892771,0.014197301,0.0006310609,0.0000039129054],"about_ca_topic_score_codex":0.0043183584,"about_ca_topic_score_gemma":0.0032264353,"teacher_disagreement_score":0.0043183584,"about_ca_system_score_codex":0.0015116293,"about_ca_system_score_gemma":0.0012239405,"threshold_uncertainty_score":0.0109677315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98233724,0.00019722423,0.014778593,0.00022482294,0.000011937655,0.000017479939,0.000012441724,0.000040088747,0.0023801506],"genre_scores_gemma":[0.9978611,0.00005178029,0.0018626689,0.000012478263,0.000003143976,0.00001190506,0.0000061274636,0.000006099833,0.00018468774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951935,0.00028729695,0.000016707863,0.000046203877,0.00006429423,0.00006613699],"domain_scores_gemma":[0.9927717,0.0059058457,0.0006247422,0.00021819581,0.0002154114,0.0002641373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002262977,0.00035150815,0.000538658,0.0007029866,0.0008190582,0.0010719441,0.00048874755,0.00074849394,0.0011321143],"category_scores_gemma":[0.015082237,0.00020899365,0.00033358298,0.0003586638,0.001611642,0.0012841247,0.0008323356,0.0006192503,0.00007907166],"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.00037632088,0.000120669894,0.01474278,0.00006370037,0.00011290961,0.00051594246,0.00095074036,0.8881297,0.005685834,0.07607275,0.00035060424,0.012878049],"study_design_scores_gemma":[0.00015150059,0.0003196397,0.003777868,0.000020849127,0.000048238544,0.00015569336,0.00023691592,0.92672753,0.0011768322,0.06685844,0.0004905722,0.000035940095],"about_ca_topic_score_codex":0.0015439447,"about_ca_topic_score_gemma":0.0008401285,"teacher_disagreement_score":0.002262977,"about_ca_system_score_codex":0.0009210623,"about_ca_system_score_gemma":0.00049953075,"threshold_uncertainty_score":0.011967897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009955412,0.0012910324,0.98073614,0.00014352782,0.000099745404,0.00005750151,0.000026993475,0.00018656929,0.0075030415],"genre_scores_gemma":[0.3950142,0.0018624128,0.5939463,0.00019701864,0.00013756768,0.00034557868,0.00020922901,0.00012978112,0.008158007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992198,0.0002448916,0.000045699726,0.00007481304,0.0003805539,0.000034196877],"domain_scores_gemma":[0.9993967,0.00029284615,0.000059991213,0.000076741206,0.00014818205,0.000025438992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010478896,0.0008467049,0.000661664,0.00096761854,0.00043174985,0.0009154942,0.00089622516,0.0011005208,0.001393619],"category_scores_gemma":[0.0022263655,0.00030680798,0.0009975923,0.000989027,0.0004899783,0.0011705223,0.0008392724,0.00090368785,0.0005443759],"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.00010756723,0.00011571855,0.0017525825,0.0003654931,0.00028761872,0.00021339628,0.000082730214,0.5848208,0.012574449,0.068804316,0.0029548204,0.32792047],"study_design_scores_gemma":[0.000021769229,0.00010128658,0.0007393072,0.000023200046,0.000033504453,0.00019086922,0.000016145612,0.97308886,0.0038732367,0.013104664,0.008787201,0.000019872534],"about_ca_topic_score_codex":0.00094604574,"about_ca_topic_score_gemma":0.0010153174,"teacher_disagreement_score":0.001393619,"about_ca_system_score_codex":0.00034204993,"about_ca_system_score_gemma":0.0005726683,"threshold_uncertainty_score":0.005541861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21355362,0.0014603363,0.772787,0.0002682024,0.0000630251,0.00018200325,0.000045437853,0.00039971757,0.01124069],"genre_scores_gemma":[0.7613796,0.0007392133,0.2354787,0.000088749046,0.000028745791,0.00016166727,0.00005298573,0.00011209722,0.0019582543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942577,0.0002560504,0.000034727287,0.00006717893,0.00015576283,0.00006060262],"domain_scores_gemma":[0.9956858,0.00357916,0.00024115214,0.00022241543,0.00019762634,0.00007379688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021444336,0.00072864705,0.00075203663,0.0008362732,0.00030505419,0.00096672436,0.001490424,0.0015722818,0.0016836806],"category_scores_gemma":[0.007514602,0.00022360349,0.00061925466,0.00081678515,0.0006079027,0.0013058293,0.00073622394,0.00080912886,0.00020484785],"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.00022194468,0.00012544218,0.0005404061,0.00022388603,0.00006372019,0.00008407825,0.00012306131,0.899199,0.0040799496,0.033003464,0.000353709,0.061981365],"study_design_scores_gemma":[0.000024690966,0.00009934217,0.00017777443,0.000012402534,0.000012344593,0.000029266517,0.000022056793,0.9954951,0.0011493217,0.0025771172,0.00039066427,0.000009906],"about_ca_topic_score_codex":0.0013236445,"about_ca_topic_score_gemma":0.0012125057,"teacher_disagreement_score":0.0021444336,"about_ca_system_score_codex":0.00075665413,"about_ca_system_score_gemma":0.00069438654,"threshold_uncertainty_score":0.011341035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028842606,0.0003642033,0.96807367,0.00008961177,0.00002908059,0.000027937951,0.000008807262,0.00016179496,0.0024022444],"genre_scores_gemma":[0.71432024,0.00063391775,0.27942064,0.00014152551,0.00007502098,0.00013117549,0.000048292404,0.00015752352,0.005071659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995222,0.000164632,0.00002379531,0.000095899864,0.00015337196,0.000040130413],"domain_scores_gemma":[0.9980872,0.0011554887,0.00019010722,0.00025527133,0.00025301176,0.00005883981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541637,0.00044285276,0.00046096413,0.00046839437,0.00029393108,0.0007039117,0.00077636295,0.0007743078,0.0010952062],"category_scores_gemma":[0.0058342908,0.00020940496,0.0004931507,0.0005158962,0.0008439441,0.0011472715,0.00074007106,0.00090476306,0.000413309],"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.00007607725,0.000057452853,0.0012975637,0.00009042577,0.00006216408,0.00009261271,0.00011568158,0.7157131,0.024135742,0.069731206,0.00077397685,0.18785399],"study_design_scores_gemma":[0.000006131959,0.000050564886,0.00031095327,0.000008500961,0.000007074075,0.000043753127,0.000008527911,0.9825716,0.0031689208,0.01277664,0.0010373417,0.000009840469],"about_ca_topic_score_codex":0.0006509865,"about_ca_topic_score_gemma":0.00050842395,"teacher_disagreement_score":0.0010952062,"about_ca_system_score_codex":0.00040278156,"about_ca_system_score_gemma":0.000396203,"threshold_uncertainty_score":0.005575061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16370095,0.00022760089,0.8292408,0.00044393653,0.000047777175,0.00009744071,0.00007788241,0.0014319818,0.0047316616],"genre_scores_gemma":[0.59800404,0.00031242278,0.39846066,0.00014999748,0.00001994663,0.00018847155,0.00022367724,0.00028141565,0.00235939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898726,0.0004390924,0.000047933478,0.0001869157,0.000253594,0.00008523596],"domain_scores_gemma":[0.9970861,0.0018898455,0.00013124745,0.00051200506,0.0002899347,0.00009094081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017421716,0.00046286115,0.0007523843,0.00064624177,0.00041535753,0.0014503235,0.0014605618,0.00094012974,0.0026350403],"category_scores_gemma":[0.0083801085,0.00031942155,0.0004381003,0.0011541827,0.0010258455,0.0031602927,0.0016171032,0.0011373981,0.00044627712],"study_design_candidate":"bench_or_experimental","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.00018889245,0.00019689454,0.0039650444,0.000115038754,0.000047000754,0.0002044987,0.00025245527,0.6167067,0.0068522533,0.10303244,0.0017835597,0.26665527],"study_design_scores_gemma":[0.000035690686,0.00008604168,0.00044510452,0.000010834824,0.00003468536,0.00008239576,0.00008658528,0.9372287,0.004432701,0.0555523,0.0019892443,0.000015731192],"about_ca_topic_score_codex":0.004017024,"about_ca_topic_score_gemma":0.004009758,"teacher_disagreement_score":0.004017024,"about_ca_system_score_codex":0.00085091393,"about_ca_system_score_gemma":0.0014500356,"threshold_uncertainty_score":0.009213567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31247777,0.0017950388,0.66709733,0.0010631324,0.00007441418,0.000103405924,0.00007542574,0.0002860119,0.01702755],"genre_scores_gemma":[0.91829246,0.00069823524,0.07761445,0.00024023297,0.000033257897,0.000097682925,0.00008594205,0.000118806165,0.0028187954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995845,0.00020690903,0.000020002593,0.00005322642,0.00008643985,0.00004901886],"domain_scores_gemma":[0.98616636,0.0122862,0.0006243881,0.00022132353,0.0004915215,0.000210278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039732507,0.0007296977,0.0007139447,0.0007971199,0.00044227517,0.000943394,0.0009289804,0.0013575449,0.0018235866],"category_scores_gemma":[0.024174077,0.00030391826,0.00048358165,0.0006301888,0.0014743115,0.0012791723,0.0009383846,0.0011014338,0.00022303773],"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.000062586725,0.00003305296,0.00082174793,0.000083912666,0.000031479136,0.00011569361,0.00011586873,0.95218736,0.0025866858,0.031119555,0.000562746,0.012279353],"study_design_scores_gemma":[0.00000483302,0.00003424019,0.00017351432,0.000016440063,0.000004935817,0.00003136826,0.000019538482,0.9936572,0.00034875434,0.0055693677,0.00013440024,0.0000055108035],"about_ca_topic_score_codex":0.0027312269,"about_ca_topic_score_gemma":0.0015685472,"teacher_disagreement_score":0.0039732507,"about_ca_system_score_codex":0.0008586789,"about_ca_system_score_gemma":0.00067197875,"threshold_uncertainty_score":0.021012783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06274954,0.0012435042,0.9265388,0.0018440194,0.00007187196,0.00018234443,0.00028302023,0.00082065136,0.0062662857],"genre_scores_gemma":[0.64195734,0.0012384303,0.35084248,0.00039084203,0.00016487793,0.00054045307,0.00087559194,0.0003856713,0.0036043865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904717,0.0050332444,0.0005601854,0.0010007687,0.0024859179,0.00044818353],"domain_scores_gemma":[0.94139963,0.049804438,0.0016383677,0.0039402675,0.0028073722,0.00040995047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006792772,0.0010803688,0.0016075057,0.0015344276,0.0009975529,0.003633027,0.0018297171,0.0016951269,0.0052766916],"category_scores_gemma":[0.051701255,0.00061879243,0.0011344013,0.0018095191,0.0021526262,0.0068816524,0.0028539316,0.0028279596,0.0009457159],"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.00069422997,0.00015999786,0.0040796576,0.0004239774,0.00015231139,0.00011657411,0.0003864517,0.6342404,0.002635574,0.1914137,0.0032296795,0.16246744],"study_design_scores_gemma":[0.000045220095,0.00007219235,0.00044319354,0.000028234585,0.000021228196,0.000051252468,0.00007282097,0.90497285,0.0012898671,0.09174398,0.0012420606,0.000017102078],"about_ca_topic_score_codex":0.00338147,"about_ca_topic_score_gemma":0.0023409608,"teacher_disagreement_score":0.006792772,"about_ca_system_score_codex":0.0025164534,"about_ca_system_score_gemma":0.0027288988,"threshold_uncertainty_score":0.035924017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009202098,0.00087430794,0.9812525,0.00018364999,0.000042729862,0.000036282487,0.000012884518,0.0001624241,0.008233134],"genre_scores_gemma":[0.43107742,0.0021963753,0.5566168,0.00022849516,0.00009973893,0.0004215014,0.00007103,0.00013655191,0.009152131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00021100795,0.000028826202,0.00008400035,0.00016647129,0.00003244685],"domain_scores_gemma":[0.99930644,0.00046828523,0.00007832925,0.00006318379,0.0000675024,0.000016197702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065511,0.0007652722,0.000812789,0.00068726274,0.00033716165,0.001079483,0.0006730892,0.0012330443,0.0017831553],"category_scores_gemma":[0.0042958087,0.00046300903,0.00056646817,0.00078943896,0.00086912717,0.0012779763,0.0010511191,0.0007667741,0.00045517206],"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.00003685989,0.000028039896,0.0003267238,0.00010258954,0.000050567545,0.00006460573,0.00007985553,0.8116509,0.0023563392,0.11468408,0.001013909,0.06960556],"study_design_scores_gemma":[0.000019240539,0.000040593084,0.000105243766,0.000018529421,0.000013776123,0.00004144502,0.000009261826,0.95460343,0.00066631974,0.041125037,0.003346883,0.000010387622],"about_ca_topic_score_codex":0.0011667074,"about_ca_topic_score_gemma":0.00078969443,"teacher_disagreement_score":0.0017831553,"about_ca_system_score_codex":0.00071716297,"about_ca_system_score_gemma":0.00065211946,"threshold_uncertainty_score":0.0059652925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24766658,0.00087938656,0.7465411,0.00035401373,0.000036940775,0.00008735275,0.000009392174,0.00016433309,0.0042609684],"genre_scores_gemma":[0.8893317,0.0003028115,0.10840043,0.000087287335,0.000017474906,0.00010617768,0.000018544692,0.000049235296,0.0016863025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932265,0.00042039395,0.000022575505,0.00006579995,0.00010730719,0.00006124823],"domain_scores_gemma":[0.9923644,0.006760254,0.00042707336,0.00018559882,0.00017751205,0.0000851121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002865323,0.00061066507,0.000613047,0.00064204977,0.00029186133,0.0006141783,0.0007153425,0.0010430426,0.0008497832],"category_scores_gemma":[0.01247957,0.00024456836,0.00052240404,0.00046883416,0.0010048571,0.0007479745,0.0005065408,0.0005903643,0.00011058829],"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.00008260761,0.00006324063,0.00081626786,0.000073178606,0.00005281444,0.00010588612,0.00017039884,0.93427795,0.0037251462,0.03241257,0.000178097,0.028041841],"study_design_scores_gemma":[0.00000905506,0.000098968856,0.00014407108,0.0000063555135,0.000008370283,0.000025455825,0.000015661819,0.9941414,0.00086535985,0.004504921,0.00017427515,0.0000060879534],"about_ca_topic_score_codex":0.0019037043,"about_ca_topic_score_gemma":0.0011689467,"teacher_disagreement_score":0.002865323,"about_ca_system_score_codex":0.0006570888,"about_ca_system_score_gemma":0.00032731582,"threshold_uncertainty_score":0.015153468},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26668423,0.00020578584,0.72672826,0.00034892265,0.000045723013,0.00027203062,0.000091621005,0.0007821883,0.0048411987],"genre_scores_gemma":[0.7144206,0.00015701647,0.28286618,0.00007474969,0.000036753547,0.00034658838,0.00030324352,0.00010758014,0.0016873176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988551,0.00040750165,0.00008284938,0.00015359429,0.00043173935,0.000069115784],"domain_scores_gemma":[0.9952833,0.002735578,0.00027043145,0.00083017536,0.00069341727,0.00018720167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018684719,0.0006399863,0.00087111664,0.0014055108,0.0005290514,0.00092794665,0.0010259598,0.00065278605,0.0019423631],"category_scores_gemma":[0.009399509,0.00037835303,0.00076954375,0.000716863,0.0006428656,0.0015338222,0.0009947395,0.0006725573,0.00038842182],"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.00029918694,0.00032058655,0.013600827,0.00013889304,0.00017569307,0.00050184294,0.00042590007,0.46068245,0.04839829,0.017012417,0.0017352378,0.45670882],"study_design_scores_gemma":[0.000038701302,0.0003621931,0.0032759341,0.000026078176,0.000079158126,0.00042336344,0.00011576276,0.97021556,0.013317449,0.008577106,0.0035414235,0.000027246131],"about_ca_topic_score_codex":0.00073131727,"about_ca_topic_score_gemma":0.000998179,"teacher_disagreement_score":0.0019423631,"about_ca_system_score_codex":0.00048024298,"about_ca_system_score_gemma":0.0006016452,"threshold_uncertainty_score":0.009881556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008262783,0.00042898965,0.9888905,0.000058989226,0.000051807892,0.00004947723,0.000022111743,0.00025890366,0.0019764598],"genre_scores_gemma":[0.2027866,0.00069282565,0.7914828,0.00013381406,0.000051663028,0.0003660962,0.00021907873,0.00014607744,0.0041209674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945754,0.00016892362,0.000022609493,0.000090503454,0.00020572076,0.000054687403],"domain_scores_gemma":[0.99969614,0.00012346244,0.000030492842,0.00003784086,0.00009384944,0.000018144767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012825484,0.0013625978,0.0012239931,0.0013495827,0.0005311359,0.0008552,0.0011749638,0.0012426783,0.0014557934],"category_scores_gemma":[0.0014094006,0.00033855377,0.0014374419,0.001208571,0.0005558973,0.0009062492,0.0009205666,0.0011688593,0.00036548008],"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.00004753794,0.000051478823,0.0011029731,0.00013204833,0.0001331617,0.000119496,0.00009926739,0.81038094,0.0050985543,0.0154704265,0.0015155384,0.16584855],"study_design_scores_gemma":[0.00001834129,0.00008026058,0.00029127192,0.00002599068,0.000028872488,0.00009015304,0.000020605232,0.9879154,0.0015555753,0.0052703638,0.004688466,0.000014583719],"about_ca_topic_score_codex":0.0025579468,"about_ca_topic_score_gemma":0.0022937888,"teacher_disagreement_score":0.0025579468,"about_ca_system_score_codex":0.00056044414,"about_ca_system_score_gemma":0.0010692094,"threshold_uncertainty_score":0.0067828298},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046668198,0.00039594472,0.94886297,0.0001370694,0.000027997712,0.000046443998,0.000011431806,0.00013666216,0.0037132832],"genre_scores_gemma":[0.68807733,0.00038724113,0.30757234,0.00013218434,0.000031228472,0.0002863357,0.000052549123,0.00007740075,0.0033833755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977654,0.00009699733,0.000009339309,0.00002527874,0.00007486944,0.000016999706],"domain_scores_gemma":[0.99959606,0.00025535142,0.00004676191,0.000032954402,0.000050881612,0.000018001881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866382,0.0005328056,0.000523938,0.00059128215,0.0002544146,0.00052606524,0.0009957004,0.0005891353,0.000663096],"category_scores_gemma":[0.0015800355,0.00021942887,0.0004280658,0.00050672964,0.0005928077,0.0005814263,0.00064754207,0.00045966572,0.0001311478],"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.000025068226,0.000039975177,0.0005594632,0.000034617085,0.00005627794,0.00006217832,0.00008436194,0.92713326,0.002692772,0.025622059,0.00047707563,0.043212906],"study_design_scores_gemma":[0.000006160805,0.000022423723,0.00005586726,0.0000033498397,0.0000046175132,0.000014804888,0.0000061571686,0.9963141,0.0002920718,0.002896294,0.0003815379,0.0000026383216],"about_ca_topic_score_codex":0.0015860496,"about_ca_topic_score_gemma":0.0014148025,"teacher_disagreement_score":0.0015860496,"about_ca_system_score_codex":0.00048048858,"about_ca_system_score_gemma":0.0004208648,"threshold_uncertainty_score":0.0036313534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23430794,0.0037766949,0.72321975,0.0017616843,0.00035845238,0.0002799329,0.0003656948,0.004779456,0.031150376],"genre_scores_gemma":[0.76293105,0.000705101,0.23130836,0.0005155154,0.00016960084,0.00019599508,0.00065979495,0.0003496003,0.003164881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981511,0.00073215575,0.00008529182,0.0002685448,0.000564967,0.00019786529],"domain_scores_gemma":[0.99491584,0.0035612315,0.00046651866,0.0004897384,0.00044537432,0.000121315796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029056321,0.0012996324,0.0013399286,0.0013206701,0.00060655473,0.0015282219,0.0017042803,0.0013615808,0.0027708379],"category_scores_gemma":[0.010849118,0.00046738528,0.00073120365,0.0014568391,0.0011271016,0.0019349535,0.0017089938,0.0018024507,0.00065447233],"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.00009664924,0.00013689154,0.001914828,0.00017841598,0.000056361612,0.0000619424,0.000038113194,0.89861685,0.0010817756,0.009724985,0.0028296488,0.08526354],"study_design_scores_gemma":[0.000010476645,0.000033602402,0.000100534126,0.00000858957,0.000006807401,0.0000133715575,0.000008808895,0.99628854,0.0005001024,0.0023600662,0.0006658383,0.0000032981036],"about_ca_topic_score_codex":0.003035596,"about_ca_topic_score_gemma":0.0042817057,"teacher_disagreement_score":0.003035596,"about_ca_system_score_codex":0.00081181567,"about_ca_system_score_gemma":0.0020788428,"threshold_uncertainty_score":0.0153666735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0811915,0.00017164995,0.9124926,0.00059733604,0.000051135146,0.00004180891,0.00005849081,0.00024008667,0.005155415],"genre_scores_gemma":[0.9250739,0.00012798552,0.07076025,0.00012549222,0.00003067999,0.00017942858,0.00007241527,0.000054200027,0.0035757916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968493,0.0001292879,0.000015580641,0.00005881278,0.000052241816,0.000059193335],"domain_scores_gemma":[0.99866736,0.0008096903,0.00018887897,0.000096912176,0.0001215011,0.00011557683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009203601,0.0006009598,0.00067597587,0.000314115,0.00039265183,0.00075925223,0.0009821025,0.0009939437,0.0019617483],"category_scores_gemma":[0.0032876423,0.0003147667,0.00047151968,0.00020966868,0.0010798707,0.00067235605,0.0013379807,0.0011388286,0.00015680224],"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.000030152498,0.000029663686,0.0006226606,0.00003207452,0.000031494637,0.00006853536,0.000054303593,0.96011704,0.00071333465,0.030706296,0.00053247245,0.0070619932],"study_design_scores_gemma":[0.000009063062,0.000009807471,0.000068358975,0.0000023339883,0.0000024861529,0.000006955069,0.000009607675,0.9829914,0.00009244428,0.016584348,0.00022093186,0.000002230742],"about_ca_topic_score_codex":0.0021081404,"about_ca_topic_score_gemma":0.0024807835,"teacher_disagreement_score":0.0021081404,"about_ca_system_score_codex":0.00084373186,"about_ca_system_score_gemma":0.0008087515,"threshold_uncertainty_score":0.00656265},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05799733,0.00025896236,0.9365528,0.0002254206,0.00003936907,0.00008805527,0.000023996574,0.00023692375,0.0045771454],"genre_scores_gemma":[0.555726,0.00022627851,0.44038975,0.00017964799,0.000025570445,0.0004831807,0.00007935884,0.00008747833,0.0028028165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965894,0.00016672908,0.000016023654,0.00004723968,0.00007820056,0.000032918782],"domain_scores_gemma":[0.9994325,0.00035467147,0.000054164146,0.00004892142,0.00006705265,0.000042635158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512302,0.0008981062,0.00086450647,0.0006807947,0.0003835109,0.0007243856,0.0010017338,0.0009491429,0.0014190787],"category_scores_gemma":[0.0021582688,0.00039905022,0.0008038312,0.00045974329,0.0008699122,0.00061897706,0.0009958873,0.00082750217,0.00018689301],"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.000013147041,0.000021758713,0.00030102272,0.000020805479,0.000027252006,0.000037932998,0.000027061575,0.9798957,0.0010105174,0.0071926713,0.00017864574,0.011273518],"study_design_scores_gemma":[0.000006900445,0.0000143234665,0.000045559667,0.0000030368633,0.000003825736,0.0000067165465,0.000004463904,0.9971734,0.00013515963,0.0024104244,0.0001936632,0.000002583273],"about_ca_topic_score_codex":0.0021166408,"about_ca_topic_score_gemma":0.001859338,"teacher_disagreement_score":0.0021166408,"about_ca_system_score_codex":0.00062592956,"about_ca_system_score_gemma":0.0007911285,"threshold_uncertainty_score":0.005559504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91269755,0.0006854873,0.07963596,0.00027221278,0.00002673968,0.000031020376,0.000054089556,0.00028921134,0.0063077314],"genre_scores_gemma":[0.9922637,0.00011345012,0.007200186,0.000023693061,0.000006621108,0.000015735548,0.000036420573,0.00004294672,0.00029728428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907124,0.0003951193,0.00003375367,0.000120388286,0.00022424692,0.00015520291],"domain_scores_gemma":[0.9743843,0.0230775,0.0009962879,0.00044452594,0.0007853802,0.00031209653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016496095,0.0005364395,0.00039364648,0.0005608225,0.00033048025,0.00084222015,0.00060548855,0.0005226085,0.00090327166],"category_scores_gemma":[0.019375727,0.0002830097,0.00040649055,0.00040836458,0.0009827806,0.0006771255,0.000406445,0.0008867363,0.000072985276],"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.00019265428,0.000113536786,0.003985212,0.00009170284,0.00005318693,0.00015793582,0.00007360053,0.96616,0.008712093,0.0060332436,0.00019353654,0.014233331],"study_design_scores_gemma":[0.0000074587833,0.00009478385,0.0013385362,0.000006677134,0.0000236275,0.00002493789,0.000015583126,0.99434537,0.002632157,0.0013843084,0.000120470315,0.000006077258],"about_ca_topic_score_codex":0.0036991283,"about_ca_topic_score_gemma":0.002647185,"teacher_disagreement_score":0.0036991283,"about_ca_system_score_codex":0.0008544038,"about_ca_system_score_gemma":0.00083658885,"threshold_uncertainty_score":0.008724034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047454896,0.0005063246,0.9954482,0.00013961525,0.000061282284,0.000038336235,0.000031227923,0.00012848729,0.0031720418],"genre_scores_gemma":[0.08734869,0.0021533591,0.89986867,0.00043870416,0.00022998021,0.0010965879,0.00029574742,0.00038537217,0.008182908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987727,0.0005676965,0.00006547511,0.00010236597,0.00044867012,0.0000430666],"domain_scores_gemma":[0.99710995,0.0021770408,0.00017719921,0.0002175953,0.00025919802,0.000058956575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022523669,0.0017595633,0.0013493288,0.0013221408,0.0006699357,0.0019927705,0.0021135763,0.0027099783,0.009744567],"category_scores_gemma":[0.0070992983,0.00077833707,0.0013727276,0.0016423349,0.0018540518,0.0020344984,0.0025895012,0.0047668493,0.0026109782],"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.000051483792,0.00006181532,0.00021100766,0.0004421291,0.00009715265,0.00010050587,0.000117490046,0.5498977,0.0047636433,0.3424823,0.0050433944,0.09673134],"study_design_scores_gemma":[0.000017332753,0.000023154493,0.00004479255,0.00006419119,0.000011754735,0.00004744686,0.000009954237,0.89373875,0.0014827527,0.09177741,0.012763546,0.000018932313],"about_ca_topic_score_codex":0.0008859121,"about_ca_topic_score_gemma":0.00087160565,"teacher_disagreement_score":0.009744567,"about_ca_system_score_codex":0.0007711473,"about_ca_system_score_gemma":0.000994151,"threshold_uncertainty_score":0.032598794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029782008,0.00028635238,0.959715,0.00018146739,0.00006309192,0.00026697267,0.00011904429,0.003171897,0.00641413],"genre_scores_gemma":[0.4679017,0.00015776974,0.5272287,0.00019617073,0.000043260618,0.00078450114,0.00041836826,0.00050917594,0.0027602578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989318,0.00042859017,0.000042613483,0.0001609098,0.00031924166,0.00011675041],"domain_scores_gemma":[0.9978369,0.0012080955,0.00019984358,0.00035078326,0.0002937407,0.00011077408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019196714,0.001894924,0.00151565,0.0016014659,0.0007455361,0.0011703789,0.0027474915,0.0016659502,0.0056238645],"category_scores_gemma":[0.004392134,0.00083438156,0.0012892344,0.0009645995,0.0010608652,0.0012626799,0.0021931566,0.0016656717,0.00092479127],"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.000078798614,0.00007292268,0.00061809114,0.000075315394,0.000052750438,0.000047251287,0.00004069479,0.9421037,0.001479094,0.0045571793,0.0012824342,0.04959178],"study_design_scores_gemma":[0.000014375298,0.000038443595,0.000060353217,0.000007022711,0.0000066107737,0.000015838714,0.0000055773517,0.99718446,0.00055375806,0.0016132348,0.00049511023,0.0000051228317],"about_ca_topic_score_codex":0.0034237956,"about_ca_topic_score_gemma":0.0054279855,"teacher_disagreement_score":0.0056238645,"about_ca_system_score_codex":0.0011894432,"about_ca_system_score_gemma":0.0021910248,"threshold_uncertainty_score":0.01881373},"labels":[],"label_agreement":null}]}