{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":691,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":691,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c99f131f2551","filters":{"topic":"Evolutionary Algorithms and Applications"}},"results":[{"id":"W2109042184","doi":"","title":"DEAP: evolutionary algorithms made easy","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1670,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Documentation; License; Computation; Evolutionary algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01862596944463763,"gpt":0.2539693013165884,"spread":0.2353433318719508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001560871,0.0001054586,0.00008033891,0.00006239129,0.0002246055,0.0000362446,0.0005599991,0.00005163909,0.0001617627],"category_scores_gemma":[0.000008943111,0.00009412295,0.00005907406,0.0003812601,0.0000411476,0.0009793044,0.0002272584,0.00009365972,0.001112441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005388738,"about_ca_system_score_gemma":0.00004435279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000288698,"about_ca_topic_score_gemma":4.439732e-7,"domain_scores_codex":[0.9989765,0.00002649729,0.0001583966,0.0002251113,0.0002286021,0.0003849285],"domain_scores_gemma":[0.9991814,0.00005127629,0.00003694704,0.0004742557,0.00005637341,0.0001997754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[4.735724e-7,0.0002313138,0.002972187,0.000002361271,0.00001032241,9.199855e-7,0.00008612404,0.00003168384,0.0003156477,0.9531039,0.02058062,0.02266442],"study_design_scores_gemma":[0.0003532275,0.00004544891,0.2720677,0.000007613261,0.000009392808,0.0002143011,0.00005508372,0.1923884,0.0007701716,0.02825015,0.5052942,0.0005443328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008727949,0.0008104848,0.963806,0.002053872,0.0003452997,0.000119413,0.000003714999,0.0003677631,0.03162063],"genre_scores_gemma":[0.2651085,0.00002740146,0.7244648,0.0006337831,0.0005194008,0.00007809292,0.0000106148,0.000009068393,0.009148351],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9248538,"threshold_uncertainty_score":0.9996653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2755371172","doi":"10.1016/j.inffus.2017.09.010","title":"Dynamic classifier selection: Recent advances and perspectives","year":2017,"lang":"en","type":"article","venue":"Information Fusion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":429,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Classifier (UML); Machine learning; Oracle; Artificial intelligence; Categorization; Data mining; Probabilistic logic","retraction":null,"screen_n_in":null,"score":{"opus":0.01325651329638909,"gpt":0.2633503160558346,"spread":0.2500938027594455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008671128,0.00005514182,0.00004527794,0.00005244215,0.0009357556,0.0002978314,0.0002516889,0.00003075923,0.00002457313],"category_scores_gemma":[0.00003038638,0.00004920089,0.00001346979,0.00007410421,0.00004764969,0.004244224,0.0001396533,0.00006094628,0.00005829881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000394025,"about_ca_system_score_gemma":0.00002730823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005646915,"about_ca_topic_score_gemma":0.000006987775,"domain_scores_codex":[0.9995705,0.000007492292,0.0001187958,0.00009780263,0.0001226316,0.000082708],"domain_scores_gemma":[0.999428,0.00001125289,0.0001348112,0.0002494298,0.000137678,0.00003886749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003601497,0.00002477817,0.0004295084,0.00001056264,0.000003493745,1.515043e-7,0.001584654,0.0001199662,0.0001015141,0.08709321,0.0008638903,0.9097646],"study_design_scores_gemma":[0.0002436151,0.00003702918,0.0892997,0.00001097059,0.000001914538,0.00002137317,0.000376503,0.3446274,0.00006076,0.005770853,0.5594286,0.0001212841],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01383871,0.001019546,0.9366876,0.01665417,0.000336694,0.0002604117,0.000005073325,0.0002012181,0.0309965],"genre_scores_gemma":[0.897762,0.008808926,0.09231437,0.000291035,0.00007061812,0.00006181765,0.00001619381,0.000004180192,0.0006708621],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9096434,"threshold_uncertainty_score":0.719717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988844742","doi":"10.1016/j.patcog.2014.05.003","title":"Dynamic selection of classifiers—A comprehensive review","year":2014,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":323,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fundação Araucária; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Classifier (UML); Computer science; Machine learning; Artificial intelligence; Selection (genetic algorithm); Relation (database); Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.02605157689707486,"gpt":0.2663556851878202,"spread":0.2403041082907454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001108645,0.00007176674,0.0001186759,0.00005190382,0.00006587357,0.00001208639,0.0001714432,0.00003177422,0.00005272468],"category_scores_gemma":[0.00001355314,0.00007189023,0.00005202877,0.0002535544,0.00002117037,0.0001844379,0.0000375542,0.00007323673,0.0001561002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002359331,"about_ca_system_score_gemma":0.00001322002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001455782,"about_ca_topic_score_gemma":0.000004366374,"domain_scores_codex":[0.999297,0.0000727078,0.0001982501,0.0002014434,0.000128996,0.0001016108],"domain_scores_gemma":[0.9994043,0.00006072192,0.0001309152,0.0001794125,0.0001900247,0.00003469228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.325657e-7,0.00006257285,0.000254136,0.0002959768,0.000009266812,1.605342e-7,0.00002079302,0.000006254947,0.001505074,0.0002924419,0.001033119,0.9965196],"study_design_scores_gemma":[0.0007474959,0.000330494,0.0739559,0.001935349,0.00007307674,0.00009977312,0.00002308906,0.8652847,0.00313532,0.02470808,0.02912113,0.0005855988],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008628677,0.0005262882,0.9885417,0.001207087,0.0001086811,0.000197351,0.000008303454,0.00008303182,0.0006989245],"genre_scores_gemma":[0.9342818,0.003168695,0.05981158,0.002289243,0.00007729977,0.0001375102,0.0001547834,0.00001325546,0.00006585157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9959339,"threshold_uncertainty_score":0.2931599,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.01086872803388606,"gpt":0.2758444820490048,"spread":0.2649757540151187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378578,0.0002083319,0.0002172411,0.0001251724,0.0003287341,0.0008186177,0.001319013,0.00009019471,0.00001826801],"category_scores_gemma":[0.00003302238,0.0001895372,0.00003742859,0.0005684093,0.0001082332,0.0003217637,0.0008531375,0.0002644508,0.00002305787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001259294,"about_ca_system_score_gemma":0.00006850283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001641596,"about_ca_topic_score_gemma":0.0005668225,"domain_scores_codex":[0.9983384,0.00004173381,0.0003169158,0.0006281839,0.0001859339,0.0004888031],"domain_scores_gemma":[0.9990349,0.00004607919,0.00008098958,0.0006148011,0.00006624169,0.000157009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000231943,0.0001686256,0.04065345,0.00002428412,0.000008069536,0.00001150746,0.0003426344,0.0000970699,0.0004543746,0.004202815,0.0001774883,0.9538574],"study_design_scores_gemma":[0.001203743,0.0002910888,0.3173167,0.00007158389,0.00002284145,0.000291475,0.0001203006,0.316604,0.0002026308,0.02894479,0.3339917,0.0009390831],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7684237,0.008727514,0.2108178,0.006389713,0.000823268,0.002725802,0.000006145555,0.0006589267,0.001427073],"genre_scores_gemma":[0.2787963,0.00008685527,0.7200388,0.00006324468,0.0001259308,0.0003646496,0.000005010845,0.00001472179,0.0005044651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9529183,"threshold_uncertainty_score":0.7893949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389976716","doi":"10.1007/s11042-023-17167-y","title":"PyGAD: an intuitive genetic algorithm Python library","year":2023,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":198,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Python (programming language); Programming language; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01994590268256709,"gpt":0.2566243233333891,"spread":0.236678420650822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008471445,0.0001434919,0.000119676,0.0001206861,0.0003826273,0.0002433475,0.0005432026,0.00007241785,0.0000220801],"category_scores_gemma":[0.000008172401,0.0001431482,0.00003891705,0.0009418431,0.0001058016,0.0006939286,0.0002939976,0.0001163031,0.0003419695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001037905,"about_ca_system_score_gemma":0.00006213655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001020615,"about_ca_topic_score_gemma":0.000001046478,"domain_scores_codex":[0.9987967,0.00003305923,0.0002123465,0.0005308453,0.0001595757,0.0002674805],"domain_scores_gemma":[0.9989356,0.0001417864,0.00005968362,0.0005951944,0.00004534849,0.000222416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.844981e-7,0.0000907275,0.0001707913,0.000004379373,0.000007620816,0.000002233778,0.0002503971,0.00007241651,0.0003232057,0.02470366,0.002182361,0.9721918],"study_design_scores_gemma":[0.000324977,0.00006505878,0.09181871,0.000008755201,0.00001042835,0.00002141015,0.0001406131,0.6702369,0.0004346675,0.02562469,0.2109598,0.0003540016],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002840153,0.00020609,0.9915419,0.002236122,0.00007017171,0.000738308,0.0002098232,0.001006275,0.001151109],"genre_scores_gemma":[0.01720052,0.0007724875,0.9758542,0.0004895904,0.0007480416,0.002832437,0.0006920052,0.0000435328,0.001367178],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9718377,"threshold_uncertainty_score":0.5837414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077218694","doi":"10.1142/s021800140300271x","title":"A Methodology for Feature Selection Using Multiobjective Genetic Algorithms for Handwritten Digit String Recognition","year":2003,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Classifier (UML); Pattern recognition (psychology); Feature selection; Artificial intelligence; Novelty; String (physics); Genetic algorithm; Machine learning; NIST; Selection (genetic algorithm); Data mining; Speech recognition; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2233585243679647,"gpt":0.3794537395607968,"spread":0.156095215192832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215972,0.0001390628,0.0001856918,0.0002740631,0.0001886117,0.0001979877,0.0002546718,0.0000948817,0.00001960868],"category_scores_gemma":[0.0003539775,0.0001387579,0.0001437312,0.0001670201,0.00004967544,0.0005246415,0.00002852011,0.0001548996,0.000004686602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009128413,"about_ca_system_score_gemma":0.00008732557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002083675,"about_ca_topic_score_gemma":0.00001564568,"domain_scores_codex":[0.9986815,0.0001138883,0.0005231079,0.0002823717,0.0002135165,0.0001855935],"domain_scores_gemma":[0.9974339,0.0004899586,0.0004423442,0.00006651052,0.00148358,0.00008370398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000459465,0.0001289166,0.0001082868,0.000009698952,0.00008938335,0.000003324431,0.0002841213,0.0003688923,0.005647577,0.001082237,0.00002544003,0.9922062],"study_design_scores_gemma":[0.0006201954,0.000620186,0.00062642,0.0001868454,0.00009651576,0.001096193,0.0007097646,0.2750097,0.2418761,0.4774305,0.001260627,0.0004669655],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04750274,0.00008445846,0.9505389,0.0005387165,0.0008479682,0.0003349426,0.000120003,0.00001971827,0.0000125039],"genre_scores_gemma":[0.3400525,0.00008150132,0.6589364,0.000230081,0.0005816406,0.00005536768,0.00003453587,0.00001312063,0.00001487267],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9917392,"threshold_uncertainty_score":0.5658382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072396808","doi":"10.1038/nrg1921","title":"From artificial evolution to computational evolution: a research agenda","year":2006,"lang":"en","type":"review","venue":"Nature Reviews Genetics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Memorial University of Newfoundland","funders":"Francis Crick Institute","keywords":"Biology; Evolutionary biology; Computational biology","retraction":null,"screen_n_in":null,"score":{"opus":0.1358435689049677,"gpt":0.4411245088382254,"spread":0.3052809399332577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001520077,0.0005860284,0.001478567,0.0006167828,0.000585165,0.0002768459,0.002424525,0.001039351,0.00003179449],"category_scores_gemma":[0.0001695312,0.0005188991,0.0006712985,0.003913251,0.0001113645,0.0001511413,0.0007737533,0.002097185,0.00211986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076461,"about_ca_system_score_gemma":0.001199101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005783853,"about_ca_topic_score_gemma":0.0000316856,"domain_scores_codex":[0.9940736,0.001012696,0.00149497,0.001477604,0.001252143,0.000688987],"domain_scores_gemma":[0.9964616,0.0004755502,0.0004745845,0.001675202,0.0006499017,0.0002631562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[4.914955e-7,0.0001149065,5.982899e-7,0.0008229712,0.00002686672,0.000004728992,0.00002113089,0.0002087445,7.247067e-7,0.04406506,0.08672465,0.8680092],"study_design_scores_gemma":[0.00004586898,0.00005079071,0.00002947568,0.002265711,0.000122245,0.00002428489,0.000002218996,0.002565053,2.688889e-7,0.02681591,0.9675924,0.0004858338],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[2.500369e-7,0.6526899,0.3445018,0.0003041895,0.0005450755,0.00128668,0.0001770356,0.00008382433,0.0004112502],"genre_scores_gemma":[0.000003591633,0.806058,0.189749,0.00009531646,0.002424855,0.0006045139,0.0005787693,0.00004112691,0.0004447343],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.8808677,"threshold_uncertainty_score":0.9997262,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168924884","doi":"10.1109/cec.2006.1688662","title":"Improving Evolution Strategies through Active Covariance Matrix Adaptation","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CMA-ES; Adaptation (eye); Evolution strategy; Covariance matrix; Test suite; Computer science; Suite; Covariance; Mathematical optimization; Matrix (chemical analysis); Mutation; Algorithm; Artificial intelligence; Evolutionary computation; Machine learning; Mathematics; Statistics; Test case; Biology; Genetics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01255610258054151,"gpt":0.2521942232550595,"spread":0.239638120674518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006548545,0.00008914994,0.00006783832,0.00003307163,0.0002357863,0.000144499,0.0002838859,0.00004376052,0.00001453726],"category_scores_gemma":[0.000004668188,0.00008500381,0.0000338446,0.0003669456,0.00003341517,0.002090926,0.00006159218,0.00006999759,0.00005934472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001002012,"about_ca_system_score_gemma":0.0001247314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002420302,"about_ca_topic_score_gemma":0.0001229165,"domain_scores_codex":[0.9992023,0.00002143413,0.0001594907,0.0002806904,0.000163207,0.0001729307],"domain_scores_gemma":[0.9994782,0.00003894585,0.00008743905,0.0002657256,0.0001100925,0.00001957725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001293101,0.00004078233,0.00001554403,0.000002740014,0.000002284504,6.0358e-7,0.0000821862,0.009574801,0.001578434,0.9849109,0.0003802466,0.003410195],"study_design_scores_gemma":[0.0001595524,0.00002387537,0.005614236,0.000003520127,0.000003239335,0.000008593374,0.0004385961,0.7311705,0.0006098717,0.2603086,0.001525873,0.0001336101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001434827,0.0001126586,0.9852204,0.0007197875,0.0001006787,0.0001475835,0.000003930206,0.0002724822,0.01198763],"genre_scores_gemma":[0.5775136,0.000002475588,0.4216422,0.00002044272,0.00009500697,0.00003289664,0.000008550956,0.000003313579,0.0006814941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7246023,"threshold_uncertainty_score":0.3658789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1541677343","doi":"10.1007/3-540-45984-7_18","title":"An Analysis of Koza’s Computational Effort Statistic for Genetic Programming","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Computer science; Statistic; Mathematics; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01695518108309615,"gpt":0.2714305306652515,"spread":0.2544753495821554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003819417,0.0003141933,0.0005134848,0.001130568,0.000248942,0.0002235098,0.001928276,0.0001497047,0.00002265291],"category_scores_gemma":[0.00001897159,0.0002820544,0.0001898313,0.001223764,0.0004773209,0.0003197029,0.000247766,0.0002184537,0.000004371911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001582143,"about_ca_system_score_gemma":0.0002813851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002136167,"about_ca_topic_score_gemma":0.00004272064,"domain_scores_codex":[0.9971181,0.00001539432,0.000595566,0.001134249,0.0007298714,0.0004067769],"domain_scores_gemma":[0.9976898,0.000403113,0.0003596015,0.0009179713,0.0004840963,0.0001453965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001149651,0.000060611,0.0001421824,0.00002020684,0.00005250684,0.000003901912,0.0002244114,0.5848342,0.000005988202,0.0429277,0.00000536377,0.3717218],"study_design_scores_gemma":[0.0001291453,0.0001763933,0.003808701,0.00003841691,0.00008871368,0.000009404724,1.439295e-7,0.889316,0.00001329958,0.1057604,0.0003646906,0.0002946938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001108867,0.0001232065,0.9985518,0.0002027888,0.000204098,0.0005680175,0.00006314381,0.00007566473,0.0001003255],"genre_scores_gemma":[0.07869748,0.000009360954,0.9208274,0.0001310466,0.0001141774,0.00004445072,0.00007214943,0.00001647401,0.00008747281],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3714271,"threshold_uncertainty_score":0.9999632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161122238","doi":"10.1142/s021821300600262x","title":"GENERICITY IN EVOLUTIONARY COMPUTATION SOFTWARE TOOLS: PRINCIPLES AND CASE-STUDY","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Evolutionary computation; Software engineering; Software; Genetic programming; Evolutionary algorithm; Software development; Evolutionary programming; Computation; Genetic representation; Theoretical computer science; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.08307800819345276,"gpt":0.3298441421145045,"spread":0.2467661339210517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513339,0.0001327516,0.0001776471,0.0003233637,0.000125094,0.0003490662,0.0006045225,0.00005108109,0.00001235204],"category_scores_gemma":[0.0001650532,0.0001286467,0.00007135094,0.000350992,0.00007942957,0.001406466,0.0001874014,0.0002067798,0.00001078969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001632175,"about_ca_system_score_gemma":0.000132603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004002503,"about_ca_topic_score_gemma":0.0002145218,"domain_scores_codex":[0.9980414,0.00008842477,0.0009347881,0.0002541205,0.0005150461,0.0001662243],"domain_scores_gemma":[0.998424,0.0003473888,0.0003879959,0.0001386093,0.0006404829,0.00006154866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005571161,0.002246934,0.02048886,0.0000069225,0.00008220722,0.003976652,0.00142755,0.1860197,0.0005686473,0.1031255,0.0002919552,0.6817094],"study_design_scores_gemma":[0.0004075681,0.0006209554,0.1406657,0.0001069973,0.00002922599,0.01362937,0.003786036,0.6795356,0.001457392,0.1576147,0.001505966,0.000640453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4216699,0.0001343304,0.5770057,0.0006385241,0.0003215933,0.0001356945,0.000007719918,0.00002137848,0.00006513854],"genre_scores_gemma":[0.8988336,0.00001993854,0.1007153,0.00005320159,0.0003384093,0.00001164708,0.000005247567,0.00000598178,0.00001666696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.681069,"threshold_uncertainty_score":0.5246061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970756392","doi":"10.1074/jbc.m211875200","title":"Characterization and in Vivo Functional Analysis of Splice Variants of Cypher","year":2003,"lang":"en","type":"article","venue":"Journal of Biological Chemistry","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Institutes of Health Research; National Institutes of Health; National Heart, Lung, and Blood Institute; Muscular Dystrophy Association; Heart and Stroke Foundation of Canada","keywords":"splice; In vivo; Computational biology; Characterization (materials science); Biology; Genetics; Cancer research; Medicine; Gene; Nanotechnology; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.01885781765391625,"gpt":0.2322146258785233,"spread":0.213356808224607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002140509,0.00004340844,0.0001685593,0.00004597917,0.00001415405,0.000004226372,0.0001190316,0.00005854217,0.0001030893],"category_scores_gemma":[0.0000584859,0.00003214289,0.00005922762,0.0004870652,0.00004047962,0.00008870319,0.00002363634,0.00006782517,1.245829e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001152234,"about_ca_system_score_gemma":0.00002888547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001012808,"about_ca_topic_score_gemma":1.409642e-7,"domain_scores_codex":[0.9994341,0.00002191395,0.0003078571,0.00008832321,0.00009341715,0.00005437493],"domain_scores_gemma":[0.9994256,0.0000579921,0.0002851708,0.00008322628,0.0001144777,0.00003348973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00000811574,0.0001345671,0.02231807,0.000006089981,0.00005477393,0.000001337496,0.00001698033,0.0001583475,0.9760233,0.0009809557,0.000008032067,0.0002894384],"study_design_scores_gemma":[0.0003036715,0.00004783521,0.8234488,0.00001572714,0.00004519363,0.00004578885,0.00002856533,0.006254295,0.1684568,0.0008601505,0.0004158164,0.00007737285],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8900583,0.00007206074,0.1095157,0.00006595399,0.00001461044,0.00001404168,0.000006785427,0.000001720839,0.0002507578],"genre_scores_gemma":[0.9938186,0.00007644863,0.006030619,0.00001700714,0.00001755978,8.658322e-7,0.000002663318,7.449041e-7,0.00003546711],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8075665,"threshold_uncertainty_score":0.1310749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161213945","doi":"10.1109/tciaig.2011.2138707","title":"Search-Based Procedural Generation of Maze-Like Levels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"California Institute of Technology","keywords":"Fitness function; Initialization; Computer science; Fitness approximation; Artificial intelligence; Path (computing); Representation (politics); Grid; Genetic programming; Function (biology); Evolutionary algorithm; Machine learning; Genetic algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09710456400680863,"gpt":0.3039637029241788,"spread":0.2068591389173702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001304847,0.000111213,0.0001130724,0.0002303644,0.00008061509,0.00002998476,0.0002367042,0.00004820467,0.00003950766],"category_scores_gemma":[0.000002009987,0.0001099398,0.00004809408,0.0004325977,0.0001301836,0.000339692,0.000002937909,0.0001457413,0.00001475393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002709683,"about_ca_system_score_gemma":0.0001352843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006106959,"about_ca_topic_score_gemma":0.00001847248,"domain_scores_codex":[0.9990126,0.00004011526,0.0002954924,0.0002890195,0.0002201296,0.0001426661],"domain_scores_gemma":[0.9994794,0.0001006244,0.00005053549,0.0001512395,0.0001621061,0.00005605627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001526973,0.0005911019,0.0001025568,0.00002809756,0.00001755083,0.000002962764,0.001869568,0.8675519,0.0006695858,0.03428382,0.00005740728,0.09481014],"study_design_scores_gemma":[0.0001059355,0.0001319344,0.003080164,0.00003175409,0.000003766839,0.000009078007,0.00006488191,0.9493121,0.03593069,0.01115761,0.0000440303,0.000128055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02610106,0.00003985701,0.9727761,0.0006841881,0.0001195933,0.0001658724,0.00001381499,0.00003869858,0.00006079903],"genre_scores_gemma":[0.893556,0.00001504314,0.1058815,0.0004368623,0.00001462629,0.0000425791,0.000003459485,0.000005064837,0.00004493211],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8674549,"threshold_uncertainty_score":0.4483216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387265244","doi":"10.3390/biomimetics8060470","title":"Kookaburra Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Biomimetics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Benchmark (surveying); Metaheuristic; Algorithm; Test suite; Computer science; Suite; Mathematical optimization; Engineering optimization; Test functions for optimization; Imperialist competitive algorithm; Optimization algorithm; Parallel metaheuristic; Evolutionary algorithm; Optimization problem; Test case; Artificial intelligence; Machine learning; Mathematics; Meta-optimization; Multi-swarm optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02758115828901661,"gpt":0.2594345965594421,"spread":0.2318534382704255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003739616,0.0002672985,0.0002634789,0.0003882443,0.0004729769,0.0002907315,0.0007695059,0.0001524646,0.00002022034],"category_scores_gemma":[0.00008784413,0.0002770173,0.0001452263,0.002175647,0.00006211199,0.0004978485,0.0002447053,0.00009606663,0.00007833666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000940461,"about_ca_system_score_gemma":0.0001958746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003731369,"about_ca_topic_score_gemma":8.505708e-7,"domain_scores_codex":[0.99791,0.00003654321,0.0005112661,0.000672123,0.0003562806,0.0005137591],"domain_scores_gemma":[0.99843,0.0001846667,0.0002261527,0.0006333567,0.0003050944,0.0002207212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001573311,0.0001306735,0.000006453268,0.00002252986,0.00006469586,0.000002992437,0.0002005394,0.7445437,0.0002931684,0.005967208,0.008549496,0.240217],"study_design_scores_gemma":[0.0006731008,0.000107028,0.00003461211,0.00002482453,0.00004897929,0.000009020434,0.00001833432,0.9866973,0.0004759968,0.002991753,0.008579234,0.0003398101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001201065,0.0002510133,0.9954329,0.001696414,0.0005839007,0.0009756997,0.00006780036,0.0009053088,0.00007491638],"genre_scores_gemma":[0.0003048585,0.0002345295,0.9971145,0.0001153166,0.0003535137,0.0002490379,0.0003921965,0.00004509639,0.001190972],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2421536,"threshold_uncertainty_score":0.9999682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2736737873","doi":"10.1299/jsmeicam.2010.5.67","title":"A novel hybridization design principle for intelligent mechatronics systems","year":2010,"lang":"en","type":"article","venue":"The Abstracts of the international conference on advanced mechatronics toward evolutionary fusion of IT and mechatronics ICAM","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mechatronics; Compatibility (geochemistry); Hybrid system; Control engineering; Physical system; Computer science; Artificial intelligence; Engineering; Machine learning; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04521956076042407,"gpt":0.293682996712566,"spread":0.2484634359521419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117607,0.00032207,0.0003372357,0.0001571203,0.0004062932,0.00008276458,0.002492192,0.0001723954,0.00002335247],"category_scores_gemma":[0.0003069564,0.0002310478,0.0002325066,0.0002613922,0.0001996068,0.0004600424,0.0006953347,0.0005466446,0.000007698235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001806546,"about_ca_system_score_gemma":0.0007672211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003138121,"about_ca_topic_score_gemma":0.00001478586,"domain_scores_codex":[0.9971904,0.00005863035,0.0008905157,0.0005702577,0.0008839237,0.0004062762],"domain_scores_gemma":[0.996417,0.0004651895,0.000984158,0.001016828,0.0009977679,0.0001190526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009485324,0.0002542658,0.000002536105,0.0000296799,0.00005668312,8.844552e-8,0.0001020186,0.05278172,0.1142812,0.8299802,0.0001903858,0.002226346],"study_design_scores_gemma":[0.001335643,0.0004900455,0.0002418389,0.0002329627,0.00005667684,0.0000438895,0.0005189284,0.7900733,0.03076461,0.1474905,0.02829887,0.000452788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02164589,0.0003460671,0.9603589,0.01313299,0.002069538,0.001687138,0.0002588962,0.00007324779,0.0004273503],"genre_scores_gemma":[0.8552798,0.0009577927,0.1428873,0.0001212457,0.0001058198,0.0002120423,0.0000519545,0.00002439925,0.0003596514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8336339,"threshold_uncertainty_score":0.9421855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148554518","doi":"10.1007/pl00013273","title":"Automatic mineral identification using genetic programming","year":2001,"lang":"en","type":"article","venue":"Machine Vision and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Genetic programming; Thresholding; Artificial intelligence; Computer science; Mineral resource classification; Identification (biology); Mineral processing; Image processing; Suite; Mineral; Computer vision; Genetic algorithm; Computation; Image (mathematics); Pattern recognition (psychology); Geology; Machine learning; Algorithm; Geography; Materials science; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01332112028148058,"gpt":0.2931154093691397,"spread":0.2797942890876591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001298884,0.0001201592,0.000100034,0.0001138226,0.0004878629,0.0002005205,0.0003440554,0.00003974004,0.00002142561],"category_scores_gemma":[0.000006160628,0.0001092398,0.00003876689,0.0006694121,0.00005446919,0.0002580519,0.0001347199,0.00007889976,0.00004587676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002564364,"about_ca_system_score_gemma":0.00002355495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004414086,"about_ca_topic_score_gemma":0.000004756827,"domain_scores_codex":[0.9989748,0.00002654386,0.0002853074,0.0003762785,0.0001606954,0.0001763785],"domain_scores_gemma":[0.9991968,0.00003496984,0.0001038056,0.0004937524,0.00006208206,0.0001085638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.294002e-7,0.0001962023,0.001285187,0.00001246263,0.000006779032,0.000001197391,0.00007938252,0.0002974193,0.004247281,0.05152727,0.0001414257,0.9422048],"study_design_scores_gemma":[0.0001518997,0.00001779465,0.0297735,0.000007844462,0.00001014114,0.00009500262,0.00001428747,0.9107859,0.00003560652,0.004854471,0.05410977,0.0001438492],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05565333,0.0003993083,0.9417441,0.001239654,0.00002824597,0.000482532,0.000003919366,0.000241041,0.0002078813],"genre_scores_gemma":[0.6465726,0.00008996385,0.352412,0.0001383299,0.000104388,0.0003619102,0.00002521729,0.00001194304,0.0002836774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.942061,"threshold_uncertainty_score":0.4454668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105802878","doi":"10.1145/1389095.1389162","title":"Managing team-based problem solving with symbiotic bid-based genetic programming","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Artificial intelligence; Machine learning; Computer science; Genetic programming; Population; Classifier (UML); Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.01180276646599921,"gpt":0.2124548205225855,"spread":0.2006520540565863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009457637,0.000150953,0.000114301,0.0001219565,0.0004762891,0.00009294438,0.0005171194,0.00003385059,0.00001412822],"category_scores_gemma":[0.00000335247,0.0001232979,0.00004602191,0.0006756904,0.00009337677,0.0002035161,0.00006250355,0.0001041074,0.00003964501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005173335,"about_ca_system_score_gemma":0.0002237325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006508354,"about_ca_topic_score_gemma":0.00001387739,"domain_scores_codex":[0.9987121,0.00002404763,0.0001884615,0.0004397036,0.0002757696,0.0003599226],"domain_scores_gemma":[0.9991764,0.00005468756,0.00006933014,0.0005044352,0.00008438613,0.0001107978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003912857,0.003406917,0.08404761,0.000577054,0.0001757064,0.0005142274,0.001799563,0.4282479,0.004496687,0.09841405,0.006190164,0.372091],"study_design_scores_gemma":[0.0005022998,0.0001551167,0.007991885,0.00005611277,0.000008804385,0.00006402007,0.00002473697,0.9869877,0.001303592,0.0007016913,0.001895178,0.000308856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009801222,0.00007422029,0.9849938,0.001818461,0.00002424503,0.0004155251,4.651972e-7,0.0004962877,0.002375779],"genre_scores_gemma":[0.4327508,0.000001874287,0.5667368,0.0002246933,0.00002172117,0.00005648805,0.000002422654,0.000009048284,0.0001961857],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5587398,"threshold_uncertainty_score":0.502794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108679901","doi":"10.1109/foci.2007.372151","title":"Opposition-Based Differential Evolution (ODE) with Variable Jumping Rate","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Jumping; Ode; Benchmark (surveying); Differential evolution; Suite; Opposition (politics); Computer science; Test suite; Mathematics; Mathematical optimization; Applied mathematics; Statistics; Test case; Geology; Geodesy; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.008114385425783906,"gpt":0.2217740595669562,"spread":0.2136596741411723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000254259,0.0001005995,0.00007703006,0.00009094026,0.0003106692,0.00008620905,0.00030527,0.00004218722,0.00006699195],"category_scores_gemma":[0.000004033109,0.00008243269,0.00002789181,0.0005024398,0.0000365479,0.0003407854,0.00004818179,0.00008319863,0.00004554242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001274549,"about_ca_system_score_gemma":0.0001153592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009361529,"about_ca_topic_score_gemma":0.00001924508,"domain_scores_codex":[0.9990822,0.00002349257,0.0001579601,0.0002952461,0.0001795095,0.0002616072],"domain_scores_gemma":[0.9993294,0.00009462765,0.00005336705,0.0003353991,0.00009140887,0.00009576369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008637665,0.0001421551,0.0004177627,0.000005505188,0.00001004688,0.000002987737,0.00001898789,0.002310981,0.008818819,0.9872079,0.0004597899,0.0005963644],"study_design_scores_gemma":[0.0007120192,0.0001121206,0.02395313,0.00002754711,0.00001282576,0.00001513214,0.00002364735,0.9470319,0.004791748,0.0217395,0.001281134,0.0002993275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005350898,0.000009268123,0.9876834,0.0007040741,0.00009649884,0.0001588928,0.000002076418,0.0002455899,0.005749354],"genre_scores_gemma":[0.7518529,3.587237e-7,0.247465,0.0002088853,0.00007759422,0.00001987385,0.00001255193,0.000005156982,0.0003576623],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9654685,"threshold_uncertainty_score":0.3361508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163533082","doi":"10.1145/1273496.1273606","title":"On the role of tracking in stationary environments","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Meta learning (computer science); Computer science; Obstacle; Tracking (education); Artificial intelligence; Task (project management); Transfer of learning; Machine learning; Selection (genetic algorithm); Adaptation (eye); Point (geometry); Term (time); Simple (philosophy); Feature (linguistics); Algorithm; Mathematics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01051219057817651,"gpt":0.2403766651195541,"spread":0.2298644745413776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001862277,0.00002434635,0.00002276109,0.00002844738,0.00003317525,0.00000443427,0.0001924276,0.000009783204,0.00002395757],"category_scores_gemma":[0.000004787594,0.00001686309,0.00001018347,0.0001219814,0.00001574826,0.00008372365,0.00002893661,0.00003451432,0.00001933185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001359873,"about_ca_system_score_gemma":0.000006183737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001381779,"about_ca_topic_score_gemma":0.000004426551,"domain_scores_codex":[0.9996607,0.000008076419,0.00008984457,0.00007567677,0.0001018581,0.00006382771],"domain_scores_gemma":[0.9996677,0.0001525747,0.00002253227,0.0001421192,0.000003856412,0.00001119001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[6.277624e-7,0.00007787344,0.0011315,1.925513e-7,9.307485e-7,3.457084e-7,0.0001426535,0.0003325492,0.002026639,0.9662216,0.00004017376,0.03002496],"study_design_scores_gemma":[0.000152202,0.00004447797,0.5610917,0.000007497338,7.019935e-7,0.000002225397,0.0003502537,0.085991,0.01986039,0.3253644,0.0070459,0.00008919996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1429582,0.00004642067,0.8364567,0.0008978316,0.00001665236,0.0001042582,9.616525e-7,0.00001279764,0.01950628],"genre_scores_gemma":[0.9839741,0.000002939657,0.01573503,0.000128688,0.000005586677,0.000004597478,6.704769e-7,0.00000104007,0.0001473341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8410159,"threshold_uncertainty_score":0.06876568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102391083","doi":"10.1109/tsmcb.2005.856724","title":"Analysis of a master-slave architecture for distributed evolutionary computations","year":2006,"lang":"en","type":"letter","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Workstation; Computation; Architecture; Computer science; Mainstream; Distributed computing; Beagle; Master/slave; Parallel computing; Programming language; Operating system; Geography; Archaeology; Ecology; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01819287408171458,"gpt":0.2326094099789323,"spread":0.2144165358972177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002041094,0.0006781215,0.001075842,0.0009690161,0.0004396443,0.0002396893,0.0008773222,0.0007552042,0.0000202835],"category_scores_gemma":[0.000004192219,0.0006387115,0.00067056,0.001501282,0.0003248735,0.0001143158,0.00001940377,0.0009587614,0.00002136725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001558669,"about_ca_system_score_gemma":0.0001475878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002835331,"about_ca_topic_score_gemma":0.00009725126,"domain_scores_codex":[0.9959204,0.0002209379,0.001235608,0.001206289,0.0007648551,0.000651929],"domain_scores_gemma":[0.99671,0.0007185796,0.000651811,0.001258852,0.0004846952,0.0001760439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002029792,0.000693049,0.00006308008,0.0005691886,0.002969286,0.00002967969,0.0004415201,0.5363961,0.00003197727,0.004339492,0.4503853,0.004061029],"study_design_scores_gemma":[0.0008302557,0.0003467145,0.0008413921,0.0002516008,0.00233,0.00004182377,0.00004377151,0.5226232,0.00005396326,0.001805429,0.4698529,0.0009789646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002439609,0.0005079609,0.965954,0.02477489,0.000920662,0.001373118,0.005733103,0.000187289,0.0003049988],"genre_scores_gemma":[0.7346426,0.0009622994,0.1212279,0.0433106,0.005707338,0.007282665,0.01839177,0.0007460215,0.0677288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8447261,"threshold_uncertainty_score":0.9996064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1590984588","doi":"10.1007/3-540-44938-8_1","title":"Data Dependence in Combining Classifiers","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Categorization; Classifier (UML); Artificial intelligence; Variety (cybernetics); Machine learning; Data mining; Text categorization; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.04270951716315573,"gpt":0.27603447508627,"spread":0.2333249579231143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001463043,0.0003985014,0.0003917507,0.000860636,0.0002639619,0.0003580779,0.007106278,0.0002729911,0.00001868929],"category_scores_gemma":[0.0001088072,0.0004023954,0.00005339614,0.001243388,0.0005866443,0.001101169,0.002482138,0.0009997068,0.00004877154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003008123,"about_ca_system_score_gemma":0.0006596147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002331969,"about_ca_topic_score_gemma":0.0001745475,"domain_scores_codex":[0.9959272,0.00005011975,0.000537036,0.002011108,0.0008377563,0.0006367997],"domain_scores_gemma":[0.9960083,0.000512688,0.0002232759,0.002976995,0.0001185192,0.0001602433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002791586,0.00008459215,0.0002423855,0.00002315907,0.000009907824,0.0001428974,0.0003503268,0.01920905,0.00004426042,0.3454045,0.0002110728,0.634275],"study_design_scores_gemma":[0.0002162712,0.00004398508,0.0003209035,0.0001981373,0.000003701085,0.00008239589,3.108242e-7,0.6307813,0.00004274982,0.3600271,0.007766411,0.000516721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001508496,0.00060504,0.9920515,0.001353518,0.0008970525,0.0003093841,0.0000181809,0.00009334267,0.004656923],"genre_scores_gemma":[0.02372359,0.0001214757,0.9730666,0.002226714,0.0001938319,0.00001889941,0.00003459414,0.00003229643,0.0005820282],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6337583,"threshold_uncertainty_score":0.9998428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981971424","doi":"10.1016/j.tcs.2006.04.003","title":"Weighted multirecombination evolution strategies","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.005149068878092617,"gpt":0.230497919920719,"spread":0.2253488510426264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802673,0.000133344,0.0001076105,0.0001809547,0.0006438031,0.0004839761,0.001407491,0.00004383989,0.00002076823],"category_scores_gemma":[0.000009123352,0.0001168721,0.00004596036,0.001415645,0.001345091,0.00148118,0.0003760146,0.000117727,0.0001169484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001273549,"about_ca_system_score_gemma":0.0001727496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003046278,"about_ca_topic_score_gemma":0.000001544875,"domain_scores_codex":[0.9982188,0.000052756,0.0002388019,0.000563616,0.0005286954,0.0003973499],"domain_scores_gemma":[0.9989284,0.00009730651,0.00006360711,0.0005515131,0.0002532382,0.0001059774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.643458e-7,0.0001009858,0.00003882958,0.000001574004,7.983283e-7,0.000001363839,0.00003188668,0.0004133146,0.0008187148,0.9890114,0.00008363889,0.009496708],"study_design_scores_gemma":[0.00009527599,0.00003442265,0.008094009,0.000003814088,0.000001051772,0.0000106641,0.000003298301,0.5100461,0.0005178752,0.4809943,0.0001044898,0.00009467388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0214124,0.00003001929,0.9686409,0.001268885,0.0003272942,0.0001457935,0.000001095341,0.0003635632,0.007810108],"genre_scores_gemma":[0.7376535,8.432459e-7,0.2621403,0.00004881558,0.0001181374,0.0000130143,0.000002472034,0.00000339748,0.00001951434],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7162411,"threshold_uncertainty_score":0.4956045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170657595","doi":"10.25088/complexsystems.15.4.285","title":"Repeated Sequences in Linear Genetic Programming Genomes","year":2005,"lang":"en","type":"article","venue":"Complex Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Genetic programming; Genome; Linear programming; Computer science; Computational biology; Evolutionary biology; Biology; Genetics; Artificial intelligence; Algorithm; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.04022633656117817,"gpt":0.278419984426947,"spread":0.2381936478657688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000142464,0.00009579366,0.0001361795,0.00009031384,0.0001162641,0.00009932963,0.0005716737,0.00003523175,0.000007809792],"category_scores_gemma":[0.000005630756,0.00008948852,0.00003095143,0.0004795444,0.00003852137,0.0001848174,0.00009583904,0.00007106747,0.0001160984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007590694,"about_ca_system_score_gemma":0.00004679359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002566303,"about_ca_topic_score_gemma":0.00005475272,"domain_scores_codex":[0.9989162,0.00005580718,0.0003151365,0.0003121532,0.0001626106,0.0002380618],"domain_scores_gemma":[0.9993575,0.00003260512,0.00007866672,0.0004091199,0.00005830045,0.00006386491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006353157,0.0008400251,0.05815361,0.0002309185,0.00008009272,0.000112214,0.003899767,0.1444511,0.008154783,0.3174811,0.004403958,0.4621861],"study_design_scores_gemma":[0.0001456223,0.00002580945,0.01291293,0.00002399508,0.000001449129,0.00006574831,0.00008622094,0.814571,0.00001912963,0.0002458563,0.1717547,0.0001475354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1051049,0.009608779,0.8754837,0.003432239,0.0008466415,0.001578136,0.00000990312,0.0008506954,0.00308499],"genre_scores_gemma":[0.8251756,0.00001925143,0.1739574,0.00003914375,0.0002304677,0.000122295,0.000006235999,0.000005923365,0.0004436854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7200707,"threshold_uncertainty_score":0.3649236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1560681326","doi":"10.1109/icec.1995.487447","title":"Hybridized crossover-based search techniques for program discovery","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Santa Fe Institute","keywords":"Crossover; Hill climbing; Genetic programming; Computer science; Iterated function; Simulated annealing; Iterated local search; Genetic representation; Genetic algorithm; Operator (biology); Mathematical optimization; Theoretical computer science; Algorithm; Artificial intelligence; Local search (optimization); Mathematics; Machine learning; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.03403385640385963,"gpt":0.3069457912597012,"spread":0.2729119348558415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001159251,0.00008098687,0.00008005163,0.00004713214,0.0002096567,0.0002728338,0.0004811801,0.00003015841,0.00003143142],"category_scores_gemma":[0.000009635953,0.00006813576,0.00007948121,0.0002610028,0.00005466142,0.0004909001,0.0000767407,0.00005529844,0.00003001722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002902264,"about_ca_system_score_gemma":0.00003026654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000155374,"about_ca_topic_score_gemma":0.000001534343,"domain_scores_codex":[0.9991851,0.00001249237,0.0001280916,0.0002849449,0.0001572254,0.0002321421],"domain_scores_gemma":[0.9993523,0.00008823341,0.00002419144,0.0003986749,0.00008249321,0.00005415447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008964684,0.001363148,0.0001067428,0.00002961729,0.00001412118,0.000002504563,0.00005437013,0.00008207194,0.001943476,0.4298347,0.0390473,0.527513],"study_design_scores_gemma":[0.0004631442,0.0002206561,0.0002133095,0.00000761098,0.000002661954,0.000004500536,0.000004698395,0.8382726,0.02907419,0.006293715,0.1252511,0.0001917796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001018122,0.00004827955,0.988957,0.004367779,0.00003163424,0.0008247438,0.00001125386,0.0007291906,0.004011952],"genre_scores_gemma":[0.1419753,0.0000100775,0.8520889,0.0003437763,0.00007225267,0.0009918053,0.000008399801,0.000007652986,0.004501833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8381906,"threshold_uncertainty_score":0.2778496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1515636825","doi":"10.1007/978-3-540-39432-7_24","title":"On the Dynamics of an Artificial Regulatory Network","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Simple (philosophy); Artificial neural network; Heterochrony; Genetic algorithm; Artificial intelligence; Artificial life; Genetic network; Mutation; Machine learning; Biology; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.0138337639813868,"gpt":0.2293129863989791,"spread":0.2154792224175923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008652195,0.0002690476,0.0002581604,0.0001906841,0.0003593136,0.0001407453,0.002510359,0.0001810946,0.00001649564],"category_scores_gemma":[0.00003168421,0.0002033313,0.00008764539,0.0005666094,0.0007434285,0.000225784,0.0003728295,0.0005111654,0.00001281557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001719398,"about_ca_system_score_gemma":0.0002807472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006266048,"about_ca_topic_score_gemma":0.00005896629,"domain_scores_codex":[0.9977164,0.0000443629,0.000379047,0.0008213316,0.0006734453,0.0003654048],"domain_scores_gemma":[0.9974132,0.0004718773,0.0002478437,0.001624786,0.000155606,0.00008669392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001111924,0.00002487305,0.000002057221,0.000002719679,0.000002860451,0.000003139067,0.00005869592,0.1077933,0.000008753225,0.7805993,0.00005367733,0.1114495],"study_design_scores_gemma":[0.00002240681,0.00006742535,0.00004655841,0.00004544757,0.000001834901,0.000009299545,7.421657e-8,0.5017374,0.00008937717,0.4976278,0.0002145337,0.0001378238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002846159,0.00009002684,0.9942371,0.00204224,0.000766398,0.0002726482,0.000005920934,0.00005061397,0.002250409],"genre_scores_gemma":[0.1523633,0.00002432274,0.8407091,0.005091024,0.001104653,0.00003144842,0.00001919293,0.00005307553,0.0006038394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3939441,"threshold_uncertainty_score":0.8291611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091822809","doi":"10.1109/iat.2006.63","title":"Evaluating Different Genetic Operators in the Testing for Unwanted Emergent Behavior Using Evolutionary Learning of Behavior","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Genetic algorithm; Multi-agent system; Quality (philosophy); Machine learning; Action (physics); Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.08123059256605626,"gpt":0.3489661893641072,"spread":0.2677355967980509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003123448,0.0001235815,0.0001282873,0.0000956096,0.0003546644,0.00003626638,0.000453343,0.0000384176,0.00001044269],"category_scores_gemma":[0.00004957527,0.00009257245,0.00006452382,0.0005477392,0.00003895079,0.000131507,0.0001149094,0.000113642,0.000001058053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007115777,"about_ca_system_score_gemma":0.00007926195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003129733,"about_ca_topic_score_gemma":0.00002183573,"domain_scores_codex":[0.9986204,0.0001018815,0.000444814,0.0002939184,0.000299569,0.0002394546],"domain_scores_gemma":[0.9991939,0.0001972423,0.000131794,0.0002673275,0.0001840939,0.00002564753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004135582,0.001648897,0.6992648,0.00003150535,0.000009593547,0.000006484799,0.0004056149,0.1172864,0.1364626,0.01756923,0.0001127641,0.02719804],"study_design_scores_gemma":[0.0001740344,0.0000879873,0.4181141,0.00001274229,0.00002049569,0.00001385991,0.00008215121,0.5806493,0.0004799524,0.0002679593,0.00001204286,0.00008546439],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7365862,0.0001155056,0.2624851,0.00006236576,0.00006670263,0.0006057457,0.000003641932,0.00003631194,0.00003841019],"genre_scores_gemma":[0.7209284,9.032013e-7,0.2785617,0.00001121986,0.00004732381,0.000393564,0.000007991718,0.000006706592,0.00004224796],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4633629,"threshold_uncertainty_score":0.3774995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1480328200","doi":"10.1109/cec.2003.1299599","title":"Evolutionary exploration of dynamic swarm behaviour","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Swarm behaviour; Computer science; Evolutionary computation; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01883730947000606,"gpt":0.2590932603582102,"spread":0.2402559508882041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009289748,0.00005634658,0.00006013091,0.00005637398,0.00008340631,0.00001128213,0.0002297124,0.00002855482,0.00003462236],"category_scores_gemma":[0.00001047636,0.00005377246,0.0000361189,0.0003140295,0.00002750764,0.0006713119,0.00003606428,0.00004085903,0.00004955749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003090697,"about_ca_system_score_gemma":0.0000626621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001299539,"about_ca_topic_score_gemma":0.00000335089,"domain_scores_codex":[0.9994009,0.0000262974,0.0001589513,0.0001727714,0.0001417051,0.00009944366],"domain_scores_gemma":[0.9994898,0.00002256429,0.00005048538,0.0003115714,0.00008802309,0.00003758493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[2.651214e-7,0.0001210142,0.0003246556,0.000001763129,0.000002589846,4.217103e-7,0.0000665254,0.0002003676,0.0003739499,0.9966614,0.0006599939,0.001587076],"study_design_scores_gemma":[0.0007747136,0.0002188538,0.07917698,0.00002042307,0.00001875581,0.00007060879,0.0004197201,0.3026719,0.008225468,0.5956169,0.01219892,0.0005867201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008482179,0.0001089974,0.9833946,0.0006204126,0.00008735469,0.000101513,0.000002302675,0.00008500751,0.007117583],"genre_scores_gemma":[0.7463751,0.00001581969,0.252602,0.0000311433,0.000005259,0.00002757448,0.000005070906,0.000002547692,0.0009354799],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.737893,"threshold_uncertainty_score":0.2192777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117847370","doi":"10.1109/tsmcb.2007.896406","title":"Scaling Genetic Programming to Large Datasets Using Hierarchical Dynamic Subset Selection","year":2007,"lang":"en","type":"letter","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; RSS; Selection (genetic algorithm); Heuristics; Genetic programming; Block (permutation group theory); Benchmarking; Machine learning; Artificial intelligence; Genetic algorithm; Overhead (engineering); Binary classification; Data mining; Algorithm; Mathematics; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.02089396545040684,"gpt":0.2715984832799908,"spread":0.250704517829584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005555163,0.0008400779,0.0007296214,0.0007549003,0.0008607105,0.000838714,0.001067084,0.0009680639,0.0000231552],"category_scores_gemma":[0.00000775237,0.0009176323,0.0002293048,0.001092743,0.0001703699,0.0002224396,0.00004367137,0.002287511,0.0001579133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003611903,"about_ca_system_score_gemma":0.0001844746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003335408,"about_ca_topic_score_gemma":0.0001819804,"domain_scores_codex":[0.9943349,0.0003034994,0.001158689,0.001732712,0.001105583,0.001364594],"domain_scores_gemma":[0.9973439,0.0002836934,0.0003524261,0.001307046,0.0002229529,0.0004899729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001423867,0.003526991,0.0002183414,0.002663662,0.001805981,0.001342934,0.003583486,0.177763,0.00138859,0.004907459,0.6492176,0.1534396],"study_design_scores_gemma":[0.0004959956,0.0002498369,0.0001319526,0.0004134511,0.0001837119,0.0005030201,0.00004101047,0.3378455,0.0001117043,0.0001269989,0.6588098,0.00108703],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002506446,0.0005026263,0.9820434,0.01042386,0.001618525,0.001647868,0.00079426,0.0003646538,0.00009833039],"genre_scores_gemma":[0.441025,0.001833154,0.3683359,0.1567319,0.0097013,0.002476262,0.002676919,0.001243193,0.01597636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6137075,"threshold_uncertainty_score":0.9993274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1553241761","doi":"10.1007/978-0-387-30440-3_373","title":"Numerical Bifurcation Analysis","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Complexity and Systems Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Ode; Bifurcation; Parameter space; Bifurcation theory; Nonlinear system; Qualitative analysis; Computer science; Ordinary differential equation; Dynamical systems theory; Software; Applied mathematics; Bifurcation diagram; Numerical analysis; Differential equation; Mathematics; Theoretical computer science; Mathematical analysis; Qualitative research; Physics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03096159026143487,"gpt":0.2615549962364629,"spread":0.2305934059750281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006316321,0.0002227818,0.0005044807,0.0005662851,0.0003756262,0.0001378748,0.001244556,0.000114185,0.00001778956],"category_scores_gemma":[0.00002399976,0.0002086603,0.000132528,0.0008615244,0.0007565032,0.0004774923,0.0001945396,0.0001836034,0.00002359755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006556273,"about_ca_system_score_gemma":0.0002731873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001103268,"about_ca_topic_score_gemma":0.000005984706,"domain_scores_codex":[0.9976825,0.00002528169,0.0005421984,0.0007075679,0.0007972692,0.0002451483],"domain_scores_gemma":[0.9981233,0.00009301292,0.0004355733,0.0008369207,0.0003233916,0.000187828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.323617e-7,0.0000215313,0.00004333157,0.00001698364,0.00002778781,0.000001131044,0.0001181646,0.0001967326,0.000007471528,0.9926181,0.000172188,0.00677589],"study_design_scores_gemma":[0.0002121615,0.0002235622,0.023574,0.0001444481,0.0002014195,0.00005678925,0.00002562598,0.3696617,0.00001197355,0.2996087,0.3053317,0.0009479454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001098888,0.001254018,0.2890123,0.0004460354,0.000261686,0.0003169529,0.00002361763,0.00009036637,0.7084852],"genre_scores_gemma":[0.4005709,0.003429016,0.1416333,0.0002659541,0.000915948,0.0000805035,0.0001133813,0.00004501456,0.452946],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6930095,"threshold_uncertainty_score":0.8508919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108346947","doi":"10.1109/tsmcb.2002.999814","title":"Dynamic page based crossover in linear genetic programming","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Crossover; Genetic programming; Pairwise comparison; Generalization; Computer science; Population; Linear programming; Tree (set theory); Block (permutation group theory); Constant (computer programming); Algorithm; Combinatorics; Mathematics; Artificial intelligence; Programming language; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01716474405128253,"gpt":0.2353421798431268,"spread":0.2181774357918443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002076852,0.0003739776,0.0003468363,0.0002719933,0.000307906,0.0003081204,0.0005513288,0.0002062208,0.00006197616],"category_scores_gemma":[0.000003896349,0.0003908101,0.0001227688,0.000655306,0.0001800088,0.000178975,0.00001113881,0.0004092008,0.0002252367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001181858,"about_ca_system_score_gemma":0.00003740088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001876796,"about_ca_topic_score_gemma":0.0001929564,"domain_scores_codex":[0.9973125,0.0001306662,0.0006708766,0.000812186,0.0004725257,0.0006012054],"domain_scores_gemma":[0.998485,0.000142528,0.0001537973,0.0008547337,0.0000978143,0.0002660914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001013472,0.009402896,0.002207347,0.0009174444,0.0004068015,0.0004541274,0.006639855,0.5254722,0.002272969,0.02448379,0.004949085,0.4226922],"study_design_scores_gemma":[0.001065548,0.0002148973,0.001867318,0.0001357559,0.00002869628,0.00005865103,0.00005434502,0.9721097,0.0001797807,0.0001725705,0.02360901,0.0005037456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04075829,0.001679639,0.9533853,0.0006249044,0.0009316855,0.001050839,0.0000456139,0.000302985,0.001220749],"genre_scores_gemma":[0.9745068,0.0003761466,0.01930517,0.0001506794,0.00006429161,0.0003137609,0.000004406305,0.0000438838,0.005234877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9340801,"threshold_uncertainty_score":0.9998544,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163467402","doi":"10.1145/1830483.1830640","title":"Symbiosis, complexification and simplicity under GP","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Killam Trusts","keywords":"Simplicity; Inheritance (genetic algorithm); Computer science; Metaphor; Complexification; Theoretical computer science; Artificial intelligence; Range (aeronautics); Process (computing); Genetic programming; Programming language; Mathematics; Epistemology; Engineering; Biology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01466461931550477,"gpt":0.252159429944485,"spread":0.2374948106289802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007254271,0.00004685608,0.00004075279,0.00002317202,0.0001573558,0.00006347899,0.0002325783,0.00002972754,0.00003126781],"category_scores_gemma":[0.000004331806,0.00004124555,0.00001226767,0.0001316655,0.00004631103,0.0001972159,0.00008826277,0.00007856968,0.00004458457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004698222,"about_ca_system_score_gemma":0.0000139416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004072458,"about_ca_topic_score_gemma":0.00002018018,"domain_scores_codex":[0.9995695,0.000006628306,0.00007763786,0.0001882791,0.00007045059,0.00008749615],"domain_scores_gemma":[0.9995338,0.00003838202,0.00002194422,0.000308629,0.00003970508,0.00005754592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[9.836266e-8,0.00002702943,0.0005682659,7.517917e-7,0.000001367707,3.822316e-8,0.00001635276,0.000001807432,0.0123683,0.9817247,0.0007219136,0.004569347],"study_design_scores_gemma":[0.0001866205,0.00002138864,0.5498043,0.000001607328,0.000003283525,0.00003517351,0.0000283825,0.1839705,0.003318711,0.2455019,0.01691729,0.0002108887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08032789,0.00001316743,0.9069156,0.007608421,0.00006823921,0.00008668868,0.000001617925,0.0001463452,0.004831999],"genre_scores_gemma":[0.8765761,0.000004665697,0.1226905,0.0004638112,0.00003310568,0.00001284926,0.000003003641,0.000001881663,0.0002140166],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7962483,"threshold_uncertainty_score":0.1681945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W6539208","doi":"10.1016/0277-5379(84)90243-8","title":"Enhancing the GA's ability to cope with dynamic environments","year":2000,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Genetic algorithm; Balance (ability); Distributed computing; Dynamic balance; Wright; Flexibility (engineering); Machine learning; Engineering; Programming language; Mathematics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.007714113838109909,"gpt":0.2197628053604019,"spread":0.212048691522292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001088533,0.0001342861,0.00009952237,0.00003531981,0.0004750415,0.00008321025,0.0003468684,0.00003237944,0.0001103295],"category_scores_gemma":[0.000004792536,0.0001018115,0.00001977967,0.0002643197,0.0001386582,0.0001786823,0.00009618403,0.00008784238,0.0001633935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005173449,"about_ca_system_score_gemma":0.0001053248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002944772,"about_ca_topic_score_gemma":0.00001537801,"domain_scores_codex":[0.9988244,0.00006919944,0.0002134678,0.0004362325,0.0002462304,0.0002104931],"domain_scores_gemma":[0.9993748,0.00009209339,0.00004517224,0.0003173076,0.00005365413,0.0001169421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00005118944,0.0003459979,0.002682958,0.00002993506,0.00004711281,0.000008906163,0.002539394,0.2655915,0.00291852,0.01680062,0.00156582,0.7074181],"study_design_scores_gemma":[0.0002251992,0.0001373403,0.5281505,0.00001749996,0.000007980936,0.00006793917,0.0000654187,0.4560848,0.00002877718,0.008622051,0.006389866,0.0002026589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2021798,0.0001715025,0.793353,0.003451222,0.00003305435,0.0002951602,0.00000557334,0.0000493585,0.0004612811],"genre_scores_gemma":[0.8550751,0.00006848363,0.1438529,0.000336929,0.00002182152,0.00006950232,0.000009781423,0.000004915102,0.0005606501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7072154,"threshold_uncertainty_score":0.4151752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066790509","doi":"10.1155/2010/568375","title":"Evolvability and Speed of Evolutionary Algorithms in Light of Recent Developments in Biology","year":2010,"lang":"en","type":"article","venue":"Journal of Artificial Evolution and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Evolvability; Evolutionary algorithm; Evolutionary computation; Human-based evolutionary computation; Computer science; Modern evolutionary synthesis; Computation; Evolutionary developmental biology; Interactive evolutionary computation; Artificial intelligence; Evolutionary programming; Evolutionary biology; Biology; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01819622157449794,"gpt":0.2936264558826595,"spread":0.2754302343081615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005555906,0.00009039362,0.0002361604,0.0003596414,0.00007032045,0.00001065498,0.0002687223,0.00009413085,0.000009837359],"category_scores_gemma":[0.00007326055,0.00008589899,0.00003634376,0.0007940335,0.0001907389,0.0002710055,0.0001010269,0.0002409873,0.000001175446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006587373,"about_ca_system_score_gemma":0.0002373312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006078327,"about_ca_topic_score_gemma":0.00009494636,"domain_scores_codex":[0.9986092,0.00005375248,0.0008406626,0.000205263,0.0001521587,0.0001388915],"domain_scores_gemma":[0.9988734,0.0001010648,0.0004071172,0.0002108325,0.000325771,0.00008182292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0000325507,0.001197102,0.06399275,0.00003200572,0.00001765767,9.184339e-7,0.0004591495,0.0001554619,0.1130876,0.7199689,0.00007928482,0.1009767],"study_design_scores_gemma":[0.0006906974,0.0001304309,0.7882175,0.00003775845,0.00001146271,0.00006278688,0.0002213934,0.02429144,0.002786263,0.1696437,0.01370704,0.0001995514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7430484,0.0008840868,0.2505736,0.003786593,0.0002375037,0.0006568847,0.00002564071,0.00001751104,0.0007698031],"genre_scores_gemma":[0.9357553,0.0002056443,0.06393342,0.00001356581,0.0000598972,0.00001816123,0.000002943889,0.000003465415,0.00000756981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7242247,"threshold_uncertainty_score":0.3502859,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007554399215886767,"gpt":0.2345407968960176,"spread":0.2269863976801308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002818109,0.0002639999,0.0002185439,0.0001878912,0.0004098576,0.0003557913,0.0006234394,0.0001183478,0.000004599976],"category_scores_gemma":[0.00002252028,0.0002511636,0.00004741302,0.000673224,0.00008015221,0.0001980031,0.0002896026,0.0003129878,0.000020795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003044891,"about_ca_system_score_gemma":0.0001303508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003185467,"about_ca_topic_score_gemma":0.0002274341,"domain_scores_codex":[0.997999,0.00003994295,0.0003834834,0.0006744727,0.0002605448,0.0006425231],"domain_scores_gemma":[0.9990605,0.00004644598,0.00009577592,0.0005049789,0.00007948659,0.0002128097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000001746539,0.0002288839,0.1209354,0.00005233981,0.00001760124,0.00001823755,0.0008629659,0.0001020668,0.000464698,0.002019586,0.00003548103,0.8752609],"study_design_scores_gemma":[0.001242134,0.0001825518,0.6193649,0.0000672879,0.00003307347,0.0003694579,0.0001111175,0.2489546,0.0001877385,0.004784314,0.1236455,0.001057404],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8574069,0.002550771,0.1356508,0.000857244,0.0006066837,0.001268604,0.000002881048,0.0008265301,0.0008296134],"genre_scores_gemma":[0.4668539,0.00003611616,0.5326836,0.00003415176,0.00007068235,0.0002252923,0.000004362403,0.00001310565,0.00007883038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8742036,"threshold_uncertainty_score":0.999994,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02263627719306998,"gpt":0.246843798503089,"spread":0.224207521310019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004431602,0.0003854418,0.0003277755,0.0001922402,0.0009535263,0.0003377041,0.0007630925,0.0001102902,0.00003353658],"category_scores_gemma":[0.00001883322,0.0003534871,0.00009911037,0.0008117052,0.000148398,0.0002792098,0.000615801,0.0002321068,0.00003145029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005224501,"about_ca_system_score_gemma":0.0001013156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000803592,"about_ca_topic_score_gemma":0.0001504691,"domain_scores_codex":[0.9971583,0.0001308663,0.0004762162,0.0009536206,0.0004083768,0.0008725675],"domain_scores_gemma":[0.9985586,0.00006888191,0.0001769307,0.0007593834,0.000160382,0.000275799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00001823814,0.003339799,0.6730189,0.000120316,0.000272231,0.00008405413,0.004308829,0.0003976205,0.00006829834,0.007197374,0.0004435551,0.3107308],"study_design_scores_gemma":[0.0014523,0.001417491,0.7797883,0.00007662844,0.0001911571,0.000323858,0.001311444,0.1989995,0.00002192647,0.007391755,0.007974736,0.001050914],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4336653,0.006953802,0.5564885,0.0003113511,0.0003660924,0.001459535,0.00001000815,0.0005714123,0.0001739127],"genre_scores_gemma":[0.67155,0.00005666574,0.3277174,0.00004722074,0.0001376834,0.00027128,0.00001208322,0.00002202035,0.0001856853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3096798,"threshold_uncertainty_score":0.9998917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1553628792","doi":"","title":"Open BEAGLE: A New Versatile C++ Framework for Evolutionary Computation.","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Beagle; Symbolic regression; Computer science; Genetic programming; Computation; Simple (philosophy); Evolutionary computation; Programming language; Theoretical computer science; Evolutionary programming; Genetic algorithm; Artificial intelligence; Machine learning; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.05214257625053621,"gpt":0.3039328597166819,"spread":0.2517902834661457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007824106,0.00009630286,0.000105247,0.00004851165,0.0003312397,0.0002024022,0.001235987,0.00005904236,0.0003829804],"category_scores_gemma":[0.0000408148,0.00009434445,0.00005552663,0.0004166914,0.00002672338,0.0007356678,0.0003934308,0.0000762649,0.0003145143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004968906,"about_ca_system_score_gemma":0.00006857038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006956427,"about_ca_topic_score_gemma":0.000002581511,"domain_scores_codex":[0.9990865,0.00001512717,0.0001846673,0.000358713,0.0001512722,0.0002036978],"domain_scores_gemma":[0.9990764,0.0002726927,0.00006120452,0.0003690331,0.0000898214,0.000130898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.064364e-7,0.00008268331,0.00002475782,0.000001752797,0.000007797925,3.033598e-7,0.00012239,0.0006859358,0.000003971154,0.6924919,0.2816716,0.02490596],"study_design_scores_gemma":[0.0002758162,0.000048211,0.0007233725,0.000007055949,0.000003056229,0.00000668315,0.00001556773,0.5553364,0.00001349743,0.3496161,0.09383639,0.0001179204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003159502,0.000217164,0.9744816,0.01463628,0.0001679818,0.000551502,0.000009656888,0.0001752297,0.009728954],"genre_scores_gemma":[0.02058032,0.00001245979,0.9706594,0.001011685,0.0001719574,0.00008967585,0.00001477345,0.000007620437,0.007452115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5546504,"threshold_uncertainty_score":0.4193367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059072591","doi":"","title":"Hyperspectral Image Analysis Using Genetic Programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Hyperspectral imaging; Cuprite; Computer science; Remote sensing; Artificial intelligence; Alunite; Shortwave; Pattern recognition (psychology); Genetic programming; Computer vision; Geology; Materials science; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.02291032710511302,"gpt":0.2562158108756366,"spread":0.2333054837705236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003604666,0.00005808976,0.0000709646,0.0001027147,0.0001432686,0.0001054401,0.0003026585,0.00001705692,0.0001564326],"category_scores_gemma":[0.000002516835,0.00005309906,0.00008243408,0.001209824,0.00002626071,0.0002109877,0.0000612836,0.00003932296,0.00006866275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002619721,"about_ca_system_score_gemma":0.000005957262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004482282,"about_ca_topic_score_gemma":0.000003217463,"domain_scores_codex":[0.9993783,0.00001094554,0.0001027781,0.000224449,0.0001130133,0.0001705458],"domain_scores_gemma":[0.9995571,0.00001136822,0.00002544843,0.0003129402,0.0000371162,0.00005605454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001123669,0.001690092,0.01159911,0.00001904329,0.001096608,0.00009773629,0.003058729,0.02768801,0.02157873,0.4238686,0.002878654,0.5064236],"study_design_scores_gemma":[0.00004193492,0.000008463725,0.003909328,4.907858e-7,0.00003821453,0.00001280413,0.0000225006,0.99435,0.0001360745,0.0004748486,0.0009213462,0.00008398815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0190331,0.0001424924,0.977675,0.0005035956,0.00001764416,0.00006355961,4.252435e-7,0.0001348413,0.002429312],"genre_scores_gemma":[0.1846053,0.000006348826,0.8148218,0.00004495203,0.00003415337,0.000007108785,4.694109e-7,0.000002296974,0.0004775006],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.966662,"threshold_uncertainty_score":0.2165317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055239208","doi":"10.1145/2001576.2001765","title":"Rethinking multilevel selection in genetic programming","year":2011,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genetic programming; Computer science; Selection (genetic algorithm); Consistency (knowledge bases); Genetic representation; Genetic algorithm; Class (philosophy); Operator (biology); Evolutionary algorithm; Genetic operator; Evolutionary programming; Artificial intelligence; Theoretical computer science; Machine learning; Mathematical optimization; Mathematics; Meta-optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.04628301425624819,"gpt":0.2512123061742538,"spread":0.2049292919180056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009209054,0.00004476357,0.00003799356,0.00005955215,0.00007040575,0.00002189655,0.0002296902,0.00002832006,0.00001947243],"category_scores_gemma":[0.000005226543,0.00004231349,0.00001470514,0.0002878003,0.00001148693,0.0001928967,0.00005836243,0.00006923965,0.00002875158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002407744,"about_ca_system_score_gemma":0.00002318949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002590053,"about_ca_topic_score_gemma":0.00007624272,"domain_scores_codex":[0.9994922,0.00001394704,0.0001091058,0.0001814154,0.00007229349,0.0001309905],"domain_scores_gemma":[0.9998033,0.00001182782,0.00002308547,0.0001073149,0.00002765276,0.00002679039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001323637,0.0002784676,0.02005095,0.000006428725,0.000005146598,0.000005606944,0.005785407,0.0001353188,0.0008282815,0.2977584,0.0001174881,0.6750271],"study_design_scores_gemma":[0.0001417225,0.00003418154,0.3762623,0.000008348805,0.000001072257,0.00002178645,0.00002238182,0.5663922,0.0009225789,0.05500747,0.001058487,0.0001274164],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02591192,0.00002047556,0.9711381,0.00008574095,0.00003184504,0.0001184284,6.356078e-8,0.0001462688,0.002547127],"genre_scores_gemma":[0.4616887,0.000001678124,0.5381114,0.000031471,0.00001118695,0.00002902278,1.474655e-7,0.000001630325,0.0001248171],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6748998,"threshold_uncertainty_score":0.1725494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W181710077","doi":"","title":"Distributed Beagle: An Environment For Parallel And Distributed Evolutionary Computations","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Scalability; Workstation; Parallel computing; Distributed computing; Evolutionary computation; Speedup; Computation; Evolutionary algorithm; Human-based evolutionary computation; Interactive evolutionary computation; Evolutionary programming; Artificial intelligence; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01591409546536706,"gpt":0.2416505097667037,"spread":0.2257364143013366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001171376,0.0001214236,0.0001059854,0.0000334918,0.000457143,0.00006469904,0.000241653,0.00004871482,0.00002382053],"category_scores_gemma":[0.00001901617,0.0001039829,0.00003971723,0.0001775079,0.00007930442,0.000394388,0.00006546256,0.00005562492,0.00001474449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005576745,"about_ca_system_score_gemma":0.00004812703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009768974,"about_ca_topic_score_gemma":0.000002009318,"domain_scores_codex":[0.9989974,0.0000431234,0.0002026841,0.0003978423,0.0001315888,0.0002273854],"domain_scores_gemma":[0.9992644,0.000118626,0.00005272743,0.0003503489,0.00005241732,0.000161524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002581336,0.0003896006,0.0007970387,0.000005793494,0.00001871886,8.727911e-7,0.00004835157,0.02586089,0.00004864907,0.9649951,0.005365834,0.00246658],"study_design_scores_gemma":[0.0007123384,0.0001339261,0.04532617,0.000003251138,0.0000127806,0.00002779015,0.00006409522,0.7189486,0.00002261995,0.08201972,0.1524508,0.0002778596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001132624,0.0001230814,0.995628,0.00208456,0.00005302509,0.0004021372,0.0003252829,0.0001381694,0.0001131178],"genre_scores_gemma":[0.2916799,0.0000293566,0.7068464,0.0001274651,0.00002807329,0.0002538636,0.0008430709,0.000006910206,0.0001848968],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8829754,"threshold_uncertainty_score":0.42403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2199868482","doi":"10.1007/0-387-23254-0_11","title":"Genetic Programming of an Algorithmic Chemistry","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Synchronization (alternating current); Parallel computing; Theoretical computer science; Distributed computing; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.009439915812976206,"gpt":0.2180048530739808,"spread":0.2085649372610046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004967018,0.0001868313,0.0001864225,0.00004120519,0.00006389932,0.00003791336,0.0007596469,0.0001718666,0.0001043554],"category_scores_gemma":[9.268683e-7,0.0001859103,0.00009455065,0.00004574674,0.00007620077,0.0001054781,0.0001524123,0.0001445743,0.00002991882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003141675,"about_ca_system_score_gemma":0.00009592647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003895082,"about_ca_topic_score_gemma":0.000002640164,"domain_scores_codex":[0.9988796,0.000003129863,0.0003006429,0.0004204136,0.0002392057,0.0001569861],"domain_scores_gemma":[0.9989062,0.00001481153,0.0001678875,0.0007328313,0.0001055115,0.00007279238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[8.247987e-7,0.0001911665,0.000005605536,0.0001112352,0.00004855782,0.000025491,0.00003257759,0.0002888932,0.0006132793,0.358314,0.003234602,0.6371337],"study_design_scores_gemma":[0.0003821748,0.000146365,0.0004166523,0.0001186536,0.00005531855,0.0001945614,0.000006210507,0.1551102,0.001520419,0.1201149,0.7207387,0.001195774],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003779405,0.000327152,0.5629952,0.00007256545,0.00004349289,0.0002321125,0.00001413383,0.0001785623,0.436099],"genre_scores_gemma":[0.0004172011,0.00001781447,0.6066614,0.00001979572,0.0002368991,0.00002925488,0.00004568373,0.00002130785,0.3925506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7175041,"threshold_uncertainty_score":0.7581202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154605267","doi":"10.1109/cec.2006.1688362","title":"Distributed Genetic Algorithm with Bi-Coded Chromosomes and a New Evaluation Function for Features Selection","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Feature selection; Fitness function; Feature (linguistics); Computer science; Genetic algorithm; Selection (genetic algorithm); Code (set theory); Algorithm; Binary code; Pattern recognition (psychology); Artificial intelligence; Rate of convergence; Binary number; Population; Function (biology); Mathematics; Machine learning; Key (lock); Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01211402043993123,"gpt":0.2381797935404474,"spread":0.2260657731005162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001052817,0.0001064095,0.00008158002,0.00006183454,0.0002452416,0.0001200768,0.0001023529,0.00004875189,0.00001125646],"category_scores_gemma":[0.000005554386,0.00008560141,0.00002359699,0.000420025,0.00002213984,0.0002942936,0.00002288739,0.00004414966,0.000002907035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005703144,"about_ca_system_score_gemma":0.0001178914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000284168,"about_ca_topic_score_gemma":0.000119523,"domain_scores_codex":[0.999148,0.0000207829,0.0001256533,0.0003342989,0.0002149773,0.0001562527],"domain_scores_gemma":[0.999498,0.00003891605,0.00006039575,0.0001527375,0.0001962093,0.00005381746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003543114,0.000272121,0.001110147,0.00001969921,0.00006849243,6.055562e-7,0.00007322995,0.01576515,0.003338403,0.07453313,0.04531055,0.859473],"study_design_scores_gemma":[0.0008608148,0.0002375366,0.1545706,0.000005345503,0.00003983494,0.00004313794,0.000009031328,0.8124264,0.0009263265,0.02697105,0.003759383,0.0001505761],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004084691,0.0002863212,0.9936342,0.001059729,0.00005389634,0.000587431,0.0000118183,0.0001627545,0.0001191632],"genre_scores_gemma":[0.1352833,0.0000103841,0.8625944,0.00008383948,0.0003447801,0.0003179581,0.0001978482,0.000010471,0.001156996],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8593225,"threshold_uncertainty_score":0.3490724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100208842","doi":"10.1504/ijhpsa.2008.024207","title":"Genetic programming on GPUs for image processing","year":2008,"lang":"en","type":"article","venue":"International Journal of High Performance Systems Architecture","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Graphics; Genetic programming; Task (project management); Image processing; General-purpose computing on graphics processing units; Computer graphics; CUDA; Enhanced Data Rates for GSM Evolution; Noise (video); Image (mathematics); Artificial intelligence; Parallel computing; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.01007249681126036,"gpt":0.2481149584042075,"spread":0.2380424615929471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001769984,0.0001256743,0.0001638961,0.0002316802,0.0002271286,0.0001192328,0.0009696573,0.00004311591,0.000001747072],"category_scores_gemma":[0.00002164866,0.00009710914,0.00009036653,0.0001521964,0.00005319668,0.0003824831,0.00005700278,0.0002093785,0.000006574866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008175001,"about_ca_system_score_gemma":0.000149297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007989077,"about_ca_topic_score_gemma":4.683482e-7,"domain_scores_codex":[0.9986188,0.00002157781,0.0004392088,0.0001747733,0.0005606117,0.0001849971],"domain_scores_gemma":[0.9986483,0.00005549444,0.0004004892,0.0001619713,0.000661415,0.00007231901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002299773,0.000668678,0.002410755,0.0002436388,0.0002801022,0.0002898769,0.00299821,0.1940023,0.00340692,0.01240993,0.00309323,0.7799664],"study_design_scores_gemma":[0.005834932,0.003039844,0.09655906,0.001752125,0.0000494277,0.03964056,0.0001658811,0.6221554,0.005223137,0.004425297,0.2198719,0.001282471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3252739,0.0002624808,0.6722582,0.001039121,0.0008392455,0.000205128,0.000006209262,0.00003185894,0.00008385228],"genre_scores_gemma":[0.8229072,0.00004019368,0.1758601,0.00006641056,0.0009733233,0.00003947579,0.000002211878,0.000009570774,0.0001014725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.778684,"threshold_uncertainty_score":0.3959996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2809097245","doi":"10.1162/evco_a_00232","title":"Emergent Solutions to High-Dimensional Multitask Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Task (project management); Neuroevolution; Representation (politics); Face (sociological concept); Machine learning; A priori and a posteriori; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.01805246211504712,"gpt":0.2633443572435885,"spread":0.2452918951285413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002746488,0.0001956414,0.0001429476,0.0002654383,0.00135065,0.00006164236,0.0004401412,0.00006689722,0.0001397196],"category_scores_gemma":[0.00005508945,0.0002137004,0.00007929519,0.0009667808,0.00009432121,0.0005914046,0.0004549132,0.0001640617,0.001846505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002791773,"about_ca_system_score_gemma":0.0001636782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001224395,"about_ca_topic_score_gemma":0.000009473189,"domain_scores_codex":[0.9979085,0.00009541248,0.0004189473,0.0005778601,0.0005504463,0.0004487849],"domain_scores_gemma":[0.9986625,0.00008145271,0.0001257262,0.0003439489,0.0005583519,0.0002279705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001384418,0.0002105108,0.0001810954,0.000005280993,0.00003743543,0.000002978474,0.0003939574,0.7914453,0.00198369,0.1497199,0.04368608,0.01231993],"study_design_scores_gemma":[0.0003461028,0.0003211157,0.02925958,0.00001862213,0.000008172581,0.00002394164,0.00002454386,0.9467399,0.0001692454,0.009381225,0.01341583,0.0002916905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0127245,0.00008103146,0.9796234,0.005158413,0.0008359863,0.0003984697,0.000005441335,0.0004309746,0.0007418345],"genre_scores_gemma":[0.7542732,0.000004107632,0.2439647,0.0004025134,0.0004120726,0.00009062533,0.000120829,0.00001143799,0.0007204933],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7415487,"threshold_uncertainty_score":0.9999495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604908377","doi":"10.1007/978-3-319-55696-3_5","title":"Emergent Tangled Graph Representations for Atari Game Playing Agents","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Graph; Benchmarking; Machine learning; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03932165180850437,"gpt":0.3050081953230138,"spread":0.2656865435145094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004904635,0.0003878262,0.0003668347,0.0005236796,0.001068921,0.0005335151,0.003847702,0.0002043412,0.00002507305],"category_scores_gemma":[0.0001013274,0.0003817062,0.0002156724,0.0002617995,0.0004999912,0.0007006658,0.001075127,0.0003984983,0.00003384741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001780634,"about_ca_system_score_gemma":0.0003866648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004670766,"about_ca_topic_score_gemma":0.00007864015,"domain_scores_codex":[0.9967369,0.00001590637,0.0004863949,0.001514416,0.000682759,0.0005635862],"domain_scores_gemma":[0.9966446,0.0003122619,0.0004129636,0.002127935,0.0003174717,0.0001847786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001125153,0.000185271,0.0002837633,0.00008937751,0.00008475176,0.00006516845,0.001774101,0.07315631,0.0003929526,0.2866338,0.001796423,0.6355268],"study_design_scores_gemma":[0.0003078531,0.00007105569,0.0008696315,0.0001344351,0.0000135702,0.00002773883,1.869321e-7,0.6186048,0.0001495659,0.3697236,0.009589162,0.0005083354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003414333,0.0002719289,0.9927323,0.001946585,0.001604445,0.0008350345,0.00003778447,0.0001289681,0.002408783],"genre_scores_gemma":[0.03869313,0.0001240503,0.9569679,0.0007781667,0.0008183808,0.0001898201,0.00006254598,0.00004411982,0.002321836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6350185,"threshold_uncertainty_score":0.9998635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013406396","doi":"10.1038/nmeth.3180","title":"Two-factor designs","year":2014,"lang":"en","type":"article","venue":"Nature Methods","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Computational biology; Computer science; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.03389331302941005,"gpt":0.3926086461626029,"spread":0.3587153331331928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006418286,0.00008428333,0.00009574016,0.00005089297,0.0001288133,0.00005028351,0.0006300253,0.0001196371,0.00002380871],"category_scores_gemma":[0.0001486188,0.00007044535,0.00005146718,0.0003604425,0.0000225654,0.0001688502,0.0001078953,0.0003491473,0.0000428402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001918009,"about_ca_system_score_gemma":0.00002687701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003088651,"about_ca_topic_score_gemma":5.743134e-7,"domain_scores_codex":[0.9990582,0.000274838,0.0001016537,0.0002703199,0.0001338718,0.0001611542],"domain_scores_gemma":[0.998877,0.0004149145,0.00004118843,0.0005260138,0.00006526597,0.00007556212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[4.221761e-7,0.00002273823,0.00003648407,0.00000179759,0.000004626484,3.877044e-7,0.00004614708,0.00001492251,0.006130162,0.6781199,0.0007137006,0.3149087],"study_design_scores_gemma":[0.0004086676,0.00006949662,0.01502425,0.000008630313,0.000008545067,0.00003869587,0.000006362138,0.2501304,0.02568582,0.2433076,0.4649306,0.0003809729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001569463,0.0002964591,0.9881335,0.00140006,0.0003958227,0.0000728134,9.404349e-7,0.0001687111,0.009374763],"genre_scores_gemma":[0.04114772,0.000002887767,0.9575047,0.0006546517,0.0002200996,0.00001717129,0.000001314681,0.000005436528,0.0004460461],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4642169,"threshold_uncertainty_score":0.2872678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1565486756","doi":"","title":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","year":2009,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Library science; Publishing; Computer science; Evolutionary computation; Track (disk drive); Operations research; Political science; Artificial intelligence; Law; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01481196157601875,"gpt":0.2366278524168018,"spread":0.221815890840783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001783511,0.00038235,0.000364133,0.0001980958,0.0007542897,0.0001933252,0.0005890073,0.0001625834,0.00001934961],"category_scores_gemma":[0.0000318843,0.0003431331,0.00008403676,0.000614999,0.000463623,0.0004999691,0.0002744832,0.0002960013,0.00001094168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009228443,"about_ca_system_score_gemma":0.0003365662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004371683,"about_ca_topic_score_gemma":0.000003508983,"domain_scores_codex":[0.9973012,0.0001042255,0.0006643602,0.0008575765,0.0006537585,0.0004188824],"domain_scores_gemma":[0.9979195,0.0001539754,0.0004538499,0.0002558587,0.001016251,0.0002005694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001520186,0.001218789,0.02575281,0.0002890092,0.0001709691,0.00001211982,0.00899677,0.09862134,0.00854966,0.4726034,0.006068591,0.3775645],"study_design_scores_gemma":[0.0004601879,0.0002280365,0.5574127,0.0001178595,0.00002085408,0.00009407972,0.0002344774,0.3952445,0.00003332683,0.04564288,0.0002475496,0.0002636233],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6831859,0.0006399578,0.3076694,0.004562094,0.0002610184,0.0008619779,0.00006556758,0.0001947929,0.002559339],"genre_scores_gemma":[0.941892,0.0002296716,0.05725472,0.000314586,0.00008195055,0.0000320842,0.00002954237,0.00001237054,0.0001530511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5316598,"threshold_uncertainty_score":0.9999021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2768421170","doi":"10.1016/j.ins.2017.11.041","title":"Automatic feature engineering for regression models with machine learning: An evolutionary computation and statistics hybrid","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Universal","keywords":"Genetic programming; Computer science; Feature engineering; Symbolic regression; Interpretability; Machine learning; Artificial intelligence; Randomness; Feature (linguistics); Benchmark (surveying); Evolutionary computation; Regression; Data mining; Statistics; Mathematics; Deep learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0199954237668725,"gpt":0.2768263841359542,"spread":0.2568309603690817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002897278,0.00009182981,0.00008161336,0.0001045435,0.001543971,0.0006697614,0.0004358886,0.00002393346,0.000001156378],"category_scores_gemma":[0.00005625493,0.00006872068,0.00001134472,0.000100177,0.0001233891,0.006802212,0.00008816165,0.00007427437,0.000002673464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002115481,"about_ca_system_score_gemma":0.00007771754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002492963,"about_ca_topic_score_gemma":0.000002418587,"domain_scores_codex":[0.9992617,0.00001186854,0.0001537348,0.0001535991,0.0002777092,0.0001414182],"domain_scores_gemma":[0.9992626,0.00007774688,0.0002389045,0.0001892286,0.000161644,0.00006983548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007349456,0.00003963506,0.0008419825,0.00007821299,0.000009959135,9.251723e-7,0.001281844,0.4341924,0.00003480272,0.3204256,0.001256176,0.2418311],"study_design_scores_gemma":[0.0002048101,0.0001312539,0.006492174,0.00002681107,0.000002911819,0.00003231605,0.00004605769,0.9808126,0.00001891107,0.01113601,0.0009889588,0.0001071616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008164526,0.00004330667,0.990256,0.0009204172,0.00006484443,0.0002156462,0.00003411184,0.0001168436,0.0001843149],"genre_scores_gemma":[0.380805,0.000009115023,0.6190384,0.00003342523,0.0000153729,0.00002907211,0.00004646017,0.000001884911,0.00002127542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5466202,"threshold_uncertainty_score":0.9997559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124875591","doi":"10.2166/hydro.2009.032","title":"Investigating the capabilities of evolutionary data-driven techniques using the challenging estimation of soil moisture content","year":2009,"lang":"en","type":"article","venue":"Journal of Hydroinformatics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Water content; Environmental science; Genetic programming; Lag; Soil science; Moisture; Computer science; Meteorology; Machine learning; Engineering; Geotechnical engineering; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.05063003489751901,"gpt":0.282061851503608,"spread":0.231431816606089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006825562,0.00008185812,0.0001722353,0.00007913858,0.000205931,0.00003198295,0.001088344,0.00003304309,6.899551e-7],"category_scores_gemma":[0.0001563351,0.00004678158,0.00006202266,0.0002492026,0.0001530938,0.001158207,0.0001542479,0.0002044483,2.136502e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000491099,"about_ca_system_score_gemma":0.0001708026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002243508,"about_ca_topic_score_gemma":0.000001562455,"domain_scores_codex":[0.9985828,0.00004111554,0.0008140511,0.00005232704,0.0004060654,0.0001036063],"domain_scores_gemma":[0.9979055,0.0001865883,0.001091923,0.0005190196,0.0002655878,0.00003140224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003547799,0.000161981,0.0002322845,0.0001527707,0.00008344049,0.000001065523,0.01179791,0.875737,0.00237226,0.09176438,0.001629969,0.01606335],"study_design_scores_gemma":[0.00007038101,0.0000763823,0.001206848,0.0001514713,0.00002087032,0.0001511659,0.001256711,0.9847628,0.0007018951,0.01147234,0.00008017151,0.00004892722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3273606,0.0008411279,0.663776,0.007144365,0.0001073765,0.0003234895,0.00002070732,0.00003194123,0.0003943893],"genre_scores_gemma":[0.7500838,0.00004736421,0.249732,0.00007848381,0.00004884441,9.265065e-7,0.000002884521,0.000002045841,0.000003624129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4227232,"threshold_uncertainty_score":0.2022432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3175526646","doi":"10.48550/arxiv.2106.14131","title":"SymbolicGPT: A Generative Transformer Model for Symbolic Regression","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Symbolic regression; Computer science; Probabilistic logic; Transformer; Artificial intelligence; Machine learning; Regression; Generative grammar; Exploit; Generative model; Regression analysis; Genetic programming; Mathematics; Statistics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08461084795732692,"gpt":0.2156237108939364,"spread":0.1310128629366095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001291785,0.0003113857,0.0003334736,0.0001520589,0.0003693143,0.000127684,0.001227088,0.000289055,0.00001092204],"category_scores_gemma":[0.000009801211,0.000330396,0.0003362601,0.0004515518,0.00007652275,0.0004234111,0.0004858556,0.0003706664,0.00001156143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001628709,"about_ca_system_score_gemma":0.0004806918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003459565,"about_ca_topic_score_gemma":0.00002782395,"domain_scores_codex":[0.9981214,0.00005662145,0.0002065172,0.001177186,0.00009207686,0.0003462116],"domain_scores_gemma":[0.9982975,0.00006172435,0.0001518857,0.001017258,0.0003017646,0.0001699193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009080615,0.0001582431,0.00003248299,0.00006267778,0.00006376551,0.00002002336,0.0009610629,0.5286676,0.0003487742,0.4682379,0.0005065442,0.0009318247],"study_design_scores_gemma":[0.0003437191,0.00001901783,0.00008862309,0.00006403915,0.00005234242,0.000004192751,0.00008359096,0.925103,0.0004249867,0.07322198,0.0002388549,0.0003556478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04204868,0.0001819596,0.9554307,0.0005431498,0.0002019403,0.0005589725,0.00006940334,0.0001709019,0.0007942843],"genre_scores_gemma":[0.9354528,0.0002983194,0.06042043,0.0001648364,0.0001102189,0.00002784649,0.0001071353,0.00002045933,0.003397934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8950103,"threshold_uncertainty_score":0.9999148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161148706","doi":"10.1109/tcsi.2005.846216","title":"A hybrid evolutionary programming method for circuit optimization","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Evolutionary programming; Computer science; Evolutionary computation; Genetic programming; Mathematical optimization; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02066765419552845,"gpt":0.2699785122886069,"spread":0.2493108580930784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006078139,0.0002082822,0.000202241,0.0001498587,0.001228549,0.0002291096,0.0002484759,0.00007507975,0.00001183118],"category_scores_gemma":[0.000003048096,0.0002094233,0.00008353575,0.0002490013,0.0001074564,0.0004868497,0.000005990778,0.0001403197,0.00001099747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009080466,"about_ca_system_score_gemma":0.00004702589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009942352,"about_ca_topic_score_gemma":0.000001230924,"domain_scores_codex":[0.9984607,0.0001281801,0.000366306,0.0005979824,0.0001726312,0.0002742079],"domain_scores_gemma":[0.9987912,0.0004504215,0.0001202709,0.0003732809,0.00009243204,0.0001724011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000685895,0.0002971249,0.000002424241,0.00004418911,0.00004561032,2.230492e-7,0.0001958124,0.03869148,0.0003844154,0.5889934,0.00004982011,0.3712887],"study_design_scores_gemma":[0.001167481,0.0002355044,0.00005004793,0.00007063375,0.00009565835,0.0003884658,0.0005677082,0.8845422,0.0007162577,0.03014899,0.08139352,0.000623501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000241341,0.0007085323,0.9960265,0.0003480918,0.0001206522,0.001755457,0.0001639662,0.0002126271,0.0004228057],"genre_scores_gemma":[0.8939741,0.0001402441,0.09922332,0.0002332174,0.0002338555,0.005183092,0.00003167265,0.00002684477,0.0009536449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8968032,"threshold_uncertainty_score":0.9449131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128670925","doi":"10.1109/cec.2009.4983255","title":"Evolving novel image features using Genetic Programming-based image transforms","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Artificial intelligence; Grayscale; Computer science; Image (mathematics); Set (abstract data type); Pattern recognition (psychology); Genetic algorithm; Feature (linguistics); Cartesian coordinate system; Feature vector; Task (project management); Evolutionary computation; Moment (physics); Feature extraction; Computer vision; Contextual image classification; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01272259360864188,"gpt":0.2613284708182124,"spread":0.2486058772095705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009286018,0.0001447275,0.0001080026,0.00008203101,0.0002689401,0.0002787253,0.0005342991,0.00004860815,0.00002300713],"category_scores_gemma":[0.000007093571,0.0001215216,0.00008809457,0.0004543551,0.00005106983,0.0005784101,0.00002738749,0.0001127523,0.00001523384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004772762,"about_ca_system_score_gemma":0.00009696597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003611912,"about_ca_topic_score_gemma":0.000004000445,"domain_scores_codex":[0.9989043,0.00000916272,0.0001866185,0.0003560385,0.0002200445,0.0003238221],"domain_scores_gemma":[0.9993174,0.00002313796,0.00004473559,0.0004025748,0.0001091575,0.0001030064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000808432,0.001663791,0.000217988,0.0000449689,0.00002851829,0.00003465418,0.0005708153,0.003022511,0.5970415,0.06649102,0.001488472,0.3293877],"study_design_scores_gemma":[0.0007529604,0.0001555644,0.06353764,0.00003015887,0.00001659208,0.00008389361,0.00002942909,0.9096979,0.02035747,0.003476848,0.001362457,0.0004990154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003247479,0.0001408722,0.9928024,0.001904907,0.00004101433,0.0002844435,0.000002688876,0.0002918595,0.001284295],"genre_scores_gemma":[0.1662341,0.000001987439,0.8332454,0.0003267896,0.00005782605,0.00001412441,0.000003851662,0.000006344616,0.0001096197],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9066755,"threshold_uncertainty_score":0.4955507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}