{"meta":{"query_hash":"961f076980a0","filters":{"venue":"Genetic Programming and Evolvable Machines"},"cohort_total":31,"direct_labels_cover":0,"predictions_cover":31,"exported":31,"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/961f076980a0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Genetic+Programming+and+Evolvable+Machines"},"results":[{"id":"W1967703293","doi":"10.1007/s10710-006-9015-5","title":"Estimation of evolvability genetic algorithm and dynamic environments","year":2006,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Evolvability; Computer science; Genetic algorithm; Evolutionary computation; Computation; Evolutionary algorithm; Population; Selection (genetic algorithm); Artificial intelligence; Algorithm; Mathematical optimization; Machine learning; Evolutionary biology; Mathematics; Biology","score_opus":0.003496496500966776,"score_gpt":0.2117898430544903,"score_spread":0.20829334655352352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967703293","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.20054032,0.0031167099,0.7958115,0.00015724971,0.000039541883,0.00023698562,0.0000061171363,0.000054752472,0.000036824233],"genre_scores_gemma":[0.4306864,0.00006686903,0.5690642,0.0000063050766,0.000016157395,0.00004342039,0.000008754015,0.0000056406125,0.000102228965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988772,0.000035035406,0.00028738682,0.00039930348,0.00017586694,0.00022520707],"domain_scores_gemma":[0.99943197,0.000042408235,0.0001012777,0.00033662145,0.000021138405,0.00006660986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013504516,0.00014945336,0.00015805426,0.00006563512,0.00019437305,0.00007275307,0.00019864098,0.000053218995,0.000003619712],"category_scores_gemma":[0.000007643582,0.00014032882,0.000031836305,0.00018966074,0.00015782734,0.00013095027,0.00016110213,0.00006311375,0.000003185429],"study_design_candidate":"design_other","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":[9.865852e-7,0.0001164457,0.006535518,0.0000340284,0.0000078125895,0.0000010598079,0.0000512984,0.005245726,0.00022297405,0.00039810233,0.000019053563,0.987367],"study_design_scores_gemma":[0.00017302799,0.00005977155,0.2360298,0.000009008869,0.000012781367,0.000027901942,0.0000059469376,0.7506626,0.000056591587,0.0122409,0.00060562143,0.00011602242],"about_ca_topic_score_codex":0.00036233693,"about_ca_topic_score_gemma":0.0000072608823,"teacher_disagreement_score":0.987251,"about_ca_system_score_codex":0.000021010506,"about_ca_system_score_gemma":0.000019326968,"threshold_uncertainty_score":0.5722443},"labels":[],"label_agreement":null},{"id":"W1969653308","doi":"10.1007/s10710-008-9057-y","title":"Analysis of mass spectrometry data of cerebral stroke samples: an evolutionary computation approach to resolve and quantify peptide peaks","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute for Biological Sciences; National Research Council Canada","funders":"University of Waterloo","keywords":"Preprocessor; Computer science; Computation; Evolutionary computation; Evolutionary algorithm; Differential evolution; Genetic algorithm; Perspective (graphical); Algorithm; Artificial intelligence; Mass spectrometry; Series (stratigraphy); Data pre-processing; Machine learning; Chemistry; Biology; Chromatography","score_opus":0.043234629175894046,"score_gpt":0.3023370453336234,"score_spread":0.25910241615772933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969653308","genre_codex":"empirical","genre_gemma":"methods","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.59758246,0.00073223846,0.40096447,0.000016267282,0.000004081273,0.00015119913,0.0002823041,0.000050747436,0.00021624503],"genre_scores_gemma":[0.4871689,0.00007654436,0.512241,0.0000030653873,0.00001901602,0.00002377998,0.00042450172,0.000010034342,0.000033161872],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873656,0.000019377314,0.0003623559,0.0004950882,0.00017931829,0.0002072768],"domain_scores_gemma":[0.9989963,0.00005164593,0.00017875801,0.00058081065,0.00008512872,0.00010733195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014015238,0.00015837961,0.0003458171,0.00021927743,0.00015616255,0.000019714034,0.00026527236,0.00007576111,0.000010342266],"category_scores_gemma":[0.000033136093,0.00015601637,0.00005023272,0.00050282147,0.0001565145,0.00008685584,0.00018924206,0.000108861364,1.8515071e-7],"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.00013782672,0.00064557773,0.8323421,0.00063226017,0.0007219628,0.000002329388,0.00096568244,0.013109955,0.099974655,0.0006889787,0.00011937551,0.05065931],"study_design_scores_gemma":[0.00075646193,0.00026795216,0.17830063,0.00007165189,0.0010489493,0.000067036075,0.001171433,0.8067414,0.007953269,0.0022037274,0.000718922,0.00069855613],"about_ca_topic_score_codex":0.0006187883,"about_ca_topic_score_gemma":0.000017768745,"teacher_disagreement_score":0.79363143,"about_ca_system_score_codex":0.00001643343,"about_ca_system_score_gemma":0.00002679473,"threshold_uncertainty_score":0.6362163},"labels":[],"label_agreement":null},{"id":"W1970757919","doi":"10.1007/s10710-012-9159-4","title":"Evolutionary dynamics on multiple scales: a quantitative analysis of the interplay between genotype, phenotype, and fitness in linear genetic programming","year":2012,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Robustness (evolution); Genetic programming; Neutral network; Computer science; Fitness landscape; Phenotype; Neutrality; Neutral mutation; Genotype; Evolutionary algorithm; Biology; Evolutionary dynamics; Evolutionary biology; Genetics; Artificial intelligence; Population; Gene","score_opus":0.012921765718736695,"score_gpt":0.2800358134837032,"score_spread":0.2671140477649665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970757919","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.81785333,0.0031076244,0.17819613,0.00019228009,0.00010187056,0.00044278006,0.000026451413,0.00004967017,0.00002988147],"genre_scores_gemma":[0.75158334,0.000041728086,0.24817051,0.000016720787,0.00004172221,0.000082564504,0.00001928168,0.000010051143,0.000034109147],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984699,0.00011313873,0.0003824841,0.0003943592,0.00023416062,0.00040596767],"domain_scores_gemma":[0.9988981,0.0003179498,0.00016223908,0.00041534984,0.00009046581,0.00011588682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028184496,0.0002061598,0.00031235907,0.00027252713,0.00027115512,0.00005595037,0.0004014053,0.00008140233,0.0000021659864],"category_scores_gemma":[0.00007535067,0.00015854696,0.00008805079,0.0013673161,0.00021949397,0.00015205836,0.0003193425,0.00017330359,0.0000026476828],"study_design_candidate":"observational","study_design_consensus":"observational","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.000007998309,0.0001733359,0.8539673,0.00004013787,0.00012416605,5.121746e-7,0.0007101918,0.0033150348,0.000021258555,0.0020324853,0.0000057600564,0.13960184],"study_design_scores_gemma":[0.00015202597,0.000058187317,0.5765215,0.000024288518,0.00008699469,0.0000031258503,0.00008068069,0.42239752,0.000005032996,0.00037233208,0.00017971481,0.00011854991],"about_ca_topic_score_codex":0.00053345517,"about_ca_topic_score_gemma":0.0004825792,"teacher_disagreement_score":0.4190825,"about_ca_system_score_codex":0.000052061117,"about_ca_system_score_gemma":0.000035550584,"threshold_uncertainty_score":0.6465357},"labels":[],"label_agreement":null},{"id":"W1972342439","doi":"10.1007/s10710-010-9105-2","title":"Variable population size and evolution acceleration: a case study with a parallel evolutionary algorithm","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolutionary algorithm; Computer science; Variable (mathematics); Population size; Population; Evolutionary computation; Acceleration; Cultural algorithm; Parallel algorithm; Algorithm; Genetic algorithm; Population-based incremental learning; Artificial intelligence; Mathematics; Machine learning","score_opus":0.004320053042347337,"score_gpt":0.23266694411861175,"score_spread":0.2283468910762644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972342439","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.9468183,0.001075217,0.051159002,0.000058631387,0.00013099855,0.0006288981,0.000010908316,0.000050198192,0.00006783481],"genre_scores_gemma":[0.7447008,0.000023891344,0.25452164,0.000030172821,0.00017919876,0.00010148317,0.00006104717,0.00002213018,0.00035961973],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99868125,0.000069189875,0.0002460597,0.00053560326,0.00016499037,0.00030290394],"domain_scores_gemma":[0.9992902,0.000020192525,0.00008960234,0.00031422375,0.00013401007,0.00015174563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021957589,0.00024359365,0.00017492614,0.00005680538,0.0004855975,0.00011846331,0.000081235165,0.00015206216,0.000014923582],"category_scores_gemma":[0.00005235887,0.00021274871,0.000026731483,0.0001687671,0.00011332581,0.000014828909,0.000112013375,0.00016406442,0.0000012351999],"study_design_candidate":"observational","study_design_consensus":"observational","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.00024266358,0.0007708361,0.8547272,0.000094665644,0.0002143698,0.00016088987,0.00037915862,0.0031204398,0.009794848,0.00040408317,0.00019897106,0.12989189],"study_design_scores_gemma":[0.004343996,0.0033842186,0.75364244,0.000028012182,0.0002838069,0.01328377,0.0017161464,0.21610917,0.00002721161,0.0017461499,0.004301975,0.001133079],"about_ca_topic_score_codex":0.0017240644,"about_ca_topic_score_gemma":0.0016586139,"teacher_disagreement_score":0.21298873,"about_ca_system_score_codex":0.000012689712,"about_ca_system_score_gemma":0.00006787187,"threshold_uncertainty_score":0.8675641},"labels":[],"label_agreement":null},{"id":"W1988192121","doi":"10.1007/s10710-007-9026-x","title":"Editorial introduction to the special issue on developmental systems","year":2007,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Cognitive Abilities and Testing","field":"Psychology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cognitive science; Artificial intelligence; Psychology","score_opus":0.011945021604336971,"score_gpt":0.27393278069054205,"score_spread":0.2619877590862051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988192121","genre_codex":"empirical","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6664467,0.0009322205,0.0017715086,0.0020946406,0.30188,0.0015334236,0.000010435437,0.00022903764,0.025102058],"genre_scores_gemma":[0.23585525,0.0000034234872,0.0027078914,0.00011703419,0.7579184,0.00009360402,0.000010141334,0.000024712539,0.0032694975],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987821,0.000055191966,0.00022886971,0.00034670826,0.00019638489,0.00039073196],"domain_scores_gemma":[0.99946237,0.00016870063,0.000047375153,0.00014960089,0.00008111429,0.00009084597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007004903,0.00014807154,0.00012831253,0.00007005186,0.0003249374,0.00011834927,0.000102536564,0.000065167755,0.00023906045],"category_scores_gemma":[0.00017581064,0.00010625807,0.000026832735,0.00018578208,0.000054808137,0.000021298732,0.00005945441,0.00014967397,0.00020614995],"study_design_candidate":"not_applicable","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.0001282325,0.000057967594,0.0064666145,0.000014935553,0.000027323491,0.0000037746825,0.0019714911,0.000033532648,0.000028812205,0.00019027095,0.23536694,0.7557101],"study_design_scores_gemma":[0.00027512436,0.00027745997,0.013278505,0.000015835183,0.00001560995,0.000045820576,0.0027309663,0.000039203303,0.000017630045,0.000060884522,0.9830945,0.00014842334],"about_ca_topic_score_codex":0.00077984476,"about_ca_topic_score_gemma":0.00013507943,"teacher_disagreement_score":0.7555617,"about_ca_system_score_codex":0.000040333227,"about_ca_system_score_gemma":0.000015404456,"threshold_uncertainty_score":0.43330783},"labels":[],"label_agreement":null},{"id":"W1998452541","doi":"10.1007/s10710-008-9067-9","title":"Coevolutionary bid-based genetic programming for problem decomposition in classification","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Bidding; Classifier (UML); Genetic programming; Support vector machine","score_opus":0.019829532841100332,"score_gpt":0.2670076920093719,"score_spread":0.24717815916827157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998452541","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.120837405,0.0023235732,0.8738951,0.0011481432,0.00009211499,0.0013571645,0.0000073939063,0.00027233973,0.00006676851],"genre_scores_gemma":[0.4134088,0.000059399463,0.5852459,0.000044304557,0.000063819345,0.0010654619,0.000044501132,0.000013748528,0.00005409262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817055,0.000059826645,0.00042928229,0.0006388526,0.00022323575,0.00047825984],"domain_scores_gemma":[0.999104,0.00010407779,0.00013818736,0.00037902853,0.00014575983,0.00012894897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022873204,0.00022535547,0.00020404474,0.00022341158,0.00062412163,0.000112779606,0.00036764963,0.00010177656,0.0000022515692],"category_scores_gemma":[0.000017731578,0.00022486047,0.00007370311,0.00063088344,0.00013594537,0.00020901799,0.0000836546,0.00012140255,0.0000066701896],"study_design_candidate":"design_other","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.000035491594,0.00092488696,0.096613504,0.00023972878,0.000027383036,0.000015348407,0.00052263425,0.009602569,0.0014133162,0.0050083306,0.0006776244,0.88491917],"study_design_scores_gemma":[0.0008280945,0.00023492565,0.1959968,0.000049429902,0.000014219249,0.00011489783,0.00002674105,0.7882788,0.0000481247,0.0054113464,0.008669637,0.0003269904],"about_ca_topic_score_codex":0.00017144755,"about_ca_topic_score_gemma":0.000037093112,"teacher_disagreement_score":0.8845922,"about_ca_system_score_codex":0.000077188284,"about_ca_system_score_gemma":0.00015104293,"threshold_uncertainty_score":0.9169544},"labels":[],"label_agreement":null},{"id":"W2026440556","doi":"10.1007/s10710-011-9144-3","title":"The evolution of higher-level biochemical reaction models","year":2011,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genetic programming; Computer science; Programming language; Syntax; Construct (python library); Feature (linguistics); Artificial intelligence; Domain (mathematical analysis); Interface (matter); Grammar; Theoretical computer science; Grammatical evolution; Machine learning","score_opus":0.029252218412441498,"score_gpt":0.23690475355481502,"score_spread":0.20765253514237353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026440556","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.07099562,0.0074344585,0.9191833,0.00036444206,0.00023055483,0.00026228165,0.0000038811672,0.00014925141,0.0013762242],"genre_scores_gemma":[0.7594833,0.000091478105,0.23999515,0.0000071637764,0.00004400502,0.000057798596,0.0000017645574,0.0000050163653,0.00031436104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992044,0.000025070056,0.00019711717,0.00023704948,0.00013720799,0.00019913907],"domain_scores_gemma":[0.9993914,0.000036996837,0.00008588245,0.0003406485,0.00008678642,0.00005828291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016363214,0.00009605575,0.00008668502,0.000038181068,0.000295746,0.000039676794,0.00032891062,0.000049050243,0.000001524953],"category_scores_gemma":[0.000007861096,0.000068663474,0.000037224097,0.00024952964,0.00011407297,0.00014814208,0.00013024606,0.000072784125,0.0000030642948],"study_design_candidate":"design_other","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.000020850684,0.0002993383,0.0034118127,0.000046391062,0.000051416573,0.000001295052,0.0007458896,0.00015531591,0.007327814,0.24780896,0.0008711837,0.7392597],"study_design_scores_gemma":[0.0004234215,0.00021002073,0.104291126,0.000035694557,0.000038234117,0.000060071492,0.00013729825,0.5883047,0.0013537718,0.29810145,0.006687276,0.00035692615],"about_ca_topic_score_codex":0.0007105521,"about_ca_topic_score_gemma":0.00000879567,"teacher_disagreement_score":0.7389028,"about_ca_system_score_codex":0.000026904181,"about_ca_system_score_gemma":0.000036472924,"threshold_uncertainty_score":0.28000152},"labels":[],"label_agreement":null},{"id":"W2030792885","doi":"10.1007/s10710-010-9113-2","title":"Open issues in genetic programming","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":false,"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; Science Foundation Ireland","keywords":"Computer science; Genetic programming; Mainstream; Field (mathematics); Face (sociological concept); Range (aeronautics); Data science; Artificial intelligence; Management science; Operations research; Sociology; Mathematics; Political science","score_opus":0.01086872803388606,"score_gpt":0.2758444820490048,"score_spread":0.26497575401511875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030792885","genre_codex":"empirical","genre_gemma":"methods","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.76842374,0.008727514,0.21081784,0.0063897134,0.000823268,0.0027258017,0.000006145555,0.0006589267,0.0014270726],"genre_scores_gemma":[0.27879634,0.000086855274,0.7200388,0.000063244675,0.0001259308,0.00036464963,0.0000050108447,0.000014721788,0.00050446513],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983384,0.000041733805,0.0003169158,0.00062818395,0.00018593387,0.0004888031],"domain_scores_gemma":[0.9990349,0.000046079185,0.00008098958,0.00061480113,0.000066241686,0.000157009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378578,0.00020833188,0.0002172411,0.00012517239,0.00032873408,0.0008186177,0.0013190132,0.000090194706,0.00001826801],"category_scores_gemma":[0.000033022377,0.0001895372,0.000037428592,0.0005684093,0.00010823319,0.00032176365,0.0008531375,0.0002644508,0.000023057866],"study_design_candidate":"design_other","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.0000023194302,0.00016862559,0.040653452,0.00002428412,0.000008069536,0.000011507455,0.0003426344,0.0000970699,0.00045437462,0.004202815,0.00017748833,0.95385736],"study_design_scores_gemma":[0.0012037434,0.00029108877,0.3173167,0.00007158389,0.000022841454,0.000291475,0.00012030056,0.31660405,0.00020263082,0.028944794,0.3339917,0.0009390831],"about_ca_topic_score_codex":0.0016415959,"about_ca_topic_score_gemma":0.00056682253,"teacher_disagreement_score":0.9529183,"about_ca_system_score_codex":0.000012592942,"about_ca_system_score_gemma":0.00006850283,"threshold_uncertainty_score":0.7893949},"labels":[],"label_agreement":null},{"id":"W2033905545","doi":"10.1007/s10710-014-9234-0","title":"Exploring non-photorealistic rendering with genetic programming","year":2014,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Genetic programming; Rendering (computer graphics); Computer graphics (images); Artificial intelligence; Human–computer interaction","score_opus":0.025256679513746137,"score_gpt":0.22603377179609863,"score_spread":0.2007770922823525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033905545","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.1500857,0.000622686,0.84788954,0.00022999945,0.00013042174,0.00040458207,0.00000135953,0.00036405306,0.0002716587],"genre_scores_gemma":[0.48849654,0.000057504854,0.5107272,0.000030249865,0.00014526662,0.0004464968,0.0000051105612,0.00002107938,0.000070548434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807775,0.000043979922,0.00029760358,0.00069101714,0.00029200478,0.00059765973],"domain_scores_gemma":[0.9988708,0.00007549956,0.000110475914,0.0006253694,0.00009030715,0.00022752839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023957773,0.00028676045,0.0002433499,0.00012537718,0.00057062344,0.0003975171,0.0005002013,0.000048459693,0.0000029957223],"category_scores_gemma":[0.000023820434,0.00024068405,0.00004813697,0.0005195409,0.00010857424,0.00030180358,0.00023690437,0.0001596995,0.00000977442],"study_design_candidate":"design_other","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.000004958591,0.00007898926,0.0076706437,0.00009431245,0.000026062675,0.000009485822,0.00044777963,0.0018129706,0.0001618754,0.0014759843,0.000028754133,0.9881882],"study_design_scores_gemma":[0.0008445355,0.0006276343,0.10487848,0.00017104337,0.00006522827,0.0003413475,0.0001262988,0.8527383,0.00018589343,0.002390951,0.03675673,0.0008735524],"about_ca_topic_score_codex":0.00052980514,"about_ca_topic_score_gemma":0.000048732443,"teacher_disagreement_score":0.98731464,"about_ca_system_score_codex":0.000028690501,"about_ca_system_score_gemma":0.000043962285,"threshold_uncertainty_score":0.9814811},"labels":[],"label_agreement":null},{"id":"W2047198532","doi":"10.1007/s10710-013-9187-8","title":"Aesthetic 3D model evolution","year":2013,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Aesthetic Perception and Analysis","field":"Neuroscience","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Realm; Artificial intelligence; Entropy (arrow of time); Genetic programming; Evolutionary algorithm; Normality; Machine learning; Mathematics; Statistics","score_opus":0.015754413383491803,"score_gpt":0.23855049604235087,"score_spread":0.22279608265885908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047198532","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.95230985,0.00054001104,0.04419189,0.00080184924,0.00006158528,0.00029331495,0.0000020056973,0.00023956888,0.0015599291],"genre_scores_gemma":[0.9735293,0.00010182365,0.023315335,0.00032664282,0.000032058848,0.00009949755,0.0000020406503,0.000020740048,0.0025725898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986758,0.00006446587,0.00022022268,0.000431888,0.00022307744,0.00038452758],"domain_scores_gemma":[0.9994687,0.0000069580856,0.00006312722,0.000258415,0.00004241266,0.0001604222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009611022,0.00018574856,0.00017341257,0.000110558576,0.00031360597,0.00018582123,0.00016372751,0.00006588779,0.00021002424],"category_scores_gemma":[0.000045322144,0.00015124312,0.000067900866,0.00025239936,0.00017115539,0.0001329578,0.00007402694,0.00011194559,0.00029647554],"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.0000061725473,0.00012369764,0.0051054433,0.000025791427,0.0000015914462,0.00000369044,0.00036103756,0.005719602,0.024872476,0.0005990272,0.00047344266,0.96270806],"study_design_scores_gemma":[0.00026302916,0.000072363924,0.0024815039,0.000015166498,0.000030808784,0.0001123105,0.00006814913,0.9890103,0.000111775866,0.0057114335,0.0018612631,0.00026192897],"about_ca_topic_score_codex":0.00029861744,"about_ca_topic_score_gemma":0.000009451838,"teacher_disagreement_score":0.9832907,"about_ca_system_score_codex":0.000024106244,"about_ca_system_score_gemma":0.000024053865,"threshold_uncertainty_score":0.61675155},"labels":[],"label_agreement":null},{"id":"W2048338869","doi":"10.1007/s10710-008-9074-x","title":"Incorporating characteristics of human creativity into an evolutionary art algorithm","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; Simon Fraser University","funders":"","keywords":"Fitness function; Creativity; Evolutionary algorithm; Process (computing); Function (biology); Darwin (ADL); Computational creativity; Associative property","score_opus":0.01544792161054853,"score_gpt":0.24888593657341923,"score_spread":0.2334380149628707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048338869","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.8004076,0.00086780294,0.19788589,0.00011319587,0.000115259776,0.0001344258,0.0000028010074,0.00022945701,0.00024357898],"genre_scores_gemma":[0.6418949,0.00003159103,0.3578399,0.000019132882,0.000046513866,0.000020367039,0.0000074751392,0.0000050241065,0.0001351378],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989711,0.000059584403,0.00027181974,0.0003272216,0.00015290357,0.00021735237],"domain_scores_gemma":[0.99930185,0.000037692098,0.00014577055,0.0003538904,0.000096568496,0.00006422649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019405218,0.00015363857,0.0002618094,0.0000983298,0.0006962353,0.000033277393,0.0003086639,0.000084028194,0.0000033933572],"category_scores_gemma":[0.000037543334,0.00013792208,0.00003443726,0.00022976227,0.00037455268,0.00017293924,0.00027610117,0.000127989,0.0000027645683],"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.0000035964501,0.00019761578,0.27204126,0.000057934165,0.00003675384,0.000029707819,0.0023475648,0.0000052067694,0.00044120708,0.0029302123,0.00020481896,0.7217041],"study_design_scores_gemma":[0.00067042105,0.0012810368,0.8183719,0.000078312754,0.00003983734,0.0003271973,0.000201103,0.12892114,0.00024800544,0.045076665,0.0040976703,0.0006866986],"about_ca_topic_score_codex":0.0002250744,"about_ca_topic_score_gemma":0.000024262998,"teacher_disagreement_score":0.7210174,"about_ca_system_score_codex":0.00001315939,"about_ca_system_score_gemma":0.000037588663,"threshold_uncertainty_score":0.5624299},"labels":[],"label_agreement":null},{"id":"W2052671997","doi":"10.1007/s10710-006-9003-9","title":"Using genetic algorithms for early schedulability analysis and stress testing in real-time systems","year":2006,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Task (project management); Worst-case execution time; Process (computing); Genetic algorithm; Execution time; Stress testing (software); Distributed computing; Embedded system; Machine learning; Operating system","score_opus":0.02595016831673748,"score_gpt":0.27122356463086195,"score_spread":0.24527339631412448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052671997","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.68486625,0.0018366665,0.3123686,0.000012785693,0.0000861645,0.0006432186,0.000007334232,0.00013920107,0.000039793405],"genre_scores_gemma":[0.51128966,0.0000064889164,0.48847634,0.0000014872521,0.000095438416,0.00007430858,0.000005165313,0.00001693565,0.00003419056],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712545,0.00019113658,0.00073316396,0.0009573211,0.0002945148,0.000698389],"domain_scores_gemma":[0.99849963,0.00031110458,0.00025979948,0.00058235176,0.00019728905,0.00014982172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000912618,0.00033464053,0.00060749624,0.00042812515,0.00030216,0.0009937151,0.00037738166,0.00013292726,8.305894e-7],"category_scores_gemma":[0.00010262871,0.00031586064,0.000087890745,0.0014708543,0.0000965476,0.0002786838,0.00022269369,0.00011635025,0.0000013549839],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006188417,0.00007350641,0.85746694,0.0003487201,0.00009176331,0.000014329339,0.00020467264,0.07323102,0.0024952025,0.00006353463,0.0000012268716,0.06600292],"study_design_scores_gemma":[0.00032540777,0.00007588173,0.25444776,0.00008751349,0.00010841177,0.00003375014,0.000028919067,0.74417967,0.00007658686,0.00036066346,0.0000069645453,0.00026848135],"about_ca_topic_score_codex":0.031397372,"about_ca_topic_score_gemma":0.00021102502,"teacher_disagreement_score":0.6709486,"about_ca_system_score_codex":0.00006697785,"about_ca_system_score_gemma":0.0000701125,"threshold_uncertainty_score":0.99992937},"labels":[],"label_agreement":null},{"id":"W2057394292","doi":"10.1007/s10710-015-9242-8","title":"Controlling code growth by dynamically shaping the genotype size distribution","year":2015,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Genetic programming; Overfitting; Code (set theory); Mathematical optimization; Probabilistic logic; Symbolic regression; Range (aeronautics); Evolutionary algorithm; Artificial intelligence; Machine learning; Mathematics; Programming language","score_opus":0.012907622848355477,"score_gpt":0.23404573563309522,"score_spread":0.22113811278473974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057394292","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.040365484,0.0052841455,0.94973314,0.0038725252,0.00012750698,0.00029818868,0.000023186652,0.0001926495,0.0001031912],"genre_scores_gemma":[0.87027895,0.00008617067,0.12902896,0.00015351104,0.00011281738,0.00010860465,0.000038149035,0.000010372657,0.0001824595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887943,0.000055972945,0.0002086536,0.00033182435,0.00021173398,0.0003124033],"domain_scores_gemma":[0.999211,0.00013117139,0.00007594569,0.00028265512,0.00015508085,0.00014413454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675392,0.00014207684,0.00013204709,0.000011437489,0.00043806477,0.00028255658,0.00044862344,0.000049924023,0.0000018250065],"category_scores_gemma":[0.000109209475,0.00010133291,0.000037147514,0.00026943313,0.00009536616,0.00013187523,0.00017267832,0.000119730365,0.00000972696],"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.00004763442,0.00044632697,0.020601235,0.00008112409,0.00014394322,0.000010721701,0.0012327883,0.0038344278,0.0021333117,0.058936253,0.013094625,0.8994376],"study_design_scores_gemma":[0.0005418739,0.00012649922,0.005625546,0.000013862578,0.000023061015,0.00004195388,0.000046562036,0.9537446,0.00003414732,0.016485477,0.02308891,0.00022749654],"about_ca_topic_score_codex":0.0002677581,"about_ca_topic_score_gemma":0.00001606065,"teacher_disagreement_score":0.94991016,"about_ca_system_score_codex":0.000036415982,"about_ca_system_score_gemma":0.000054659053,"threshold_uncertainty_score":0.4132236},"labels":[],"label_agreement":null},{"id":"W2067050690","doi":"10.1007/s10710-010-9102-5","title":"Deployment of parallel linear genetic programming using GPUs on PC and video game console platforms","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Speedup; Implementation; Parallel computing; Video game; Genetic programming; Artificial intelligence; Multimedia; Programming language","score_opus":0.014990666441981625,"score_gpt":0.2570535366019504,"score_spread":0.24206287015996877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067050690","genre_codex":"empirical","genre_gemma":"methods","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.8105397,0.0014756256,0.18685699,0.00018230811,0.00016217784,0.00060948264,0.000003399959,0.00012990205,0.00004040359],"genre_scores_gemma":[0.4531089,0.00006886727,0.54654825,0.000031051226,0.000077394725,0.00008942855,0.0000028566444,0.0000142631,0.000059002927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840826,0.000018002083,0.00036964702,0.0005295962,0.00024879255,0.0004257099],"domain_scores_gemma":[0.9990242,0.00007266907,0.00015675901,0.00046855328,0.00008813623,0.00018968113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020453485,0.00024169305,0.00025083637,0.00011615652,0.00032014563,0.00014035753,0.00033430776,0.000098746976,0.000004842576],"category_scores_gemma":[0.000023954077,0.00020392645,0.000054953907,0.00027861985,0.00021335877,0.00013392935,0.0002422392,0.00021869877,0.000003711232],"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.00003435098,0.0004179252,0.025368063,0.00014144911,0.0000604604,0.000011976894,0.0006906282,0.0033210618,0.003345305,0.0066516898,0.000031081097,0.959926],"study_design_scores_gemma":[0.0016675263,0.00053571584,0.020295672,0.000085951935,0.000056680372,0.00027886944,0.00006899942,0.95734024,0.000788201,0.008201698,0.010138689,0.00054173014],"about_ca_topic_score_codex":0.00024183498,"about_ca_topic_score_gemma":0.00003214538,"teacher_disagreement_score":0.95938426,"about_ca_system_score_codex":0.000012858384,"about_ca_system_score_gemma":0.0000641105,"threshold_uncertainty_score":0.8315879},"labels":[],"label_agreement":null},{"id":"W2069303594","doi":"10.1007/s10710-010-9114-1","title":"Developments in Cartesian Genetic Programming: self-modifying CGP","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Iterated function; Sequence (biology); Cartesian coordinate system; Theoretical computer science; Adder; Mathematical optimization; Graph; Algorithm; Artificial intelligence; Mathematics","score_opus":0.007554399215886767,"score_gpt":0.2345407968960176,"score_spread":0.22698639768013082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069303594","genre_codex":"empirical","genre_gemma":"methods","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.85740685,0.0025507712,0.13565081,0.000857244,0.0006066837,0.0012686036,0.0000028810475,0.0008265301,0.0008296134],"genre_scores_gemma":[0.4668539,0.00003611616,0.53268355,0.00003415176,0.00007068235,0.00022529229,0.0000043624027,0.00001310565,0.00007883038],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997999,0.000039942952,0.0003834834,0.00067447266,0.00026054482,0.0006425231],"domain_scores_gemma":[0.9990605,0.000046445984,0.00009577592,0.00050497893,0.00007948659,0.00021280971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028181094,0.00026399994,0.00021854392,0.00018789117,0.0004098576,0.0003557913,0.00062343944,0.0001183478,0.0000045999764],"category_scores_gemma":[0.000022520284,0.00025116355,0.00004741302,0.000673224,0.00008015221,0.00019800305,0.0002896026,0.0003129878,0.000020795],"study_design_candidate":"design_other","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.0000017465387,0.00022888395,0.120935425,0.000052339812,0.00001760124,0.000018237546,0.00086296594,0.00010206677,0.00046469795,0.0020195856,0.000035481033,0.87526095],"study_design_scores_gemma":[0.001242134,0.0001825518,0.61936486,0.0000672879,0.000033073466,0.00036945794,0.000111117464,0.24895456,0.00018773852,0.004784314,0.12364548,0.001057404],"about_ca_topic_score_codex":0.00031854672,"about_ca_topic_score_gemma":0.00022743408,"teacher_disagreement_score":0.87420356,"about_ca_system_score_codex":0.000030448913,"about_ca_system_score_gemma":0.0001303508,"threshold_uncertainty_score":0.99999404},"labels":[],"label_agreement":null},{"id":"W2076222444","doi":"10.1007/s10710-011-9151-4","title":"Symbiotic coevolutionary genetic programming: a benchmarking study under large attribute spaces","year":2011,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence; Machine learning; Classifier (UML); Benchmarking; Linear subspace; Subspace topology; Preprocessor; Data mining; Mathematics","score_opus":0.022636277193069976,"score_gpt":0.24684379850308896,"score_spread":0.22420752131001898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076222444","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.43366534,0.0069538024,0.5564885,0.00031135106,0.0003660924,0.0014595353,0.000010008149,0.00057141227,0.00017391275],"genre_scores_gemma":[0.67155,0.00005666574,0.32771736,0.000047220736,0.00013768335,0.00027127998,0.000012083219,0.000022020355,0.0001856853],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99715835,0.0001308663,0.00047621623,0.00095362065,0.00040837683,0.0008725675],"domain_scores_gemma":[0.99855864,0.00006888191,0.0001769307,0.00075938343,0.000160382,0.00027579902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044316018,0.00038544185,0.00032777546,0.00019224023,0.0009535263,0.0003377041,0.00076309254,0.0001102902,0.000033536577],"category_scores_gemma":[0.000018833216,0.00035348712,0.000099110366,0.0008117052,0.00014839804,0.00027920984,0.00061580096,0.00023210685,0.000031450294],"study_design_candidate":"observational","study_design_consensus":"observational","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.00001823814,0.0033397994,0.67301893,0.000120316035,0.00027223103,0.000084054125,0.0043088286,0.00039762046,0.000068298345,0.0071973735,0.0004435551,0.31073076],"study_design_scores_gemma":[0.0014523001,0.0014174911,0.7797883,0.00007662844,0.00019115712,0.00032385797,0.0013114442,0.19899948,0.000021926468,0.0073917555,0.007974736,0.0010509136],"about_ca_topic_score_codex":0.000803592,"about_ca_topic_score_gemma":0.00015046915,"teacher_disagreement_score":0.30967984,"about_ca_system_score_codex":0.000052245014,"about_ca_system_score_gemma":0.0001013156,"threshold_uncertainty_score":0.9998917},"labels":[],"label_agreement":null},{"id":"W2095377095","doi":"10.1007/s10710-005-7617-y","title":"A New Approach for Predicting the Final Outcome of Evolution Strategy Optimization Under Noise","year":2005,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Differential evolution; Noise (video); Constant (computer programming); Outcome (game theory); Quadratic equation; Fitness function; Range (aeronautics); Mathematical optimization; Function (biology); Quadratic function; Applied mathematics; Mathematics; Algorithm; Artificial intelligence; Machine learning; Genetic algorithm; Mathematical economics","score_opus":0.02830246072266629,"score_gpt":0.2700299575110928,"score_spread":0.24172749678842653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095377095","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.003263474,0.0012358394,0.99406534,0.00072767644,0.000038211158,0.00044557388,0.0000036267395,0.00007628919,0.00014397295],"genre_scores_gemma":[0.27918065,0.0000127761705,0.72015214,0.000021508153,0.00014173375,0.00009361751,0.000009968859,0.000006204248,0.00038141542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907297,0.00002539507,0.00026987484,0.0002784247,0.00014049123,0.00021281924],"domain_scores_gemma":[0.9994098,0.00005852851,0.000117201875,0.0002687856,0.00008303788,0.00006262761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002458772,0.00011369003,0.000116603675,0.00004907705,0.00031475784,0.00010043766,0.0003054832,0.00004693326,0.0000041109033],"category_scores_gemma":[0.000017668912,0.00008400207,0.00004972942,0.00026076485,0.0000463364,0.00016899772,0.000084647494,0.000069418966,9.4393744e-7],"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.0000047186986,0.000066758395,0.004434359,0.00003189354,0.000013373808,3.6952745e-8,0.00012807305,0.7587156,0.000041530424,0.00832789,0.0001497522,0.22808596],"study_design_scores_gemma":[0.00030175323,0.00006241395,0.0073987083,0.0000064623987,0.000022269025,0.000015050508,0.000063672844,0.98931414,0.000013461175,0.0021531086,0.0005542297,0.00009475505],"about_ca_topic_score_codex":0.00020190173,"about_ca_topic_score_gemma":0.000009600127,"teacher_disagreement_score":0.27591717,"about_ca_system_score_codex":0.000023971945,"about_ca_system_score_gemma":0.000066881556,"threshold_uncertainty_score":0.3425505},"labels":[],"label_agreement":null},{"id":"W2099304917","doi":"10.1007/s10710-008-9060-3","title":"An eigen analysis of the GP community","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"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":"","keywords":"Computer science; Eigenvalues and eigenvectors; Genetic programming; Graph; Theoretical computer science; Connection (principal bundle); Artificial intelligence; Data mining; Mathematics","score_opus":0.019046746242036543,"score_gpt":0.28218547507716985,"score_spread":0.2631387288351333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099304917","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.9969976,0.0010460865,0.0013567349,0.00006292081,0.000064204636,0.00017209063,0.00002167483,0.000011501141,0.00026717532],"genre_scores_gemma":[0.99289346,0.0005159227,0.0060130404,0.00009366866,0.00006461498,0.000013709847,0.00008995977,0.000010752744,0.0003048605],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99878275,0.00017804236,0.00028834905,0.0001800301,0.00026927388,0.0003015322],"domain_scores_gemma":[0.9989361,0.000022556495,0.00009287402,0.0006678727,0.00012918266,0.00015139228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004142258,0.00014488594,0.00021813074,0.00009973652,0.000422884,0.000028314684,0.00045829147,0.00012085288,0.000013553307],"category_scores_gemma":[0.00012277559,0.000097162716,0.0001359121,0.00042002244,0.000525571,0.000003698116,0.0002543609,0.0001599999,0.0000014058245],"study_design_candidate":"observational","study_design_consensus":"observational","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.00008384599,0.0004976338,0.72370803,0.00016678781,0.0009200645,0.0000021788958,0.0016402977,0.0007349572,0.059203427,0.000013254149,0.00061617553,0.21241334],"study_design_scores_gemma":[0.00071869616,0.0012006519,0.9377428,0.000021251182,0.0005070014,0.000041114563,0.00072697265,0.022703405,0.019117242,0.0001511492,0.01664287,0.00042683323],"about_ca_topic_score_codex":0.000711354,"about_ca_topic_score_gemma":0.0003811205,"teacher_disagreement_score":0.21403478,"about_ca_system_score_codex":0.000005538915,"about_ca_system_score_gemma":0.000071544724,"threshold_uncertainty_score":0.39621806},"labels":[],"label_agreement":null},{"id":"W2168085447","doi":"10.1007/s10710-007-9027-9","title":"Introducing probabilistic adaptive mapping developmental genetic programming with redundant mappings","year":2007,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Probabilistic logic; Genetic programming; Set (abstract data type); Implementation; Encoding (memory); Grammatical evolution; Fitness function; Coevolution; Theoretical computer science; Genetic algorithm; Artificial intelligence; Machine learning; Biology","score_opus":0.010779933300425532,"score_gpt":0.21694746148033825,"score_spread":0.2061675281799127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168085447","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.14419346,0.0016803837,0.8521841,0.0003692321,0.00010825144,0.0008627494,0.0000016091852,0.00036522505,0.00023496908],"genre_scores_gemma":[0.3014805,0.000021722302,0.6979585,0.000043337306,0.00014956685,0.00016875325,0.0000063577572,0.00002233352,0.00014889328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723434,0.000041251726,0.0005036201,0.00096104457,0.00038798858,0.00087172724],"domain_scores_gemma":[0.9988581,0.00009587838,0.00018251472,0.00042301478,0.00018139873,0.0002590959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005876799,0.00036227275,0.0002859708,0.00021948865,0.00080065586,0.0003710311,0.0005260019,0.00008297555,0.0000055547835],"category_scores_gemma":[0.0000381255,0.00030758986,0.00005176182,0.00094540545,0.00022573328,0.00024436804,0.00033901466,0.00023920968,0.000012852338],"study_design_candidate":"design_other","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.000019271016,0.00017140324,0.010321047,0.000100629,0.000065520675,0.00004548539,0.001899956,0.0009997793,0.0005071326,0.002142067,0.000064441214,0.98366326],"study_design_scores_gemma":[0.0029760113,0.0017909597,0.30390954,0.0008781983,0.00017020252,0.004328077,0.0035228096,0.5676698,0.00061190437,0.011307055,0.0993429,0.0034925493],"about_ca_topic_score_codex":0.00024833437,"about_ca_topic_score_gemma":0.000072760704,"teacher_disagreement_score":0.9801707,"about_ca_system_score_codex":0.000120384815,"about_ca_system_score_gemma":0.00016284066,"threshold_uncertainty_score":0.9999376},"labels":[],"label_agreement":null},{"id":"W2599286397","doi":"10.1007/s10710-017-9298-8","title":"A univariate marginal distribution algorithm based on extreme elitism and its application to the robotic inverse displacement problem","year":2017,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"British Columbia Knowledge Development Fund; Canada Foundation for Innovation","keywords":"Particle swarm optimization; Computer science; Algorithm; Univariate; Differential evolution; Heuristic; Displacement (psychology); Domain (mathematical analysis); Mathematical optimization; Mathematics; Artificial intelligence; Machine learning","score_opus":0.019666172899434866,"score_gpt":0.2691151408858998,"score_spread":0.2494489679864649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599286397","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.0009139125,0.00020353458,0.9928351,0.0047927396,0.000105832994,0.0009864095,0.000014242818,0.00006477863,0.00008345787],"genre_scores_gemma":[0.21666703,0.000094226496,0.7816121,0.0001821317,0.000120874276,0.0004886928,0.00005096203,0.000020539997,0.00076344766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983812,0.0001180329,0.00020809777,0.00052479724,0.00039421322,0.00037368474],"domain_scores_gemma":[0.998743,0.00006463281,0.00012369415,0.00072216353,0.00013854788,0.00020794898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799458,0.00018194426,0.00015451913,0.00007340563,0.00097588485,0.00086955767,0.000632382,0.00004586219,0.000006787003],"category_scores_gemma":[0.00012693249,0.00013471475,0.000024803476,0.00018423548,0.00006901926,0.00015103359,0.00038535477,0.00012918955,0.000019936824],"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.000013940066,0.0000764173,0.0007645769,0.000055574183,0.000013959043,0.0000062666054,0.00010182451,0.01923524,0.00004045973,0.0023792018,0.00015783866,0.9771547],"study_design_scores_gemma":[0.00043149182,0.00015621292,0.010305703,0.00003645206,0.000015902751,0.000008720885,0.0000063204807,0.98183185,0.000027249764,0.00052189385,0.0065001776,0.00015802585],"about_ca_topic_score_codex":0.00021566241,"about_ca_topic_score_gemma":0.000024131825,"teacher_disagreement_score":0.97699666,"about_ca_system_score_codex":0.000043150667,"about_ca_system_score_gemma":0.00005869553,"threshold_uncertainty_score":0.8385165},"labels":[],"label_agreement":null},{"id":"W3004497404","doi":"10.1007/s10710-019-09372-2","title":"Juan C. Burguillo: Self-organizing coalitions for managing complexity","year":2020,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence; Self-organization","score_opus":0.1685588205066189,"score_gpt":0.37098163290836284,"score_spread":0.20242281240174392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004497404","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.20179628,0.011427068,0.76750374,0.010954886,0.0011192284,0.0021699287,0.0001015261,0.0010683534,0.0038589777],"genre_scores_gemma":[0.84981436,0.000012181782,0.14879161,0.0004600433,0.00040057336,0.000059727554,0.000006479575,0.000033006218,0.000422031],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696416,0.00013022427,0.00082702585,0.0008314542,0.0007405875,0.00050655287],"domain_scores_gemma":[0.99783516,0.00075970165,0.00025163504,0.0004722904,0.00033873966,0.00034250025],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011423164,0.0002619567,0.0005001206,0.00016723889,0.00086560234,0.0010479622,0.0005811876,0.00006658523,0.00012627122],"category_scores_gemma":[0.0010011205,0.00020700594,0.00016145546,0.00079108187,0.000101409896,0.00015806829,0.00037503862,0.00012712524,0.00006213352],"study_design_candidate":"design_other","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.00014189625,0.00020303408,0.070109606,0.00035971362,0.0001667752,0.000036173788,0.0071512,0.0017136075,0.0011555378,0.031001955,0.04302895,0.84493154],"study_design_scores_gemma":[0.0010646496,0.0002842001,0.010142633,0.0000611176,0.00006804058,0.000055496777,0.0019418395,0.39317992,0.00003886601,0.18000335,0.4125742,0.00058569445],"about_ca_topic_score_codex":0.00017500353,"about_ca_topic_score_gemma":0.00005648781,"teacher_disagreement_score":0.84434587,"about_ca_system_score_codex":0.00002241663,"about_ca_system_score_gemma":0.00004501413,"threshold_uncertainty_score":0.99998903},"labels":[],"label_agreement":null},{"id":"W3022915729","doi":"10.1007/s10710-020-09390-5","title":"Stock selection heuristics for performing frequent intraday trading with genetic programming","year":2020,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Mitacs","keywords":"Sharpe ratio; Computer science; Trading strategy; Portfolio; Stock (firearms); Algorithmic trading; Profitability index; Heuristics; Econometrics; Investment strategy; Genetic programming; Profit (economics); Financial economics; Business; Economics; Machine learning; Finance; Microeconomics","score_opus":0.027021859492645354,"score_gpt":0.21071423114304194,"score_spread":0.1836923716503966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022915729","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.8239658,0.010003487,0.16147596,0.0010244619,0.00032229288,0.0018088674,0.000048121005,0.00027000584,0.0010810304],"genre_scores_gemma":[0.8083895,0.0001715002,0.1905158,0.00017392583,0.000337318,0.0002487778,0.000018079583,0.00005298208,0.00009214105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819225,0.00001513458,0.0005411249,0.00061427645,0.00006639113,0.00057081785],"domain_scores_gemma":[0.99932605,0.00004285837,0.000255016,0.0001376216,0.000051127892,0.00018732264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023450416,0.0003062893,0.00043540922,0.000108216846,0.00044608937,0.00034249033,0.00015340102,0.00009846413,0.000031122145],"category_scores_gemma":[0.00008799455,0.00029236995,0.000079882026,0.0002980319,0.00010045802,0.00016247954,0.000037537688,0.0001683286,0.0000057418547],"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.0002570533,0.00021256851,0.36981726,0.0013906164,0.0002249432,0.000013428394,0.0024305948,0.0011624696,0.00017196577,0.02083495,0.0006783718,0.6028058],"study_design_scores_gemma":[0.003200723,0.005606886,0.075270355,0.00021590896,0.00019478555,0.00010821521,0.00057584286,0.6722099,0.00022736458,0.019324496,0.22108638,0.0019791282],"about_ca_topic_score_codex":0.00026028635,"about_ca_topic_score_gemma":0.0000379954,"teacher_disagreement_score":0.67104745,"about_ca_system_score_codex":0.00004928551,"about_ca_system_score_gemma":0.00004211147,"threshold_uncertainty_score":0.99995285},"labels":[],"label_agreement":null},{"id":"W3177052905","doi":"10.1007/s10710-021-09418-4","title":"Evolving hierarchical memory-prediction machines in multi-task reinforcement learning","year":2021,"lang":"en","type":"preprint","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Reinforcement learning; Computer science; Task (project management); Variety (cybernetics); Encoding (memory); Artificial intelligence; Action (physics); ENCODE; Identification (biology); Salient; Machine learning; Decomposition; Engineering","score_opus":0.015449851232142396,"score_gpt":0.2573528990363186,"score_spread":0.24190304780417618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177052905","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.08806127,0.012057834,0.8970006,0.0007345426,0.0006454467,0.000797232,0.0000064424553,0.0004603449,0.00023627939],"genre_scores_gemma":[0.5288731,0.00063793093,0.4690252,0.000049888287,0.00019458105,0.0004773755,0.00016282717,0.000030209858,0.00054892094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968749,0.00019371785,0.0006911196,0.0012060711,0.0004215207,0.0006126405],"domain_scores_gemma":[0.9985392,0.00009825144,0.0002296032,0.0007700265,0.00015949106,0.00020343403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005437939,0.00045779903,0.00046843328,0.0003069311,0.00049826974,0.00074539427,0.0007580493,0.00028435077,0.000020676089],"category_scores_gemma":[0.00011693379,0.00045474013,0.00014232729,0.00049448456,0.00010819871,0.00024095038,0.002162695,0.0011686921,0.0000058840405],"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.000008461037,0.00036729756,0.049612977,0.00049706193,0.0000967442,0.00006236131,0.002748429,0.30729136,0.0003271035,0.00040867252,0.00011358326,0.63846594],"study_design_scores_gemma":[0.00048173402,0.00007145394,0.04317596,0.0002574459,0.000027130785,0.000056837875,0.00009472567,0.95339733,0.000015008501,0.0010946748,0.0009149443,0.000412721],"about_ca_topic_score_codex":0.0015100935,"about_ca_topic_score_gemma":0.00014287322,"teacher_disagreement_score":0.646106,"about_ca_system_score_codex":0.000114097405,"about_ca_system_score_gemma":0.00020072822,"threshold_uncertainty_score":0.99979043},"labels":[],"label_agreement":null},{"id":"W4242649666","doi":"10.1007/s10710-007-9054-6","title":"Editorial introduction","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Water Governance and Infrastructure","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.007028228729694921,"score_gpt":0.23499042799946443,"score_spread":0.22796219926976952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242649666","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.93005556,0.0015714422,0.0004472053,0.002107932,0.062304184,0.0002943222,0.000003450202,0.00024025398,0.0029756709],"genre_scores_gemma":[0.70889795,0.0008867733,0.0126115475,0.00007058741,0.27350593,0.00002771537,0.000008379842,0.000016704356,0.003974428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991279,0.00004282167,0.00010714649,0.00019478549,0.000256278,0.00027106746],"domain_scores_gemma":[0.9996981,0.0000115186,0.000043811797,0.00010101482,0.00006347472,0.00008208526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015444258,0.00008672375,0.00009805921,0.000028281438,0.0007254547,0.000069143076,0.00009541708,0.000083749605,0.00006922859],"category_scores_gemma":[0.00007623864,0.00007439867,0.000026602764,0.00013535093,0.00023290528,0.0001332765,0.000027922188,0.00009833005,0.000013731824],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004002227,0.000048076043,0.09111986,0.000025132527,0.000025173988,0.0000062639156,0.014630105,0.000068032066,0.00031728786,0.00095195294,0.6301162,0.2626519],"study_design_scores_gemma":[0.00015666374,0.00004464829,0.008578014,0.0000034001773,0.000007647255,0.00000985673,0.00024551735,0.000042012307,0.0000343237,0.0010830055,0.9896871,0.00010780128],"about_ca_topic_score_codex":0.00270103,"about_ca_topic_score_gemma":0.00022565878,"teacher_disagreement_score":0.35957092,"about_ca_system_score_codex":0.000021519276,"about_ca_system_score_gemma":0.000059852493,"threshold_uncertainty_score":0.55796844},"labels":[],"label_agreement":null},{"id":"W4292415121","doi":"10.1007/s10710-022-09437-9","title":"Editorial Introduction","year":2022,"lang":"en","type":"editorial","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.004277830987765302,"score_gpt":0.22872496680388982,"score_spread":0.22444713581612452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292415121","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011869714,0.0027350797,0.035434872,0.0006458491,0.96043557,0.00029065413,0.00003284385,0.0003248065,0.00008845107],"genre_scores_gemma":[0.000010296538,0.00036513002,0.09620491,0.000008715526,0.90122694,0.0004116014,0.00028951818,0.000027776217,0.0014551043],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974144,0.000085086744,0.00032767258,0.0009284832,0.00083427917,0.000410071],"domain_scores_gemma":[0.998597,0.00016881463,0.00018238943,0.0007318008,0.00019552438,0.0001244465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004234477,0.00031080443,0.0002920798,0.00014459691,0.0007672864,0.00042095166,0.0008665505,0.00030799967,0.00005566591],"category_scores_gemma":[0.00014416796,0.00030723328,0.00008532374,0.0004347262,0.00007604248,0.00018071689,0.0007480496,0.0007568605,0.000018101924],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000003748676,0.000060106293,0.000012277514,0.00003946019,0.000021520198,0.0000013944706,0.00006106857,0.00011355116,0.0000049623886,0.00032870215,0.89974505,0.09960814],"study_design_scores_gemma":[0.00022581988,0.0001499828,0.000019501178,0.000007286742,0.000030545067,0.000009806626,0.000011143831,0.008597892,9.968006e-7,0.002395086,0.9882212,0.00033070458],"about_ca_topic_score_codex":0.00031758047,"about_ca_topic_score_gemma":0.000008832857,"teacher_disagreement_score":0.09927743,"about_ca_system_score_codex":0.0000859526,"about_ca_system_score_gemma":0.00024638893,"threshold_uncertainty_score":0.99993795},"labels":[],"label_agreement":null},{"id":"W4310375416","doi":"10.1007/s10710-022-09446-8","title":"Benchmarking ensemble genetic programming with a linked list external memory on scalable partially observable tasks","year":2022,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Observable; Scalability; Operator (biology); State (computer science); Artificial intelligence; Machine learning; Set (abstract data type); Genetic programming; Identification (biology); Algorithm; Programming language","score_opus":0.013273359654309161,"score_gpt":0.2288545776728534,"score_spread":0.21558121801854424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310375416","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.49030095,0.005882849,0.49930233,0.0011061176,0.00047922498,0.0015904543,0.000013264723,0.0006922923,0.00063250813],"genre_scores_gemma":[0.47795147,0.00004404868,0.5196529,0.00019662699,0.00022382566,0.0010197375,0.000017493998,0.000034490185,0.0008594118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692917,0.00014314115,0.00042986035,0.00098861,0.00065770413,0.0008514999],"domain_scores_gemma":[0.99855334,0.000099549165,0.00020693554,0.0007718738,0.000106863605,0.00026145205],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00046198565,0.00037051685,0.00031849477,0.00015681707,0.0018844226,0.00057340675,0.000848807,0.00006448429,0.000057328747],"category_scores_gemma":[0.000014335688,0.0003361623,0.00008759641,0.0008304466,0.00012793067,0.00021342158,0.0006337926,0.00040230664,0.0000106930365],"study_design_candidate":"design_other","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.000048350288,0.00052507216,0.018549714,0.00008175883,0.000055684555,0.00008989003,0.0006261377,0.040393904,0.00069414295,0.0012161592,0.00034388778,0.9373753],"study_design_scores_gemma":[0.0015212992,0.0023506186,0.03743979,0.00014784305,0.00009265461,0.0006914349,0.00020463314,0.8825511,0.00021303068,0.0032119246,0.07045731,0.0011184126],"about_ca_topic_score_codex":0.0009445468,"about_ca_topic_score_gemma":0.00011944562,"teacher_disagreement_score":0.9362569,"about_ca_system_score_codex":0.000090145004,"about_ca_system_score_gemma":0.00017851924,"threshold_uncertainty_score":0.99990904},"labels":[],"label_agreement":null},{"id":"W4386457064","doi":"10.1007/s10710-023-09459-x","title":"Evolutionary design and analysis of ribozyme-based logic gates","year":2023,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer science; Theoretical computer science; Synthetic biology; Ribozyme; Artificial intelligence; Bioinformatics","score_opus":0.01566732066568915,"score_gpt":0.24800719039928373,"score_spread":0.23233986973359458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386457064","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.9029779,0.010936309,0.085226394,0.00023876793,0.00006595864,0.00040212244,0.000023680184,0.00006903271,0.00005987628],"genre_scores_gemma":[0.9187017,0.00047023583,0.08031755,0.000048732647,0.000037213882,0.00007885499,0.000118108335,0.000016818716,0.00021075695],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990173,0.00010210564,0.0001914417,0.000334354,0.000113137474,0.00024164036],"domain_scores_gemma":[0.9995232,0.000053612475,0.000075772456,0.00021823359,0.000054663873,0.000074517615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032844138,0.00015170607,0.00022440069,0.00019158782,0.00012100741,0.000027852971,0.00009813606,0.00010463597,0.000015025044],"category_scores_gemma":[0.00007017127,0.00013034142,0.00008071466,0.00046921498,0.0001055659,0.0000029324485,0.000076312805,0.000033414453,0.0000023033263],"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.00027555437,0.00013858914,0.095009305,0.000258889,0.0011708561,0.000013663231,0.0001160131,0.017958282,0.6458177,0.00029405695,0.00046837484,0.2384787],"study_design_scores_gemma":[0.0021725558,0.002959119,0.18692277,0.00014079938,0.0028521938,0.000043570064,0.00027218746,0.51462567,0.26383373,0.01238933,0.012123363,0.0016647034],"about_ca_topic_score_codex":0.000057638772,"about_ca_topic_score_gemma":0.000006582203,"teacher_disagreement_score":0.49666741,"about_ca_system_score_codex":0.000003087387,"about_ca_system_score_gemma":0.000030072728,"threshold_uncertainty_score":0.5315169},"labels":[],"label_agreement":null},{"id":"W4388486995","doi":"10.1007/s10710-023-09462-2","title":"Denoising autoencoder genetic programming: strategies to control exploration and exploitation in search","year":2023,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"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é Laval","funders":"Johannes Gutenberg-Universität Mainz; Deutscher Akademischer Austauschdienst","keywords":"Computer science; Genetic programming; Autoencoder; Artificial intelligence; Machine learning; Sampling (signal processing); Probabilistic logic; Mathematical optimization; Artificial neural network; Mathematics","score_opus":0.023510881475824343,"score_gpt":0.2816448645220405,"score_spread":0.25813398304621615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388486995","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.28721106,0.00090218533,0.7089728,0.0018938909,0.00006345218,0.0006532819,0.0000017079517,0.0002790773,0.000022499213],"genre_scores_gemma":[0.66607237,0.00012754738,0.33311117,0.00004550729,0.000060350612,0.00048226805,0.000008689607,0.000014299584,0.000077833414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840474,0.00007790051,0.00029000716,0.0005299625,0.0002447189,0.00045266462],"domain_scores_gemma":[0.99937016,0.000086206644,0.00004663682,0.00025701162,0.0000919066,0.00014809908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037274027,0.00017627157,0.00016972567,0.00030588623,0.0003299161,0.0006305034,0.0002294503,0.000059057904,0.0000016028788],"category_scores_gemma":[0.000026741642,0.00017083353,0.00002370274,0.001061764,0.00006270969,0.0004994241,0.0001498932,0.00010954442,0.000017494327],"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.00000817447,0.00007424298,0.01030846,0.00007421335,0.000013729394,0.000013885077,0.004394839,0.0519958,0.00067344774,0.0027793038,0.00007513156,0.9295888],"study_design_scores_gemma":[0.00050413096,0.00020210426,0.10698988,0.00004580748,0.000010241102,0.000023835926,0.0012348697,0.8782941,0.00003377464,0.011005976,0.0013861516,0.00026911785],"about_ca_topic_score_codex":0.00031545857,"about_ca_topic_score_gemma":0.00012170014,"teacher_disagreement_score":0.9293197,"about_ca_system_score_codex":0.000027037811,"about_ca_system_score_gemma":0.00007362265,"threshold_uncertainty_score":0.6966389},"labels":[],"label_agreement":null},{"id":"W4388912745","doi":"10.1007/s10710-023-09473-z","title":"W. B. Langdon “Jaws 30”","year":2023,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Bioethics Society","funders":"","keywords":"Computer science; Genetic programming; Coevolution; Field (mathematics); Order (exchange); Field-programmable gate array; Computer graphics (images); Artificial intelligence; Operating system; Biology; Mathematics; Evolutionary biology","score_opus":0.01232736480788241,"score_gpt":0.24722457078725016,"score_spread":0.23489720597936775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388912745","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.31114483,0.0056359335,0.6678851,0.007305944,0.0006719319,0.00078702084,0.000012286364,0.0033489512,0.0032079804],"genre_scores_gemma":[0.501178,0.00038729253,0.493763,0.00020464997,0.0003211713,0.0002783752,0.000030849456,0.000025392526,0.0038112453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914205,0.000018943518,0.00012556704,0.00029903135,0.00013175042,0.0002826286],"domain_scores_gemma":[0.9995125,0.00003803593,0.000031172603,0.00029890877,0.000032849995,0.00008651829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014837962,0.00010168402,0.00009201916,0.00008004163,0.00027393026,0.00014261181,0.0002962606,0.00003619928,0.000012151428],"category_scores_gemma":[0.000011844119,0.00008857622,0.000029575778,0.0005316381,0.000038819562,0.00009230698,0.00020581049,0.00006499736,0.00021368092],"study_design_candidate":"design_other","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":[8.932155e-7,0.000047766174,0.009369572,0.00003681154,0.000013972124,0.000011599642,0.00031356286,0.00040015494,0.00022612944,0.009855318,0.0050399085,0.9746843],"study_design_scores_gemma":[0.0003164014,0.000100433856,0.09665469,0.000021778738,0.000011693931,0.000052448744,0.000059136186,0.68661547,0.00006123783,0.020667344,0.19510289,0.00033650806],"about_ca_topic_score_codex":0.00010629796,"about_ca_topic_score_gemma":0.0000056543827,"teacher_disagreement_score":0.97434783,"about_ca_system_score_codex":0.000007632238,"about_ca_system_score_gemma":0.000020670564,"threshold_uncertainty_score":0.36120334},"labels":[],"label_agreement":null},{"id":"W4403062981","doi":"10.1007/s10710-024-09495-1","title":"Leonardo Vanneschi and Sara Silva: lectures on intelligent systems","year":2024,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.010466178199304059,"score_gpt":0.23879963516277397,"score_spread":0.2283334569634699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403062981","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.21591279,0.10879396,0.66790473,0.0016376933,0.0030544994,0.0009638996,0.0000054384655,0.0012668996,0.00046011165],"genre_scores_gemma":[0.9485453,0.0002514295,0.050472923,0.00007152222,0.00030559648,0.00007236469,0.0000031274012,0.000025132767,0.0002526204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997898,0.000111011075,0.00031363752,0.00089183974,0.0003068249,0.00047868097],"domain_scores_gemma":[0.9989881,0.00024302719,0.00004296588,0.0004839745,0.00005858345,0.00018333395],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042954265,0.00032410317,0.00030038113,0.00019318116,0.0002437679,0.0013508112,0.00042068338,0.00009427086,0.0000048447314],"category_scores_gemma":[0.000049250466,0.0002484457,0.000069055175,0.00040617617,0.00011423725,0.00012823862,0.00039952178,0.00023779135,0.000021465756],"study_design_candidate":"design_other","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.0000066159673,0.00006157471,0.0019207479,0.0003374157,0.000045146786,0.000049690905,0.0007111489,0.0036528562,0.00007124648,0.0038689903,0.00022394938,0.9890506],"study_design_scores_gemma":[0.00015831168,0.00055183086,0.00339725,0.00016293912,0.000029430543,0.00029658084,0.000067697234,0.95688516,0.00013946119,0.007457917,0.030411365,0.00044206428],"about_ca_topic_score_codex":0.0003278368,"about_ca_topic_score_gemma":0.000022910972,"teacher_disagreement_score":0.98860854,"about_ca_system_score_codex":0.00003973307,"about_ca_system_score_gemma":0.00004527395,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W4407794873","doi":"10.1007/s10710-025-09507-8","title":"Editorial introduction for the special issue on highlights of genetic programming 2023 events","year":2025,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Biomedical and Engineering Education","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence","score_opus":0.003858480527120507,"score_gpt":0.21886758592050456,"score_spread":0.21500910539338405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407794873","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14764413,0.017726967,0.12415837,0.010143624,0.69256437,0.005463682,0.000058136364,0.0013367123,0.000903996],"genre_scores_gemma":[0.19125319,0.001284902,0.07005724,0.000053546035,0.73241574,0.001295517,0.0001012894,0.000120705954,0.0034178921],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990552,0.000012978402,0.00026502274,0.00021743047,0.00017004187,0.00027929054],"domain_scores_gemma":[0.99956286,0.000088560206,0.000034164346,0.00019894495,0.000060723138,0.000054752305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671133,0.00017221825,0.00017565813,0.00010821003,0.0001375661,0.000044324934,0.00014181252,0.00011302133,0.000019348612],"category_scores_gemma":[0.00006317121,0.00012619927,0.0000555173,0.00028692395,0.00005580728,0.000028646007,0.000025986794,0.0001251599,0.0000050604167],"study_design_candidate":"not_applicable","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.000037090347,0.00006737567,0.00030639354,0.00070850307,0.00009511179,1.5056982e-7,0.00014805677,0.005758578,0.00027091266,0.00010464194,0.16530989,0.8271933],"study_design_scores_gemma":[0.0003606262,0.00013171662,0.003434868,0.000072005925,0.00007730643,0.0000016571225,0.00003661984,0.019359266,0.0003237578,0.0004309584,0.9756256,0.0001456558],"about_ca_topic_score_codex":0.0000610601,"about_ca_topic_score_gemma":0.000012861185,"teacher_disagreement_score":0.82704765,"about_ca_system_score_codex":0.00003138096,"about_ca_system_score_gemma":0.00002144099,"threshold_uncertainty_score":0.51462567},"labels":[],"label_agreement":null}]}