{"meta":{"query_hash":"c99f131f2551","filters":{"topic":"Evolutionary Algorithms and Applications"},"cohort_total":691,"direct_labels_cover":0,"predictions_cover":691,"exported":691,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c99f131f2551","api":"https://metacan.xera.ac/api/v1/cohort?topic=Evolutionary+Algorithms+and+Applications"},"results":[{"id":"W112571559","doi":"10.1007/0-387-29026-5_3","title":"Combinatorial Evolutionary Methods in Wireless Mobile Computing","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Windsor","funders":"","keywords":"Computer science; Wireless; Distributed computing; Computational biology; Biology; Telecommunications","score_opus":0.01828775062124818,"score_gpt":0.29461983739004444,"score_spread":0.2763320867687963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112571559","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030730094,0.014043752,0.92069703,0.0007650438,0.00078719424,0.00004917928,0.00007682548,0.00020032574,0.06030763],"genre_scores_gemma":[0.17271048,0.02813543,0.63920677,0.00066222175,0.001188905,0.00044402262,0.00033834882,0.0005875656,0.15672624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996352,0.00015299147,0.000014165082,0.000040717405,0.00013229517,0.000024578872],"domain_scores_gemma":[0.99956805,0.0002877774,0.000015425332,0.000042116157,0.000068569294,0.000018160239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006314453,0.00083610666,0.0010481217,0.0007943254,0.00034293806,0.0016446069,0.0012561632,0.0013352317,0.01000806],"category_scores_gemma":[0.001945591,0.00040406044,0.0005231939,0.0019589374,0.0008381487,0.0012177101,0.00076506916,0.0014983303,0.00224393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002006199,0.000061151106,0.00019875584,0.0003210987,0.000057462315,0.000098278644,0.00008016543,0.25081414,0.0011159176,0.44333756,0.025987836,0.2779076],"study_design_scores_gemma":[0.000020514704,0.00003088136,0.00023144396,0.00015301188,0.000024707091,0.00019104937,0.00005289139,0.5667486,0.000661962,0.35833415,0.07352863,0.000022259987],"about_ca_topic_score_codex":0.0010815716,"about_ca_topic_score_gemma":0.0013185819,"teacher_disagreement_score":0.01000806,"about_ca_system_score_codex":0.00060374103,"about_ca_system_score_gemma":0.00046473506,"threshold_uncertainty_score":0.033480346},"labels":[],"label_agreement":null},{"id":"W113154612","doi":"10.1007/978-3-642-33093-3_22","title":"Adaptation and Genomic Evolution in EcoSim","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Adaptation (eye); Biology","score_opus":0.017583893813993903,"score_gpt":0.22883524677568073,"score_spread":0.21125135296168684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113154612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09898216,0.007469506,0.7887751,0.0014732595,0.0006353207,0.00004308886,0.00018390077,0.0008530956,0.101584606],"genre_scores_gemma":[0.75482154,0.004000638,0.20600726,0.0003970385,0.00024844136,0.00013039036,0.0002629356,0.00047703175,0.033654798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991643,0.000030916286,0.0000040401405,0.000018446877,0.000021896873,0.000008267636],"domain_scores_gemma":[0.9998772,0.000073647745,0.000009494017,0.000018264296,0.000012889631,0.000008485768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020927623,0.0003255584,0.0004393671,0.00025695353,0.00028891367,0.00069077354,0.00063154375,0.00062735425,0.0046854788],"category_scores_gemma":[0.0010997211,0.00019673262,0.00041422294,0.00044872222,0.00073003425,0.0010408349,0.0008215365,0.00079401163,0.00064741395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041398565,0.000023094197,0.0008069939,0.00016941666,0.000051685965,0.00018681565,0.0002104549,0.27284598,0.0042886953,0.59416205,0.0034793369,0.123734035],"study_design_scores_gemma":[0.000011255328,0.000036703786,0.0006033898,0.000034604338,0.000023389604,0.00020826024,0.000057174806,0.48615906,0.0016643056,0.4915362,0.019638453,0.000027185408],"about_ca_topic_score_codex":0.0007755964,"about_ca_topic_score_gemma":0.00076447555,"teacher_disagreement_score":0.0046854788,"about_ca_system_score_codex":0.0003207808,"about_ca_system_score_gemma":0.00019566219,"threshold_uncertainty_score":0.015674531},"labels":[],"label_agreement":null},{"id":"W1174219372","doi":"10.1007/978-3-319-21500-6_15","title":"Unary Patterns with Permutations","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Combinatorics; Sigma; Mathematics; Alphabet; Integer (computer science); Pi; Word (group theory); Function (biology); Discrete mathematics; Physics; Computer science; Geometry; Genetics; Philosophy; Biology","score_opus":0.021343112257833988,"score_gpt":0.25421918387509906,"score_spread":0.2328760716172651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1174219372","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019608513,0.0032343818,0.47661576,0.001770506,0.0023438623,0.00018906499,0.0009335634,0.001247951,0.49405625],"genre_scores_gemma":[0.31372416,0.00476433,0.30346566,0.0013692016,0.0014584347,0.0006004011,0.0021236723,0.001527508,0.37096667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990934,0.00018219296,0.000089832894,0.00025210506,0.00026405192,0.00011848695],"domain_scores_gemma":[0.9994367,0.00015777689,0.00004346982,0.00024739263,0.00008279956,0.00003188997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004932473,0.0009772344,0.00081710663,0.001124088,0.0013081952,0.0032702861,0.0011340193,0.0009550724,0.028902918],"category_scores_gemma":[0.0024501034,0.000606946,0.0009119831,0.0023228156,0.0020044767,0.006317315,0.002228641,0.0021930346,0.011327475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002606103,0.000013309136,0.000050328705,0.00009615416,0.0000062199924,0.0000707602,0.00013375118,0.0004690921,0.00089972484,0.89225227,0.009248413,0.096733905],"study_design_scores_gemma":[0.0000050965014,0.000013559444,0.000042242722,0.000032026972,0.0000059721183,0.00022423208,0.00003313924,0.0010723929,0.0010438983,0.9314949,0.06602311,0.000009475926],"about_ca_topic_score_codex":0.00032039543,"about_ca_topic_score_gemma":0.00038093803,"teacher_disagreement_score":0.028902918,"about_ca_system_score_codex":0.0006636822,"about_ca_system_score_gemma":0.00058022304,"threshold_uncertainty_score":0.09668988},"labels":[],"label_agreement":null},{"id":"W118937142","doi":"","title":"Evolutionary Graphs on Two Levels.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.02267969934936548,"score_gpt":0.2519833874877529,"score_spread":0.22930368813838742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118937142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052738775,0.001177972,0.8361,0.0019086759,0.0003709178,0.00014862325,0.0005275079,0.000574885,0.106452726],"genre_scores_gemma":[0.50263494,0.0009555728,0.42864972,0.00072537555,0.00014000012,0.000282109,0.00084049,0.00029954847,0.06547229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930084,0.00022352458,0.000038399554,0.00017612189,0.00016190838,0.00009926016],"domain_scores_gemma":[0.99823004,0.0006684121,0.00013366419,0.0004891914,0.00023010655,0.00024857657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006287349,0.00038521475,0.0005596736,0.0011582242,0.0013981962,0.0023798516,0.0012428067,0.0015802362,0.020760164],"category_scores_gemma":[0.004271626,0.00040955163,0.00091741484,0.001155746,0.0014351207,0.002839689,0.0021234641,0.0019126539,0.0021666586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038362705,0.000039829854,0.00050728704,0.0000816246,0.000033879904,0.00017392519,0.00014745335,0.018209487,0.0016651658,0.9395474,0.003327906,0.03622754],"study_design_scores_gemma":[0.000023762832,0.0000323722,0.00047064121,0.000052298903,0.000034600183,0.00024553027,0.0001058171,0.055894908,0.00090365444,0.91212577,0.030090561,0.000020075893],"about_ca_topic_score_codex":0.0012566694,"about_ca_topic_score_gemma":0.0023664325,"teacher_disagreement_score":0.020760164,"about_ca_system_score_codex":0.0011771477,"about_ca_system_score_gemma":0.0007201346,"threshold_uncertainty_score":0.0694496},"labels":[],"label_agreement":null},{"id":"W12582432","doi":"","title":"Evolution of recurrent neural networks to control Autonomous Life Agents","year":2001,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Waterloo","funders":"","keywords":"Artificial life; Recurrent neural network; Autonomous agent; Computer science; Artificial intelligence; Task (project management); Artificial neural network; Intelligent agent; Multi-agent system; Control (management); Simple (philosophy); Engineering","score_opus":0.02028320403609548,"score_gpt":0.25074937336899034,"score_spread":0.23046616933289485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12582432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38278502,0.0006815105,0.5976901,0.000796433,0.00024067253,0.00010076303,0.00005691261,0.00094458193,0.016704017],"genre_scores_gemma":[0.990886,0.000042253243,0.0073616756,0.000050947117,0.00001346485,0.00003193996,0.000018077633,0.00001704371,0.0015785354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980646,0.000054137407,0.000011681292,0.00003676139,0.000043906664,0.000047155674],"domain_scores_gemma":[0.9993856,0.00021736557,0.00010912954,0.00003351387,0.00020101592,0.000053403073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080948777,0.0004969678,0.0005762044,0.0002722439,0.00027923248,0.0006676535,0.00086643663,0.0007715259,0.0013087784],"category_scores_gemma":[0.0021114494,0.00029603188,0.00032157724,0.00014250413,0.00054084195,0.0005048287,0.0005770598,0.0006447196,0.00019766523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004479053,0.000048792732,0.0005032838,0.000017672466,0.00003656987,0.00006253566,0.000044535012,0.98062253,0.002844214,0.0047209146,0.00038977028,0.010664334],"study_design_scores_gemma":[0.0000039181173,0.00001738819,0.000035868583,0.0000011428772,0.0000034471277,0.000003054015,0.000002206532,0.9992273,0.0001673775,0.00046140692,0.000075366515,0.0000015480819],"about_ca_topic_score_codex":0.004894137,"about_ca_topic_score_gemma":0.0039866827,"teacher_disagreement_score":0.004894137,"about_ca_system_score_codex":0.0007324486,"about_ca_system_score_gemma":0.00041375033,"threshold_uncertainty_score":0.009731293},"labels":[],"label_agreement":null},{"id":"W134905603","doi":"10.1007/978-3-642-37207-0_9","title":"Robustness and Evolvability of Recombination in Linear Genetic Programming","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Robustness (evolution); Phenotype; Biology; Genetic programming; Recombination; Computer science; Genetics; Evolutionary biology; Computational biology; Artificial intelligence; Gene","score_opus":0.013951434353448783,"score_gpt":0.24116370624880631,"score_spread":0.22721227189535753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134905603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17650166,0.0030576284,0.79301214,0.00087847473,0.00012225451,0.00005202902,0.000059118647,0.000268763,0.026047966],"genre_scores_gemma":[0.9553181,0.0009060356,0.038667083,0.00009638009,0.00012052189,0.00009009291,0.000048531125,0.00014009666,0.004613256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985599,0.00080977805,0.00006752908,0.00017842992,0.00028266292,0.000101699196],"domain_scores_gemma":[0.98704034,0.010971941,0.00070597883,0.0006793435,0.00041473928,0.00018762054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024310516,0.0006000778,0.00072048535,0.00078120077,0.0004058801,0.0017853039,0.0013658323,0.0012315572,0.0018491811],"category_scores_gemma":[0.021047601,0.0004602254,0.0010053426,0.0006830436,0.0023673838,0.0018977562,0.0016868775,0.0020057906,0.00027555876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025834757,0.0000703718,0.0012699354,0.00022897913,0.00013355636,0.00022026671,0.0003559917,0.60358506,0.010366561,0.3117253,0.0007714463,0.07101422],"study_design_scores_gemma":[0.000028443681,0.00013299928,0.0005262356,0.000044143726,0.000034249642,0.0001615268,0.000040525214,0.72774816,0.002349445,0.268036,0.0008705183,0.00002784123],"about_ca_topic_score_codex":0.0004123266,"about_ca_topic_score_gemma":0.000193982,"teacher_disagreement_score":0.0024310516,"about_ca_system_score_codex":0.0007414458,"about_ca_system_score_gemma":0.00029171695,"threshold_uncertainty_score":0.0128567815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Swarm behaviour; Computer science; Evolutionary computation; Artificial intelligence","score_opus":0.01883730947000606,"score_gpt":0.2590932603582102,"score_spread":0.24025595088820412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480328200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3308755,0.0007460848,0.6324086,0.000786581,0.000048822763,0.00008575946,0.000053847612,0.00053818244,0.03445673],"genre_scores_gemma":[0.9132385,0.00040866,0.08312779,0.00008585816,0.000014674135,0.00012003582,0.00006192494,0.00008232752,0.0028602881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977726,0.00009791605,0.000008719964,0.000030177713,0.00006001572,0.000025904768],"domain_scores_gemma":[0.99948287,0.00031441616,0.000060097518,0.00006411787,0.000044222284,0.00003434097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067792553,0.00041116317,0.00041385586,0.000571222,0.00044840729,0.0010391244,0.0005383116,0.000569184,0.0019309097],"category_scores_gemma":[0.0022859874,0.00029898886,0.00044354494,0.0003611854,0.0012322448,0.001091032,0.0012758273,0.00047997775,0.0001812103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000916325,0.00009100008,0.003093466,0.00020235998,0.00012963728,0.00043031853,0.0009869444,0.6991488,0.021093313,0.20846292,0.0011705728,0.06509906],"study_design_scores_gemma":[0.00003736954,0.00008983092,0.0010918876,0.000022801514,0.000022345848,0.00018395792,0.00021850878,0.87292194,0.0020067198,0.11506789,0.008315323,0.000021439475],"about_ca_topic_score_codex":0.00075204956,"about_ca_topic_score_gemma":0.0006241183,"teacher_disagreement_score":0.0019309097,"about_ca_system_score_codex":0.0005012254,"about_ca_system_score_gemma":0.00038017382,"threshold_uncertainty_score":0.006459594},"labels":[],"label_agreement":null},{"id":"W1483457136","doi":"10.5772/14688","title":"Evolvable Metaheuristics on Circuit Design","year":2011,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Metaheuristic; Computer science; Systems engineering; Engineering; Artificial intelligence","score_opus":0.07546975879759946,"score_gpt":0.244431409288355,"score_spread":0.16896165049075554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483457136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010165994,0.007933584,0.9456791,0.0015034426,0.00034953153,0.00009282275,0.00012606065,0.00039385897,0.033755567],"genre_scores_gemma":[0.45259336,0.014211971,0.48876053,0.0014270071,0.0005218488,0.00082435785,0.00054872036,0.00038110706,0.04073111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996025,0.00017112412,0.00001641436,0.000055333578,0.00011618237,0.000038494974],"domain_scores_gemma":[0.99946207,0.00033620908,0.00004678691,0.000057853573,0.00007184643,0.000025181678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005744997,0.0011105277,0.0010299432,0.00098725,0.00045887902,0.0012855999,0.0011132355,0.0014191571,0.0042244764],"category_scores_gemma":[0.0018740017,0.00040522133,0.0010118999,0.0016147414,0.0014429408,0.0006779776,0.0011016096,0.0019313268,0.0008359338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030720134,0.000034478984,0.00022794379,0.00013553519,0.0000730363,0.000097378994,0.000061769715,0.82449657,0.00090003153,0.108445816,0.0040845303,0.06141221],"study_design_scores_gemma":[0.000032883192,0.00005689938,0.0001443912,0.00010025705,0.000024548037,0.00006770985,0.000025958623,0.83899915,0.0005565697,0.14030813,0.019667298,0.000016118474],"about_ca_topic_score_codex":0.0023154435,"about_ca_topic_score_gemma":0.0017091223,"teacher_disagreement_score":0.0042244764,"about_ca_system_score_codex":0.0012592857,"about_ca_system_score_gemma":0.0009800517,"threshold_uncertainty_score":0.014132261},"labels":[],"label_agreement":null},{"id":"W1484657058","doi":"10.1007/978-3-540-72877-1_16","title":"The Evolution of Artistic Filters","year":2007,"lang":"en","type":"book-chapter","venue":"Natural computing series","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Art; Aesthetics","score_opus":0.013117592724235103,"score_gpt":0.24435328307217408,"score_spread":0.23123569034793898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484657058","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088942066,0.014391507,0.43116155,0.0024298895,0.0011935792,0.00006342132,0.00019069748,0.00045556738,0.4611717],"genre_scores_gemma":[0.6947383,0.0069053615,0.12985139,0.00035748983,0.0003455571,0.00007412106,0.00023662279,0.0002602523,0.16723092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99981874,0.000041426843,0.0000066551383,0.000040198673,0.000070350245,0.00002271329],"domain_scores_gemma":[0.9996741,0.00013993609,0.000024856503,0.00007271624,0.00005786562,0.000030510493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045198956,0.000321572,0.0003092631,0.0007681458,0.00069651037,0.0023608205,0.0007078757,0.00080476044,0.010011907],"category_scores_gemma":[0.0022426182,0.00027167343,0.0003874261,0.0007359101,0.0015986557,0.0017560448,0.00087809516,0.0009947541,0.0010799041],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021739743,0.000015738737,0.00039950383,0.000093589115,0.000021291604,0.00006342087,0.00035151493,0.021512112,0.003561019,0.8246195,0.0053368844,0.14400381],"study_design_scores_gemma":[0.000025370398,0.000055090983,0.0011064971,0.00010723848,0.000023422625,0.0004467908,0.00021382209,0.10955951,0.0040950105,0.7500976,0.13422509,0.000044643577],"about_ca_topic_score_codex":0.0010009321,"about_ca_topic_score_gemma":0.001289596,"teacher_disagreement_score":0.010011907,"about_ca_system_score_codex":0.00093023665,"about_ca_system_score_gemma":0.0003635029,"threshold_uncertainty_score":0.03349316},"labels":[],"label_agreement":null},{"id":"W1486218346","doi":"10.1007/978-3-642-15323-5_7","title":"A New Method to Find Developmental Descriptions for Digital Circuits","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Electronic circuit; Field-programmable gate array; Modular design; Digital electronics; Function (biology); Scalability; Theoretical computer science; Computer engineering; Parallel computing; Computer architecture; Algorithm; Arithmetic; Computer hardware; Mathematics; Programming language; Electrical engineering","score_opus":0.02700422935292478,"score_gpt":0.27897254594089527,"score_spread":0.2519683165879705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486218346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014998442,0.0001108053,0.9915461,0.00006000166,0.000064439584,0.000072575145,0.00023001141,0.00093213096,0.0054841256],"genre_scores_gemma":[0.020880714,0.00022603122,0.96546656,0.00005460397,0.000035946956,0.00023411048,0.0007150672,0.0005923182,0.011794588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995272,0.00006156427,0.0000438682,0.00014073883,0.00019417236,0.00003244574],"domain_scores_gemma":[0.99914765,0.00036108107,0.000034895907,0.00018394965,0.0002349922,0.00003746346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062564237,0.0010724039,0.00071049563,0.0033851408,0.0012392417,0.0019557052,0.0020879365,0.0011113018,0.01913233],"category_scores_gemma":[0.0028824375,0.0007552864,0.0017612686,0.0019852587,0.0010828056,0.003427538,0.0018645455,0.0018134596,0.0049096276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007146014,0.000058616817,0.0005550795,0.00045496033,0.00005498061,0.0002605439,0.00045355456,0.0086309025,0.013339219,0.44985855,0.014681119,0.5115811],"study_design_scores_gemma":[0.00006796044,0.00009132108,0.0005203753,0.00020898631,0.00015140088,0.0013588251,0.00037052648,0.25219283,0.024684774,0.4965601,0.2236945,0.000098380224],"about_ca_topic_score_codex":0.0015428998,"about_ca_topic_score_gemma":0.0026157135,"teacher_disagreement_score":0.01913233,"about_ca_system_score_codex":0.00071480963,"about_ca_system_score_gemma":0.00086480303,"threshold_uncertainty_score":0.064003944},"labels":[],"label_agreement":null},{"id":"W1488179309","doi":"10.1109/ahs.2015.7231168","title":"Designing customized microprocessors for fixed-point computation","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Flexibility (engineering); Personalization; Latency (audio); Computation; Word (group theory); Fixed point; Architecture; Word length; Parallel computing; Computer architecture; FLOPS; Computer engineering; Fixed-point arithmetic; Point (geometry); Floating point; Computer hardware; Embedded system; Algorithm","score_opus":0.037433230851078525,"score_gpt":0.28653694125977924,"score_spread":0.24910371040870072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488179309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06077532,0.0003674926,0.93318987,0.000065087894,0.000039335293,0.00009529302,0.000044796285,0.0011624078,0.004260384],"genre_scores_gemma":[0.4051219,0.00032460314,0.59137416,0.00008860744,0.000022731632,0.00013914074,0.000142704,0.0002884141,0.0024978106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997812,0.000030177831,0.0000152523935,0.000052485815,0.000085671054,0.000035242116],"domain_scores_gemma":[0.9997619,0.000048231384,0.0000510454,0.000069843554,0.000060451417,0.000008645398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001963638,0.0005518576,0.00033009954,0.00041505552,0.00025750778,0.00039408036,0.0009721844,0.00028248376,0.0015291666],"category_scores_gemma":[0.000640223,0.00028286886,0.00040200225,0.00044127062,0.00020400231,0.0004976409,0.0003398037,0.0004524435,0.00044907306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013936493,0.00008884412,0.0022018836,0.00036467554,0.00011577727,0.00022848316,0.0001307988,0.30609065,0.33085793,0.019025777,0.002036691,0.3387192],"study_design_scores_gemma":[0.00003895772,0.0003803464,0.002317259,0.000048065416,0.00010270132,0.0004357729,0.000049208396,0.7540552,0.2102395,0.0067262375,0.025561683,0.000045024364],"about_ca_topic_score_codex":0.0004912817,"about_ca_topic_score_gemma":0.0012478164,"teacher_disagreement_score":0.0015291666,"about_ca_system_score_codex":0.00039012474,"about_ca_system_score_gemma":0.00045640746,"threshold_uncertainty_score":0.0051155686},"labels":[],"label_agreement":null},{"id":"W1493310923","doi":"10.1007/978-1-4419-7747-2_6","title":"A Survey of Self Modifying Cartesian Genetic Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Iterated function; Genetic programming; Cartesian coordinate system; Graph; Scalability; Sequence (biology); Variety (cybernetics); Theoretical computer science; Mathematics; Artificial intelligence; Biology; Genetics","score_opus":0.01964022500149743,"score_gpt":0.2356565986755685,"score_spread":0.2160163736740711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493310923","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075422283,0.3190161,0.4781522,0.0016330141,0.0012638568,0.00011340661,0.00018154846,0.0006565754,0.19144109],"genre_scores_gemma":[0.08966334,0.3916538,0.4451753,0.001047137,0.0014882095,0.00020542412,0.00057718036,0.00048670208,0.06970291],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972206,0.000055753866,0.000018247276,0.000053239382,0.00013343405,0.000017189104],"domain_scores_gemma":[0.99980026,0.00010126838,0.000010245951,0.000029148221,0.000047742047,0.000011242763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004478607,0.0005489481,0.0006897834,0.0010820492,0.00043247768,0.0015827647,0.0010079949,0.0007626296,0.005225085],"category_scores_gemma":[0.0007327851,0.00044230046,0.00044014596,0.0040198066,0.00090435834,0.0018211954,0.000763814,0.0012149278,0.0018652483],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022547318,0.000067494104,0.00024201407,0.0011617605,0.000021074897,0.000057618006,0.00016447972,0.015382401,0.0017588059,0.34152308,0.015133774,0.62446505],"study_design_scores_gemma":[0.000016611637,0.00012500896,0.0006219617,0.0007712203,0.00003061064,0.0006709603,0.00007725575,0.04938436,0.0018593287,0.33741316,0.60898954,0.000040049756],"about_ca_topic_score_codex":0.0010985982,"about_ca_topic_score_gemma":0.0011537706,"teacher_disagreement_score":0.005225085,"about_ca_system_score_codex":0.00075099355,"about_ca_system_score_gemma":0.0007088404,"threshold_uncertainty_score":0.017479658},"labels":[],"label_agreement":null},{"id":"W1493901599","doi":"10.1109/latw.2015.7102506","title":"Optimizing an LDO voltage regulator by evolutionary algorithms considering tolerances of the circuit elements","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Semtech (Canada)","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Evolutionary algorithm; Sorting; Regulator; Voltage regulator; Genetic algorithm; Computer science; Low-dropout regulator; Capacitor; Spice; Chromosome; Voltage; Algorithm; Control theory (sociology); Dropout voltage; Engineering; Electronic engineering; Artificial intelligence; Machine learning; Biology","score_opus":0.03439185068317264,"score_gpt":0.2572711011934019,"score_spread":0.22287925051022928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493901599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11519809,0.00024995842,0.87893176,0.00009842956,0.000025950412,0.00004440187,0.000028547633,0.000305198,0.0051176893],"genre_scores_gemma":[0.7654743,0.00016313816,0.23091121,0.000051865798,0.000014891734,0.00012828599,0.000060200902,0.00008158585,0.0031144733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997844,0.000044672455,0.0000097464,0.00004961256,0.00007735878,0.00003421258],"domain_scores_gemma":[0.9997242,0.00012596665,0.000051202318,0.000019829215,0.000068906294,0.00000980116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041509612,0.0005014959,0.00047112926,0.0004846894,0.000260977,0.00077694346,0.00049976486,0.0006081414,0.001017374],"category_scores_gemma":[0.0012550253,0.0002488944,0.00039700678,0.00038952587,0.00029732706,0.00041362038,0.00032944465,0.00040005887,0.00017480299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034114935,0.000029135004,0.00085347146,0.00004415327,0.00002190879,0.00005326475,0.0000500799,0.9395591,0.019446751,0.0033155798,0.00018297619,0.036409494],"study_design_scores_gemma":[0.000007859386,0.00005212391,0.00031164754,0.0000079980055,0.000015583952,0.000026607566,0.000017484268,0.99391633,0.00364808,0.0012249605,0.00076602324,0.000005329055],"about_ca_topic_score_codex":0.0014916862,"about_ca_topic_score_gemma":0.0013635961,"teacher_disagreement_score":0.0014916862,"about_ca_system_score_codex":0.00051417405,"about_ca_system_score_gemma":0.00055831706,"threshold_uncertainty_score":0.0037306547},"labels":[],"label_agreement":null},{"id":"W1495327238","doi":"10.1109/cec.2015.7257197","title":"Better trade exits for foreign exchange currency trading using FXGP","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Currency; Benchmarking; Foreign exchange market; Profit (economics); Computer science; Fibonacci number; Trading strategy; Volatility (finance); Business; Algorithmic trading; Econometrics; Operations research; Economics; Financial economics; Microeconomics; Monetary economics; Marketing; Mathematics","score_opus":0.12350090877034176,"score_gpt":0.31324263294664495,"score_spread":0.1897417241763032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495327238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8988152,0.0005397753,0.09157426,0.00040394504,0.000075966804,0.00010592619,0.00042378154,0.0011609594,0.0069001354],"genre_scores_gemma":[0.9363311,0.00012505437,0.06114178,0.00006118885,0.000015284904,0.000050704894,0.0008850744,0.00008426195,0.0013055066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968696,0.00009263224,0.000023485538,0.000079053985,0.00006505849,0.00005285113],"domain_scores_gemma":[0.999238,0.00044631225,0.000099694946,0.000064406464,0.00010817121,0.000043400087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014323088,0.00083079643,0.00090728817,0.0019448152,0.00043822706,0.0018976433,0.0008182505,0.0009356973,0.0025277764],"category_scores_gemma":[0.003449761,0.00032697368,0.00068059,0.00088006986,0.000377197,0.0010097619,0.0004991685,0.0007708241,0.00030353776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033569543,0.000273201,0.03174347,0.00010504528,0.00011998894,0.00027596127,0.00017170992,0.8408089,0.003688423,0.0031003836,0.0021134173,0.11726371],"study_design_scores_gemma":[0.000030035857,0.00008103102,0.005194241,0.000014736341,0.000026575219,0.000050263574,0.00008828273,0.99149406,0.0009532417,0.0014135262,0.00064303755,0.0000109201865],"about_ca_topic_score_codex":0.010578665,"about_ca_topic_score_gemma":0.009377367,"teacher_disagreement_score":0.010578665,"about_ca_system_score_codex":0.0007205616,"about_ca_system_score_gemma":0.0009534514,"threshold_uncertainty_score":0.021034181},"labels":[],"label_agreement":null},{"id":"W1495652757","doi":"10.1109/icosp.2004.1452567","title":"Genetic algorithms for the design of digital filters using canonic signed digit coefficients","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Coding (social sciences); Numerical digit; Computer science; Algorithm; Genetic algorithm; Throughput; Digital filter; Algorithm design; Design methods; Arithmetic; Computer hardware; Mathematics; Filter (signal processing); Engineering; Telecommunications; Computer vision","score_opus":0.04326202874631511,"score_gpt":0.2726552891241682,"score_spread":0.2293932603778531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495652757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042413403,0.00049779366,0.9930362,0.0000796695,0.00004252879,0.00003945589,0.00001059321,0.00013303252,0.0019193834],"genre_scores_gemma":[0.08866544,0.0011931339,0.90678304,0.00010228775,0.000036482885,0.00026397558,0.00005821947,0.00004502363,0.0028524457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997274,0.00007892889,0.000016244338,0.00003357185,0.00012761026,0.000016200926],"domain_scores_gemma":[0.9996376,0.00023189904,0.000034420198,0.000019894567,0.000067002424,0.000009141813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000613836,0.0007321349,0.00039514966,0.0008769492,0.00039262747,0.0005941993,0.00064965955,0.0007278985,0.001328052],"category_scores_gemma":[0.0020328097,0.00029624676,0.00044596326,0.0007654166,0.0006094101,0.00042413213,0.00032018806,0.0008228155,0.00031918532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007303022,0.000062079685,0.00055357383,0.0002785962,0.00012741813,0.00013643816,0.00019063188,0.5609054,0.0155862775,0.07926304,0.002008161,0.34081528],"study_design_scores_gemma":[0.00007112992,0.0001243751,0.00026383976,0.00007402425,0.00006382433,0.00016491425,0.000035572237,0.95151514,0.007776975,0.024969818,0.0149087105,0.000031565818],"about_ca_topic_score_codex":0.0019671256,"about_ca_topic_score_gemma":0.0031645063,"teacher_disagreement_score":0.0019671256,"about_ca_system_score_codex":0.0005645851,"about_ca_system_score_gemma":0.0006716179,"threshold_uncertainty_score":0.0044427514},"labels":[],"label_agreement":null},{"id":"W1496791178","doi":"10.1007/978-3-540-25966-4_24","title":"Sharing Training Patterns among Multiple Classifiers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Classifier (UML); Machine learning; Artificial intelligence; Training set; Information sharing; Data mining; Perspective (graphical); World Wide Web","score_opus":0.031691702199515226,"score_gpt":0.24650804907558369,"score_spread":0.21481634687606846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496791178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056983955,0.00050737907,0.9326894,0.0005985232,0.00019477938,0.00020530018,0.00008743707,0.0012990953,0.007434147],"genre_scores_gemma":[0.5897118,0.00067164516,0.39122388,0.00047433292,0.00027884648,0.0003486392,0.00060770597,0.0004576037,0.016225612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976496,0.00060318375,0.00019387157,0.00062810286,0.0007081012,0.00021711717],"domain_scores_gemma":[0.9889107,0.0031673182,0.00039417463,0.005973884,0.0012576322,0.00029624326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036170718,0.000832227,0.0018450534,0.0009759733,0.00078915915,0.002349706,0.0031180468,0.0017704017,0.0052850125],"category_scores_gemma":[0.014160046,0.0008623535,0.0011518816,0.001993715,0.0008022968,0.005779778,0.0035883936,0.0019088427,0.0024379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042160955,0.00036068435,0.0037444644,0.00016948037,0.0003196306,0.00020134392,0.00026948674,0.049740322,0.03743394,0.010584368,0.004115532,0.8926391],"study_design_scores_gemma":[0.000056920595,0.00037703084,0.004158173,0.00008089979,0.00043593053,0.00074706454,0.00029685654,0.82573014,0.043741647,0.11004702,0.014270002,0.00005828087],"about_ca_topic_score_codex":0.0007973284,"about_ca_topic_score_gemma":0.0010212351,"teacher_disagreement_score":0.0052850125,"about_ca_system_score_codex":0.00044392716,"about_ca_system_score_gemma":0.0008650804,"threshold_uncertainty_score":0.019129157},"labels":[],"label_agreement":null},{"id":"W1501199179","doi":"10.1007/978-3-540-31989-4_21","title":"Context-Based Repeated Sequences in Linear Genetic Programming","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Crossover; Computer science; Sequence (biology); Context (archaeology); Representation (politics); Code (set theory); Genetic programming; Phenomenon; Theoretical computer science; Programming language; Artificial intelligence; Genetics; Biology","score_opus":0.017625324479103234,"score_gpt":0.2550294407413274,"score_spread":0.23740411626222416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501199179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02449922,0.00088794157,0.9675364,0.00015849949,0.000074340234,0.000034801982,0.000020987389,0.00013935564,0.006648448],"genre_scores_gemma":[0.44347194,0.00096467434,0.5460132,0.00019339114,0.00014096904,0.0002538698,0.000087261295,0.00016283848,0.00871184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00027396766,0.000017271006,0.000073776646,0.00011014714,0.000031214993],"domain_scores_gemma":[0.99902153,0.0007641383,0.000055282646,0.00005398946,0.0000759485,0.000029120045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077414734,0.00043741654,0.0005956156,0.0005036677,0.0003556686,0.00069737685,0.0013539747,0.0013350747,0.0024520666],"category_scores_gemma":[0.003768617,0.00044068627,0.0004932699,0.0011085849,0.0010060726,0.0010404825,0.00089849054,0.0013532032,0.00039463752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054155036,0.000051948395,0.00031582557,0.00010125583,0.000031923908,0.00010685551,0.00014818223,0.6567063,0.0027534887,0.26369172,0.0009439156,0.07509443],"study_design_scores_gemma":[0.000013830455,0.000036811878,0.00008203738,0.000026450956,0.000009982435,0.00003610721,0.00001685226,0.8620771,0.00053353806,0.13586615,0.0012887266,0.000012372251],"about_ca_topic_score_codex":0.001981352,"about_ca_topic_score_gemma":0.0028623967,"teacher_disagreement_score":0.0024520666,"about_ca_system_score_codex":0.0007025395,"about_ca_system_score_gemma":0.0004107027,"threshold_uncertainty_score":0.00820303},"labels":[],"label_agreement":null},{"id":"W1501239440","doi":"10.1007/978-3-642-12239-2_6","title":"Symbiogenesis as a Mechanism for Building Complex Adaptive Systems: A Review","year":2010,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Symbiosis; Mechanism (biology); Mendelian inheritance; Complex adaptive system; Computer science; Operator (biology); Biology; Cognitive science; Evolutionary biology; Computational biology; Artificial intelligence; Epistemology; Genetics; Psychology; Philosophy; Gene","score_opus":0.054019153438797346,"score_gpt":0.3356723315665985,"score_spread":0.2816531781278011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501239440","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022530943,0.9987602,0.00038875235,0.00018685861,0.0000732496,0.000004142987,0.000009047597,0.0000060570374,0.00034635028],"genre_scores_gemma":[0.0017106046,0.9975967,0.00031297698,0.00010402716,0.000108110486,0.0000072015287,0.000017684033,0.0000015991977,0.00014108457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997409,0.00003208102,0.000041537784,0.00007820921,0.00008008069,0.000027098893],"domain_scores_gemma":[0.9991534,0.00040640845,0.00014628269,0.000027546319,0.00019785762,0.00006854863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092063856,0.001070822,0.002262188,0.0022920095,0.00037341684,0.001573931,0.00162043,0.0015638161,0.0014487795],"category_scores_gemma":[0.0013324103,0.00047348588,0.00045273817,0.0030775415,0.0011583263,0.002098884,0.00096866785,0.0013383408,0.0013705656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010084136,0.00008496093,0.0006707148,0.024765117,0.00015619048,0.0002585693,0.000119038836,0.0006997969,0.0034317125,0.007942873,0.010200161,0.9515701],"study_design_scores_gemma":[0.000071221264,0.00030239593,0.0029034617,0.005618993,0.0004548644,0.0031211195,0.00027817982,0.00040500294,0.003407929,0.010672075,0.9726795,0.00008529713],"about_ca_topic_score_codex":0.0011307541,"about_ca_topic_score_gemma":0.0013475715,"teacher_disagreement_score":0.0022920095,"about_ca_system_score_codex":0.0007359939,"about_ca_system_score_gemma":0.0013839831,"threshold_uncertainty_score":0.0053400397},"labels":[],"label_agreement":null},{"id":"W1506197414","doi":"10.1109/cec.2005.1554749","title":"Boolean Genetic Programming for Promoter Recognition in Eukaryotes","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Boolean function; Promoter; Coding (social sciences); Computer science; Genetic programming; Set (abstract data type); Boolean expression; Computational biology; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Biology; Genetics; Gene; Programming language; Gene expression","score_opus":0.02311196158695135,"score_gpt":0.2578528916553817,"score_spread":0.2347409300684304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506197414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05077804,0.00032597827,0.9443085,0.0004051823,0.000040329272,0.000046946217,0.00009887926,0.0004599403,0.0035362798],"genre_scores_gemma":[0.3881237,0.0004408371,0.6082918,0.0001723479,0.000021767326,0.00016047274,0.00021094104,0.00006735962,0.0025108254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996996,0.00011530581,0.000021247775,0.000066388,0.000068967056,0.0000285626],"domain_scores_gemma":[0.999537,0.0003317692,0.000046648776,0.000019005383,0.00005047732,0.00001518263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006683284,0.00038361564,0.0003312458,0.00042047,0.00032206968,0.00084505015,0.0005865968,0.00055002124,0.0015213094],"category_scores_gemma":[0.0019163414,0.00019093748,0.00056708645,0.00053432066,0.00067404663,0.0005868907,0.0004115516,0.00080364087,0.00022653305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026091762,0.000084817686,0.0012424183,0.00026258422,0.000041905194,0.00027573272,0.00034989085,0.5794837,0.037609503,0.19682619,0.001505438,0.1820569],"study_design_scores_gemma":[0.000031769665,0.0000617721,0.0001669029,0.00003645802,0.000019050813,0.00007405289,0.000042285028,0.91303366,0.007852704,0.07586845,0.0027971922,0.00001568363],"about_ca_topic_score_codex":0.001968818,"about_ca_topic_score_gemma":0.0019307212,"teacher_disagreement_score":0.001968818,"about_ca_system_score_codex":0.0010247403,"about_ca_system_score_gemma":0.0006379238,"threshold_uncertainty_score":0.007435024},"labels":[],"label_agreement":null},{"id":"W1506992350","doi":"","title":"Learning conceptual chess for testing evolutionary programming versus a reasoning-based soft expert system: The KASER","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Expert system; Legal expert system; Knowledge acquisition; Domain (mathematical analysis); Inference; Bottleneck; Machine learning; Genetic programming; Subject-matter expert; Domain knowledge; Knowledge-based systems","score_opus":0.05169874446479046,"score_gpt":0.26896568396851445,"score_spread":0.217266939503724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506992350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.604366,0.0001648229,0.37373284,0.0006656967,0.000072878545,0.00033262194,0.0003783733,0.0022213925,0.018065399],"genre_scores_gemma":[0.87670153,0.000041670028,0.12069102,0.00014524836,0.000008927484,0.00013436929,0.0002529326,0.00006551896,0.0019589006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979311,0.0009325788,0.00015633932,0.00040130757,0.0004693515,0.000109412875],"domain_scores_gemma":[0.9929802,0.0050059473,0.00035475823,0.0009361296,0.00047511098,0.00024782855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030954091,0.0007272665,0.00054783165,0.0007032774,0.00038538733,0.0017479032,0.001367275,0.001391859,0.007193961],"category_scores_gemma":[0.01942456,0.00022804136,0.00051290845,0.0004513827,0.0013822431,0.0033822784,0.0014865728,0.0012723082,0.00072932086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018727945,0.0013247756,0.031052623,0.0010466977,0.00025764175,0.000640122,0.0017856223,0.24835964,0.06333933,0.123365335,0.003032326,0.52392304],"study_design_scores_gemma":[0.00021011803,0.0009766817,0.0082962625,0.00006639858,0.00006237902,0.0002066065,0.0004861367,0.8825643,0.057930723,0.044156794,0.004977527,0.000066055756],"about_ca_topic_score_codex":0.0019842177,"about_ca_topic_score_gemma":0.0016754455,"teacher_disagreement_score":0.007193961,"about_ca_system_score_codex":0.0009363314,"about_ca_system_score_gemma":0.0010549794,"threshold_uncertainty_score":0.02406615},"labels":[],"label_agreement":null},{"id":"W1508212832","doi":"10.1007/978-3-540-24840-8_12","title":"Towards Efficient Training on Large Datasets for Genetic Programming","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Machine learning; Artificial intelligence; Selection (genetic algorithm); Matching (statistics); Hierarchy; Focus (optics); Overhead (engineering); Set (abstract data type); Process (computing); Training set; Data mining","score_opus":0.0262054816399336,"score_gpt":0.27646971505370405,"score_spread":0.25026423341377046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508212832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034571167,0.0005952115,0.95410484,0.00082962733,0.00013491935,0.00023431754,0.00057729386,0.005752465,0.0032001294],"genre_scores_gemma":[0.0984716,0.0002305156,0.89554715,0.00045126647,0.000092677044,0.00045123702,0.00191763,0.0006363871,0.0022016393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841905,0.0007113846,0.00009803241,0.00030345246,0.00034263532,0.00012539433],"domain_scores_gemma":[0.99118865,0.0061976374,0.00024169372,0.0014058659,0.0007760701,0.00019008009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032958838,0.0017804606,0.0019535637,0.0015215143,0.0009331937,0.0020035878,0.004022696,0.0034285139,0.005338129],"category_scores_gemma":[0.017429203,0.0016212628,0.0018125759,0.0024952237,0.0011761234,0.0032602204,0.0031842086,0.0057646064,0.0022162127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027362525,0.0002830581,0.001994651,0.00022756678,0.00017023252,0.00013116331,0.00017118687,0.6465417,0.0034370085,0.010029147,0.016912375,0.31982827],"study_design_scores_gemma":[0.000034357956,0.00001833732,0.00013822799,0.000013075404,0.000009477587,0.000012566952,0.000021601245,0.98803407,0.0005455396,0.010389463,0.0007798494,0.0000034604334],"about_ca_topic_score_codex":0.0060735284,"about_ca_topic_score_gemma":0.010799936,"teacher_disagreement_score":0.0060735284,"about_ca_system_score_codex":0.0013254761,"about_ca_system_score_gemma":0.0016887882,"threshold_uncertainty_score":0.01785785},"labels":[],"label_agreement":null},{"id":"W1509316422","doi":"10.1007/springerreference_301754","title":"Evolutionary Learning and Stochastic Process Algebra","year":2012,"lang":"en","type":"reference-entry","venue":"SpringerReference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genetic programming; Stochastic process; Process (computing); Computer science; Stochastic optimization; Stochastic programming; Process calculus; Theoretical computer science; Algebra over a field; Mathematical optimization; Artificial intelligence; Mathematics; Programming language; Pure mathematics; Statistics","score_opus":0.02201518513033344,"score_gpt":0.27079794469293544,"score_spread":0.248782759562602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509316422","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065966537,0.011892846,0.84170896,0.0044309427,0.001884773,0.00004653942,0.0008541875,0.00061293953,0.1319721],"genre_scores_gemma":[0.32301265,0.028490217,0.30916792,0.001053081,0.0042474633,0.0002609824,0.0035641245,0.0010740396,0.32912946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963367,0.0001193428,0.00002165565,0.000065796004,0.00013973801,0.000019688661],"domain_scores_gemma":[0.99944836,0.0002684567,0.000041249732,0.000089992245,0.00013097566,0.000021077807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071872806,0.0007063726,0.0010285856,0.0011006922,0.0005141297,0.001812978,0.00089993543,0.0010005754,0.031081775],"category_scores_gemma":[0.0025070284,0.0002809059,0.000585979,0.0031910585,0.00082586525,0.0024276357,0.00072639994,0.0017964442,0.005874596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060914936,0.000017058976,0.00010333889,0.00012154659,0.000015160187,0.000036035275,0.00004066288,0.011209251,0.00021830325,0.90880156,0.021023603,0.05840745],"study_design_scores_gemma":[0.0000050647677,0.000006233937,0.00015155692,0.000032655673,0.000009797253,0.00006254604,0.000011973982,0.04312783,0.00023526442,0.9080587,0.048286285,0.000012025295],"about_ca_topic_score_codex":0.0017274981,"about_ca_topic_score_gemma":0.0017239315,"teacher_disagreement_score":0.031081775,"about_ca_system_score_codex":0.0007091498,"about_ca_system_score_gemma":0.00068857294,"threshold_uncertainty_score":0.10397887},"labels":[],"label_agreement":null},{"id":"W1513009135","doi":"10.1007/978-3-540-71605-1_13","title":"GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bidding; Genetic programming; Common value auction; Computer science; Decomposition; Genetic algorithm; Population; Classifier (UML); Mathematical optimization; Artificial intelligence; Combinatorial auction; Machine learning; Microeconomics; Economics; Mathematics","score_opus":0.025938851104528166,"score_gpt":0.2750009925150746,"score_spread":0.24906214141054642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513009135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015131214,0.00029476057,0.97812396,0.0003301056,0.00009910117,0.00008326235,0.00006905641,0.00028852094,0.005580183],"genre_scores_gemma":[0.3600119,0.0005401564,0.6216638,0.00022748622,0.00029306882,0.0004507528,0.00065643655,0.00033208748,0.015824333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.00036460886,0.00005412227,0.00015171066,0.0002736044,0.00014756418],"domain_scores_gemma":[0.99783844,0.0013597797,0.00007335122,0.00018142554,0.00046686435,0.00008005859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018557081,0.0007579947,0.0019135644,0.00097258424,0.0005583988,0.0023144335,0.0012680413,0.0020457425,0.007677644],"category_scores_gemma":[0.0071850847,0.0005900065,0.0016269874,0.000955482,0.0005015461,0.0022414685,0.00111877,0.002160476,0.0010404086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013551505,0.00018042333,0.00053540687,0.00015144881,0.00007353049,0.00010631079,0.00008996866,0.66912884,0.0016624747,0.047807388,0.00837748,0.27175125],"study_design_scores_gemma":[0.000010731528,0.000013437317,0.00005916362,0.0000053135914,0.000008436506,0.000020557965,0.000009697559,0.9849332,0.00017977078,0.014237475,0.00051942776,0.0000028087284],"about_ca_topic_score_codex":0.0039826445,"about_ca_topic_score_gemma":0.0035575072,"teacher_disagreement_score":0.007677644,"about_ca_system_score_codex":0.0009988396,"about_ca_system_score_gemma":0.0014545913,"threshold_uncertainty_score":0.025684297},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Simple (philosophy); Artificial neural network; Heterochrony; Genetic algorithm; Artificial intelligence; Artificial life; Genetic network; Mutation; Machine learning; Biology; Genetics; Gene","score_opus":0.013833763981386795,"score_gpt":0.2293129863989791,"score_spread":0.2154792224175923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515636825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073427595,0.002673218,0.8312887,0.0055108494,0.00051316014,0.00006613467,0.0004015919,0.0003071027,0.08581175],"genre_scores_gemma":[0.82662654,0.00599962,0.12067841,0.0008320247,0.0005801955,0.00028225026,0.00041780176,0.0002492689,0.044333894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965966,0.0001396312,0.000012957809,0.000075172604,0.00007904428,0.000033518456],"domain_scores_gemma":[0.9981201,0.0013365495,0.00016305495,0.00010864184,0.00013978254,0.00013180739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010543966,0.0005686794,0.00091864343,0.0008685854,0.0007704804,0.0017569278,0.0017981508,0.0018764937,0.010379123],"category_scores_gemma":[0.005639913,0.0004828226,0.0007178426,0.0010767818,0.0022978298,0.0030170153,0.0012492137,0.0016062098,0.00075387204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030827458,0.000013023449,0.00028453575,0.00005289483,0.000021604894,0.00008091416,0.00008847731,0.23330529,0.0011959272,0.7556141,0.0019927179,0.007319626],"study_design_scores_gemma":[0.0000133376125,0.000012335992,0.00010738051,0.000019213892,0.000008524724,0.00004073039,0.000022771737,0.49958354,0.00014942497,0.49740857,0.0026213573,0.000012794318],"about_ca_topic_score_codex":0.0034605924,"about_ca_topic_score_gemma":0.00250013,"teacher_disagreement_score":0.010379123,"about_ca_system_score_codex":0.0012006938,"about_ca_system_score_gemma":0.00074934965,"threshold_uncertainty_score":0.034721673},"labels":[],"label_agreement":null},{"id":"W1521598381","doi":"10.1109/cec.2000.870298","title":"Reconstructing the shifting balance theory in a GA: taking Sewall Wright seriously","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wright; Balance (ability); Computer science; Mathematical economics; Mathematics; Psychology; Programming language","score_opus":0.018730675815470978,"score_gpt":0.22468097648385713,"score_spread":0.20595030066838615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521598381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03686127,0.0010904045,0.9225405,0.00413379,0.00043108303,0.00008193108,0.00003130182,0.000111698624,0.034718044],"genre_scores_gemma":[0.5094002,0.0020257542,0.47432494,0.0014319741,0.0002503463,0.00025026416,0.000059910308,0.00016282436,0.012093708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875987,0.00062519585,0.000064362626,0.00018007515,0.00028594906,0.00008442141],"domain_scores_gemma":[0.9982268,0.0010366822,0.00017148384,0.00028679002,0.00020262871,0.000075570875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032806795,0.00078281935,0.00085202017,0.0010218974,0.0009386779,0.0020301733,0.0014241156,0.0021861473,0.0032594814],"category_scores_gemma":[0.011315013,0.00041344258,0.001009837,0.00094555103,0.0046012853,0.004087501,0.0020242715,0.002990937,0.0006653972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029136967,0.000030543317,0.0013661719,0.00006579469,0.000041359213,0.00023190869,0.00060544355,0.065504625,0.001312292,0.8832864,0.0011933615,0.04633307],"study_design_scores_gemma":[0.000026060845,0.00009400816,0.00029535836,0.0000466139,0.000026506206,0.00013770354,0.00014630728,0.10464074,0.00085007213,0.880189,0.01352186,0.000025806674],"about_ca_topic_score_codex":0.002343712,"about_ca_topic_score_gemma":0.0021515328,"teacher_disagreement_score":0.0032806795,"about_ca_system_score_codex":0.0012281314,"about_ca_system_score_gemma":0.0013378278,"threshold_uncertainty_score":0.017350137},"labels":[],"label_agreement":null},{"id":"W1527227975","doi":"10.1007/978-3-642-12148-7_5","title":"Novelty-Based Fitness: An Evaluation under the Santa Fe Trail","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Novelty; Computer science; Artificial intelligence; Psychology","score_opus":0.03461303463023035,"score_gpt":0.28894693843921615,"score_spread":0.2543339038089858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527227975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6548684,0.003573682,0.2948868,0.0018292025,0.00041320702,0.00026615028,0.0002196734,0.00079754944,0.0431453],"genre_scores_gemma":[0.9421405,0.00036205002,0.0513983,0.00010081197,0.00006183629,0.00005392619,0.00011990937,0.00008416684,0.005678404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986407,0.00053169247,0.00005472276,0.00011417412,0.000547657,0.000110979156],"domain_scores_gemma":[0.9942707,0.0037068096,0.00021591512,0.00060872483,0.0009993874,0.00019839541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038324178,0.0006209254,0.001147642,0.0012919719,0.0010732987,0.0015437985,0.0014753458,0.001924787,0.003137225],"category_scores_gemma":[0.013492779,0.0002539607,0.00061607786,0.0011819719,0.00095231476,0.0015262243,0.0010904792,0.0008007781,0.0002744047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023663274,0.000600166,0.008453634,0.00025694928,0.0002958221,0.0001944548,0.00019374733,0.5202797,0.0038881688,0.048249368,0.004906718,0.41031492],"study_design_scores_gemma":[0.00017566138,0.0006799579,0.0024974996,0.00003956871,0.0001254329,0.00013843605,0.000041327658,0.98638576,0.0010370474,0.0075611607,0.0013011706,0.000016990787],"about_ca_topic_score_codex":0.0035393608,"about_ca_topic_score_gemma":0.0049900454,"teacher_disagreement_score":0.0038324178,"about_ca_system_score_codex":0.0013811925,"about_ca_system_score_gemma":0.0009764917,"threshold_uncertainty_score":0.020267963},"labels":[],"label_agreement":null},{"id":"W1528288700","doi":"10.1007/978-3-540-24855-2_133","title":"Multiple Species Weighted Voting – A Genetics-Based Machine Learning System","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Voting; Classifier (UML); Machine learning; Majority rule; Pruning; Weighted voting; Population; Class (philosophy); Pattern recognition (psychology); Biology","score_opus":0.013872420682726427,"score_gpt":0.21942773845483557,"score_spread":0.20555531777210914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528288700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04991642,0.00017221541,0.9452751,0.0003784195,0.0001256945,0.00009159481,0.00005209164,0.0005617236,0.0034267963],"genre_scores_gemma":[0.56694824,0.00011236102,0.42566255,0.0003169628,0.0000762912,0.0001692362,0.00015924522,0.00013706916,0.0064181243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992262,0.00027389798,0.000042289557,0.0002096417,0.00018808637,0.000059861894],"domain_scores_gemma":[0.9986364,0.00056062586,0.000112201116,0.00022199706,0.00038215122,0.00008661503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894173,0.00046757152,0.0012350236,0.00076276436,0.0008549014,0.00097141176,0.003274472,0.0016030723,0.0025677644],"category_scores_gemma":[0.0031129464,0.00034725145,0.0007249045,0.000843066,0.0010692374,0.0014162867,0.0014498533,0.00093820447,0.0006497688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002891542,0.00023249479,0.0029339339,0.00012638696,0.0002433184,0.00018915965,0.00016628056,0.57390064,0.023995716,0.047615092,0.003844282,0.3464635],"study_design_scores_gemma":[0.000017146403,0.00003636144,0.0002083303,0.000004959875,0.00002030537,0.000046718185,0.000009077547,0.981967,0.0022051143,0.014657239,0.00081834116,0.000009354523],"about_ca_topic_score_codex":0.0016358154,"about_ca_topic_score_gemma":0.0025133025,"teacher_disagreement_score":0.003274472,"about_ca_system_score_codex":0.0007835071,"about_ca_system_score_gemma":0.0007619486,"threshold_uncertainty_score":0.010017455},"labels":[],"label_agreement":null},{"id":"W1528603915","doi":"10.1007/11844297_76","title":"Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP): A New Developmental Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Probabilistic logic; Genetic programming; Artificial intelligence","score_opus":0.024729963209635122,"score_gpt":0.21980290430136165,"score_spread":0.19507294109172651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528603915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036924006,0.00027745133,0.9878071,0.00019405576,0.00004462346,0.0000182223,0.00001818827,0.000116237345,0.007831754],"genre_scores_gemma":[0.12359915,0.0008320637,0.86744267,0.00017850577,0.000048129248,0.00016474375,0.0000633723,0.000120149576,0.007551166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997203,0.000084153406,0.000012552082,0.00006702732,0.0000986509,0.000017344966],"domain_scores_gemma":[0.99956554,0.00024995676,0.000030834486,0.000046510442,0.000081807935,0.000025224716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054290297,0.00038811626,0.0003328149,0.0003985226,0.0003037937,0.0007451288,0.0013473443,0.00082028256,0.0026834845],"category_scores_gemma":[0.00228441,0.00027399583,0.00037163033,0.0006168029,0.00090674625,0.00080688053,0.0012470833,0.0014087108,0.00035664614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018538094,0.000035766385,0.0006125985,0.00014802067,0.000027972126,0.00008703296,0.00020655422,0.13006584,0.0078741945,0.6159932,0.0024924881,0.24243785],"study_design_scores_gemma":[0.000013990325,0.000091174974,0.0003679029,0.00006713985,0.0000343621,0.00030204764,0.00005813757,0.66120964,0.0046508773,0.3033304,0.029845664,0.00002873041],"about_ca_topic_score_codex":0.00077587366,"about_ca_topic_score_gemma":0.0009787052,"teacher_disagreement_score":0.0026834845,"about_ca_system_score_codex":0.00047392165,"about_ca_system_score_gemma":0.0008232567,"threshold_uncertainty_score":0.008977175},"labels":[],"label_agreement":null},{"id":"W1529894968","doi":"10.1109/cec.2015.7257022","title":"Flow of control in linear genetic programming","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Alternator; Computer science; Control flow; Flow (mathematics); Genetic programming; Flow control (data); Domain (mathematical analysis); Task (project management); Linear programming; String (physics); Control engineering; Artificial intelligence; Algorithm; Programming language; Mathematics; Engineering","score_opus":0.018494501965047337,"score_gpt":0.2539878208490026,"score_spread":0.23549331888395528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529894968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034548983,0.00026617086,0.9582381,0.00023193086,0.000025878779,0.00006776843,0.00002549764,0.0002936218,0.006302133],"genre_scores_gemma":[0.71440506,0.00047143802,0.2799521,0.00017957739,0.000036382844,0.00024060688,0.00008161592,0.000081395025,0.004551841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.00036074928,0.000027334923,0.00010762556,0.00017426738,0.00006237324],"domain_scores_gemma":[0.99854445,0.0011366259,0.00011115349,0.00006235716,0.00011123696,0.000034247892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017902512,0.00040812773,0.00030599238,0.00061352394,0.00045174925,0.0010054058,0.00067393226,0.0009025898,0.0017746523],"category_scores_gemma":[0.0048097684,0.00031872312,0.00044689904,0.00065954926,0.0015558818,0.0010091191,0.0006158624,0.00077534927,0.0002168852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006593588,0.00005126548,0.000776385,0.000066126755,0.000014828438,0.000065657034,0.00015021293,0.80652404,0.0017411459,0.13905363,0.00041909164,0.051071774],"study_design_scores_gemma":[0.000019336328,0.000033073444,0.0000920287,0.00001108052,0.0000066155467,0.000013588183,0.000009681371,0.92638683,0.0006552406,0.07190422,0.0008602538,0.000007991906],"about_ca_topic_score_codex":0.004613078,"about_ca_topic_score_gemma":0.0024708302,"teacher_disagreement_score":0.004613078,"about_ca_system_score_codex":0.0015662309,"about_ca_system_score_gemma":0.000970116,"threshold_uncertainty_score":0.011363864},"labels":[],"label_agreement":null},{"id":"W1531850458","doi":"10.1109/cec.1999.781916","title":"Rule acquisition with a genetic algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Crossover; Computer science; Generalization; Genetic algorithm; Genetic representation; Association rule learning; Artificial intelligence; Population-based incremental learning; Algorithm; Knowledge acquisition; Data mining; Hierarchy; Variable (mathematics); Quality control and genetic algorithms; Machine learning; Theoretical computer science; Mathematics; Meta-optimization","score_opus":0.006259371295358735,"score_gpt":0.2094776923583368,"score_spread":0.20321832106297807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531850458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007324615,0.00013215186,0.98606354,0.00012577853,0.000031184074,0.00016395573,0.00006503753,0.002013837,0.0040799673],"genre_scores_gemma":[0.06812238,0.00017276111,0.9284041,0.00016457915,0.000026788157,0.00022167146,0.00025397047,0.00013277381,0.0025009038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988165,0.000322599,0.000085158834,0.0003357437,0.00036243742,0.000077639954],"domain_scores_gemma":[0.99833363,0.0009938175,0.00008286205,0.00023196635,0.00031443255,0.000043343938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015204693,0.00071751024,0.0009526967,0.0014861574,0.0005475307,0.0014389347,0.0020042793,0.0011963465,0.0049618543],"category_scores_gemma":[0.004794245,0.00043074202,0.0010188873,0.0011345391,0.0008805207,0.0010313916,0.0010820847,0.0014118501,0.0016826647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015765738,0.00025476093,0.0021794734,0.00018712373,0.00015472942,0.00029330887,0.0002638241,0.2687462,0.00938133,0.03271986,0.004118442,0.68154335],"study_design_scores_gemma":[0.000049287635,0.00009868913,0.00028150482,0.000044829932,0.00006357427,0.00017796719,0.000042898722,0.9658173,0.0055319658,0.01672198,0.011150549,0.000019418629],"about_ca_topic_score_codex":0.0034168633,"about_ca_topic_score_gemma":0.0030948631,"teacher_disagreement_score":0.0049618543,"about_ca_system_score_codex":0.00067733886,"about_ca_system_score_gemma":0.0011636402,"threshold_uncertainty_score":0.01659906},"labels":[],"label_agreement":null},{"id":"W1533373774","doi":"10.1007/978-3-540-24855-2_119","title":"CellNet Co-Ev: Evolving Better Pattern Recognizers Using Competitive Co-evolution","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.01845423380202252,"score_gpt":0.2564964090425729,"score_spread":0.2380421752405504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533373774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122089826,0.0006346017,0.85823435,0.00043548166,0.00050964265,0.00022306142,0.0002398437,0.007940757,0.009692426],"genre_scores_gemma":[0.32796484,0.00023426353,0.65531856,0.0006686084,0.00010545358,0.000281301,0.0007315603,0.0011934099,0.0135018695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995691,0.00007418983,0.000024661631,0.00013395713,0.00014475493,0.000053314507],"domain_scores_gemma":[0.99865365,0.00062742655,0.000063161606,0.00023929484,0.00034403848,0.000072324656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010338288,0.0010958852,0.0012023007,0.0010131476,0.00045541592,0.0011330923,0.0023856994,0.0020100782,0.006789913],"category_scores_gemma":[0.0029540746,0.00053619564,0.0007554758,0.0009540907,0.0006033369,0.0015850094,0.0012416999,0.001416518,0.0017468875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031476334,0.00036303434,0.0025474601,0.00019494789,0.00023944174,0.000333548,0.0001727691,0.2532271,0.041868575,0.009943366,0.012312529,0.6784824],"study_design_scores_gemma":[0.000025417241,0.00006823193,0.000148352,0.000005971491,0.000031755713,0.000097342476,0.000019882453,0.9871262,0.0083177155,0.002231956,0.0019172844,0.000009901085],"about_ca_topic_score_codex":0.00371795,"about_ca_topic_score_gemma":0.005194846,"teacher_disagreement_score":0.006789913,"about_ca_system_score_codex":0.00059310836,"about_ca_system_score_gemma":0.0006616293,"threshold_uncertainty_score":0.022714555},"labels":[],"label_agreement":null},{"id":"W1533873536","doi":"10.5772/36817","title":"New Approaches to Designing Genes by Evolution in the Computer","year":2012,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computational biology; Computer science; Biology; Evolutionary biology; Theoretical computer science","score_opus":0.07683591453166555,"score_gpt":0.2369365098042942,"score_spread":0.16010059527262865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533873536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010350579,0.005261774,0.93547434,0.0029195258,0.0003079392,0.00016453522,0.00005532008,0.00046153317,0.045004398],"genre_scores_gemma":[0.10638581,0.006302138,0.869128,0.0010772827,0.00012586659,0.0005123194,0.000092484304,0.0002236743,0.016152408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940765,0.00019757608,0.000036648627,0.00012934601,0.00019181329,0.000036984602],"domain_scores_gemma":[0.9994879,0.00026527938,0.000028690525,0.00012333365,0.00007334492,0.000021373635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013043078,0.00066326454,0.00062798,0.00067472237,0.00072220265,0.0021223733,0.0017210526,0.0013527309,0.0048755123],"category_scores_gemma":[0.0025195444,0.00053301593,0.0007577376,0.00089291076,0.0036560877,0.0032021897,0.001216833,0.002914845,0.0010117303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027373222,0.000041369596,0.0002897544,0.00026684927,0.00003599508,0.000061404535,0.00033006287,0.0708769,0.0041643023,0.86019456,0.0019298629,0.061781608],"study_design_scores_gemma":[0.00009720186,0.00013811218,0.00017719586,0.00016646233,0.000062715466,0.00016454307,0.00013426093,0.16743547,0.0073673464,0.63699394,0.18721403,0.00004869574],"about_ca_topic_score_codex":0.0012454529,"about_ca_topic_score_gemma":0.0022364992,"teacher_disagreement_score":0.0048755123,"about_ca_system_score_codex":0.0012714954,"about_ca_system_score_gemma":0.0011844903,"threshold_uncertainty_score":0.016310215},"labels":[],"label_agreement":null},{"id":"W1534539971","doi":"10.1007/978-3-642-01181-8_1","title":"One-Class Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Novelty detection; Class (philosophy); Computer science; Genetic programming; Artificial intelligence; One-class classification; Fitness function; Novelty; Machine learning; Scalability; Function (biology); Construct (python library); Genetic algorithm; Pattern recognition (psychology); Data mining; Support vector machine; Programming language; Database","score_opus":0.01691058351238581,"score_gpt":0.24296360388241453,"score_spread":0.22605302037002872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534539971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005237713,0.0011550309,0.74983793,0.0007716253,0.00062030344,0.00007328095,0.00010884655,0.0007289498,0.24146621],"genre_scores_gemma":[0.2265766,0.0034637798,0.5096745,0.0008962702,0.0005112427,0.00035894444,0.00048559988,0.00096942077,0.25706366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966323,0.000064644126,0.000011526584,0.00008119471,0.00013921247,0.000040150047],"domain_scores_gemma":[0.99974877,0.00010638859,0.000014593964,0.000062118976,0.000045260316,0.00002294412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036762285,0.00066070684,0.00060188153,0.0005827361,0.0007355094,0.00165912,0.001318943,0.0010903992,0.017745564],"category_scores_gemma":[0.0012822156,0.00025725723,0.0007757989,0.00083801453,0.0012593276,0.001377854,0.0012775729,0.002276579,0.003620318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015389296,0.000035947684,0.000078803976,0.00012458861,0.000015038425,0.000032133874,0.00007327231,0.012113759,0.0013244554,0.7669916,0.008017442,0.21117754],"study_design_scores_gemma":[0.00002203333,0.000043407574,0.00015171335,0.00012003106,0.000021422891,0.00021774502,0.000035440156,0.06271313,0.002676266,0.8296583,0.10431674,0.000023724198],"about_ca_topic_score_codex":0.00046073744,"about_ca_topic_score_gemma":0.00059705303,"teacher_disagreement_score":0.017745564,"about_ca_system_score_codex":0.000974547,"about_ca_system_score_gemma":0.0006681567,"threshold_uncertainty_score":0.059364796},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Computer science; Statistic; Mathematics; Statistics; Artificial intelligence","score_opus":0.01695518108309615,"score_gpt":0.2714305306652515,"score_spread":0.2544753495821554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541677343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38907284,0.0013199776,0.59465176,0.0013203605,0.0001512442,0.00009998166,0.00043663132,0.001551849,0.011395322],"genre_scores_gemma":[0.91661435,0.00023966479,0.08083447,0.00016745218,0.000091698224,0.00008755373,0.0004307567,0.000429666,0.0011044869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511683,0.0026371437,0.00017405316,0.0006365652,0.0011447023,0.00029064532],"domain_scores_gemma":[0.79772645,0.18356955,0.004674427,0.008323759,0.0046250653,0.001080657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0126251215,0.00041298292,0.00080837705,0.0032084633,0.00061958586,0.0016962296,0.0017097017,0.0012718436,0.0029397027],"category_scores_gemma":[0.120527916,0.00029695284,0.0008314034,0.0037224072,0.0022128557,0.0024768584,0.0011116771,0.0021830322,0.00030486868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014962812,0.00040604034,0.08787451,0.00040881833,0.0006068365,0.0003081075,0.00089955865,0.2806075,0.008853121,0.33557427,0.00923137,0.2737336],"study_design_scores_gemma":[0.00008717108,0.00042459834,0.031616222,0.0000752816,0.00014569312,0.00028638315,0.00028995643,0.860624,0.003959606,0.09940823,0.0030084108,0.0000744761],"about_ca_topic_score_codex":0.0015612496,"about_ca_topic_score_gemma":0.0013723628,"teacher_disagreement_score":0.0126251215,"about_ca_system_score_codex":0.0011574213,"about_ca_system_score_gemma":0.0013338646,"threshold_uncertainty_score":0.066768885},"labels":[],"label_agreement":null},{"id":"W1541688028","doi":"10.1007/978-1-4419-1626-6_3","title":"Evolving Coevolutionary Classifiers Under Large Attribute Spaces","year":2009,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Artificial intelligence; Computer science; Machine learning; Evolutionary biology; Biology","score_opus":0.018683929692077546,"score_gpt":0.23739483029965763,"score_spread":0.21871090060758008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541688028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16401014,0.0010136293,0.82713664,0.00055321655,0.00013798637,0.000050214887,0.000040664636,0.0003377152,0.006719819],"genre_scores_gemma":[0.6783739,0.00073099375,0.30619007,0.00025694774,0.00014899328,0.00014218179,0.00014277434,0.00014803105,0.01386621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996259,0.00010175544,0.000026562877,0.00007097581,0.00013257258,0.00004210675],"domain_scores_gemma":[0.99773514,0.001636641,0.000077100085,0.0002228598,0.00027096065,0.00005735228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001733056,0.00036384753,0.0011041984,0.00040923335,0.00039744243,0.0010349955,0.001373008,0.0014178548,0.0018819333],"category_scores_gemma":[0.006055039,0.00051082997,0.00051523256,0.0008392012,0.00077517563,0.0025192304,0.002027584,0.0017449711,0.0004855817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008605262,0.00008211041,0.001335758,0.00007061424,0.0000820517,0.00017801955,0.00025551196,0.71691793,0.006021655,0.040211543,0.0023421203,0.23241672],"study_design_scores_gemma":[0.0000035842374,0.000011984775,0.00010176911,0.0000038378885,0.0000049044197,0.000027361022,0.00000821472,0.9921503,0.00050886325,0.0068355836,0.0003410059,0.0000026640134],"about_ca_topic_score_codex":0.0014187687,"about_ca_topic_score_gemma":0.0014157635,"teacher_disagreement_score":0.0018819333,"about_ca_system_score_codex":0.00071254955,"about_ca_system_score_gemma":0.0003334542,"threshold_uncertainty_score":0.009165347},"labels":[],"label_agreement":null},{"id":"W1547470232","doi":"10.1007/978-3-642-01181-8_8","title":"The Role of Population Size in Rate of Evolution in Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Evolutionary computation; Population; Population size; Rate of evolution; Evolutionary programming; Computer science; Genetic representation; Evolutionary algorithm; Genetic algorithm; Artificial intelligence; Machine learning; Biology; Genetics; Demography","score_opus":0.0068051540346034545,"score_gpt":0.22680964543433252,"score_spread":0.22000449139972905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547470232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14240061,0.018783085,0.74487686,0.0060081827,0.0011970481,0.00008563133,0.000087051856,0.0003756907,0.08618586],"genre_scores_gemma":[0.85835034,0.007819658,0.11548448,0.00061265,0.000931728,0.00016868832,0.000038077764,0.0005586502,0.016035685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985837,0.00087901246,0.00005244375,0.00016634275,0.0002437604,0.00007464145],"domain_scores_gemma":[0.974534,0.023412166,0.0005012111,0.00074163056,0.00058402924,0.00022705962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005112024,0.00064376014,0.0008156527,0.00060028,0.000566682,0.0021877394,0.001878607,0.0019813022,0.0035864285],"category_scores_gemma":[0.03497263,0.00073411554,0.00064946606,0.0007590674,0.0027260818,0.0053814556,0.0012102599,0.0030031393,0.00045547367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014175917,0.00006837071,0.002202892,0.00031381528,0.00007453069,0.00023598976,0.0006733033,0.17275193,0.00576648,0.742228,0.0023080653,0.07323486],"study_design_scores_gemma":[0.00007570275,0.00016708928,0.0014417024,0.00016456563,0.00010674476,0.0004615252,0.00012674645,0.46204534,0.0028050416,0.52483904,0.007675255,0.00009121799],"about_ca_topic_score_codex":0.0006601344,"about_ca_topic_score_gemma":0.00067326304,"teacher_disagreement_score":0.005112024,"about_ca_system_score_codex":0.0011771712,"about_ca_system_score_gemma":0.000591039,"threshold_uncertainty_score":0.027035296},"labels":[],"label_agreement":null},{"id":"W1548616591","doi":"10.1109/icsmc.1999.825348","title":"Approaching evolutionary robotics through population-based incremental learning","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial intelligence; Evolutionary robotics; Computer science; Task (project management); Evolutionary algorithm; Competitive learning; Artificial neural network; Genetic algorithm; Population; Robotics; Evolutionary computation; Machine learning; Robot; Engineering","score_opus":0.021770418615981398,"score_gpt":0.25169934184081605,"score_spread":0.22992892322483466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548616591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029313114,0.0002038662,0.96595496,0.00013269889,0.000023435347,0.000045463505,0.000005764248,0.0003527856,0.0039679115],"genre_scores_gemma":[0.6106044,0.00046425776,0.38630503,0.00014965722,0.000039838145,0.00018325895,0.000033993412,0.000068291236,0.0021512927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997851,0.000069778,0.0000082553715,0.00002769316,0.000082529274,0.000026752912],"domain_scores_gemma":[0.9993099,0.00044843074,0.000051022664,0.00006989131,0.00009279144,0.000028007187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078832713,0.00040639058,0.00041333778,0.00040530128,0.0003355174,0.0005566523,0.0011998804,0.0006512834,0.0012445706],"category_scores_gemma":[0.0028803824,0.00024206407,0.0002690753,0.00032565277,0.00083474064,0.0010063085,0.0011838163,0.0009352227,0.00021035389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004705503,0.00008548116,0.0009953958,0.00009433808,0.00005128823,0.00018146097,0.0002526398,0.7631249,0.008634996,0.046048917,0.0011529842,0.17933054],"study_design_scores_gemma":[0.000013787342,0.00006116443,0.000102282174,0.000005545074,0.000009086011,0.0000646205,0.00002245736,0.98077947,0.0015737849,0.0157238,0.0016371197,0.0000068796267],"about_ca_topic_score_codex":0.0012094998,"about_ca_topic_score_gemma":0.0012318306,"teacher_disagreement_score":0.0012445706,"about_ca_system_score_codex":0.0003591221,"about_ca_system_score_gemma":0.0004612984,"threshold_uncertainty_score":0.004169166},"labels":[],"label_agreement":null},{"id":"W1549140495","doi":"10.1007/978-3-540-87700-4_23","title":"Dynamic Cooperative Coevolutionary Sensor Deployment Via Localized Fitness Evaluation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Software deployment; Coevolution; Evolutionary computation; Computation; Evolutionary algorithm; Distributed computing; Range (aeronautics); Wireless sensor network; Artificial intelligence; Algorithm; Computer network; Ecology; Engineering","score_opus":0.018647123594120355,"score_gpt":0.2710565834751944,"score_spread":0.25240945988107405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549140495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12340442,0.00019127417,0.86947256,0.00015720061,0.000034791217,0.000054984346,0.000013954927,0.00032106164,0.006349665],"genre_scores_gemma":[0.9143593,0.00007395107,0.08158973,0.00005791393,0.000013064386,0.00010850581,0.000025148018,0.000060324426,0.0037120208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996836,0.00011119162,0.000011391592,0.0000638926,0.00008324286,0.000046589415],"domain_scores_gemma":[0.9991673,0.0005048946,0.00006411547,0.00010620114,0.0001165403,0.00004098822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007597064,0.00060226716,0.0007163597,0.00042415317,0.00039027876,0.0006154006,0.0010787176,0.0007937215,0.0014670368],"category_scores_gemma":[0.0028885799,0.00040188388,0.00035765566,0.0004452914,0.0006013457,0.0010273115,0.0016101488,0.000585266,0.0002600493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061710314,0.00007575587,0.0010920789,0.000028849874,0.000041358813,0.00008549998,0.00010361197,0.9074439,0.010967642,0.006447329,0.00054635224,0.0731059],"study_design_scores_gemma":[0.000005029258,0.000030854335,0.00018645223,0.0000026087316,0.000006174564,0.00002394456,0.000011524884,0.9975884,0.0008832888,0.0011032121,0.00015490933,0.0000035797614],"about_ca_topic_score_codex":0.0011769773,"about_ca_topic_score_gemma":0.0015817222,"teacher_disagreement_score":0.0014670368,"about_ca_system_score_codex":0.0005062922,"about_ca_system_score_gemma":0.00034580776,"threshold_uncertainty_score":0.004907787},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030961590261434867,"score_gpt":0.26155499623646294,"score_spread":0.2305934059750281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553241761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007996984,0.002526692,0.72696877,0.00086881587,0.00077753694,0.00010671661,0.0005360351,0.0012790182,0.25893947],"genre_scores_gemma":[0.35655728,0.0053562094,0.27113572,0.00069189246,0.0007444332,0.00065753574,0.0017472606,0.0016951303,0.36141458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984276,0.000034027726,0.000007196827,0.000028117931,0.00007657495,0.00001144879],"domain_scores_gemma":[0.99977773,0.00007442935,0.000016179769,0.00005143489,0.000070636364,0.000009575349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030093064,0.00053391646,0.0006260468,0.0010985689,0.00047547751,0.001141185,0.0007449421,0.0008233391,0.024072986],"category_scores_gemma":[0.0015577384,0.00026300325,0.0006438896,0.00061979523,0.0004821481,0.0009892951,0.0009725439,0.0009445008,0.007033059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040996834,0.000057098314,0.00036684985,0.00023996226,0.000053919757,0.00010093539,0.00013016621,0.13763689,0.008793785,0.65135866,0.03992454,0.16129619],"study_design_scores_gemma":[0.000012033173,0.0000123447235,0.00028536277,0.00007310175,0.000020950194,0.00011673285,0.000028140212,0.69503057,0.0035500953,0.24820831,0.0526423,0.000020094147],"about_ca_topic_score_codex":0.0010159574,"about_ca_topic_score_gemma":0.00087649055,"teacher_disagreement_score":0.024072986,"about_ca_system_score_codex":0.0005639948,"about_ca_system_score_gemma":0.0004389315,"threshold_uncertainty_score":0.08053213},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.052142576250536206,"score_gpt":0.30393285971668194,"score_spread":0.25179028346614574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553628792","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014207887,0.0003249243,0.9628628,0.00023616733,0.00014695252,0.00012124998,0.00055499986,0.026016308,0.00831581],"genre_scores_gemma":[0.036636673,0.0010159869,0.9322417,0.00071878696,0.00009254879,0.0009822146,0.0035229533,0.012505723,0.012283352],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892634,0.00021529899,0.00008654224,0.00018224763,0.0004776874,0.00011190771],"domain_scores_gemma":[0.9988146,0.0005120408,0.00010059044,0.0002390266,0.00023234826,0.00010142222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016977579,0.0010135333,0.0007736517,0.0011691945,0.0006963713,0.0021635548,0.003691692,0.0017245165,0.014250417],"category_scores_gemma":[0.007163477,0.0008627159,0.0011825772,0.0010422703,0.00093736465,0.0027322501,0.0019916745,0.0027339503,0.0065100063],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034766525,0.00016231586,0.0015144437,0.0009718707,0.00023175748,0.0006712639,0.00052824273,0.116233796,0.018793646,0.23586693,0.12998708,0.494691],"study_design_scores_gemma":[0.00022452114,0.00009856984,0.0007311315,0.0002516961,0.00008215563,0.0007171126,0.000051380754,0.32972813,0.012590327,0.1424282,0.51294106,0.00015572939],"about_ca_topic_score_codex":0.0035336374,"about_ca_topic_score_gemma":0.0033190632,"teacher_disagreement_score":0.014250417,"about_ca_system_score_codex":0.00057020644,"about_ca_system_score_gemma":0.001285655,"threshold_uncertainty_score":0.04767245},"labels":[],"label_agreement":null},{"id":"W1553704381","doi":"10.1007/3-540-45110-2_33","title":"The Master-Slave Architecture for Evolutionary Computations Revisited","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Workstation; Exploit; Computation; Architecture; Parallel computing; Distributed computing; Evolutionary computation; Idle; Operating system; Artificial intelligence; Algorithm; Computer security","score_opus":0.01817391371438399,"score_gpt":0.24979223902858258,"score_spread":0.2316183253141986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553704381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026274826,0.0032786957,0.8913959,0.0039086356,0.0006339146,0.000059159825,0.000051124003,0.00038182412,0.07401593],"genre_scores_gemma":[0.73627865,0.0023705845,0.22647093,0.0005503368,0.00035803072,0.00014205828,0.00005205976,0.00015158008,0.03362583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962866,0.00013517312,0.000019593428,0.00007859316,0.000089052715,0.000049011305],"domain_scores_gemma":[0.999366,0.0003105947,0.000023319275,0.0001776396,0.000085713174,0.0000367979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010119143,0.0003419508,0.0009370012,0.00025960215,0.00083405885,0.0018486476,0.0021991723,0.0020543388,0.008518215],"category_scores_gemma":[0.0026886694,0.00048039792,0.00052399817,0.00058501755,0.001986371,0.0032353033,0.00095256924,0.0025841738,0.00114949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056441935,0.00002388808,0.00011892551,0.0000776138,0.000026092648,0.00008610324,0.00013457482,0.043899674,0.002635082,0.9187032,0.0022479447,0.03199055],"study_design_scores_gemma":[0.000054041117,0.000050666375,0.00012669426,0.000025681638,0.000022308443,0.00013516883,0.00004797252,0.33972925,0.0015169387,0.6468968,0.011378012,0.000016491122],"about_ca_topic_score_codex":0.0011423859,"about_ca_topic_score_gemma":0.0017232118,"teacher_disagreement_score":0.008518215,"about_ca_system_score_codex":0.0007160126,"about_ca_system_score_gemma":0.00086882955,"threshold_uncertainty_score":0.028496265},"labels":[],"label_agreement":null},{"id":"W1560677248","doi":"10.1007/978-3-642-15384-6_57","title":"Prognosis of Breast Cancer Using Genetic Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Breast cancer; Genetic programming; Computer science; Cancer; Lung cancer; Machine learning; Artificial intelligence; Medicine; Oncology; Internal medicine","score_opus":0.017524650858758692,"score_gpt":0.26155643782471866,"score_spread":0.24403178696595995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560677248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51112366,0.024736501,0.42575988,0.006514821,0.00062063267,0.00025132112,0.0027563637,0.0013611425,0.026875742],"genre_scores_gemma":[0.925993,0.0049099396,0.06166147,0.00017199639,0.000108368506,0.00007518683,0.0011397866,0.0000672434,0.005872958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983835,0.0000725615,0.000011994413,0.000020506475,0.000044513086,0.000012072438],"domain_scores_gemma":[0.99972814,0.00017754575,0.000032082753,0.00001651636,0.000035431185,0.00001026669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565381,0.0003313579,0.00041136332,0.00062225066,0.000089615394,0.0005377823,0.000420259,0.00040507247,0.00144771],"category_scores_gemma":[0.0024048875,0.00007519276,0.0004897756,0.0005723302,0.00012919263,0.00021594448,0.00017263145,0.0003544862,0.00035207425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073523074,0.00012179583,0.08912218,0.00018543808,0.00034813868,0.00071464665,0.00007963545,0.14569291,0.004315818,0.004246311,0.0074839527,0.74695396],"study_design_scores_gemma":[0.00014436601,0.0010767471,0.09886676,0.00043100677,0.00080760656,0.0055526025,0.00027328404,0.82275736,0.010922576,0.042567637,0.016512863,0.00008719435],"about_ca_topic_score_codex":0.0017511535,"about_ca_topic_score_gemma":0.0018196729,"teacher_disagreement_score":0.0017511535,"about_ca_system_score_codex":0.00036374643,"about_ca_system_score_gemma":0.00032272036,"threshold_uncertainty_score":0.004843056},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034033856403859634,"score_gpt":0.3069457912597012,"score_spread":0.27291193485584153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560681326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008315734,0.00032621404,0.9868476,0.00009721826,0.000045250763,0.000057237794,0.000019702964,0.0005643783,0.003726842],"genre_scores_gemma":[0.19523028,0.0006781552,0.7986014,0.00019592572,0.00006946041,0.00033621697,0.00012277991,0.0001591339,0.0046066158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926,0.00023315991,0.000024344665,0.00012693778,0.00030750586,0.000048071834],"domain_scores_gemma":[0.99887854,0.00067342614,0.000070349204,0.00019716192,0.00014936822,0.00003121322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009933425,0.00058608013,0.0008098075,0.0011051523,0.0005668771,0.0005704587,0.0013678318,0.0011992526,0.002940357],"category_scores_gemma":[0.003222631,0.00031180383,0.0008475144,0.0015653953,0.001140199,0.00095855433,0.0010176275,0.0013807616,0.0006438955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001459918,0.00018699527,0.0013328204,0.00028913422,0.00025613775,0.00055616174,0.00042615243,0.3150721,0.0506542,0.14941338,0.003054092,0.47861278],"study_design_scores_gemma":[0.00009680405,0.0003657572,0.0007050094,0.000044667097,0.00015894095,0.0008605962,0.000056814893,0.8823093,0.026362821,0.06553416,0.023449557,0.000055557248],"about_ca_topic_score_codex":0.0008898184,"about_ca_topic_score_gemma":0.0013524346,"teacher_disagreement_score":0.002940357,"about_ca_system_score_codex":0.00055845466,"about_ca_system_score_gemma":0.000596424,"threshold_uncertainty_score":0.009836495},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014811961576018752,"score_gpt":0.2366278524168018,"score_spread":0.22181589084078304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565486756","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059946897,0.08624698,0.052045207,0.034194797,0.46828142,0.0011568458,0.006278021,0.004175436,0.34162655],"genre_scores_gemma":[0.02194601,0.04585291,0.020992016,0.006838643,0.064487256,0.0007771066,0.013709548,0.0033798993,0.8220166],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960401,0.00078962836,0.00032069234,0.00059670454,0.0018955789,0.00035728543],"domain_scores_gemma":[0.98720086,0.0015519039,0.00046278586,0.001147363,0.00718299,0.0024540583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058358484,0.0015612883,0.0015219541,0.0027688977,0.0014306695,0.009683399,0.0026261741,0.0026072692,0.23027737],"category_scores_gemma":[0.013654703,0.00055113016,0.0011389263,0.002710736,0.0009827609,0.0047269175,0.0028882502,0.0038479357,0.1268515],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084679625,0.000052956144,0.00020665085,0.00038338374,0.00003197225,0.000072118426,0.00006540558,0.00031813636,0.00084891834,0.0030061975,0.88986135,0.10506829],"study_design_scores_gemma":[0.000017991124,0.00006792383,0.00053987326,0.00021352778,0.000018677343,0.00014149415,0.00007225084,0.00044044558,0.00034512943,0.0024624735,0.99566025,0.000019867579],"about_ca_topic_score_codex":0.0015098217,"about_ca_topic_score_gemma":0.0022398778,"teacher_disagreement_score":0.23027737,"about_ca_system_score_codex":0.0020721664,"about_ca_system_score_gemma":0.003297614,"threshold_uncertainty_score":0.77035457},"labels":[],"label_agreement":null},{"id":"W1565737841","doi":"10.1007/11788911_21","title":"Analyzing the Genetic Operations of an Evolutionary Query Optimizer","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Crossover; Computer science; Genetic programming; Genetic algorithm; Plan (archaeology); Mutation; Operations research; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.011676907347618563,"score_gpt":0.23831243456395643,"score_spread":0.22663552721633787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565737841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55749136,0.00026002672,0.43433538,0.00030638927,0.00003229039,0.00009345129,0.00006702175,0.00048364018,0.006930552],"genre_scores_gemma":[0.86379087,0.00014907212,0.13229191,0.00006726368,0.00001757696,0.00005335238,0.00013300008,0.00014232296,0.0033546267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995061,0.00011603686,0.000018935,0.000063870226,0.00021445683,0.00008061443],"domain_scores_gemma":[0.99845016,0.0010215214,0.000113657865,0.00012527035,0.0002524784,0.00003685078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007968708,0.00038532107,0.0004251056,0.00058356125,0.0004375444,0.0009597931,0.0009376121,0.0008700449,0.001808053],"category_scores_gemma":[0.0044323066,0.00029515065,0.00047966518,0.000751846,0.00068839977,0.000936621,0.0003719497,0.0007269616,0.00020443885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003437848,0.00016784904,0.007890174,0.00008557191,0.000073382376,0.0002832831,0.00025038738,0.81770813,0.03404511,0.046228062,0.0007736139,0.09215063],"study_design_scores_gemma":[0.000009783567,0.00005136132,0.0006495909,0.0000029794746,0.00001875569,0.000040144158,0.000036661604,0.9897371,0.0030895479,0.0061146165,0.00024380763,0.000005600096],"about_ca_topic_score_codex":0.0063830507,"about_ca_topic_score_gemma":0.0031996747,"teacher_disagreement_score":0.0063830507,"about_ca_system_score_codex":0.00079132715,"about_ca_system_score_gemma":0.00073391414,"threshold_uncertainty_score":0.012691796},"labels":[],"label_agreement":null},{"id":"W1568544595","doi":"10.1109/cec.2005.1554981","title":"The Estimation of Evolvability Genetic Algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Evolvability; Genetic algorithm; Computer science; Fitness function; Estimation; Function (biology); Algorithm; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Evolutionary biology; Biology; Engineering","score_opus":0.007716369297148556,"score_gpt":0.24330377170589493,"score_spread":0.23558740240874637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568544595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050788168,0.0004208019,0.943541,0.00020272817,0.00005574413,0.00007630991,0.00004052673,0.00036050327,0.004514229],"genre_scores_gemma":[0.60461026,0.0004003906,0.39261514,0.0001045123,0.000057484427,0.0001953437,0.00014460643,0.00012084069,0.0017513471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788034,0.0007865855,0.00011826501,0.0003497436,0.0007830528,0.000082006154],"domain_scores_gemma":[0.9921096,0.0051718536,0.00059684535,0.0007175736,0.0013059895,0.000098042285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024762377,0.0007393482,0.0005851087,0.0022043379,0.00032405904,0.001134958,0.0010202666,0.0010071814,0.0010322679],"category_scores_gemma":[0.024920605,0.000262802,0.00047132463,0.0009570714,0.001090818,0.0015320983,0.0009215236,0.0010329876,0.00019421964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016203032,0.0000655537,0.0106308,0.00015280828,0.00018660464,0.00014129006,0.00015164356,0.64688426,0.0077906437,0.0471154,0.0006702764,0.28604877],"study_design_scores_gemma":[0.000019866819,0.00008956527,0.0021879477,0.000040503503,0.00003360357,0.00018119981,0.000027174723,0.9657625,0.005963517,0.02349388,0.002174774,0.00002545458],"about_ca_topic_score_codex":0.0010233412,"about_ca_topic_score_gemma":0.0005558644,"teacher_disagreement_score":0.0024762377,"about_ca_system_score_codex":0.0008800959,"about_ca_system_score_gemma":0.0007025958,"threshold_uncertainty_score":0.0130957365},"labels":[],"label_agreement":null},{"id":"W1569529403","doi":"10.1109/qest.2004.11","title":"Genetic Instruction Scheduling and Register Allocation","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Register allocation; Computer science; Instruction scheduling; Compiler; Parallel computing; Scheduling (production processes); Processor register; Processor scheduling; Optimizing compiler; Program optimization; Dynamic priority scheduling; Programming language; Two-level scheduling; Schedule; Mathematical optimization; Operating system","score_opus":0.012838746915617328,"score_gpt":0.23379018534964016,"score_spread":0.22095143843402285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569529403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047807593,0.0026370436,0.93025565,0.0007561448,0.00015525719,0.00007903896,0.00007186182,0.0008550559,0.017382454],"genre_scores_gemma":[0.5276687,0.0032736205,0.45419538,0.00031576472,0.00015782523,0.000245991,0.000252592,0.00016710859,0.013723004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996542,0.000113566384,0.000012591176,0.000067594054,0.00011291023,0.000039238737],"domain_scores_gemma":[0.99960786,0.00021391589,0.000047932434,0.00006320785,0.00005253154,0.000014584018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005030538,0.00040496356,0.00043886606,0.00052191305,0.00037313893,0.0006438332,0.00054337643,0.0007729524,0.0017214827],"category_scores_gemma":[0.0019412559,0.00025743438,0.00030754186,0.00086118747,0.0009867112,0.0005377721,0.00037484654,0.0005871791,0.00051150867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008641784,0.000058063913,0.0010543652,0.00016618124,0.000072171475,0.00013802396,0.00011312858,0.5873111,0.012792892,0.20272106,0.0024270043,0.19305958],"study_design_scores_gemma":[0.000053215295,0.00010688389,0.00100551,0.0000377574,0.000045703797,0.00019913694,0.000032507964,0.7967534,0.009820493,0.16700304,0.024917087,0.000025303443],"about_ca_topic_score_codex":0.0022192514,"about_ca_topic_score_gemma":0.0017869737,"teacher_disagreement_score":0.0022192514,"about_ca_system_score_codex":0.0006220079,"about_ca_system_score_gemma":0.0009716474,"threshold_uncertainty_score":0.0057588816},"labels":[],"label_agreement":null},{"id":"W1572763892","doi":"10.1017/cbo9780511808241.021","title":"Examples of Dynamic Programs","year":2008,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Programming language","score_opus":0.025049093011836946,"score_gpt":0.19995062083591608,"score_spread":0.17490152782407914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572763892","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055039986,0.007995851,0.24682002,0.0019601702,0.00027359516,0.00009145082,0.0008719739,0.0012957789,0.73518705],"genre_scores_gemma":[0.28609693,0.017873935,0.30244035,0.0013054787,0.00038312038,0.0008046596,0.0026808432,0.0016127637,0.38680193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996792,0.00007890258,0.000021943077,0.00007084014,0.00010505932,0.000043985183],"domain_scores_gemma":[0.9997223,0.00016659913,0.000015805806,0.00003531422,0.00003766367,0.000022250491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025872866,0.00067953096,0.00030740147,0.0010191149,0.0008712872,0.0015911418,0.0009033887,0.0007098744,0.050332014],"category_scores_gemma":[0.0012571674,0.00036164935,0.0005931889,0.0022279264,0.0010690861,0.0020007857,0.0012023213,0.0015090541,0.0067196693],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016570875,0.000019897476,0.00006858331,0.00020380222,0.0000063030993,0.0001455573,0.00017369434,0.0034666175,0.00042026278,0.90833104,0.024672456,0.06247514],"study_design_scores_gemma":[0.000013385316,0.000010915758,0.00014699093,0.000110459514,0.00000667552,0.00033027318,0.000070025504,0.00825021,0.000530033,0.6665474,0.3239706,0.000012980894],"about_ca_topic_score_codex":0.0014290301,"about_ca_topic_score_gemma":0.0022751172,"teacher_disagreement_score":0.050332014,"about_ca_system_score_codex":0.001073013,"about_ca_system_score_gemma":0.0004940901,"threshold_uncertainty_score":0.16837734},"labels":[],"label_agreement":null},{"id":"W1574428622","doi":"10.1007/3-540-48035-8_76","title":"Collective Intelligence and Priority Routing in Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Swarm intelligence; Routing (electronic design automation); Ant colony; Distributed computing; Foraging; Swarm behaviour; Simplicity; Action (physics); Adaptation (eye); Artificial intelligence; Ant colony optimization algorithms; Computer network; Machine learning; Ecology; Particle swarm optimization","score_opus":0.02006697533973757,"score_gpt":0.2434654478876814,"score_spread":0.22339847254794384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574428622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044503644,0.019974919,0.7724794,0.005103649,0.0022511838,0.00008544126,0.0001045274,0.00037038466,0.15512688],"genre_scores_gemma":[0.7239412,0.013555307,0.16602735,0.0006253646,0.002011689,0.0001854111,0.00017262992,0.00011969694,0.0933614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998192,0.000056470166,0.000007265605,0.00002752425,0.000064233034,0.000025315476],"domain_scores_gemma":[0.99957806,0.00026244958,0.00003186554,0.00005123938,0.00004826282,0.000028127892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004753522,0.00032346515,0.00038862493,0.00042186232,0.00056097005,0.0015329943,0.000589765,0.000917459,0.0041478053],"category_scores_gemma":[0.0018044371,0.00022663978,0.00021724575,0.0007589871,0.00097526074,0.002080425,0.0005269555,0.0012411057,0.00048861734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020151077,0.000019684541,0.000108531494,0.00009460743,0.000011104544,0.000040594954,0.00014409823,0.024617646,0.0010858948,0.9091458,0.006472361,0.058239486],"study_design_scores_gemma":[0.000012683195,0.000022745455,0.00014123156,0.000023573166,0.00000898259,0.00006538535,0.0000561467,0.052989516,0.0005356363,0.9243848,0.02174958,0.000009772441],"about_ca_topic_score_codex":0.0005168725,"about_ca_topic_score_gemma":0.0006732634,"teacher_disagreement_score":0.0041478053,"about_ca_system_score_codex":0.00051371526,"about_ca_system_score_gemma":0.0003189,"threshold_uncertainty_score":0.0138757825},"labels":[],"label_agreement":null},{"id":"W1576324336","doi":"10.1109/cec.2005.1554824","title":"CasGP: Building Cascaded Hierarchical Models Using Niching","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Scalability; Layer (electronics); Metric (unit); Cascade; Genetic programming; Function (biology); Selection (genetic algorithm); Feature (linguistics); Genetic algorithm; Dynamic programming; Mathematical optimization; Algorithm; Artificial intelligence; Data mining; Machine learning; Mathematics; Engineering","score_opus":0.03786847997479447,"score_gpt":0.2912821835145228,"score_spread":0.2534137035397283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576324336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016143423,0.00013259146,0.9805854,0.00009555688,0.00003152003,0.000089204485,0.00007962239,0.00077297806,0.0020697569],"genre_scores_gemma":[0.44549868,0.00028367023,0.5488569,0.00016501742,0.000038558534,0.00052826956,0.00036289296,0.00020691073,0.004059136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962485,0.00007715268,0.000018606195,0.00011181394,0.00012461642,0.00004294177],"domain_scores_gemma":[0.99928707,0.00039703003,0.000058162615,0.0001166282,0.00009970108,0.00004150167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007955999,0.0009408824,0.0011162577,0.0007397157,0.0005539749,0.00083110604,0.0025305492,0.0013333363,0.002469755],"category_scores_gemma":[0.0025478133,0.0010434545,0.0015217599,0.00075923634,0.0006863791,0.0014484173,0.0016506921,0.0014731459,0.00060379604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026924748,0.000023231532,0.00049187936,0.00003970872,0.000044537785,0.000053912932,0.000043715478,0.9661768,0.001570664,0.0047874665,0.0006487998,0.026092228],"study_design_scores_gemma":[0.0000031334766,0.000013594129,0.000034528206,0.0000027843469,0.0000050022218,0.000008204704,0.000002443682,0.9977301,0.00032008023,0.0016215302,0.00025566813,0.0000029280839],"about_ca_topic_score_codex":0.0078096567,"about_ca_topic_score_gemma":0.009289913,"teacher_disagreement_score":0.0078096567,"about_ca_system_score_codex":0.00088537706,"about_ca_system_score_gemma":0.0013533734,"threshold_uncertainty_score":0.0155284405},"labels":[],"label_agreement":null},{"id":"W1578966950","doi":"10.1007/978-1-4419-1626-6_10","title":"Using Multi-Objective Genetic Programming to Synthesize Stochastic Processes","year":2009,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Genetic programming; Computer science; Set (abstract data type); Construct (python library); Process (computing); Feature (linguistics); Process calculus; Stochastic process; Selection (genetic algorithm); Feature selection; Machine learning; Artificial intelligence; Mathematical optimization; Theoretical computer science; Programming language; Mathematics","score_opus":0.028463512170990832,"score_gpt":0.2645522546837153,"score_spread":0.23608874251272446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578966950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109295035,0.00024248185,0.9805978,0.00007762331,0.000051729825,0.000041480744,0.000014938181,0.00016669411,0.007877814],"genre_scores_gemma":[0.35681352,0.00039612842,0.63715094,0.000072716204,0.000039894014,0.00018886637,0.00006132271,0.00013336907,0.0051432634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999866,0.000038546346,0.00000648683,0.000020352327,0.00005762504,0.000011041113],"domain_scores_gemma":[0.99972063,0.00019173398,0.000023849589,0.00001752237,0.000035953468,0.000010270981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717098,0.0005772449,0.0004692153,0.00042754464,0.00028519283,0.0006841906,0.00063260546,0.0008704861,0.0016944323],"category_scores_gemma":[0.0015545372,0.00037204154,0.0006972459,0.0004839021,0.0004781279,0.00040593641,0.0005367259,0.00089829665,0.00024921232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010541634,0.000018562647,0.00008839189,0.00004363294,0.000021592787,0.00003448257,0.00003174806,0.95363766,0.0021604004,0.017286986,0.00020313342,0.026462939],"study_design_scores_gemma":[0.00000481975,0.000011039611,0.000023199093,0.0000069041903,0.000005026744,0.0000074581294,0.0000023759992,0.99442506,0.00053214276,0.004425824,0.0005533222,0.0000027892231],"about_ca_topic_score_codex":0.0016564297,"about_ca_topic_score_gemma":0.0025055,"teacher_disagreement_score":0.0016944323,"about_ca_system_score_codex":0.0005407943,"about_ca_system_score_gemma":0.0004844684,"threshold_uncertainty_score":0.0056684613},"labels":[],"label_agreement":null},{"id":"W1579385695","doi":"10.1002/9780470973134.ch9","title":"Genetic Programming for Exploring Medical Data Using Visual Spaces","year":2010,"lang":"en","type":"other","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Genetic programming; Computer science; Artificial intelligence; Data science; Human–computer interaction","score_opus":0.05950827733421983,"score_gpt":0.3158990664913205,"score_spread":0.2563907891571007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579385695","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011936243,0.00040607224,0.9819171,0.0006577938,0.00003847468,0.0000745716,0.00022793269,0.00070861704,0.004033222],"genre_scores_gemma":[0.16297048,0.0007301105,0.8307016,0.00021066243,0.000056052402,0.00024434773,0.0006017794,0.00022433857,0.0042606653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956435,0.00021697301,0.000014289468,0.00008059876,0.00010273318,0.000021092561],"domain_scores_gemma":[0.9990983,0.0007006573,0.000032888176,0.000055703513,0.00007563736,0.0000368084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008453751,0.000664465,0.00048479132,0.00090979855,0.00026220505,0.0014784758,0.0009209693,0.00077553623,0.005094503],"category_scores_gemma":[0.0036737444,0.00031589405,0.0009755195,0.0010997871,0.00069705985,0.0008994263,0.0010557933,0.0010877242,0.00069933885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015464964,0.00010006245,0.0018050234,0.00024376194,0.00012787837,0.00018760683,0.0002450988,0.510359,0.0069611226,0.071720846,0.0072866515,0.4008083],"study_design_scores_gemma":[0.000025545542,0.000026457683,0.0002130171,0.000030771516,0.000013252916,0.000069291396,0.0000692336,0.94045,0.002097416,0.053515445,0.003476666,0.000012961342],"about_ca_topic_score_codex":0.0034961714,"about_ca_topic_score_gemma":0.003595276,"teacher_disagreement_score":0.005094503,"about_ca_system_score_codex":0.0006925179,"about_ca_system_score_gemma":0.00064462796,"threshold_uncertainty_score":0.017042816},"labels":[],"label_agreement":null},{"id":"W1581567161","doi":"","title":"EVALUATION OF FORECASTS PRODUCED BY GENETICALLY EVOLVED MODELS","year":2000,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Genetic programming; Heuristics; Computer science; Series (stratigraphy); Simple (philosophy); Process (computing); Machine learning; Programming language","score_opus":0.06948301755472099,"score_gpt":0.3364684688345633,"score_spread":0.2669854512798423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581567161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9311726,0.0005456872,0.06012271,0.00045957518,0.000117180985,0.00007036175,0.0003781655,0.0003918689,0.006741867],"genre_scores_gemma":[0.987727,0.0000995225,0.011345277,0.000025268026,0.00001004645,0.000026482532,0.00023816101,0.00003271357,0.00049555546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988813,0.0005156057,0.000063486084,0.00015791102,0.00030033936,0.000081471495],"domain_scores_gemma":[0.9935134,0.0044821594,0.0005080104,0.00036442198,0.000987796,0.00014425979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035590052,0.0009331684,0.0008026559,0.0012545,0.00042607827,0.001243069,0.00067183527,0.0015619827,0.0010739333],"category_scores_gemma":[0.014752422,0.00026668375,0.0005485454,0.0008191824,0.00064955954,0.00081261434,0.0006938795,0.0009059005,0.00018885867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014072575,0.00003766435,0.0034665281,0.000025602292,0.00006471283,0.000065173306,0.000035949994,0.9852992,0.00055605354,0.0009988487,0.00026490618,0.009044497],"study_design_scores_gemma":[0.00002074141,0.00006472947,0.0012787477,0.000010112673,0.00002513335,0.000012665894,0.000023288947,0.99642855,0.0013433162,0.00062973174,0.0001532096,0.0000098533765],"about_ca_topic_score_codex":0.009262402,"about_ca_topic_score_gemma":0.0065515963,"teacher_disagreement_score":0.009262402,"about_ca_system_score_codex":0.0018641,"about_ca_system_score_gemma":0.00075841235,"threshold_uncertainty_score":0.018822074},"labels":[],"label_agreement":null},{"id":"W1584211151","doi":"10.1109/cec.2003.1299584","title":"An evolutionary approach to behavioural-level synthesis","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; High-level synthesis; Scheduling (production processes); Processor scheduling; Parallel computing; Theoretical computer science; Distributed computing; Mathematical optimization; Field-programmable gate array; Mathematics; Schedule; Embedded system","score_opus":0.04960530375862269,"score_gpt":0.25995738193954476,"score_spread":0.21035207818092208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584211151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005638474,0.00013390691,0.9899749,0.00014945035,0.000023262586,0.000030533567,0.000010053761,0.00012148629,0.003917925],"genre_scores_gemma":[0.18629697,0.00041030181,0.80816424,0.00014554433,0.000037220296,0.00017878918,0.000058128768,0.00007878898,0.0046300786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995734,0.0001302028,0.00001885504,0.00006639583,0.00016424757,0.000046935405],"domain_scores_gemma":[0.9996505,0.000175508,0.000028568169,0.000058187317,0.000066764536,0.000020545527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007108431,0.0005377203,0.00038675868,0.00062652485,0.000552302,0.0007415964,0.0011904496,0.00085429515,0.0022213883],"category_scores_gemma":[0.0016325712,0.00034921514,0.0007580142,0.00051900896,0.0012542175,0.0006628604,0.00079573976,0.0010718094,0.00030779708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020345262,0.00005170788,0.0005683012,0.000106445106,0.000051717743,0.00011923765,0.00018930777,0.67873394,0.011117586,0.20918222,0.00062321045,0.0992359],"study_design_scores_gemma":[0.000018438282,0.000047914837,0.00021961197,0.000024249359,0.000029775747,0.00007321352,0.000035426816,0.91748154,0.002548274,0.07184488,0.0076629384,0.000013682516],"about_ca_topic_score_codex":0.0024083918,"about_ca_topic_score_gemma":0.0029167328,"teacher_disagreement_score":0.0024083918,"about_ca_system_score_codex":0.0008944784,"about_ca_system_score_gemma":0.0010083325,"threshold_uncertainty_score":0.0074312687},"labels":[],"label_agreement":null},{"id":"W1584380365","doi":"10.1115/1.859599.paper24","title":"Using Evolvable Regressors to Partition Data","year":2010,"lang":"en","type":"book-chapter","venue":"ASME Press eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Partition (number theory); Computer science; Data set; Data mining; Process (computing); Set (abstract data type); Artificial intelligence; Mathematics; Combinatorics","score_opus":0.1772480937848931,"score_gpt":0.3245944538905887,"score_spread":0.14734636010569563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584380365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052377056,0.00037593063,0.94454277,0.00030171362,0.000030453868,0.000066960274,0.00006588702,0.00063238665,0.0016069089],"genre_scores_gemma":[0.39199534,0.00039620482,0.6015397,0.00032132276,0.000047061905,0.00027941886,0.00047484174,0.00039653026,0.004549582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987398,0.0005199363,0.00007326696,0.00028516367,0.00027707944,0.00010483194],"domain_scores_gemma":[0.99712783,0.001811441,0.00019422235,0.00041635675,0.00034168514,0.00010836711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031088812,0.0011044608,0.00106215,0.0012541739,0.00068928994,0.0014957336,0.0019445561,0.0010095013,0.0015514194],"category_scores_gemma":[0.00812746,0.0007356773,0.0012858987,0.00097424473,0.0016570173,0.0024043429,0.0024998982,0.0019598922,0.0005560266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011560374,0.00007182937,0.0039052505,0.00008486085,0.00015387667,0.00010004832,0.00052982196,0.8135145,0.008997319,0.030736955,0.0008507011,0.1409393],"study_design_scores_gemma":[0.000012820699,0.000043589647,0.0002633306,0.000018784685,0.00001833757,0.000040189883,0.00004852057,0.97733134,0.0033098336,0.017549751,0.0013504139,0.000013043403],"about_ca_topic_score_codex":0.0028006567,"about_ca_topic_score_gemma":0.003215295,"teacher_disagreement_score":0.0031088812,"about_ca_system_score_codex":0.0012776284,"about_ca_system_score_gemma":0.0009202689,"threshold_uncertainty_score":0.016441464},"labels":[],"label_agreement":null},{"id":"W1586558052","doi":"10.1007/978-3-642-01088-0_6","title":"Inducing Relational Fuzzy Classification Rules by Means of Cooperative Coevolution","year":2009,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Artificial intelligence; Computer science; Machine learning; Fuzzy classification; Fuzzy logic; Genetic programming; Data mining; Population; Neuro-fuzzy; Evolutionary algorithm; Membership function; Fuzzy control system","score_opus":0.10576768326572608,"score_gpt":0.3404296944026688,"score_spread":0.2346620111369427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586558052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076601796,0.00018185005,0.9181116,0.00009390488,0.000036047833,0.0001180001,0.000026675383,0.00032319047,0.004506824],"genre_scores_gemma":[0.55324113,0.00016250921,0.44340518,0.00008096883,0.000021748698,0.0001637838,0.00014939673,0.00007409992,0.0027011407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991418,0.00023186626,0.00007975946,0.00022150991,0.00024845792,0.0000764826],"domain_scores_gemma":[0.9980123,0.0010614734,0.000104221865,0.0004278511,0.00034173668,0.00005248812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019878263,0.00049971533,0.0011099677,0.0006691301,0.00046695265,0.001089812,0.0017913603,0.0008777815,0.0017876712],"category_scores_gemma":[0.005323136,0.00053342915,0.001231288,0.0007172532,0.00090012205,0.0014183263,0.0017547521,0.0011705445,0.00049858174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020053666,0.0003683407,0.0032792755,0.0003036611,0.00031604888,0.000420879,0.0010484308,0.30966067,0.04513673,0.08347069,0.002375694,0.553419],"study_design_scores_gemma":[0.000020735226,0.0000724694,0.00042902993,0.000019394103,0.00005605141,0.00015604397,0.00006462901,0.9706778,0.007282239,0.020095294,0.0011071344,0.000019142963],"about_ca_topic_score_codex":0.0013922309,"about_ca_topic_score_gemma":0.0015848735,"teacher_disagreement_score":0.0019878263,"about_ca_system_score_codex":0.00036274618,"about_ca_system_score_gemma":0.00045375244,"threshold_uncertainty_score":0.010512769},"labels":[],"label_agreement":null},{"id":"W1588477125","doi":"10.1007/978-3-642-17298-4_31","title":"Supplanting Neural Networks with ODEs in Evolutionary Robotics","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Genetic programming; Computer science; Ode; Artificial intelligence; Symbolic regression; Artificial neural network; Evolutionary robotics; Robotics; Robot; Ordinary differential equation; Evolutionary algorithm; Genetic algorithm; Controller (irrigation); Differential equation; Machine learning; Mathematics; Applied mathematics","score_opus":0.010432609770204194,"score_gpt":0.22117974172815705,"score_spread":0.21074713195795286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588477125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015531309,0.002710353,0.95838785,0.0006016861,0.0003651083,0.000019374636,0.000031176813,0.0001565003,0.022196572],"genre_scores_gemma":[0.5999565,0.004863583,0.34385327,0.00037064415,0.00041865793,0.000112133865,0.00009631236,0.00029634906,0.050032414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982566,0.0000698193,0.000012083169,0.000025675829,0.000053324326,0.000013560723],"domain_scores_gemma":[0.999744,0.00015324894,0.0000208952,0.000034663157,0.000032385196,0.000014777276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057227403,0.00042419985,0.00056551525,0.0003443118,0.00031631082,0.0008268227,0.000864119,0.0012287626,0.00251878],"category_scores_gemma":[0.0021507598,0.00046876085,0.0005982145,0.00041285166,0.0010788029,0.0017952808,0.0015013881,0.0013048459,0.0005505657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033115288,0.000019467214,0.00019238332,0.0001606033,0.000039520917,0.00008280737,0.00011413008,0.38397142,0.0036553089,0.54586333,0.001401352,0.06446651],"study_design_scores_gemma":[0.000005638937,0.000018123292,0.00005796732,0.00002114433,0.000008579913,0.000037718117,0.000010870963,0.76799226,0.0006785306,0.22572222,0.005435785,0.000011115331],"about_ca_topic_score_codex":0.0013153784,"about_ca_topic_score_gemma":0.001528502,"teacher_disagreement_score":0.00251878,"about_ca_system_score_codex":0.0005317727,"about_ca_system_score_gemma":0.00029466368,"threshold_uncertainty_score":0.00842613},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.042709517163155734,"score_gpt":0.27603447508627005,"score_spread":0.2333249579231143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590984588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017179951,0.002086338,0.97573674,0.0004324861,0.000085111904,0.00009016603,0.000106581116,0.0005757996,0.0037069148],"genre_scores_gemma":[0.51968604,0.0024485297,0.46093404,0.00073687185,0.0005034234,0.000458405,0.0010535911,0.00071954005,0.013459509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99249023,0.0032489144,0.00055178395,0.0010317581,0.0023652825,0.00031195156],"domain_scores_gemma":[0.93538225,0.049991634,0.0014771742,0.007984344,0.0047610947,0.00040352475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013257871,0.0009980686,0.0021113618,0.0021022283,0.00091826625,0.002902839,0.0030576917,0.0025381867,0.0035570222],"category_scores_gemma":[0.054711003,0.0016427368,0.0013722504,0.003218867,0.0016556358,0.009888349,0.0041851443,0.0038144342,0.0015645212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007373627,0.00017930847,0.0063398066,0.00044479055,0.00027453707,0.00030456664,0.0003761409,0.12092021,0.0071129515,0.08848147,0.006278025,0.76855093],"study_design_scores_gemma":[0.000027898954,0.00012097853,0.001571338,0.000087334985,0.00018700602,0.0003495269,0.00005691701,0.8340617,0.01242216,0.1450572,0.0060160826,0.00004178351],"about_ca_topic_score_codex":0.0012879464,"about_ca_topic_score_gemma":0.0018357281,"teacher_disagreement_score":0.013257871,"about_ca_system_score_codex":0.0010275822,"about_ca_system_score_gemma":0.0008915412,"threshold_uncertainty_score":0.07011521},"labels":[],"label_agreement":null},{"id":"W1592012372","doi":"10.1109/reldis.2002.1180207","title":"A search for routing strategies in a peer-to-peer network using genetic programming","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Protocol (science); Routing protocol; Distributed computing; Peer-to-peer; Routing (electronic design automation); Genetic programming; Resource (disambiguation); Computer network; Enhanced Interior Gateway Routing Protocol; Wireless Routing Protocol; Artificial intelligence","score_opus":0.043790998470581564,"score_gpt":0.3189134581869949,"score_spread":0.27512245971641336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592012372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2856178,0.00042569474,0.70202416,0.00054930116,0.000050902363,0.00019448406,0.000058057365,0.00038630035,0.010693329],"genre_scores_gemma":[0.68180627,0.00033549784,0.3145646,0.00010702977,0.00001617934,0.00036592435,0.00008137582,0.000048904138,0.0026742762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964476,0.0001525905,0.00001339184,0.00005479183,0.000085912085,0.000048640977],"domain_scores_gemma":[0.9985575,0.0011288235,0.00007537534,0.00006249396,0.00013050274,0.000045389897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209924,0.0007898253,0.00072306476,0.0006754861,0.0007395145,0.0009769682,0.0012283706,0.0014680254,0.0013596935],"category_scores_gemma":[0.004037184,0.0003717795,0.00054446363,0.00059893215,0.0011983607,0.00074570556,0.0006943104,0.0008576624,0.0001550069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001836056,0.000035132,0.0004063675,0.000025172421,0.00002744705,0.00005440308,0.000047061294,0.979294,0.0010629459,0.00942279,0.0001930737,0.00941332],"study_design_scores_gemma":[0.000020242967,0.00004951486,0.000079662546,0.000006946075,0.00001557301,0.000024216848,0.000032549717,0.99316555,0.0005375387,0.0055925553,0.00046976242,0.000006012623],"about_ca_topic_score_codex":0.004143842,"about_ca_topic_score_gemma":0.002859766,"teacher_disagreement_score":0.004143842,"about_ca_system_score_codex":0.0008074913,"about_ca_system_score_gemma":0.0011751747,"threshold_uncertainty_score":0.008239448},"labels":[],"label_agreement":null},{"id":"W1594809898","doi":"10.1109/cec.2005.1554958","title":"Toward Co-Evolutionary Training of a Multi-Class Classifier","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Genetic programming; Computer science; Classifier (UML); Artificial intelligence; Machine learning; Population; Evolutionary algorithm; Class (philosophy); Boosting (machine learning)","score_opus":0.07967135720985735,"score_gpt":0.29777225797278983,"score_spread":0.21810090076293248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594809898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06952514,0.000107605636,0.92507625,0.00029894616,0.0000377647,0.00007853415,0.000011147947,0.00025362062,0.0046109324],"genre_scores_gemma":[0.5259268,0.000079441576,0.4693922,0.00025880258,0.00004212388,0.00016817525,0.00006838489,0.00011772972,0.003946362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984175,0.00047176133,0.00005017658,0.00038094015,0.0005214353,0.00015809486],"domain_scores_gemma":[0.99624133,0.0019553003,0.00025669482,0.00053907774,0.0008199492,0.00018767391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037027732,0.0006295423,0.00095326686,0.0008716468,0.00072593626,0.0015568666,0.0019101814,0.0023195613,0.0016884772],"category_scores_gemma":[0.008446027,0.0004037332,0.0006498245,0.00078390853,0.0009461764,0.0018389873,0.0016010687,0.0018993628,0.0006205187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021694133,0.00051358785,0.006913551,0.00011045737,0.0001413437,0.0002877814,0.00075170916,0.5441486,0.022419969,0.03733811,0.0022145126,0.38494346],"study_design_scores_gemma":[0.0000042925617,0.000033156255,0.00019899865,0.0000054089824,0.0000065646414,0.000050776045,0.000028512457,0.99430805,0.0018199813,0.0028262285,0.000713727,0.0000042542038],"about_ca_topic_score_codex":0.0018153631,"about_ca_topic_score_gemma":0.0018769698,"teacher_disagreement_score":0.0037027732,"about_ca_system_score_codex":0.00067690416,"about_ca_system_score_gemma":0.00090340595,"threshold_uncertainty_score":0.01958239},"labels":[],"label_agreement":null},{"id":"W1594829400","doi":"10.1007/978-3-540-87527-7_17","title":"What Hides in Dimension X? A Quest for Visualizing Particle Swarms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Visualization; Particle swarm optimization; Cluster analysis; Representation (politics); Data visualization; Dimension (graph theory); Population; Range (aeronautics); Theoretical computer science; Data mining; Artificial intelligence; Machine learning; Mathematics","score_opus":0.026032629025926197,"score_gpt":0.28392369610236484,"score_spread":0.25789106707643866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594829400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07552901,0.004951048,0.88791,0.009516117,0.0005691048,0.00005002802,0.00024040072,0.0016729321,0.01956136],"genre_scores_gemma":[0.6324574,0.0036141507,0.35243803,0.00081958494,0.00041686645,0.000107292275,0.00017352871,0.0007137715,0.0092594065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976605,0.000102138794,0.000015952606,0.00004953511,0.00004366271,0.000022714325],"domain_scores_gemma":[0.99825794,0.0009263839,0.0001707154,0.00033755938,0.00017741592,0.0001299148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001447,0.000698973,0.00087617204,0.00068219955,0.0009734297,0.0041886293,0.0008044741,0.0013603055,0.0036189025],"category_scores_gemma":[0.0074594785,0.0005824804,0.00055155944,0.00093491224,0.002355939,0.0075718644,0.00167797,0.0026387975,0.00057984487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028433243,0.000042851283,0.002885233,0.00045769234,0.000080311154,0.00032534957,0.004204199,0.056519758,0.011218342,0.7728888,0.013172875,0.13792038],"study_design_scores_gemma":[0.00004881245,0.00007182195,0.0010375748,0.00020032255,0.00004639067,0.00031835606,0.0014151364,0.28728262,0.0051515484,0.67971987,0.024635421,0.000072128845],"about_ca_topic_score_codex":0.0014174775,"about_ca_topic_score_gemma":0.00082200713,"teacher_disagreement_score":0.0041886293,"about_ca_system_score_codex":0.00052770926,"about_ca_system_score_gemma":0.00041985736,"threshold_uncertainty_score":0.012106419},"labels":[],"label_agreement":null},{"id":"W1595833556","doi":"10.1007/978-3-540-71605-1_21","title":"Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Pareto principle; Artificial intelligence; Computer science; Coevolution; Machine learning; Genetic programming; Random subspace method; Multi-objective optimization; Binary classification; Scheme (mathematics); Mathematical optimization; Support vector machine; Mathematics","score_opus":0.04805478791578602,"score_gpt":0.27049104154648856,"score_spread":0.22243625363070255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595833556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031241061,0.00031337602,0.9615916,0.00035018785,0.000036208545,0.00010522581,0.000029535759,0.00034872448,0.005983988],"genre_scores_gemma":[0.35887462,0.0003695671,0.6336124,0.00040358127,0.000083409,0.00040994515,0.0001808279,0.00021341875,0.005852232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885786,0.00040640816,0.000065583255,0.00014243199,0.00040531298,0.00012237349],"domain_scores_gemma":[0.99725085,0.0019179212,0.000089655754,0.00025372405,0.00043283205,0.000055059074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024755665,0.0010047901,0.001902292,0.0012799943,0.00075290824,0.0016214355,0.0024053745,0.002541608,0.0035222315],"category_scores_gemma":[0.009453095,0.0008661481,0.001055998,0.0015974445,0.0011123986,0.0022793293,0.0020697953,0.002134243,0.0009036198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010686845,0.0001577118,0.0010844124,0.000103481325,0.000103712904,0.000108405824,0.00013953062,0.6349695,0.0040460886,0.025779417,0.0023239518,0.3310769],"study_design_scores_gemma":[0.000011457868,0.000017838956,0.00008295542,0.000008351205,0.00001273963,0.000027727236,0.000010346643,0.9925029,0.00042183255,0.006623725,0.0002765215,0.0000035092803],"about_ca_topic_score_codex":0.0029859988,"about_ca_topic_score_gemma":0.0030193024,"teacher_disagreement_score":0.0035222315,"about_ca_system_score_codex":0.00092542364,"about_ca_system_score_gemma":0.0010710944,"threshold_uncertainty_score":0.01309216},"labels":[],"label_agreement":null},{"id":"W1595949339","doi":"","title":"Lens system design and re-engineering with Evolutionary Algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Lens (geology); Genetic programming; Computer science; Evolutionary programming; Evolutionary algorithm; Through-the-lens metering; Genetic algorithm; Evolutionary computation; Artificial intelligence; Machine learning; Engineering","score_opus":0.021412946513290464,"score_gpt":0.19418177051033084,"score_spread":0.17276882399704038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595949339","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08152634,0.0005653091,0.9047484,0.00027254308,0.00006774261,0.00033039585,0.00003243458,0.00062163075,0.011835259],"genre_scores_gemma":[0.34006166,0.00040967725,0.654847,0.00008221983,0.000016492431,0.00022023499,0.000075596006,0.00019123501,0.0040958915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980563,0.00084676093,0.00010027615,0.000211046,0.00063490815,0.00015078693],"domain_scores_gemma":[0.9969862,0.0018232656,0.00014850374,0.00047572522,0.0005053915,0.00006091571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022912193,0.00111688,0.0006868319,0.0010312245,0.00072202296,0.001540757,0.001317161,0.0015407101,0.003829268],"category_scores_gemma":[0.0067991903,0.00042859538,0.00078236,0.00061007636,0.00095031795,0.0018331062,0.0009988344,0.0011451724,0.0005340941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018555489,0.0002724736,0.0022649148,0.0004852721,0.00011645375,0.00037966843,0.0010627339,0.6345131,0.03285702,0.028088892,0.0013489535,0.29842493],"study_design_scores_gemma":[0.00012373252,0.00089493947,0.0008210218,0.000098987635,0.000100648824,0.00047858368,0.00057490263,0.90063983,0.049025096,0.017659573,0.02950003,0.000082664206],"about_ca_topic_score_codex":0.0017890519,"about_ca_topic_score_gemma":0.0018759802,"teacher_disagreement_score":0.003829268,"about_ca_system_score_codex":0.00093020976,"about_ca_system_score_gemma":0.0007035838,"threshold_uncertainty_score":0.012810171},"labels":[],"label_agreement":null},{"id":"W1599040639","doi":"10.1109/iscas.2001.921288","title":"Design of piece-wise maps for spread spectrum communication using genetic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Genetic programming; Spread spectrum; Computer science; Construct (python library); Code (set theory); Sequence (biology); Genetic algorithm; Spectrum (functional analysis); Interval (graph theory); Algorithm; Theoretical computer science; Artificial intelligence; Programming language; Mathematics; Machine learning; Code division multiple access; Telecommunications","score_opus":0.06026838104876835,"score_gpt":0.2691165363102545,"score_spread":0.20884815526148615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599040639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032117486,0.00016121271,0.9649183,0.00012856763,0.00002543718,0.00006406779,0.000021077607,0.0001957013,0.002368176],"genre_scores_gemma":[0.51766056,0.0003882435,0.4787938,0.00008648504,0.00002339861,0.00034408443,0.00006236797,0.00009328336,0.002547777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997135,0.00010338515,0.000012769266,0.000057127872,0.00008006658,0.00003309358],"domain_scores_gemma":[0.9993874,0.00035028017,0.000080239326,0.00003277447,0.0001226327,0.000026713928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862238,0.00069380575,0.00051026157,0.00066467753,0.0003509078,0.00066690316,0.0007628643,0.0007857108,0.0012344786],"category_scores_gemma":[0.0022353556,0.00029599151,0.0004966872,0.0004973386,0.0007509431,0.0005741839,0.0005958737,0.00070373097,0.00023877404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003503855,0.000037562677,0.0004484118,0.00007097665,0.000036440408,0.00011224714,0.00011447913,0.91153663,0.007533155,0.024659844,0.00050946185,0.05490577],"study_design_scores_gemma":[0.000015967958,0.000056885925,0.00008603726,0.000011925439,0.000013475136,0.000040650157,0.000022492888,0.98168117,0.0028045988,0.013576194,0.0016805973,0.000009913557],"about_ca_topic_score_codex":0.0010492612,"about_ca_topic_score_gemma":0.00081182376,"teacher_disagreement_score":0.0012344786,"about_ca_system_score_codex":0.00046857365,"about_ca_system_score_gemma":0.000570335,"threshold_uncertainty_score":0.004129708},"labels":[],"label_agreement":null},{"id":"W1600178424","doi":"10.1109/cec.2015.7257148","title":"Evolving fractal art with a directed acyclic graph genetic programming representation","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Fractal; Fitness function; Genetic programming; Representation (politics); Computer science; Digraph; Graph; Genetic representation; Mathematical optimization; Theoretical computer science; Mathematics; Genetic algorithm; Artificial intelligence; Discrete mathematics","score_opus":0.02072204219500991,"score_gpt":0.2642176212185772,"score_spread":0.2434955790235673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600178424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04291252,0.000121064564,0.94779867,0.00018067025,0.000025972278,0.000057134956,0.000098057055,0.000358566,0.008447326],"genre_scores_gemma":[0.43358612,0.00023579854,0.5597562,0.00008347312,0.000016139466,0.00022637079,0.00021243292,0.00006934533,0.00581411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986637,0.00004193972,0.000005856566,0.000031364103,0.00004219314,0.0000122983465],"domain_scores_gemma":[0.9997843,0.0001286004,0.000019928782,0.000022258811,0.000034613615,0.000010390454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028025455,0.00029065035,0.00025247614,0.00071714073,0.00026617825,0.0007128613,0.00058218406,0.00053841446,0.0016714385],"category_scores_gemma":[0.0008935529,0.00015681391,0.00051255705,0.00059674354,0.0005573021,0.00043647832,0.00037224038,0.0004956923,0.00018223259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020498348,0.000026142936,0.00039959193,0.000031225383,0.000014010611,0.00008221593,0.00008001386,0.85283893,0.003452665,0.09828323,0.0006201567,0.044151302],"study_design_scores_gemma":[0.000005436298,0.000011637321,0.000062676074,0.000004364753,0.000004745654,0.000023473625,0.0000064203127,0.9835464,0.0005412936,0.01441057,0.0013788949,0.0000042282372],"about_ca_topic_score_codex":0.0047999187,"about_ca_topic_score_gemma":0.004003726,"teacher_disagreement_score":0.0047999187,"about_ca_system_score_codex":0.00085835165,"about_ca_system_score_gemma":0.00058399135,"threshold_uncertainty_score":0.009544015},"labels":[],"label_agreement":null},{"id":"W1600825218","doi":"10.1155/2015/873794","title":"Compromise Rank Genetic Programming for Automated Nonlinear Design of Disaster Management","year":2015,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Rank (graph theory); Compromise; Mathematical optimization; Computer science; Genetic algorithm; Nonlinear programming; Nonlinear system; Genetic programming; Multi-objective optimization; Process (computing); Artificial intelligence; Mathematics","score_opus":0.030851559950880823,"score_gpt":0.253591673032192,"score_spread":0.22274011308131117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600825218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008184952,0.000098013785,0.9892452,0.00008803101,0.000012451551,0.00003182048,0.000010892051,0.00010642929,0.0022222814],"genre_scores_gemma":[0.52462846,0.00024366315,0.47096777,0.00013404919,0.00002776405,0.0003391297,0.0000841704,0.00008834654,0.0034866557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995925,0.00017534509,0.000015320606,0.000061702085,0.00011576866,0.000039233248],"domain_scores_gemma":[0.99944264,0.0003533166,0.000064248234,0.00003107523,0.000085143816,0.000023559089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010714914,0.0008835172,0.00073855557,0.0007381939,0.00045733794,0.0006667109,0.0007405296,0.0010242498,0.0016947129],"category_scores_gemma":[0.00246326,0.00047009744,0.0007378331,0.00050397165,0.0006631112,0.00057459006,0.0009835196,0.0009046303,0.0002212501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014245771,0.00001535971,0.00019426321,0.000023665492,0.000014695192,0.000030221494,0.000028804076,0.9763643,0.0008265601,0.005415544,0.0001880954,0.016884193],"study_design_scores_gemma":[0.0000035232763,0.000016018743,0.000025570624,0.0000028929849,0.0000027337258,0.0000056706,0.0000041290587,0.99781835,0.00018236748,0.0016753041,0.00026119497,0.0000021656156],"about_ca_topic_score_codex":0.0024931724,"about_ca_topic_score_gemma":0.0019898687,"teacher_disagreement_score":0.0024931724,"about_ca_system_score_codex":0.0006955353,"about_ca_system_score_gemma":0.001038211,"threshold_uncertainty_score":0.0056693554},"labels":[],"label_agreement":null},{"id":"W1603156618","doi":"10.1007/978-3-642-01181-8_26","title":"Beneficial Preadaptation in the Evolution of a 2D Agent Control System with Genetic Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Computer science; Task (project management); Genetic algorithm; Control (management); Artificial intelligence; Simple (philosophy); Machine learning; Engineering","score_opus":0.009963257023095237,"score_gpt":0.21687443676763277,"score_spread":0.20691117974453754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603156618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24817385,0.00040126662,0.73518676,0.00036000914,0.00013894243,0.00006839771,0.000013879164,0.00028349442,0.015373521],"genre_scores_gemma":[0.94393533,0.000100709025,0.0523379,0.00007238161,0.000022391878,0.00008229788,0.000009861097,0.000038338632,0.0034007037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998672,0.00004604538,0.0000052421515,0.000023414377,0.00003441789,0.000023644472],"domain_scores_gemma":[0.999762,0.00013247142,0.000029088234,0.000020231471,0.000034925095,0.000021288106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039871887,0.00045364408,0.00049663486,0.00025686852,0.00045239882,0.00060950447,0.0007004241,0.0009994236,0.0012889476],"category_scores_gemma":[0.001117395,0.00029018353,0.00036315896,0.00020020617,0.0008454488,0.0004069085,0.000880592,0.0007482155,0.00014207592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046851295,0.000027111106,0.00034103464,0.000025367832,0.000018239087,0.00009561092,0.00012391747,0.9592448,0.007079873,0.0134006245,0.00020136016,0.019395176],"study_design_scores_gemma":[0.000009151045,0.00003912353,0.000098254925,0.0000032845383,0.000005745439,0.000021995342,0.000009449385,0.9958204,0.0005015036,0.0032679287,0.0002177971,0.0000053686435],"about_ca_topic_score_codex":0.001953388,"about_ca_topic_score_gemma":0.001539435,"teacher_disagreement_score":0.001953388,"about_ca_system_score_codex":0.0003897218,"about_ca_system_score_gemma":0.0003782205,"threshold_uncertainty_score":0.004311979},"labels":[],"label_agreement":null},{"id":"W1603781187","doi":"10.1007/978-3-642-12242-2_11","title":"Using Code Bloat to Obfuscate Evolved Network Traffic","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Intrusion detection system; Code (set theory); Process (computing); Network packet; Port (circuit theory); Intrusion; Real-time computing; Computer security; Artificial intelligence; Programming language","score_opus":0.028522077278252726,"score_gpt":0.26617275926615164,"score_spread":0.2376506819878989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603781187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33709934,0.0003348219,0.640614,0.0003816933,0.00030001713,0.000072584,0.00011155245,0.008250365,0.012835594],"genre_scores_gemma":[0.8723599,0.00014358603,0.117000975,0.00019695183,0.000037689675,0.000044925015,0.00014681122,0.0010268833,0.00904234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996661,0.00005827386,0.000014291319,0.000062768326,0.00012080003,0.000077735276],"domain_scores_gemma":[0.99838436,0.00056800974,0.0001440113,0.00070525316,0.00015207376,0.000046272165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904094,0.0005158527,0.0003256326,0.00057583844,0.00044604338,0.00056824135,0.00069775444,0.000815795,0.0027502992],"category_scores_gemma":[0.0031534606,0.00029622586,0.00041315675,0.00035915786,0.0008897429,0.0008405785,0.0011836265,0.001344533,0.00054798566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010551822,0.00026106744,0.005155715,0.00023015362,0.00018723012,0.00092082476,0.00058003515,0.22336692,0.3280343,0.09192083,0.0064220214,0.34186572],"study_design_scores_gemma":[0.000053506643,0.00023532756,0.0012903725,0.00005781327,0.000078121535,0.00048608368,0.0000411127,0.7619217,0.19886725,0.02699177,0.009933427,0.000043487318],"about_ca_topic_score_codex":0.00066473236,"about_ca_topic_score_gemma":0.0011056125,"teacher_disagreement_score":0.0027502992,"about_ca_system_score_codex":0.00049128523,"about_ca_system_score_gemma":0.00037476863,"threshold_uncertainty_score":0.009200692},"labels":[],"label_agreement":null},{"id":"W161833311","doi":"10.1142/9789812792464_0016","title":"NEW PROBLEMS OF PATTERN AVOIDANCE","year":2000,"lang":"en","type":"article","venue":"Developments in Language Theory","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.006026744003686442,"score_gpt":0.22835435823147676,"score_spread":0.22232761422779032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161833311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072194815,0.0068126083,0.7292293,0.02683076,0.002037722,0.000069473324,0.00022302112,0.0006017707,0.16200061],"genre_scores_gemma":[0.7254106,0.00581879,0.18319425,0.0044295145,0.0039273645,0.0003279354,0.00057925703,0.00065106066,0.075661175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986708,0.00035084182,0.00007814486,0.00032297982,0.0004486787,0.00012860465],"domain_scores_gemma":[0.9956092,0.0024974768,0.00028573835,0.000880597,0.0005067696,0.00022010999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015849242,0.000567733,0.0009985756,0.001517367,0.0023393678,0.0036938968,0.0023102236,0.0027597672,0.011015726],"category_scores_gemma":[0.011225608,0.000536906,0.0011386729,0.001859292,0.006049488,0.012052298,0.00407222,0.0054347883,0.0013547719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019104762,0.0000129942055,0.00016755618,0.0000431361,0.000010166872,0.000042430456,0.00022429941,0.0009978251,0.00033986996,0.9751281,0.004279805,0.018734692],"study_design_scores_gemma":[0.0000069459006,0.0000039029396,0.000052825126,0.000007022055,0.0000040460286,0.00006854286,0.000057495385,0.0033329038,0.00012276565,0.98991233,0.0064267456,0.000004522711],"about_ca_topic_score_codex":0.00041984656,"about_ca_topic_score_gemma":0.00045929034,"teacher_disagreement_score":0.011015726,"about_ca_system_score_codex":0.0008735317,"about_ca_system_score_gemma":0.00064257893,"threshold_uncertainty_score":0.036851227},"labels":[],"label_agreement":null},{"id":"W1630579982","doi":"10.1109/cec.2004.1331178","title":"Cascaded GP models for data mining","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; RSS; Genetic programming; Data mining; Context (archaeology); Machine learning; Cascade; Architecture; Sampling (signal processing); Basis (linear algebra); Scheme (mathematics); Artificial intelligence; Genetic algorithm; Mathematics; Engineering","score_opus":0.09785359205741352,"score_gpt":0.3123116548357792,"score_spread":0.2144580627783657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630579982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009191952,0.0008478055,0.9854091,0.0003897262,0.00006216307,0.00005405242,0.00016167262,0.00045634859,0.0034272282],"genre_scores_gemma":[0.5208243,0.0024264965,0.46670327,0.00029900676,0.00016340012,0.00053523877,0.0006590843,0.00011743269,0.0082716895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948955,0.00017306888,0.00002776779,0.000112651585,0.00016155858,0.000035339042],"domain_scores_gemma":[0.99896014,0.0007002318,0.000058925205,0.00012426211,0.0001300109,0.000026334841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177501,0.00057747605,0.0008381407,0.0007273146,0.00029603107,0.00097411394,0.0018561895,0.0013792089,0.0025162823],"category_scores_gemma":[0.004566293,0.00049773674,0.0007826053,0.0016441584,0.00064885046,0.0012665072,0.00091158046,0.0016855067,0.00062614644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023414324,0.000024014564,0.00035093783,0.00006542893,0.000049238934,0.00005797765,0.000038631093,0.9233562,0.000506677,0.035846796,0.0013775064,0.038303137],"study_design_scores_gemma":[0.0000036709137,0.000010899827,0.00004621922,0.000004617809,0.000005410894,0.000011044204,0.0000018808129,0.98439133,0.00010028793,0.0146145085,0.000807076,0.0000030726906],"about_ca_topic_score_codex":0.003936404,"about_ca_topic_score_gemma":0.0049363715,"teacher_disagreement_score":0.003936404,"about_ca_system_score_codex":0.0008708846,"about_ca_system_score_gemma":0.0008277738,"threshold_uncertainty_score":0.008417785},"labels":[],"label_agreement":null},{"id":"W1635873948","doi":"10.1007/978-3-540-74111-4_1","title":"Evolutionary Design in Biology","year":2008,"lang":"en","type":"book-chapter","venue":"Natural computing series","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scope (computer science); Computer science; Data science; Modelling biological systems; Systems biology; Function (biology); Biology; Computational biology; Management science; Evolutionary biology; Engineering","score_opus":0.021813327264720194,"score_gpt":0.25701447610256356,"score_spread":0.23520114883784338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1635873948","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045432625,0.039432317,0.32861435,0.0034926028,0.0021238576,0.00007925974,0.000089163936,0.00042715302,0.62119806],"genre_scores_gemma":[0.10309956,0.026323102,0.123403385,0.0014208084,0.001070649,0.00026174643,0.00019219199,0.00044584862,0.7437827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985754,0.000041780942,0.0000051624197,0.000026546291,0.000059201462,0.000009697157],"domain_scores_gemma":[0.9999063,0.000044507367,0.000004984173,0.000018756367,0.00001721337,0.000008260373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003216913,0.0005508796,0.00041913913,0.0006332126,0.0005798916,0.0012568005,0.0006980075,0.0008160107,0.017397203],"category_scores_gemma":[0.0006064247,0.0002888619,0.00026733978,0.0006746179,0.0017902112,0.0017037871,0.000732791,0.0011946174,0.0041912957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000557371,0.000014692867,0.00006923036,0.00014649362,0.000007976026,0.000034339042,0.0001827808,0.004015016,0.0009042936,0.81349117,0.026562143,0.15456617],"study_design_scores_gemma":[0.000006224185,0.00002314169,0.00014716721,0.00013391003,0.0000079229085,0.00019003579,0.000056448087,0.007588698,0.0011590058,0.5441913,0.44648516,0.000010931414],"about_ca_topic_score_codex":0.0003656653,"about_ca_topic_score_gemma":0.0008058164,"teacher_disagreement_score":0.017397203,"about_ca_system_score_codex":0.00084183016,"about_ca_system_score_gemma":0.00043959668,"threshold_uncertainty_score":0.058199406},"labels":[],"label_agreement":null},{"id":"W1646992054","doi":"10.1109/cec.2004.1330834","title":"Evolution to the Xtreme: evolving evolutionary strategies using a meta-level approach","year":2004,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Metamodeling; Set (abstract data type); Evolutionary algorithm; Meta-analysis; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.09573218805477317,"score_gpt":0.28344053660922797,"score_spread":0.18770834855445478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646992054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029814579,0.0005198334,0.9632456,0.00033344742,0.0000674563,0.000107291184,0.00003606367,0.0008139907,0.005061761],"genre_scores_gemma":[0.26695985,0.0006117281,0.7291953,0.00028694439,0.000029031118,0.00021990552,0.000090824695,0.00023482698,0.002371629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952984,0.00020571113,0.000030251376,0.00006499766,0.00013358383,0.000035607118],"domain_scores_gemma":[0.9991184,0.0005091706,0.00007184145,0.00017977491,0.00008692601,0.000033946893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012329421,0.0006427308,0.00063007406,0.00052654155,0.0003325491,0.001434943,0.0014524679,0.0012196591,0.0023178812],"category_scores_gemma":[0.0038147783,0.0004071764,0.0010284425,0.0004867307,0.0007994244,0.0012873815,0.001125267,0.0015871353,0.0005017572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011527341,0.0001244564,0.0022508157,0.0002640495,0.00029499692,0.0002780092,0.00036390612,0.7617729,0.027648311,0.08292326,0.0011087364,0.12285531],"study_design_scores_gemma":[0.000043820237,0.00016232404,0.0003710807,0.00007610775,0.00009928168,0.00014015536,0.000056705274,0.9557421,0.008681651,0.024348967,0.010253249,0.0000244538],"about_ca_topic_score_codex":0.0007430044,"about_ca_topic_score_gemma":0.0007074377,"teacher_disagreement_score":0.0023178812,"about_ca_system_score_codex":0.0005166748,"about_ca_system_score_gemma":0.00056625437,"threshold_uncertainty_score":0.0077540874},"labels":[],"label_agreement":null},{"id":"W1648737833","doi":"","title":"The effects of randomly sampled training data on program evolution","year":2000,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Genetic programming; Sampling (signal processing); Computer science; Machine learning; Resampling; Evolutionary algorithm; Sample (material); Training (meteorology); Population; Artificial intelligence; Simple random sample; Sampling bias; Genetic algorithm; Statistics; Sample size determination; Mathematical optimization; Mathematics","score_opus":0.02617905632834657,"score_gpt":0.2858960940716449,"score_spread":0.25971703774329835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648737833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726431,0.00035359187,0.024841547,0.0002948274,0.000028081602,0.000083852414,0.00015236439,0.0002312137,0.0013713854],"genre_scores_gemma":[0.9882582,0.00009737134,0.011046722,0.000078171826,0.0000062064546,0.000066676694,0.0001847868,0.000039403498,0.00022250782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951788,0.0030445047,0.0002916141,0.0005782275,0.00064886495,0.00025808686],"domain_scores_gemma":[0.9252137,0.060856014,0.0031239765,0.007352229,0.0028465646,0.0006075258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006470325,0.0005702372,0.0004915993,0.00044434122,0.0005891097,0.0009163595,0.0007953592,0.0011182736,0.0008487425],"category_scores_gemma":[0.06624533,0.00034566075,0.00038407766,0.00047434896,0.0011567115,0.0013323893,0.0006893572,0.0010006527,0.00018536372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020462319,0.0012178554,0.046182446,0.0003471904,0.00036149425,0.00038702498,0.00062023726,0.7968484,0.024992673,0.0053639375,0.0013042998,0.12032825],"study_design_scores_gemma":[0.00020830805,0.0038119166,0.024304893,0.00013246473,0.00024048655,0.000452347,0.000519693,0.8980263,0.061795205,0.008089249,0.0023273285,0.000091830574],"about_ca_topic_score_codex":0.001864714,"about_ca_topic_score_gemma":0.0023914385,"teacher_disagreement_score":0.006470325,"about_ca_system_score_codex":0.00074982364,"about_ca_system_score_gemma":0.0005810449,"threshold_uncertainty_score":0.03421873},"labels":[],"label_agreement":null},{"id":"W1653679933","doi":"10.1007/978-3-642-01129-0_50","title":"Fractal Evolver: Interactive Evolutionary Design of Fractals with Grid Computing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fractal; Computer science; Grid; Theoretical computer science; Computer graphics (images); Artificial intelligence; Mathematics; Geometry","score_opus":0.013385776957813351,"score_gpt":0.24353608157132556,"score_spread":0.2301503046135122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1653679933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043569077,0.00035151656,0.9274739,0.0002827428,0.00018516468,0.0000735388,0.00013612675,0.0044025327,0.023525393],"genre_scores_gemma":[0.45168498,0.00040738977,0.5346422,0.00011665435,0.000042798787,0.00020338227,0.0002389343,0.0017387408,0.010924959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998716,0.00003675404,0.0000052704368,0.000015746267,0.000054853415,0.000015780482],"domain_scores_gemma":[0.99972934,0.00014035497,0.000012416339,0.000055902336,0.00003871917,0.000023247447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003712426,0.00032816196,0.00042474226,0.0003022971,0.00049855583,0.0010452913,0.0010516278,0.0006473905,0.0086297495],"category_scores_gemma":[0.0012011536,0.00029840053,0.0004848747,0.00035237495,0.00050365424,0.00078671396,0.0010635611,0.00074002205,0.000953783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023796072,0.00012188789,0.0017964924,0.00037061,0.00010942821,0.0006038145,0.000879306,0.5244574,0.044029523,0.20830181,0.01726172,0.20183003],"study_design_scores_gemma":[0.00007489623,0.000047102272,0.00024032917,0.000025645157,0.000019743435,0.00018321225,0.00006720926,0.9207143,0.008923497,0.037344534,0.03233695,0.000022560316],"about_ca_topic_score_codex":0.0007075985,"about_ca_topic_score_gemma":0.0007044563,"teacher_disagreement_score":0.0086297495,"about_ca_system_score_codex":0.00034097405,"about_ca_system_score_gemma":0.00027569357,"threshold_uncertainty_score":0.02886933},"labels":[],"label_agreement":null},{"id":"W1669835938","doi":"10.1109/ccece.2001.933572","title":"Circuit synthesis evolution using a hardware-based genetic algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Minification; Algorithm; Genetic algorithm; Logic synthesis; Logic gate; Function (biology); Scheme (mathematics); Circuit design; High-level synthesis; Computer architecture; Computer hardware; Computer engineering; Field-programmable gate array; Embedded system; Machine learning; Mathematics; Programming language","score_opus":0.03473544719703539,"score_gpt":0.22753398650064705,"score_spread":0.19279853930361165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669835938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020975875,0.00008362533,0.975421,0.000110946705,0.000030744948,0.000054947275,0.000016318836,0.00044190153,0.0028647212],"genre_scores_gemma":[0.22793467,0.00016194934,0.7688667,0.00008826926,0.000022570708,0.00019266657,0.00006285027,0.000060929167,0.0026093416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.00006696008,0.000011244046,0.000037745125,0.00009336754,0.000025169225],"domain_scores_gemma":[0.9997931,0.00008301263,0.000018962035,0.000040144812,0.000055334312,0.000009476908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048421122,0.00034840393,0.00037429234,0.00042699702,0.00028797757,0.0005615946,0.00088573864,0.0006657394,0.0013931413],"category_scores_gemma":[0.0011345547,0.0001795701,0.00040979555,0.00037550283,0.00056245015,0.00035988173,0.00047596951,0.00062466436,0.0002415253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056750625,0.00006773356,0.000778122,0.000073672614,0.00007435758,0.00012228513,0.00013439824,0.7414431,0.03802605,0.06789458,0.0008964849,0.15043245],"study_design_scores_gemma":[0.000029612032,0.000058894377,0.00014982274,0.000008718899,0.000022093123,0.000060224294,0.000007407358,0.98649013,0.00517778,0.005145518,0.0028419204,0.000007858786],"about_ca_topic_score_codex":0.0011801751,"about_ca_topic_score_gemma":0.0010942307,"teacher_disagreement_score":0.0013931413,"about_ca_system_score_codex":0.00045754592,"about_ca_system_score_gemma":0.0006293143,"threshold_uncertainty_score":0.004660487},"labels":[],"label_agreement":null},{"id":"W168149749","doi":"10.1007/978-0-387-71921-4_11","title":"Adaptive Control of Genetic Parameters for Dynamic Combinatorial Problems","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Population; Scheme (mathematics); Selection (genetic algorithm); Genetic algorithm; Computer science; Diversity (politics); Quality control and genetic algorithms; Adaptive mutation; Evolutionary algorithm; Space (punctuation); Mathematics; Algorithm; Artificial intelligence; Meta-optimization","score_opus":0.02221182163259981,"score_gpt":0.2421803554486267,"score_spread":0.2199685338160269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168149749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006030966,0.007936297,0.93829167,0.0003536917,0.0003750273,0.00003406547,0.000040715116,0.00043791207,0.04649959],"genre_scores_gemma":[0.37810048,0.01512449,0.5189019,0.00043686558,0.0006393735,0.00030105168,0.00023016501,0.00051973923,0.08574595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998659,0.000022722334,0.0000051113525,0.00002600546,0.00007047988,0.000009834751],"domain_scores_gemma":[0.99982005,0.0001063349,0.000013345291,0.000024821495,0.000029688294,0.000005840822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024252702,0.00065415556,0.00051233335,0.00034523578,0.0001721991,0.0008008712,0.001208087,0.0006802291,0.0045993202],"category_scores_gemma":[0.0010197525,0.00024507628,0.00033173943,0.0007816982,0.00063782645,0.0006241014,0.00043244573,0.0012376062,0.0010403775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003500018,0.000053299373,0.00012900878,0.00020294885,0.00003689578,0.00005916234,0.00008378669,0.3692663,0.012171653,0.15058234,0.011767867,0.4556117],"study_design_scores_gemma":[0.0000299284,0.000064999076,0.00022535786,0.00008342378,0.000024439874,0.00011890506,0.000021147922,0.8207742,0.003585765,0.13552955,0.039515994,0.000026387223],"about_ca_topic_score_codex":0.00075686834,"about_ca_topic_score_gemma":0.0011679139,"teacher_disagreement_score":0.0045993202,"about_ca_system_score_codex":0.00035234907,"about_ca_system_score_gemma":0.00026278596,"threshold_uncertainty_score":0.015386283},"labels":[],"label_agreement":null},{"id":"W1683124040","doi":"10.1109/iscas.1999.780157","title":"Constrained circuit optimization via library table genetic algorithms","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Genetic algorithm; Table (database); Set (abstract data type); Algorithm; Construct (python library); Electronic circuit; Power (physics); Function (biology); Mathematical optimization; Engineering; Mathematics; Electrical engineering; Data mining","score_opus":0.011407921226530247,"score_gpt":0.2040170388630176,"score_spread":0.19260911763648736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683124040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009985512,0.000324828,0.98119754,0.00013210469,0.00001937942,0.00007207321,0.000088888606,0.0006289501,0.0075507094],"genre_scores_gemma":[0.26754227,0.00068948,0.721134,0.00021114481,0.000033160468,0.0008643474,0.00049834006,0.00030142776,0.008725796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952734,0.00018502437,0.000016067386,0.00006608122,0.00015925126,0.000046189398],"domain_scores_gemma":[0.9992562,0.00050541863,0.0000601036,0.00005226515,0.000109570996,0.000016345155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090379035,0.0010137777,0.001019041,0.001294262,0.00046196836,0.0012424552,0.0013380303,0.0012276132,0.0052093705],"category_scores_gemma":[0.0028075594,0.0006278998,0.00079524255,0.0013691384,0.00072764914,0.0008401882,0.0008783763,0.00092503405,0.0009329986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015931133,0.000014174661,0.00009471342,0.000028458498,0.000017237857,0.000022728898,0.000013158744,0.9659761,0.00054253795,0.010855028,0.00064943696,0.02177052],"study_design_scores_gemma":[0.000011956248,0.000012375868,0.000025800904,0.000006850245,0.0000056164236,0.000007821845,0.000003906947,0.99238425,0.00028802527,0.006302526,0.00094759127,0.0000032958797],"about_ca_topic_score_codex":0.004439717,"about_ca_topic_score_gemma":0.004764839,"teacher_disagreement_score":0.0052093705,"about_ca_system_score_codex":0.0011670548,"about_ca_system_score_gemma":0.0012701028,"threshold_uncertainty_score":0.017427027},"labels":[],"label_agreement":null},{"id":"W168342931","doi":"10.1142/9781860949838_0005","title":"MOBILE GENETIC ELEMENTS AND THEIR PREDICTION","year":2008,"lang":"en","type":"book-chapter","venue":"Series on advances in bioinformatics and computational biology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Institutes of Health Research; Michael Smith Health Research BC; Georgia Cancer Coalition","keywords":"Computer science","score_opus":0.007581123519058414,"score_gpt":0.23083640102546074,"score_spread":0.22325527750640234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168342931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034045387,0.071424626,0.8451409,0.0031041484,0.0043107155,0.00008116764,0.002073662,0.0023071836,0.03751217],"genre_scores_gemma":[0.21974282,0.085147746,0.5240449,0.0010190142,0.0042900853,0.00019264985,0.009192157,0.00092382374,0.15544687],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999018,0.000009655063,0.0000054428,0.000029593532,0.000047903748,0.0000055998826],"domain_scores_gemma":[0.9995247,0.0003063972,0.00002317507,0.000053036576,0.000069336136,0.00002336198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032966048,0.0005665484,0.0006494413,0.0008532896,0.00016318502,0.0006492408,0.000638383,0.00041382783,0.005278356],"category_scores_gemma":[0.0011233505,0.0003020675,0.00030789332,0.001121319,0.0004868964,0.0006047546,0.00039034238,0.00111153,0.0032504527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109450746,0.000091609436,0.0017545186,0.0003276383,0.00005947364,0.00014335274,0.00007040612,0.0429412,0.009877312,0.062067837,0.06376504,0.8187921],"study_design_scores_gemma":[0.000035623783,0.00017754588,0.004057424,0.0002999798,0.000082536586,0.00063803577,0.00006623089,0.34683767,0.027141964,0.3489531,0.27164015,0.00006974074],"about_ca_topic_score_codex":0.0006259707,"about_ca_topic_score_gemma":0.00080934435,"teacher_disagreement_score":0.005278356,"about_ca_system_score_codex":0.00022126382,"about_ca_system_score_gemma":0.00028102592,"threshold_uncertainty_score":0.017657816},"labels":[],"label_agreement":null},{"id":"W1695361088","doi":"10.1002/cpe.2976","title":"Special issue on parallel architectures and bioinspired algorithm: guest editors message","year":2012,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Dependability; Heuristics; Architecture; Fault tolerance; Set (abstract data type); Distributed computing; Parallel computing; Software engineering; Programming language","score_opus":0.017421624073587008,"score_gpt":0.3081765115453007,"score_spread":0.2907548874717137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695361088","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004018926,0.015798343,0.0063885706,0.026252223,0.92739064,0.00011651446,0.0004655638,0.0007825615,0.022403782],"genre_scores_gemma":[0.0035832883,0.018641783,0.0051514637,0.0097693205,0.84143764,0.00020942546,0.0014329853,0.0014461732,0.11832793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973477,0.00035025371,0.0002752712,0.00060930185,0.0011464593,0.00027098876],"domain_scores_gemma":[0.99092335,0.0019982103,0.00045873382,0.00059424725,0.0044232802,0.0016022008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029492963,0.0021304088,0.0020277991,0.0029444725,0.0016289473,0.0066888267,0.0023259204,0.0036463453,0.09612638],"category_scores_gemma":[0.010009024,0.00073672755,0.0015478529,0.00256658,0.0009022885,0.005081131,0.0025622463,0.005243513,0.06001823],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003199885,0.00002350439,0.000057713176,0.00019257732,0.000010372695,0.000035959813,0.00001206639,0.00016349641,0.00017891817,0.0012657716,0.96676105,0.0312665],"study_design_scores_gemma":[0.000019380199,0.00003854117,0.00018946761,0.00015707972,0.000012598819,0.00011393601,0.00001855564,0.0006079216,0.00017616185,0.001636845,0.9970181,0.000011441766],"about_ca_topic_score_codex":0.0006120574,"about_ca_topic_score_gemma":0.000813793,"teacher_disagreement_score":0.09612638,"about_ca_system_score_codex":0.0015065359,"about_ca_system_score_gemma":0.0019306275,"threshold_uncertainty_score":0.32157475},"labels":[],"label_agreement":null},{"id":"W1707777926","doi":"10.1007/978-3-540-37256-1_107","title":"Benchmarking a Recurrent Linear GP Model on Prediction and Control Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chaotic; Linear programming; Genetic programming; Computer science; Benchmarking; Series (stratigraphy); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.012484282819386164,"score_gpt":0.22421690544209125,"score_spread":0.2117326226227051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1707777926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71939516,0.0024520596,0.25434092,0.001982361,0.00051632064,0.00019622961,0.0012985177,0.00284272,0.016975645],"genre_scores_gemma":[0.9488682,0.00020124986,0.04679315,0.00015693995,0.000046649522,0.00009017917,0.0013051952,0.00019031197,0.0023481965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997758,0.001302175,0.00013688262,0.0003153022,0.0003158617,0.0001718072],"domain_scores_gemma":[0.992432,0.005343095,0.00020120917,0.00081653317,0.0010586232,0.00014854527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005500928,0.0010993561,0.0017447942,0.00090143987,0.00050968287,0.0013652126,0.001996707,0.00399971,0.0032159186],"category_scores_gemma":[0.016669774,0.0005856714,0.001049621,0.0010739297,0.0007933095,0.0018853291,0.0012335194,0.0020799283,0.0005716981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019137163,0.0001482095,0.0007541274,0.00008052786,0.000072205024,0.000043501517,0.000018799807,0.976109,0.00046108116,0.002490874,0.0012409453,0.018389303],"study_design_scores_gemma":[0.000019363357,0.000053035543,0.0001728476,0.0000040295804,0.000010185765,0.000005152884,0.0000047376525,0.9984553,0.0002793944,0.00089568266,0.00009670522,0.0000035635233],"about_ca_topic_score_codex":0.013613701,"about_ca_topic_score_gemma":0.008284258,"teacher_disagreement_score":0.013613701,"about_ca_system_score_codex":0.0013420882,"about_ca_system_score_gemma":0.0011620257,"threshold_uncertainty_score":0.029092014},"labels":[],"label_agreement":null},{"id":"W173198799","doi":"10.20381/ruor-13147","title":"Abstraction-based genetic programming","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Programming language; Genetic programming; Theoretical computer science; Recursion (computer science); Abstraction; Set (abstract data type); Context (archaeology); Answer set programming; Isomorphism (crystallography); Representation (politics); Artificial intelligence","score_opus":0.009099976824973684,"score_gpt":0.26304351049099634,"score_spread":0.2539435336660226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173198799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025904842,0.00016254051,0.99044,0.00012942827,0.000053434604,0.00004128515,0.000042260413,0.00039919748,0.0061412854],"genre_scores_gemma":[0.08147403,0.0007034749,0.90626234,0.00017744124,0.000067418245,0.00023198652,0.00022416562,0.00027110023,0.01058799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922204,0.0002018884,0.0000369977,0.0001584684,0.00032246788,0.000058041365],"domain_scores_gemma":[0.9994375,0.00030277285,0.000036855497,0.000113485046,0.000079819445,0.000029604682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086521514,0.0005680402,0.0006241621,0.0008269086,0.00079471676,0.0015974904,0.0014400101,0.00065983157,0.004231467],"category_scores_gemma":[0.0022316882,0.00034288966,0.0014054801,0.0009646206,0.0015897411,0.0012856476,0.0015006971,0.0017555734,0.0010394016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035102275,0.000041870728,0.00038167875,0.000146697,0.000046144938,0.00011398415,0.00034656102,0.109526016,0.0053593866,0.7618617,0.0032690803,0.118871905],"study_design_scores_gemma":[0.000039159513,0.000041332456,0.00017730653,0.000071095674,0.000046181372,0.0002243563,0.000054632153,0.42074582,0.0042905463,0.50386417,0.07041159,0.0000337816],"about_ca_topic_score_codex":0.0018830746,"about_ca_topic_score_gemma":0.0021359967,"teacher_disagreement_score":0.004231467,"about_ca_system_score_codex":0.0011983127,"about_ca_system_score_gemma":0.0012630384,"threshold_uncertainty_score":0.014155626},"labels":[],"label_agreement":null},{"id":"W1809875586","doi":"10.1109/cec.2016.7744088","title":"Feature selection and classification using age layered population structure genetic programming","year":2016,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Feature selection; Artificial intelligence; Genetic programming; Computer science; Pattern recognition (psychology); Feature (linguistics); Benchmark (surveying); Population; Evolutionary algorithm; Heuristic; Machine learning; Selection (genetic algorithm); Curse of dimensionality; Dimensionality reduction; Evolutionary computation","score_opus":0.020938800777026895,"score_gpt":0.259406753321989,"score_spread":0.2384679525449621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809875586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032319203,0.00015408012,0.9654529,0.00012083188,0.0000255739,0.00006734048,0.000035920228,0.0003679105,0.001456288],"genre_scores_gemma":[0.47961155,0.00020049559,0.51716715,0.00021897176,0.000050594434,0.00036833217,0.00022477774,0.000070801296,0.0020873947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927324,0.00023738494,0.00004024496,0.00014231534,0.00022797802,0.00007877273],"domain_scores_gemma":[0.9989759,0.0005564166,0.00009285459,0.00007529971,0.00025580896,0.00004369899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014256916,0.00068533816,0.00082638516,0.0011375855,0.0004315988,0.00087053835,0.0012678113,0.0008808891,0.0009808976],"category_scores_gemma":[0.003565005,0.00030289023,0.0008390453,0.0008930699,0.0006502427,0.00095240853,0.0010534297,0.0008571837,0.00023133213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006147434,0.00008535819,0.003468104,0.000059341743,0.000094847186,0.0001199484,0.00014165166,0.7479085,0.005000835,0.015619959,0.0013193917,0.22612059],"study_design_scores_gemma":[0.000006548173,0.000020307643,0.000113840346,0.0000028423076,0.0000067522665,0.000018451829,0.0000059953472,0.99634534,0.00049240224,0.002668215,0.00031615444,0.0000031776433],"about_ca_topic_score_codex":0.0033500989,"about_ca_topic_score_gemma":0.0027087245,"teacher_disagreement_score":0.0033500989,"about_ca_system_score_codex":0.00086365273,"about_ca_system_score_gemma":0.0010253756,"threshold_uncertainty_score":0.007539928},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01591409546536706,"score_gpt":0.2416505097667037,"score_spread":0.22573641430133665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181710077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057100966,0.00019441858,0.97035134,0.00015333643,0.000099902274,0.00014759334,0.00010209227,0.0200842,0.0031569381],"genre_scores_gemma":[0.14826421,0.00052873587,0.83947176,0.00020780273,0.00009504679,0.00081690506,0.0009688358,0.0034728944,0.006173816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988304,0.0003934769,0.00005947724,0.00017665616,0.00041115962,0.00012878832],"domain_scores_gemma":[0.9986854,0.00050712004,0.00007425726,0.0004219235,0.00013445405,0.00017686957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019085194,0.0008256957,0.0012211802,0.00064189767,0.0009290122,0.0016365695,0.0034747664,0.0010262693,0.0077790786],"category_scores_gemma":[0.0036307925,0.00085603807,0.0007666916,0.00072330737,0.00103134,0.0026383332,0.0028136803,0.0023321474,0.0021151346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018742811,0.00061315426,0.0030544784,0.00068702933,0.00037538138,0.0011454994,0.0007899774,0.37641782,0.056686483,0.15137987,0.05499036,0.3519857],"study_design_scores_gemma":[0.00070550403,0.00025985236,0.00051383616,0.000039012237,0.00006249692,0.00035453343,0.00005581853,0.83703864,0.016374106,0.054142248,0.090347044,0.00010700373],"about_ca_topic_score_codex":0.0012590945,"about_ca_topic_score_gemma":0.0014587617,"teacher_disagreement_score":0.0077790786,"about_ca_system_score_codex":0.00040341003,"about_ca_system_score_gemma":0.000954231,"threshold_uncertainty_score":0.026023626},"labels":[],"label_agreement":null},{"id":"W1829038701","doi":"10.3233/kes-2005-9302","title":"Teaching while selecting images for satellite-based forest mapping","year":2005,"lang":"en","type":"article","venue":"International Journal of Knowledge-based and Intelligent Engineering Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Infectious Diseases Society of America","keywords":"Computer science; Process (computing); Satellite; Remote sensing; Task (project management); Artificial intelligence; Computer vision; Satellite imagery; Geography; Systems engineering; Engineering","score_opus":0.016572973756417253,"score_gpt":0.25750030465232676,"score_spread":0.2409273308959095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829038701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29628924,0.0004995993,0.6434063,0.0028897251,0.0002615087,0.0010757652,0.00042051848,0.018784923,0.036372505],"genre_scores_gemma":[0.31623673,0.00057966035,0.6623369,0.0010000939,0.00013844125,0.0003114027,0.0004919035,0.00038708738,0.018517839],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939096,0.00020078268,0.0000388792,0.0001689119,0.00014594356,0.000054541317],"domain_scores_gemma":[0.9965579,0.0019330948,0.00017173447,0.0003781567,0.00064706826,0.0003119107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013955189,0.00068153994,0.00050145166,0.00053058815,0.00042135452,0.0010154258,0.0011956595,0.0009526246,0.008673988],"category_scores_gemma":[0.007643935,0.00019660097,0.0002705439,0.00036354555,0.00024130847,0.0014054728,0.00074939826,0.0007405035,0.0056674085],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040698337,0.0015427507,0.008678156,0.00045877986,0.000019977799,0.0008972162,0.0052702907,0.0043619554,0.057914052,0.0017332335,0.030966168,0.88775045],"study_design_scores_gemma":[0.0005206151,0.0031700945,0.034865685,0.0005326039,0.00026640698,0.0076875943,0.012673361,0.23778908,0.23256885,0.027102094,0.44250935,0.00031429445],"about_ca_topic_score_codex":0.00044423298,"about_ca_topic_score_gemma":0.0012980019,"teacher_disagreement_score":0.008673988,"about_ca_system_score_codex":0.00028068342,"about_ca_system_score_gemma":0.00032532416,"threshold_uncertainty_score":0.029017389},"labels":[],"label_agreement":null},{"id":"W1838202668","doi":"10.1109/cec.2001.934267","title":"Supervised and unsupervised data mining with an evolutionary algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Evolutionary algorithm; Artificial intelligence; Machine learning; Data mining","score_opus":0.04660514755467084,"score_gpt":0.24783260409642197,"score_spread":0.20122745654175112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838202668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007616974,0.00015498782,0.9902361,0.000097206976,0.000018748084,0.00008425626,0.000022424869,0.00033975192,0.00142952],"genre_scores_gemma":[0.055652916,0.00014974554,0.9426842,0.00010060575,0.000031812626,0.00012363691,0.00009096847,0.000052236257,0.0011139271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984876,0.00057846046,0.000099660094,0.00030931592,0.00046924726,0.000055795106],"domain_scores_gemma":[0.9975339,0.0015764246,0.0001304946,0.0003645154,0.00033955288,0.000055221808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022664098,0.0005046288,0.0007726225,0.0012619314,0.0004837838,0.0010823549,0.0011797493,0.0009281655,0.0012802278],"category_scores_gemma":[0.006518447,0.00037256718,0.0009947025,0.0011684885,0.0007076002,0.0015452096,0.0010025306,0.0012393455,0.00045438847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008939595,0.00028639377,0.0037615695,0.00018398027,0.00026242924,0.00019418684,0.00024672775,0.31364608,0.007296077,0.05330664,0.002076536,0.6186499],"study_design_scores_gemma":[0.000016532564,0.000042805917,0.00034913095,0.000019936524,0.000019373976,0.00009685714,0.00002161649,0.977423,0.0018671084,0.016722156,0.0034122032,0.0000093601675],"about_ca_topic_score_codex":0.00093962776,"about_ca_topic_score_gemma":0.0016529993,"teacher_disagreement_score":0.0022664098,"about_ca_system_score_codex":0.00037356728,"about_ca_system_score_gemma":0.0007472218,"threshold_uncertainty_score":0.011986077},"labels":[],"label_agreement":null},{"id":"W184907052","doi":"10.1007/978-3-642-13950-5_11","title":"Interday and Intraday Stock Trading Using Probabilistic Adaptive Mapping Developmental Genetic Programming and Linear Genetic Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Converse; Implementation; Profit (economics); Probabilistic logic; Computer science; Linear programming; Stock market; Trading strategy; Econometrics; Mathematical optimization; Context (archaeology); Economics; Artificial intelligence; Microeconomics; Mathematics; Algorithm; Biology; Programming language","score_opus":0.1039516950835222,"score_gpt":0.32443604244877194,"score_spread":0.22048434736524974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184907052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08101493,0.00043477232,0.91090065,0.00030892502,0.00006329892,0.000024271076,0.000033367192,0.0001991959,0.0070206313],"genre_scores_gemma":[0.7847471,0.00028246595,0.20620246,0.00007942442,0.00005959164,0.00006329791,0.00006674234,0.00009260655,0.008406266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999703,0.00011866003,0.000012439147,0.000059967497,0.00007796177,0.00002800864],"domain_scores_gemma":[0.9989041,0.00084837223,0.000056979803,0.000046282832,0.000111549016,0.00003260425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011110594,0.00036079175,0.0007082168,0.00040082118,0.00034454427,0.0011885823,0.0011754184,0.0009923489,0.0017048238],"category_scores_gemma":[0.0030467021,0.00051002816,0.0007584767,0.000684983,0.0004744159,0.0016171703,0.00081731885,0.000980259,0.00011984448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044575798,0.000027403723,0.00076167536,0.000017516584,0.000047697504,0.000035696434,0.000043230062,0.924569,0.00075054273,0.024008837,0.00040401495,0.049289946],"study_design_scores_gemma":[0.0000021554056,0.000004607166,0.000075155,0.0000012651391,0.0000035896528,0.000006086345,0.0000026559771,0.9955141,0.00009105576,0.004201838,0.00009486693,0.0000025060963],"about_ca_topic_score_codex":0.0056303428,"about_ca_topic_score_gemma":0.0054348246,"teacher_disagreement_score":0.0056303428,"about_ca_system_score_codex":0.00087488315,"about_ca_system_score_gemma":0.00074480474,"threshold_uncertainty_score":0.011195123},"labels":[],"label_agreement":null},{"id":"W186113963","doi":"10.1007/978-3-540-75771-9_1","title":"An Introduction to Evolutionary Computation in Practice","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Framing (construction); Software deployment; Computation; Evolutionary computation; Curriculum; Computer science; Perception; Broad spectrum; Management science; Data science; Engineering; Sociology; Artificial intelligence; Psychology; Software engineering; Pedagogy; Algorithm","score_opus":0.0640269993333057,"score_gpt":0.37032116278951666,"score_spread":0.30629416345621097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186113963","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018352182,0.093177296,0.4128156,0.013515401,0.0043263063,0.00009535939,0.00019749554,0.0005822411,0.47345513],"genre_scores_gemma":[0.076091416,0.11290827,0.3424157,0.005936206,0.0063480507,0.00058070803,0.00037461697,0.0009575791,0.45438752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950194,0.0001654747,0.0000340645,0.00006398079,0.00020369097,0.00003081268],"domain_scores_gemma":[0.9990723,0.0007129789,0.000019492862,0.00007677953,0.000092229326,0.000026204862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084349833,0.00074338046,0.00079381606,0.0012852638,0.00071653345,0.0022354587,0.0011623922,0.0021146033,0.034452297],"category_scores_gemma":[0.0026429612,0.00049255666,0.0005535471,0.0026403202,0.0028016744,0.0034122907,0.0013645575,0.0033323127,0.0078055565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058276464,0.000025098303,0.00008585105,0.0003072571,0.0000091078,0.00007210806,0.0003001733,0.003171162,0.00025790892,0.81660384,0.043140747,0.13602084],"study_design_scores_gemma":[0.000006845447,0.000017503415,0.00012149731,0.00028986856,0.0000046343976,0.00023108884,0.000070077054,0.0037414622,0.00014432264,0.46172905,0.53363097,0.000012694344],"about_ca_topic_score_codex":0.0008615416,"about_ca_topic_score_gemma":0.0014066718,"teacher_disagreement_score":0.034452297,"about_ca_system_score_codex":0.0010796089,"about_ca_system_score_gemma":0.0009298973,"threshold_uncertainty_score":0.1152544},"labels":[],"label_agreement":null},{"id":"W1861569832","doi":"","title":"An Examination of Lamarckian Genetic Algorithms","year":2001,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Travelling salesman problem; Memetic algorithm; Genetic algorithm; Mathematical optimization; Algorithm; Computer science; Sequence (biology); Set (abstract data type); Artificial neural network; Artificial intelligence; Tree (set theory); Mathematics; Combinatorics","score_opus":0.015259292698691206,"score_gpt":0.2555793886270595,"score_spread":0.24032009592836828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861569832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11713871,0.012599267,0.67583084,0.005536296,0.0002361958,0.00035742886,0.00016519015,0.0010568857,0.18707916],"genre_scores_gemma":[0.6664011,0.0061127087,0.3094648,0.0014378949,0.00013490625,0.0003108742,0.00023429723,0.00025856204,0.0156449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970291,0.0014525796,0.000105456376,0.00020354195,0.0010667745,0.00014259406],"domain_scores_gemma":[0.99428576,0.0034724635,0.00037728372,0.00052551925,0.0012666156,0.00007240559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043522827,0.0005231358,0.00058507046,0.0021777663,0.0010125552,0.0019207974,0.0020510685,0.0016689602,0.003284489],"category_scores_gemma":[0.020031452,0.00026675267,0.0006115332,0.002867899,0.0016691611,0.0017592225,0.00079052255,0.0010882008,0.0006260623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001353829,0.0001481104,0.005819882,0.0003802392,0.00019183606,0.0002161275,0.00043485308,0.36175573,0.0015099598,0.37476265,0.004391272,0.25025395],"study_design_scores_gemma":[0.00006618144,0.000297377,0.0025517277,0.00021620447,0.00008523204,0.00038088745,0.00028678367,0.77471864,0.0018587455,0.17793886,0.041549746,0.00004955532],"about_ca_topic_score_codex":0.0070095914,"about_ca_topic_score_gemma":0.0057921624,"teacher_disagreement_score":0.0070095914,"about_ca_system_score_codex":0.0026445969,"about_ca_system_score_gemma":0.0016343769,"threshold_uncertainty_score":0.023017347},"labels":[],"label_agreement":null},{"id":"W1878709465","doi":"","title":"Multi-combinative strategy to avoid premature convergence in genetically-generated fuzzy knowledge bases","year":2004,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Premature convergence; Crossover; Construct (python library); Computer science; Genetic algorithm; Fuzzy logic; Convergence (economics); Variation (astronomy); Process (computing); Artificial intelligence; Machine learning; Mathematical optimization; Mathematics","score_opus":0.015070095822042473,"score_gpt":0.2561472285141072,"score_spread":0.24107713269206474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878709465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03732876,0.00053400546,0.9567694,0.00016077636,0.000034362096,0.00013199978,0.000014957526,0.00026111593,0.0047645913],"genre_scores_gemma":[0.5404481,0.00040032252,0.45374158,0.00019941531,0.000033494354,0.00030942037,0.000095417534,0.00010342689,0.0046687876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998602,0.00042466001,0.000109968096,0.00017915294,0.00058876246,0.000095418465],"domain_scores_gemma":[0.9980878,0.0010353103,0.00017591397,0.0002002302,0.00043014073,0.00007052013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030169827,0.0008040116,0.001001742,0.0014086679,0.0007803247,0.0012081163,0.0014613743,0.001197035,0.001762587],"category_scores_gemma":[0.006205593,0.00044331016,0.00069105,0.0010478107,0.00097304815,0.0014104955,0.0014856021,0.0008649201,0.00033133329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013903453,0.0001905178,0.0013929494,0.00020197789,0.0002420538,0.00046740661,0.00080707105,0.6119729,0.010752382,0.059327938,0.0013071733,0.31319854],"study_design_scores_gemma":[0.000029636969,0.00018106948,0.00037081755,0.000051668816,0.00006457136,0.00020397367,0.00006585911,0.96576023,0.004235439,0.025631856,0.0033872186,0.00001766374],"about_ca_topic_score_codex":0.002904123,"about_ca_topic_score_gemma":0.0034561043,"teacher_disagreement_score":0.0030169827,"about_ca_system_score_codex":0.00096250506,"about_ca_system_score_gemma":0.0012387206,"threshold_uncertainty_score":0.015955508},"labels":[],"label_agreement":null},{"id":"W1885006205","doi":"10.1109/ecnn.2000.886217","title":"Evolving neural networks using attribute grammars","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Grammatical evolution; Computer science; Rule-based machine translation; Parsing; ENCODE; Artificial intelligence; Artificial neural network; Grammar; Representation (politics); Selection (genetic algorithm); Parse tree; Genetic representation; Grammar induction; Genetic algorithm; Theoretical computer science; Genetic programming; Natural language processing; Machine learning; Linguistics; Biology","score_opus":0.03823191381024699,"score_gpt":0.24518472435489044,"score_spread":0.20695281054464346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885006205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10653585,0.00027169372,0.88716537,0.00039489678,0.00005354647,0.00003887191,0.000047092235,0.0003808828,0.0051117945],"genre_scores_gemma":[0.6540343,0.00045517477,0.34125865,0.00012557821,0.00003622735,0.00017970896,0.00013186313,0.00014104912,0.0036374673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996259,0.00013967711,0.000026066253,0.000060804658,0.00011700816,0.000030499861],"domain_scores_gemma":[0.99927396,0.00043770848,0.00005827884,0.00009006462,0.00010344293,0.00003668845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009662662,0.00027913056,0.00043589206,0.00053028227,0.00038900782,0.0010503618,0.0008701709,0.0008424364,0.0009859509],"category_scores_gemma":[0.0040802765,0.00030210492,0.00064139377,0.00059322256,0.0011622212,0.0013443942,0.0011960834,0.0009531085,0.00016339771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014721751,0.000015362984,0.00046796227,0.00002041322,0.000024755249,0.00006763995,0.000118990414,0.8758481,0.0037175359,0.093361326,0.00027119505,0.02607182],"study_design_scores_gemma":[0.00000894745,0.000011350509,0.000081357866,0.000005008416,0.000007606858,0.000019738594,0.000012829103,0.9491303,0.0013198011,0.048336823,0.0010592747,0.0000068441],"about_ca_topic_score_codex":0.0021582125,"about_ca_topic_score_gemma":0.0021591699,"teacher_disagreement_score":0.0021582125,"about_ca_system_score_codex":0.0010406435,"about_ca_system_score_gemma":0.0005819144,"threshold_uncertainty_score":0.0075504184},"labels":[],"label_agreement":null},{"id":"W1889739364","doi":"","title":"Improving evolutionary algorithms by means of an adaptive parameter control approach","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Benchmark (surveying); Estimator; Path (computing); Computer science; Evolutionary algorithm; Population; Mathematical optimization; Premature convergence; Convergence (economics); Process (computing); Outcome (game theory); Diversity (politics); Machine learning; Mathematics; Genetic algorithm","score_opus":0.015443279152457539,"score_gpt":0.23070298693750257,"score_spread":0.21525970778504502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889739364","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011828997,0.000695748,0.9835601,0.00021275773,0.000050551644,0.00004990979,0.000008689314,0.00022853015,0.0033647243],"genre_scores_gemma":[0.51992744,0.0013840098,0.47558913,0.0002904468,0.00018931204,0.00026340305,0.000049254893,0.00016124695,0.0021457376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986229,0.00057003356,0.00010041837,0.00021078595,0.00042061834,0.000075225675],"domain_scores_gemma":[0.99736184,0.001613554,0.00023199129,0.00038979828,0.0003618205,0.000041075305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023559134,0.0011960873,0.00079496973,0.0010300085,0.00034471843,0.0013906334,0.0014831722,0.0013973255,0.0012242513],"category_scores_gemma":[0.010000404,0.00038135826,0.00079723384,0.0007674942,0.001079061,0.0017831279,0.0014828326,0.0015696088,0.0002682201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033444685,0.000073344,0.0009092987,0.00010538929,0.000083395316,0.00008395214,0.00013940058,0.83746165,0.008930278,0.03356778,0.00050233724,0.11810969],"study_design_scores_gemma":[0.00001843721,0.00009782963,0.00025403063,0.000030870127,0.000029702322,0.000053635616,0.00001784334,0.98265946,0.0018504006,0.011815804,0.003154582,0.000017411921],"about_ca_topic_score_codex":0.0009542993,"about_ca_topic_score_gemma":0.00066267245,"teacher_disagreement_score":0.0023559134,"about_ca_system_score_codex":0.00053853844,"about_ca_system_score_gemma":0.0005556645,"threshold_uncertainty_score":0.012459457},"labels":[],"label_agreement":null},{"id":"W1889811593","doi":"10.1007/978-3-540-24855-2_67","title":"On Multi-class Classification by Way of Niching","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Population; Artificial intelligence; Classifier (UML); Machine learning; Class (philosophy); Niche; Context (archaeology); Data mining; Theoretical computer science","score_opus":0.021663388428801823,"score_gpt":0.25738467567569745,"score_spread":0.23572128724689562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889811593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010332779,0.00050357485,0.98434573,0.00023220234,0.0001605222,0.000086205,0.000026127223,0.00023822175,0.004074559],"genre_scores_gemma":[0.22231711,0.000371375,0.7680491,0.00039639202,0.00020909136,0.00034558366,0.000148226,0.00020338941,0.007959681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983851,0.000638951,0.000096636286,0.00031961966,0.00042561104,0.00013409379],"domain_scores_gemma":[0.9949013,0.0034075708,0.00016491029,0.000740552,0.0006569386,0.00012873368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003848007,0.00089688506,0.0019361592,0.0015734268,0.001201176,0.0013877982,0.004454842,0.0021045133,0.004118481],"category_scores_gemma":[0.010790541,0.00066107843,0.0015180954,0.0015671297,0.0019735808,0.0028592707,0.003003859,0.0023640944,0.00049162155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027853608,0.00017978075,0.0016742458,0.0002421204,0.00022853137,0.00009906281,0.0003202123,0.39553413,0.0031845376,0.13549459,0.0068345587,0.4559296],"study_design_scores_gemma":[0.000036457837,0.000044239783,0.00021600212,0.000029848472,0.00004118194,0.000066843095,0.000022688495,0.94551283,0.00079340226,0.051272348,0.0019489941,0.000015171125],"about_ca_topic_score_codex":0.0032076614,"about_ca_topic_score_gemma":0.0039403522,"teacher_disagreement_score":0.004454842,"about_ca_system_score_codex":0.0012855895,"about_ca_system_score_gemma":0.0007920646,"threshold_uncertainty_score":0.020350397},"labels":[],"label_agreement":null},{"id":"W1894411465","doi":"10.1109/cec.2004.1330988","title":"Automated selection of vision operator libraries with evolutionary algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Operator (biology); Interpretation (philosophy); Domain (mathematical analysis); Artificial intelligence; Process (computing); Image (mathematics); Machine learning; Principal (computer security); Bitwise operation; Algorithm; Mathematics; Programming language","score_opus":0.0068483659293806995,"score_gpt":0.23345032510898817,"score_spread":0.22660195917960746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894411465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058637727,0.00013995018,0.936896,0.00012754461,0.000013771457,0.00010735952,0.0000206984,0.0017685861,0.0022883527],"genre_scores_gemma":[0.52279025,0.00014652898,0.47427464,0.00015763156,0.000019614,0.00023839888,0.00011231435,0.00027470008,0.0019858428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994029,0.00020469834,0.000029185552,0.00012994367,0.00015422572,0.000079061145],"domain_scores_gemma":[0.99843353,0.00091296446,0.00013296172,0.00021622403,0.00023113911,0.00007316728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013894426,0.00089723035,0.0011498777,0.00086786936,0.00049647066,0.0010767967,0.001142917,0.0010517145,0.0019001963],"category_scores_gemma":[0.0045855045,0.0007064362,0.00062786025,0.00048571642,0.0008757689,0.0013160908,0.0011665951,0.0013496407,0.0005394565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013593498,0.00022312425,0.0020055363,0.000081533886,0.000057558602,0.00017541036,0.00016589457,0.5846893,0.022742298,0.009151488,0.0017046148,0.37886736],"study_design_scores_gemma":[0.000022215974,0.000051276158,0.00023894152,0.000005707395,0.000009153373,0.000028279117,0.000026735272,0.99018455,0.004420832,0.0042573204,0.0007467211,0.000008264606],"about_ca_topic_score_codex":0.0020226154,"about_ca_topic_score_gemma":0.002461214,"teacher_disagreement_score":0.0020226154,"about_ca_system_score_codex":0.00077879,"about_ca_system_score_gemma":0.0012447673,"threshold_uncertainty_score":0.00734818},"labels":[],"label_agreement":null},{"id":"W1902126040","doi":"10.1109/isvlsi.2015.101","title":"A Statistical Approach to Probe Chaos from Noise in Analog and Mixed Signal Designs","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Chaotic; Lyapunov exponent; Computer science; Electronic circuit; Noise (video); Analogue electronics; Electronic engineering; Control theory (sociology); Realization (probability); Mixed-signal integrated circuit; Algorithm; Mathematics; Artificial intelligence; Engineering; Statistics; Electrical engineering","score_opus":0.05570957554000015,"score_gpt":0.2662923692584652,"score_spread":0.21058279371846506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902126040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007987748,0.00007717203,0.99134725,0.000031558033,0.000008764301,0.000016400532,0.000012114037,0.00013629906,0.00038261918],"genre_scores_gemma":[0.6267872,0.00027795357,0.37106475,0.00011176618,0.0000696528,0.00022016473,0.00009458815,0.00006313651,0.0013108554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987935,0.0004906987,0.0000605279,0.0001495579,0.00046429667,0.00004136929],"domain_scores_gemma":[0.9965828,0.0022184,0.00048278275,0.0003356148,0.00032107616,0.000059299728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278289,0.00057417754,0.0004400868,0.001622957,0.0002030642,0.0004927851,0.0005360275,0.00059740426,0.0008735587],"category_scores_gemma":[0.0070655653,0.00032232184,0.0005332032,0.00075300504,0.0008355276,0.0008749294,0.0005046391,0.0006392276,0.00017088631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013290624,0.00014728114,0.004696675,0.00024653095,0.00015132452,0.00025480174,0.00017174007,0.5821476,0.06283966,0.16024506,0.00052781694,0.18843865],"study_design_scores_gemma":[0.000006534702,0.00012118178,0.00062018394,0.000006382419,0.000010144869,0.000079422956,0.000008589065,0.9796005,0.004405371,0.014489206,0.000641374,0.000011119115],"about_ca_topic_score_codex":0.00033645975,"about_ca_topic_score_gemma":0.00033321523,"teacher_disagreement_score":0.001622957,"about_ca_system_score_codex":0.0004322135,"about_ca_system_score_gemma":0.00048267763,"threshold_uncertainty_score":0.007022321},"labels":[],"label_agreement":null},{"id":"W1903488793","doi":"10.1109/tkde.2015.2453952","title":"A Cooperative Coevolution Framework for Parallel Learning to Rank","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Science Foundation of Shandong Province; Academy of Finland; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Benchmark (surveying); Rank (graph theory); Coevolution; Context (archaeology); Learning to rank; Artificial intelligence; Divide and conquer algorithms; Machine learning; Evolutionary algorithm; Function (biology); Theoretical computer science; Algorithm; Ranking (information retrieval); Mathematics","score_opus":0.04245486072800539,"score_gpt":0.3010015428149192,"score_spread":0.2585466820869138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903488793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059544155,0.00024560172,0.99056983,0.00015208541,0.000052071173,0.000053819163,0.000026654006,0.00037984873,0.0025657208],"genre_scores_gemma":[0.32916865,0.00044126023,0.6626591,0.00036187735,0.00017735263,0.0004101595,0.00020732706,0.00025314675,0.006321068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983581,0.00053455704,0.000086291475,0.00029875067,0.00055333483,0.00016905303],"domain_scores_gemma":[0.9975171,0.00087698986,0.00017831553,0.0005509634,0.0007094184,0.00016716994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003209914,0.0011706856,0.0017371022,0.0013239237,0.00077384314,0.0016094644,0.0024535193,0.0014321329,0.004116795],"category_scores_gemma":[0.008297639,0.00045829936,0.0009069662,0.0014713759,0.0016478874,0.00205787,0.002475146,0.0020713846,0.0011071286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084239786,0.00012623056,0.00085340516,0.00012182862,0.00009299398,0.00011792696,0.000105965315,0.7490486,0.004255805,0.07305575,0.0037113312,0.1684259],"study_design_scores_gemma":[0.000014511359,0.00004381675,0.000053159118,0.0000052982655,0.000008378866,0.00003170419,0.000008151243,0.98272026,0.0006088191,0.014905688,0.0015919207,0.000008337576],"about_ca_topic_score_codex":0.0031884126,"about_ca_topic_score_gemma":0.0039683776,"teacher_disagreement_score":0.004116795,"about_ca_system_score_codex":0.0008746385,"about_ca_system_score_gemma":0.0018712219,"threshold_uncertainty_score":0.01697588},"labels":[],"label_agreement":null},{"id":"W1910269293","doi":"10.1109/cibcb.2015.7300296","title":"Interactive evolution instead of default parameters","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Casual; Human–computer interaction; Software; Task (project management); Simple (philosophy); User interface; Interface (matter); Control (management); Distributed computing; Artificial intelligence; Programming language; Operating system","score_opus":0.02947235008307265,"score_gpt":0.27189821693683247,"score_spread":0.24242586685375983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1910269293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046617486,0.0002102027,0.9084015,0.00048105392,0.00012410975,0.00015147452,0.000384592,0.032074835,0.011554723],"genre_scores_gemma":[0.45979878,0.0002748307,0.50925446,0.001143778,0.0000851848,0.00056799594,0.0010790259,0.009884759,0.017911173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818486,0.00072825426,0.000120656936,0.00042223878,0.00041746764,0.00012650155],"domain_scores_gemma":[0.99226147,0.0050689513,0.0002572292,0.0016564648,0.0005040546,0.00025179342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031150233,0.0010536185,0.00060110784,0.0005335517,0.00043911484,0.0017756451,0.0020944024,0.0015280202,0.016629234],"category_scores_gemma":[0.014910958,0.0005519986,0.00074995117,0.0004170974,0.0011182331,0.0035536874,0.0027582112,0.0017612485,0.002362447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035317596,0.00083600334,0.011054272,0.0009882547,0.00026859794,0.0010366029,0.007097214,0.030750286,0.23236185,0.091765694,0.04898906,0.5713205],"study_design_scores_gemma":[0.0005569999,0.0008577597,0.007283899,0.0003086707,0.00023390989,0.0019381983,0.0008055516,0.36346117,0.20177944,0.06890809,0.35345906,0.00040728238],"about_ca_topic_score_codex":0.00050464587,"about_ca_topic_score_gemma":0.0005142983,"teacher_disagreement_score":0.016629234,"about_ca_system_score_codex":0.0003832646,"about_ca_system_score_gemma":0.0003447337,"threshold_uncertainty_score":0.055630386},"labels":[],"label_agreement":null},{"id":"W1914928883","doi":"10.1109/incos.2015.54","title":"Energy Availability Forecasting for Harvesting-aware Wireless Sensor Networks: Analysis of Energy Demand of a Predictor Based on Evolutionary Fuzzy Rules","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Fuzzy logic; Efficient energy use; Energy (signal processing); Energy harvesting; Energy management; Evolutionary algorithm; Reliability (semiconductor); Microcontroller; Reliability engineering; Real-time computing; Embedded system; Distributed computing; Power (physics); Engineering; Artificial intelligence; Computer network","score_opus":0.031021737575516045,"score_gpt":0.23970205845565487,"score_spread":0.20868032088013883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914928883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8689089,0.00014479968,0.12912975,0.0000987804,0.0000125472425,0.000037875554,0.00007354085,0.00010426029,0.0014896462],"genre_scores_gemma":[0.9918617,0.000042047395,0.007854162,0.0000051662705,0.0000016147968,0.000014715833,0.000032193046,0.000004405909,0.00018394626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997956,0.000044922752,0.0000141246965,0.00004051159,0.000080032536,0.000024852105],"domain_scores_gemma":[0.9985135,0.0010983464,0.00009051572,0.00006697018,0.0002052859,0.000025376043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081512396,0.00032679885,0.00040163798,0.00037307118,0.0002303738,0.00030441617,0.00044525365,0.0004173464,0.0004060858],"category_scores_gemma":[0.0032590816,0.00015759698,0.00028055796,0.00034063714,0.00021421899,0.0004434029,0.00014725221,0.0004073051,0.00006175445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021863672,0.00008213582,0.0076167905,0.000050975224,0.000031426764,0.00010073247,0.00006997726,0.95331776,0.0109037915,0.001022601,0.00010591806,0.026479265],"study_design_scores_gemma":[0.0000013479812,0.000019948688,0.0013366102,0.00000162061,0.0000036062909,0.000011494361,0.000005440369,0.9966511,0.0017904004,0.00015435445,0.000021821663,0.0000022126305],"about_ca_topic_score_codex":0.0051573156,"about_ca_topic_score_gemma":0.0031816335,"teacher_disagreement_score":0.0051573156,"about_ca_system_score_codex":0.0004514324,"about_ca_system_score_gemma":0.0003060846,"threshold_uncertainty_score":0.0102546215},"labels":[],"label_agreement":null},{"id":"W192439236","doi":"10.1007/978-3-642-41888-4_16","title":"Fitness Morphs and Nonlinear Projections of Agent-Case Embeddings to Characterize Fitness Landscapes","year":2013,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Guelph","funders":"","keywords":"Fitness landscape; Cellular automaton; Set (abstract data type); Euclidean space; Computer science; Metric (unit); Fitness approximation; Representation (politics); Artificial intelligence; Theoretical computer science; Mathematics; Machine learning; Fitness function; Genetic algorithm; Combinatorics","score_opus":0.05144254749948868,"score_gpt":0.28126428168967466,"score_spread":0.22982173419018598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192439236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22284506,0.000821759,0.75760585,0.0006160815,0.000067333,0.000081507205,0.00027626805,0.0002079076,0.017478235],"genre_scores_gemma":[0.8823976,0.00044157758,0.110525385,0.0000735644,0.000054577933,0.00009861802,0.0003819584,0.00014349548,0.0058831824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997421,0.0000983942,0.000016886144,0.00005256416,0.00006240427,0.00002754807],"domain_scores_gemma":[0.9987306,0.0006778943,0.00014983171,0.00019720811,0.00013978443,0.00010479149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523836,0.0005547654,0.00038849402,0.001121896,0.00037517704,0.0014710439,0.00060077396,0.0008160064,0.0031347957],"category_scores_gemma":[0.0051605143,0.00026501925,0.0005520475,0.000771838,0.0015167334,0.00287125,0.0012931796,0.0014515091,0.00033067627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011068263,0.00009317514,0.004774803,0.00011310918,0.000053256026,0.00016522898,0.00052281003,0.20808606,0.0060552796,0.70936406,0.0023561446,0.06830545],"study_design_scores_gemma":[0.0000045222946,0.000023343926,0.0013169631,0.000016650632,0.000007048385,0.00010841084,0.00009201849,0.6975648,0.0004565122,0.2993459,0.0010501232,0.000013740134],"about_ca_topic_score_codex":0.00080931577,"about_ca_topic_score_gemma":0.0009108503,"teacher_disagreement_score":0.0031347957,"about_ca_system_score_codex":0.00076431094,"about_ca_system_score_gemma":0.00027103003,"threshold_uncertainty_score":0.010486901},"labels":[],"label_agreement":null},{"id":"W193823973","doi":"","title":"Analysis of a restricted test case set for a sorting network genetic algorithm","year":2007,"lang":"en","type":"article","venue":"Conference on Artificial Intelligence for Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Sorting; Sorting network; Measure (data warehouse); Computer science; Genetic algorithm; Set (abstract data type); Sorting algorithm; Evolutionary algorithm; Test (biology); Quality (philosophy); Algorithm; Machine learning; Artificial intelligence; Data mining","score_opus":0.08506752857658785,"score_gpt":0.35452879918198543,"score_spread":0.2694612706053976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193823973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78384095,0.00017950954,0.20914595,0.00038300463,0.000020409776,0.00041711374,0.0006256593,0.00066859747,0.0047188727],"genre_scores_gemma":[0.88287,0.000045592365,0.11469016,0.000076649485,0.000011289422,0.00035284294,0.0012770853,0.00012774067,0.00054869556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913498,0.003864034,0.00039740757,0.00062798016,0.0032457213,0.000514899],"domain_scores_gemma":[0.89369583,0.09517668,0.0020533116,0.0039706365,0.0043924786,0.0007110328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0088110715,0.0007147252,0.0009723948,0.0028574239,0.0006092637,0.0013438117,0.0017223032,0.0014193829,0.0032294698],"category_scores_gemma":[0.08470004,0.00044035327,0.0013446541,0.001490429,0.0012085111,0.0013083807,0.0009137022,0.0012531839,0.00024296723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008873673,0.0006790202,0.014828526,0.00024780058,0.00025253018,0.000985144,0.00020009177,0.9155508,0.008556571,0.009676761,0.0011289505,0.047006443],"study_design_scores_gemma":[0.000085577594,0.00021058503,0.0027643023,0.000017937336,0.000048176436,0.00017139767,0.000054476794,0.9894314,0.0037099973,0.0031785383,0.00031447897,0.000013069132],"about_ca_topic_score_codex":0.004021466,"about_ca_topic_score_gemma":0.0034034194,"teacher_disagreement_score":0.0088110715,"about_ca_system_score_codex":0.0016843894,"about_ca_system_score_gemma":0.0013567972,"threshold_uncertainty_score":0.046597958},"labels":[],"label_agreement":null},{"id":"W1950070584","doi":"10.1007/978-3-540-78671-9_25","title":"Cooperative Problem Decomposition in Pareto Competitive Classifier Models of Coevolution","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Pareto principle; Classifier (UML); Artificial intelligence; Coevolution; Modularity (biology); Population; Machine learning; Mathematical optimization; Pareto optimal; Multi-objective optimization; Mathematics","score_opus":0.019881005426592532,"score_gpt":0.25393094741623956,"score_spread":0.23404994198964701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1950070584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03553556,0.0005572797,0.9505979,0.0005880901,0.00006118462,0.00008116018,0.00005006614,0.00009944466,0.012429368],"genre_scores_gemma":[0.74279886,0.00079374615,0.22522028,0.00032057904,0.00017679136,0.00053462386,0.0002472619,0.00013987615,0.029767858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985898,0.0007182991,0.000051191848,0.00021005515,0.00027997323,0.00015060892],"domain_scores_gemma":[0.99631137,0.0023897858,0.00020872278,0.00034058784,0.00054677966,0.00020279808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028414272,0.00085743814,0.001587241,0.00089276955,0.00083175325,0.0025471407,0.0024656819,0.002625275,0.004984965],"category_scores_gemma":[0.009656134,0.0007308181,0.0012067857,0.0011091665,0.0017807821,0.0031257248,0.0020957752,0.0021378826,0.0008302998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000862782,0.00012490209,0.0005505481,0.00009809401,0.00007030803,0.00008365968,0.00025450822,0.5408667,0.0009277798,0.412419,0.003506691,0.04101149],"study_design_scores_gemma":[0.00000658583,0.0000104057835,0.00004654258,0.000005178544,0.0000064402125,0.000012974831,0.000015558991,0.9333866,0.00006171885,0.06612723,0.00031647595,0.0000042880733],"about_ca_topic_score_codex":0.0035105292,"about_ca_topic_score_gemma":0.0025971963,"teacher_disagreement_score":0.004984965,"about_ca_system_score_codex":0.0015226897,"about_ca_system_score_gemma":0.001268649,"threshold_uncertainty_score":0.016676426},"labels":[],"label_agreement":null},{"id":"W1956399340","doi":"","title":"Discriminant Feature Selection by Genetic Programming: Towards a domain independent multi-class object detection system.","year":2005,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Feature selection; Genetic programming; Artificial intelligence; Pattern recognition (psychology); Discriminant; Class (philosophy); Computer science; Linear discriminant analysis; Selection (genetic algorithm); Domain (mathematical analysis); Object (grammar); Feature (linguistics); Machine learning; Mathematics","score_opus":0.0923641545439538,"score_gpt":0.4554306298013764,"score_spread":0.3630664752574226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956399340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006180315,0.00012363057,0.9922626,0.000108936416,0.000020023606,0.000033264816,0.000013924007,0.0005345554,0.0007228163],"genre_scores_gemma":[0.08676654,0.00013191407,0.91104054,0.00013987022,0.000020961901,0.000088768305,0.00006938064,0.00007580326,0.0016662276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962044,0.00010779135,0.000012644864,0.00009324285,0.00013668297,0.000029199507],"domain_scores_gemma":[0.99953604,0.00019820331,0.000055774173,0.000047745318,0.00012842595,0.00003377926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134317,0.0004966271,0.00059195346,0.00089882145,0.00037579236,0.0008645782,0.0011296882,0.0010336491,0.00088631944],"category_scores_gemma":[0.001976803,0.00028066122,0.00047690715,0.0007708634,0.0006286671,0.0006414149,0.0006726829,0.0009765648,0.00054129347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014566415,0.00014993259,0.002267351,0.0001258779,0.00010482125,0.00021824175,0.00021796241,0.15746628,0.045557424,0.020473177,0.0034864377,0.7697868],"study_design_scores_gemma":[0.000014293885,0.000049887276,0.000529462,0.000015492475,0.000019934017,0.000119596,0.000027556389,0.97617674,0.008383604,0.011265864,0.00338451,0.000013075816],"about_ca_topic_score_codex":0.0019416256,"about_ca_topic_score_gemma":0.0018626172,"teacher_disagreement_score":0.0019416256,"about_ca_system_score_codex":0.00048740814,"about_ca_system_score_gemma":0.0006423475,"threshold_uncertainty_score":0.0059989095},"labels":[],"label_agreement":null},{"id":"W1961525806","doi":"10.1109/cec.2004.1331176","title":"Maintaining diversity and increasing the accuracy of classification rules through automatic speciation","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic algorithm; Computer science; Subspecies; Artificial intelligence; Machine learning; Diversity (politics); Class (philosophy); Set (abstract data type); Data mining; Biology; Evolutionary biology; Ecology","score_opus":0.03590550162497821,"score_gpt":0.2680311957703238,"score_spread":0.2321256941453456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1961525806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56462044,0.0005294343,0.42722425,0.00082373834,0.000056468816,0.00012814687,0.00012718662,0.0012038813,0.0052864878],"genre_scores_gemma":[0.82615334,0.00010122249,0.17242618,0.00016195158,0.000049110953,0.000056631576,0.000261157,0.00009262285,0.00069779373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914914,0.003999154,0.00076452096,0.0012555439,0.001997973,0.0004914115],"domain_scores_gemma":[0.9520079,0.03293226,0.003356983,0.0064348034,0.0048153335,0.0004527387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012291705,0.0008626977,0.0014648081,0.0029995278,0.0010990691,0.002625892,0.0021477605,0.0015573329,0.00095757394],"category_scores_gemma":[0.044700466,0.00044765644,0.0008541364,0.001819563,0.0013036919,0.0039156345,0.002237059,0.0015812913,0.00059321575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032650976,0.00044574824,0.04947075,0.0002522581,0.00034732756,0.00024978493,0.0010584154,0.16631128,0.030283097,0.008999903,0.0018858615,0.7403691],"study_design_scores_gemma":[0.000073952,0.00038196344,0.011907228,0.00007175867,0.00014593605,0.0005557084,0.00029297266,0.9255143,0.029248891,0.02876257,0.0029739283,0.000070783055],"about_ca_topic_score_codex":0.00091871823,"about_ca_topic_score_gemma":0.0015021482,"teacher_disagreement_score":0.012291705,"about_ca_system_score_codex":0.00072907656,"about_ca_system_score_gemma":0.0009336829,"threshold_uncertainty_score":0.06500548},"labels":[],"label_agreement":null},{"id":"W1963955771","doi":"10.1142/s146902680300080x","title":"MAPPING REFERENCE CODE TO IRREGULAR DSPS WITHIN THE RETARGETABLE, OPTIMIZING COMPILER COGEN(T)","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Unreachable code; Dead code; Compiler; Parallel computing; Code generation; Programming language; Code (set theory); Object code; Redundant code; Set (abstract data type); Schedule; Abstraction; Dead code elimination; Operating system","score_opus":0.041280316975775395,"score_gpt":0.30289987243902566,"score_spread":0.2616195554632503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963955771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20244147,0.00016348482,0.7782496,0.00014651386,0.00005322858,0.00012359301,0.00012251256,0.008360561,0.010338921],"genre_scores_gemma":[0.3855797,0.000120826684,0.6085111,0.000101518504,0.000010182262,0.00008530326,0.00030741422,0.0010628664,0.0042210463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998318,0.000024351652,0.000008988989,0.000045343397,0.00006449257,0.000025069388],"domain_scores_gemma":[0.9996563,0.00009262428,0.000037928014,0.00011294751,0.000088630186,0.000011598972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028631254,0.00026496692,0.00022129694,0.00029152344,0.00022573335,0.0004944352,0.0006421501,0.00033840133,0.0013440095],"category_scores_gemma":[0.0010773275,0.00019283182,0.00023686099,0.00031948127,0.00052744674,0.00045209195,0.00036500025,0.0005193009,0.00036523223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039403944,0.00013290317,0.0023309165,0.00023260457,0.000035508998,0.0004891489,0.0005168315,0.38635403,0.13797536,0.074267745,0.0060906783,0.39118022],"study_design_scores_gemma":[0.00008244586,0.00027961863,0.00089744385,0.000029239645,0.000029318218,0.0003632891,0.000066731234,0.82351035,0.12691556,0.016121307,0.031674102,0.00003066791],"about_ca_topic_score_codex":0.0012613499,"about_ca_topic_score_gemma":0.0016799027,"teacher_disagreement_score":0.0013440095,"about_ca_system_score_codex":0.00036515898,"about_ca_system_score_gemma":0.0006873378,"threshold_uncertainty_score":0.0044960976},"labels":[],"label_agreement":null},{"id":"W1964029556","doi":"10.2316/journal.201.2010.3.201-2025","title":"CONTROL OF CHAOS BY OPTIMAL DESIGN OF DC–DC CONVERTER USING GENETIC ALGORITHM","year":2010,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"CHAOS (operating system); Converters; Control theory (sociology); Chaotic; Genetic algorithm; Power (physics); Computer science; Mode (computer interface); Control (management); Algorithm; Physics; Artificial intelligence; Machine learning","score_opus":0.015436938168782742,"score_gpt":0.23248775239229316,"score_spread":0.2170508142235104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964029556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028803673,0.0003216293,0.96575445,0.000115165225,0.00003125106,0.000050100138,0.000008931498,0.00015976274,0.004754922],"genre_scores_gemma":[0.76822823,0.0004229266,0.2292275,0.00005537024,0.000025249969,0.00016819953,0.000027116452,0.00004151305,0.0018038519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987864,0.00003121249,0.0000055351893,0.000018406416,0.000053382057,0.000012887817],"domain_scores_gemma":[0.99990106,0.00003913861,0.000016343914,0.0000078715,0.000030346539,0.000005241689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032029004,0.0003868566,0.00044749584,0.00034694388,0.00030720458,0.00052158337,0.0004992185,0.00041980977,0.0005705389],"category_scores_gemma":[0.0004749636,0.00026474774,0.00038307442,0.0002914912,0.00046910864,0.00023854696,0.00025363063,0.00042153912,0.00010908097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004540626,0.000037405385,0.00044945296,0.000074601776,0.00004990256,0.000057847697,0.00007649015,0.9039274,0.018464409,0.017872278,0.0004278169,0.058516946],"study_design_scores_gemma":[0.000018264453,0.000033309007,0.000104090104,0.0000064669885,0.0000107584065,0.000018820503,0.000005391707,0.9949869,0.0019977258,0.001960578,0.0008529724,0.000004703811],"about_ca_topic_score_codex":0.0014114731,"about_ca_topic_score_gemma":0.0014981149,"teacher_disagreement_score":0.0014114731,"about_ca_system_score_codex":0.00036708283,"about_ca_system_score_gemma":0.00064480276,"threshold_uncertainty_score":0.0028065443},"labels":[],"label_agreement":null},{"id":"W1967703293","doi":"10.1007/s10710-006-9015-5","title":"Estimation of evolvability genetic algorithm and dynamic environments","year":2006,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Evolvability; Computer science; Genetic algorithm; Evolutionary computation; Computation; Evolutionary algorithm; Population; Selection (genetic algorithm); Artificial intelligence; Algorithm; Mathematical optimization; Machine learning; Evolutionary biology; Mathematics; Biology","score_opus":0.003496496500966776,"score_gpt":0.2117898430544903,"score_spread":0.20829334655352352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967703293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24138057,0.00046312323,0.7547753,0.00016717048,0.000023151148,0.000032771197,0.000043865966,0.00026448938,0.0028494536],"genre_scores_gemma":[0.93111783,0.0001631246,0.067639485,0.000015506112,0.000013635764,0.000035426714,0.00007736253,0.00004744458,0.00089025777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928755,0.00028724977,0.000022054921,0.00014481119,0.00020096688,0.00005742333],"domain_scores_gemma":[0.99447423,0.004300797,0.00032935455,0.00034853205,0.00044797,0.0000991406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010703171,0.00051794865,0.00053925806,0.0017101804,0.00032919634,0.0008796603,0.0008072351,0.0009078092,0.0009274883],"category_scores_gemma":[0.014530682,0.0003438339,0.00041482435,0.0009319107,0.00085533527,0.0014709557,0.0007812953,0.0007150597,0.00012642032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683208,0.000037376507,0.004811158,0.000034855515,0.00004679778,0.000060872928,0.000041532247,0.93134576,0.0028702267,0.010509754,0.00016164531,0.049953163],"study_design_scores_gemma":[0.0000045875317,0.000020951908,0.001128727,0.0000045641063,0.0000065568183,0.000032039956,0.0000085774245,0.9917026,0.0009518396,0.006009031,0.0001247077,0.000005785506],"about_ca_topic_score_codex":0.0021254627,"about_ca_topic_score_gemma":0.00093847007,"teacher_disagreement_score":0.0021254627,"about_ca_system_score_codex":0.0008065838,"about_ca_system_score_gemma":0.0005043605,"threshold_uncertainty_score":0.0058522224},"labels":[],"label_agreement":null},{"id":"W1967797406","doi":"10.1109/cig.2014.6932910","title":"Comparing the structure of probabilistic 4- and 8-state finite transducer representations for Prisoner's Dilemma","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Pairwise comparison; Probabilistic logic; Multidimensional scaling; Embedding; Computer science; Representation (politics); Cluster analysis; Theoretical computer science; Euclidean distance; Euclidean geometry; Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.020896703124361874,"score_gpt":0.2579016915020231,"score_spread":0.2370049883776612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967797406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81449246,0.00026644152,0.17663345,0.00057083706,0.00003137953,0.00008532957,0.00032929625,0.00029818446,0.0072926064],"genre_scores_gemma":[0.97577363,0.0000878431,0.022185,0.000053226264,0.0000074760464,0.00010420252,0.000307576,0.00005331054,0.0014277189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993794,0.00025286406,0.000044843495,0.00012122545,0.00011621383,0.00008549024],"domain_scores_gemma":[0.9943164,0.003951824,0.0005334163,0.0006160357,0.00036130237,0.00022102152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012950776,0.00022937327,0.0006065906,0.0009601004,0.0005748659,0.0014495524,0.0008578198,0.0011102251,0.004392522],"category_scores_gemma":[0.012391695,0.0002872268,0.0005268126,0.00065778155,0.0017552819,0.0027955596,0.0009533288,0.0008555048,0.00028437338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033516245,0.00012113419,0.0045637744,0.00018331037,0.00004724216,0.00021052726,0.0012638535,0.38398522,0.004038763,0.57440853,0.0012074925,0.029634885],"study_design_scores_gemma":[0.000027024927,0.00009029391,0.0009359798,0.000017460192,0.000012543321,0.000060644405,0.00025913393,0.73366314,0.00077670073,0.2634664,0.00066154246,0.00002913274],"about_ca_topic_score_codex":0.002498965,"about_ca_topic_score_gemma":0.0021732345,"teacher_disagreement_score":0.004392522,"about_ca_system_score_codex":0.0013920446,"about_ca_system_score_gemma":0.0011830245,"threshold_uncertainty_score":0.014694512},"labels":[],"label_agreement":null},{"id":"W1970624954","doi":"10.5555/2025756.2025766","title":"Basic object oriented genetic programming","year":2011,"lang":"en","type":"article","venue":"International Conference Industrial, Engineering & Other Applications Applied Intelligent Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Computer science; Object (grammar); Object-oriented programming; Programming language; Theoretical computer science; Linear programming; Parity (physics); Algorithm; Artificial intelligence","score_opus":0.06662924958501129,"score_gpt":0.25454613978348095,"score_spread":0.18791689019846966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970624954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062050954,0.00035743104,0.9340345,0.00019701019,0.00018343118,0.000104371815,0.00015429406,0.0021090421,0.056654777],"genre_scores_gemma":[0.10271922,0.0009772433,0.839544,0.00028404043,0.000097460885,0.00031192077,0.00087027217,0.00069238927,0.054503314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998416,0.000025011293,0.000008250359,0.000025882628,0.00008098962,0.00001832969],"domain_scores_gemma":[0.9999049,0.000024259894,0.000005050955,0.000025152622,0.000031495638,0.000009248078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002899388,0.00034291224,0.0003479331,0.0004544218,0.00038524685,0.0010434884,0.00089285587,0.0007368062,0.010491843],"category_scores_gemma":[0.0004413383,0.0002247684,0.0005477721,0.0005989418,0.00036705798,0.0004616028,0.0004920878,0.0008168622,0.003016581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008207618,0.0001385311,0.00057076925,0.0001978567,0.000053459862,0.00016712701,0.0001943563,0.041192543,0.020742737,0.39580336,0.011287112,0.5295701],"study_design_scores_gemma":[0.0001224995,0.00014892181,0.0010285925,0.00019610552,0.00010315669,0.0005699107,0.00006666671,0.32338202,0.023245817,0.28286472,0.36820725,0.00006433815],"about_ca_topic_score_codex":0.0007689027,"about_ca_topic_score_gemma":0.00083468965,"teacher_disagreement_score":0.010491843,"about_ca_system_score_codex":0.00027695682,"about_ca_system_score_gemma":0.000503921,"threshold_uncertainty_score":0.03509873},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018857817653916253,"score_gpt":0.23221462587852326,"score_spread":0.213356808224607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970756392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857826,0.0009262238,0.011301352,0.00018306957,0.000054000968,0.00004038908,0.0007181137,0.000053288783,0.0009407658],"genre_scores_gemma":[0.9743747,0.001119468,0.013294633,0.00015743906,0.00004529953,0.00007385258,0.006701806,0.00013580616,0.0040969765],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998241,0.000031827334,0.000025982263,0.000042453587,0.000045551435,0.000030133342],"domain_scores_gemma":[0.9995036,0.00014103245,0.000106736836,0.00008984166,0.00007164517,0.0000871868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000389269,0.00034289455,0.00027040747,0.00031614472,0.00025939284,0.00044462996,0.0003252643,0.00045094598,0.0019052732],"category_scores_gemma":[0.00043407778,0.00022145017,0.00038938943,0.00018516078,0.0002912645,0.00028955258,0.00023734702,0.00082242984,0.0010071286],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008876288,0.000023814953,0.00040105192,0.000019317524,0.000007770287,0.00016297631,0.000017401175,0.0001009,0.9979785,0.00023994174,0.000047870828,0.00091174897],"study_design_scores_gemma":[0.00003494311,0.00022592374,0.0061927317,0.0000068181303,0.000041806517,0.002187355,0.000054316457,0.0027046858,0.98050517,0.00017842202,0.007857531,0.000010232122],"about_ca_topic_score_codex":0.0001776511,"about_ca_topic_score_gemma":0.00039340474,"teacher_disagreement_score":0.0019052732,"about_ca_system_score_codex":0.0002102356,"about_ca_system_score_gemma":0.0001242442,"threshold_uncertainty_score":0.006373763},"labels":[],"label_agreement":null},{"id":"W1970757919","doi":"10.1007/s10710-012-9159-4","title":"Evolutionary dynamics on multiple scales: a quantitative analysis of the interplay between genotype, phenotype, and fitness in linear genetic programming","year":2012,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Robustness (evolution); Genetic programming; Neutral network; Computer science; Fitness landscape; Phenotype; Neutrality; Neutral mutation; Genotype; Evolutionary algorithm; Biology; Evolutionary dynamics; Evolutionary biology; Genetics; Artificial intelligence; Population; Gene","score_opus":0.012921765718736695,"score_gpt":0.2800358134837032,"score_spread":0.2671140477649665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970757919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4296201,0.0007535131,0.5542545,0.0021988386,0.000060375314,0.00004193838,0.00006285546,0.00020563796,0.012802172],"genre_scores_gemma":[0.9833878,0.00017111146,0.014441891,0.00006447799,0.000039706923,0.000032590615,0.000013866222,0.00007584029,0.0017725913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950755,0.00023258352,0.000013536578,0.000070859736,0.000116780044,0.00005861501],"domain_scores_gemma":[0.9957859,0.0031930287,0.00042605517,0.00020848382,0.00017913905,0.0002074592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013903268,0.00038653996,0.0006371979,0.00061006326,0.00047093007,0.0017747789,0.00089671795,0.0009831402,0.0021273599],"category_scores_gemma":[0.010048943,0.0004474894,0.00047966742,0.0005331648,0.0019840836,0.0022770998,0.0010690342,0.0011800021,0.00013643983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052121173,0.00006692485,0.0036355124,0.000077092416,0.00008206892,0.00021848154,0.00033431564,0.62080413,0.0080575915,0.35065615,0.00069909985,0.0153165385],"study_design_scores_gemma":[0.00000664064,0.000014596479,0.0015812801,0.0000056867834,0.00000896817,0.000035908102,0.000040661478,0.92412776,0.0001977594,0.073755525,0.00020944783,0.00001581904],"about_ca_topic_score_codex":0.001715636,"about_ca_topic_score_gemma":0.0010475651,"teacher_disagreement_score":0.0021273599,"about_ca_system_score_codex":0.00089606165,"about_ca_system_score_gemma":0.0004956009,"threshold_uncertainty_score":0.007352829},"labels":[],"label_agreement":null},{"id":"W1971470684","doi":"10.1109/cibcb.2008.4675788","title":"Transience in the simulation of ring species","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Ring (chemistry); Fertility; Population; Computer science; Robot; Terminal (telecommunication); Grid; Point (geometry); Task (project management); Artificial intelligence; Ecology; Biology; Evolutionary biology; Engineering; Mathematics; Computer network; Demography","score_opus":0.039768860782249206,"score_gpt":0.25740690799024946,"score_spread":0.21763804720800026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971470684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9529381,0.00008077442,0.04019193,0.0002474006,0.000023636,0.000034085213,0.00006179362,0.0001429239,0.006279388],"genre_scores_gemma":[0.99105376,0.00002930046,0.00778638,0.000026148573,0.0000023856264,0.000043119686,0.00004092621,0.000020322137,0.0009977721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998596,0.000058281526,0.0000066802863,0.000018271798,0.000024414065,0.000032758293],"domain_scores_gemma":[0.9986222,0.0009929767,0.000110971276,0.00007118761,0.000079883815,0.00012280425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054335676,0.0002679504,0.00040010517,0.00047544736,0.00045002552,0.0005142375,0.00067447615,0.0007186969,0.002726804],"category_scores_gemma":[0.0041676294,0.0002573929,0.00040280956,0.00028725364,0.0009870469,0.0006716397,0.00075973826,0.0006400787,0.0001626801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054254957,0.000030180303,0.0019837467,0.0000135056935,0.000009282133,0.000059579914,0.00008012722,0.9914181,0.0006923665,0.004164445,0.00010452454,0.0013898372],"study_design_scores_gemma":[0.0000140533375,0.000028062977,0.00023122039,0.0000024842427,0.0000022557097,0.000007413835,0.000020252213,0.99810094,0.00016351508,0.0012960143,0.00013111944,0.000002635246],"about_ca_topic_score_codex":0.005907999,"about_ca_topic_score_gemma":0.0038842717,"teacher_disagreement_score":0.005907999,"about_ca_system_score_codex":0.0007746905,"about_ca_system_score_gemma":0.00041699328,"threshold_uncertainty_score":0.011747241},"labels":[],"label_agreement":null},{"id":"W1972314940","doi":"10.1007/s10845-008-0175-4","title":"Simultaneous optimization of parts and operations sequences in SSMS: a chaos embedded Taguchi particle swarm optimization approach","year":2008,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Chaotic; Taguchi methods; Multi-swarm optimization; Mathematical optimization; Genetic algorithm; Set (abstract data type); Machining; Meta-optimization; Swarm behaviour; Engineering; Computer science; Algorithm; Mathematics; Artificial intelligence; Machine learning; Mechanical engineering","score_opus":0.022387963457414013,"score_gpt":0.2476547388629086,"score_spread":0.22526677540549458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972314940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04578374,0.00013614698,0.9521812,0.000067736575,0.000031212046,0.000058121288,0.000014771281,0.00010272288,0.001624411],"genre_scores_gemma":[0.74300224,0.000171682,0.25315034,0.0000639494,0.000027672786,0.00028165607,0.000044516037,0.00006293785,0.0031950914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999694,0.00010302773,0.000021837079,0.000048718863,0.00009888841,0.000033529104],"domain_scores_gemma":[0.9994411,0.00032584823,0.00008101488,0.00003463181,0.00009576085,0.000021628426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083366473,0.00081175996,0.0012654671,0.00061267137,0.00041407527,0.0009250278,0.0007042489,0.0012303249,0.0011952685],"category_scores_gemma":[0.0013699849,0.00084138947,0.0010410557,0.0007113446,0.00052356103,0.00091521,0.0005601721,0.00065812614,0.00019571705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048930262,0.00004123269,0.00028031282,0.000045315628,0.000030982454,0.000019659326,0.000029849287,0.97225237,0.0038668984,0.0019319084,0.00008131586,0.02137123],"study_design_scores_gemma":[0.000005617117,0.000056123754,0.000073701136,0.000002371203,0.000011269639,0.0000036157426,0.0000043456907,0.99859446,0.0007381822,0.00041499553,0.00009277666,0.0000024523642],"about_ca_topic_score_codex":0.002905381,"about_ca_topic_score_gemma":0.0028654265,"teacher_disagreement_score":0.002905381,"about_ca_system_score_codex":0.0005001456,"about_ca_system_score_gemma":0.0012128333,"threshold_uncertainty_score":0.005776942},"labels":[],"label_agreement":null},{"id":"W1973368448","doi":"10.1145/1138470.1138473","title":"Open BEAGLE","year":2006,"lang":"en","type":"article","venue":"ACM SIGEVOlution","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Crossover; Software; Evolutionary algorithm; Theoretical computer science; Evolutionary computation; Variation (astronomy); Listing (finance); Software evolution; Software engineering; Programming language; Software system; Artificial intelligence; Software construction","score_opus":0.01794381408884477,"score_gpt":0.2636760968243031,"score_spread":0.24573228273545833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973368448","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044783982,0.0014322171,0.25367603,0.0025624367,0.0013615341,0.0005526143,0.03661405,0.43727383,0.2620489],"genre_scores_gemma":[0.082410745,0.003150667,0.19805223,0.0034864114,0.00058654643,0.0016618682,0.23123753,0.19299868,0.28641543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983498,0.000265492,0.000115888135,0.00036947447,0.0006398596,0.0002595772],"domain_scores_gemma":[0.99781954,0.000518033,0.000111194786,0.0009124048,0.00038850345,0.00025035394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019057539,0.0012391979,0.0014020858,0.002326235,0.0015030741,0.0050365506,0.0057042306,0.0029021078,0.20459417],"category_scores_gemma":[0.008327119,0.0009966918,0.0016118375,0.0027422742,0.0011297469,0.009798096,0.0067630094,0.0025778029,0.129657],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000833672,0.00017755911,0.0013083633,0.0006938129,0.00008724779,0.00045101266,0.00035336876,0.0034407375,0.002292823,0.07012203,0.73459375,0.18564561],"study_design_scores_gemma":[0.00007687553,0.00002227642,0.0003349754,0.00013078714,0.000019414021,0.0002003645,0.00006794329,0.00531181,0.0013749842,0.03518026,0.9572427,0.00003771569],"about_ca_topic_score_codex":0.0033877352,"about_ca_topic_score_gemma":0.0029214295,"teacher_disagreement_score":0.20459417,"about_ca_system_score_codex":0.00081496703,"about_ca_system_score_gemma":0.0014729026,"threshold_uncertainty_score":0.68443567},"labels":[],"label_agreement":null},{"id":"W1974873444","doi":"10.1016/j.procs.2013.06.065","title":"Software Evolution as SaaS: Evolution of Intelligent Design in Cloud","year":2013,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Software evolution; Computer science; Evolvability; Software engineering; Software development; Software; Software as a service; Cloud computing; Software system; Inheritance (genetic algorithm); Software construction; Data science; Programming language","score_opus":0.014486930275159293,"score_gpt":0.23873079679132056,"score_spread":0.22424386651616127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974873444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493249,0.0019404748,0.7990195,0.003883175,0.00024123534,0.00020372293,0.00009303653,0.00067464216,0.044619255],"genre_scores_gemma":[0.72671014,0.0013731392,0.2604624,0.00027585076,0.000057159377,0.0001318047,0.00012110788,0.00016366092,0.010704743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891424,0.00052106444,0.00005302557,0.00014527018,0.00026557097,0.00010088804],"domain_scores_gemma":[0.9985757,0.0003565524,0.000214741,0.0004856341,0.00022597052,0.00014139821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014557303,0.0003261925,0.00031011342,0.00060150673,0.0009408013,0.0024905328,0.001029032,0.0008642211,0.0020646162],"category_scores_gemma":[0.004140174,0.0002564816,0.0006319829,0.0008815314,0.0016726396,0.0024661536,0.0017110679,0.0011867491,0.00040633033],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097603704,0.00012076244,0.0067366767,0.00020036288,0.0001069598,0.0004147416,0.001678272,0.12616396,0.010540865,0.73021275,0.0029683234,0.120758735],"study_design_scores_gemma":[0.00004194827,0.0002012703,0.0032228995,0.00013215838,0.00008293418,0.0008475267,0.0008471663,0.47386348,0.0066324477,0.42067283,0.09339393,0.00006148614],"about_ca_topic_score_codex":0.0027905963,"about_ca_topic_score_gemma":0.002088935,"teacher_disagreement_score":0.0027905963,"about_ca_system_score_codex":0.0014860026,"about_ca_system_score_gemma":0.0016956934,"threshold_uncertainty_score":0.010781765},"labels":[],"label_agreement":null},{"id":"W1976292963","doi":"10.1109/tla.2005.1642441","title":"Generating Ensemble of Classifiers through Unsupervised Feature Selection","year":2005,"lang":"en","type":"article","venue":"IEEE Latin America Transactions","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Random subspace method; Artificial intelligence; Computer science; Feature selection; Hidden Markov model; Pattern recognition (psychology); Machine learning; Feature (linguistics); Selection (genetic algorithm); Cascading classifiers; Context (archaeology); Set (abstract data type); Ensemble learning; Support vector machine","score_opus":0.018618261006247614,"score_gpt":0.25185819096505613,"score_spread":0.23323992995880852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976292963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030713161,0.00015674182,0.9670934,0.0000626005,0.000044973192,0.00009768464,0.000056765683,0.0005929098,0.0011817915],"genre_scores_gemma":[0.39371738,0.00022821594,0.6018206,0.00017804383,0.00010768607,0.0003961648,0.0007781435,0.00019218642,0.002581601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904925,0.00020356823,0.000049741313,0.0002294015,0.00037270354,0.000095292016],"domain_scores_gemma":[0.99807537,0.0006493667,0.00015277257,0.00033054972,0.00070458115,0.000087331726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519517,0.00083148654,0.0014730961,0.0014342476,0.00055620493,0.0006161398,0.0010295719,0.00070888567,0.0010798291],"category_scores_gemma":[0.003770275,0.00039435792,0.000879828,0.00088398915,0.00029245185,0.0010810972,0.0009104242,0.0008853366,0.00071435404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013403744,0.00027209785,0.006939114,0.0001054878,0.00030707614,0.00023598521,0.00017498841,0.17619176,0.0318835,0.0047510616,0.004103686,0.7749013],"study_design_scores_gemma":[0.000019000323,0.00019456181,0.0020947969,0.000020692505,0.000097621836,0.00019643702,0.00006360552,0.9702571,0.015142175,0.007639085,0.00424456,0.00003039589],"about_ca_topic_score_codex":0.00091916084,"about_ca_topic_score_gemma":0.0015272778,"teacher_disagreement_score":0.0014730961,"about_ca_system_score_codex":0.00029888112,"about_ca_system_score_gemma":0.00060649985,"threshold_uncertainty_score":0.007149875},"labels":[],"label_agreement":null},{"id":"W1977005518","doi":"10.3758/bf03192711","title":"A comparison of the randomization test with theF test when error is skewed","year":2005,"lang":"en","type":"article","venue":"Behavior Research Methods","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Randomization; Resampling; Statistics; Test (biology); Mathematics; Skew; Type I and type II errors; Restricted randomization; Permutation (music); Computer science; Medicine; Randomized controlled trial; Surgery; Biology","score_opus":0.22585174721536294,"score_gpt":0.5473035776803988,"score_spread":0.3214518304650359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977005518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38591945,0.003748521,0.58447754,0.00339704,0.0032355606,0.0017673625,0.0022543308,0.0031906199,0.012009449],"genre_scores_gemma":[0.8112194,0.00060063985,0.17924076,0.00091656327,0.00084099744,0.0015507911,0.0020428104,0.0010552385,0.0025328165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.74754554,0.2131188,0.006158895,0.016276767,0.014402208,0.0024977708],"domain_scores_gemma":[0.094795376,0.8720709,0.006951395,0.017597472,0.006687056,0.0018978067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.17968693,0.0023493883,0.006097958,0.0065348987,0.0024698677,0.0028705292,0.008704313,0.007194445,0.01812955],"category_scores_gemma":[0.5512172,0.0009439128,0.0048982115,0.0056824274,0.008571453,0.011871213,0.004375354,0.004693603,0.0018568637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0796775,0.0033239145,0.09717745,0.003407009,0.011365506,0.0017936236,0.0030775035,0.061979182,0.0040888633,0.156678,0.029208776,0.5482227],"study_design_scores_gemma":[0.018610697,0.029463375,0.089197315,0.0010220418,0.004763146,0.0033291983,0.0030460227,0.6545733,0.009113087,0.1696565,0.015965864,0.0012594718],"about_ca_topic_score_codex":0.00283007,"about_ca_topic_score_gemma":0.0018971404,"teacher_disagreement_score":0.17968693,"about_ca_system_score_codex":0.0031088076,"about_ca_system_score_gemma":0.003682324,"threshold_uncertainty_score":0.9502867},"labels":[],"label_agreement":null},{"id":"W1977113926","doi":"10.1155/2010/409045","title":"Adaptive Representations for Improving Evolvability, Parameter Control, and Parallelization of Gene Expression Programming","year":2010,"lang":"en","type":"article","venue":"Applied Computational Intelligence and Soft Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gene expression programming; Evolvability; Computer science; Population; Representation (politics); Genetic programming; Tree (set theory); Symbolic regression; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Biology; Genetics","score_opus":0.022156313430246256,"score_gpt":0.2836967631056357,"score_spread":0.2615404496753894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977113926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056645803,0.00013136317,0.94004047,0.00013616103,0.000025176114,0.000042225474,0.000016910246,0.0007006567,0.002261232],"genre_scores_gemma":[0.5275853,0.00016165384,0.46983537,0.00009304749,0.000032686676,0.00019722439,0.00006931737,0.00026238142,0.0017629362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948335,0.00017169806,0.00003058764,0.00009786271,0.00016361637,0.000052853924],"domain_scores_gemma":[0.998678,0.0007100608,0.00013474187,0.00027879016,0.00016178681,0.000036494024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808433,0.0005583873,0.00047344007,0.0004894963,0.0002781394,0.0007376489,0.0010677024,0.0006079783,0.0011181457],"category_scores_gemma":[0.004793868,0.0002587346,0.0004354066,0.0005930643,0.00075524475,0.0010795493,0.001035764,0.0012026643,0.00022837665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012788265,0.00013420686,0.0008319122,0.00007697611,0.00003213803,0.00012910683,0.00024574704,0.6871844,0.036207855,0.044668846,0.000859195,0.22950172],"study_design_scores_gemma":[0.000019161673,0.000051790914,0.000088930625,0.000006023568,0.00000946533,0.000037268182,0.00001283416,0.9815808,0.007941354,0.00897168,0.0012734982,0.00000724012],"about_ca_topic_score_codex":0.0006812789,"about_ca_topic_score_gemma":0.000662681,"teacher_disagreement_score":0.0011181457,"about_ca_system_score_codex":0.0005306782,"about_ca_system_score_gemma":0.0005028975,"threshold_uncertainty_score":0.0051872134},"labels":[],"label_agreement":null},{"id":"W1978176266","doi":"10.1145/773365.773371","title":"An EGA approach to the compile-time assignment of data to multiple memories in digital-signal processors","year":2003,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Compiler; Parallel computing; Dual (grammatical number); Programming language","score_opus":0.03251975303947704,"score_gpt":0.2719346247869187,"score_spread":0.23941487174744167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978176266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01597671,0.00025879196,0.98113084,0.00017269142,0.00005392296,0.00004850667,0.000011517224,0.0005764462,0.0017706965],"genre_scores_gemma":[0.16156037,0.00022578209,0.8342849,0.00021934592,0.00004338279,0.00013057361,0.000048615108,0.00015818812,0.0033287902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950993,0.00019012456,0.00001967198,0.00009451975,0.00013937309,0.00004638361],"domain_scores_gemma":[0.9995704,0.00018198138,0.000048107406,0.00008964499,0.00008632544,0.000023483943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081256486,0.00063069287,0.00045479427,0.00058479485,0.0005810587,0.00065309065,0.0013765751,0.0008351058,0.0012850398],"category_scores_gemma":[0.0016051289,0.00034034823,0.0005239709,0.0005098998,0.0010306289,0.0008650969,0.00084919913,0.0012281212,0.00032963222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017515903,0.0001368453,0.001800549,0.00016913132,0.00012764352,0.00023526377,0.00037411388,0.5322076,0.0303544,0.054372653,0.0018274686,0.37821922],"study_design_scores_gemma":[0.00006919914,0.00025250923,0.0005785807,0.000036898888,0.00012501221,0.00034571585,0.0000742436,0.9220419,0.025138699,0.03528269,0.016021753,0.000032787924],"about_ca_topic_score_codex":0.0013897516,"about_ca_topic_score_gemma":0.002185201,"teacher_disagreement_score":0.0013897516,"about_ca_system_score_codex":0.00051169744,"about_ca_system_score_gemma":0.0008659691,"threshold_uncertainty_score":0.0042989254},"labels":[],"label_agreement":null},{"id":"W1979699444","doi":"10.1145/1274000.1274070","title":"Exploring medical data using visual spaces with genetic programming and implicit functional mappings","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Genetic programming; Computer science; Functional reactive programming; Scalar (mathematics); Reactive programming; Functional programming; Extension (predicate logic); Theoretical computer science; Set (abstract data type); Inductive programming; Artificial intelligence; Machine learning; Programming paradigm; Mathematics; Programming language","score_opus":0.12438272513794114,"score_gpt":0.3095728765293999,"score_spread":0.18519015139145878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979699444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0337576,0.000062082785,0.96531326,0.00012741938,0.0000051274205,0.00002118092,0.00001803639,0.00008105721,0.00061417336],"genre_scores_gemma":[0.43986642,0.00014180789,0.5588705,0.000055854962,0.000014894393,0.00014618426,0.00007378778,0.000039553837,0.0007909131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953914,0.00024308181,0.00001851947,0.000081236365,0.000088695895,0.000029471035],"domain_scores_gemma":[0.99885404,0.00088479836,0.00009575846,0.000059211972,0.00007350799,0.00003270214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010686871,0.00069687224,0.0005386421,0.0012832541,0.0003253015,0.0012316698,0.00072588894,0.0006333279,0.0005440216],"category_scores_gemma":[0.0037338429,0.0004052478,0.0012167634,0.00092972815,0.0010342494,0.0010192634,0.0011999895,0.00074873434,0.00008667478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042701085,0.00004862481,0.0010855406,0.00006089897,0.00004100661,0.00009628282,0.00026073703,0.901802,0.0037672103,0.03050601,0.00016859222,0.06212045],"study_design_scores_gemma":[0.00000474417,0.000021741003,0.00015062478,0.0000066061107,0.0000052726505,0.000028506613,0.00003534353,0.9824552,0.000901116,0.016139643,0.00024443175,0.000006702825],"about_ca_topic_score_codex":0.0024709865,"about_ca_topic_score_gemma":0.0018687317,"teacher_disagreement_score":0.0024709865,"about_ca_system_score_codex":0.000617957,"about_ca_system_score_gemma":0.0006514411,"threshold_uncertainty_score":0.005651772},"labels":[],"label_agreement":null},{"id":"W198006216","doi":"","title":"Automatically generated object-oriented genetic programs to optimize adaptive job shop control and scheduling system.","year":2001,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Scheduling (production processes); Job shop scheduling; Artificial intelligence; Operations management; Engineering; Schedule; Operating system","score_opus":0.014836159282080014,"score_gpt":0.21105963147051163,"score_spread":0.1962234721884316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198006216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098042145,0.0003634036,0.885811,0.0002460236,0.00012169299,0.00027963996,0.00018021611,0.003104469,0.011851355],"genre_scores_gemma":[0.5418171,0.00016708123,0.44975966,0.0001192222,0.000019743318,0.000468697,0.00032218298,0.00026489957,0.007061379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998517,0.000052759668,0.0000062106733,0.00002095307,0.000046382265,0.000021977841],"domain_scores_gemma":[0.9996339,0.00021503662,0.000034778706,0.000016706319,0.00007944399,0.000020039153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005454084,0.0004965551,0.00040134898,0.00044415105,0.00027657318,0.0004872692,0.0006638947,0.00067364814,0.002680091],"category_scores_gemma":[0.00096260867,0.00029304772,0.00037561634,0.00028756823,0.0003408731,0.0002236766,0.0003241165,0.0004863764,0.00038781407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009856245,0.000104653365,0.00076572644,0.000054119446,0.000020428837,0.000072810326,0.00006477472,0.93964696,0.0042919763,0.0055199885,0.0013960744,0.047963977],"study_design_scores_gemma":[0.000026537266,0.000033227087,0.00010754011,0.000004478685,0.000007821765,0.000009010347,0.000008346603,0.99696535,0.0009077839,0.0009932901,0.00093410903,0.0000025396148],"about_ca_topic_score_codex":0.005828602,"about_ca_topic_score_gemma":0.0057149525,"teacher_disagreement_score":0.005828602,"about_ca_system_score_codex":0.00071617984,"about_ca_system_score_gemma":0.0009392845,"threshold_uncertainty_score":0.011589348},"labels":[],"label_agreement":null},{"id":"W1980948051","doi":"10.1145/2598394.2598494","title":"Incorporating expert knowledge in object-oriented genetic programming","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Genetic programming; Computer science; Variety (cybernetics); Object-oriented programming; Expert system; Class (philosophy); Object (grammar); Programming language; Artificial intelligence; Theoretical computer science; Machine learning; Software engineering","score_opus":0.012483241654857567,"score_gpt":0.25974680570015407,"score_spread":0.2472635640452965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980948051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008747377,0.00007526118,0.98564154,0.00018160835,0.000016993421,0.000061931954,0.000015585281,0.0002467093,0.0050129187],"genre_scores_gemma":[0.16704656,0.00029298608,0.8289162,0.00027750133,0.00003218831,0.00015926202,0.000078799225,0.00011283831,0.0030836642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980725,0.00076181494,0.00011221243,0.00022309084,0.00070041866,0.00012993503],"domain_scores_gemma":[0.9950783,0.003442537,0.0003105857,0.00057891005,0.0004739065,0.00011579162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038249725,0.0004933785,0.00048498082,0.00084374624,0.00046727058,0.0017949357,0.0016692486,0.001672896,0.0015056059],"category_scores_gemma":[0.011047929,0.00048976514,0.0005565743,0.0008097833,0.001414315,0.0020306122,0.0014977789,0.0012289435,0.00041672363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078373894,0.00021966702,0.0033167813,0.00024047156,0.000083926774,0.0005137825,0.0012687675,0.34592807,0.0067765084,0.31121525,0.0015409765,0.32881737],"study_design_scores_gemma":[0.00005183477,0.0000898206,0.0006123682,0.0001588216,0.00008759961,0.00034433036,0.00011646129,0.7736865,0.0063323528,0.19323663,0.02522142,0.000061826184],"about_ca_topic_score_codex":0.0015561774,"about_ca_topic_score_gemma":0.0024290343,"teacher_disagreement_score":0.0038249725,"about_ca_system_score_codex":0.0006780409,"about_ca_system_score_gemma":0.0010317438,"threshold_uncertainty_score":0.020228684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.005149068878092617,"score_gpt":0.23049791992071902,"score_spread":0.22534885104262642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981971424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06649877,0.00054295216,0.9137015,0.00020853207,0.000114273455,0.000115334486,0.000039094863,0.00020351853,0.018576039],"genre_scores_gemma":[0.49577,0.00046714573,0.4634584,0.0002654446,0.000059979066,0.0003382574,0.00013149549,0.00021660516,0.039292727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994735,0.00021408775,0.000027294598,0.00008623002,0.00014549062,0.000053426775],"domain_scores_gemma":[0.99901724,0.00050809904,0.00007767245,0.00015023346,0.00019362739,0.00005312661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094051595,0.00076757505,0.0007569578,0.000845127,0.0004742474,0.0008232049,0.0016753162,0.0010095354,0.006521625],"category_scores_gemma":[0.0032215915,0.00028259985,0.0005145204,0.00081219483,0.00047301603,0.0010720678,0.0012036104,0.00074008876,0.0009094684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028076532,0.0002393967,0.0009909119,0.00025652623,0.00019016945,0.00029603273,0.00022061283,0.30040246,0.027490243,0.27542123,0.004038776,0.39017287],"study_design_scores_gemma":[0.00007157265,0.00023394475,0.00039737317,0.00003432705,0.00009783735,0.0003190411,0.000043966138,0.90862495,0.0058117528,0.0765724,0.0077621574,0.000030690677],"about_ca_topic_score_codex":0.00029977778,"about_ca_topic_score_gemma":0.00051014486,"teacher_disagreement_score":0.006521625,"about_ca_system_score_codex":0.00037754685,"about_ca_system_score_gemma":0.0003670711,"threshold_uncertainty_score":0.021816969},"labels":[],"label_agreement":null},{"id":"W1982679994","doi":"10.1142/s0129183102003450","title":"FUZZY REINFORCEMENT LEARNING","year":2002,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Fuzzy logic; Artificial intelligence; Computer science; Reinforcement learning; Extension (predicate logic); Adaptive neuro fuzzy inference system; Neuro-fuzzy; Inference; Fuzzy inference; Knowledge base; Fuzzy set operations; Fuzzy control system; Machine learning","score_opus":0.023636247267134574,"score_gpt":0.25815441488724405,"score_spread":0.2345181676201095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982679994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011270418,0.00090307044,0.9676931,0.0006696544,0.00021411218,0.00008025303,0.000033021886,0.00035768107,0.018778665],"genre_scores_gemma":[0.8420915,0.0010545278,0.14262567,0.00039793,0.0001792922,0.0002247698,0.000084880434,0.0000398161,0.013301672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.00024840917,0.000029153816,0.00010533102,0.00025203006,0.0000552949],"domain_scores_gemma":[0.99867684,0.0006804258,0.00012132186,0.00012092334,0.0003088286,0.000091663474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012896606,0.0006599378,0.0008487004,0.0003733389,0.00048506542,0.00093298615,0.0010010183,0.0010797586,0.003184396],"category_scores_gemma":[0.0047254954,0.00017284823,0.0004297923,0.00035657795,0.0011995198,0.000783441,0.00090286805,0.0011927957,0.0005660332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016151454,0.00020252456,0.0011967978,0.00021724026,0.00013765715,0.00027396242,0.00017702435,0.53165334,0.0031300548,0.22536045,0.005606912,0.23188244],"study_design_scores_gemma":[0.00005519533,0.00009465894,0.00019588441,0.000028826867,0.00001939352,0.00006978748,0.000021253229,0.8842383,0.0010942713,0.10618562,0.007977204,0.000019526435],"about_ca_topic_score_codex":0.002360998,"about_ca_topic_score_gemma":0.0016630848,"teacher_disagreement_score":0.003184396,"about_ca_system_score_codex":0.0010140409,"about_ca_system_score_gemma":0.000977376,"threshold_uncertainty_score":0.0106529},"labels":[],"label_agreement":null},{"id":"W1983838844","doi":"10.1145/1822327.1822330","title":"Toward an estimation of distribution algorithm for the evolution of artificial neural networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gene expression programming; Probabilistic logic; Neuroevolution; Estimation of distribution algorithm; Computer science; Chromosome; Artificial neural network; Evolutionary algorithm; Domain (mathematical analysis); Artificial intelligence; Algorithm; Evolutionary computation; Probabilistic neural network; Machine learning; Mathematics; Time delay neural network; Gene; Biology","score_opus":0.01749351702648979,"score_gpt":0.2649539502937995,"score_spread":0.24746043326730968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983838844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026243809,0.000065921726,0.9967043,0.000067716464,0.000008509182,0.000018976696,0.0000054496486,0.00011956343,0.00038517412],"genre_scores_gemma":[0.12830923,0.0002412242,0.8688315,0.0001216609,0.000061474966,0.00029767578,0.00010645062,0.00023301566,0.0017976457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990363,0.00043354163,0.000035010253,0.00017336746,0.00026677066,0.000055045355],"domain_scores_gemma":[0.99475056,0.003861431,0.000325242,0.00019699571,0.00074377033,0.00012203567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035115615,0.0008688664,0.0009710158,0.0012777281,0.00054040214,0.00095303176,0.0020123424,0.0013346182,0.0016401011],"category_scores_gemma":[0.015400038,0.0008216085,0.00057873235,0.0007741289,0.0012402341,0.0018364892,0.0017508076,0.002301509,0.0004001807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046670095,0.000044355704,0.00094953866,0.00005230238,0.000044472352,0.00002646633,0.00008707165,0.84775263,0.0014626702,0.04096454,0.0007827918,0.10778651],"study_design_scores_gemma":[0.000006075323,0.000007849242,0.000043067823,0.000004905998,0.0000022829834,0.0000066315197,0.0000033591975,0.9925464,0.0002581589,0.0067687063,0.00034913063,0.0000033375409],"about_ca_topic_score_codex":0.003702163,"about_ca_topic_score_gemma":0.0034778123,"teacher_disagreement_score":0.003702163,"about_ca_system_score_codex":0.0018066576,"about_ca_system_score_gemma":0.0014312459,"threshold_uncertainty_score":0.018571138},"labels":[],"label_agreement":null},{"id":"W1985171145","doi":"10.1080/01969720802069831","title":"INFLUENCE OF TEMPERATURE ON SWARMBOTS THAT LEARN","year":2008,"lang":"en","type":"article","venue":"Cybernetics & Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ethogram; Ethology; Artificial intelligence; Computer science; Swarm behaviour; Cybernetics; Control (management); Swarm robotics; Duration (music); Machine learning; Ecology","score_opus":0.017008710101454404,"score_gpt":0.2303582216459071,"score_spread":0.2133495115444527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985171145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.735604,0.0007033266,0.23313491,0.0023648622,0.00025631842,0.00008600203,0.0000839057,0.000596272,0.027170412],"genre_scores_gemma":[0.98990357,0.0001324291,0.0071895337,0.00010936832,0.000031220243,0.000034953748,0.000024868028,0.000040140112,0.0025339471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996518,0.0001356401,0.00001532761,0.00007133036,0.00005882351,0.000066991364],"domain_scores_gemma":[0.9973334,0.0014154268,0.0003960302,0.0002771813,0.00030132855,0.00027669192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010933669,0.0004427776,0.0005575784,0.00023137162,0.00051363645,0.0008850115,0.000670005,0.00086200674,0.0019907723],"category_scores_gemma":[0.0076267626,0.0002934257,0.00039108974,0.00011050618,0.00135523,0.0012419546,0.0011254878,0.0009561891,0.00029959148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003262299,0.00017687403,0.008929873,0.000118039796,0.00014506493,0.00037390727,0.0005258931,0.8771305,0.016498037,0.059238184,0.0017225539,0.034814876],"study_design_scores_gemma":[0.000035317487,0.00014500179,0.001957289,0.000011495834,0.000026253314,0.0000692136,0.000068937516,0.95350784,0.0021523866,0.040947806,0.0010605361,0.00001790918],"about_ca_topic_score_codex":0.0014185295,"about_ca_topic_score_gemma":0.0010084055,"teacher_disagreement_score":0.0019907723,"about_ca_system_score_codex":0.00057408755,"about_ca_system_score_gemma":0.0004847705,"threshold_uncertainty_score":0.006659746},"labels":[],"label_agreement":null},{"id":"W1985849007","doi":"10.1109/cec.2012.6252966","title":"On run time libraries and hierarchical symbiosis","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Coevolution; Reinforcement learning; Genetic programming; Domain (mathematical analysis); Artificial intelligence; Code (set theory); Theoretical computer science; Programming language; Set (abstract data type)","score_opus":0.00922143711061991,"score_gpt":0.215162458524291,"score_spread":0.2059410214136711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985849007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10000887,0.0009702535,0.8341411,0.0044586626,0.00011325819,0.00007409443,0.000045215722,0.0018501699,0.058338385],"genre_scores_gemma":[0.76063603,0.0006196332,0.22422914,0.00092323753,0.00013615235,0.00022811537,0.000082146835,0.0008594374,0.01228613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974329,0.0012089448,0.00011215646,0.00044201643,0.00049138215,0.00031262432],"domain_scores_gemma":[0.9918643,0.0039143465,0.0007694897,0.0024397273,0.00046041035,0.0005516763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002897599,0.00076314283,0.0004580456,0.0007637518,0.0010774257,0.0029020952,0.0015880641,0.0016762152,0.00558944],"category_scores_gemma":[0.014673358,0.00056905654,0.0006708934,0.00069922453,0.006814473,0.007866399,0.006362889,0.0035388225,0.001063296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011366383,0.000056325287,0.0011011158,0.00010209897,0.000024247996,0.00022948622,0.0009976297,0.05208779,0.005158324,0.87973046,0.0012118288,0.0591871],"study_design_scores_gemma":[0.000048751357,0.00010103125,0.0004680253,0.00007047121,0.000025193434,0.00022326162,0.00018255183,0.14968044,0.0041996352,0.8232496,0.021706076,0.00004506004],"about_ca_topic_score_codex":0.001199445,"about_ca_topic_score_gemma":0.0013870278,"teacher_disagreement_score":0.00558944,"about_ca_system_score_codex":0.0013355153,"about_ca_system_score_gemma":0.0012859331,"threshold_uncertainty_score":0.018698514},"labels":[],"label_agreement":null},{"id":"W1987023923","doi":"10.1145/1569901.1570220","title":"Evolving java objects using a grammar-based approach","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Programming language; Java; Executable; Object-oriented programming; Scala; Generics in Java; Grammar; Java annotation; Suite; Test suite; Real time Java; Genetic programming; Artificial intelligence; Test case","score_opus":0.02424239627315119,"score_gpt":0.2548619523944566,"score_spread":0.23061955612130539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987023923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01080087,0.0001526617,0.980962,0.0002351092,0.00007096599,0.00010780685,0.00004411113,0.0012898139,0.00633671],"genre_scores_gemma":[0.08879489,0.00036180246,0.9039691,0.0001987559,0.000026536241,0.00026081433,0.00029826438,0.0006130107,0.005476745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992499,0.0001447218,0.000055412896,0.000116185256,0.00037888286,0.00005484378],"domain_scores_gemma":[0.9991167,0.000323457,0.000053950796,0.00023238375,0.00021328942,0.000060194674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012947078,0.00035699498,0.0005362797,0.0008478848,0.0007417582,0.0019358055,0.0022889583,0.0012333062,0.0016544273],"category_scores_gemma":[0.002911212,0.00051502266,0.0011060396,0.0007093533,0.0014272552,0.001488395,0.0017839065,0.0012404533,0.00076255325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054123397,0.00022605894,0.0018969319,0.00024206472,0.00009678213,0.0005803651,0.0011374722,0.27866772,0.030337479,0.45912743,0.004114104,0.22351949],"study_design_scores_gemma":[0.00006892842,0.000076939294,0.00052782136,0.000070531525,0.000084382584,0.0003978597,0.00015768984,0.7019154,0.014785397,0.20941082,0.07243771,0.000066638524],"about_ca_topic_score_codex":0.0019433487,"about_ca_topic_score_gemma":0.0022571858,"teacher_disagreement_score":0.0022889583,"about_ca_system_score_codex":0.00087806454,"about_ca_system_score_gemma":0.0012669486,"threshold_uncertainty_score":0.006847143},"labels":[],"label_agreement":null},{"id":"W1988076045","doi":"10.1007/s00500-011-0720-5","title":"Bio-inspired computing for hybrid information technology","year":2011,"lang":"en","type":"article","venue":"Soft Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer architecture; Artificial intelligence","score_opus":0.018863660318010254,"score_gpt":0.23717514462860195,"score_spread":0.2183114843105917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988076045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02958169,0.04572171,0.7885909,0.005881097,0.0015410825,0.00012918704,0.0001055846,0.00044528276,0.1280035],"genre_scores_gemma":[0.5655426,0.021408519,0.36583963,0.00086802646,0.0007424071,0.00029817305,0.00015063825,0.00013699885,0.045013044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997646,0.00007609006,0.000011144623,0.000033286997,0.00009440391,0.000020393372],"domain_scores_gemma":[0.99973947,0.00015382178,0.000014506922,0.00004367629,0.000032408465,0.000016045205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047259644,0.0003381891,0.0006714384,0.0005481464,0.00050480483,0.002084241,0.0008019525,0.0013090128,0.005262335],"category_scores_gemma":[0.001113905,0.00018658052,0.00039682438,0.00079871895,0.0013358003,0.002308066,0.0010985595,0.0013102994,0.000843021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021514596,0.00003546636,0.00015714728,0.00029102014,0.00004201565,0.00009268101,0.000081970305,0.03173603,0.0037318068,0.8986004,0.0030667612,0.062143248],"study_design_scores_gemma":[0.000016473608,0.000042315733,0.00015150986,0.000076571596,0.000018186965,0.000106558015,0.00005191272,0.14446999,0.0023333405,0.81068945,0.042022657,0.000021053795],"about_ca_topic_score_codex":0.00053924415,"about_ca_topic_score_gemma":0.0007027377,"teacher_disagreement_score":0.005262335,"about_ca_system_score_codex":0.00082909653,"about_ca_system_score_gemma":0.0005439996,"threshold_uncertainty_score":0.017604291},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02605157689707486,"score_gpt":0.2663556851878202,"score_spread":0.24030410829074536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988844742","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033849285,0.9501053,0.04089651,0.0006891905,0.0005175773,0.000046279085,0.00006928715,0.00011361513,0.004177239],"genre_scores_gemma":[0.0506276,0.88948834,0.053552173,0.0008390037,0.0017979923,0.00014664691,0.00041361788,0.00011259679,0.0030221203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988869,0.00020741812,0.00013030448,0.0003625307,0.00034524896,0.00006767125],"domain_scores_gemma":[0.9977719,0.0015074469,0.00015080825,0.000116704075,0.00039495277,0.000058055266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025054882,0.0010648415,0.0025651313,0.0021041026,0.00044322308,0.0019959612,0.0024913396,0.0015002656,0.0018880697],"category_scores_gemma":[0.005378807,0.00055709446,0.0007797981,0.0028122517,0.0006181131,0.002846796,0.0008773115,0.00096983,0.00091580354],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061753046,0.00007772769,0.00080873654,0.0019756912,0.00011171362,0.000049164093,0.000029209546,0.003726031,0.00092681486,0.0045468686,0.005698827,0.98198754],"study_design_scores_gemma":[0.00016299917,0.0011986211,0.008335742,0.007978979,0.0014304196,0.004408663,0.0002956771,0.11161274,0.012662922,0.060877055,0.7907628,0.0002733093],"about_ca_topic_score_codex":0.0010751125,"about_ca_topic_score_gemma":0.0010839924,"teacher_disagreement_score":0.0025651313,"about_ca_system_score_codex":0.0007493361,"about_ca_system_score_gemma":0.001133169,"threshold_uncertainty_score":0.013250411},"labels":[],"label_agreement":null},{"id":"W1990194847","doi":"10.1115/1.3462919","title":"A System Framework With Online Monitoring and Evaluation for Design Evolution of Engineering Systems","year":2010,"lang":"en","type":"article","venue":"Journal of Computing and Information Science in Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bond graph; Mechatronics; Computer-automated design; Genetic programming; Computer science; Domain (mathematical analysis); Systems engineering; Control engineering; Systems design; Software engineering; Engineering; Artificial intelligence","score_opus":0.012479440373737003,"score_gpt":0.2612656044936706,"score_spread":0.2487861641199336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990194847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008529015,0.00006144944,0.9971654,0.000043545224,0.000009671675,0.000053476153,0.000025741248,0.0007058839,0.0010818966],"genre_scores_gemma":[0.112173125,0.00017036856,0.8849511,0.00005725607,0.000032002725,0.0005754149,0.00016501635,0.00021960934,0.0016561648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969522,0.0010889409,0.0001917238,0.0004700218,0.0011471309,0.00015000487],"domain_scores_gemma":[0.9976673,0.001117985,0.0002932894,0.00042048362,0.0004195007,0.0000815039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004601347,0.0015936565,0.0012743687,0.00164222,0.0005945822,0.0023128781,0.0030548715,0.0015933932,0.005590222],"category_scores_gemma":[0.007836037,0.0007003713,0.0013723954,0.0008669474,0.0016867749,0.0019975195,0.002480722,0.0018634949,0.0009030909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094264244,0.00011299105,0.0007307656,0.00029465486,0.00011297037,0.00023175792,0.0002884739,0.6394495,0.0067774663,0.24166475,0.0018277462,0.108414665],"study_design_scores_gemma":[0.000029199451,0.000067207715,0.00011686187,0.000038492326,0.000028046981,0.000054524502,0.0000150732385,0.9585426,0.002265043,0.032477915,0.006347423,0.000017603435],"about_ca_topic_score_codex":0.0033467633,"about_ca_topic_score_gemma":0.0024697327,"teacher_disagreement_score":0.005590222,"about_ca_system_score_codex":0.0012890508,"about_ca_system_score_gemma":0.0016802402,"threshold_uncertainty_score":0.02433455},"labels":[],"label_agreement":null},{"id":"W1991112568","doi":"10.1109/cimsivp.2014.7013279","title":"Finding optimal transformation function for image thresholding using genetic programming","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Thresholding; Transformation (genetics); Genetic programming; Computer science; Image (mathematics); Artificial intelligence; Function (biology); Computer vision; Genetic algorithm; Pattern recognition (psychology); Machine learning; Biology","score_opus":0.025941573047686104,"score_gpt":0.2724775401970555,"score_spread":0.2465359671493694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991112568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015097472,0.00013585397,0.98312366,0.00007554615,0.000012177425,0.000029787769,0.000008913886,0.00021124676,0.0013053977],"genre_scores_gemma":[0.3332164,0.0003592243,0.66410935,0.00009693218,0.000019291581,0.00021119682,0.00008067096,0.00016456813,0.0017424312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997584,0.00006209002,0.000011037515,0.00006236104,0.00007582975,0.000030259765],"domain_scores_gemma":[0.99972445,0.00016960419,0.00003147482,0.000012192975,0.000054200795,0.000008003717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006376037,0.00062825537,0.0006860256,0.0008662067,0.0003600147,0.0006232814,0.0005979958,0.0010231838,0.0012298065],"category_scores_gemma":[0.0014696983,0.00036703225,0.00055791915,0.0007430047,0.000590704,0.0005840857,0.00040467395,0.00084863324,0.00028819538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004731028,0.00007366446,0.00080711744,0.00013291773,0.00004107461,0.00011964074,0.00014551776,0.79632217,0.018671721,0.011171937,0.00083161186,0.17163529],"study_design_scores_gemma":[0.000008464752,0.00003163386,0.000152096,0.000010833233,0.000010410929,0.00003764084,0.000020088999,0.9929108,0.0027759047,0.0034419773,0.00059265824,0.0000075497724],"about_ca_topic_score_codex":0.0020727017,"about_ca_topic_score_gemma":0.0017331046,"teacher_disagreement_score":0.0020727017,"about_ca_system_score_codex":0.00052433036,"about_ca_system_score_gemma":0.0008354278,"threshold_uncertainty_score":0.004121244},"labels":[],"label_agreement":null},{"id":"W1993756550","doi":"10.1145/1276958.1277234","title":"The effects of solution density in the search space on finding spatially robust solutions","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Robustness (evolution); Mathematical optimization; Computer science; Mathematics; Algorithm","score_opus":0.02757215062327319,"score_gpt":0.26879154607710537,"score_spread":0.24121939545383217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993756550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61483747,0.001942743,0.3739839,0.0007684137,0.000045022545,0.00016910133,0.00011775636,0.00031958832,0.00781609],"genre_scores_gemma":[0.9437238,0.00040709358,0.055155743,0.00006145402,0.000032363925,0.00009163437,0.000051415114,0.00006864616,0.00040780992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946748,0.0025163672,0.00035897782,0.0006388401,0.0015310931,0.00027984858],"domain_scores_gemma":[0.86940336,0.115145065,0.0060918257,0.0059845652,0.0027045577,0.00067063497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009861,0.00088909216,0.0010130531,0.0017516596,0.000761561,0.0014134989,0.0009632407,0.0015463202,0.0011934959],"category_scores_gemma":[0.08593863,0.0006965774,0.0011569655,0.0008791902,0.0034928105,0.0035212277,0.0025548562,0.0013811772,0.00018925831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057783717,0.00017769611,0.01219765,0.00043370394,0.00030380467,0.00048048215,0.0005250837,0.86305535,0.024953179,0.029338656,0.00032619108,0.06763035],"study_design_scores_gemma":[0.00013577427,0.0016264076,0.016107187,0.00014878277,0.0002972381,0.0011553123,0.00029067034,0.8944569,0.034983367,0.049199972,0.0014598641,0.00013842496],"about_ca_topic_score_codex":0.0009788861,"about_ca_topic_score_gemma":0.0007328776,"teacher_disagreement_score":0.009861,"about_ca_system_score_codex":0.0006919516,"about_ca_system_score_gemma":0.00048787802,"threshold_uncertainty_score":0.052150607},"labels":[],"label_agreement":null},{"id":"W1995771052","doi":"10.1038/npre.2010.3913.2","title":"Design of a dynamic model of genes with multiple autonomous regulatory modules by evolution in silico","year":2010,"lang":"en","type":"preprint","venue":"Nature Precedings","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; National Science Foundation","keywords":"In silico; Benchmark (surveying); Crossover; Computer science; Exploit; Evolutionary algorithm; Genetic algorithm; Computational biology; Artificial intelligence; Gene; Machine learning; Biology; Genetics","score_opus":0.007717461571683098,"score_gpt":0.22871241982902168,"score_spread":0.2209949582573386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995771052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19732362,0.0001801738,0.7934399,0.00044202592,0.00007237495,0.00006624634,0.00013396022,0.0005734346,0.0077682133],"genre_scores_gemma":[0.89868087,0.00023818243,0.0962054,0.00007752433,0.0000135886385,0.0002815759,0.00013463353,0.00009781562,0.00427047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998684,0.000037622965,0.0000056805166,0.000035074514,0.00003741105,0.000015797295],"domain_scores_gemma":[0.99985874,0.00007189147,0.000018706332,0.00001566971,0.000018760162,0.000016206313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030534455,0.00037843204,0.00066192204,0.00026264967,0.000307619,0.0007179514,0.00090371625,0.00081332703,0.0017347488],"category_scores_gemma":[0.0004915157,0.00035637355,0.00072920683,0.00021833093,0.0005757155,0.00045539098,0.00046692617,0.0005471548,0.00027582006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025652069,0.000021744816,0.00024380659,0.00002325009,0.000015229049,0.000052969946,0.000019882362,0.97470254,0.013024228,0.00979719,0.00009000761,0.0019834607],"study_design_scores_gemma":[0.000014798389,0.000017007713,0.000042097025,0.0000016956333,0.000005931892,0.000009540399,0.0000029975427,0.9959214,0.0019357182,0.0014489641,0.0005960729,0.0000037077386],"about_ca_topic_score_codex":0.0013195273,"about_ca_topic_score_gemma":0.00084505096,"teacher_disagreement_score":0.0017347488,"about_ca_system_score_codex":0.00060355116,"about_ca_system_score_gemma":0.00059202453,"threshold_uncertainty_score":0.0058033466},"labels":[],"label_agreement":null},{"id":"W1995804124","doi":"10.1186/1687-6180-2012-28","title":"Biologically inspired signal processing: analyses, algorithms and applications","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Signal processing; Algorithm; SIGNAL (programming language); Multidimensional signal processing; Digital signal processing; Computer hardware; Programming language","score_opus":0.042750614885376084,"score_gpt":0.3442295501907098,"score_spread":0.3014789353053337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995804124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005179127,0.022220248,0.9610283,0.0022405079,0.00024348455,0.000053486565,0.000118654374,0.00046530267,0.0084508965],"genre_scores_gemma":[0.22132884,0.049316444,0.713233,0.000901291,0.0014860363,0.0003824471,0.00044686254,0.00031618835,0.012588931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.00013956039,0.000030872172,0.000052642194,0.00018035463,0.000018880888],"domain_scores_gemma":[0.9992894,0.00040991878,0.0000732154,0.000076616256,0.00012989645,0.000020963627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087941514,0.0008301099,0.0007504034,0.0013139666,0.00033738386,0.0017664217,0.0007664067,0.0014577792,0.0028816345],"category_scores_gemma":[0.0032167044,0.00034492865,0.0005018832,0.0022917772,0.0010830815,0.0013116684,0.0008902522,0.001528296,0.0015227303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057361813,0.00010999523,0.0009803772,0.0007358582,0.00013130551,0.00018775812,0.00022320272,0.11868386,0.012867294,0.18345132,0.013787185,0.66878444],"study_design_scores_gemma":[0.0000142771805,0.000051830793,0.00088201126,0.00017879893,0.00003438834,0.0003945014,0.00006654533,0.7158854,0.0036211829,0.2416828,0.037147302,0.000040864437],"about_ca_topic_score_codex":0.0007650327,"about_ca_topic_score_gemma":0.00047605936,"teacher_disagreement_score":0.0028816345,"about_ca_system_score_codex":0.0004617991,"about_ca_system_score_gemma":0.00044756985,"threshold_uncertainty_score":0.009640038},"labels":[],"label_agreement":null},{"id":"W1997899762","doi":"10.1145/1276958.1277165","title":"Learning recursive programs with cooperative coevolution of genetic code mapping and genotype","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Genetic programming; Probabilistic logic; Computer science; Fibonacci number; Set (abstract data type); Encoding (memory); Population; Function (biology); Grammatical evolution; Theoretical computer science; Code (set theory); Mathematical optimization; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Biology; Genetics","score_opus":0.013782526660064104,"score_gpt":0.23631852004359505,"score_spread":0.22253599338353094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997899762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14224409,0.000057613495,0.8548066,0.00011254277,0.000009374787,0.000052318643,0.000011171484,0.0003120877,0.002394139],"genre_scores_gemma":[0.6794823,0.00007409564,0.31783044,0.000097014476,0.000011681044,0.0003078727,0.00006433981,0.00007130358,0.0020610006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996061,0.00015671091,0.000017157534,0.00009068894,0.00008928771,0.000040177132],"domain_scores_gemma":[0.99840003,0.0012113317,0.00010098026,0.00012876512,0.00011999551,0.000039025665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012379645,0.0006018448,0.00059600774,0.00049386197,0.0002935603,0.00063935196,0.0012597337,0.0009878648,0.00091181934],"category_scores_gemma":[0.005576003,0.00044788886,0.0005238955,0.0005106206,0.0010527516,0.0009834043,0.0013648279,0.0009851923,0.00014893759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004808858,0.00008100401,0.0016575758,0.000043155604,0.000039756498,0.000120612545,0.0003093939,0.84868824,0.0065845745,0.046097446,0.0003942218,0.09593598],"study_design_scores_gemma":[0.000007569648,0.000019623989,0.00007336675,0.0000021005487,0.0000060499287,0.000020485977,0.00000897163,0.9907928,0.00095900544,0.007912708,0.00019340884,0.0000038842995],"about_ca_topic_score_codex":0.0016900235,"about_ca_topic_score_gemma":0.0020509905,"teacher_disagreement_score":0.0016900235,"about_ca_system_score_codex":0.00061496237,"about_ca_system_score_gemma":0.00067389954,"threshold_uncertainty_score":0.006547034},"labels":[],"label_agreement":null},{"id":"W1998452541","doi":"10.1007/s10710-008-9067-9","title":"Coevolutionary bid-based genetic programming for problem decomposition in classification","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Bidding; Classifier (UML); Genetic programming; Support vector machine","score_opus":0.019829532841100332,"score_gpt":0.2670076920093719,"score_spread":0.24717815916827157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998452541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023980027,0.00024818024,0.97237194,0.00033240335,0.000045912406,0.000079342084,0.000019231371,0.00012399943,0.002798954],"genre_scores_gemma":[0.46345657,0.00025354684,0.5299898,0.00036254025,0.000051103136,0.0005097743,0.00011428022,0.00014381848,0.0051186327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990722,0.0005146464,0.00004087432,0.000103002334,0.00018719099,0.00008200354],"domain_scores_gemma":[0.99736315,0.0018917889,0.00008739392,0.0001535607,0.0003832155,0.00012095768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028751406,0.00074610754,0.0013519672,0.0010134054,0.0006714855,0.0010702024,0.0021746815,0.0017649923,0.0030665945],"category_scores_gemma":[0.0075239367,0.000650112,0.0009129364,0.0011519793,0.001449326,0.0012336604,0.0023130884,0.002196978,0.0003349389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000691275,0.00010231807,0.0005417007,0.000053653977,0.000048347585,0.00003512739,0.00011191057,0.8952114,0.00083040656,0.037642814,0.0011906034,0.06416269],"study_design_scores_gemma":[0.0000070709766,0.000010041023,0.000022240472,0.0000036598203,0.000003755181,0.0000046638797,0.0000045932543,0.99545044,0.00008394107,0.0042940173,0.00011398079,0.0000016488946],"about_ca_topic_score_codex":0.0060504833,"about_ca_topic_score_gemma":0.005570512,"teacher_disagreement_score":0.0060504833,"about_ca_system_score_codex":0.00122504,"about_ca_system_score_gemma":0.001179225,"threshold_uncertainty_score":0.015205324},"labels":[],"label_agreement":null},{"id":"W2000526024","doi":"10.1145/1276958.1277163","title":"Environment as a spatial constraint on the growth of structural form","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constraint (computer-aided design); Context (archaeology); Fitness function; Genome; Computer science; Evolutionary biology; Genetic algorithm; Stability (learning theory); Phenotype; Biology; Artificial intelligence; Mathematical optimization; Mathematics; Genetics; Machine learning","score_opus":0.009458543202408508,"score_gpt":0.22134493720810067,"score_spread":0.21188639400569215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000526024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75082934,0.0004748191,0.22136997,0.0006273206,0.000035176094,0.00001917707,0.000094180745,0.000105991385,0.026443958],"genre_scores_gemma":[0.964601,0.00037400992,0.03016573,0.0000485771,0.000012294109,0.000041496143,0.000033555796,0.000070144284,0.0046531907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997633,0.000087532666,0.0000086525715,0.00004636914,0.000057517555,0.000036520305],"domain_scores_gemma":[0.9990207,0.0005253299,0.00016091108,0.00014380847,0.000074420386,0.00007484245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003013165,0.0003803694,0.00031337704,0.00035582238,0.00047740975,0.00092119136,0.00046109947,0.00057825405,0.0016819423],"category_scores_gemma":[0.0021955883,0.00031275206,0.00046039565,0.00026295587,0.001454155,0.00091908505,0.0015093144,0.0006198452,0.00022696155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012085707,0.000044439676,0.002577732,0.00010202287,0.00002646957,0.00052398554,0.00020806878,0.59192455,0.09680346,0.28874835,0.00039484233,0.018525144],"study_design_scores_gemma":[0.00005045177,0.00027271215,0.0027105415,0.00002406232,0.000032951328,0.00038442074,0.00011889316,0.87385446,0.024668077,0.091636784,0.00619623,0.00005041007],"about_ca_topic_score_codex":0.00135445,"about_ca_topic_score_gemma":0.001540465,"teacher_disagreement_score":0.0016819423,"about_ca_system_score_codex":0.00046437545,"about_ca_system_score_gemma":0.00038305947,"threshold_uncertainty_score":0.0056266785},"labels":[],"label_agreement":null},{"id":"W2000599920","doi":"10.1142/s0218001404003587","title":"PROJECT CellNet: EVOLVING AN AUTONOMOUS PATTERN RECOGNIZER","year":2004,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Set (abstract data type); Artificial intelligence; Genetic algorithm; Evolutionary algorithm; Binary number; Pattern recognition (psychology); Software; Machine learning; Mathematics","score_opus":0.08000262937064781,"score_gpt":0.3221495007818917,"score_spread":0.24214687141124389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000599920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08941987,0.00032138205,0.8700391,0.00037609076,0.0002262301,0.00031507702,0.0007139386,0.019703483,0.018884761],"genre_scores_gemma":[0.2806252,0.00034373958,0.6859651,0.0004345706,0.000056388984,0.0006466253,0.0035879922,0.0014390425,0.026901314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999629,0.00006746092,0.000014595751,0.000095922085,0.00016427365,0.000028674827],"domain_scores_gemma":[0.99963593,0.00008931745,0.000020391155,0.0000777861,0.00013407906,0.00004252866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778821,0.00043509377,0.00029253465,0.00039280643,0.00025862336,0.00073804794,0.001256952,0.0006502709,0.0031154512],"category_scores_gemma":[0.0013970642,0.00019355504,0.00023051265,0.00030581478,0.00046434955,0.0007980874,0.0007801377,0.0005143927,0.0014338912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035376518,0.0002482075,0.005047258,0.00021482496,0.0000748964,0.00038398537,0.0003327791,0.14403406,0.077736266,0.030152477,0.041201122,0.7002204],"study_design_scores_gemma":[0.000079755584,0.00025904743,0.001101109,0.000026008373,0.000029696008,0.00046018625,0.00006836452,0.8456429,0.05790485,0.010600305,0.083793245,0.00003451262],"about_ca_topic_score_codex":0.0019248952,"about_ca_topic_score_gemma":0.0014612442,"teacher_disagreement_score":0.0031154512,"about_ca_system_score_codex":0.00038618932,"about_ca_system_score_gemma":0.00052289024,"threshold_uncertainty_score":0.01042223},"labels":[],"label_agreement":null},{"id":"W2003350518","doi":"10.1088/1478-3975/9/5/056001","title":"Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives","year":2012,"lang":"en","type":"article","venue":"Physical Biology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; New York State Stem Cell Science; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Science Foundation","keywords":"Pareto principle; Computer science; ENCODE; Context (archaeology); Selection (genetic algorithm); Fitness function; Relation (database); Function (biology); Multi-objective optimization; Mathematical optimization; Genetic algorithm; Algorithm; Artificial intelligence; Mathematics; Machine learning; Gene; Data mining; Biology; Genetics","score_opus":0.014767141693922039,"score_gpt":0.27640103463651844,"score_spread":0.2616338929425964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003350518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012079869,0.0003001495,0.98259246,0.00023179957,0.000041119598,0.00011888868,0.00006648615,0.0005317606,0.0040374836],"genre_scores_gemma":[0.15048885,0.0003395807,0.84290296,0.00026890697,0.000045529385,0.0009623572,0.00026842757,0.000282681,0.0044407966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935657,0.00029332182,0.00002710279,0.000089413414,0.00015852616,0.000074969634],"domain_scores_gemma":[0.9983303,0.0012405429,0.00008927552,0.00008687384,0.00019208185,0.000060899485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029818933,0.002206241,0.0015554937,0.0021167477,0.00096717256,0.0010956326,0.0020825546,0.0021363755,0.0036867247],"category_scores_gemma":[0.005015619,0.00094827206,0.0012334719,0.0016162343,0.0016911952,0.001166039,0.0023233215,0.0018405548,0.00086890574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007561078,0.00007105915,0.0009026967,0.00008680938,0.00009087035,0.000081483005,0.00013982925,0.8849927,0.0013458936,0.023476407,0.0020440128,0.08669259],"study_design_scores_gemma":[0.000040454157,0.000039664785,0.000070991075,0.000018725706,0.000017701452,0.000016983235,0.000016985196,0.9843023,0.0004585364,0.013715779,0.0012939073,0.000008007291],"about_ca_topic_score_codex":0.0040664207,"about_ca_topic_score_gemma":0.0044642054,"teacher_disagreement_score":0.0040664207,"about_ca_system_score_codex":0.001652767,"about_ca_system_score_gemma":0.0019627626,"threshold_uncertainty_score":0.015769899},"labels":[],"label_agreement":null},{"id":"W2004249039","doi":"10.1109/devlrn.2010.5578854","title":"Discovering sensor space: Constructing spatial embeddings that explain sensor correlations","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Rochester","keywords":"Embedding; Computer science; Wireless sensor network; Task (project management); Space (punctuation); Variance (accounting); Correlation; Algorithm; Topology (electrical circuits); Theoretical computer science; Artificial intelligence; Mathematics; Engineering; Geometry; Combinatorics","score_opus":0.01238155686690839,"score_gpt":0.24252907030720824,"score_spread":0.23014751344029985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004249039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020303106,0.00005618519,0.9786471,0.00012675628,0.000007566772,0.000018040584,0.00006831366,0.00021209348,0.00056074094],"genre_scores_gemma":[0.42647305,0.00021459741,0.5713187,0.00006545267,0.0000132290725,0.00010815016,0.00035848792,0.0002043759,0.0012439423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947506,0.00019774285,0.000027654356,0.00015697397,0.00010636757,0.00003614656],"domain_scores_gemma":[0.9983968,0.00080820586,0.00023317678,0.00034038568,0.00016561616,0.000055707893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008748356,0.001089001,0.0005714679,0.0007638704,0.0004557484,0.00087262946,0.000916133,0.000906529,0.0014300409],"category_scores_gemma":[0.004711891,0.0007698892,0.00095629937,0.0006059657,0.0014803805,0.0031574636,0.0021645569,0.0012683722,0.0003504401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009827833,0.00006512077,0.0039999555,0.00014752283,0.00009456871,0.0001953667,0.0007153144,0.76550794,0.009638399,0.10123426,0.0012630295,0.117040284],"study_design_scores_gemma":[0.0000057178368,0.000033842465,0.00040890672,0.000013526357,0.000012094321,0.000050960676,0.000104656305,0.92899513,0.0027475567,0.06627688,0.0013348133,0.000015927613],"about_ca_topic_score_codex":0.0015590325,"about_ca_topic_score_gemma":0.0016979196,"teacher_disagreement_score":0.0015590325,"about_ca_system_score_codex":0.00053852994,"about_ca_system_score_gemma":0.00072059355,"threshold_uncertainty_score":0.0047839284},"labels":[],"label_agreement":null},{"id":"W2007872667","doi":"10.1145/1774088.1774328","title":"Probabilistic developmental program evolution","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gene expression programming; Probabilistic logic; Computer science; Genetic programming; Population; Chromosome; Algorithm; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.009840436786740764,"score_gpt":0.24489455627367665,"score_spread":0.2350541194869359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007872667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049004722,0.000058275873,0.99284464,0.00006698837,0.000010190479,0.000027440345,0.000037783513,0.00032377077,0.0017304545],"genre_scores_gemma":[0.21607764,0.00021534054,0.7795289,0.00012172879,0.000016295957,0.00031944952,0.00023955369,0.00017157363,0.0033094885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993591,0.00017770276,0.00002088865,0.000120570636,0.0002742353,0.00004761765],"domain_scores_gemma":[0.9991167,0.0005288881,0.00006276962,0.000111021785,0.00015232005,0.000028308676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093584,0.00046866055,0.00042604216,0.0005430215,0.00029608523,0.0005077653,0.0015649147,0.00064144726,0.0027661617],"category_scores_gemma":[0.0033742639,0.00038762225,0.0007439683,0.0006150409,0.0006749504,0.00069954246,0.0010343061,0.0012870107,0.00037839037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038547307,0.00004877048,0.0012104441,0.000108938104,0.000049461465,0.000094080744,0.00010264714,0.71763563,0.007933273,0.116354436,0.0018798976,0.1545438],"study_design_scores_gemma":[0.0000086277105,0.000029150615,0.000116933195,0.000008136124,0.000010371198,0.000060447634,0.0000060857483,0.9762173,0.0016937639,0.018155023,0.0036866495,0.0000075000034],"about_ca_topic_score_codex":0.0020019077,"about_ca_topic_score_gemma":0.0024254404,"teacher_disagreement_score":0.0027661617,"about_ca_system_score_codex":0.0006790341,"about_ca_system_score_gemma":0.0010110278,"threshold_uncertainty_score":0.00925374},"labels":[],"label_agreement":null},{"id":"W2009371048","doi":"10.1109/tevc.2013.2252852","title":"Guest Editorial: Special Issue on Understanding Complex Evolutionary Systems","year":2013,"lang":"en","type":"editorial","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Evolutionary computation; Judgement; Evolutionary algorithm; Set (abstract data type); Simple (philosophy); Data science; Artificial intelligence; Selection (genetic algorithm); Quality (philosophy); Range (aeronautics); Management science; Theoretical computer science; Machine learning; Epistemology","score_opus":0.028362221496766017,"score_gpt":0.27014994298826395,"score_spread":0.24178772149149794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009371048","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006279361,0.0037833047,0.0003049579,0.020765278,0.97235525,0.000016268477,0.000049939546,0.000054714747,0.0026075204],"genre_scores_gemma":[0.0005388047,0.0036188764,0.00014332925,0.0057000965,0.978525,0.000015591713,0.00004013323,0.00005423991,0.0113639375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779797,0.0002636218,0.00020239937,0.00031976763,0.0012286736,0.00018747001],"domain_scores_gemma":[0.9912417,0.0025591678,0.000495414,0.0002437869,0.003978752,0.0014810847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003007494,0.002635929,0.002208497,0.0026125966,0.0019923334,0.006325399,0.0019241084,0.0063068806,0.025251972],"category_scores_gemma":[0.0112681985,0.0005975412,0.001972225,0.0010525279,0.0014924272,0.0035764535,0.0013136207,0.010433526,0.013621758],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021230886,0.000009625443,0.000025558027,0.00011474277,0.000008767761,0.00007222808,0.00000985066,0.00003183886,0.00006718915,0.00043350676,0.99359965,0.005605759],"study_design_scores_gemma":[0.00002569978,0.000026583892,0.00021464648,0.00024491266,0.00002821024,0.0002745957,0.000035193054,0.00023451088,0.00016949841,0.001477381,0.99725705,0.000011766654],"about_ca_topic_score_codex":0.00056058785,"about_ca_topic_score_gemma":0.0015446402,"teacher_disagreement_score":0.025251972,"about_ca_system_score_codex":0.0018760944,"about_ca_system_score_gemma":0.0014647215,"threshold_uncertainty_score":0.08447629},"labels":[],"label_agreement":null},{"id":"W2009955015","doi":"10.1145/1569901.1596274","title":"Design &amp; Implementation of Parallel Linear GP for the IBM Cell Processor","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Brock University","keywords":"Operand; Computer science; Parallel computing; SIMD; Population; IBM; Selection (genetic algorithm); Algorithm; Artificial intelligence; Computer hardware","score_opus":0.0421437294131212,"score_gpt":0.3239630175252129,"score_spread":0.28181928811209167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009955015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20693113,0.0005500102,0.7243223,0.00071404286,0.00020731022,0.00036677314,0.00069976813,0.021303596,0.04490505],"genre_scores_gemma":[0.53181213,0.0001950954,0.4528576,0.00019273515,0.000026117768,0.00041166224,0.000708522,0.0003785025,0.013417675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998623,0.000024852627,0.0000062277795,0.000023814306,0.0000474074,0.00003530546],"domain_scores_gemma":[0.9998406,0.000035372905,0.000014704672,0.000028951308,0.00006500169,0.00001539444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000260738,0.00048151062,0.00024968633,0.00023169261,0.000260605,0.00053859,0.0012177536,0.00048271904,0.012475951],"category_scores_gemma":[0.0004886989,0.00017601592,0.00023726557,0.00029592833,0.0001980533,0.00030282556,0.00021949854,0.00042689647,0.0021253799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009950224,0.00043347085,0.003854735,0.00039673943,0.00011713343,0.0008278421,0.0002567554,0.44172728,0.07188513,0.019181607,0.028793909,0.43153036],"study_design_scores_gemma":[0.00037653965,0.00048441463,0.0009242349,0.000016813538,0.000056495737,0.00019168355,0.000052798103,0.9259538,0.039842684,0.0034282447,0.02864819,0.00002416531],"about_ca_topic_score_codex":0.0045771673,"about_ca_topic_score_gemma":0.004517553,"teacher_disagreement_score":0.012475951,"about_ca_system_score_codex":0.00048571988,"about_ca_system_score_gemma":0.000942145,"threshold_uncertainty_score":0.041736186},"labels":[],"label_agreement":null},{"id":"W2011114846","doi":"10.1145/1569901.1569970","title":"A novel approach to adaptive isolation in evolution strategies","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isolation (microbiology); Computer science; Adaptation (eye); Range (aeronautics); Engineering; Biology; Bioinformatics","score_opus":0.023783947388980684,"score_gpt":0.25016278627330923,"score_spread":0.22637883888432855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011114846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017606363,0.0003036889,0.97424465,0.0002730721,0.00006169613,0.00008249481,0.000015270793,0.00024878324,0.0071640173],"genre_scores_gemma":[0.5716739,0.00036846695,0.42155454,0.00047122312,0.00013471395,0.00038073244,0.00005454185,0.00015636886,0.0052054743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.00031645846,0.00005496361,0.00020971075,0.00028281903,0.00008281697],"domain_scores_gemma":[0.99856347,0.00068796135,0.00018863,0.000301254,0.00015349776,0.00010519396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009830793,0.0006234519,0.00057156594,0.00064376445,0.0006489203,0.000990007,0.0019191515,0.0010631675,0.0021189556],"category_scores_gemma":[0.0047781374,0.0003188532,0.0007262522,0.00046488037,0.001383491,0.0013794407,0.0024784175,0.0019768332,0.00044081104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016328905,0.000288545,0.001856043,0.00031733295,0.00017799389,0.00039713556,0.0008609378,0.35685915,0.045395132,0.39706463,0.0019663547,0.19465344],"study_design_scores_gemma":[0.00008874991,0.0004863189,0.0006958807,0.00003965736,0.0000672961,0.00049883826,0.000067489564,0.8378461,0.008377685,0.13956158,0.012217973,0.000052540672],"about_ca_topic_score_codex":0.00048928405,"about_ca_topic_score_gemma":0.000459309,"teacher_disagreement_score":0.0021189556,"about_ca_system_score_codex":0.00055098644,"about_ca_system_score_gemma":0.00065162487,"threshold_uncertainty_score":0.0070886016},"labels":[],"label_agreement":null},{"id":"W2011644900","doi":"10.1145/1068009.1068311","title":"Evolving recurrent models using linear GP","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.048231247947865784,"score_gpt":0.29154664856048174,"score_spread":0.24331540061261595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011644900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15634628,0.00062518974,0.8287706,0.0008583145,0.00007955725,0.00004786009,0.00016454159,0.0011747304,0.011933026],"genre_scores_gemma":[0.91746044,0.00031680326,0.07472153,0.00017114688,0.000043325934,0.00012455512,0.00021845994,0.0001430485,0.006800706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996494,0.00015996897,0.000016813092,0.00007057384,0.00006267684,0.000040582843],"domain_scores_gemma":[0.99879336,0.0008532465,0.00011018382,0.00010127394,0.00009990465,0.000042091666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083609275,0.00051172276,0.0008437599,0.0004123183,0.0003154321,0.0012354709,0.001069649,0.0013224807,0.00264079],"category_scores_gemma":[0.004610242,0.00038846084,0.00070300105,0.00053538923,0.0007372803,0.001221072,0.00089415204,0.0011437263,0.00044300515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019253059,0.000013655575,0.0002782019,0.000018483446,0.000026262533,0.000056815374,0.00004975955,0.9740684,0.0005598067,0.014170744,0.00034964154,0.010389095],"study_design_scores_gemma":[0.0000031272396,0.000005389968,0.000023895505,0.0000016279049,0.0000036748045,0.000004839994,0.0000027187996,0.994463,0.00008569331,0.005288069,0.00011558755,0.0000023085706],"about_ca_topic_score_codex":0.0048879753,"about_ca_topic_score_gemma":0.0036830711,"teacher_disagreement_score":0.0048879753,"about_ca_system_score_codex":0.00088714965,"about_ca_system_score_gemma":0.00048603828,"threshold_uncertainty_score":0.009719014},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Computational biology; Computer science; Biology","score_opus":0.033893313029410045,"score_gpt":0.3926086461626029,"score_spread":0.3587153331331928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013406396","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0464726,0.00095271796,0.8842867,0.0002958687,0.0026802097,0.046638865,0.0024406214,0.0014287942,0.01480359],"genre_scores_gemma":[0.15198651,0.00063355715,0.67932373,0.0007919003,0.00048472846,0.1425129,0.0016244138,0.0006624231,0.021979867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.92477185,0.04863316,0.0042962776,0.012244284,0.007052782,0.0030015928],"domain_scores_gemma":[0.9264809,0.04536733,0.0033674676,0.014040459,0.00923559,0.0015081906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02873722,0.005893004,0.0073896092,0.0026776576,0.0019063179,0.0033426257,0.0038032257,0.004536037,0.07970533],"category_scores_gemma":[0.13168834,0.0027637056,0.0045365794,0.0030326939,0.0028625818,0.0031432288,0.0030032047,0.0037191266,0.0137157645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.08309932,0.009470295,0.0050165914,0.0075263903,0.0027040553,0.0002728937,0.0040926756,0.017857615,0.018863173,0.12190272,0.013214347,0.7159799],"study_design_scores_gemma":[0.08519988,0.144515,0.025844416,0.003031085,0.005783175,0.00094518554,0.0026248791,0.0970309,0.042256508,0.33277547,0.25811133,0.0018822765],"about_ca_topic_score_codex":0.0008165179,"about_ca_topic_score_gemma":0.0010444586,"teacher_disagreement_score":0.07970533,"about_ca_system_score_codex":0.0015704302,"about_ca_system_score_gemma":0.004123508,"threshold_uncertainty_score":0.2666409},"labels":[],"label_agreement":null},{"id":"W2014058093","doi":"10.1198/000313006x89947","title":"The PDF of a Function of a Random Variable","year":2006,"lang":"en","type":"article","venue":"The American Statistician","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Probability density function; Random variable; Mathematics; Probability mass function; Variable (mathematics); Inverse function; Function (biology); Inverse; Analogy; Applied mathematics; Statistical physics; Statistics; Mathematical analysis; Geometry; Physics","score_opus":0.004906086841960577,"score_gpt":0.22151449896902503,"score_spread":0.21660841212706444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014058093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014972276,0.0017113828,0.9538248,0.003541841,0.00065178296,0.000029837282,0.0002673948,0.0004388062,0.024561862],"genre_scores_gemma":[0.7134836,0.008185193,0.2335504,0.0025829596,0.0026833005,0.00026343597,0.0005477371,0.0007069059,0.037996616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876595,0.0003961222,0.000044931687,0.0003190757,0.00038747815,0.00008662023],"domain_scores_gemma":[0.99451965,0.0036646512,0.0003180836,0.00074902887,0.00061950396,0.00012917316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024544683,0.00057918095,0.0006503828,0.0014526139,0.00053116935,0.002193376,0.0010000479,0.0018964787,0.00578406],"category_scores_gemma":[0.012593282,0.00033060092,0.00066422793,0.0010599671,0.0042888694,0.006020953,0.0008390852,0.0026498793,0.0020688265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002776999,0.000022876302,0.00084899494,0.000118125994,0.00002706455,0.00021646201,0.00024456394,0.019955808,0.0026460218,0.94359154,0.004816551,0.02748433],"study_design_scores_gemma":[0.000020113503,0.000064301246,0.0015997873,0.000101886006,0.000031060204,0.00083056313,0.00011204619,0.12260922,0.002864768,0.83717775,0.03450692,0.00008160253],"about_ca_topic_score_codex":0.0012721544,"about_ca_topic_score_gemma":0.00038988978,"teacher_disagreement_score":0.00578406,"about_ca_system_score_codex":0.00095609215,"about_ca_system_score_gemma":0.0006993475,"threshold_uncertainty_score":0.019349635},"labels":[],"label_agreement":null},{"id":"W2016428245","doi":"10.1080/11762320802027869","title":"Adaptive Fuzzy‐Lyapunov Controller Using Biologically Inspired Swarm Intelligence","year":2008,"lang":"en","type":"article","venue":"Applied Bionics and Biomechanics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Swarm behaviour; Controller (irrigation); Fuzzy logic; Swarm intelligence; Lyapunov function; Control theory (sociology); Computer science; Control engineering; Artificial intelligence; Engineering; Machine learning; Control (management); Biology; Nonlinear system; Particle swarm optimization","score_opus":0.04479450929476107,"score_gpt":0.24125487429058953,"score_spread":0.19646036499582847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016428245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021676231,0.0008692752,0.9606235,0.00026518854,0.00025021232,0.00010129575,0.000025010913,0.0008713028,0.015317996],"genre_scores_gemma":[0.9045129,0.00044180846,0.086427025,0.000109383225,0.000058411646,0.0002866312,0.000056535955,0.000040301748,0.008067064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998455,0.000027060454,0.000012245028,0.000024173516,0.000074741474,0.000016278127],"domain_scores_gemma":[0.99984014,0.000046623736,0.000023258272,0.000010718449,0.00006806394,0.000011142064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030326095,0.00047534023,0.00045811088,0.00035036795,0.000428382,0.00068714976,0.00073155353,0.00053069467,0.0011988482],"category_scores_gemma":[0.0007194847,0.00017993018,0.00031775134,0.00025776227,0.00036431037,0.0003081688,0.00043507342,0.00041317762,0.0002820986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011042268,0.00006954024,0.00038479935,0.00020305559,0.00008524816,0.00041769494,0.00021546456,0.79226685,0.032094624,0.04033728,0.0031157648,0.13069925],"study_design_scores_gemma":[0.000026514188,0.000059610004,0.000089868,0.000008724909,0.000011236967,0.000035370034,0.000006830023,0.9919282,0.0020353636,0.0030696325,0.002718881,0.000009670109],"about_ca_topic_score_codex":0.0028950104,"about_ca_topic_score_gemma":0.002147738,"teacher_disagreement_score":0.0028950104,"about_ca_system_score_codex":0.0005082224,"about_ca_system_score_gemma":0.00047641617,"threshold_uncertainty_score":0.0057563186},"labels":[],"label_agreement":null},{"id":"W2016866640","doi":"10.1109/cig.2013.6633619","title":"Landscape automata for search based procedural content generation","year":2013,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Terrain; Automaton; Fitness landscape; Landform; Computer science; Cellular automaton; Representation (politics); Encoding (memory); Variety (cybernetics); Theoretical computer science; Artificial intelligence; Geography; Cartography","score_opus":0.06521564580974955,"score_gpt":0.272212435644394,"score_spread":0.20699678983464448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016866640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009736031,0.000188383,0.98220694,0.00009994159,0.000051657564,0.000055056043,0.000100247824,0.00084733637,0.006714534],"genre_scores_gemma":[0.40274823,0.00046454577,0.5880572,0.00013222807,0.00003068386,0.00044048484,0.00039036313,0.00039800277,0.007338201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997695,0.00006317588,0.00001782879,0.0000431285,0.00008472576,0.000021623095],"domain_scores_gemma":[0.9994843,0.0002906193,0.00003187492,0.000095130534,0.00007550678,0.000022426337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030179572,0.00040734996,0.0003584944,0.00047742293,0.00037214463,0.0007714652,0.0008679149,0.0006790597,0.004893809],"category_scores_gemma":[0.0019348854,0.00024690334,0.00066624535,0.0003650128,0.00078305474,0.0010117355,0.0008742132,0.0008580769,0.00068761915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065839515,0.00004419388,0.00048782432,0.00015635727,0.000024466817,0.0001819235,0.00023585786,0.6094925,0.014614093,0.27537245,0.0028730945,0.09645154],"study_design_scores_gemma":[0.00001226752,0.000027170961,0.00008550974,0.00002122443,0.000010189616,0.00006636979,0.000020813357,0.9410803,0.0032542686,0.04715005,0.008258964,0.0000129088585],"about_ca_topic_score_codex":0.0022353088,"about_ca_topic_score_gemma":0.0020029119,"teacher_disagreement_score":0.004893809,"about_ca_system_score_codex":0.00076617853,"about_ca_system_score_gemma":0.0005514338,"threshold_uncertainty_score":0.016371429},"labels":[],"label_agreement":null},{"id":"W2016878627","doi":"10.1109/have.2013.6679618","title":"Identity verification based on haptic handwritten Signature: Novel fitness functions for GP framework","year":2013,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fitness function; Genetic programming; Computer science; Signature (topology); Fitness approximation; Identity (music); Artificial intelligence; Haptic technology; Machine learning; Curse of dimensionality; Dimensionality reduction; Pattern recognition (psychology); Genetic algorithm; Data mining; Mathematics","score_opus":0.018038354518953244,"score_gpt":0.2555047289424851,"score_spread":0.23746637442353186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016878627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684827,0.00006883651,0.96179086,0.00011501076,0.00001844065,0.000027820503,0.000021845393,0.00017477307,0.0009341146],"genre_scores_gemma":[0.7385065,0.000096621974,0.25920314,0.00009534241,0.000027528939,0.00010499344,0.00008431811,0.00006961299,0.0018119845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994418,0.00016184895,0.000032023072,0.000083076025,0.00023296004,0.00004832638],"domain_scores_gemma":[0.9985556,0.00080820423,0.0001505301,0.00012472649,0.0003140945,0.00004670312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013125958,0.00054916635,0.0006097392,0.0007276762,0.00028264135,0.00079674355,0.0007820827,0.0010921884,0.0008301752],"category_scores_gemma":[0.0053880266,0.00016859295,0.00038524964,0.0005603397,0.00057852716,0.0009819771,0.0008040074,0.00076017826,0.0001657256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008601622,0.000084322666,0.0024817467,0.00006347986,0.000049158574,0.00016909168,0.000108782704,0.7636308,0.014616562,0.015016072,0.00078803435,0.20290591],"study_design_scores_gemma":[0.0000035005794,0.000016970313,0.0003256045,0.000004970323,0.0000053794874,0.000035488913,0.000007045644,0.99531895,0.0017417253,0.0023336841,0.00020168559,0.000004822877],"about_ca_topic_score_codex":0.0016322092,"about_ca_topic_score_gemma":0.00096050574,"teacher_disagreement_score":0.0016322092,"about_ca_system_score_codex":0.0005025125,"about_ca_system_score_gemma":0.00062801596,"threshold_uncertainty_score":0.0069417953},"labels":[],"label_agreement":null},{"id":"W2017118179","doi":"10.1109/igarss.2015.7325699","title":"Unsupervised land-cover classification through hyper-heuristic-based Harmony Search","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Harmony search; Computer science; Land cover; Heuristic; Genetic programming; Artificial intelligence; Harmony (color); Machine learning; Cover (algebra); Pattern recognition (psychology); Land use; Engineering","score_opus":0.10815075594176088,"score_gpt":0.30295692205608277,"score_spread":0.1948061661143219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017118179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0751864,0.00020228369,0.9219261,0.00012352741,0.000020077105,0.00006790637,0.000030837597,0.00027650513,0.0021663876],"genre_scores_gemma":[0.74351364,0.00011942873,0.25365382,0.00014637139,0.000028791848,0.00022217417,0.000109341214,0.000109271576,0.0020971512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997166,0.00010244571,0.0000136594135,0.00007071238,0.000059879163,0.000036737372],"domain_scores_gemma":[0.99959236,0.00021708236,0.000067737645,0.00004306423,0.000059094564,0.000020730733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079299614,0.0005453174,0.0009835191,0.00088031177,0.00031958392,0.0007432661,0.0010726674,0.00085612776,0.0008396675],"category_scores_gemma":[0.0015472443,0.0003803491,0.0007269353,0.0007516734,0.00076850527,0.00091984856,0.00075640436,0.0005277208,0.00017646847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004047691,0.000057417197,0.00082700717,0.00002726374,0.00007685666,0.000034202683,0.00008245973,0.9419893,0.002443173,0.0045235623,0.000464465,0.049433853],"study_design_scores_gemma":[0.00000661142,0.000016680735,0.00012921993,0.0000023414464,0.0000051495294,0.000008428471,0.0000087702765,0.997632,0.0003045658,0.0017629775,0.000120120894,0.000003086453],"about_ca_topic_score_codex":0.0023679582,"about_ca_topic_score_gemma":0.0021559903,"teacher_disagreement_score":0.0023679582,"about_ca_system_score_codex":0.0005669276,"about_ca_system_score_gemma":0.0005097329,"threshold_uncertainty_score":0.0047084093},"labels":[],"label_agreement":null},{"id":"W2018463075","doi":"10.1145/1389095.1389141","title":"Nested evolution of an autonomous agent using descriptive encoding","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Neuroevolution; Computer science; Encoding (memory); Reinforcement learning; Genetic programming; Artificial intelligence; Process (computing); Evolutionary algorithm; Artificial neural network; Autonomous agent; Machine learning; Programming language","score_opus":0.05213425871765713,"score_gpt":0.26318797858109705,"score_spread":0.2110537198634399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018463075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21482481,0.00007728148,0.77969676,0.00021432244,0.000027834416,0.00006733132,0.00003427923,0.00031396555,0.004743332],"genre_scores_gemma":[0.8020644,0.00005740098,0.19489524,0.00006915017,0.000006818488,0.0000852818,0.000064593994,0.000038780003,0.0027183902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997297,0.00007854341,0.000017717584,0.000054279913,0.000095246134,0.000024474624],"domain_scores_gemma":[0.99916077,0.00038939016,0.000105024155,0.00015730908,0.00012770882,0.000059792128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007522646,0.00026699566,0.00030539552,0.0002140626,0.00022717915,0.00058420014,0.0008362696,0.0005874833,0.0009195497],"category_scores_gemma":[0.0030483014,0.00022121129,0.00035259387,0.00016761757,0.00087680225,0.0009603803,0.0006380551,0.00070868636,0.00011639496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007310484,0.00010412641,0.0022939688,0.00004457245,0.000038224007,0.00022818928,0.00028164155,0.80822754,0.018874792,0.13465698,0.00027286483,0.03490398],"study_design_scores_gemma":[0.000011241484,0.000042315856,0.00012972197,0.0000038284443,0.000007972135,0.000038866296,0.000011692504,0.98371476,0.0020098947,0.01341287,0.00060960354,0.000007263642],"about_ca_topic_score_codex":0.0016861157,"about_ca_topic_score_gemma":0.0019877658,"teacher_disagreement_score":0.0016861157,"about_ca_system_score_codex":0.00064507604,"about_ca_system_score_gemma":0.0006711531,"threshold_uncertainty_score":0.0046803355},"labels":[],"label_agreement":null},{"id":"W2018535136","doi":"10.1145/2597453.2597455","title":"DEAP","year":2014,"lang":"en","type":"article","venue":"ACM SIGEVOlution","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Python (programming language); Executable; Computer science; Programming language; Evolutionary algorithm; Evolutionary computation; Computation; Software engineering; Theoretical computer science; Artificial intelligence","score_opus":0.012173400080853441,"score_gpt":0.2369747470227567,"score_spread":0.22480134694190326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018535136","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005315547,0.0009591894,0.50420827,0.0012783015,0.0012110152,0.0007162017,0.049987786,0.2793569,0.15696675],"genre_scores_gemma":[0.08738833,0.0023170009,0.44659793,0.0029393928,0.00029958735,0.0026773126,0.1870902,0.10555153,0.1651387],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988319,0.00014888895,0.000094183444,0.0002998283,0.00046576388,0.00015941389],"domain_scores_gemma":[0.9986786,0.0003201533,0.00005100312,0.000431788,0.00039883528,0.0001196013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012890159,0.0011996615,0.0008966304,0.0011031817,0.0011759244,0.0035121525,0.0037922538,0.0013175564,0.11417837],"category_scores_gemma":[0.005555233,0.0007768743,0.0015439667,0.0011444107,0.0005997013,0.0041285967,0.0051348684,0.002374407,0.07133634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047141034,0.0001806796,0.0018032889,0.0012647987,0.0001259962,0.0003427662,0.0003625605,0.01302726,0.0057272394,0.07424439,0.7030907,0.19935882],"study_design_scores_gemma":[0.000088460576,0.00004221049,0.0005833267,0.00012220559,0.000028560338,0.00028907953,0.000086980304,0.023666456,0.0059721167,0.038576003,0.93047714,0.00006738935],"about_ca_topic_score_codex":0.0025700356,"about_ca_topic_score_gemma":0.0030483594,"teacher_disagreement_score":0.11417837,"about_ca_system_score_codex":0.0007682245,"about_ca_system_score_gemma":0.0017283881,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2022030072","doi":"10.1109/cec.2010.5586239","title":"Evolution for automatic assessment of the difficulty of sokoban boards","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Representation (politics); Computer science; Population; String (physics); Genetic programming; Simple (philosophy); Evolutionary algorithm; Sequence (biology); Genetic algorithm; Artificial intelligence; Algorithm; Theoretical computer science; Machine learning; Mathematics","score_opus":0.00906479607195665,"score_gpt":0.27877915082291754,"score_spread":0.2697143547509609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022030072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48672715,0.00011703206,0.5038276,0.00033669945,0.000045798086,0.00031667834,0.00033943373,0.0035108416,0.0047788713],"genre_scores_gemma":[0.8309784,0.000031513224,0.16647516,0.000078043224,0.000009097577,0.00017520551,0.00052891974,0.00021585017,0.0015077777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892753,0.00035947788,0.00007147425,0.00024294488,0.00030923513,0.0000893659],"domain_scores_gemma":[0.99204093,0.0054121404,0.00092488783,0.0005155873,0.000914702,0.00019166853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017849717,0.00090063544,0.0006944276,0.0019099513,0.00042331213,0.001514738,0.0011434109,0.0010862843,0.0025730687],"category_scores_gemma":[0.019629652,0.00049096404,0.0005505132,0.0005815723,0.00075534586,0.001678459,0.0009310321,0.0013242327,0.00044849276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006902188,0.00027987125,0.033608235,0.00023541051,0.00012534793,0.00014694374,0.0006680465,0.6318237,0.017612502,0.014986493,0.0027760565,0.29704714],"study_design_scores_gemma":[0.000019836347,0.00006507122,0.0026889842,0.000009835609,0.0000091863485,0.000026509762,0.000041524574,0.9906132,0.0027098414,0.0034273039,0.0003763805,0.000012329737],"about_ca_topic_score_codex":0.0031741231,"about_ca_topic_score_gemma":0.0033669292,"teacher_disagreement_score":0.0031741231,"about_ca_system_score_codex":0.0014683547,"about_ca_system_score_gemma":0.00066035934,"threshold_uncertainty_score":0.010653734},"labels":[],"label_agreement":null},{"id":"W2023328067","doi":"10.1145/1830483.1830653","title":"Object-level recombination of commodity applications","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Santa Fe Institute","keywords":"Computer science; Object (grammar); Commodity; Resolver; Ancestor; Selection (genetic algorithm); Key (lock); Simple (philosophy); Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.021521516594752002,"score_gpt":0.26155355811694203,"score_spread":0.24003204152219004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023328067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22818175,0.00031203497,0.7538088,0.00013948028,0.000054421493,0.00012211835,0.00004220925,0.002284749,0.015054436],"genre_scores_gemma":[0.6899473,0.00026457888,0.29993495,0.000077222096,0.000017348866,0.00010567699,0.00018263666,0.0006862274,0.008783979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993001,0.00014779404,0.00002988072,0.00010880244,0.00030779254,0.00010548693],"domain_scores_gemma":[0.9993272,0.00024564328,0.00006798026,0.00021671825,0.0000971106,0.00004538115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009676994,0.0003496702,0.00045771955,0.00056855177,0.000515249,0.0011944012,0.0015696663,0.00066225196,0.0022441894],"category_scores_gemma":[0.0025871329,0.00028614173,0.00042071176,0.00075286155,0.00071850716,0.00085799716,0.0014886509,0.00080326415,0.00046197826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031780644,0.00031022457,0.005128209,0.00022471983,0.000076093536,0.0012341946,0.0011429816,0.325126,0.09107444,0.16993462,0.0026030294,0.4028277],"study_design_scores_gemma":[0.000054261505,0.00028603556,0.0015423223,0.00004779295,0.000063873704,0.00089217955,0.00023597856,0.8304146,0.06936422,0.041606013,0.055435006,0.00005769011],"about_ca_topic_score_codex":0.0009397138,"about_ca_topic_score_gemma":0.0005081633,"teacher_disagreement_score":0.0022441894,"about_ca_system_score_codex":0.00062525284,"about_ca_system_score_gemma":0.00046813927,"threshold_uncertainty_score":0.0075076222},"labels":[],"label_agreement":null},{"id":"W2023975480","doi":"10.1142/s0219265909002625","title":"USING ACCURACY-BASED LEARNING CLASSIFIER SYSTEMS FOR ADAPTABLE STRATEGY GENERATION IN GAMES AND INTERACTIVE VIRTUAL SIMULATIONS","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Classifier (UML); Adaptability; Scripting language; Learning classifier system; Human–computer interaction; Unsupervised learning","score_opus":0.05289993945390044,"score_gpt":0.31284676810128415,"score_spread":0.2599468286473837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023975480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073201574,0.00010200806,0.9233345,0.00015080761,0.000038629525,0.00012555177,0.000031613105,0.0010589447,0.0019564827],"genre_scores_gemma":[0.73479146,0.00007994925,0.26345858,0.000081887665,0.000024909104,0.0001695563,0.00007746376,0.00007598387,0.0012402041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869436,0.0003809633,0.00011767538,0.00025137115,0.000456322,0.000099395096],"domain_scores_gemma":[0.9958988,0.0019617141,0.0005200016,0.000557392,0.0009466487,0.00011544575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948646,0.000478828,0.0006506785,0.00087050465,0.00046933338,0.0009968631,0.0012055517,0.0008667079,0.0010172186],"category_scores_gemma":[0.008289219,0.0002898788,0.0003900208,0.0005518823,0.0007242444,0.0012564079,0.0008130814,0.0009862111,0.00030942765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012607135,0.00024276636,0.007131473,0.00007104869,0.00007598345,0.00013704922,0.0002968003,0.6832296,0.015880533,0.011269171,0.0008890625,0.2806504],"study_design_scores_gemma":[0.0000048016027,0.00004611194,0.0004013864,0.0000038672433,0.000008228981,0.000023818888,0.000009404319,0.99318296,0.0035194953,0.0023374646,0.00045502605,0.000007504136],"about_ca_topic_score_codex":0.0033643846,"about_ca_topic_score_gemma":0.00254599,"teacher_disagreement_score":0.0033643846,"about_ca_system_score_codex":0.0010856274,"about_ca_system_score_gemma":0.00064992177,"threshold_uncertainty_score":0.010305524},"labels":[],"label_agreement":null},{"id":"W2024144496","doi":"10.1007/bf03037572","title":"Logic-based genetic programming with definite clause translation grammars","year":2001,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Definite clause grammar; Tree-adjoining grammar; Programming language; Natural language processing; Context-free grammar; Genetic programming; Artificial intelligence; Context-sensitive grammar; Rule-based machine translation; Attribute grammar; Grammar; Affix grammar; Synchronous context-free grammar; L-attributed grammar; Generative grammar; Linguistics; Example-based machine translation","score_opus":0.04981549137993206,"score_gpt":0.2629529065584332,"score_spread":0.2131374151785011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024144496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024026064,0.00008038346,0.966659,0.00018984995,0.0000375859,0.000053530694,0.000052806576,0.00058841356,0.008312325],"genre_scores_gemma":[0.48159325,0.00014713967,0.5110886,0.00018671909,0.000024061455,0.00013246477,0.00022582519,0.00017956753,0.0064223786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996772,0.00010535156,0.0000140974425,0.000054156844,0.00011486356,0.00003432302],"domain_scores_gemma":[0.9994338,0.0003938406,0.000025189109,0.000049434,0.00007769528,0.000020123267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050947425,0.00029871333,0.00040622946,0.0004332947,0.00042924692,0.001013431,0.0013410086,0.00080131425,0.003676168],"category_scores_gemma":[0.0019268951,0.00027370497,0.00055751996,0.0005723136,0.0010632845,0.00091937016,0.000754249,0.0010330476,0.00045837602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011145466,0.00010966928,0.00046811486,0.00008616212,0.000031580716,0.00019231594,0.00019298085,0.54046774,0.0053931386,0.32577685,0.0019765573,0.1251935],"study_design_scores_gemma":[0.00003086016,0.000021436103,0.000060612456,0.00001027926,0.000013178984,0.00003168298,0.000020345387,0.908129,0.0020051694,0.08826293,0.001405314,0.000009230347],"about_ca_topic_score_codex":0.0034302236,"about_ca_topic_score_gemma":0.003917035,"teacher_disagreement_score":0.003676168,"about_ca_system_score_codex":0.00084826536,"about_ca_system_score_gemma":0.0007410778,"threshold_uncertainty_score":0.012298048},"labels":[],"label_agreement":null},{"id":"W2024519280","doi":"10.1016/j.mechatronics.2011.11.012","title":"Design evolution of mechatronic systems through modeling, on-line monitoring, and evolutionary optimization","year":2012,"lang":"en","type":"article","venue":"Mechatronics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Mechatronics; Genetic programming; Control engineering; Conveyor system; MATLAB; Computer-automated design; Domain (mathematical analysis); Systems design; Computer science; Engineering; Systems engineering; Artificial intelligence","score_opus":0.04281174981100926,"score_gpt":0.26963445309039136,"score_spread":0.2268227032793821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024519280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03935326,0.00016262832,0.95407724,0.00020597002,0.000021292093,0.00005104313,0.000021455895,0.00020830495,0.005898763],"genre_scores_gemma":[0.8717406,0.00025312894,0.12460619,0.00006153203,0.000014859715,0.00015275697,0.00006442282,0.00007418939,0.0030322406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949586,0.0001935102,0.000017237477,0.00007302501,0.00017726565,0.000042986252],"domain_scores_gemma":[0.99934,0.00031076322,0.00012844705,0.00008936283,0.00010719019,0.000024180656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008135089,0.0008154973,0.0008656283,0.000535464,0.00038612983,0.0012063748,0.0010764309,0.001069247,0.0012830122],"category_scores_gemma":[0.00278389,0.00057192723,0.00072116783,0.00040377438,0.0006532267,0.0010308502,0.0009345408,0.0008268192,0.0001912421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011109806,0.00002171849,0.00024780372,0.000015271833,0.000014422227,0.000016313843,0.000021476231,0.98371756,0.000822401,0.0028170296,0.00008239129,0.012212498],"study_design_scores_gemma":[0.0000028393597,0.000011948076,0.000052837477,0.0000028542863,0.000003934811,0.000005490543,0.000003308896,0.9982836,0.0002533223,0.0012090662,0.00016922913,0.0000016542327],"about_ca_topic_score_codex":0.0044381074,"about_ca_topic_score_gemma":0.0031953494,"teacher_disagreement_score":0.0044381074,"about_ca_system_score_codex":0.0008068775,"about_ca_system_score_gemma":0.0008306448,"threshold_uncertainty_score":0.008824527},"labels":[],"label_agreement":null},{"id":"W2025201938","doi":"10.1142/s1469026805001441","title":"USING COMPETITIVE CO-EVOLUTION TO EVOLVE BETTER PATTERN RECOGNISERS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Task (project management); Software; Binary number; Artificial intelligence; Reliability (semiconductor); Base (topology); Pattern recognition (psychology); Arithmetic","score_opus":0.03700165440096965,"score_gpt":0.3397540574526187,"score_spread":0.3027524030516491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025201938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2661085,0.0002777712,0.72124934,0.00037116423,0.0001608828,0.00020280242,0.000077733326,0.0022236556,0.0093281595],"genre_scores_gemma":[0.59701985,0.00012280942,0.39490557,0.00032317208,0.000046581248,0.00030028756,0.00028828377,0.00048264128,0.006510772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990004,0.0002425114,0.00006758142,0.00025340728,0.00032499773,0.00011115038],"domain_scores_gemma":[0.9962704,0.0016667546,0.00025314148,0.0006938945,0.00092614384,0.00018966709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002330384,0.00091962115,0.00090020435,0.0010332892,0.00055517745,0.0013807412,0.0016792933,0.0015795535,0.0030527464],"category_scores_gemma":[0.009489499,0.0005675734,0.0007106169,0.0007076572,0.00087789266,0.0012911544,0.0016277907,0.0010195373,0.0010022345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026046543,0.00031742323,0.005939314,0.00021057871,0.00024347329,0.0004648334,0.00064040645,0.5568108,0.09186797,0.019972349,0.0028193921,0.32045302],"study_design_scores_gemma":[0.000018073017,0.00008117162,0.00026762005,0.0000053680924,0.000023353025,0.00008591734,0.000020273657,0.9856205,0.009535384,0.0024618055,0.0018655928,0.000015105753],"about_ca_topic_score_codex":0.0016924057,"about_ca_topic_score_gemma":0.001705975,"teacher_disagreement_score":0.0030527464,"about_ca_system_score_codex":0.0008220992,"about_ca_system_score_gemma":0.00061194773,"threshold_uncertainty_score":0.012324333},"labels":[],"label_agreement":null},{"id":"W2025458325","doi":"10.1145/1143997.1144159","title":"Improving GP classifier generalization using a cluster separation metric","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Genetic programming; Computer science; Classifier (UML); Artificial intelligence; Machine learning; Cluster analysis; Fitness function; Maximization; Generalization; Genetic algorithm; Mathematical optimization; Mathematics","score_opus":0.019611863531352507,"score_gpt":0.27277440334368325,"score_spread":0.2531625398123307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025458325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08876244,0.00026065714,0.9052854,0.0005880013,0.000050561925,0.00007634747,0.00006471207,0.00097216613,0.0039396184],"genre_scores_gemma":[0.71743196,0.0001960176,0.27886817,0.00029849293,0.00006625845,0.00015970852,0.00026740637,0.00024170274,0.0024702267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910873,0.00025203632,0.000044635704,0.00023516666,0.00027265167,0.00008675349],"domain_scores_gemma":[0.9972982,0.0014115949,0.00019617849,0.0004279968,0.00059393933,0.00007212517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023369128,0.00086261233,0.0011745985,0.00097323494,0.00056722027,0.0011235805,0.0012515523,0.002001678,0.0011390797],"category_scores_gemma":[0.009698414,0.00028818054,0.0006564376,0.0012439456,0.0007577636,0.0014743109,0.0014528959,0.0018920063,0.0005125238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010851765,0.00015321534,0.0022373134,0.00006853854,0.00010357551,0.00011232181,0.00016701748,0.70727086,0.010623412,0.013323887,0.0035412996,0.26229006],"study_design_scores_gemma":[0.000007704349,0.000024499552,0.00031653338,0.0000049193363,0.0000105697245,0.00002494248,0.0000121518215,0.9940392,0.0013487424,0.0038626571,0.0003436162,0.0000043917776],"about_ca_topic_score_codex":0.0031163371,"about_ca_topic_score_gemma":0.002395804,"teacher_disagreement_score":0.0031163371,"about_ca_system_score_codex":0.00097172474,"about_ca_system_score_gemma":0.0010487036,"threshold_uncertainty_score":0.0123589635},"labels":[],"label_agreement":null},{"id":"W2025620430","doi":"10.1145/2598394.2598488","title":"On improving grammatical evolution performance in symbolic regression with attribute grammar","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Science Foundation Ireland","keywords":"Grammatical evolution; Symbolic regression; Computer science; Grammar; Natural language processing; Artificial intelligence; Linguistics; Genetic programming","score_opus":0.0073717154893587385,"score_gpt":0.21380086865900755,"score_spread":0.2064291531696488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025620430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17618929,0.0004774602,0.81672066,0.000316293,0.000052199022,0.00005105801,0.000034611483,0.0012361048,0.0049223956],"genre_scores_gemma":[0.69111687,0.00047217053,0.3057003,0.00018558762,0.000041678857,0.00006537941,0.00015223218,0.0003584733,0.0019073811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.00065652514,0.00006547422,0.00018190405,0.00035029498,0.00009452307],"domain_scores_gemma":[0.995453,0.00353876,0.00015971987,0.00040970722,0.0003796812,0.000059039066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026203378,0.0007226859,0.0006716045,0.0008393287,0.00034318696,0.0007825617,0.00088074553,0.0008194365,0.0013450942],"category_scores_gemma":[0.012614985,0.00019149118,0.0005443186,0.00090799644,0.0008812803,0.0012508901,0.0013184092,0.0011476874,0.00032100565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008403712,0.00010368326,0.0046658963,0.00013827976,0.00007990755,0.00019805053,0.00033704587,0.6014324,0.01569733,0.02440971,0.0008757167,0.351978],"study_design_scores_gemma":[0.000014959774,0.00009118074,0.00059384946,0.000013919091,0.00003232023,0.00008674538,0.000034346154,0.98478186,0.005261188,0.007748176,0.0013314587,0.000009992614],"about_ca_topic_score_codex":0.0015640953,"about_ca_topic_score_gemma":0.0013541456,"teacher_disagreement_score":0.0026203378,"about_ca_system_score_codex":0.00040543659,"about_ca_system_score_gemma":0.0007297279,"threshold_uncertainty_score":0.0138578415},"labels":[],"label_agreement":null},{"id":"W2026440556","doi":"10.1007/s10710-011-9144-3","title":"The evolution of higher-level biochemical reaction models","year":2011,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genetic programming; Computer science; Programming language; Syntax; Construct (python library); Feature (linguistics); Artificial intelligence; Domain (mathematical analysis); Interface (matter); Grammar; Theoretical computer science; Grammatical evolution; Machine learning","score_opus":0.029252218412441498,"score_gpt":0.23690475355481502,"score_spread":0.20765253514237353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026440556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36896786,0.0014197688,0.6071982,0.0013369867,0.00018227281,0.00005137462,0.00020858414,0.0006366237,0.01999835],"genre_scores_gemma":[0.91845703,0.0008989182,0.07367876,0.00011529152,0.000059808168,0.00007933965,0.0001778152,0.00011633459,0.006416808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00015145121,0.000018307821,0.0000615334,0.00010686912,0.000058384012],"domain_scores_gemma":[0.99876595,0.00075885054,0.00014057345,0.00017139656,0.00008611992,0.00007711565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085367175,0.0006693294,0.0012535391,0.00065829454,0.0006941162,0.0020773504,0.0016399949,0.002007714,0.0022416092],"category_scores_gemma":[0.0036233207,0.00061991607,0.0016695514,0.00074914226,0.001622061,0.00217963,0.0010022842,0.0014949562,0.00034311973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025038482,0.000039596292,0.0004734814,0.000038213293,0.000028515406,0.000067916095,0.000072563205,0.84865016,0.0013528506,0.14459117,0.00020214464,0.004458496],"study_design_scores_gemma":[0.000010492965,0.000006815821,0.00009384826,0.0000027316753,0.000006179518,0.000012707184,0.0000051422326,0.94446075,0.0002975415,0.054646436,0.00045086598,0.000006334398],"about_ca_topic_score_codex":0.004699086,"about_ca_topic_score_gemma":0.0033034915,"teacher_disagreement_score":0.004699086,"about_ca_system_score_codex":0.0017578512,"about_ca_system_score_gemma":0.001067074,"threshold_uncertainty_score":0.012754142},"labels":[],"label_agreement":null},{"id":"W2026638829","doi":"10.1109/ismvl.2013.40","title":"Noise-Tolerant Model of a Ternary Inverter Based on Markov Random Field","year":2013,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Ternary operation; Noise (video); Computer science; Inverter; Noise immunity; Electronic engineering; CMOS; Markov chain; Markov random field; Spice; Field (mathematics); Markov model; Markov process; Algorithm; Electrical engineering; Mathematics; Artificial intelligence; Engineering; Telecommunications; Transmission (telecommunications); Machine learning; Voltage; Statistics","score_opus":0.010830345948985576,"score_gpt":0.21248739288795632,"score_spread":0.20165704693897074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026638829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14992197,0.00082147605,0.8227578,0.00072575046,0.00022801108,0.00014705239,0.0003880471,0.00069013296,0.024319852],"genre_scores_gemma":[0.97635424,0.00043144973,0.017573586,0.000091951275,0.000050328905,0.00009087385,0.00008294344,0.000046171142,0.005278531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975604,0.000060277325,0.000010987077,0.00004735907,0.000081878316,0.00004347803],"domain_scores_gemma":[0.9997378,0.00010790799,0.0000506381,0.000025788464,0.00005930241,0.000018449335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035604875,0.00043844664,0.0008192296,0.0005920925,0.00062173256,0.0006980048,0.0014184706,0.0011350574,0.0023132865],"category_scores_gemma":[0.00062326324,0.00023006363,0.0007584767,0.00044381816,0.00065839145,0.0010804135,0.00031064515,0.0005315474,0.0003128317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013606751,0.000058818398,0.0005590495,0.00009634011,0.00004620413,0.00040221075,0.000111749134,0.8574718,0.017085735,0.11667477,0.00080500287,0.0065522245],"study_design_scores_gemma":[0.0000060240422,0.00003317394,0.00006260373,0.0000039408155,0.000009629193,0.000038538707,0.000004105647,0.99483263,0.0005179473,0.0042509786,0.0002342989,0.000006026576],"about_ca_topic_score_codex":0.0037044783,"about_ca_topic_score_gemma":0.00298899,"teacher_disagreement_score":0.0037044783,"about_ca_system_score_codex":0.00093037717,"about_ca_system_score_gemma":0.0007432997,"threshold_uncertainty_score":0.0077387094},"labels":[],"label_agreement":null},{"id":"W2027203222","doi":"10.1109/cec.2012.6252905","title":"Use of evolutionary computation techniques for exploration and prediction of helicopter loads","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"Defence Science and Technology Group","keywords":"Particle swarm optimization; Evolutionary computation; Computer science; Genetic algorithm; Differential evolution; Evolutionary algorithm; Computation; Genetic programming; Control theory (sociology); Artificial neural network; Mathematical optimization; Artificial intelligence; Algorithm; Machine learning; Mathematics; Control (management)","score_opus":0.05857261462961532,"score_gpt":0.27881530879459965,"score_spread":0.22024269416498432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027203222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21658638,0.00043912037,0.77917135,0.00023362579,0.000017341445,0.00005063597,0.00003945207,0.00024146543,0.0032205526],"genre_scores_gemma":[0.86838955,0.00020987495,0.13064368,0.000028049293,0.00000869249,0.000060811537,0.000047881334,0.000020817386,0.00059064047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.00006964064,0.000012369459,0.000028139215,0.0000613165,0.000012144171],"domain_scores_gemma":[0.9993088,0.00046456815,0.00007865206,0.00004299785,0.000095509415,0.000009412427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067740533,0.000505578,0.0003363613,0.0007243542,0.00025854792,0.00043952983,0.0002995358,0.00039513686,0.00039968643],"category_scores_gemma":[0.0028272092,0.00028196792,0.0003377414,0.00044284156,0.00034925944,0.0005121568,0.0002992187,0.0004298769,0.00004989254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013030439,0.000016648743,0.0018317356,0.000012908362,0.000022776021,0.000021718133,0.000027179014,0.9620098,0.0009882777,0.0017107433,0.000049397328,0.033295806],"study_design_scores_gemma":[0.0000018631251,0.00000990237,0.00036785926,0.0000034973332,0.0000031105658,0.0000061456076,0.0000049698547,0.9984812,0.00032190967,0.0006912764,0.00010630255,0.000001933757],"about_ca_topic_score_codex":0.0049511115,"about_ca_topic_score_gemma":0.003566123,"teacher_disagreement_score":0.0049511115,"about_ca_system_score_codex":0.00040251747,"about_ca_system_score_gemma":0.00045469392,"threshold_uncertainty_score":0.009844601},"labels":[],"label_agreement":null},{"id":"W2027249873","doi":"10.1155/2013/578710","title":"Discrete Artificial Bee Colony for Computationally Efficient Symbol Detection in Multidevice STBC MIMO Systems","year":2013,"lang":"en","type":"article","venue":"Advances in Artificial Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Space–time block code; Computer science; MIMO; Artificial bee colony algorithm; Decoding methods; Block (permutation group theory); Minimum mean square error; Mathematical optimization; Block code; Mathematics; Statistics; Artificial intelligence; Estimator; Telecommunications","score_opus":0.022967987309282987,"score_gpt":0.3076158358688979,"score_spread":0.2846478485596149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027249873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08099043,0.000567534,0.9121503,0.00028970715,0.00007800731,0.000045034205,0.00002160264,0.00031921564,0.005538148],"genre_scores_gemma":[0.8062416,0.00017960236,0.19156508,0.0000790783,0.000011493645,0.0000678623,0.00002639139,0.000020257612,0.0018085813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.000055289376,0.00000750294,0.000017218517,0.00007178899,0.0000149051075],"domain_scores_gemma":[0.99961615,0.00021698818,0.00003596209,0.00003202047,0.00007809191,0.000020762845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026026435,0.0003082966,0.00036777148,0.00020006725,0.00027557663,0.0003968034,0.00043849385,0.0004920827,0.00058921694],"category_scores_gemma":[0.00097419374,0.00012422062,0.00018420107,0.000230581,0.00029759307,0.00030985777,0.00035928082,0.00047143968,0.00009808799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007490829,0.000043520402,0.0006642797,0.00006925354,0.000035967616,0.00020509383,0.00008958109,0.89391136,0.018380066,0.0124981105,0.0010697125,0.07295813],"study_design_scores_gemma":[0.0000046276236,0.000016465192,0.000041320764,0.0000017621793,0.0000019291783,0.00001786041,0.00000255607,0.99831855,0.0008202155,0.0005137501,0.00025887715,0.0000021218978],"about_ca_topic_score_codex":0.0013679718,"about_ca_topic_score_gemma":0.0017757905,"teacher_disagreement_score":0.0013679718,"about_ca_system_score_codex":0.00032761114,"about_ca_system_score_gemma":0.00037293,"threshold_uncertainty_score":0.002720058},"labels":[],"label_agreement":null},{"id":"W2029064195","doi":"10.1016/j.tcs.2008.09.027","title":"A cyclic binary morphism avoiding Abelian fourth powers","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Mathematics; Binary number; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.013840604077014223,"score_gpt":0.23986156262289027,"score_spread":0.22602095854587603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029064195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7344528,0.00036860982,0.098901704,0.0011028689,0.0006896656,0.000064317566,0.00014636872,0.0005484121,0.16372529],"genre_scores_gemma":[0.9129912,0.00024549995,0.021722345,0.00034000564,0.0002121076,0.000047169262,0.000110029054,0.0002911966,0.064040355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959093,0.000077352364,0.000017232476,0.0000802856,0.00010675105,0.00012734316],"domain_scores_gemma":[0.99905306,0.0003333255,0.000112226735,0.00016825809,0.0001278682,0.00020520318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036657872,0.00048278345,0.0005989801,0.0015603482,0.001926124,0.0019247332,0.00053240487,0.0011558733,0.010078091],"category_scores_gemma":[0.0012783307,0.00042079578,0.00067643856,0.0010540602,0.0022503575,0.0024735923,0.0023161385,0.0017262619,0.0015336929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008489385,0.000031308806,0.00027488355,0.000038338076,0.0000073615347,0.00029083592,0.00029724606,0.00046403985,0.0051046214,0.98351157,0.0010562355,0.008838709],"study_design_scores_gemma":[0.000041072133,0.0000873518,0.00044732806,0.00003082674,0.000024058958,0.000946769,0.00023072657,0.0037786777,0.0054341033,0.97120315,0.017735744,0.000040123145],"about_ca_topic_score_codex":0.00043086213,"about_ca_topic_score_gemma":0.00032605478,"teacher_disagreement_score":0.010078091,"about_ca_system_score_codex":0.0008038282,"about_ca_system_score_gemma":0.00048545835,"threshold_uncertainty_score":0.033714592},"labels":[],"label_agreement":null},{"id":"W2030792885","doi":"10.1007/s10710-010-9113-2","title":"Open issues in genetic programming","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Computer science; Genetic programming; Mainstream; Field (mathematics); Face (sociological concept); Range (aeronautics); Data science; Artificial intelligence; Management science; Operations research; Sociology; Mathematics; Political science","score_opus":0.01086872803388606,"score_gpt":0.2758444820490048,"score_spread":0.26497575401511875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030792885","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020588238,0.1310461,0.39897025,0.16176954,0.0107539985,0.00007199807,0.00020238222,0.0003080183,0.27628952],"genre_scores_gemma":[0.69273955,0.067668945,0.12804163,0.017924087,0.03184525,0.00045816175,0.00036493817,0.0005257401,0.060431793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940023,0.0031831462,0.00023524024,0.00080680463,0.0014665126,0.0003060446],"domain_scores_gemma":[0.97984594,0.016373368,0.00033387128,0.0015505865,0.0014736543,0.00042261975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066066687,0.00074136246,0.0016067924,0.0014974609,0.004126803,0.0092619425,0.0030263097,0.007344179,0.009677608],"category_scores_gemma":[0.033541508,0.00093250856,0.0011140084,0.0030542514,0.014781039,0.024905153,0.0038357743,0.012521769,0.0019708092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009935201,0.00001697928,0.00004772586,0.000042079988,0.000005858667,0.000016108623,0.00014121422,0.0008674645,0.000021589954,0.98607314,0.0034030387,0.009354997],"study_design_scores_gemma":[0.0000034723325,0.000002279097,0.000014160044,0.00002272444,0.0000016761871,0.0000090196445,0.000031111438,0.0011271094,0.000016899952,0.99199134,0.0067770286,0.0000032986748],"about_ca_topic_score_codex":0.0018772279,"about_ca_topic_score_gemma":0.0010943714,"teacher_disagreement_score":0.009677608,"about_ca_system_score_codex":0.003006213,"about_ca_system_score_gemma":0.0016839412,"threshold_uncertainty_score":0.034939826},"labels":[],"label_agreement":null},{"id":"W2033905545","doi":"10.1007/s10710-014-9234-0","title":"Exploring non-photorealistic rendering with genetic programming","year":2014,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Genetic programming; Rendering (computer graphics); Computer graphics (images); Artificial intelligence; Human–computer interaction","score_opus":0.025256679513746137,"score_gpt":0.22603377179609863,"score_spread":0.2007770922823525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033905545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08753537,0.0006288344,0.8655257,0.0005247953,0.000122001176,0.000079033314,0.000063364525,0.0008626772,0.04465813],"genre_scores_gemma":[0.7356091,0.00054112094,0.25303376,0.00022438454,0.000039896386,0.00005656787,0.00008372045,0.00049770117,0.0099137835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999764,0.000060292175,0.0000049324035,0.000038127837,0.00010323067,0.000029495748],"domain_scores_gemma":[0.999582,0.0002712935,0.00002156663,0.00006957413,0.00003507798,0.00002048611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045039586,0.000676515,0.0006272066,0.00037687295,0.00049066654,0.0019560682,0.0012673036,0.0011533079,0.0063236877],"category_scores_gemma":[0.0016992802,0.0005621248,0.00089076767,0.00034764712,0.0013039451,0.0015243217,0.0014415488,0.0015195017,0.00056645065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016867333,0.00014369449,0.00061811926,0.00036607444,0.00010286083,0.00051629666,0.00078030705,0.60372436,0.08099923,0.22210677,0.0027123208,0.08776132],"study_design_scores_gemma":[0.000041829175,0.000045110264,0.00016226838,0.00003179708,0.00001613612,0.00015640075,0.00012309413,0.92002666,0.0067740786,0.06781107,0.0047860914,0.000025431675],"about_ca_topic_score_codex":0.0018947923,"about_ca_topic_score_gemma":0.0022971218,"teacher_disagreement_score":0.0063236877,"about_ca_system_score_codex":0.00081160414,"about_ca_system_score_gemma":0.00045705924,"threshold_uncertainty_score":0.02115488},"labels":[],"label_agreement":null},{"id":"W2035498056","doi":"10.1109/cec.2009.4982964","title":"Augmenting artificial development with local fitness","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fitness function; Computer science; Neighbourhood (mathematics); Process (computing); Fitness landscape; Artificial intelligence; Hill climbing; Artificial life; Function (biology); Fitness approximation; Mathematical optimization; Machine learning; Mathematics; Genetic algorithm; Biology","score_opus":0.014645464186212622,"score_gpt":0.23226685927047466,"score_spread":0.21762139508426204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035498056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1020214,0.0004975319,0.88718104,0.00036746333,0.00004005486,0.00008513322,0.000029656701,0.00044703885,0.009330664],"genre_scores_gemma":[0.7214557,0.0004132604,0.27409875,0.00010773343,0.00002949206,0.00025060063,0.000053394968,0.000129652,0.0034614152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941325,0.00027867788,0.000029503793,0.000074165604,0.00016244414,0.000041985764],"domain_scores_gemma":[0.9978005,0.0014475951,0.00018259602,0.00033130564,0.00017919668,0.000058698282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014225866,0.00073965895,0.00075457495,0.0006811244,0.00048443265,0.0007190682,0.0011623534,0.0009378082,0.0016563698],"category_scores_gemma":[0.0048541776,0.00039132542,0.00048251086,0.00043671264,0.0015861735,0.0011165933,0.002264199,0.0008334554,0.0002955691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003708603,0.000044707074,0.0014595486,0.00015316637,0.000039991555,0.00014828116,0.00018335966,0.8717983,0.008959631,0.06877473,0.0003797835,0.04802147],"study_design_scores_gemma":[0.000020346522,0.00009204065,0.0002522692,0.00001713792,0.000019564875,0.00008683845,0.00002344449,0.96559036,0.0025293494,0.028417155,0.0029367534,0.000014701736],"about_ca_topic_score_codex":0.00095339504,"about_ca_topic_score_gemma":0.0012108813,"teacher_disagreement_score":0.0016563698,"about_ca_system_score_codex":0.00079001236,"about_ca_system_score_gemma":0.0005064003,"threshold_uncertainty_score":0.0075234175},"labels":[],"label_agreement":null},{"id":"W2036733311","doi":"10.1109/wisp.2007.4447575","title":"A Genetic Programming Approach for Classification of Textures Based on Wavelet Analysis","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Genetic programming; Computer science; Wavelet; Contextual image classification; Majority rule; Class (philosophy); Energy (signal processing); Set (abstract data type); Texture (cosmology); Wavelet transform; Image (mathematics); Mathematics; Statistics","score_opus":0.024246397720959607,"score_gpt":0.275863952962709,"score_spread":0.2516175552417494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036733311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014555798,0.00014085328,0.9837959,0.00012499493,0.000031378004,0.000048062197,0.00002178299,0.00019451717,0.0010867787],"genre_scores_gemma":[0.24893242,0.00035797746,0.7478634,0.00020223104,0.0000653213,0.000324454,0.00014266204,0.00007592696,0.002035622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995976,0.00009618299,0.000024877912,0.00010006714,0.00014530678,0.000035984027],"domain_scores_gemma":[0.999468,0.0003127944,0.000058899528,0.00003200776,0.000108088236,0.000020278094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007701886,0.0006624666,0.0008563317,0.0011067569,0.0003478603,0.0007008918,0.0011296527,0.00093774823,0.0008278969],"category_scores_gemma":[0.0019267091,0.0003458259,0.00088111486,0.00077501236,0.0006041552,0.0006124417,0.00042284356,0.0010254668,0.00020510191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006068303,0.00017884345,0.0024792298,0.00013311078,0.00015247698,0.00018383306,0.00015512796,0.6377293,0.016440999,0.015902283,0.000980307,0.32560384],"study_design_scores_gemma":[0.0000075958087,0.000033872842,0.00022909233,0.000008342833,0.00001688025,0.000041636704,0.000011954329,0.99317074,0.0017750725,0.0041505406,0.00054568436,0.000008742489],"about_ca_topic_score_codex":0.0026670608,"about_ca_topic_score_gemma":0.0018579733,"teacher_disagreement_score":0.0026670608,"about_ca_system_score_codex":0.0004890353,"about_ca_system_score_gemma":0.00052751537,"threshold_uncertainty_score":0.005303085},"labels":[],"label_agreement":null},{"id":"W2037379710","doi":"10.1145/1569901.1570226","title":"Benchmarking coevolutionary teaming under classification problems with large attribute spaces","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Benchmarking; Computer science; Population; Artificial intelligence; Selection (genetic algorithm); Feature (linguistics); Machine learning; Trait; Genetic programming; Metaphor; Data mining; Programming language","score_opus":0.020640128224229705,"score_gpt":0.24580354529586954,"score_spread":0.22516341707163984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037379710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83705366,0.0005126797,0.15767662,0.00045328902,0.000048373746,0.00009704565,0.000073135656,0.00029769551,0.003787565],"genre_scores_gemma":[0.95311975,0.000087535765,0.045961216,0.0000376084,0.000012826365,0.00007273314,0.00012655304,0.00002934064,0.00055242586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737525,0.0017151437,0.000116353905,0.00027266002,0.00035107168,0.00016941264],"domain_scores_gemma":[0.98912585,0.008749348,0.00030751448,0.00076836656,0.000775719,0.0002732259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008024226,0.00072488753,0.0011135107,0.0011331199,0.00061293185,0.0013503007,0.0013986896,0.0013162587,0.0007176259],"category_scores_gemma":[0.017086206,0.0002036051,0.00063908304,0.0015648729,0.00093027885,0.0013222024,0.0011818053,0.0013571564,0.00012405195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014517065,0.00022791636,0.0033727058,0.000058768233,0.00007479874,0.000034864086,0.00009832202,0.952334,0.00053656386,0.0036113695,0.00050056964,0.039005034],"study_design_scores_gemma":[0.0000071475893,0.000054359323,0.00029217868,0.0000021982567,0.0000032284772,0.0000068990275,0.000017031882,0.9977818,0.00033516597,0.0014333443,0.000064216496,0.0000023293178],"about_ca_topic_score_codex":0.004392614,"about_ca_topic_score_gemma":0.0022996792,"teacher_disagreement_score":0.008024226,"about_ca_system_score_codex":0.001110324,"about_ca_system_score_gemma":0.0006437942,"threshold_uncertainty_score":0.04243672},"labels":[],"label_agreement":null},{"id":"W2038520478","doi":"10.1016/j.clinbiochem.2008.08.053","title":"Assessing state-of-the-quality of Jaffe creatinine assay results using proficiency testing data","year":2008,"lang":"en","type":"article","venue":"Clinical Biochemistry","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Shared Health","funders":"","keywords":"Interpretability; Overfitting; Fuzzy logic; Artificial intelligence; Computer science; Fuzzy rule; Data mining; Fuzzy set; Mathematics; Machine learning; Algorithm; Artificial neural network","score_opus":0.3562387174778899,"score_gpt":0.46575963967973244,"score_spread":0.10952092220184256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038520478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93200386,0.0006091899,0.065349124,0.00022149667,0.000028173734,0.000034114677,0.00047409337,0.0003744262,0.0009055141],"genre_scores_gemma":[0.98870546,0.0000856436,0.010443063,0.00003508674,0.000011128792,0.000005696854,0.0005152597,0.000020908376,0.00017789721],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99308515,0.003667679,0.00064447743,0.0010136119,0.0012364525,0.00035270865],"domain_scores_gemma":[0.9409264,0.04434059,0.0042013936,0.003067246,0.0068656416,0.00059872563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014838429,0.00065784674,0.000809666,0.0026048708,0.00035313496,0.0025935709,0.0010034622,0.0017030953,0.0005354359],"category_scores_gemma":[0.057116162,0.00029993674,0.0008543823,0.0013648096,0.0006587241,0.00147557,0.00074222346,0.00074974715,0.0003120334],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011272385,0.00022388423,0.8624045,0.000098622004,0.00064425706,0.00012263458,0.00024226686,0.0349343,0.006502008,0.00041042903,0.0006468662,0.092642985],"study_design_scores_gemma":[0.00005901074,0.00074710406,0.34788567,0.00005601429,0.00034215584,0.00062005594,0.00027183656,0.61969787,0.026763758,0.0024315878,0.0010409123,0.0000839608],"about_ca_topic_score_codex":0.003947388,"about_ca_topic_score_gemma":0.003187858,"teacher_disagreement_score":0.014838429,"about_ca_system_score_codex":0.0005948875,"about_ca_system_score_gemma":0.0006834034,"threshold_uncertainty_score":0.078474045},"labels":[],"label_agreement":null},{"id":"W2039519793","doi":"10.1109/wi-iat.2012.33","title":"A Hybrid Cooperative Behavior Learning Method for a Rule-Based Shout-Ahead Architecture","year":2012,"lang":"en","type":"article","venue":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reinforcement learning; Computer science; Architecture; Task (project management); Set (abstract data type); Artificial intelligence; Quality (philosophy); Hybrid learning; Machine learning; Evolutionary computation; Engineering","score_opus":0.052807967095892486,"score_gpt":0.34034085949843534,"score_spread":0.2875328924025429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039519793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007980084,0.000038917624,0.9898107,0.00006666423,0.00001591078,0.000056848545,0.000008364083,0.0003879787,0.0016344979],"genre_scores_gemma":[0.3402515,0.00007430127,0.6520872,0.00013971352,0.000023574588,0.00034824558,0.000060512717,0.00010155878,0.006913285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993988,0.00016514739,0.000031386768,0.00013000898,0.00022486942,0.000049814127],"domain_scores_gemma":[0.9991928,0.00032008515,0.00006134082,0.0001386206,0.00022298752,0.00006419139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011689061,0.000560108,0.00053810125,0.00053480297,0.00048481813,0.00064832874,0.0019995112,0.0010036124,0.0035188908],"category_scores_gemma":[0.0021585575,0.0004098528,0.0005590178,0.00036012044,0.00088802195,0.0010361109,0.0010666385,0.0011070056,0.00067650015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013621333,0.00031391648,0.0015565214,0.00011285011,0.00013579038,0.0002222232,0.00041019227,0.5903579,0.016851926,0.041948956,0.0018783893,0.3460751],"study_design_scores_gemma":[0.0000106985635,0.0000327244,0.00006539773,0.0000044997787,0.000007725408,0.000020239342,0.000009075337,0.9942063,0.0012034518,0.003679528,0.00075388566,0.000006365993],"about_ca_topic_score_codex":0.0034277337,"about_ca_topic_score_gemma":0.00403347,"teacher_disagreement_score":0.0035188908,"about_ca_system_score_codex":0.00057350623,"about_ca_system_score_gemma":0.00091954053,"threshold_uncertainty_score":0.011771798},"labels":[],"label_agreement":null},{"id":"W2041594468","doi":"10.1145/2001858.2002034","title":"Implementing cartesian genetic programming classifiers on graphics processing units using GPU.NET","year":2011,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Graphics; Computer graphics (images); General-purpose computing on graphics processing units; Net (polyhedron); Graphics processing unit; Artificial intelligence; CUDA; Computer vision; Parallel computing; Mathematics","score_opus":0.07708339317233583,"score_gpt":0.28245169241916546,"score_spread":0.20536829924682964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041594468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037668917,0.0000891752,0.9499245,0.00012548953,0.00006355899,0.00005003697,0.000058567915,0.007119522,0.0049001854],"genre_scores_gemma":[0.22031327,0.00010317588,0.77521646,0.00010686992,0.000018385559,0.00009308399,0.00019898733,0.0004982802,0.0034514996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973017,0.00006494953,0.000019983238,0.00005469486,0.000099488694,0.000030628533],"domain_scores_gemma":[0.9995053,0.00020499283,0.00003537922,0.00007270965,0.00016299263,0.00001858799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005957834,0.00037623526,0.00040947084,0.00042592804,0.0003069288,0.00094676437,0.0008845086,0.00042174794,0.0028418638],"category_scores_gemma":[0.0020090118,0.00021979155,0.00032496924,0.00042259065,0.00033575864,0.0007739013,0.00039215336,0.0006018597,0.0008767859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032183353,0.00012960575,0.0046188342,0.00018628765,0.000079849764,0.0003707943,0.0003971306,0.2191834,0.048713982,0.04286535,0.009433044,0.6736998],"study_design_scores_gemma":[0.000029245866,0.000051972376,0.0004678861,0.000016998225,0.000016720845,0.000103677296,0.00002323761,0.96166253,0.01899142,0.0071871863,0.011434288,0.00001485309],"about_ca_topic_score_codex":0.0036475773,"about_ca_topic_score_gemma":0.0031109035,"teacher_disagreement_score":0.0036475773,"about_ca_system_score_codex":0.00051274104,"about_ca_system_score_gemma":0.0006199122,"threshold_uncertainty_score":0.009506941},"labels":[],"label_agreement":null},{"id":"W2042336188","doi":"10.1109/cec.2009.4983151","title":"Techniques for evolutionary rule discovery in data mining","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; K-optimal pattern discovery; Business process discovery; Knowledge extraction; Evolutionary computation; Process (computing); Task (project management); Data mining; Evolutionary algorithm; Machine learning; Artificial intelligence; Data science; Work in process; Engineering","score_opus":0.03311982567617482,"score_gpt":0.301686815609515,"score_spread":0.26856698993334016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042336188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014078409,0.0009345757,0.9960375,0.00018598067,0.000038170416,0.000104635175,0.000028538903,0.00022446089,0.001038368],"genre_scores_gemma":[0.024370914,0.0010323533,0.9729801,0.0001456822,0.00006139188,0.0002873172,0.00011425811,0.00006544893,0.00094257016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917092,0.0036284218,0.00070574443,0.00086511887,0.0029026156,0.00018900627],"domain_scores_gemma":[0.9806147,0.01580364,0.00062917627,0.0013877281,0.0014319549,0.00013271385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011006053,0.0013189116,0.002047407,0.005651767,0.0012865358,0.0020112665,0.0034694884,0.0020935764,0.0026019611],"category_scores_gemma":[0.03414844,0.0010658735,0.0030892706,0.006217331,0.0020100838,0.0027680695,0.002841491,0.0035760934,0.0012034097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009890076,0.0002675023,0.0029288,0.00088664977,0.0006663258,0.0006374938,0.0007363076,0.1456552,0.0032736724,0.15302125,0.00403185,0.6877961],"study_design_scores_gemma":[0.00009870126,0.00022758874,0.0011052288,0.00034196881,0.0002027458,0.0014244388,0.00013453308,0.7350451,0.005578957,0.22734976,0.0284023,0.0000887036],"about_ca_topic_score_codex":0.0016504414,"about_ca_topic_score_gemma":0.0019900184,"teacher_disagreement_score":0.011006053,"about_ca_system_score_codex":0.0008756004,"about_ca_system_score_gemma":0.0011764752,"threshold_uncertainty_score":0.05820626},"labels":[],"label_agreement":null},{"id":"W2045697407","doi":"10.1145/2464576.2464652","title":"Label free change detection on streaming data with cooperative multi-objective genetic programming","year":2013,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Streaming data; Data stream; Change detection; Classifier (UML); Retraining; Benchmarking; Artificial intelligence; Concept drift; Machine learning; Data mining; Entropy (arrow of time); Data stream mining","score_opus":0.05146210105270022,"score_gpt":0.2746489021454647,"score_spread":0.2231868010927645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045697407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09297737,0.00012509771,0.90510505,0.00026230922,0.000026149834,0.00006670414,0.000031434072,0.00048017412,0.00092575495],"genre_scores_gemma":[0.77579165,0.00008542403,0.22193918,0.00015377792,0.000038652335,0.00019245241,0.00010683372,0.00009210151,0.0015999236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.00020624459,0.000024270967,0.00014337314,0.00013908531,0.00007090084],"domain_scores_gemma":[0.99689806,0.002205213,0.00032653465,0.000115097326,0.00035820054,0.00009689783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442026,0.000951168,0.00117483,0.0011119493,0.00045109537,0.0011371819,0.001557172,0.0015275904,0.0005300852],"category_scores_gemma":[0.0053231744,0.00062639057,0.0008396812,0.0007633825,0.00096938014,0.0009238964,0.001080025,0.0012939353,0.00012394151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052744505,0.000053883065,0.0011270917,0.000019275987,0.00003000706,0.000039925086,0.000070661095,0.9685883,0.0011138594,0.0012112544,0.00017407406,0.027518952],"study_design_scores_gemma":[0.0000023272949,0.0000070108917,0.000050185863,8.5264463e-7,0.0000018634788,0.0000018408344,0.0000030633812,0.9993787,0.00011228687,0.00042065512,0.000020098567,0.0000012288017],"about_ca_topic_score_codex":0.008249819,"about_ca_topic_score_gemma":0.0051816516,"teacher_disagreement_score":0.008249819,"about_ca_system_score_codex":0.0011422841,"about_ca_system_score_gemma":0.0010210775,"threshold_uncertainty_score":0.016403615},"labels":[],"label_agreement":null},{"id":"W2046074173","doi":"10.1109/icsmc.2011.6083921","title":"Joint feature selection and hierarchical classifier design","year":2011,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Classifier (UML); Artificial intelligence; Feature selection; Computer science; Pattern recognition (psychology); Data mining; Machine learning","score_opus":0.05558979530255956,"score_gpt":0.2335245891294975,"score_spread":0.17793479382693794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046074173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006018218,0.000097682896,0.9928726,0.00004573814,0.000021538985,0.00008349779,0.000020966283,0.0003527502,0.00048695126],"genre_scores_gemma":[0.2112846,0.000116616844,0.78615636,0.000090520894,0.0000624196,0.00040013366,0.0002216581,0.000106967615,0.0015607574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645305,0.0010179029,0.0002314817,0.00064415304,0.0014029468,0.0002504165],"domain_scores_gemma":[0.99597436,0.0014816618,0.00031031706,0.00047507568,0.0016491971,0.000109381144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039449083,0.0010211125,0.0015256454,0.0021784657,0.00073970505,0.0009839948,0.0018096425,0.0011198624,0.0018186952],"category_scores_gemma":[0.008767701,0.00044138398,0.0011521933,0.0014567558,0.0007044986,0.0014337369,0.001008368,0.0011058463,0.0008587308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023901775,0.00017213947,0.003317409,0.00018448805,0.00018484115,0.0001273517,0.00016212855,0.17388518,0.021505905,0.012627939,0.0035267493,0.78406686],"study_design_scores_gemma":[0.00003858603,0.00023253316,0.0010402389,0.000017880418,0.00007313116,0.00012643742,0.00002644642,0.9726615,0.012754739,0.008823077,0.0041723102,0.00003319118],"about_ca_topic_score_codex":0.0022610733,"about_ca_topic_score_gemma":0.002428123,"teacher_disagreement_score":0.0039449083,"about_ca_system_score_codex":0.00089301035,"about_ca_system_score_gemma":0.0012403475,"threshold_uncertainty_score":0.020862877},"labels":[],"label_agreement":null},{"id":"W2046401452","doi":"10.1145/1389095.1389356","title":"A swarm-based crossover operator for genetic programming","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Crossover; Symbolic regression; Genetic programming; Ant colony optimization algorithms; Computer science; Genetic algorithm; Population; Mathematical optimization; Swarm behaviour; Operator (biology); Selection (genetic algorithm); Genetic operator; Domain (mathematical analysis); Artificial intelligence; Meta-optimization; Mathematics; Machine learning; Biology","score_opus":0.022673445625941906,"score_gpt":0.2614562100317404,"score_spread":0.23878276440579851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046401452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004633771,0.00035324087,0.9888024,0.00017454602,0.00018353216,0.00009868239,0.000043234577,0.00053902477,0.005171497],"genre_scores_gemma":[0.13764404,0.0009196737,0.8481152,0.00028902592,0.00018709929,0.0003183865,0.00017119231,0.00030102849,0.012054336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944896,0.00014236345,0.000037744405,0.00007985493,0.0002632275,0.000027896132],"domain_scores_gemma":[0.9995053,0.00021972478,0.00004707058,0.00009253393,0.000111334106,0.000024149762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006964062,0.0005023578,0.0005731171,0.0006358142,0.00054562814,0.00079155306,0.00067783153,0.0007641733,0.0030968192],"category_scores_gemma":[0.0018870044,0.0001997836,0.00066571444,0.0010707413,0.00066104287,0.0008578978,0.00070823904,0.0013065023,0.000812011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018862607,0.0001544041,0.0011895017,0.00038720208,0.00014529692,0.0007118813,0.0005584887,0.11080045,0.06084353,0.17195673,0.008782244,0.6442817],"study_design_scores_gemma":[0.00022000437,0.00069627987,0.0015109024,0.00015634604,0.00020939017,0.0019969873,0.00009539993,0.70132655,0.043409955,0.08396777,0.16629814,0.00011226965],"about_ca_topic_score_codex":0.0007284363,"about_ca_topic_score_gemma":0.0006803429,"teacher_disagreement_score":0.0030968192,"about_ca_system_score_codex":0.00038692096,"about_ca_system_score_gemma":0.0004849725,"threshold_uncertainty_score":0.010359883},"labels":[],"label_agreement":null},{"id":"W2046812432","doi":"10.1111/j.0824-7935.2004.00244.x","title":"Introduction to the Applications of Evolutionary Computation in Computer Security and Cryptography","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; King's College London; University of East Anglia; York University","keywords":"Library science; Computer science; Humanities; Art","score_opus":0.010477644694294994,"score_gpt":0.26256911080717205,"score_spread":0.252091466112877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046812432","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003341193,0.21651538,0.44457108,0.016456142,0.010549711,0.00041332186,0.001349605,0.0010864437,0.30571714],"genre_scores_gemma":[0.05907532,0.3038722,0.37534568,0.012094583,0.015032753,0.0007094332,0.0013894459,0.0006707909,0.23180982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999236,0.0001592522,0.00007780883,0.00012692504,0.00033294616,0.00006711232],"domain_scores_gemma":[0.99875593,0.00083804864,0.000048070404,0.000115950206,0.00018275047,0.00005919306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008048728,0.0010144182,0.00070552796,0.0021678128,0.0008190688,0.0019871425,0.0008337172,0.002371842,0.023950515],"category_scores_gemma":[0.0023086197,0.00071618357,0.0008952799,0.0032224183,0.0019888936,0.003533233,0.0013541075,0.0047381227,0.009075118],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045548535,0.00011665863,0.00043465098,0.0010013189,0.000050531664,0.00037202318,0.00032360796,0.0043271123,0.0042958637,0.5015149,0.113067195,0.3744506],"study_design_scores_gemma":[0.000010247291,0.000049519953,0.0004412891,0.00036313818,0.000012540179,0.00081358297,0.000038591785,0.0023851711,0.0010346373,0.273605,0.72120005,0.000046276586],"about_ca_topic_score_codex":0.00061326026,"about_ca_topic_score_gemma":0.00072991394,"teacher_disagreement_score":0.023950515,"about_ca_system_score_codex":0.0008389369,"about_ca_system_score_gemma":0.00076261576,"threshold_uncertainty_score":0.08012247},"labels":[],"label_agreement":null},{"id":"W2047089648","doi":"10.1109/nabic.2014.6921896","title":"Demonstrating the power of object-oriented genetic programming via the inference of graph models for complex networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Inference; Genetic programming; Graph; Theoretical computer science; Object-oriented programming; Programming language; Artificial intelligence","score_opus":0.021127722982730027,"score_gpt":0.2563519187251128,"score_spread":0.2352241957423828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047089648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023357948,0.0000719729,0.96977407,0.0003967618,0.000021122774,0.00002273947,0.00003786254,0.00030462327,0.0060128095],"genre_scores_gemma":[0.5008073,0.0003113596,0.49539593,0.00017855476,0.00002750359,0.000092793474,0.00012728671,0.00018821338,0.0028710202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.00018140633,0.000009502801,0.000053070446,0.00008296735,0.00002301522],"domain_scores_gemma":[0.9981791,0.0015481868,0.000067394234,0.00012085224,0.00005174742,0.000032809356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009551926,0.00046811788,0.00031158334,0.00055676454,0.00033615582,0.00091919757,0.00083141134,0.0008816162,0.0017005024],"category_scores_gemma":[0.0049901027,0.00028167266,0.00074920116,0.00045444086,0.0012047378,0.001031538,0.0013014562,0.0013664607,0.00017168823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015123919,0.00004230103,0.0008544766,0.00005334261,0.000026328056,0.00016767679,0.00023070561,0.73113626,0.0022759635,0.23462777,0.0006565783,0.029913466],"study_design_scores_gemma":[0.000004097475,0.000005621115,0.000078809695,0.000006540968,0.0000048207635,0.000020608693,0.000011699858,0.91022766,0.00053173973,0.08813739,0.0009666063,0.000004372126],"about_ca_topic_score_codex":0.0059657637,"about_ca_topic_score_gemma":0.0047798455,"teacher_disagreement_score":0.0059657637,"about_ca_system_score_codex":0.0006817231,"about_ca_system_score_gemma":0.0005887451,"threshold_uncertainty_score":0.011862099},"labels":[],"label_agreement":null},{"id":"W2047588220","doi":"10.1016/j.artmed.2004.01.005","title":"Genetic design of feature spaces for pattern classifiers","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence in Medicine","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Institute for Biodiagnostics; University of Alberta","funders":"","keywords":"Piecewise; Representation (politics); Piecewise linear function; Computer science; Feature (linguistics); Piecewise linear manifold; Polynomial; Focus (optics); Pattern recognition (psychology); Genetic algorithm; Algorithm; Genetic programming; Artificial intelligence; Mathematics; Machine learning; Mathematical analysis","score_opus":0.070996878088916,"score_gpt":0.3254758482101597,"score_spread":0.25447897012124365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047588220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033896938,0.00027564503,0.9637356,0.0001385318,0.00004065908,0.000053552954,0.00003944513,0.00019280784,0.0016269692],"genre_scores_gemma":[0.5558633,0.0003109897,0.4410142,0.00012560675,0.000052467607,0.0002828069,0.00016153071,0.00009852868,0.0020904276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996853,0.00009061537,0.000020763568,0.00007342513,0.00008878919,0.00004120611],"domain_scores_gemma":[0.9991522,0.0004264994,0.000066399494,0.000064558226,0.00025717463,0.00003327822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319193,0.00036132886,0.0006832897,0.00095284014,0.0003724193,0.00080221205,0.00095673493,0.00084296556,0.0016342074],"category_scores_gemma":[0.0035971354,0.00038293315,0.00063791464,0.00079388905,0.00057520374,0.00087390543,0.00059730094,0.00073808664,0.00029647505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014011387,0.00013650952,0.0013360449,0.00012345258,0.00006227419,0.0000936332,0.0001417582,0.5897443,0.013032917,0.04423892,0.0018571359,0.3490929],"study_design_scores_gemma":[0.000017750257,0.00005263854,0.0001934988,0.00001333163,0.000015495609,0.000037166294,0.000015545105,0.98183674,0.0017426373,0.015182406,0.00088658364,0.000006078802],"about_ca_topic_score_codex":0.0013386505,"about_ca_topic_score_gemma":0.0015936209,"teacher_disagreement_score":0.0016342074,"about_ca_system_score_codex":0.0006150461,"about_ca_system_score_gemma":0.00060718786,"threshold_uncertainty_score":0.0054669976},"labels":[],"label_agreement":null},{"id":"W2047751098","doi":"10.1145/1569901.1570052","title":"Genetic programming based image segmentation with applications to biomedical object detection","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Western University; Concordia University","funders":"","keywords":"Computer science; Segmentation-based object categorization; Image segmentation; Artificial intelligence; Scale-space segmentation; Segmentation; Computer vision; MATLAB; Genetic programming; Object (grammar); Image (mathematics); Object detection; Process (computing); Image texture; Image processing; Pattern recognition (psychology)","score_opus":0.007487263695768587,"score_gpt":0.254470911652902,"score_spread":0.2469836479571334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047751098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01957597,0.00026591634,0.97653484,0.00016158201,0.00003236794,0.0000404514,0.000025843065,0.00083870225,0.0025244327],"genre_scores_gemma":[0.11526699,0.0003335174,0.8811641,0.00008973256,0.000016188815,0.000104811785,0.00007232699,0.0001514333,0.0028008672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980444,0.0000483447,0.000009153355,0.000047252546,0.00007864208,0.000012138965],"domain_scores_gemma":[0.9997131,0.00018103688,0.000028372942,0.000019355899,0.00004768365,0.000010440351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035355063,0.00042275526,0.00031653198,0.00041341185,0.00021364113,0.00035891143,0.00053188595,0.0007007492,0.001539888],"category_scores_gemma":[0.000965697,0.00018394973,0.00031703146,0.000581257,0.00065865787,0.00030800106,0.00030874342,0.0005931714,0.0002479037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010763931,0.000089834175,0.0012597778,0.0002030635,0.00006217328,0.00039654525,0.00023770228,0.51527846,0.095950544,0.030994767,0.0021338435,0.35328558],"study_design_scores_gemma":[0.000016628614,0.000091178954,0.00057712867,0.000020954587,0.00001984512,0.00029399068,0.000024906696,0.94866854,0.030677935,0.011310451,0.008278455,0.000020013664],"about_ca_topic_score_codex":0.0013705707,"about_ca_topic_score_gemma":0.00089474436,"teacher_disagreement_score":0.001539888,"about_ca_system_score_codex":0.0004058685,"about_ca_system_score_gemma":0.00033812816,"threshold_uncertainty_score":0.0051514506},"labels":[],"label_agreement":null},{"id":"W2048368674","doi":"10.1145/1569901.1570216","title":"An evolutionary approach to feature function generation in application to biomedical image patterns","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Feature (linguistics); Computer science; Pattern recognition (psychology); Artificial intelligence; Genetic programming; Image (mathematics); Genetic algorithm; Maximization; Feature vector; Function (biology); Evolutionary algorithm; Mathematics; Machine learning; Mathematical optimization; Biology","score_opus":0.010441436773355003,"score_gpt":0.25097016295539154,"score_spread":0.24052872618203652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048368674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005293876,0.00005972984,0.99398017,0.000053287495,0.000010564058,0.000023768247,0.000004670075,0.000109118,0.00046488998],"genre_scores_gemma":[0.25569087,0.00017618468,0.74236935,0.000109583925,0.00003274632,0.00020105155,0.000032714015,0.000052547657,0.001334947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996809,0.00011077387,0.000020509211,0.000054296986,0.000109663684,0.000023947165],"domain_scores_gemma":[0.99952567,0.000282346,0.00003466048,0.00004108661,0.000100652454,0.00001550846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007365177,0.00044493526,0.0005626587,0.00062992185,0.00029440253,0.0004271633,0.0010467586,0.00087091245,0.00086178165],"category_scores_gemma":[0.0023035454,0.0002837627,0.00051548256,0.0007433178,0.00054728624,0.00049640983,0.0006670182,0.00066648755,0.00013856913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004992065,0.000099213576,0.0011825023,0.00010530415,0.00009689663,0.00031980113,0.00017405336,0.53217053,0.025301158,0.02736327,0.0009631052,0.41217425],"study_design_scores_gemma":[0.000009552051,0.000058915448,0.00027886342,0.0000071589475,0.000013432439,0.00014993196,0.000008850259,0.9904986,0.002678735,0.0053097284,0.0009770966,0.000009174334],"about_ca_topic_score_codex":0.0009759816,"about_ca_topic_score_gemma":0.0007748215,"teacher_disagreement_score":0.0010467586,"about_ca_system_score_codex":0.00026648297,"about_ca_system_score_gemma":0.00030873547,"threshold_uncertainty_score":0.0038951635},"labels":[],"label_agreement":null},{"id":"W2048987585","doi":"10.1145/1569901.1570227","title":"On the evolution of neural networks for pairwise classification using gene expression programming","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pairwise comparison; Gene expression programming; Artificial neural network; Computer science; Artificial intelligence; Classifier (UML); Genetic programming; Machine learning; Binary number; Binary classification; Class (philosophy); Extension (predicate logic); Data mining; Mathematics; Support vector machine","score_opus":0.039585262689449376,"score_gpt":0.2761969989709788,"score_spread":0.23661173628152946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048987585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013777703,0.00018607252,0.983506,0.00025176333,0.000026163156,0.000038857386,0.0000140504935,0.00006859661,0.0021307336],"genre_scores_gemma":[0.25504795,0.00045213298,0.73902583,0.00024106537,0.00007070445,0.0004223722,0.00010505596,0.00013488758,0.004500021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992555,0.00035971662,0.000033455413,0.00013528229,0.00016598417,0.000050068917],"domain_scores_gemma":[0.99842584,0.0011573808,0.00010276866,0.000073335636,0.00020060065,0.00004019565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027644616,0.000894749,0.00093130977,0.0006669273,0.00056821265,0.0008515964,0.0012403842,0.00093534344,0.0012062324],"category_scores_gemma":[0.007369225,0.0004897731,0.0008529206,0.0009631705,0.0015177997,0.0012281641,0.0014036275,0.0017274193,0.0002490311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002897403,0.000035253306,0.0008686176,0.00004445501,0.000041718144,0.000050642997,0.00014362684,0.8653878,0.0019406652,0.06400679,0.0004533985,0.06699816],"study_design_scores_gemma":[0.0000043117184,0.000015532101,0.000075027405,0.0000062955155,0.0000048758284,0.000010726419,0.0000065680556,0.97599673,0.00039356507,0.023031294,0.00044991614,0.0000051361476],"about_ca_topic_score_codex":0.0025226695,"about_ca_topic_score_gemma":0.0023133734,"teacher_disagreement_score":0.0027644616,"about_ca_system_score_codex":0.00097322516,"about_ca_system_score_gemma":0.000674852,"threshold_uncertainty_score":0.014620066},"labels":[],"label_agreement":null},{"id":"W2049574661","doi":"10.1145/1388969.1389039","title":"Using feature-based fitness evaluation in symbolic regression with added noise","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Symbolic regression; Computer science; Noise (video); Feature (linguistics); Artificial intelligence; Regression; Pattern recognition (psychology); Regression analysis; Symbolic data analysis; Machine learning; Statistics; Mathematics; Genetic programming; Theoretical computer science","score_opus":0.05281059689207678,"score_gpt":0.30403271175052543,"score_spread":0.25122211485844864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049574661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14245057,0.0003137734,0.8533572,0.00019082426,0.000032648113,0.00007482284,0.0000595579,0.0014428541,0.0020778275],"genre_scores_gemma":[0.73754,0.000091538044,0.2607073,0.00007854643,0.000020689145,0.000099994904,0.00013025959,0.00019484287,0.0011368825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748343,0.0011364181,0.00011203567,0.00029248904,0.0008713169,0.000104364815],"domain_scores_gemma":[0.99163616,0.006219814,0.0005994851,0.00042232417,0.0010151954,0.00010709142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031366765,0.0008510217,0.0012145633,0.0012698034,0.00035766794,0.0013024476,0.0010275705,0.0011844644,0.00087584485],"category_scores_gemma":[0.0147052435,0.00024651896,0.00042131037,0.0012884425,0.00080461433,0.001029412,0.0009042145,0.0008195802,0.00024069152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022777208,0.00013794853,0.0048330924,0.00009214214,0.000092524744,0.00027454205,0.00018495624,0.77351654,0.013741425,0.0057585845,0.0007397967,0.2004006],"study_design_scores_gemma":[0.000007352956,0.00005248237,0.000664749,0.0000069950206,0.00001125213,0.000047710426,0.000007809346,0.99546486,0.0022798316,0.0012331194,0.00021243283,0.00001136923],"about_ca_topic_score_codex":0.0020925952,"about_ca_topic_score_gemma":0.0013869334,"teacher_disagreement_score":0.0031366765,"about_ca_system_score_codex":0.00095347816,"about_ca_system_score_gemma":0.00057340803,"threshold_uncertainty_score":0.016588569},"labels":[],"label_agreement":null},{"id":"W2049615251","doi":"10.1109/cec.2008.4630825","title":"Linear Genetic Programming GPGPU on Microsoft's Xbox 360","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"General-purpose computing on graphics processing units; Computer science; Benchmarking; Graphics processing unit; Graphics; Central processing unit; Implementation; CUDA; Flexibility (engineering); Genetic programming; Parallel computing; Computer graphics (images); Operating system; Artificial intelligence; Software engineering","score_opus":0.01943988956565462,"score_gpt":0.24381080872537178,"score_spread":0.22437091915971716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049615251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10594003,0.0008801045,0.81579036,0.0007099306,0.00028188532,0.00029469296,0.00079164054,0.022034332,0.053277142],"genre_scores_gemma":[0.25301567,0.00045751454,0.7261508,0.00032927556,0.00002912926,0.00040155218,0.0012873255,0.0011940661,0.017134722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998305,0.000038774157,0.000008213246,0.000032786596,0.000058822974,0.00003088166],"domain_scores_gemma":[0.9998067,0.000058704503,0.00001138297,0.00003362854,0.00007051927,0.000018936847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032224564,0.00035955422,0.00035104164,0.00023773045,0.00026261088,0.0006641576,0.00079056364,0.0005318355,0.0089614745],"category_scores_gemma":[0.0010183282,0.00022852542,0.0003318267,0.0005650737,0.00024809924,0.0004332297,0.00042900458,0.00094158866,0.0017654586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052216015,0.00018858162,0.0028308374,0.00033471372,0.000104847975,0.00052739255,0.0003829706,0.44721535,0.02733981,0.050206847,0.06184671,0.4084998],"study_design_scores_gemma":[0.00015331806,0.00015144734,0.001068452,0.000038513936,0.000030232444,0.00015714021,0.000057937305,0.92291075,0.011485288,0.012007707,0.05191255,0.000026779095],"about_ca_topic_score_codex":0.007866183,"about_ca_topic_score_gemma":0.004663188,"teacher_disagreement_score":0.0089614745,"about_ca_system_score_codex":0.00042164887,"about_ca_system_score_gemma":0.0007725754,"threshold_uncertainty_score":0.02997911},"labels":[],"label_agreement":null},{"id":"W2049783455","doi":"10.1162/evco_a_00016","title":"Classification as Clustering: A Pareto Cooperative-Competitive GP Approach","year":2010,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Benchmarking; Computer science; Machine learning; Cluster analysis; Artificial intelligence; Pareto principle; Benchmark (surveying); Coevolution; Task (project management); Population; Evolutionary algorithm; Genetic programming; Multi-objective optimization; Mathematical optimization; Mathematics","score_opus":0.01837479317535437,"score_gpt":0.2662653856347845,"score_spread":0.24789059245943015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049783455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022357522,0.00022610053,0.96962017,0.000556644,0.0000306946,0.0000857348,0.000033929522,0.00014949022,0.006939683],"genre_scores_gemma":[0.5905125,0.00041684162,0.39851013,0.00045247216,0.00009664737,0.00046190395,0.00016510992,0.000116023955,0.009268216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910223,0.00033899743,0.000027916736,0.00017075847,0.00027190233,0.00008829009],"domain_scores_gemma":[0.9990357,0.0004559626,0.00008879888,0.000115917996,0.00024046707,0.00006316854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019185205,0.0008958943,0.0012659084,0.0014698746,0.0008490074,0.0015519749,0.00237593,0.0021090966,0.0014485002],"category_scores_gemma":[0.004024204,0.00044504253,0.00083910604,0.001394413,0.0012269772,0.0013272453,0.0014205431,0.0011416081,0.00038199683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023682105,0.000055318033,0.0006937635,0.000045965167,0.00006372557,0.00009782448,0.00016593756,0.89892,0.001092058,0.046370145,0.001520515,0.050951093],"study_design_scores_gemma":[0.0000061852875,0.000012070737,0.00007866952,0.000004564461,0.000006550634,0.000022080767,0.000017261107,0.9848615,0.00015892771,0.014197301,0.0006310609,0.0000039129054],"about_ca_topic_score_codex":0.0043183584,"about_ca_topic_score_gemma":0.0032264353,"teacher_disagreement_score":0.0043183584,"about_ca_system_score_codex":0.0015116293,"about_ca_system_score_gemma":0.0012239405,"threshold_uncertainty_score":0.0109677315},"labels":[],"label_agreement":null},{"id":"W2049965644","doi":"10.1145/1570256.1570419","title":"Accelerating evolutionary computation with graphics processing units","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; SIMD; Graphics; Stream processing; Parallelism (grammar); Parallel computing; General-purpose computing on graphics processing units; CUDA; Graphics processing unit; Computation; Computer graphics; Real-time computer graphics; Computer architecture; Computer graphics (images); 3D computer graphics; Programming language","score_opus":0.030276365555942947,"score_gpt":0.261478675763429,"score_spread":0.23120231020748602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049965644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049368516,0.0013613799,0.92652845,0.0004790113,0.00035113996,0.00008503144,0.000080382335,0.0021159505,0.019630073],"genre_scores_gemma":[0.27537185,0.001308762,0.7167976,0.00016028827,0.000106250554,0.00013605668,0.00021026739,0.00030039984,0.00560846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972254,0.000058579382,0.000011606159,0.000026766244,0.00014850828,0.000032046122],"domain_scores_gemma":[0.9995776,0.00019637331,0.000021431688,0.00007049659,0.000109359935,0.000024707038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047547437,0.0005098617,0.0005233221,0.00057998585,0.00037929614,0.0007843774,0.00077999354,0.0007736687,0.0030998457],"category_scores_gemma":[0.0024812685,0.00033556792,0.0004134075,0.0012366917,0.00040058471,0.00081087707,0.0010974167,0.0011411883,0.00078764383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001871875,0.00007373135,0.002661572,0.0004282726,0.00013873352,0.00038991464,0.00029687595,0.5226732,0.04023231,0.11926325,0.013540002,0.30011505],"study_design_scores_gemma":[0.00004067455,0.000028862056,0.0005025782,0.000024136823,0.000018958113,0.00008291548,0.000019208532,0.95630306,0.0061751213,0.023961825,0.0128284795,0.000014175078],"about_ca_topic_score_codex":0.0012517733,"about_ca_topic_score_gemma":0.0016747556,"teacher_disagreement_score":0.0030998457,"about_ca_system_score_codex":0.00039046945,"about_ca_system_score_gemma":0.00046887997,"threshold_uncertainty_score":0.010370076},"labels":[],"label_agreement":null},{"id":"W2050412782","doi":"10.1145/1389095.1389352","title":"Measuring rate of evolution in genetic programming using amino acid to synonymous substitution ratio <i> k <sub>a</sub> /k <sub>s</sub> </i>","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substitution (logic); Genetic programming; Rate of evolution; Amino acid substitution; Synonymous substitution; Amino acid; Directed evolution; Biology; Evolutionary biology; Genetics; Computer science; Mutation; Gene; Phylogenetics; Artificial intelligence; Genome; Codon usage bias","score_opus":0.029509577000700494,"score_gpt":0.22534541714416914,"score_spread":0.19583584014346864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050412782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66943467,0.0014451053,0.3211882,0.0002919915,0.00009242198,0.0000965292,0.00018650941,0.0007578937,0.006506749],"genre_scores_gemma":[0.9327648,0.00053588056,0.0653667,0.00006842656,0.000024622637,0.00008968231,0.00013564981,0.00011504986,0.00089928246],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.00043476312,0.00009457549,0.00034031027,0.00041070086,0.00008806305],"domain_scores_gemma":[0.99129325,0.0056359177,0.0014047745,0.0007852195,0.0006835615,0.00019723148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022260617,0.0005690486,0.00056688755,0.00096520025,0.00022612629,0.0009206153,0.000770625,0.0009426636,0.00066121266],"category_scores_gemma":[0.01608104,0.00024822133,0.00035816664,0.00090249395,0.00085530954,0.0015850094,0.0005575327,0.0012196702,0.0003596535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006411123,0.00025446317,0.09695818,0.0005456024,0.00031842408,0.0004493446,0.0010809194,0.16013493,0.5283591,0.057973407,0.0006003459,0.15268409],"study_design_scores_gemma":[0.00005224978,0.0009712834,0.03924285,0.000068915666,0.00015699254,0.0022981958,0.00029201162,0.5116155,0.4032453,0.037408967,0.004412132,0.00023556458],"about_ca_topic_score_codex":0.00029831147,"about_ca_topic_score_gemma":0.0001822286,"teacher_disagreement_score":0.0022260617,"about_ca_system_score_codex":0.0004221709,"about_ca_system_score_gemma":0.00022005448,"threshold_uncertainty_score":0.011772633},"labels":[],"label_agreement":null},{"id":"W2050510386","doi":"10.1145/1102256.1102342","title":"Making soccer kicks better","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Particle swarm optimization; Simulation; Biomechanics; Movement (music); Sports biomechanics; Machine learning","score_opus":0.026960072771231757,"score_gpt":0.28530613971212604,"score_spread":0.2583460669408943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050510386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48554176,0.001420614,0.41227233,0.0036470522,0.0010205568,0.00072944205,0.00031386456,0.004585133,0.090469256],"genre_scores_gemma":[0.7887331,0.0015010556,0.18638071,0.0010167543,0.00016348103,0.00040648202,0.00049897924,0.0010285673,0.020270785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930334,0.00014700883,0.00004678724,0.00016721092,0.00022914012,0.0001063848],"domain_scores_gemma":[0.9993913,0.00011397144,0.000092879294,0.00013074244,0.00018080867,0.00009020845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065091,0.0011662007,0.00073704077,0.0008470224,0.00062737643,0.002016123,0.0008888312,0.0013858137,0.016984338],"category_scores_gemma":[0.003267581,0.000559069,0.00038533832,0.0005414382,0.00055606716,0.00289945,0.0016129069,0.0010834313,0.003959736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008683904,0.0012070673,0.006906652,0.0011741861,0.00031548302,0.00037329082,0.0011693864,0.23326252,0.21405461,0.038065445,0.016925167,0.48567778],"study_design_scores_gemma":[0.00081868464,0.0023839003,0.033198047,0.00052330195,0.0006270289,0.00069766573,0.004060774,0.5271185,0.0990223,0.088133775,0.24305426,0.0003617389],"about_ca_topic_score_codex":0.0013490057,"about_ca_topic_score_gemma":0.0020502654,"teacher_disagreement_score":0.016984338,"about_ca_system_score_codex":0.00043755397,"about_ca_system_score_gemma":0.00053270534,"threshold_uncertainty_score":0.056818306},"labels":[],"label_agreement":null},{"id":"W2051556969","doi":"10.1007/s10470-014-0425-7","title":"Introduction to the special issue on “High performance analog circuits and design methodologies”","year":2014,"lang":"en","type":"article","venue":"Analog Integrated Circuits and Signal Processing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Comparator; Analogue electronics; Computer science; Electronic engineering; Very-large-scale integration; Electronic circuit; Mixed-signal integrated circuit; CMOS; Electrical engineering; Offset (computer science); Engineering; Voltage","score_opus":0.03306112860287096,"score_gpt":0.2650650940384443,"score_spread":0.23200396543557333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051556969","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042442707,0.112779506,0.03663724,0.0184644,0.7857158,0.000105303734,0.0004919113,0.00055570685,0.04482572],"genre_scores_gemma":[0.0034812323,0.085254416,0.012701066,0.017518882,0.7402952,0.00014064083,0.0011381411,0.0010269068,0.13844354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844164,0.00027523664,0.00016960397,0.0002984112,0.0007055923,0.00010960653],"domain_scores_gemma":[0.9943171,0.0023242969,0.00024409637,0.00045354385,0.0020959298,0.0005651719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020601598,0.0021028225,0.0021965422,0.0043717553,0.0009872016,0.003988899,0.0021656095,0.0030562414,0.0651691],"category_scores_gemma":[0.00564961,0.00069856417,0.0014098019,0.00309235,0.0011927333,0.0038254901,0.0018444615,0.0053606792,0.03990359],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027433698,0.00003172014,0.00008493738,0.00052535994,0.000026413896,0.00006694194,0.000015404063,0.00033324584,0.000799501,0.005000302,0.91791594,0.07517273],"study_design_scores_gemma":[0.000006313651,0.000044049557,0.0001985349,0.0001897934,0.000017281636,0.00022433812,0.000009733703,0.00058554363,0.00031575825,0.0045201587,0.9938744,0.000014052431],"about_ca_topic_score_codex":0.0004752591,"about_ca_topic_score_gemma":0.0013478153,"teacher_disagreement_score":0.0651691,"about_ca_system_score_codex":0.0010412575,"about_ca_system_score_gemma":0.0012899049,"threshold_uncertainty_score":0.21801233},"labels":[],"label_agreement":null},{"id":"W2054685944","doi":"10.1109/cec.2007.4424951","title":"Irreducible complexity in a genetic algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fitness function; Function (biology); Algorithm; Computer science; Genetic algorithm; Evolving systems; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning; Evolutionary biology; Engineering; Biology","score_opus":0.040284693371039154,"score_gpt":0.2903149014944848,"score_spread":0.2500302081234457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054685944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054410867,0.0012021938,0.87532693,0.003756284,0.00020382996,0.00009943585,0.00010296926,0.00034018848,0.06455727],"genre_scores_gemma":[0.64742064,0.0014200609,0.33149612,0.00069316773,0.00024405263,0.00027615202,0.00017580244,0.00017274181,0.018101288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999025,0.0003645518,0.000041709423,0.00013943134,0.00033425487,0.0000951055],"domain_scores_gemma":[0.99816126,0.0013275272,0.0000680775,0.00020184589,0.00016646199,0.000074886535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391315,0.00048365726,0.00073169963,0.0008648122,0.0010202359,0.0022578558,0.0009805799,0.0016179641,0.0042413054],"category_scores_gemma":[0.009082123,0.0002843699,0.0007560292,0.0009882094,0.0028685343,0.0022821864,0.0017645336,0.0023395168,0.0006496233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026441847,0.000019779285,0.0004938963,0.000044102475,0.000025212323,0.00007560412,0.00018574976,0.13341658,0.00047626544,0.8411077,0.0014094642,0.022719285],"study_design_scores_gemma":[0.000024592564,0.000019857838,0.00012756951,0.000026707019,0.000015323933,0.000042293872,0.000027505273,0.30560386,0.00024316543,0.68848014,0.0053759194,0.00001311023],"about_ca_topic_score_codex":0.003361182,"about_ca_topic_score_gemma":0.0025876765,"teacher_disagreement_score":0.0042413054,"about_ca_system_score_codex":0.00156962,"about_ca_system_score_gemma":0.0014464037,"threshold_uncertainty_score":0.014188647},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genetic programming; Computer science; 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","score_opus":0.04628301425624819,"score_gpt":0.25121230617425383,"score_spread":0.20492929191800563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055239208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016008409,0.00022454973,0.9811023,0.00032200592,0.00003412508,0.00003386239,0.000011452139,0.00011490785,0.002148365],"genre_scores_gemma":[0.40037313,0.00052054663,0.5961357,0.00029401362,0.00009463143,0.00020156977,0.000047879006,0.00014354657,0.002188993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982576,0.0008328393,0.00006620858,0.00019312731,0.00054083625,0.00010943029],"domain_scores_gemma":[0.9974491,0.001816395,0.0001540201,0.0002634864,0.00022290579,0.00009400795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025706394,0.0006223577,0.00093273725,0.00071156427,0.00060818397,0.0011900291,0.0016002938,0.0010993226,0.0016539035],"category_scores_gemma":[0.006463254,0.0003365645,0.0010064782,0.00084246736,0.0013781368,0.0016020712,0.0030660743,0.0020551651,0.00031115528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076111275,0.00009037523,0.001873082,0.00019133351,0.0001499151,0.00019560353,0.0006021963,0.6325585,0.01216731,0.18331361,0.0009612549,0.16782068],"study_design_scores_gemma":[0.0000256571,0.000077722914,0.00025441285,0.000026187105,0.000026689748,0.00004684036,0.000038438444,0.938736,0.001388694,0.056561142,0.0028031943,0.000014970592],"about_ca_topic_score_codex":0.0021309534,"about_ca_topic_score_gemma":0.002429118,"teacher_disagreement_score":0.0025706394,"about_ca_system_score_codex":0.0007686587,"about_ca_system_score_gemma":0.0010523314,"threshold_uncertainty_score":0.013595045},"labels":[],"label_agreement":null},{"id":"W2056698664","doi":"10.1109/cec.2010.5586092","title":"Differential evolutionary approach guided by the Functional Constraint Network to solve program synthesis problem","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tallinna Tehnikaülikool; Ryerson University","keywords":"Constraint (computer-aided design); Computer science; Differential evolution; Constraint satisfaction; Constraint satisfaction problem; Evolutionary algorithm; Program synthesis; Constraint satisfaction dual problem; Theoretical computer science; Evolutionary computation; Mathematical optimization; Constraint logic programming; Artificial intelligence; Mathematics","score_opus":0.016515025690731683,"score_gpt":0.23523758487437024,"score_spread":0.21872255918363856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056698664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011194809,0.000063864674,0.9849029,0.00010345353,0.000010724864,0.000030583982,0.000011670677,0.00006786493,0.0036141681],"genre_scores_gemma":[0.35280743,0.00021192539,0.6420296,0.00011768391,0.000013566866,0.00027001605,0.00008010007,0.000063265405,0.0044064224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.00010256424,0.00001345114,0.00006993874,0.000117113166,0.000031325373],"domain_scores_gemma":[0.999592,0.00027187506,0.000031749863,0.000030461184,0.00005877328,0.000015212759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008589624,0.00049095263,0.00033762955,0.00047998512,0.00032508202,0.00034913077,0.0008327338,0.0006131387,0.0022590184],"category_scores_gemma":[0.0018854701,0.0002280196,0.00038357396,0.00051195134,0.0007752074,0.000534184,0.000581149,0.0007079013,0.00015628473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034901175,0.000037955637,0.00040933336,0.00012735456,0.000029943942,0.00011177742,0.00012989812,0.7637345,0.011947768,0.15801238,0.00043485075,0.06498926],"study_design_scores_gemma":[0.000012972101,0.000030572377,0.00006673502,0.0000072622756,0.000009375354,0.00002621806,0.000012222077,0.9776634,0.0021759951,0.018179728,0.0018108543,0.0000047078984],"about_ca_topic_score_codex":0.0020360665,"about_ca_topic_score_gemma":0.0022941532,"teacher_disagreement_score":0.0022590184,"about_ca_system_score_codex":0.0007941653,"about_ca_system_score_gemma":0.0008293292,"threshold_uncertainty_score":0.0075571537},"labels":[],"label_agreement":null},{"id":"W2057394292","doi":"10.1007/s10710-015-9242-8","title":"Controlling code growth by dynamically shaping the genotype size distribution","year":2015,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Genetic programming; Overfitting; Code (set theory); Mathematical optimization; Probabilistic logic; Symbolic regression; Range (aeronautics); Evolutionary algorithm; Artificial intelligence; Machine learning; Mathematics; Programming language","score_opus":0.012907622848355477,"score_gpt":0.23404573563309522,"score_spread":0.22113811278473974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057394292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65385276,0.00056255073,0.33272225,0.0005680713,0.00015494436,0.000044207554,0.00008320072,0.0014930803,0.010518991],"genre_scores_gemma":[0.9843717,0.00012738118,0.014144433,0.000048381517,0.000015911226,0.00002585148,0.000025302194,0.00015524488,0.0010858577],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998503,0.000025299461,0.0000063388634,0.000045657358,0.00004538512,0.000027045233],"domain_scores_gemma":[0.99845326,0.0008460974,0.00021306731,0.00017224858,0.00019454394,0.00012083057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027259425,0.00032421385,0.00026334752,0.00043500896,0.0002432194,0.00094150304,0.00066588575,0.0004558129,0.0012598112],"category_scores_gemma":[0.0036768352,0.00018729958,0.00011306897,0.00032909558,0.0004998694,0.00092112727,0.00059376616,0.0005802764,0.0004428538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039767823,0.00029683122,0.0037828912,0.00011354178,0.00003876428,0.0001920574,0.00019318787,0.26097786,0.6004119,0.02757511,0.0018472137,0.10417295],"study_design_scores_gemma":[0.00003614578,0.00006446128,0.00089796906,0.000009830451,0.000014431193,0.0000701528,0.000041419884,0.9165599,0.07040123,0.010296282,0.00158714,0.00002103725],"about_ca_topic_score_codex":0.00039125362,"about_ca_topic_score_gemma":0.0007244532,"teacher_disagreement_score":0.0012598112,"about_ca_system_score_codex":0.0005160799,"about_ca_system_score_gemma":0.00035323398,"threshold_uncertainty_score":0.0042144656},"labels":[],"label_agreement":null},{"id":"W2057680553","doi":"10.1109/cibcb.2014.6845519","title":"Shape control of side effect machines for DNA classification","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Finite-state machine; Computer science; Task (project management); String (physics); Population; Artificial intelligence; State (computer science); Side effect (computer science); Machine learning; Algorithm; Mathematics; Engineering","score_opus":0.011210802458322,"score_gpt":0.2536865594442309,"score_spread":0.2424757569859089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057680553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19516219,0.00025426078,0.79909337,0.0001224771,0.00007317104,0.00007130752,0.000053648422,0.0013981175,0.0037715456],"genre_scores_gemma":[0.84172714,0.00009104442,0.15628584,0.00005329473,0.000015554948,0.00008681018,0.0000936153,0.000106390566,0.0015403652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999647,0.00009699847,0.000022771479,0.000099971345,0.00010866555,0.000024509221],"domain_scores_gemma":[0.9982609,0.0009013388,0.00015927428,0.00033848756,0.00028141355,0.00005865193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007190172,0.00036768208,0.0003260103,0.00023826191,0.000267069,0.00053196837,0.0007568038,0.00060571707,0.0011580896],"category_scores_gemma":[0.0037288975,0.00021363421,0.00037934404,0.00022171573,0.00076684216,0.00077089935,0.00050688494,0.0007289279,0.00038021695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002727051,0.000104028215,0.002170883,0.00013385298,0.000028013903,0.00015267232,0.00016047903,0.5920463,0.13958462,0.020266593,0.00082086073,0.24425903],"study_design_scores_gemma":[0.00001093044,0.00013383426,0.0005398196,0.0000072268117,0.000009232133,0.00007578436,0.000014962497,0.9445253,0.0458236,0.007123849,0.0017210991,0.000014257789],"about_ca_topic_score_codex":0.00036502094,"about_ca_topic_score_gemma":0.0005658633,"teacher_disagreement_score":0.0011580896,"about_ca_system_score_codex":0.00045944494,"about_ca_system_score_gemma":0.00029360535,"threshold_uncertainty_score":0.0038741827},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.022910327105113024,"score_gpt":0.2562158108756366,"score_spread":0.23330548377052357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059072591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041382838,0.000088866036,0.95350814,0.00015433172,0.000017128255,0.00010304551,0.00006565381,0.0013699828,0.0033099076],"genre_scores_gemma":[0.28838336,0.00012208028,0.7081616,0.00010402342,0.00001698032,0.00036313108,0.00020974109,0.00019780223,0.0024412891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997745,0.000066236134,0.000008864839,0.000057203924,0.00006771356,0.000025589301],"domain_scores_gemma":[0.99960023,0.0002370151,0.00003791775,0.000025148749,0.00008654943,0.000013159552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862048,0.0006600061,0.00055930193,0.00086184376,0.00039501913,0.00078103854,0.00068310514,0.00075844344,0.001393872],"category_scores_gemma":[0.0016961609,0.00032179404,0.0006936256,0.0006494654,0.00048393,0.00043684483,0.0005882094,0.0007129391,0.0002738663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003184203,0.00004715341,0.00065780163,0.00003075189,0.00003847342,0.000059187805,0.00007091518,0.90821195,0.0046179625,0.0053313016,0.00070828164,0.08019439],"study_design_scores_gemma":[0.0000040423242,0.0000071767386,0.000080877566,0.0000025809416,0.000003573829,0.0000078862095,0.000006039012,0.9968208,0.0009027796,0.0018321718,0.0003297208,0.0000024537328],"about_ca_topic_score_codex":0.005525587,"about_ca_topic_score_gemma":0.0040303012,"teacher_disagreement_score":0.005525587,"about_ca_system_score_codex":0.00086820184,"about_ca_system_score_gemma":0.0006401516,"threshold_uncertainty_score":0.010986865},"labels":[],"label_agreement":null},{"id":"W2059208361","doi":"10.1109/cimsivp.2014.7013278","title":"A comparison of genetic programming feature extraction languages for image classification","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Genetic programming; Artificial intelligence; Feature extraction; Contextual image classification; Pattern recognition (psychology); Feature (linguistics); Extraction (chemistry); Image (mathematics); Natural language processing; Linguistics","score_opus":0.025762826474082255,"score_gpt":0.34723351948536874,"score_spread":0.3214706930112865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059208361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18495862,0.0018011964,0.7904915,0.00088188634,0.00010522605,0.00026676082,0.00031973177,0.0034232328,0.017751895],"genre_scores_gemma":[0.54747117,0.0013120016,0.44552892,0.00033554804,0.00004391546,0.00037419243,0.0007443933,0.0006643548,0.0035255635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796283,0.00077209703,0.00016739957,0.00019130326,0.0007908131,0.00011562644],"domain_scores_gemma":[0.994341,0.003976537,0.00022426501,0.0003949235,0.0009784523,0.00008471049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00272276,0.0005610021,0.0007050215,0.0014374699,0.00035912584,0.0015827722,0.0012101579,0.00082441774,0.0014141991],"category_scores_gemma":[0.00900402,0.00020811711,0.00086759357,0.0017616098,0.00064765,0.0017444496,0.0006061372,0.00091672374,0.0003628617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007736751,0.000334562,0.0023480805,0.0004619812,0.00013617174,0.00014071113,0.0003790063,0.37955025,0.008698933,0.04378299,0.00301938,0.5603742],"study_design_scores_gemma":[0.000041635543,0.00016378904,0.00072146056,0.000056823294,0.000029936891,0.00008509931,0.00011379176,0.9789493,0.005115202,0.011580113,0.003114698,0.000027962938],"about_ca_topic_score_codex":0.0035647762,"about_ca_topic_score_gemma":0.0023248573,"teacher_disagreement_score":0.0035647762,"about_ca_system_score_codex":0.0012758638,"about_ca_system_score_gemma":0.0011160562,"threshold_uncertainty_score":0.014399469},"labels":[],"label_agreement":null},{"id":"W2060396181","doi":"10.1109/iccse.2014.6926455","title":"A framework of design weakness detection through machine health monitoring for the evolutionary design optimization of multi-domain systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Genetic programming; Engineering design process; Domain (mathematical analysis); Process (computing); Evolutionary computation; Computer-automated design; Evolutionary algorithm; Design process; Systems design; Evolutionary programming; Control engineering; Industrial engineering; Artificial intelligence; Work in process; Software engineering; Engineering","score_opus":0.04951176620425373,"score_gpt":0.2998775211468886,"score_spread":0.25036575494263485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060396181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011938243,0.00021588891,0.99732363,0.00006270025,0.000012135804,0.000029412133,0.000013446658,0.00006157959,0.0010872927],"genre_scores_gemma":[0.23500249,0.00092278863,0.76142573,0.00012065444,0.000072297975,0.00041921606,0.00012777894,0.00005308449,0.001855946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984989,0.00041909472,0.0000841072,0.0003623716,0.0005367024,0.0000987749],"domain_scores_gemma":[0.99930143,0.0002678968,0.00013040296,0.000086520755,0.0001800589,0.000033702254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020475432,0.0013838975,0.0009693247,0.0018729013,0.00071974524,0.001272058,0.001923504,0.0012092746,0.0016728665],"category_scores_gemma":[0.002751585,0.0004325255,0.0012694062,0.0014664312,0.002172208,0.001514353,0.0018140579,0.0015923019,0.00022438515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040779254,0.00006929558,0.0013574775,0.00024033079,0.00007125179,0.0002319705,0.0002977566,0.6587339,0.007236649,0.25290844,0.001163747,0.077648446],"study_design_scores_gemma":[0.000008070227,0.000048097725,0.00028054925,0.00003127308,0.00001703937,0.000053925596,0.00002278055,0.95933133,0.0010262193,0.036240514,0.0029209622,0.000019271602],"about_ca_topic_score_codex":0.0038886135,"about_ca_topic_score_gemma":0.0024807435,"teacher_disagreement_score":0.0038886135,"about_ca_system_score_codex":0.001385253,"about_ca_system_score_gemma":0.0014078765,"threshold_uncertainty_score":0.010828555},"labels":[],"label_agreement":null},{"id":"W2061082504","doi":"10.1145/2330163.2330250","title":"Depictions of genotypic space for evaluating the suitability of different recombination operators","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Subspace topology; Operator (biology); Recombination; Genetic algorithm; Computer science; Space (punctuation); Genotype; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning; Genetics; Biology","score_opus":0.0462892064301885,"score_gpt":0.3273232280451655,"score_spread":0.281034021614977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061082504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50677246,0.0011599564,0.44350648,0.0014613749,0.00035127925,0.00040499994,0.0026386743,0.005952697,0.037751947],"genre_scores_gemma":[0.79196924,0.0005062687,0.2027135,0.00008688486,0.000022680946,0.00033178297,0.0009801151,0.00042623436,0.0029632088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996101,0.00018182848,0.00003194415,0.000032886954,0.000089282956,0.000054039196],"domain_scores_gemma":[0.99607265,0.0026889031,0.00023625391,0.00033438418,0.00052350125,0.00014426427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040892,0.00090883294,0.00033522802,0.0026743666,0.00040113422,0.0013920405,0.0005185278,0.00092801213,0.0071548647],"category_scores_gemma":[0.0070402524,0.00020496156,0.00039612784,0.0013385784,0.00052242546,0.0011626713,0.0007321122,0.00071613415,0.00056645117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024263617,0.00040013576,0.018633738,0.0007770487,0.00013732714,0.001881817,0.0033895455,0.3644006,0.10528379,0.10789292,0.016120497,0.37865624],"study_design_scores_gemma":[0.00023880744,0.0008355365,0.016772624,0.0002972015,0.00011750585,0.0010947501,0.002092455,0.8534145,0.059755776,0.039693303,0.025475517,0.00021195719],"about_ca_topic_score_codex":0.0019217454,"about_ca_topic_score_gemma":0.0019046504,"teacher_disagreement_score":0.0071548647,"about_ca_system_score_codex":0.00051355467,"about_ca_system_score_gemma":0.00037518062,"threshold_uncertainty_score":0.023935378},"labels":[],"label_agreement":null},{"id":"W2061732391","doi":"10.1109/tmag.2011.2172921","title":"Comparison of Evolutionary and Rule-Based Strategies for Electromagnetic Device Optimization","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Process (computing); Evolutionary algorithm; Evolutionary computation; Induction motor; Electromagnetics; Design process; Control engineering; Artificial intelligence; Electronic engineering; Electrical engineering; Work in process; Voltage","score_opus":0.024938526818554168,"score_gpt":0.2875490835401459,"score_spread":0.2626105567215917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061732391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13566399,0.0011962419,0.8465789,0.00024624149,0.00008797864,0.00023476772,0.000044159235,0.00033485872,0.015612784],"genre_scores_gemma":[0.7716281,0.0005108398,0.22464009,0.00010610714,0.000026262933,0.00017897839,0.000078121746,0.00006930588,0.002762227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994037,0.00017872793,0.00003594248,0.000060106515,0.00027713992,0.000044310636],"domain_scores_gemma":[0.99859077,0.0009103663,0.00008847511,0.000109301574,0.00025511507,0.00004599739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015288141,0.00068699464,0.00073792663,0.00089898845,0.00022278482,0.0007830962,0.0010447522,0.0009398673,0.0012047384],"category_scores_gemma":[0.0036071131,0.0002404344,0.00041999828,0.0005243991,0.0004883845,0.00059401605,0.0005257424,0.0004197151,0.00021419532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011248256,0.00019838124,0.0009036206,0.000108714936,0.00009199157,0.00009659444,0.00008122626,0.7956897,0.0030685635,0.010801699,0.0003560326,0.18849102],"study_design_scores_gemma":[0.000029958468,0.00013359284,0.0003391414,0.000012773589,0.000023295726,0.00004122422,0.000016806827,0.99506605,0.0013725598,0.0021879596,0.0007677128,0.0000087840845],"about_ca_topic_score_codex":0.0017618127,"about_ca_topic_score_gemma":0.0017857517,"teacher_disagreement_score":0.0017618127,"about_ca_system_score_codex":0.0004676538,"about_ca_system_score_gemma":0.0004872309,"threshold_uncertainty_score":0.008085251},"labels":[],"label_agreement":null},{"id":"W2063309933","doi":"10.1145/2330163.2330249","title":"An empirical approach to the measurement of interchromosomal distances in the genetic algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming distance; Traverse; Genetic distance; Genetic algorithm; Measure (data warehouse); Computer science; Distance measures; Algorithm; Tree traversal; Population; Distance matrix; Distance measurement; Mutation; Point (geometry); Crossover; Data mining; Mathematics; Artificial intelligence; Genetic diversity; Machine learning; Biology; Genetics","score_opus":0.052107589972097336,"score_gpt":0.2978454653580389,"score_spread":0.24573787538594158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063309933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047207963,0.00047613768,0.9461922,0.0008937144,0.00004230317,0.00015490246,0.00013676588,0.00022093607,0.004674998],"genre_scores_gemma":[0.43586943,0.00049765105,0.56193197,0.00021106345,0.000058373855,0.00044278638,0.0002544263,0.00010717117,0.00062720414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9731529,0.01591117,0.0014971007,0.0028788843,0.006283101,0.0002768159],"domain_scores_gemma":[0.85477924,0.108619586,0.008097645,0.015046244,0.012677864,0.00077940826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019836595,0.000958258,0.0007212197,0.0041792165,0.0015031956,0.0039153127,0.002447472,0.0020854233,0.0011369236],"category_scores_gemma":[0.2105852,0.00062386884,0.0005325832,0.004790577,0.005504033,0.006174435,0.0028131278,0.00374962,0.00024178474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020411858,0.00066755153,0.10339392,0.0007702602,0.00040130995,0.00031615738,0.0042054337,0.15695421,0.006972545,0.48531273,0.0024096055,0.23839217],"study_design_scores_gemma":[0.000052401032,0.0005944595,0.02318106,0.00043958463,0.000077581426,0.0013256369,0.0019391733,0.69744337,0.007297779,0.25240132,0.0150975855,0.0001500278],"about_ca_topic_score_codex":0.0024042034,"about_ca_topic_score_gemma":0.0022731912,"teacher_disagreement_score":0.019836595,"about_ca_system_score_codex":0.0025288803,"about_ca_system_score_gemma":0.0019888936,"threshold_uncertainty_score":0.104907155},"labels":[],"label_agreement":null},{"id":"W2063595231","doi":"10.1145/2247569.2247586","title":"Interdisciplinary teaching and learning in computing science","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Computer science; Human-centered computing; Data science; Mathematics education; Management science; Engineering ethics; Information science; Psychology; Engineering","score_opus":0.013371540828691904,"score_gpt":0.300043532964328,"score_spread":0.2866719921356361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063595231","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092315674,0.038644943,0.08156798,0.19450347,0.0062197056,0.0002553161,0.00018748446,0.00051305746,0.5857924],"genre_scores_gemma":[0.70093894,0.038972393,0.0701736,0.012541788,0.0030524454,0.0003815584,0.00024539055,0.00031697532,0.17337693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9955918,0.0021849826,0.00018955272,0.00050868694,0.0009356746,0.0005891908],"domain_scores_gemma":[0.9849258,0.0062308814,0.00079847215,0.0011261567,0.0014961004,0.0054225703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005795173,0.00063823507,0.00049907435,0.0025078477,0.0038341258,0.0066867806,0.0010284686,0.0014119598,0.016604176],"category_scores_gemma":[0.014632298,0.00024830987,0.00037546922,0.002703628,0.004924571,0.0031760808,0.0062501556,0.0036460476,0.0025169307],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055870914,0.00048426387,0.005064108,0.00043942675,0.000025194187,0.00018889768,0.010493798,0.002038831,0.0013995745,0.48267025,0.08785807,0.40928176],"study_design_scores_gemma":[0.00001807965,0.0001309763,0.006105349,0.00064764614,0.000009091531,0.0003591401,0.0059258966,0.0026342478,0.0014108539,0.2569671,0.72575635,0.00003540509],"about_ca_topic_score_codex":0.0029312398,"about_ca_topic_score_gemma":0.006251663,"teacher_disagreement_score":0.016604176,"about_ca_system_score_codex":0.005361101,"about_ca_system_score_gemma":0.010744221,"threshold_uncertainty_score":0.055546522},"labels":[],"label_agreement":null},{"id":"W2064889600","doi":"10.1002/cpe.1604","title":"Evolvable hardware design based on a novel simulated annealing in an embedded system","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Evolvable hardware; Field-programmable gate array; Scalability; Simulated annealing; Digital electronics; Computer architecture; Electronic circuit; Embedded system; Circuit design; Gate array; Computer engineering; Algorithm; Electrical engineering","score_opus":0.03562519764943902,"score_gpt":0.3304635492285391,"score_spread":0.2948383515791001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064889600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14696427,0.00018791799,0.84348065,0.00018956786,0.000046343426,0.00008580291,0.000025303087,0.0007372887,0.008282819],"genre_scores_gemma":[0.8369179,0.00006680512,0.16015561,0.00004099855,0.000006753232,0.00011170929,0.000027560058,0.000036163845,0.0026364375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998574,0.000038603554,0.0000075313596,0.000031318028,0.000048056918,0.000017130224],"domain_scores_gemma":[0.99986684,0.000043094005,0.00001896602,0.00002629392,0.000033129036,0.000011689585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023436431,0.00027929933,0.00029995618,0.00024562367,0.00032074627,0.00040271683,0.00056149485,0.00042297074,0.0015178632],"category_scores_gemma":[0.0004237591,0.00016993737,0.00041006145,0.00016055377,0.00041784858,0.00025430208,0.00039404788,0.00034695645,0.00016289446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051571707,0.00003854021,0.0006484292,0.00004558446,0.00003335991,0.00014074733,0.00009409258,0.91805375,0.03326105,0.017003497,0.00036231772,0.03026702],"study_design_scores_gemma":[0.000007365658,0.000039148923,0.00011563536,0.0000024185,0.0000069724074,0.000021466125,0.000004139671,0.99519604,0.0025215282,0.001273723,0.00080803595,0.0000034781026],"about_ca_topic_score_codex":0.0014105908,"about_ca_topic_score_gemma":0.0010986228,"teacher_disagreement_score":0.0015178632,"about_ca_system_score_codex":0.00042193837,"about_ca_system_score_gemma":0.00044412754,"threshold_uncertainty_score":0.0050777793},"labels":[],"label_agreement":null},{"id":"W2066320437","doi":"10.1145/1570256.1570356","title":"Deployment of CPU and GPU-based genetic programming on heterogeneous devices","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Benchmark (surveying); Graphics; Genetic programming; Implementation; CUDA; Software deployment; General-purpose computing on graphics processing units; Computer architecture; Symmetric multiprocessor system; Central processing unit; Hardware acceleration; Graphics processing unit; Parallel computing; Embedded system; Computer hardware; Field-programmable gate array; Operating system; Artificial intelligence; Software engineering","score_opus":0.01309308493188346,"score_gpt":0.24719778840001194,"score_spread":0.23410470346812848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066320437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45207274,0.00027939453,0.52768135,0.0004142981,0.00010973976,0.00018578258,0.00008958722,0.0024396258,0.01672754],"genre_scores_gemma":[0.6591116,0.000111268404,0.33667335,0.000101964826,0.000015086975,0.00011055761,0.00015172632,0.00021035102,0.003514068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954337,0.000117478594,0.00002389813,0.00009186794,0.00016084992,0.000062456405],"domain_scores_gemma":[0.99954873,0.00014101515,0.000030233405,0.00013164191,0.00010167581,0.000046688045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045965475,0.00034376472,0.0003984468,0.00045456176,0.000304368,0.00087637996,0.0015205612,0.00055146695,0.0018689753],"category_scores_gemma":[0.002256942,0.0002552543,0.00030601953,0.00063599146,0.00036654974,0.0006638444,0.00066033076,0.0006477732,0.00039286018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007557466,0.00040543234,0.006300953,0.00012174359,0.00016516857,0.0009172506,0.00029209536,0.4632688,0.09189547,0.023523778,0.005377592,0.40697592],"study_design_scores_gemma":[0.0001029829,0.00014790005,0.001482917,0.000013053097,0.000030400519,0.000121437966,0.000077347555,0.9617491,0.027462179,0.0032459893,0.005545538,0.000021096015],"about_ca_topic_score_codex":0.0045025973,"about_ca_topic_score_gemma":0.0043764384,"teacher_disagreement_score":0.0045025973,"about_ca_system_score_codex":0.0007350816,"about_ca_system_score_gemma":0.00072052586,"threshold_uncertainty_score":0.008952796},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.018196221574497944,"score_gpt":0.29362645588265945,"score_spread":0.2754302343081615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066790509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2628495,0.044267107,0.63871866,0.00801217,0.0006684982,0.00015224093,0.000108986125,0.000445011,0.044777885],"genre_scores_gemma":[0.8740929,0.013402307,0.107828245,0.0003567048,0.00057522557,0.0001509155,0.00007253853,0.00018401013,0.0033372531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826837,0.000802263,0.00011588067,0.00025573483,0.0004362003,0.00012157261],"domain_scores_gemma":[0.98643285,0.01146904,0.00053628185,0.000818575,0.00055900274,0.00018416058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043213465,0.0006645116,0.0008197755,0.0015185949,0.0006147405,0.0026013078,0.0010800071,0.0018565377,0.0018770027],"category_scores_gemma":[0.03224909,0.0004968963,0.00072515494,0.0011801758,0.003174431,0.005832228,0.0017066224,0.0026500735,0.00028369695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017954805,0.000057292185,0.0065549524,0.00039802084,0.00014570962,0.00028605934,0.00076709146,0.19997904,0.0048816768,0.7087135,0.0007572813,0.07727998],"study_design_scores_gemma":[0.000051998733,0.00014429732,0.0025215775,0.00016610786,0.00006704717,0.00054883835,0.00013900966,0.2724224,0.0026283723,0.7137653,0.007497536,0.000047562065],"about_ca_topic_score_codex":0.00023073518,"about_ca_topic_score_gemma":0.00015380901,"teacher_disagreement_score":0.0043213465,"about_ca_system_score_codex":0.0007243901,"about_ca_system_score_gemma":0.00043529828,"threshold_uncertainty_score":0.022853792},"labels":[],"label_agreement":null},{"id":"W2066959433","doi":"10.1016/j.neunet.2009.06.043","title":"Neural networks with multiple general neuron models: A hybrid computational intelligence approach using Genetic Programming","year":2009,"lang":"en","type":"article","venue":"Neural Networks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Artificial neural network; Computer science; Genetic programming; Artificial intelligence; Biological neuron model; Representation (politics); A priori and a posteriori; Set (abstract data type); Fitness function; Function (biology); Evolutionary computation; Computation; Genetic algorithm; Machine learning; Algorithm","score_opus":0.030335719353274667,"score_gpt":0.24682649595986822,"score_spread":0.21649077660659355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066959433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01762315,0.0007030709,0.97734374,0.0003296371,0.00007518707,0.00003244623,0.000015190081,0.00012255408,0.0037550775],"genre_scores_gemma":[0.4578003,0.0009095955,0.53315765,0.00023476289,0.00014103744,0.00023041578,0.000052721753,0.000113815244,0.007359728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996506,0.00015384654,0.000014497665,0.000053230553,0.00010030319,0.000027454626],"domain_scores_gemma":[0.9993981,0.0003904544,0.00005364718,0.000039782466,0.00008903854,0.000028986944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011124718,0.0006851455,0.0012317178,0.0005958913,0.00052052794,0.0014082212,0.0025117693,0.0023798859,0.0015445403],"category_scores_gemma":[0.0025202348,0.00071229326,0.0009462743,0.0009939986,0.0010129755,0.0021184988,0.001134101,0.0016694854,0.00025293053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002600338,0.000026255406,0.00012775885,0.000028113807,0.00003944039,0.000043100295,0.000023801655,0.9615708,0.0005039788,0.021362633,0.00024780165,0.016000222],"study_design_scores_gemma":[0.0000034753111,0.000005094715,0.000011197395,0.0000023758964,0.0000052873233,0.000005000045,0.0000020864568,0.99530244,0.0000836529,0.0044716285,0.0001051362,0.0000025597712],"about_ca_topic_score_codex":0.0040985993,"about_ca_topic_score_gemma":0.0047638416,"teacher_disagreement_score":0.0040985993,"about_ca_system_score_codex":0.00091543235,"about_ca_system_score_gemma":0.000696762,"threshold_uncertainty_score":0.008149505},"labels":[],"label_agreement":null},{"id":"W2067050690","doi":"10.1007/s10710-010-9102-5","title":"Deployment of parallel linear genetic programming using GPUs on PC and video game console platforms","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Speedup; Implementation; Parallel computing; Video game; Genetic programming; Artificial intelligence; Multimedia; Programming language","score_opus":0.014990666441981625,"score_gpt":0.2570535366019504,"score_spread":0.24206287015996877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067050690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72742885,0.00031119873,0.21226113,0.0006791573,0.0002761453,0.0003238696,0.0005000823,0.025604038,0.032615554],"genre_scores_gemma":[0.81531173,0.00011657078,0.17616716,0.00012693959,0.00001907137,0.0001011904,0.00067492697,0.00066657487,0.006815881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968255,0.00007343585,0.000016505717,0.000074295465,0.00008047633,0.00007268607],"domain_scores_gemma":[0.99928373,0.00020063615,0.000027192513,0.00013117558,0.00024622225,0.00011104395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048058163,0.0004992865,0.00048782758,0.0005463244,0.0005944281,0.0008509227,0.0016776898,0.00048396853,0.008587145],"category_scores_gemma":[0.0013821773,0.00040924587,0.00035183772,0.0007344822,0.00032458187,0.0006132214,0.0005826076,0.00062312663,0.0010622395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042625456,0.0015971564,0.015650924,0.00041568824,0.00035747865,0.0015502272,0.0007280515,0.28378916,0.16885744,0.0132137295,0.03719081,0.4723868],"study_design_scores_gemma":[0.00029459156,0.00030779795,0.0025139796,0.000017394059,0.000058893984,0.00011146843,0.00014523977,0.94613594,0.03712416,0.0024822091,0.01077601,0.000032204127],"about_ca_topic_score_codex":0.014682544,"about_ca_topic_score_gemma":0.01111676,"teacher_disagreement_score":0.014682544,"about_ca_system_score_codex":0.0008065715,"about_ca_system_score_gemma":0.0009958954,"threshold_uncertainty_score":0.029194117},"labels":[],"label_agreement":null},{"id":"W2067190192","doi":"10.5555/338219.338265","title":"A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)","year":2000,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Tree (set theory); Algorithm; Evolutionary algorithm; Algorithm design; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.031765176822524915,"score_gpt":0.302588497937053,"score_spread":0.2708233211145281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067190192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006220254,0.00006613335,0.99224454,0.000103327155,0.000019712228,0.000050234405,0.00008351767,0.0006710123,0.00054135895],"genre_scores_gemma":[0.03148969,0.000062983236,0.9668393,0.000046345845,0.000013514836,0.000081200764,0.00036633,0.00012717686,0.0009735206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927646,0.00018100682,0.00007004338,0.00022291328,0.00017527027,0.00007438869],"domain_scores_gemma":[0.99785775,0.0011640792,0.00016499561,0.0003746456,0.00035417546,0.00008435497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016542107,0.0007169737,0.00074906053,0.0016595585,0.0009992546,0.0013972836,0.0012861909,0.0013376303,0.006339865],"category_scores_gemma":[0.0064515704,0.0006267056,0.00087531336,0.0016100836,0.00074854033,0.0017014398,0.0018975565,0.0013288998,0.0021256267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021337293,0.000097296885,0.002110279,0.0001689017,0.000051274008,0.00014886516,0.0002870327,0.119568184,0.011329758,0.024940401,0.0076417183,0.8334429],"study_design_scores_gemma":[0.00014430744,0.00012109495,0.0011877592,0.00005664737,0.000042173095,0.00038858998,0.00021033605,0.90320814,0.012410362,0.0682218,0.01396195,0.00004696084],"about_ca_topic_score_codex":0.00242984,"about_ca_topic_score_gemma":0.0023100378,"teacher_disagreement_score":0.006339865,"about_ca_system_score_codex":0.00058441615,"about_ca_system_score_gemma":0.0014168108,"threshold_uncertainty_score":0.021209002},"labels":[],"label_agreement":null},{"id":"W2067667602","doi":"10.3758/bf03192772","title":"NUANCE 3.0: Using genetic programming to model variable relationships","year":2006,"lang":"en","type":"article","venue":"Behavior Research Methods","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"Government of Canada","keywords":"Computer science; Genetic programming; Set (abstract data type); Artificial intelligence; Machine learning; Human–computer interaction; Cognitive science; Programming language; Psychology","score_opus":0.37795273108280475,"score_gpt":0.5393659313395897,"score_spread":0.1614132002567849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067667602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016893538,0.00011871683,0.9766798,0.0001483911,0.000046489207,0.000092809954,0.0002915329,0.0022122653,0.0035164524],"genre_scores_gemma":[0.12011864,0.00018819666,0.8751826,0.00012035928,0.000020428739,0.00044685727,0.00032764758,0.00049741287,0.0030979083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966276,0.00016224175,0.000014924197,0.00006523379,0.00006838574,0.000026499589],"domain_scores_gemma":[0.9990853,0.0006630489,0.00007609181,0.00006770696,0.00007987575,0.000027895452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013771325,0.00085697253,0.0007324468,0.00077133544,0.00051135925,0.0010594674,0.0020919184,0.0012441629,0.0044010323],"category_scores_gemma":[0.0047557233,0.00058626255,0.0010222602,0.00065916777,0.00061402906,0.0009151315,0.0012039366,0.0015743079,0.0006203543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006464278,0.00007331417,0.0017571213,0.00010435121,0.000107508946,0.00008416468,0.0001671033,0.90536463,0.0013284321,0.04028573,0.0018705655,0.048792474],"study_design_scores_gemma":[0.000016333064,0.000016410162,0.000117783246,0.0000120825425,0.000017048365,0.000020903439,0.000009221477,0.984577,0.0004216629,0.012891182,0.0018932914,0.0000070958586],"about_ca_topic_score_codex":0.007554899,"about_ca_topic_score_gemma":0.009515683,"teacher_disagreement_score":0.007554899,"about_ca_system_score_codex":0.0006230616,"about_ca_system_score_gemma":0.0011419844,"threshold_uncertainty_score":0.015021801},"labels":[],"label_agreement":null},{"id":"W2068310942","doi":"10.1007/s10015-005-0346-8","title":"Chemical Genetic Programming – evolutionary optimization of the genotype-to-phenotype translation set","year":2005,"lang":"en","type":"article","venue":"Artificial Life and Robotics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Institute of Information and Communications Technology","keywords":"Genetic programming; Translation (biology); Computer science; Set (abstract data type); Genotype; Genetic algorithm; Phenotype; Mathematical optimization; Artificial intelligence; Genetics; Mathematics; Biology; Machine learning; Programming language; Gene","score_opus":0.02389712210003538,"score_gpt":0.2468132428227845,"score_spread":0.2229161207227491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068310942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060381893,0.00049863616,0.90487516,0.0010162898,0.00019561168,0.00009374074,0.00005154411,0.0002381374,0.0326489],"genre_scores_gemma":[0.76755756,0.00058803544,0.21323426,0.00036327986,0.00008663185,0.00028687858,0.00008306337,0.0002224157,0.017577916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996948,0.00011677197,0.000008141869,0.00006596019,0.00008823418,0.000026160194],"domain_scores_gemma":[0.99955386,0.00026826237,0.00005014834,0.0000489373,0.000052540177,0.00002624576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006735849,0.00062118884,0.00070277427,0.0005300329,0.00051375123,0.0010508447,0.0010612994,0.0015064339,0.003274403],"category_scores_gemma":[0.002021121,0.0005020883,0.0005202831,0.0006212682,0.0017560868,0.001002129,0.0011691977,0.001088877,0.00049620523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004185214,0.000043853976,0.00017433651,0.000058457215,0.00003289081,0.0000723621,0.000035364308,0.82921726,0.004937235,0.14435443,0.000789098,0.020242818],"study_design_scores_gemma":[0.000020086034,0.00002820651,0.00005926002,0.000006074936,0.000008154795,0.000027231768,0.000007349138,0.952108,0.00080328627,0.045972057,0.00095158955,0.000008634111],"about_ca_topic_score_codex":0.0009685524,"about_ca_topic_score_gemma":0.00089323154,"teacher_disagreement_score":0.003274403,"about_ca_system_score_codex":0.00086271216,"about_ca_system_score_gemma":0.00090327073,"threshold_uncertainty_score":0.010954022},"labels":[],"label_agreement":null},{"id":"W2068466712","doi":"10.1145/1830483.1830694","title":"Interday foreign exchange trading using linear genetic programming","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Foreign exchange market; Profitability index; Currency; Genetic programming; Profit (economics); Foreign exchange; Genetic algorithm; Trading strategy; Algorithmic trading; Computer science; Value (mathematics); Econometrics; Mathematical optimization; Business; Economics; Monetary economics; Financial economics; Artificial intelligence; Microeconomics; Mathematics; Machine learning; Finance","score_opus":0.028386266137864602,"score_gpt":0.27504591806854506,"score_spread":0.24665965193068046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068466712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2984452,0.00034737692,0.68771464,0.0005748594,0.000049477938,0.00010855296,0.00008666069,0.0009287126,0.011744502],"genre_scores_gemma":[0.88260967,0.00014591626,0.113514826,0.00008911595,0.000019802272,0.00010529547,0.000075637574,0.000052057127,0.0033877485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.00014633794,0.000010386919,0.00004713813,0.00006461954,0.000034888093],"domain_scores_gemma":[0.9989849,0.000732688,0.00010811957,0.00003290239,0.000111568996,0.000029854778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542557,0.0005230398,0.00062661327,0.0006274837,0.00038544065,0.0013685817,0.00072713033,0.00089075323,0.0014740735],"category_scores_gemma":[0.0024832,0.00038600306,0.00051339855,0.0005865101,0.00044264446,0.000674553,0.0005245123,0.0005843524,0.00018139111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018958828,0.000021095932,0.0004792217,0.000008031041,0.000017248334,0.000018663794,0.000015236301,0.9846538,0.00038514438,0.0011656653,0.00008854908,0.013128489],"study_design_scores_gemma":[0.0000033749584,0.000011640115,0.00006731943,0.0000012981791,0.0000032354799,0.00000352952,0.0000031871416,0.99916244,0.000121570614,0.000560352,0.00006011975,0.0000018639892],"about_ca_topic_score_codex":0.011831431,"about_ca_topic_score_gemma":0.0095126275,"teacher_disagreement_score":0.011831431,"about_ca_system_score_codex":0.0010650733,"about_ca_system_score_gemma":0.00082088937,"threshold_uncertainty_score":0.023525119},"labels":[],"label_agreement":null},{"id":"W2068717754","doi":"10.1145/1569901.1596275","title":"Design &amp; Implementation of Real-time Parallel GA Operators on the IBM Cell Processor","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Brock University","keywords":"Computer science; Parallel computing; Crossover; Scalability; SIMD; Population; Knapsack problem; Genetic algorithm; Algorithm; Operating system; Artificial intelligence","score_opus":0.0259628656432935,"score_gpt":0.28696804086064576,"score_spread":0.2610051752173523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068717754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23975483,0.0003664493,0.7256587,0.0003117373,0.0001776114,0.00033559906,0.00030762044,0.008876256,0.024211163],"genre_scores_gemma":[0.54281276,0.00014698016,0.45016283,0.000098859615,0.000015094869,0.0003449812,0.00033147965,0.00020642701,0.0058805784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999863,0.000021998827,0.0000066762586,0.000022865783,0.00005602478,0.000029388428],"domain_scores_gemma":[0.99981743,0.00003096043,0.000019284325,0.0000306867,0.00008599546,0.000015624877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021383147,0.0003578434,0.00022534178,0.00022151247,0.00022667025,0.00039912882,0.0008391104,0.00028771933,0.004070665],"category_scores_gemma":[0.00037173595,0.00014160512,0.00017663983,0.00022927532,0.00017699676,0.00020027225,0.00015632258,0.00035950917,0.0008588085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007587,0.00038511108,0.0032791712,0.0004489631,0.00009180713,0.0005539882,0.00022519828,0.35306618,0.2604194,0.017762903,0.012602167,0.35040644],"study_design_scores_gemma":[0.0002386355,0.00062873214,0.0011241848,0.000019006575,0.000047115216,0.00021655935,0.000044952212,0.8181089,0.14890538,0.0022196348,0.028422559,0.000024327312],"about_ca_topic_score_codex":0.0016895867,"about_ca_topic_score_gemma":0.0019245453,"teacher_disagreement_score":0.004070665,"about_ca_system_score_codex":0.0004449954,"about_ca_system_score_gemma":0.0009887085,"threshold_uncertainty_score":0.013617754},"labels":[],"label_agreement":null},{"id":"W2069152178","doi":"10.1145/1569901.1570119","title":"Soft memory for stock market analysis using linear and developmental genetic programming","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Long memory; Profit (economics); Econometrics; Parallel computing; Economics; Microeconomics; Artificial intelligence","score_opus":0.021146752539593153,"score_gpt":0.27160162002449556,"score_spread":0.2504548674849024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069152178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10732193,0.00021251322,0.8877113,0.00021745263,0.000028777795,0.000066819564,0.000059589238,0.0011855251,0.0031961778],"genre_scores_gemma":[0.66533536,0.00014004286,0.33160186,0.0001490642,0.000016162712,0.00015153845,0.00008405397,0.000091422284,0.002430616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997414,0.00009108625,0.000017657389,0.000043554417,0.000077467885,0.000028911796],"domain_scores_gemma":[0.9986713,0.0010013862,0.000112509355,0.000064571235,0.00012413428,0.000026155802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007655764,0.00042759065,0.00036541646,0.0007198509,0.0002059375,0.00090632914,0.0009058016,0.00061229686,0.0022163116],"category_scores_gemma":[0.0040411013,0.000296742,0.00050809595,0.0005045136,0.00048635763,0.00072320603,0.00072265277,0.0007643616,0.00024133976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009657126,0.000068055895,0.002061414,0.000067863024,0.00006006897,0.000096256335,0.000074164745,0.8586582,0.0049144556,0.012454513,0.00050439744,0.12094399],"study_design_scores_gemma":[0.00000494818,0.00001663787,0.00012861099,0.0000028658824,0.0000051617967,0.00000810392,0.0000045430484,0.996644,0.0007475463,0.0022750755,0.00015913356,0.0000033849014],"about_ca_topic_score_codex":0.004483834,"about_ca_topic_score_gemma":0.004767686,"teacher_disagreement_score":0.004483834,"about_ca_system_score_codex":0.0006596187,"about_ca_system_score_gemma":0.0007347532,"threshold_uncertainty_score":0.008915424},"labels":[],"label_agreement":null},{"id":"W2069303594","doi":"10.1007/s10710-010-9114-1","title":"Developments in Cartesian Genetic Programming: self-modifying CGP","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Iterated function; Sequence (biology); Cartesian coordinate system; Theoretical computer science; Adder; Mathematical optimization; Graph; Algorithm; Artificial intelligence; Mathematics","score_opus":0.007554399215886767,"score_gpt":0.2345407968960176,"score_spread":0.22698639768013082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069303594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052637313,0.002485326,0.9778541,0.00046833808,0.00030364475,0.00004641318,0.000027811773,0.00055029965,0.013000338],"genre_scores_gemma":[0.095860295,0.0041388944,0.89036477,0.000372638,0.00029378798,0.00010955108,0.0001165587,0.00037288025,0.008370681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994949,0.00016473632,0.000025587391,0.000112868554,0.00017614297,0.00002576003],"domain_scores_gemma":[0.9991786,0.0003514714,0.00003241519,0.00017662004,0.00021842073,0.000042488413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009948816,0.0005776244,0.0007118271,0.0004421074,0.00032648622,0.0012910186,0.001669584,0.000977073,0.003024434],"category_scores_gemma":[0.0026255932,0.00043988423,0.00068874686,0.0010929108,0.001476878,0.0012365215,0.0010905551,0.0030261255,0.0010904378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008423063,0.000095950505,0.00053523225,0.00035540768,0.00005318057,0.00010588088,0.00034786866,0.08441564,0.008430864,0.58353883,0.0044884295,0.31754848],"study_design_scores_gemma":[0.000102374,0.00019788972,0.0004709334,0.0001937748,0.00008397037,0.00042377983,0.00006196666,0.49318328,0.012696523,0.31781417,0.17469752,0.00007374398],"about_ca_topic_score_codex":0.0017799041,"about_ca_topic_score_gemma":0.0010652483,"teacher_disagreement_score":0.003024434,"about_ca_system_score_codex":0.00061163114,"about_ca_system_score_gemma":0.0007749821,"threshold_uncertainty_score":0.01011771},"labels":[],"label_agreement":null},{"id":"W2070535092","doi":"10.1145/2001858.2001963","title":"Bloat control in genetic programming with a histogram-based accept-reject method","year":2011,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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; Compute Canada","keywords":"Genetic programming; Histogram; Tree (set theory); Computer science; Population; Mathematical optimization; Genetic algorithm; Histogram equalization; Control (management); Dynamic programming; Artificial intelligence; Machine learning; Algorithm; Mathematics; Image (mathematics)","score_opus":0.020192687049978682,"score_gpt":0.25021413935087194,"score_spread":0.23002145230089327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070535092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016852405,0.00005009328,0.98121876,0.000057021985,0.0000115074645,0.000029440404,0.000010721146,0.00082049076,0.0009495158],"genre_scores_gemma":[0.508755,0.000069783026,0.48651388,0.0002248535,0.000033522363,0.00022046092,0.00006349529,0.00048917596,0.003629824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919146,0.0002690119,0.000038843977,0.00013002947,0.00030025022,0.000070373724],"domain_scores_gemma":[0.9978582,0.0013689057,0.00017271985,0.00021264364,0.00031327258,0.000074122545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014790405,0.00044840065,0.0005122762,0.0005241055,0.00031462536,0.0008047463,0.00139074,0.00082436315,0.0017551007],"category_scores_gemma":[0.004383202,0.0002560909,0.00040028695,0.00041694616,0.0009710069,0.0009424171,0.00078279397,0.0011977656,0.000301139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004410741,0.0003026787,0.003030062,0.00013649656,0.00009029997,0.00015515766,0.00047839188,0.5806346,0.033132263,0.04896019,0.0018470722,0.33079168],"study_design_scores_gemma":[0.00003300738,0.00006167331,0.00024373086,0.0000053822414,0.000011380554,0.000025743735,0.000010918958,0.9892424,0.004296435,0.005057706,0.0009980521,0.000013592647],"about_ca_topic_score_codex":0.0025981783,"about_ca_topic_score_gemma":0.0020652048,"teacher_disagreement_score":0.0025981783,"about_ca_system_score_codex":0.0005575005,"about_ca_system_score_gemma":0.0006248308,"threshold_uncertainty_score":0.007822037},"labels":[],"label_agreement":null},{"id":"W2071988634","doi":"10.1145/1102256.1102262","title":"Generalized benchmark generation for dynamic combinatorial problems","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Sequence (biology); Test case; Mathematical optimization; Optimization problem; Theoretical computer science; Algorithm; Machine learning; Mathematics","score_opus":0.01602578299514038,"score_gpt":0.2577925186605712,"score_spread":0.2417667356654308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071988634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05880452,0.00088922586,0.92181677,0.0002815134,0.00012684907,0.0007943839,0.0006680276,0.0034696008,0.013149191],"genre_scores_gemma":[0.3181761,0.0007094207,0.6721599,0.00019604451,0.000052806143,0.0012051557,0.003084135,0.0007680872,0.0036483302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983114,0.000757504,0.00009504282,0.00020175905,0.0004742783,0.00015996875],"domain_scores_gemma":[0.9963846,0.0019248206,0.00025267267,0.0008445877,0.00048649244,0.00010683366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021187812,0.0011628169,0.0008399124,0.0017816264,0.00042745948,0.00086250546,0.0018700832,0.00076668937,0.0044367635],"category_scores_gemma":[0.008833425,0.00033698927,0.00088738,0.0020811427,0.0007297658,0.00086589396,0.0012298768,0.0011172789,0.0005368118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002518581,0.0002995776,0.0015790681,0.00069265405,0.00006937263,0.00042099407,0.00013024759,0.5886266,0.012474913,0.0704454,0.010622722,0.31438658],"study_design_scores_gemma":[0.00013562539,0.00031131264,0.0009141924,0.000081747465,0.000044291053,0.0002678122,0.000049047798,0.9020327,0.012067761,0.06509436,0.018957937,0.0000432079],"about_ca_topic_score_codex":0.0011597117,"about_ca_topic_score_gemma":0.0014675537,"teacher_disagreement_score":0.0044367635,"about_ca_system_score_codex":0.0008399832,"about_ca_system_score_gemma":0.0009949333,"threshold_uncertainty_score":0.014842451},"labels":[],"label_agreement":null},{"id":"W2072164538","doi":"10.1142/s0218213006002990","title":"AGGREGATION OF MULTIPLE REINFORCEMENT LEARNING ALGORITHMS","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reinforcement learning; Learning classifier system; Robustness (evolution); Artificial intelligence; Instance-based learning; Machine learning; Algorithm; Unsupervised learning; Robot learning; Fault tolerance; Architecture; Distributed computing; Robot","score_opus":0.041193865031591316,"score_gpt":0.30338059112739435,"score_spread":0.262186726095803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072164538","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07982716,0.0004664074,0.9134955,0.00022335978,0.0001426256,0.00014817866,0.000025461031,0.0014278328,0.0042434447],"genre_scores_gemma":[0.9054611,0.00012956763,0.0919989,0.00007319022,0.000055162953,0.00012114835,0.00004003687,0.000037448917,0.002083424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868566,0.00037972163,0.00009749055,0.0002804828,0.00039726915,0.00015936987],"domain_scores_gemma":[0.9980432,0.00070992723,0.00024427127,0.0003521309,0.00050092273,0.00014956416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031568,0.0008557938,0.0013101926,0.00056277344,0.000426317,0.00082340726,0.0012339407,0.00067448744,0.0018614499],"category_scores_gemma":[0.003942616,0.0003648858,0.0005583841,0.00042527483,0.0005728651,0.0010701622,0.0016001955,0.0010019118,0.0003674874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024498964,0.0001756443,0.0020007128,0.00011508811,0.00016472315,0.00018623206,0.00013762111,0.7530064,0.007997213,0.0075038644,0.0011905094,0.227277],"study_design_scores_gemma":[0.000022426504,0.00010828373,0.00024025585,0.0000068292034,0.000019952082,0.00003576862,0.000010530746,0.9937056,0.0015674988,0.0034084823,0.00086539134,0.000008908991],"about_ca_topic_score_codex":0.0018932078,"about_ca_topic_score_gemma":0.001609518,"teacher_disagreement_score":0.002031568,"about_ca_system_score_codex":0.0006442693,"about_ca_system_score_gemma":0.00070533063,"threshold_uncertainty_score":0.010744095},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Memorial University of Newfoundland","funders":"Francis Crick Institute","keywords":"Biology; Evolutionary biology; Computational biology","score_opus":0.1358435689049677,"score_gpt":0.4411245088382254,"score_spread":0.30528093993325767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072396808","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006744079,0.9929658,0.0008781178,0.0037772995,0.0009713669,0.000002766267,0.000006482604,0.000009295515,0.0013215335],"genre_scores_gemma":[0.0010877734,0.99447954,0.0009340086,0.0016531103,0.0013796581,0.00000788319,0.000014768341,0.0000052344362,0.00043813002],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990398,0.00034045227,0.00008574953,0.00012029384,0.00034548366,0.00006812547],"domain_scores_gemma":[0.99238443,0.00584057,0.00021555257,0.00018649043,0.0011264351,0.0002464798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035585149,0.001103332,0.0031646835,0.0026294596,0.0006688244,0.003970148,0.0031798177,0.004771251,0.005619682],"category_scores_gemma":[0.006593269,0.00050742034,0.0006612722,0.0047733122,0.004347207,0.0075765774,0.0017638634,0.005428452,0.002189869],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009213758,0.00010671209,0.00040386856,0.0144535415,0.00014238234,0.00021417666,0.00018768695,0.001366389,0.0007144119,0.104481965,0.08769736,0.7901394],"study_design_scores_gemma":[0.000028134977,0.00006277382,0.0004393165,0.0052546146,0.00006956497,0.00076317997,0.00016454169,0.00045624026,0.00026033743,0.06574953,0.9267175,0.000034291257],"about_ca_topic_score_codex":0.0018903572,"about_ca_topic_score_gemma":0.0027134148,"teacher_disagreement_score":0.005619682,"about_ca_system_score_codex":0.0017074667,"about_ca_system_score_gemma":0.0031532627,"threshold_uncertainty_score":0.018819451},"labels":[],"label_agreement":null},{"id":"W2072513289","doi":"10.1109/cec.2010.5586297","title":"Fast and effective predictability filters for stock price series using linear genetic programming","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Predictability; Computer science; Genetic programming; Profit (economics); Time series; Linear programming; Econometrics; Machine learning; Statistics; Mathematics; Economics; Algorithm","score_opus":0.010676467769720017,"score_gpt":0.2600443149090939,"score_spread":0.2493678471393739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072513289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077543244,0.00016179925,0.91986626,0.00022848274,0.000019547684,0.000038798804,0.000027324284,0.0010163668,0.0010981616],"genre_scores_gemma":[0.72467,0.00014162782,0.27348554,0.00010708762,0.000036901773,0.00011660579,0.00011601901,0.00012810966,0.0011981173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963355,0.00011615186,0.000018353512,0.00006660067,0.00011548098,0.000049802074],"domain_scores_gemma":[0.997331,0.0021311736,0.00020273883,0.000082614315,0.00020629336,0.00004626674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015163948,0.0006337098,0.00072170654,0.0008628803,0.0003581091,0.0007091147,0.0007015992,0.0007977001,0.0009752784],"category_scores_gemma":[0.006375926,0.00047747866,0.00051455625,0.00049510703,0.0005104433,0.00077275175,0.00052241626,0.0009693423,0.00018635702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006867028,0.000045594614,0.0014458854,0.000020473071,0.00002987588,0.000038218106,0.000045767785,0.89482266,0.0014381813,0.004220794,0.00043031716,0.09739357],"study_design_scores_gemma":[0.000006879284,0.000013038549,0.00015671176,0.0000017513814,0.0000038588364,0.0000034933637,0.000003064094,0.99810433,0.00030717245,0.0013313602,0.00006592298,0.0000024454005],"about_ca_topic_score_codex":0.010365202,"about_ca_topic_score_gemma":0.007904655,"teacher_disagreement_score":0.010365202,"about_ca_system_score_codex":0.00086999475,"about_ca_system_score_gemma":0.001155406,"threshold_uncertainty_score":0.020609736},"labels":[],"label_agreement":null},{"id":"W2073442062","doi":"10.4028/www.scientific.net/amr.201-203.2536","title":"Some Improvements of Genetic Programming in Data Fitting","year":2011,"lang":"en","type":"article","venue":"Advanced materials research","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Association of Emergency Physicians","funders":"","keywords":"Crossover; Genetic programming; Mutation; Genetic algorithm; Computer science; Constant (computer programming); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.1372211397897137,"score_gpt":0.3915060183106332,"score_spread":0.2542848785209195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073442062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077842716,0.0019567893,0.98651344,0.00049558305,0.00012919171,0.000044964003,0.000033079243,0.0003141825,0.0027285106],"genre_scores_gemma":[0.21030775,0.007008267,0.77666205,0.00046746735,0.00048322487,0.00024192402,0.00022878317,0.00031110086,0.0042894823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997255,0.0008873249,0.00022462063,0.0006023395,0.00089124485,0.0001394974],"domain_scores_gemma":[0.99871707,0.00057188916,0.00007070261,0.00013069474,0.00047261178,0.00003703434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028080654,0.0010660829,0.0009863583,0.0013850519,0.0008874176,0.0011236196,0.0016826927,0.0013607155,0.0011381551],"category_scores_gemma":[0.0066667236,0.00047033545,0.001432555,0.002307796,0.00094545196,0.0022310694,0.0010880408,0.002605064,0.00032212006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014606609,0.00016407888,0.003505623,0.00051192864,0.00018936132,0.0003443759,0.0004803787,0.3466734,0.00835354,0.08202396,0.0041642077,0.553443],"study_design_scores_gemma":[0.000046451492,0.000114753966,0.0011672187,0.000077490105,0.00013182643,0.0002650777,0.00007392296,0.9347182,0.0106620975,0.03225151,0.020410039,0.00008136987],"about_ca_topic_score_codex":0.006801789,"about_ca_topic_score_gemma":0.003366248,"teacher_disagreement_score":0.006801789,"about_ca_system_score_codex":0.0010341248,"about_ca_system_score_gemma":0.0011649949,"threshold_uncertainty_score":0.014850616},"labels":[],"label_agreement":null},{"id":"W2075980255","doi":"10.1145/1389095.1389111","title":"Enhanced generalized ant programming (EGAP)","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Heuristic; Artificial intelligence; Context (archaeology); Ant colony; Mathematical optimization; Mathematics","score_opus":0.021783328372327267,"score_gpt":0.2533766446284753,"score_spread":0.23159331625614804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075980255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008211466,0.00027973345,0.9815723,0.00017971419,0.00008053689,0.00007090673,0.000036984362,0.00048745045,0.009080937],"genre_scores_gemma":[0.16502383,0.00057187874,0.82725745,0.00021708658,0.000055904395,0.0002849375,0.000077358105,0.00025554496,0.0062560327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993968,0.00022135334,0.000025533718,0.00008150336,0.000217055,0.000057804078],"domain_scores_gemma":[0.99908113,0.00053169264,0.000088818415,0.0001314826,0.00012980265,0.000037064878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068555766,0.0007953592,0.00062679785,0.0004175975,0.0004557564,0.0009677099,0.0015230987,0.0007273742,0.0039915238],"category_scores_gemma":[0.0021862003,0.0003440987,0.000639882,0.00071798183,0.0009239088,0.0010490533,0.0010620554,0.0013110976,0.0006485908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010466626,0.00007193942,0.0006595552,0.0004357548,0.00006784676,0.00032099182,0.00026059346,0.5299663,0.005669845,0.22951835,0.0044920887,0.228432],"study_design_scores_gemma":[0.00004375785,0.0001094977,0.00015887713,0.00004272802,0.00002994957,0.00027924363,0.000049478804,0.8487141,0.0029528344,0.12262691,0.024970874,0.000021692344],"about_ca_topic_score_codex":0.0010138602,"about_ca_topic_score_gemma":0.0016988056,"teacher_disagreement_score":0.0039915238,"about_ca_system_score_codex":0.000341796,"about_ca_system_score_gemma":0.0009941292,"threshold_uncertainty_score":0.013352931},"labels":[],"label_agreement":null},{"id":"W2076222444","doi":"10.1007/s10710-011-9151-4","title":"Symbiotic coevolutionary genetic programming: a benchmarking study under large attribute spaces","year":2011,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence; Machine learning; Classifier (UML); Benchmarking; Linear subspace; Subspace topology; Preprocessor; Data mining; Mathematics","score_opus":0.022636277193069976,"score_gpt":0.24684379850308896,"score_spread":0.22420752131001898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076222444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9248016,0.0010738187,0.06606846,0.00052413304,0.00006235853,0.00005294061,0.00014151505,0.00023612566,0.007038951],"genre_scores_gemma":[0.9757106,0.00018319677,0.022988966,0.000037716523,0.000012901721,0.000025849313,0.00014933359,0.000074097145,0.00081737817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979279,0.00115019,0.00007833645,0.00025325475,0.00042568482,0.00016471194],"domain_scores_gemma":[0.97697085,0.019224524,0.00049464236,0.0013843011,0.0015142091,0.0004114279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049773525,0.0005569004,0.0011206601,0.0009664877,0.0006775877,0.0016174166,0.0022503948,0.0016283294,0.0016519151],"category_scores_gemma":[0.03065821,0.00023035183,0.00045663552,0.002632063,0.001142449,0.0023829956,0.001267583,0.0014640208,0.0001293292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039493092,0.00038508174,0.004550687,0.0001581028,0.00011102385,0.00012143535,0.00014569184,0.9317301,0.00090669794,0.018829774,0.0013504858,0.04131602],"study_design_scores_gemma":[0.000015396714,0.00007280899,0.000479187,0.000004927341,0.000008645989,0.00002273925,0.00003392959,0.99533194,0.0003741325,0.0034942748,0.00015806296,0.000004019163],"about_ca_topic_score_codex":0.004834438,"about_ca_topic_score_gemma":0.0024619258,"teacher_disagreement_score":0.0049773525,"about_ca_system_score_codex":0.0011755638,"about_ca_system_score_gemma":0.00078981556,"threshold_uncertainty_score":0.02632302},"labels":[],"label_agreement":null},{"id":"W2076309380","doi":"10.1007/s00366-012-0282-x","title":"A novel engineering tool for creative design of fluid systems","year":2012,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computational fluid dynamics; Engineering design process; Process (computing); Fluid dynamics; Industrial engineering; Computation; Computational model; Domain (mathematical analysis); System dynamics; New product development; Simulation; Engineering; Mechanical engineering; Artificial intelligence; Aerospace engineering; Mathematics","score_opus":0.013563772146586784,"score_gpt":0.20010273082926125,"score_spread":0.18653895868267448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076309380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028890776,0.00012546265,0.9882046,0.00016463548,0.00013221201,0.000035906873,0.000026945707,0.0005652471,0.007855784],"genre_scores_gemma":[0.0944513,0.00036602473,0.8930526,0.00016529304,0.000112303955,0.00021663509,0.00006521193,0.0003408379,0.011229801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966836,0.00006844348,0.00001641336,0.000048019618,0.00017347168,0.000025196534],"domain_scores_gemma":[0.9996203,0.00018796381,0.000028191465,0.000079250254,0.000052654836,0.000031473406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049531186,0.000780688,0.000676077,0.0011584008,0.0008817931,0.0017531384,0.0013499813,0.0011204612,0.009921812],"category_scores_gemma":[0.0012991527,0.0004159545,0.00080152275,0.0006482985,0.0011592126,0.0016075462,0.0022397235,0.0014073342,0.0014953342],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009768044,0.00010579899,0.00024144631,0.00031201035,0.000048391303,0.0002990156,0.00026861046,0.06222137,0.047606487,0.69558936,0.00599417,0.18721572],"study_design_scores_gemma":[0.00009813897,0.00014758306,0.00014927574,0.00008903857,0.000042998134,0.0005550161,0.00006549834,0.6437794,0.020282304,0.23815636,0.09657929,0.000055054436],"about_ca_topic_score_codex":0.00019794039,"about_ca_topic_score_gemma":0.00030001823,"teacher_disagreement_score":0.009921812,"about_ca_system_score_codex":0.00031344368,"about_ca_system_score_gemma":0.00042518383,"threshold_uncertainty_score":0.0331918},"labels":[],"label_agreement":null},{"id":"W2076857376","doi":"10.1145/2463372.2463489","title":"Benchmarking pareto archiving heuristics in the presence of concept drift","year":2013,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Pareto principle; Heuristic; Genetic programming; Bottleneck; Multi-objective optimization; Scope (computer science); Genetic algorithm; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.013512755751674599,"score_gpt":0.23644282077051193,"score_spread":0.22293006501883733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076857376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38143426,0.00080060895,0.6066612,0.0004460184,0.00012754645,0.00038823922,0.00016791506,0.0007113104,0.009262885],"genre_scores_gemma":[0.76316595,0.0002704538,0.23387007,0.00011708254,0.000032249052,0.0002876353,0.00023109965,0.00012943367,0.0018960049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997792,0.00096953043,0.00010996161,0.0003141981,0.00055808027,0.00025629142],"domain_scores_gemma":[0.9860693,0.00996026,0.00073283294,0.0011984403,0.0013477036,0.00069154333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009079381,0.0011656937,0.0011867564,0.0020472899,0.0008172936,0.0023031882,0.002847841,0.0020051836,0.0015215143],"category_scores_gemma":[0.02133615,0.00044694077,0.0008738913,0.0013957482,0.0015274814,0.0015851331,0.0017976434,0.0017888917,0.0002643666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010258222,0.0001608082,0.0009224919,0.000053617023,0.000041663618,0.00004040688,0.00011676552,0.9635616,0.0006130388,0.011820273,0.0004046679,0.022162225],"study_design_scores_gemma":[0.000022234217,0.00009348081,0.00013863426,0.0000107994365,0.000009079799,0.000012392118,0.000033980108,0.99441814,0.00055901345,0.0044322284,0.000262559,0.0000074915242],"about_ca_topic_score_codex":0.0051724864,"about_ca_topic_score_gemma":0.0035313964,"teacher_disagreement_score":0.009079381,"about_ca_system_score_codex":0.0025195982,"about_ca_system_score_gemma":0.003009705,"threshold_uncertainty_score":0.048016906},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.22335852436796474,"score_gpt":0.37945373956079675,"score_spread":0.156095215192832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077218694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015469295,0.00010286219,0.99768627,0.00003081684,0.000016475366,0.000055613007,0.000011751955,0.00012523157,0.00042402485],"genre_scores_gemma":[0.04567974,0.0001885043,0.9526197,0.00004882689,0.000022429726,0.00030793663,0.00005760279,0.000046566463,0.0010287281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993185,0.00022526708,0.00003782826,0.000107323314,0.00027425942,0.00003686974],"domain_scores_gemma":[0.9994673,0.00024351352,0.00006384498,0.00005004993,0.00015934909,0.000016008822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674213,0.0010081116,0.001068403,0.0014450483,0.00048350624,0.00070987706,0.0013210601,0.0009062401,0.0013357024],"category_scores_gemma":[0.0018580873,0.00038189633,0.0010215825,0.0012508186,0.0005966034,0.0005599956,0.00064585113,0.0009308587,0.0004185664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041494462,0.000105913656,0.0008235653,0.00025223472,0.00021958588,0.00025551993,0.00014587093,0.4449508,0.01725057,0.026601905,0.001482248,0.50787026],"study_design_scores_gemma":[0.000035999234,0.00018763609,0.0006388573,0.00005849252,0.0000614347,0.00028590357,0.000031467138,0.9640257,0.008167167,0.019389452,0.0070736986,0.000044233726],"about_ca_topic_score_codex":0.0014733374,"about_ca_topic_score_gemma":0.0012396903,"teacher_disagreement_score":0.0014733374,"about_ca_system_score_codex":0.0005487517,"about_ca_system_score_gemma":0.00073317514,"threshold_uncertainty_score":0.0067028403},"labels":[],"label_agreement":null},{"id":"W2077371739","doi":"10.1109/iros.2005.1545150","title":"Enhanced learning classifier system for robot navigation","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sonar; Mobile robot; Obstacle avoidance; Computer science; Artificial intelligence; Robot; Classifier (UML); Maxima and minima; Mobile robot navigation; Obstacle; Robot learning; Machine learning; Robot control; Mathematics","score_opus":0.016427195279683816,"score_gpt":0.2598579548441792,"score_spread":0.24343075956449536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077371739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009948638,0.00054646906,0.97578263,0.0001674847,0.0003959528,0.00025435502,0.0002254787,0.006066756,0.006612314],"genre_scores_gemma":[0.13842648,0.0004950861,0.8371822,0.00037310037,0.00019827865,0.00044809995,0.0008787036,0.00028333324,0.02171461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901307,0.00010157704,0.000075109005,0.00022499193,0.00051148527,0.00007371515],"domain_scores_gemma":[0.9988036,0.00022758983,0.00007470483,0.00017984961,0.0006625071,0.000051798164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086303736,0.00049601303,0.0008192273,0.00073114585,0.0005948052,0.0008786048,0.0016977531,0.0013472749,0.008422872],"category_scores_gemma":[0.002309719,0.00025738528,0.00043413258,0.0005542078,0.00027881193,0.0011185464,0.00071799284,0.0012216042,0.0051787547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048693756,0.0003024905,0.0019872186,0.0003621594,0.00009578102,0.000531063,0.000153001,0.04796341,0.074901395,0.015757523,0.018385742,0.8390732],"study_design_scores_gemma":[0.00012601572,0.00044507618,0.0016580614,0.000074751755,0.000138216,0.0010060584,0.000032830867,0.7683188,0.0711727,0.0071244496,0.14980285,0.000100312245],"about_ca_topic_score_codex":0.0028153115,"about_ca_topic_score_gemma":0.0031277866,"teacher_disagreement_score":0.008422872,"about_ca_system_score_codex":0.0007497157,"about_ca_system_score_gemma":0.0009362538,"threshold_uncertainty_score":0.028177321},"labels":[],"label_agreement":null},{"id":"W2080638133","doi":"10.1007/s11081-011-9155-1","title":"Planned tournament selection","year":2011,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Tournament; Tournament selection; Selection (genetic algorithm); Mathematical optimization; Computer science; Population; Variety (cybernetics); Fitness proportionate selection; Fitness function; Mathematics; Artificial intelligence; Genetic algorithm","score_opus":0.010765354826782527,"score_gpt":0.18214762195242906,"score_spread":0.17138226712564653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080638133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06257347,0.00075689063,0.81833315,0.00056148163,0.0010797608,0.00044759363,0.0003636302,0.0022686978,0.11361522],"genre_scores_gemma":[0.6727484,0.0002997651,0.2557137,0.00043150038,0.00031753522,0.0004149026,0.00070854893,0.00035631406,0.0690093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910045,0.00028229563,0.000023244967,0.00019389205,0.00029231046,0.000107830565],"domain_scores_gemma":[0.9989697,0.00038927002,0.000055147288,0.00029481575,0.00019217115,0.000098907745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087515,0.00047236204,0.0005202866,0.000600983,0.0007835041,0.0014185612,0.0013140123,0.00072485337,0.022878299],"category_scores_gemma":[0.0026389381,0.00023413627,0.000557061,0.00059642346,0.00049715996,0.0005430738,0.00065744406,0.00093501253,0.0023520433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006299209,0.0002803647,0.0031836543,0.00025419256,0.00021395875,0.00030995565,0.00016484784,0.12711066,0.014767969,0.16707918,0.040724386,0.6452809],"study_design_scores_gemma":[0.0004139135,0.0012079295,0.0040734997,0.00005841134,0.00014887706,0.000795525,0.00009143238,0.76946676,0.01470835,0.11715054,0.0918034,0.00008125188],"about_ca_topic_score_codex":0.0007188233,"about_ca_topic_score_gemma":0.0018563902,"teacher_disagreement_score":0.022878299,"about_ca_system_score_codex":0.00041391427,"about_ca_system_score_gemma":0.0008154767,"threshold_uncertainty_score":0.07653552},"labels":[],"label_agreement":null},{"id":"W2080991325","doi":"10.1109/cec.2013.6557615","title":"Generative representations for artificial architecture and passive solar performance","year":2013,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Modularity (biology); Computer science; Hierarchy; Generative grammar; Set (abstract data type); Block (permutation group theory); Genetic programming; Generative Design; Artificial intelligence; Evolutionary algorithm; Reuse; Domain (mathematical analysis); Machine learning; Theoretical computer science; Programming language; Engineering; Mathematics","score_opus":0.015860950982682837,"score_gpt":0.25254184844901395,"score_spread":0.2366808974663311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080991325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048881404,0.00018149255,0.9459679,0.00023083753,0.000013112266,0.000030235751,0.000021797672,0.00025339102,0.0044198125],"genre_scores_gemma":[0.58468515,0.00025590556,0.41170785,0.00009611854,0.000015499054,0.00010578497,0.000078397694,0.00012500372,0.0029302961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.00027619512,0.000026060465,0.000076811906,0.00014609627,0.000030927502],"domain_scores_gemma":[0.99761593,0.001784534,0.00017503208,0.00024106009,0.00014039283,0.000043014177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012722561,0.0004318163,0.00030828547,0.0006131697,0.0003658958,0.0011068534,0.0007212496,0.0008803449,0.0018513438],"category_scores_gemma":[0.0059758076,0.00035066382,0.0005038144,0.00048722394,0.0015825551,0.0014257072,0.00094928907,0.0008880029,0.00024092871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042097843,0.00004754537,0.0011974686,0.00010014798,0.000029854573,0.00008439446,0.00044223835,0.7022605,0.0086629875,0.19704218,0.00043765648,0.08965287],"study_design_scores_gemma":[0.000013655153,0.000057482226,0.00035694372,0.000025029185,0.000017253273,0.00008823045,0.000053831216,0.89569145,0.003214251,0.09720804,0.0032557643,0.000017950131],"about_ca_topic_score_codex":0.0010968456,"about_ca_topic_score_gemma":0.0017401312,"teacher_disagreement_score":0.0018513438,"about_ca_system_score_codex":0.00097671,"about_ca_system_score_gemma":0.00048564092,"threshold_uncertainty_score":0.007086575},"labels":[],"label_agreement":null},{"id":"W2085695879","doi":"10.1007/s00371-011-0597-4","title":"Automatic and interactive evolution of vector graphics images with genetic algorithms","year":2011,"lang":"en","type":"article","venue":"The Visual Computer","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Computer graphics; Vector graphics; Artificial intelligence; Computer vision; Computer graphics (images); Graphics; Pixel; Geometric primitive; Algorithm","score_opus":0.014187524661601702,"score_gpt":0.2512205860698633,"score_spread":0.2370330614082616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085695879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062689036,0.00018135842,0.924682,0.00018977546,0.000100262856,0.00012647669,0.00006239466,0.00380105,0.008167615],"genre_scores_gemma":[0.4401119,0.000144507,0.554273,0.00011119854,0.000024906054,0.00016850681,0.00014591285,0.00095228234,0.0040678284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996599,0.00007857052,0.000014570722,0.000054890832,0.00014866517,0.000043430005],"domain_scores_gemma":[0.9993656,0.0003133015,0.000038594393,0.0000937736,0.00015351226,0.00003517892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136039,0.00064814585,0.0006633799,0.0009948849,0.00047947746,0.0012069828,0.0014461468,0.00096997136,0.0053390833],"category_scores_gemma":[0.002499406,0.0005075243,0.00073187187,0.0007331787,0.00072243664,0.0007443041,0.001186228,0.00086735596,0.00068300066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004282738,0.00015847092,0.0016720092,0.00019320942,0.00013130378,0.00037324117,0.0006365853,0.45074695,0.07080602,0.02630678,0.0069511035,0.4415961],"study_design_scores_gemma":[0.00006016463,0.000054350025,0.00029299277,0.0000135290875,0.000026615962,0.00008838174,0.000049371665,0.97643834,0.014029969,0.0054111294,0.0035150182,0.000020174975],"about_ca_topic_score_codex":0.0029324188,"about_ca_topic_score_gemma":0.0029285832,"teacher_disagreement_score":0.0053390833,"about_ca_system_score_codex":0.0008131132,"about_ca_system_score_gemma":0.00046847676,"threshold_uncertainty_score":0.017861009},"labels":[],"label_agreement":null},{"id":"W2086026794","doi":"10.4018/jcini.2011010102","title":"Time and Frequency Analysis of Particle Swarm Trajectories for Cognitive Machines","year":2011,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Mitacs","keywords":"Particle swarm optimization; Computer science; Multi-swarm optimization; Trajectory; Position (finance); Dimension (graph theory); Mathematical optimization; Algorithm; Mathematics; Physics","score_opus":0.023190668675210593,"score_gpt":0.2960848738202672,"score_spread":0.27289420514505663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086026794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18733253,0.0004059899,0.80659753,0.00035088402,0.000044293844,0.00004139798,0.00009335729,0.00021354987,0.0049204757],"genre_scores_gemma":[0.9277269,0.000261274,0.07039204,0.000021233496,0.000027469723,0.000049167367,0.00012323103,0.000059526905,0.0013391473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985206,0.000037533406,0.000008650567,0.00001821501,0.000069903224,0.00001363673],"domain_scores_gemma":[0.9991054,0.00053325435,0.00013053139,0.000066875546,0.00013022154,0.00003376171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005402628,0.00033986446,0.00026549012,0.0011381719,0.00045696492,0.00065920927,0.00026449317,0.00037741513,0.0012114772],"category_scores_gemma":[0.004158951,0.00014413722,0.00033058232,0.00060465693,0.00050180714,0.0006745765,0.00032755086,0.00039497606,0.00014034167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079259975,0.000025486912,0.003616839,0.0000623816,0.000033098342,0.00013128594,0.00025837476,0.87424034,0.0045125843,0.08130868,0.0005181374,0.035213575],"study_design_scores_gemma":[0.0000013012486,0.0000069738862,0.0007318702,0.0000032607552,0.000001898649,0.000017102187,0.000018356928,0.9906493,0.00031206108,0.007942755,0.00031148727,0.0000036837312],"about_ca_topic_score_codex":0.0041194432,"about_ca_topic_score_gemma":0.0016523697,"teacher_disagreement_score":0.0041194432,"about_ca_system_score_codex":0.00064869184,"about_ca_system_score_gemma":0.0003891315,"threshold_uncertainty_score":0.00819093},"labels":[],"label_agreement":null},{"id":"W2088252348","doi":"10.1016/j.procs.2010.04.111","title":"Design of a dynamic model of genes with multiple autonomous regulatory modules by evolutionary computations","year":2010,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; National Science Foundation","keywords":"Computer science; Crossover; Computation; Evolutionary computation; Evolutionary algorithm; Benchmark (surveying); Fitness function; Exploit; Architecture; Class (philosophy); Genetic architecture; Genetic algorithm; Theoretical computer science; Artificial intelligence; Gene; Machine learning; Algorithm; Biology; Genetics","score_opus":0.010310407754457884,"score_gpt":0.21874303848188967,"score_spread":0.2084326307274318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088252348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048412606,0.00016225493,0.94497997,0.00023716131,0.00003920878,0.000039260154,0.000058639893,0.00035764556,0.005713193],"genre_scores_gemma":[0.6814899,0.0004895702,0.30861038,0.00010354203,0.000030849817,0.00054092356,0.000170971,0.00017008794,0.008393803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988365,0.000025601468,0.000005692154,0.000030650182,0.000036918045,0.000017428592],"domain_scores_gemma":[0.9998872,0.000051297968,0.000013065278,0.000014055844,0.00001980389,0.000014452899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024156284,0.00038925023,0.0005954385,0.0002888652,0.00038119432,0.0007044852,0.0013197667,0.0008911892,0.0019237706],"category_scores_gemma":[0.0005109432,0.00041638254,0.0007890573,0.00029041103,0.00072846195,0.00073198247,0.0005145587,0.00069578394,0.00034271742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017099508,0.000015494079,0.0001701154,0.000022853454,0.000013127839,0.000056977497,0.000028678896,0.9666981,0.005538147,0.022116048,0.00014216601,0.0051810746],"study_design_scores_gemma":[0.00000919962,0.000010049683,0.000029616105,0.000002022093,0.000004856846,0.000011614502,0.000003817734,0.9945755,0.0006766211,0.0038803353,0.00079288747,0.0000033869503],"about_ca_topic_score_codex":0.0021471279,"about_ca_topic_score_gemma":0.0017750334,"teacher_disagreement_score":0.0021471279,"about_ca_system_score_codex":0.0005480617,"about_ca_system_score_gemma":0.0009082924,"threshold_uncertainty_score":0.0064356327},"labels":[],"label_agreement":null},{"id":"W2090163351","doi":"10.1007/s00500-011-0717-0","title":"Stock trading strategy creation using GP on GPU","year":2011,"lang":"en","type":"article","venue":"Soft Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Speedup; Computer science; CUDA; General-purpose computing on graphics processing units; Parallel computing; Genetic programming; Graphics processing unit; Graphics; Coprocessor; Operating system; Artificial intelligence","score_opus":0.07605389984430529,"score_gpt":0.2920604816094839,"score_spread":0.21600658176517862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090163351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46542394,0.00037148598,0.49942857,0.00062529946,0.0002798505,0.00016199563,0.00014060097,0.0030193634,0.030548923],"genre_scores_gemma":[0.8017134,0.0000824925,0.19394337,0.00012078617,0.00002939241,0.000067656816,0.00011177511,0.00014852617,0.00378251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982977,0.000048140082,0.000009587253,0.000029796594,0.0000505519,0.00003215696],"domain_scores_gemma":[0.9994023,0.000286717,0.000030616502,0.00009422114,0.00013876132,0.000047334594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000502799,0.00036379482,0.0006992535,0.00068196096,0.00038287474,0.0010279372,0.00089284225,0.001131965,0.0027092153],"category_scores_gemma":[0.0017696939,0.000356832,0.0005326853,0.000748551,0.0003251248,0.00066672324,0.0005316257,0.0008153116,0.00036389663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016920842,0.00014847078,0.0033425193,0.000056868084,0.00011153637,0.00028377588,0.000108788794,0.7873173,0.008336817,0.0085073,0.0025696508,0.18904774],"study_design_scores_gemma":[0.000015892138,0.00001315463,0.0001286119,0.0000015239924,0.0000069922708,0.000013488524,0.0000072716775,0.9975116,0.00081639324,0.0011294514,0.00035334477,0.0000023113587],"about_ca_topic_score_codex":0.0046378775,"about_ca_topic_score_gemma":0.0036654407,"teacher_disagreement_score":0.0046378775,"about_ca_system_score_codex":0.0005458643,"about_ca_system_score_gemma":0.0006710066,"threshold_uncertainty_score":0.009221733},"labels":[],"label_agreement":null},{"id":"W2091525225","doi":"10.3758/bf03192745","title":"NUANCE: Naturalistic University of Alberta Nonlinear Correlation Explorer","year":2006,"lang":"en","type":"article","venue":"Behavior Research Methods","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"Government of Canada","keywords":"Naturalism; Computer science; Correlation; Nonlinear system; Value (mathematics); Space (punctuation); Java; Selection (genetic algorithm); Artificial intelligence; Machine learning; Mathematics; Programming language; Epistemology; Operating system; Physics","score_opus":0.1288585428441985,"score_gpt":0.46415939054078387,"score_spread":0.33530084769658536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091525225","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55469453,0.0007560924,0.3188064,0.0011976528,0.00023776511,0.0003801614,0.0060461587,0.016942283,0.100938864],"genre_scores_gemma":[0.66914684,0.000236094,0.2954864,0.0001920174,0.000018142508,0.00027211648,0.00279159,0.00088123966,0.030975567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998517,0.000046521895,0.0000033628369,0.00003484249,0.00004123117,0.000022355407],"domain_scores_gemma":[0.9993631,0.0003485266,0.000024557306,0.00008761954,0.000097089454,0.00007905385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144778,0.00029078618,0.0002879029,0.00041394544,0.0007888524,0.0004900579,0.00087871955,0.0005751772,0.007907344],"category_scores_gemma":[0.0020251512,0.00017665248,0.0002577851,0.00049235806,0.0005592225,0.0005557127,0.00081440085,0.0005632237,0.0008408758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024759131,0.00089044677,0.020554984,0.0008571546,0.00014928947,0.0009300901,0.0019440699,0.30464032,0.04567098,0.13048479,0.113582425,0.3778195],"study_design_scores_gemma":[0.00022850983,0.0002889522,0.007252996,0.000052923064,0.000051508032,0.00043714908,0.00038814952,0.85754156,0.011751713,0.033710092,0.08821698,0.00007941693],"about_ca_topic_score_codex":0.021452306,"about_ca_topic_score_gemma":0.06875789,"teacher_disagreement_score":0.021452306,"about_ca_system_score_codex":0.0006782425,"about_ca_system_score_gemma":0.0011837368,"threshold_uncertainty_score":0.042654872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Genetic algorithm; Multi-agent system; Quality (philosophy); Machine learning; Action (physics); Human–computer interaction","score_opus":0.08123059256605626,"score_gpt":0.34896618936410717,"score_spread":0.2677355967980509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091822809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96355116,0.00014836836,0.034721836,0.00009520818,0.000018324636,0.0001084711,0.000028038497,0.00012982699,0.0011986943],"genre_scores_gemma":[0.94172347,0.00007871455,0.057523835,0.000050085713,0.0000057849566,0.00012670059,0.000051542273,0.000036841997,0.00040297656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980153,0.0009795834,0.0001505115,0.00021395384,0.0005097,0.00013096984],"domain_scores_gemma":[0.9830715,0.013213006,0.0008355413,0.0009300616,0.0015372529,0.00041270978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004285165,0.0006710933,0.00047476194,0.0007738099,0.0003474468,0.0005581415,0.0010762762,0.0011499138,0.00048099665],"category_scores_gemma":[0.020777132,0.00022274065,0.00034346976,0.00051306246,0.0010247271,0.0008450139,0.0005640983,0.00065800006,0.00008133111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032283834,0.0038191336,0.020400085,0.00044413237,0.00033410513,0.00023272904,0.0006331754,0.76734567,0.049818095,0.0033357043,0.00027938248,0.1501294],"study_design_scores_gemma":[0.0003604081,0.0034785212,0.0043156394,0.00002815816,0.000160537,0.00008642204,0.00016874366,0.949014,0.0403696,0.0015538835,0.0004184331,0.000045647488],"about_ca_topic_score_codex":0.002346991,"about_ca_topic_score_gemma":0.002014791,"teacher_disagreement_score":0.004285165,"about_ca_system_score_codex":0.000720414,"about_ca_system_score_gemma":0.00069853285,"threshold_uncertainty_score":0.022662401},"labels":[],"label_agreement":null},{"id":"W2095333339","doi":"10.1109/ccece.2008.4564513","title":"An architecture exploration framework for DSP applications","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digital signal processing; Computer science; Design space exploration; Computer architecture; System on a chip; Speedup; Embedded system; Architecture; Frame (networking); Electronic system-level design and verification; Design methods; Computer engineering; Computer hardware; Parallel computing; Engineering","score_opus":0.0233007341320795,"score_gpt":0.22653351228494012,"score_spread":0.20323277815286062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095333339","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018930015,0.00044685826,0.991915,0.00012587104,0.000016332173,0.00009613253,0.00007168477,0.00088660984,0.0045484924],"genre_scores_gemma":[0.04126583,0.00078568107,0.95239484,0.00006227073,0.000027006241,0.0004501504,0.0002917545,0.00020836738,0.004514036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958044,0.00013487831,0.000027923228,0.000052928164,0.00016453203,0.000039284252],"domain_scores_gemma":[0.9997838,0.00010329988,0.000017342032,0.000030450994,0.000047861886,0.000017152945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261079,0.001006099,0.0004785636,0.00079226465,0.00069576007,0.0015018878,0.0014261161,0.00089867454,0.0067145885],"category_scores_gemma":[0.0014120102,0.0004776207,0.0012665511,0.00083404337,0.00071632763,0.0014925601,0.0012387112,0.0013836134,0.0013616534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064432534,0.00009012594,0.0005164727,0.0005342597,0.00006002526,0.000462541,0.00063206756,0.24971716,0.009583705,0.46499798,0.008185775,0.2651556],"study_design_scores_gemma":[0.000038956092,0.00006212984,0.00018551835,0.00014799279,0.000033230597,0.0003552665,0.00011798181,0.7487333,0.0030012443,0.15965934,0.08763777,0.000027332764],"about_ca_topic_score_codex":0.0028127707,"about_ca_topic_score_gemma":0.004796644,"teacher_disagreement_score":0.0067145885,"about_ca_system_score_codex":0.000672557,"about_ca_system_score_gemma":0.0012826353,"threshold_uncertainty_score":0.022462487},"labels":[],"label_agreement":null},{"id":"W2095377095","doi":"10.1007/s10710-005-7617-y","title":"A New Approach for Predicting the Final Outcome of Evolution Strategy Optimization Under Noise","year":2005,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Differential evolution; Noise (video); Constant (computer programming); Outcome (game theory); Quadratic equation; Fitness function; Range (aeronautics); Mathematical optimization; Function (biology); Quadratic function; Applied mathematics; Mathematics; Algorithm; Artificial intelligence; Machine learning; Genetic algorithm; Mathematical economics","score_opus":0.02830246072266629,"score_gpt":0.2700299575110928,"score_spread":0.24172749678842653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095377095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02952776,0.0001375826,0.96862227,0.0001265679,0.0000431184,0.000028991812,0.00003087328,0.00024868766,0.0012341983],"genre_scores_gemma":[0.7294063,0.0002674395,0.26646045,0.00016572725,0.00009960183,0.00019956104,0.00014991169,0.00015485681,0.0030961884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996381,0.00008825131,0.000017907178,0.00008452547,0.00013550534,0.000035705994],"domain_scores_gemma":[0.99844676,0.000990228,0.00017427323,0.00009032057,0.00023944408,0.000059004607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011918797,0.0008749923,0.0011255103,0.0009907051,0.00040609878,0.001012044,0.0013134317,0.0017722727,0.0009223963],"category_scores_gemma":[0.005645666,0.000465004,0.0004808751,0.0006345178,0.0010929831,0.001518229,0.0009163635,0.0012221186,0.00020551695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005178207,0.000041741405,0.0017839337,0.000037507893,0.00006357591,0.000052390664,0.00004081598,0.95226026,0.0032648891,0.011882139,0.00036692753,0.030154085],"study_design_scores_gemma":[0.0000020715754,0.0000065860277,0.000060202117,0.0000013389339,0.000002631216,0.000003923257,9.844033e-7,0.9979165,0.00018639886,0.001769804,0.000047088266,0.00000235806],"about_ca_topic_score_codex":0.0024981971,"about_ca_topic_score_gemma":0.0019513718,"teacher_disagreement_score":0.0024981971,"about_ca_system_score_codex":0.0006668116,"about_ca_system_score_gemma":0.00065154297,"threshold_uncertainty_score":0.00630337},"labels":[],"label_agreement":null},{"id":"W2096347398","doi":"10.1145/1276958.1277275","title":"Solving the artificial ant on the Santa Fe trail problem in 20,696 fitness evaluations","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Subroutine; Computer science; Genetic algorithm; Mathematical optimization; Ant colony optimization algorithms; Ant colony; Artificial intelligence; Mathematics; Machine learning; Programming language","score_opus":0.04826897940238829,"score_gpt":0.31094135366282327,"score_spread":0.262672374260435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096347398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9203779,0.0005015375,0.06076142,0.0003401774,0.00004955037,0.00008737486,0.00016509138,0.00032848923,0.017388353],"genre_scores_gemma":[0.92442167,0.00012587944,0.06988552,0.000055327957,0.000013687878,0.0001099325,0.00030921467,0.000094418894,0.004984325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995408,0.0001785354,0.000021234393,0.000046027453,0.0001346808,0.00007878158],"domain_scores_gemma":[0.9985092,0.001124506,0.000078054916,0.000077968914,0.0001629739,0.0000472927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012641768,0.00056706567,0.00065128657,0.000509066,0.00066689454,0.00070695987,0.0005335013,0.00097181316,0.0036643005],"category_scores_gemma":[0.004256741,0.00019055263,0.0004077412,0.00067190797,0.0005001201,0.0006510929,0.00040808864,0.00051535264,0.00038362553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033688982,0.00023508498,0.005149285,0.0001188867,0.0000633031,0.00021795368,0.00013698949,0.882516,0.0017441274,0.006631019,0.00178221,0.101068236],"study_design_scores_gemma":[0.0001732501,0.0002625874,0.0030110907,0.00002170656,0.00005412481,0.00009092078,0.00012698928,0.9824059,0.0023813795,0.009200117,0.0022583655,0.000013559842],"about_ca_topic_score_codex":0.004692937,"about_ca_topic_score_gemma":0.0103593385,"teacher_disagreement_score":0.004692937,"about_ca_system_score_codex":0.0007998293,"about_ca_system_score_gemma":0.0011089282,"threshold_uncertainty_score":0.012258351},"labels":[],"label_agreement":null},{"id":"W2097055892","doi":"10.1145/2576768.2598211","title":"Passive solar building design using genetic programming","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solar gain; Computer science; Passive solar building design; Window (computing); Energy consumption; Architectural engineering; Building design; Roof; Genetic algorithm; Cooling load; Ranging; Simulation; Solar energy; Mechanical engineering; Engineering; Civil engineering; Operating system; Electrical engineering; Telecommunications","score_opus":0.026683607272708583,"score_gpt":0.2615564645842622,"score_spread":0.2348728573115536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097055892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047865253,0.0001232222,0.9419374,0.000117845266,0.000027625823,0.00009561384,0.00006145263,0.0003828086,0.0093887495],"genre_scores_gemma":[0.5208123,0.00025634514,0.47225815,0.000092794166,0.000015408574,0.00040223775,0.00014214382,0.00012514467,0.005895545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998166,0.000050507766,0.0000070826604,0.000030422383,0.00007328155,0.000022217579],"domain_scores_gemma":[0.99975616,0.00013056549,0.000027616825,0.0000151612285,0.00005993318,0.0000105720765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004434562,0.0006470584,0.00043526053,0.0005749755,0.00025744838,0.000714125,0.0006571534,0.0006634257,0.002188969],"category_scores_gemma":[0.0008642101,0.00038445203,0.0006892367,0.0004775788,0.00041169598,0.0003589903,0.0004059724,0.0003914745,0.0002484297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010139617,0.000016492128,0.00020486154,0.000024106806,0.000007779431,0.000021677935,0.00001596514,0.98273414,0.0020875311,0.0027382502,0.00015204573,0.011987055],"study_design_scores_gemma":[0.000008529046,0.000022496883,0.000058791407,0.0000048554143,0.0000070206083,0.00001009738,0.0000065150953,0.9962196,0.00096120615,0.0019283609,0.00076935155,0.0000032479295],"about_ca_topic_score_codex":0.0024889223,"about_ca_topic_score_gemma":0.0026040273,"teacher_disagreement_score":0.0024889223,"about_ca_system_score_codex":0.0005474331,"about_ca_system_score_gemma":0.0006904375,"threshold_uncertainty_score":0.007322848},"labels":[],"label_agreement":null},{"id":"W2097695714","doi":"10.1109/isscs.2007.4292680","title":"Multiplierless Evolutionary Filter Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Infinite impulse response; Adder; Computer science; Evolvable hardware; 2D Filters; Network topology; Evolutionary algorithm; Digital filter; Filter (signal processing); Genetic algorithm; Field-programmable gate array; Finite impulse response; Algorithm; Computer hardware; Artificial intelligence","score_opus":0.027229640049426258,"score_gpt":0.25887742703841227,"score_spread":0.231647786988986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097695714","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014149538,0.00026514943,0.9792594,0.00010787385,0.000043578868,0.00003145673,0.000025545354,0.00022689665,0.0058905156],"genre_scores_gemma":[0.3992085,0.0004639379,0.58619636,0.00016152275,0.000046566798,0.00019205225,0.0000816746,0.00004938904,0.013599927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999856,0.00002854049,0.000006516745,0.000034862584,0.000059628095,0.000014397724],"domain_scores_gemma":[0.99987864,0.000043400047,0.000016133972,0.000016821406,0.00003971753,0.000005324912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026832367,0.00030555975,0.00025142397,0.00034384863,0.00026424238,0.0005074271,0.00048350397,0.00056484505,0.0024422293],"category_scores_gemma":[0.000650894,0.00016724369,0.00027573117,0.00028677724,0.00028308955,0.00035702952,0.0002559342,0.0003425252,0.0005094053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012324947,0.000049096183,0.0008533729,0.00015573211,0.000091351685,0.00017874052,0.00010968811,0.35295022,0.08431562,0.1290351,0.0019196991,0.43021807],"study_design_scores_gemma":[0.000048890302,0.00016561411,0.00043227233,0.000024352623,0.00003394376,0.00026730457,0.0000118835615,0.93352634,0.0250276,0.019505488,0.020936567,0.000019671354],"about_ca_topic_score_codex":0.0004415127,"about_ca_topic_score_gemma":0.0006705205,"teacher_disagreement_score":0.0024422293,"about_ca_system_score_codex":0.00034391668,"about_ca_system_score_gemma":0.00036192875,"threshold_uncertainty_score":0.008170128},"labels":[],"label_agreement":null},{"id":"W2098316496","doi":"10.1109/csac.2005.23","title":"Evolving Successful Stack Overflow Attacks for Vulnerability Testing","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Exploit; Computer science; Vulnerability (computing); Focus (optics); Stack (abstract data type); Buffer overflow; Process (computing); Call stack; Variety (cybernetics); Distributed computing; Computer security; Operating system; Artificial intelligence","score_opus":0.025714270869447026,"score_gpt":0.27970787398639063,"score_spread":0.25399360311694363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098316496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6530881,0.0004304545,0.33835047,0.00054817804,0.000043457225,0.00020780442,0.00018531433,0.0009051741,0.0062411022],"genre_scores_gemma":[0.8760356,0.00021219748,0.121454686,0.00007995555,0.00001538403,0.00019724242,0.00031072655,0.00013457963,0.0015597357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989183,0.00038052653,0.000052696643,0.00014074084,0.00033472315,0.000173],"domain_scores_gemma":[0.9970553,0.0018839657,0.00028659034,0.00025108023,0.00035861292,0.00016455851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017049058,0.0011662847,0.0008893344,0.0015761947,0.00054073444,0.0010320751,0.0014401808,0.0013403383,0.001846525],"category_scores_gemma":[0.01030051,0.0005302254,0.0007877639,0.00060862734,0.0012849977,0.0015110939,0.0017901635,0.0009525796,0.00031885167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094691604,0.0001370317,0.009787342,0.00007814968,0.00007203778,0.00024097934,0.00020737355,0.9170338,0.007187682,0.010224953,0.00062314345,0.054312803],"study_design_scores_gemma":[0.000010104961,0.000058439015,0.0004455861,0.000010954634,0.000017118953,0.000033378205,0.000043165575,0.9930352,0.0019834323,0.003905983,0.00044999275,0.0000066647185],"about_ca_topic_score_codex":0.0023305237,"about_ca_topic_score_gemma":0.0021350281,"teacher_disagreement_score":0.0023305237,"about_ca_system_score_codex":0.0011403104,"about_ca_system_score_gemma":0.0010826626,"threshold_uncertainty_score":0.009016514},"labels":[],"label_agreement":null},{"id":"W2098879935","doi":"10.1007/978-1-4419-7747-2_3","title":"The Rubik Cube and GP Temporal Sequence Learning: An Initial Study","year":2010,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Cube (algebra); Sequence (biology); Computer science; Artificial intelligence; Mathematics; Combinatorics; Chemistry","score_opus":0.026318604988066065,"score_gpt":0.2756210176767801,"score_spread":0.24930241268871403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098879935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0343993,0.066655934,0.6878736,0.0072654407,0.0005859199,0.0001229017,0.00041903925,0.0004204026,0.20225747],"genre_scores_gemma":[0.46396142,0.07953587,0.37599075,0.0015625698,0.0013228516,0.00029762008,0.00062466477,0.00039408778,0.07631019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997161,0.000094926996,0.000012227947,0.000047474114,0.0001081721,0.0000209829],"domain_scores_gemma":[0.9986015,0.0010524453,0.000023938288,0.00011437768,0.00018180792,0.000025995772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009235483,0.00038938978,0.00060161285,0.00057855336,0.00038554205,0.0016930125,0.00095865474,0.0009581439,0.0063260794],"category_scores_gemma":[0.005470862,0.00031195398,0.00043701957,0.0023497147,0.0012815362,0.0036953117,0.0010960115,0.0024053014,0.0011167891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007963272,0.000037729256,0.00038071565,0.0002525019,0.000018371366,0.000091615715,0.0001564431,0.04001836,0.0007367026,0.61113805,0.009012919,0.33807692],"study_design_scores_gemma":[0.000014437995,0.000062604224,0.00045224626,0.00014377161,0.000015370646,0.000215686,0.000106078194,0.27446625,0.0013078433,0.66359836,0.05959688,0.000020472562],"about_ca_topic_score_codex":0.0061822315,"about_ca_topic_score_gemma":0.0036683136,"teacher_disagreement_score":0.0063260794,"about_ca_system_score_codex":0.0011133505,"about_ca_system_score_gemma":0.0009923347,"threshold_uncertainty_score":0.021162868},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; 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)","score_opus":0.010072496811260363,"score_gpt":0.24811495840420747,"score_spread":0.23804246159294712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100208842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035468478,0.001157216,0.93796307,0.0008154675,0.0002834864,0.000075812364,0.00012157859,0.0028557202,0.021259107],"genre_scores_gemma":[0.2442312,0.0011813196,0.7431207,0.0003067545,0.000069291156,0.00023436738,0.00026031063,0.0005523256,0.010043864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999775,0.00006482175,0.0000105057,0.000028986706,0.00009748294,0.000023225992],"domain_scores_gemma":[0.99972016,0.00010949576,0.000016530457,0.00005195271,0.0000806094,0.000021292655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033859687,0.00033762679,0.0004028405,0.00038173434,0.00041375548,0.0008030441,0.0009223436,0.0006969403,0.0039535514],"category_scores_gemma":[0.0013385377,0.00026711327,0.00048617937,0.000730511,0.00058830535,0.00045548152,0.0005903083,0.0014021051,0.0008585921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012825002,0.000094867966,0.0014299433,0.00024297167,0.00009716633,0.0003401828,0.00024197917,0.4967374,0.03707523,0.20541424,0.015506027,0.24269176],"study_design_scores_gemma":[0.00003557092,0.000036910733,0.00033664564,0.00002913557,0.000015687152,0.00009069841,0.000024759413,0.91757053,0.005397921,0.052094676,0.024353331,0.00001422611],"about_ca_topic_score_codex":0.0028319692,"about_ca_topic_score_gemma":0.0035076695,"teacher_disagreement_score":0.0039535514,"about_ca_system_score_codex":0.0007648949,"about_ca_system_score_gemma":0.0006806763,"threshold_uncertainty_score":0.013225913},"labels":[],"label_agreement":null},{"id":"W2101709153","doi":"10.1109/icsmc.1998.728123","title":"A new technique for reinforcement learning for control","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Ball (mathematics); Control theory (sociology); Swing; Piecewise; Task (project management); Inverted pendulum; Control (management); Artificial intelligence; Nonlinear system; Mathematics; Engineering","score_opus":0.01849185421854255,"score_gpt":0.24957618969214648,"score_spread":0.23108433547360394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101709153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005329063,0.00023026888,0.9958467,0.00015733462,0.000103501894,0.000024810479,0.000009301321,0.00014208835,0.0029531561],"genre_scores_gemma":[0.2813173,0.0013840789,0.697959,0.0007571667,0.00052723027,0.0006394379,0.000074593605,0.00021488233,0.017126357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993205,0.00019276295,0.00003740246,0.00015308837,0.00025487598,0.000041304207],"domain_scores_gemma":[0.9994837,0.00029006475,0.000042187574,0.000079018384,0.00007598689,0.000029005605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034278,0.0010301969,0.0008725521,0.00043760295,0.000519976,0.0008168673,0.0014073866,0.0011568784,0.005198575],"category_scores_gemma":[0.002421544,0.00039714025,0.00085927674,0.00047589763,0.0016601376,0.0014043695,0.0014404936,0.0031577311,0.0011839478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012126449,0.000114131006,0.00029669385,0.000389871,0.0001428402,0.000173448,0.00023172345,0.24498427,0.010643264,0.4947752,0.0062475656,0.24187975],"study_design_scores_gemma":[0.00009133053,0.00020008876,0.00009465975,0.00006323728,0.00004380837,0.00016398626,0.000019043404,0.77759033,0.0036241536,0.18646158,0.031617645,0.000030102938],"about_ca_topic_score_codex":0.0012611581,"about_ca_topic_score_gemma":0.0011122237,"teacher_disagreement_score":0.005198575,"about_ca_system_score_codex":0.0006937112,"about_ca_system_score_gemma":0.000568142,"threshold_uncertainty_score":0.017390966},"labels":[],"label_agreement":null},{"id":"W2101804758","doi":"10.1145/1276958.1277058","title":"Pareto-coevolutionary genetic programming for problem decomposition in multi-class classification","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Genetic programming; Computer science; Population; Artificial intelligence; Classifier (UML); Pareto principle; Machine learning; Computation; Overhead (engineering); Pareto optimal; Bidding; Evolutionary computation; Class (philosophy); Mathematical optimization; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.03475190511847994,"score_gpt":0.3155368064473615,"score_spread":0.28078490132888156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101804758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012866207,0.00025832315,0.9845293,0.00016650674,0.00002641004,0.00006404333,0.000010802614,0.00014015324,0.0019381869],"genre_scores_gemma":[0.34262362,0.0003574936,0.6520411,0.00030323834,0.00006357822,0.00051853777,0.000104011386,0.00010364076,0.0038848408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990596,0.00042625942,0.0000333898,0.00009546629,0.00029887597,0.00008636183],"domain_scores_gemma":[0.9987797,0.0007536876,0.00007370173,0.00009673046,0.00022364997,0.000072562754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445181,0.00091874355,0.001058202,0.0009904824,0.0006052955,0.0010276649,0.0019010847,0.0015502047,0.0016325962],"category_scores_gemma":[0.004568379,0.00045385948,0.0007295141,0.0012149082,0.0010955088,0.00091302075,0.0014865177,0.0017550772,0.00037704041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037717276,0.000115374474,0.00077289453,0.000051223098,0.00006310519,0.000062375344,0.0001071044,0.8550062,0.0016550424,0.022534698,0.0011277737,0.1184664],"study_design_scores_gemma":[0.000006318441,0.000016882777,0.000053358825,0.000004989583,0.0000047693734,0.000011628276,0.000008351709,0.9942472,0.0002561165,0.0050530974,0.0003344016,0.0000029319601],"about_ca_topic_score_codex":0.0039557754,"about_ca_topic_score_gemma":0.003777211,"teacher_disagreement_score":0.0039557754,"about_ca_system_score_codex":0.0010668469,"about_ca_system_score_gemma":0.0012093327,"threshold_uncertainty_score":0.012931466},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018192874081714584,"score_gpt":0.23260940997893226,"score_spread":0.21441653589721768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102391083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06059536,0.00043620417,0.9020472,0.0018767213,0.00013639053,0.00007387275,0.000046722977,0.00023039784,0.034557],"genre_scores_gemma":[0.9380302,0.00037605778,0.049900163,0.00026486287,0.000078920464,0.00014224948,0.000046031353,0.000099225115,0.011062355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966395,0.000095979885,0.00000828889,0.000037268735,0.00015502938,0.000039416977],"domain_scores_gemma":[0.99954814,0.00021209402,0.00003071195,0.00008188128,0.00009590463,0.000031212883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062438933,0.0002260101,0.00044839,0.00026423836,0.00055779313,0.0009212646,0.0010213912,0.0010268096,0.0043741846],"category_scores_gemma":[0.002397065,0.00024624553,0.0003121917,0.00025221918,0.0009365135,0.0014138697,0.0007165478,0.0008844635,0.0005377931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050299008,0.00002716219,0.00034753678,0.000047536432,0.000016042299,0.00023217351,0.00010853164,0.31137392,0.008002007,0.66821134,0.0023601826,0.009223343],"study_design_scores_gemma":[0.000008258869,0.000010384026,0.000061067505,0.0000033745575,0.0000017087568,0.00003951273,0.00000839368,0.9559726,0.00035707452,0.04183356,0.0017010006,0.0000030986712],"about_ca_topic_score_codex":0.0012295897,"about_ca_topic_score_gemma":0.0009386131,"teacher_disagreement_score":0.0043741846,"about_ca_system_score_codex":0.0010972264,"about_ca_system_score_gemma":0.0006314676,"threshold_uncertainty_score":0.0146330595},"labels":[],"label_agreement":null},{"id":"W2105746865","doi":"10.1145/1570256.1570409","title":"Statistical analysis for evolutionary computation","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Government of Canada; University of Guelph","funders":"","keywords":"Computer science; Evolutionary computation; Human-based evolutionary computation; Computation; Interactive evolutionary computation; Evolutionary programming; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.017024873417838354,"score_gpt":0.2923516767246442,"score_spread":0.2753268033068058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105746865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006895328,0.0005543905,0.99718577,0.00019959304,0.00008681852,0.000034581317,0.00011903262,0.00053449767,0.00059576426],"genre_scores_gemma":[0.10539777,0.0011390506,0.8843075,0.00053046143,0.00078387023,0.0011215014,0.0012593389,0.0013214201,0.0041391216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9832897,0.011343489,0.00077740295,0.0019206901,0.002241077,0.00042760323],"domain_scores_gemma":[0.92582583,0.05848224,0.002136759,0.009081749,0.0039048665,0.00056859915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015155192,0.001494446,0.0030470176,0.0034633712,0.0012804242,0.003612881,0.0027388795,0.0020762319,0.010806474],"category_scores_gemma":[0.09068943,0.00091397564,0.0027762717,0.0041205506,0.0030743466,0.0026168558,0.0023039267,0.005638662,0.0036242139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018249199,0.00013640335,0.0028279405,0.0005422815,0.00057350105,0.0002534489,0.00020918938,0.043645743,0.001934315,0.65780014,0.015562503,0.2763321],"study_design_scores_gemma":[0.00004452557,0.00007655884,0.0015144144,0.00009516179,0.00010466368,0.00020196091,0.000042857202,0.24707775,0.0010963756,0.7341678,0.015540604,0.000037318456],"about_ca_topic_score_codex":0.0020560788,"about_ca_topic_score_gemma":0.0014424078,"teacher_disagreement_score":0.015155192,"about_ca_system_score_codex":0.0014871618,"about_ca_system_score_gemma":0.0034550203,"threshold_uncertainty_score":0.08014929},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Artificial intelligence; Machine learning; Computer science; Genetic programming; Population; Classifier (UML); Support vector machine","score_opus":0.011802766465999207,"score_gpt":0.21245482052258552,"score_spread":0.20065205405658632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105802878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08218851,0.00008484735,0.9127691,0.00039042125,0.000023599669,0.00015778272,0.00001821069,0.00019407422,0.004173449],"genre_scores_gemma":[0.71802753,0.00011373229,0.27850774,0.00016355254,0.000024743187,0.0004729775,0.000059951508,0.00004867005,0.0025810238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867624,0.0006387684,0.00006000265,0.00017716724,0.00028576975,0.00016206433],"domain_scores_gemma":[0.9976954,0.0012802185,0.0002399105,0.0002272142,0.0003526049,0.00020466417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003694181,0.00081108767,0.0010173426,0.00069302233,0.0006902211,0.0017999876,0.0025392578,0.001362245,0.001607485],"category_scores_gemma":[0.0058239345,0.0005104474,0.0006976417,0.0006807379,0.0013301844,0.0012333093,0.0029661253,0.0014744757,0.00030554316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044747216,0.000115572155,0.0014847141,0.000035141486,0.000053480322,0.00009235444,0.00023273015,0.9473448,0.0011419161,0.017297164,0.00043307393,0.031724412],"study_design_scores_gemma":[0.000011696939,0.00002510097,0.000060931783,0.000003268946,0.000005533801,0.000010906479,0.000032411463,0.99236333,0.00016912183,0.0070550884,0.00025912002,0.0000034285292],"about_ca_topic_score_codex":0.0035608285,"about_ca_topic_score_gemma":0.0026849906,"teacher_disagreement_score":0.003694181,"about_ca_system_score_codex":0.0010582358,"about_ca_system_score_gemma":0.0017396401,"threshold_uncertainty_score":0.019536912},"labels":[],"label_agreement":null},{"id":"W2106804910","doi":"10.1109/cicybs.2011.5949387","title":"Exploring the state space of an application protocol: A case study of SMTP","year":2011,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Protocol (science); Computer science; Payload (computing); Neighbor Discovery Protocol; Internet protocol suite; Reverse Address Resolution Protocol; Process (computing); Simple (philosophy); Resource Reservation Protocol; The Internet; State (computer science); Computer network; Server; Internet Protocol; Distributed computing; Network packet; World Wide Web; Operating system","score_opus":0.1279647109716423,"score_gpt":0.3103044317031506,"score_spread":0.18233972073150828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106804910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89488983,0.0003208809,0.09659136,0.0008147574,0.000019260548,0.00017631735,0.00013592964,0.00019470615,0.0068569453],"genre_scores_gemma":[0.9531518,0.0001837537,0.044798974,0.00004033743,0.00000953784,0.00010049129,0.000086752836,0.000030723,0.0015976358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861825,0.0008952532,0.000036798185,0.00011186531,0.0002318743,0.00010592366],"domain_scores_gemma":[0.992191,0.0067766123,0.00022638016,0.0003762428,0.0002718822,0.00015787176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019273958,0.00045806373,0.0004187917,0.0006297832,0.0011929002,0.0011704905,0.0013561706,0.0021383823,0.0015183534],"category_scores_gemma":[0.007238227,0.00025256426,0.00065925193,0.00084299897,0.0016573124,0.0016338247,0.001115181,0.0012887396,0.00011286408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004287264,0.0010664614,0.016919918,0.00044545345,0.00018204267,0.007379693,0.0035430836,0.8585748,0.011198645,0.05428818,0.0015030277,0.044469945],"study_design_scores_gemma":[0.00007628597,0.0004672969,0.0025080172,0.000030511786,0.000057363224,0.0008576854,0.0015327337,0.96367234,0.00558516,0.021379799,0.003799733,0.00003309715],"about_ca_topic_score_codex":0.004424984,"about_ca_topic_score_gemma":0.005673022,"teacher_disagreement_score":0.004424984,"about_ca_system_score_codex":0.0008038369,"about_ca_system_score_gemma":0.0007364215,"threshold_uncertainty_score":0.0101931095},"labels":[],"label_agreement":null},{"id":"W2107854615","doi":"10.1109/wescan.1997.627163","title":"Design of a parallel genetic algorithm for the Internet","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Unix; Genetic algorithm; Asynchronous communication; Parallel computing; Parallel algorithm; Ideal (ethics); Population; The Internet; Fault tolerance; Distributed computing; Algorithm; Computer network; Operating system","score_opus":0.03952380449017121,"score_gpt":0.2441717524855651,"score_spread":0.2046479479953939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107854615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012230339,0.00011143594,0.9815881,0.00016384492,0.00005264489,0.000081663056,0.000017602644,0.00046849597,0.0052859504],"genre_scores_gemma":[0.19350022,0.00023778781,0.8022414,0.000106164414,0.00003684783,0.0002860546,0.00006253213,0.00010058751,0.0034284727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997632,0.000054629574,0.000010726479,0.000052145057,0.0000879185,0.000031338714],"domain_scores_gemma":[0.99977785,0.00006698786,0.000021390828,0.0000244985,0.00009384798,0.000015571824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056505186,0.0003813459,0.0005434844,0.00060550234,0.0006497242,0.0006530088,0.00099897,0.0007933737,0.0022011057],"category_scores_gemma":[0.0010111777,0.00028274,0.00039562062,0.00051130593,0.00051660306,0.0005697387,0.0004239353,0.00058131467,0.0005064573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009108072,0.00010221765,0.0009603134,0.00007226714,0.000041734045,0.000120648525,0.00007352933,0.8000587,0.010017489,0.038555745,0.0019707903,0.14793546],"study_design_scores_gemma":[0.000033048207,0.000030331285,0.000075603886,0.000006320982,0.000013749465,0.000041767205,0.000014461463,0.9868934,0.001985539,0.0069361757,0.003963188,0.0000064082883],"about_ca_topic_score_codex":0.0030700965,"about_ca_topic_score_gemma":0.002635919,"teacher_disagreement_score":0.0030700965,"about_ca_system_score_codex":0.0007973771,"about_ca_system_score_gemma":0.001442802,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017164744051282526,"score_gpt":0.2353421798431268,"score_spread":0.2181774357918443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108346947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02049441,0.0007364465,0.9719507,0.00022368947,0.000075055104,0.000048053083,0.00003216384,0.00048629238,0.005953161],"genre_scores_gemma":[0.6390866,0.001256305,0.34414613,0.00034720806,0.0001591324,0.00041960547,0.00021977337,0.00026193625,0.014103364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992803,0.00033335583,0.000025615782,0.00010629077,0.00019674299,0.00005771653],"domain_scores_gemma":[0.99901116,0.0006992215,0.00007000402,0.00007975664,0.00010401136,0.00003581827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011022699,0.00048398678,0.00082879834,0.0006374035,0.0003615892,0.0010771577,0.0010164164,0.0012189309,0.002154443],"category_scores_gemma":[0.0040996196,0.0003797864,0.0005236519,0.0013824609,0.0011564002,0.0012952781,0.0008543236,0.001208773,0.0005799261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096220974,0.00006609028,0.0004942063,0.00009668568,0.000045085995,0.0001761097,0.00014533354,0.7729333,0.0026795634,0.10548008,0.002035399,0.11575189],"study_design_scores_gemma":[0.000032555043,0.00007464571,0.00015314159,0.000016365959,0.000020911171,0.00007467077,0.000010870311,0.93983656,0.0011335997,0.05609564,0.0025326032,0.000018498622],"about_ca_topic_score_codex":0.0015497347,"about_ca_topic_score_gemma":0.0010842945,"teacher_disagreement_score":0.002154443,"about_ca_system_score_codex":0.0009346321,"about_ca_system_score_gemma":0.00056556077,"threshold_uncertainty_score":0.007207334},"labels":[],"label_agreement":null},{"id":"W2108587684","doi":"10.1109/icsmc.2007.4414009","title":"Multi-objective competitive coevolution for efficient GP classifier problem decomposition","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Scalability; Genetic programming; Classifier (UML); Artificial intelligence; Pareto principle; Machine learning; Binary classification; Theoretical computer science; Mathematical optimization; Mathematics; Support vector machine","score_opus":0.016706957161604398,"score_gpt":0.291026138436937,"score_spread":0.27431918127533256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108587684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013409927,0.00012144784,0.98403454,0.00015633328,0.000018365106,0.000040711133,0.000011092474,0.00015971373,0.002047751],"genre_scores_gemma":[0.38644275,0.00022745143,0.6094721,0.00020016832,0.000050188377,0.00040663968,0.00013438935,0.00011126456,0.0029550144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929523,0.0002939532,0.000032306016,0.00009079312,0.00021022277,0.0000774328],"domain_scores_gemma":[0.9985391,0.0009617771,0.00007020374,0.00011737936,0.000260947,0.00005059625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019555246,0.00077904825,0.0010908283,0.000713319,0.00042831007,0.0010203006,0.0012499071,0.0013970421,0.001482853],"category_scores_gemma":[0.005804271,0.00040411073,0.0005559871,0.0010270297,0.00079745083,0.00081703544,0.0013846324,0.0016050731,0.00036318734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030972144,0.000046452635,0.00043965856,0.000049711798,0.0000344609,0.00008140532,0.000104905994,0.8862105,0.0031570822,0.024918875,0.0012817511,0.083644226],"study_design_scores_gemma":[0.0000026005143,0.0000049763185,0.000021197884,0.0000015995289,0.0000017449938,0.0000069744056,0.000004211899,0.9974541,0.00018687463,0.002095654,0.00021888255,0.0000011006996],"about_ca_topic_score_codex":0.003316181,"about_ca_topic_score_gemma":0.0028222087,"teacher_disagreement_score":0.003316181,"about_ca_system_score_codex":0.0008528904,"about_ca_system_score_gemma":0.0011130617,"threshold_uncertainty_score":0.010341942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008114385425783906,"score_gpt":0.22177405956695617,"score_spread":0.21365967414117226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108679901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018009072,0.00018534537,0.9764781,0.00011518116,0.00007578378,0.000058125606,0.00003957039,0.00019307491,0.004845645],"genre_scores_gemma":[0.82506937,0.00041636176,0.16585995,0.00014295126,0.00004427562,0.00041391648,0.00013099269,0.000089743044,0.0078325495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939644,0.00018278747,0.000036788493,0.00009338114,0.0002453274,0.000045208177],"domain_scores_gemma":[0.9987425,0.00080113177,0.00017476796,0.00009275131,0.00014717583,0.000041694806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009631118,0.00063064724,0.0008849727,0.00048589724,0.00025093067,0.0008338956,0.0013268415,0.0011213735,0.0016555705],"category_scores_gemma":[0.003609321,0.0003024245,0.00080302655,0.00039765373,0.0006080852,0.00092896976,0.0007198255,0.001312222,0.00044158578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000553187,0.00003909951,0.00047961177,0.00007801053,0.00003359703,0.000095790194,0.000044446137,0.9536355,0.0046182307,0.023359347,0.00031112574,0.017249852],"study_design_scores_gemma":[0.0000066347757,0.00003752624,0.000044764478,0.0000033930062,0.0000047910153,0.000028861326,0.00000193134,0.99709713,0.00046139053,0.0017478031,0.00055952696,0.000006207625],"about_ca_topic_score_codex":0.0011804574,"about_ca_topic_score_gemma":0.00078720675,"teacher_disagreement_score":0.0016555705,"about_ca_system_score_codex":0.0005319587,"about_ca_system_score_gemma":0.00040194477,"threshold_uncertainty_score":0.0055384636},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018625969444637635,"score_gpt":0.2539693013165884,"score_spread":0.23534333187195078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109042184","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023823243,0.00043079836,0.98863715,0.00023829115,0.0003491354,0.000040154075,0.00014799419,0.002335109,0.0054390077],"genre_scores_gemma":[0.062999964,0.0008201968,0.91904277,0.0003572684,0.00021357826,0.00032868487,0.0006222032,0.0015312491,0.014084154],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992841,0.00018701781,0.00004331897,0.0001224687,0.0003162109,0.00004698877],"domain_scores_gemma":[0.9985128,0.0008170241,0.00005063585,0.0003565949,0.00018933772,0.00007358162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085570454,0.00077868864,0.0008282572,0.0006351912,0.0004620723,0.0012553451,0.0016970339,0.0012965068,0.011678878],"category_scores_gemma":[0.0061154207,0.0005869805,0.000835632,0.0007794578,0.00048865506,0.0019184037,0.0029143475,0.002876017,0.003268633],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002151483,0.00010544736,0.0007247392,0.0006058744,0.00013688028,0.00037834683,0.00017594374,0.17590691,0.010162307,0.17163038,0.027071057,0.6128869],"study_design_scores_gemma":[0.00014975,0.00007254439,0.00039509262,0.0001203678,0.000054437176,0.00047304973,0.00003385404,0.62317383,0.010755453,0.21689506,0.14782955,0.000046957866],"about_ca_topic_score_codex":0.00038051885,"about_ca_topic_score_gemma":0.00040020476,"teacher_disagreement_score":0.011678878,"about_ca_system_score_codex":0.00023006099,"about_ca_system_score_gemma":0.00040713043,"threshold_uncertainty_score":0.039069712},"labels":[],"label_agreement":null},{"id":"W2109589711","doi":"10.1145/2457450.2457453","title":"Identity verification based on handwritten signatures with haptic information using genetic programming","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Computer science; Naive Bayes classifier; Support vector machine; Artificial intelligence; Haptic technology; Identity (music); Pattern recognition (psychology); Signature (topology); Genetic programming; Random forest; Machine learning; Relevance (law); Data mining; Mathematics","score_opus":0.016167222480621513,"score_gpt":0.2584575447652899,"score_spread":0.2422903222846684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109589711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09216789,0.00013836077,0.90510803,0.00016591043,0.000031762396,0.000080258185,0.00004557753,0.00078077463,0.0014815115],"genre_scores_gemma":[0.7542989,0.00009628656,0.24351329,0.00009087471,0.000019287676,0.000082117964,0.00011486973,0.000060394046,0.0017240082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986859,0.00028237986,0.00006302392,0.00024834243,0.0006009162,0.00011955986],"domain_scores_gemma":[0.99686986,0.0017023198,0.0005116587,0.0003016565,0.0005541306,0.000060288105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013474354,0.0005603718,0.0009983035,0.0010611643,0.00043131152,0.0011291767,0.0010180658,0.0009514613,0.0011062887],"category_scores_gemma":[0.0060974406,0.00024788265,0.0007135118,0.00089864165,0.0007114585,0.0011686622,0.00078001287,0.0007832786,0.00035682466],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035635504,0.00015226434,0.0038670502,0.00011493231,0.00006268309,0.0002685454,0.00016812171,0.49341822,0.020786593,0.006388265,0.0007138712,0.47370312],"study_design_scores_gemma":[0.0000042562315,0.000036322577,0.00036175674,0.000005901662,0.0000070891642,0.00005203351,0.000015511354,0.9934963,0.004327981,0.0015224942,0.00016284146,0.000007455009],"about_ca_topic_score_codex":0.0035035782,"about_ca_topic_score_gemma":0.001933741,"teacher_disagreement_score":0.0035035782,"about_ca_system_score_codex":0.0007409486,"about_ca_system_score_gemma":0.0010301066,"threshold_uncertainty_score":0.0071260333},"labels":[],"label_agreement":null},{"id":"W2109892450","doi":"10.1007/s11047-007-9038-8","title":"Repeated patterns in genetic programming","year":2007,"lang":"en","type":"article","venue":"Natural Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; University of Essex","keywords":"Genetic programming; Computer science; Crossover; Shuffling; Tree (set theory); Binary tree; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Programming language; Combinatorics","score_opus":0.00966252290649453,"score_gpt":0.264951589042624,"score_spread":0.25528906613612945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109892450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0829298,0.0022428003,0.8860911,0.0014068667,0.00029923202,0.000053339674,0.00004094042,0.00022863736,0.026707165],"genre_scores_gemma":[0.7196604,0.001306016,0.25683948,0.0003978124,0.0002836445,0.00018589837,0.00009175085,0.00022445233,0.021010516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907756,0.0004401944,0.000040153245,0.00016065894,0.00022692069,0.000054549386],"domain_scores_gemma":[0.9969699,0.0021224888,0.00017749565,0.00042462713,0.00021528528,0.000090336405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010580452,0.00027755872,0.0005918248,0.000652731,0.00060483674,0.0012726494,0.0012277523,0.0014470821,0.003617412],"category_scores_gemma":[0.009708064,0.0004135049,0.00047917338,0.0014508408,0.0024983115,0.0027409457,0.001271221,0.001992594,0.00045823096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037020436,0.000033440778,0.00079033634,0.00008327025,0.000034419743,0.00018253336,0.00038033424,0.047298178,0.0009273553,0.884747,0.0012466054,0.0642394],"study_design_scores_gemma":[0.000010857256,0.000017413597,0.00013332223,0.000015908363,0.000010109474,0.00009688685,0.00003605491,0.06597924,0.00029645508,0.93091697,0.002479486,0.0000072153025],"about_ca_topic_score_codex":0.0012317725,"about_ca_topic_score_gemma":0.0011573402,"teacher_disagreement_score":0.003617412,"about_ca_system_score_codex":0.00063309737,"about_ca_system_score_gemma":0.00041391427,"threshold_uncertainty_score":0.012101412},"labels":[],"label_agreement":null},{"id":"W2111445724","doi":"10.1145/1569901.1569998","title":"Evolution, development and learning using self-modifying cartesian genetic programming","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Computer science; Genetic representation; Cartesian coordinate system; Genetic algorithm; Artificial intelligence; Grammatical evolution; Theoretical computer science; Machine learning; Mathematics","score_opus":0.01476979695304872,"score_gpt":0.24390354257004793,"score_spread":0.2291337456169992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111445724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09517774,0.0005886012,0.89250803,0.0005351841,0.00003855086,0.000043450676,0.000016997135,0.00020423396,0.010887255],"genre_scores_gemma":[0.6597181,0.000741143,0.33286282,0.000102458376,0.00002375039,0.0000878651,0.000039382252,0.000041956864,0.0063825026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975806,0.00010104878,0.000011184436,0.00004850233,0.00006399439,0.000017214577],"domain_scores_gemma":[0.9995814,0.00023034864,0.00005079224,0.000059103044,0.000057433313,0.000020946647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059321575,0.00023547548,0.00026750602,0.00022099035,0.00020184324,0.0006741436,0.0004949619,0.0005467039,0.0008137402],"category_scores_gemma":[0.001793086,0.00018631938,0.0003676011,0.00030327772,0.001510686,0.00078064896,0.00067200814,0.0006349667,0.00013383616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006379546,0.00003963508,0.0023058134,0.00013530483,0.000048939943,0.00024588176,0.0008642868,0.29371196,0.014377092,0.5975555,0.0008235387,0.089828275],"study_design_scores_gemma":[0.000044867007,0.00016716923,0.0009339525,0.00003843422,0.000033770993,0.00038696767,0.00011062633,0.6996707,0.006351755,0.28107187,0.01116258,0.000027398393],"about_ca_topic_score_codex":0.0007361678,"about_ca_topic_score_gemma":0.0005308861,"teacher_disagreement_score":0.0008137402,"about_ca_system_score_codex":0.0002996135,"about_ca_system_score_gemma":0.00033314628,"threshold_uncertainty_score":0.0031372309},"labels":[],"label_agreement":null},{"id":"W2113586204","doi":"10.1109/cec.2003.1299773","title":"Trying to evolve sorting networks in echo","year":2004,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Sorting; Computer science; Echo (communications protocol); Sorting network; Sorting algorithm; Theoretical computer science; Artificial intelligence; Imperfect; Algorithm; Computer network","score_opus":0.012929472259194972,"score_gpt":0.25186690850910604,"score_spread":0.23893743624991107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113586204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30728608,0.00015531557,0.67689234,0.0009197261,0.00008304751,0.000058926296,0.000041678977,0.0006432598,0.013919564],"genre_scores_gemma":[0.68588966,0.00019962741,0.30230922,0.0005104835,0.000016621781,0.00011387386,0.00007805625,0.00018161206,0.010700854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973756,0.000085958825,0.000012801251,0.000056494962,0.00007134247,0.000035874615],"domain_scores_gemma":[0.99885213,0.00060432276,0.00007509576,0.00026640826,0.00013523438,0.000066710134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011620362,0.00028059087,0.0003626874,0.00027824097,0.00064254005,0.0010168444,0.00082602777,0.0009726857,0.0025904186],"category_scores_gemma":[0.0041862535,0.00031195665,0.00038841087,0.00022024236,0.0010311052,0.0026716157,0.0014218112,0.0012768187,0.00044347942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020291875,0.00020620762,0.0053148665,0.00015255882,0.00014722484,0.0002813124,0.0011263038,0.5962485,0.02300061,0.24763273,0.0019545264,0.12373217],"study_design_scores_gemma":[0.00006346434,0.0002171525,0.00037037968,0.000029274206,0.00006342767,0.00015549053,0.00021215816,0.8841506,0.018279256,0.08498312,0.011437633,0.000037950897],"about_ca_topic_score_codex":0.0011664156,"about_ca_topic_score_gemma":0.0019365592,"teacher_disagreement_score":0.0025904186,"about_ca_system_score_codex":0.00047090923,"about_ca_system_score_gemma":0.0004429209,"threshold_uncertainty_score":0.0086658},"labels":[],"label_agreement":null},{"id":"W2116890140","doi":"10.1109/icsmc.1997.637345","title":"What is a symbolic measurement process?","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Representation (politics); Computer science; Process (computing); Mathematical structure; Theoretical computer science; Transformation (genetics); Object (grammar); Mathematical theory; Data structure; Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.04217037402033936,"score_gpt":0.2523656937088336,"score_spread":0.21019531968849425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116890140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021040117,0.009718627,0.76700926,0.04490545,0.0019982827,0.00018017797,0.0005200999,0.0006451947,0.15398279],"genre_scores_gemma":[0.7347773,0.009045285,0.21864979,0.004678298,0.0017908923,0.0005992922,0.00051963836,0.0003829878,0.029556483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962437,0.0015795804,0.00020601974,0.0007292737,0.0009570958,0.00028432894],"domain_scores_gemma":[0.99446636,0.0029521973,0.00061315566,0.00095550454,0.00075078633,0.00026200642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004368409,0.00068603805,0.0010065262,0.0020689839,0.0022054024,0.008104234,0.0012987353,0.0033335038,0.0078423275],"category_scores_gemma":[0.017275209,0.00044029995,0.0011029395,0.0024225,0.017896354,0.017117467,0.0026368732,0.003060692,0.0019544845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007714727,0.00000612911,0.00020177072,0.00004861283,0.000007718715,0.000033388238,0.00053077994,0.00062373996,0.0001329037,0.9904193,0.0008596503,0.007128179],"study_design_scores_gemma":[0.0000048820566,0.000010789685,0.00013791487,0.00005594255,0.0000064776177,0.00006259924,0.00027084097,0.0031540713,0.0002306327,0.9787506,0.01729902,0.000016167232],"about_ca_topic_score_codex":0.002764664,"about_ca_topic_score_gemma":0.0011983823,"teacher_disagreement_score":0.008104234,"about_ca_system_score_codex":0.0029441016,"about_ca_system_score_gemma":0.002537354,"threshold_uncertainty_score":0.026235223},"labels":[],"label_agreement":null},{"id":"W2117021925","doi":"10.1371/journal.pone.0078401","title":"A Solution to the Challenge of Optimization on ''Golf-Course''-Like Fitness Landscapes","year":2013,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"National Institutes of Health; Fundação Cearense de Apoio ao Desenvolvimento Científico e Tecnológico; National Institute of General Medical Sciences; Financiadora de Estudos e Projetos; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Computer science; Fitness landscape; Task (project management); Genetic algorithm; Artificial intelligence; Machine learning; Optimization problem; Mathematical optimization; Algorithm; Mathematics; Engineering","score_opus":0.02946641124470764,"score_gpt":0.224545907203595,"score_spread":0.19507949595888735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117021925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03407062,0.0012684998,0.9476912,0.0061471555,0.00019799554,0.00003513657,0.000073516116,0.00020804683,0.01030784],"genre_scores_gemma":[0.4743654,0.002052506,0.5114177,0.0017396607,0.0003748561,0.00022368436,0.00020785004,0.00034010704,0.009278248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953306,0.0001753049,0.000017519951,0.00011591113,0.0001140449,0.00004425513],"domain_scores_gemma":[0.99840313,0.000956235,0.00013533045,0.00024728672,0.00018490777,0.00007301686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011788881,0.0005669541,0.0009256882,0.00046359617,0.00076551584,0.001623164,0.0012188102,0.0020871854,0.0032139642],"category_scores_gemma":[0.007002055,0.000351053,0.0006738793,0.000570621,0.0019951083,0.0021940814,0.0015799821,0.0025519426,0.00053398364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047962352,0.000060270882,0.0011512117,0.00020525554,0.00010174655,0.0001501633,0.00028990116,0.42086828,0.004383501,0.4695182,0.008767704,0.09445567],"study_design_scores_gemma":[0.00003778994,0.00007465039,0.0005448331,0.00005512738,0.000020064614,0.00015221012,0.00008441316,0.51322865,0.0009636908,0.46764904,0.01716363,0.000025928694],"about_ca_topic_score_codex":0.0013984725,"about_ca_topic_score_gemma":0.0012608934,"teacher_disagreement_score":0.0032139642,"about_ca_system_score_codex":0.0006069813,"about_ca_system_score_gemma":0.0010644317,"threshold_uncertainty_score":0.010751784},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020893965450406844,"score_gpt":0.2715984832799908,"score_spread":0.250704517829584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117847370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059227064,0.0004712865,0.92821217,0.0027980634,0.00022660519,0.0001147325,0.0001007949,0.0014847412,0.0073645585],"genre_scores_gemma":[0.45076045,0.00075247104,0.5427303,0.0013874182,0.00029559666,0.0005743079,0.00033591824,0.000209128,0.0029544418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993773,0.00025720242,0.000028868375,0.000099202174,0.0002063367,0.000031190026],"domain_scores_gemma":[0.9975688,0.0016635129,0.000086684806,0.0004183036,0.00022681129,0.000035904934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012032698,0.00042320462,0.00063651294,0.00045883044,0.00031105502,0.0007077317,0.0009156635,0.00073920225,0.0013410144],"category_scores_gemma":[0.0061150757,0.00021558776,0.00042383,0.0013327943,0.0004667226,0.0010013536,0.0008622565,0.0012211197,0.0008164949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009701408,0.00009085694,0.0011522131,0.00010367386,0.000060011324,0.00023682733,0.00009472329,0.46882296,0.007426899,0.025712483,0.011094191,0.48510823],"study_design_scores_gemma":[0.000019958923,0.000034214947,0.00021943483,0.0000062327995,0.000005017584,0.000068226036,0.000013140387,0.97846895,0.0010243591,0.017354025,0.0027811106,0.000005300605],"about_ca_topic_score_codex":0.0013939774,"about_ca_topic_score_gemma":0.0021066575,"teacher_disagreement_score":0.0013939774,"about_ca_system_score_codex":0.0005805657,"about_ca_system_score_gemma":0.00038069932,"threshold_uncertainty_score":0.0063635707},"labels":[],"label_agreement":null},{"id":"W2118318258","doi":"10.1109/have.2008.4685299","title":"Generation of rule-based adaptive strategies for a collaborative virtual simulation environment","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Adaptability; Artificial intelligence; Machine learning; Classifier (UML); Learning classifier system; Adaptive learning; Unsupervised learning","score_opus":0.06547255662013188,"score_gpt":0.26850567696205707,"score_spread":0.2030331203419252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118318258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30649552,0.000052543324,0.6866785,0.00016769854,0.000040161383,0.00034866604,0.00006192498,0.0012515318,0.004903453],"genre_scores_gemma":[0.85037506,0.000031026895,0.14779754,0.00004075834,0.000005559474,0.00023378921,0.000076856624,0.00005835012,0.0013811248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995278,0.0001640818,0.000034544988,0.00009287081,0.00012860628,0.0000521471],"domain_scores_gemma":[0.9983583,0.0009418548,0.00014005345,0.00019925322,0.00023119511,0.00012924816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012437026,0.00058965996,0.00043714582,0.0005112194,0.00025281627,0.0007788976,0.00121374,0.00068886764,0.0013927096],"category_scores_gemma":[0.0049850834,0.00031587778,0.00033602555,0.00020191041,0.00063661,0.00058611704,0.000870598,0.000581742,0.00025176245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001902063,0.00035561915,0.0042699254,0.00006198489,0.00007214248,0.0002672883,0.00046564435,0.8699524,0.0145811625,0.011660843,0.0007944435,0.09732841],"study_design_scores_gemma":[0.00001191071,0.000065224645,0.00020326769,0.0000034020254,0.0000052375076,0.000019040195,0.000019147028,0.9957075,0.001998247,0.0016005527,0.0003614659,0.000005025193],"about_ca_topic_score_codex":0.0017696746,"about_ca_topic_score_gemma":0.0015234714,"teacher_disagreement_score":0.0017696746,"about_ca_system_score_codex":0.00058002234,"about_ca_system_score_gemma":0.0006194595,"threshold_uncertainty_score":0.0065773726},"labels":[],"label_agreement":null},{"id":"W2119632600","doi":"10.1504/ijdmb.2011.040388","title":"Combining multiple perspective as intelligent agents into robust approach for biomarker detection in gene expression data","year":2011,"lang":"en","type":"article","venue":"International Journal of Data Mining and Bioinformatics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Perspective (graphical); Gene; Gene expression; Biomarker; Computer science; Computational biology; Expression (computer science); microRNA; Data mining; Biology; Artificial intelligence; Genetics","score_opus":0.15965036198780436,"score_gpt":0.336622064281259,"score_spread":0.17697170229345466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119632600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017730134,0.00033922965,0.98071367,0.00019522314,0.000021275782,0.000039800132,0.000022836948,0.00015847012,0.000779461],"genre_scores_gemma":[0.44819325,0.0003613713,0.5496056,0.0001474534,0.00006474879,0.00013194187,0.00011799017,0.00004503684,0.0013326305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974299,0.0010805001,0.00015294483,0.00047713786,0.00071801245,0.00014142696],"domain_scores_gemma":[0.9972101,0.0015210371,0.00047621864,0.00026771193,0.00039810222,0.00012680913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036725071,0.0011809438,0.0014213292,0.001292674,0.00053804996,0.0020267766,0.0014879297,0.0012153855,0.0009410146],"category_scores_gemma":[0.0063004135,0.00053105317,0.001427984,0.0010603322,0.00093042117,0.002002161,0.0019030917,0.0011367677,0.0002177673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004165865,0.00022259675,0.008367579,0.00037141392,0.0007628634,0.0005879054,0.00047544332,0.67912924,0.01897564,0.051246446,0.0009327946,0.23851143],"study_design_scores_gemma":[0.000016503056,0.00010071482,0.0004702723,0.000010193277,0.00008672701,0.00006332286,0.00003930089,0.98605806,0.0023138819,0.009810519,0.0010138226,0.00001660596],"about_ca_topic_score_codex":0.0013657432,"about_ca_topic_score_gemma":0.0018741542,"teacher_disagreement_score":0.0036725071,"about_ca_system_score_codex":0.0008634284,"about_ca_system_score_gemma":0.0009445988,"threshold_uncertainty_score":0.019422352},"labels":[],"label_agreement":null},{"id":"W2119775079","doi":"10.2991/978-94-6239-030-0_15","title":"Probabilistic Evolutionary Procedure Learning","year":2014,"lang":"en","type":"book-chapter","venue":"Atlantis thinking machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pyrogenesis (Canada)","funders":"","keywords":"Computer science; Probabilistic logic; Evolutionary algorithm; Artificial intelligence; Software deployment; Component (thermodynamics); Evolutionary programming; Machine learning; Software engineering","score_opus":0.009575638731693061,"score_gpt":0.22264749788082505,"score_spread":0.213071859149132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119775079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016073448,0.0002809783,0.98812604,0.0002566917,0.00004962514,0.000033271754,0.000045001696,0.00041062312,0.009190393],"genre_scores_gemma":[0.14945324,0.00090020377,0.81890553,0.00037552608,0.00017944355,0.00029028035,0.0004613727,0.00038225017,0.029052218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00022031898,0.000026390806,0.0001329357,0.00022969405,0.00003983308],"domain_scores_gemma":[0.99903166,0.0005463875,0.000043198143,0.00019927089,0.00013732977,0.000042158357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012912129,0.0004927114,0.0005701453,0.00076077896,0.00040986505,0.0012020866,0.0016638134,0.0011355462,0.009934852],"category_scores_gemma":[0.004444133,0.0003311902,0.00067790225,0.0010784699,0.00081148656,0.0013395675,0.0014177347,0.0016038938,0.0022644978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003037249,0.00007016194,0.0007324735,0.00011139055,0.000067765366,0.00007683584,0.000087315784,0.16125476,0.0020263647,0.3004655,0.012916236,0.52216077],"study_design_scores_gemma":[0.000007856399,0.000027613441,0.00025463803,0.000023663126,0.000012929526,0.000117519114,0.000009581195,0.88664716,0.0010841376,0.09189582,0.019905796,0.000013228771],"about_ca_topic_score_codex":0.0009902937,"about_ca_topic_score_gemma":0.001777651,"teacher_disagreement_score":0.009934852,"about_ca_system_score_codex":0.0006532288,"about_ca_system_score_gemma":0.00083461654,"threshold_uncertainty_score":0.03323537},"labels":[],"label_agreement":null},{"id":"W2121489891","doi":"10.1109/cec.2008.4630863","title":"Automatic modeling of a novel gene expression programming based on statistical analysis and critical velocity","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gene expression programming; Computer science; Statistic; Convergence (economics); Artificial neural network; Set (abstract data type); Artificial intelligence; Population; Genetic programming; Machine learning; Function (biology); Data mining; Evolutionary algorithm; Algorithm; Mathematics; Statistics","score_opus":0.033254297425453154,"score_gpt":0.29304871374498,"score_spread":0.2597944163195268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121489891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038166968,0.000040508778,0.9950873,0.000035980254,0.000010553216,0.000014301397,0.000016897864,0.00011738373,0.00086042046],"genre_scores_gemma":[0.3693351,0.0004163676,0.62395644,0.000101070844,0.000034409277,0.00047209612,0.00015294638,0.00013536014,0.005396319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981827,0.000036917005,0.0000088838815,0.000053356693,0.000062253705,0.000020390404],"domain_scores_gemma":[0.9997603,0.00013452678,0.000026746025,0.000017027192,0.00005163555,0.000009826222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041956108,0.0005183166,0.00043427557,0.00046799358,0.00027956814,0.0005944026,0.0010480233,0.00051156577,0.0011250173],"category_scores_gemma":[0.0009454577,0.00027439083,0.0006124533,0.0005142336,0.00054249563,0.00073753326,0.00042455381,0.00084818056,0.00024058232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024014314,0.000028364213,0.0007458048,0.000077856035,0.000023772618,0.000101224156,0.0000649028,0.87961024,0.014408018,0.06156398,0.000683959,0.042667918],"study_design_scores_gemma":[0.000002527309,0.000008954749,0.000059016755,0.0000022798217,0.0000034293507,0.00002190808,0.0000021012117,0.9943416,0.0012621576,0.0036310707,0.0006615711,0.0000033725344],"about_ca_topic_score_codex":0.0023373675,"about_ca_topic_score_gemma":0.0018199049,"teacher_disagreement_score":0.0023373675,"about_ca_system_score_codex":0.0005689475,"about_ca_system_score_gemma":0.0009554502,"threshold_uncertainty_score":0.004647553},"labels":[],"label_agreement":null},{"id":"W2123092006","doi":"10.1007/978-3-540-78671-9_16","title":"A Comparison of Cartesian Genetic Programming and Linear Genetic Programming","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Verafin (Canada); Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Computer science; Directed acyclic graph; Graph; Linear programming; Implementation; Directed graph; Symbolic regression; Genetic algorithm; Theoretical computer science; Cartesian coordinate system; Benchmark (surveying); Algorithm; Artificial intelligence; Programming language; Mathematics; Machine learning","score_opus":0.021446460331969376,"score_gpt":0.2759214630943454,"score_spread":0.254475002762376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123092006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1287514,0.00877548,0.7724427,0.0014372076,0.00033447432,0.00010344628,0.00013437467,0.0012544367,0.08676645],"genre_scores_gemma":[0.5986072,0.003742554,0.38831142,0.00020112481,0.000107446765,0.00007785538,0.00019329316,0.00031214373,0.008446983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988017,0.0006149545,0.000029194185,0.0001021922,0.00038439332,0.000067678135],"domain_scores_gemma":[0.99661416,0.0025996629,0.00009941591,0.00023061519,0.0003974051,0.000058728434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017873793,0.00037444616,0.00066599646,0.0006505914,0.00030722274,0.0015606255,0.0008313943,0.0006721254,0.005190385],"category_scores_gemma":[0.007982411,0.00018476113,0.00026848924,0.0017475786,0.0010155921,0.0015063665,0.00095743395,0.00064227893,0.00042942964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005929642,0.00013218081,0.0023133887,0.000554656,0.0000778207,0.00006145731,0.00038850657,0.26590046,0.0018591873,0.32096,0.0037555287,0.40340376],"study_design_scores_gemma":[0.00008331431,0.00039004922,0.0018561444,0.00011967814,0.00007537345,0.00017301149,0.0002271159,0.8606319,0.0014324137,0.12353508,0.011449872,0.000026080854],"about_ca_topic_score_codex":0.004432431,"about_ca_topic_score_gemma":0.00427645,"teacher_disagreement_score":0.005190385,"about_ca_system_score_codex":0.0009882296,"about_ca_system_score_gemma":0.0013001547,"threshold_uncertainty_score":0.017363548},"labels":[],"label_agreement":null},{"id":"W2123251383","doi":"10.1162/evco.2007.15.2.199","title":"Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database","year":2007,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genetic programming; Computer science; Graph; Graph database; Theoretical computer science; Artificial intelligence","score_opus":0.03178961716159892,"score_gpt":0.33922122399863697,"score_spread":0.3074316068370381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123251383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16370095,0.00022760089,0.8292408,0.00044393653,0.000047777175,0.00009744071,0.00007788241,0.0014319818,0.0047316616],"genre_scores_gemma":[0.59800404,0.00031242278,0.39846066,0.00014999748,0.00001994663,0.00018847155,0.00022367724,0.00028141565,0.00235939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898726,0.0004390924,0.000047933478,0.0001869157,0.000253594,0.00008523596],"domain_scores_gemma":[0.9970861,0.0018898455,0.00013124745,0.00051200506,0.0002899347,0.00009094081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017421716,0.00046286115,0.0007523843,0.00064624177,0.00041535753,0.0014503235,0.0014605618,0.00094012974,0.0026350403],"category_scores_gemma":[0.0083801085,0.00031942155,0.0004381003,0.0011541827,0.0010258455,0.0031602927,0.0016171032,0.0011373981,0.00044627712],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018889245,0.00019689454,0.0039650444,0.000115038754,0.000047000754,0.0002044987,0.00025245527,0.6167067,0.0068522533,0.10303244,0.0017835597,0.26665527],"study_design_scores_gemma":[0.000035690686,0.00008604168,0.00044510452,0.000010834824,0.00003468536,0.00008239576,0.00008658528,0.9372287,0.004432701,0.0555523,0.0019892443,0.000015731192],"about_ca_topic_score_codex":0.004017024,"about_ca_topic_score_gemma":0.004009758,"teacher_disagreement_score":0.004017024,"about_ca_system_score_codex":0.00085091393,"about_ca_system_score_gemma":0.0014500356,"threshold_uncertainty_score":0.009213567},"labels":[],"label_agreement":null},{"id":"W2123884785","doi":"10.1109/cec.2011.5949704","title":"Financial control of the evolution of autonomous non-player characters","year":2011,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Adversary; Movement (music); Population; Control (management); Function (biology); Autonomous agent; Controller (irrigation); Object (grammar); Stochastic game; Multi-agent system; Artificial intelligence; Computer security; Microeconomics; Economics; Biology","score_opus":0.009353082662482448,"score_gpt":0.19447645235728936,"score_spread":0.18512336969480692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123884785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5096738,0.00060145685,0.43877652,0.0010676318,0.00019032849,0.00023428582,0.000074643394,0.00056151726,0.048819818],"genre_scores_gemma":[0.96885407,0.00010336466,0.024551777,0.00006827584,0.000014356586,0.00008490026,0.000028420947,0.000033568125,0.006261255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934167,0.0002816922,0.00003156664,0.00008876908,0.00018083418,0.00007544907],"domain_scores_gemma":[0.9971637,0.0016883146,0.0004313368,0.00019194452,0.00029250854,0.00023207221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014593217,0.00052698894,0.0003233101,0.00036374712,0.00047708102,0.0013656983,0.0012142684,0.0005908999,0.0041641556],"category_scores_gemma":[0.008316172,0.0001976671,0.00019673374,0.00025868107,0.00096041826,0.0010752907,0.00080813444,0.000619779,0.00030832985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005300255,0.00032914837,0.0069508087,0.00020611481,0.000103434664,0.0006196777,0.00073167,0.6425506,0.03464411,0.16166694,0.001897138,0.14977029],"study_design_scores_gemma":[0.000091751885,0.00017967452,0.0011855308,0.000012389954,0.000019095152,0.00016399087,0.000089742854,0.96156174,0.006814277,0.024956303,0.0049020303,0.000023511417],"about_ca_topic_score_codex":0.0019003429,"about_ca_topic_score_gemma":0.0013939808,"teacher_disagreement_score":0.0041641556,"about_ca_system_score_codex":0.0009156774,"about_ca_system_score_gemma":0.000625274,"threshold_uncertainty_score":0.0139305},"labels":[],"label_agreement":null},{"id":"W2123885828","doi":"10.1109/icsmc.2007.4413999","title":"One-class learning with multi-objective genetic programming","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"One-class classification; Artificial intelligence; Support vector machine; Computer science; Classifier (UML); Novelty detection; Machine learning; Genetic programming; Class (philosophy); Pattern recognition (psychology); Binary classification; Multiclass classification; Novelty; Data mining","score_opus":0.016123292718468817,"score_gpt":0.2533175292702368,"score_spread":0.237194236551768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123885828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019474715,0.00012684932,0.9777724,0.0002248935,0.00002511093,0.000057653855,0.000020939371,0.00027282094,0.002024557],"genre_scores_gemma":[0.39526632,0.00015053102,0.60140085,0.000236554,0.000050954815,0.00038423372,0.0001565193,0.00012288083,0.0022311509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911326,0.00040651983,0.000033607204,0.00017102045,0.00021562903,0.000059979004],"domain_scores_gemma":[0.9981918,0.0012623535,0.00014682894,0.00011386406,0.00022230722,0.0000628853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234422,0.0010230483,0.0012859355,0.0010523595,0.00054238684,0.0015767043,0.0018353594,0.0018668995,0.0012773168],"category_scores_gemma":[0.0043773525,0.0005139445,0.0010600005,0.0010003247,0.0009839695,0.0013047713,0.0013071066,0.0018211745,0.00029168636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039229388,0.00007711642,0.0005718189,0.000048960992,0.000059554925,0.000055085293,0.00008637386,0.89997256,0.0007643264,0.014349064,0.000610993,0.08336502],"study_design_scores_gemma":[0.0000038227145,0.00000806651,0.000029112547,0.0000029436944,0.0000028778356,0.0000061880537,0.0000044179974,0.9949018,0.00015499449,0.0047577852,0.00012537827,0.0000026471541],"about_ca_topic_score_codex":0.0028320125,"about_ca_topic_score_gemma":0.0022034675,"teacher_disagreement_score":0.0028320125,"about_ca_system_score_codex":0.0011673677,"about_ca_system_score_gemma":0.0008917086,"threshold_uncertainty_score":0.011816919},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.050630034897519015,"score_gpt":0.282061851503608,"score_spread":0.231431816606089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124875591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32000798,0.00017491222,0.67725736,0.00037603825,0.000021871878,0.0000666184,0.000067882655,0.00025229985,0.0017750614],"genre_scores_gemma":[0.8633141,0.00011404833,0.13589843,0.000038256894,0.000007788305,0.00006981242,0.000077395816,0.000025962305,0.00045412104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997236,0.00013597807,0.000013154225,0.00004934427,0.000058556656,0.00001938017],"domain_scores_gemma":[0.99690706,0.0024792883,0.00019050094,0.00015476337,0.00022959764,0.00003874065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015590955,0.0005870428,0.00046881184,0.00053680595,0.00024973584,0.0006895149,0.00077174726,0.0009413205,0.00044502792],"category_scores_gemma":[0.007893243,0.0002676239,0.00045592219,0.0005419871,0.0003360281,0.0008474543,0.00053974194,0.0008186089,0.000085965636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036048412,0.000050657396,0.0023678932,0.00003887469,0.000041124513,0.000030229245,0.000057038913,0.9611271,0.0016267287,0.002105852,0.000044954326,0.032473437],"study_design_scores_gemma":[0.0000029909443,0.000017956847,0.00026237583,0.000003048615,0.0000033901117,0.000008085653,0.000008842862,0.99810284,0.00079115236,0.00072478224,0.000070834954,0.0000037292937],"about_ca_topic_score_codex":0.005010313,"about_ca_topic_score_gemma":0.0031019344,"teacher_disagreement_score":0.005010313,"about_ca_system_score_codex":0.0004398079,"about_ca_system_score_gemma":0.0005816322,"threshold_uncertainty_score":0.009962261},"labels":[],"label_agreement":null},{"id":"W2125875816","doi":"10.5430/air.v1n1p1","title":"Two-Strategy reinforcement group cooperation based symbiotic evolution for TSK-type fuzzy controller design","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Crossover; Controller (irrigation); Set (abstract data type); Reinforcement; Computer science; Population; Fuzzy logic; SIGNAL (programming language); Reinforcement learning; Group (periodic table); Compensation (psychology); Control (management); Artificial intelligence; Base (topology); Engineering; Mathematics; Biology; Psychology","score_opus":0.2209426353081047,"score_gpt":0.4114545148173586,"score_spread":0.1905118795092539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125875816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023372112,0.00017425026,0.9720028,0.00007685068,0.000045900408,0.00007274917,0.000007944744,0.00019457421,0.0040526986],"genre_scores_gemma":[0.8546883,0.00015798573,0.14230974,0.000072432056,0.000021549578,0.00024086869,0.00002684204,0.000020615553,0.0024616907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996184,0.00007596214,0.00002497928,0.00007733355,0.00016749205,0.000035660094],"domain_scores_gemma":[0.9997807,0.00005731934,0.000035963516,0.000022954897,0.00008232288,0.00002066332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051995943,0.00058080675,0.00048112433,0.00031316918,0.00047645502,0.0005262059,0.0011047913,0.0007784316,0.0010501527],"category_scores_gemma":[0.00080296455,0.00016363063,0.00044687753,0.00026565572,0.0005157981,0.0003944252,0.00055838673,0.00046007714,0.00019640819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121048586,0.0001006338,0.001403968,0.00019142816,0.0001167475,0.00035518967,0.00036847297,0.735255,0.03690353,0.022575304,0.0009820509,0.2016266],"study_design_scores_gemma":[0.000025739355,0.000092165625,0.00015557896,0.00000630099,0.000012765574,0.00008207534,0.000013586472,0.994507,0.0023615041,0.0014987913,0.0012325216,0.000011969113],"about_ca_topic_score_codex":0.0027795976,"about_ca_topic_score_gemma":0.0019919854,"teacher_disagreement_score":0.0027795976,"about_ca_system_score_codex":0.0005327013,"about_ca_system_score_gemma":0.00071303867,"threshold_uncertainty_score":0.0055268407},"labels":[],"label_agreement":null},{"id":"W2126021476","doi":"10.1109/iecon.2000.972588","title":"Functional reconstruction of dynamical systems from time series using genetic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Saskatchewan","funders":"","keywords":"Genetic programming; Computer science; Series (stratigraphy); Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Biology","score_opus":0.018939920243612227,"score_gpt":0.20513082189985224,"score_spread":0.18619090165624003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126021476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02866647,0.000077860095,0.970235,0.00016040953,0.000011505457,0.000019897892,0.000013533541,0.00018724786,0.0006280808],"genre_scores_gemma":[0.52887386,0.000209529,0.4692675,0.00006216448,0.000023736236,0.00014914676,0.00010204434,0.0000987874,0.0012133237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976486,0.00009984174,0.000012400449,0.000054926968,0.0000494063,0.000018504476],"domain_scores_gemma":[0.9989525,0.000732094,0.0001223566,0.000052882107,0.000116605275,0.000023634017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010760403,0.0006393769,0.00057480234,0.0005904644,0.0002987031,0.0006256179,0.0005149858,0.00084407517,0.00063846353],"category_scores_gemma":[0.0039818976,0.0004325072,0.00063223724,0.00044626647,0.000756754,0.00070584903,0.0005144297,0.0010442844,0.00012600163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015172641,0.000012687158,0.00026941538,0.000018924879,0.000017549837,0.0000327127,0.000035638088,0.97459465,0.0014947195,0.006138612,0.00009085553,0.017279046],"study_design_scores_gemma":[0.0000018563483,0.0000036151257,0.000031676587,0.0000012362881,0.0000013924345,0.0000036950933,0.0000021060494,0.9972384,0.00026302732,0.0023942553,0.000056878278,0.0000019090346],"about_ca_topic_score_codex":0.003908024,"about_ca_topic_score_gemma":0.002390979,"teacher_disagreement_score":0.003908024,"about_ca_system_score_codex":0.0007642938,"about_ca_system_score_gemma":0.00072442595,"threshold_uncertainty_score":0.007770598},"labels":[],"label_agreement":null},{"id":"W2126223847","doi":"10.1109/mcte.2002.1175046","title":"Genetic circuit design from an electronics perspective","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Circuit design; Linear circuit; Capacitor; Computer science; Circuit extraction; Discrete circuit; Electronic circuit; Equivalent circuit; Electronic engineering; Electronics; Electronic circuit simulation; Network analysis; Mixed-signal integrated circuit; Electrical element; Amplifier; Electrical engineering; Engineering; CMOS; Voltage","score_opus":0.022492694881816874,"score_gpt":0.2517357935888396,"score_spread":0.2292430987070227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126223847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02915179,0.0025445004,0.9442916,0.0015197697,0.00017403874,0.000071248745,0.000075067954,0.00025090252,0.02192106],"genre_scores_gemma":[0.50598925,0.006748488,0.47334304,0.00063310686,0.00012454308,0.00030486687,0.00019021129,0.000105057174,0.012561384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998223,0.00005856534,0.000008509704,0.000034248904,0.000056450743,0.000019973724],"domain_scores_gemma":[0.99978477,0.00012634508,0.000021168496,0.00002541092,0.000031595457,0.0000107244805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032489645,0.000323095,0.00030416524,0.00048607143,0.00023560351,0.0008850279,0.00063920143,0.0008312573,0.0014250984],"category_scores_gemma":[0.0010761915,0.00021526692,0.00040718596,0.00040090678,0.0011970196,0.0006564391,0.00029071103,0.0006866467,0.00030317568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028831566,0.000029867477,0.0005517651,0.00021592063,0.00004134968,0.00018657546,0.00011458943,0.34254342,0.031589758,0.5721083,0.0007647226,0.051824834],"study_design_scores_gemma":[0.000036407735,0.00022570135,0.00051863113,0.00008912001,0.000054962347,0.0004893855,0.000097651035,0.48710722,0.02135862,0.4406129,0.049361467,0.00004790099],"about_ca_topic_score_codex":0.00064152275,"about_ca_topic_score_gemma":0.0005591428,"teacher_disagreement_score":0.0014250984,"about_ca_system_score_codex":0.00063625915,"about_ca_system_score_gemma":0.0004907746,"threshold_uncertainty_score":0.004767418},"labels":[],"label_agreement":null},{"id":"W2126509357","doi":"10.1109/iscas.2002.1010161","title":"Chaotic system reconstruction from noisy time series measurements using improved least squares genetic programming","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Chaotic; Clutter; Computer science; A priori and a posteriori; Noise (video); Series (stratigraphy); Radar; Algorithm; Genetic programming; Least-squares function approximation; Genetic algorithm; Time series; Gaussian noise; Artificial intelligence; Mathematics; Machine learning; Statistics; Telecommunications","score_opus":0.023543057637854945,"score_gpt":0.22061633885997103,"score_spread":0.1970732812221161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126509357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05419464,0.00005771585,0.9449324,0.00012920004,0.000008460625,0.000014005518,0.000010061577,0.0001766388,0.00047692956],"genre_scores_gemma":[0.54930204,0.00010292656,0.44945997,0.000061634586,0.000016935099,0.00008061666,0.00006529258,0.000049140126,0.0008613252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997352,0.000114436465,0.000011893082,0.000052093597,0.00006349552,0.000022810764],"domain_scores_gemma":[0.9988506,0.000824867,0.00011893358,0.00006218824,0.0001258742,0.000017543993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008983698,0.00050622586,0.0006551879,0.0003663314,0.00019957969,0.000446322,0.00058145175,0.00082440354,0.00031625867],"category_scores_gemma":[0.0036240022,0.00030462726,0.00042585537,0.00035689474,0.00058396015,0.0004897551,0.00038293953,0.00078420923,0.0000665489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032785014,0.000016913082,0.00041452763,0.000014064935,0.00002190885,0.000042934575,0.00004163755,0.96886706,0.0021261373,0.0029041069,0.00007732212,0.025440605],"study_design_scores_gemma":[0.0000036904642,0.000006127878,0.000041453633,9.666314e-7,0.0000021630085,0.0000054502216,0.00000211055,0.9986236,0.00046625573,0.0008069318,0.00003964937,0.0000015925192],"about_ca_topic_score_codex":0.0023129068,"about_ca_topic_score_gemma":0.0014637023,"teacher_disagreement_score":0.0023129068,"about_ca_system_score_codex":0.00039515606,"about_ca_system_score_gemma":0.0005497325,"threshold_uncertainty_score":0.004751146},"labels":[],"label_agreement":null},{"id":"W2127322981","doi":"10.1016/j.asoc.2012.08.046","title":"Review of phenotypic diversity formulations for diagnostic tool","year":2012,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Diversity (politics); Computer science; Computational biology; Biology; Sociology","score_opus":0.02365008938422352,"score_gpt":0.26270026346415615,"score_spread":0.23905017407993262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127322981","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032040493,0.4261465,0.547264,0.0031526084,0.0010889388,0.00007529509,0.00021744015,0.0002077434,0.018643443],"genre_scores_gemma":[0.16588727,0.35870263,0.45728755,0.0020577093,0.003226413,0.00036305457,0.00055350387,0.00040076306,0.011521098],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819785,0.00071430113,0.00019082584,0.00028780857,0.0005433106,0.00006582104],"domain_scores_gemma":[0.9967219,0.002410758,0.000173801,0.00019115269,0.00046238245,0.000039900304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026788204,0.0013875286,0.002040535,0.0032174673,0.0005002705,0.002352719,0.002669307,0.001600024,0.0027935156],"category_scores_gemma":[0.007035151,0.0005338964,0.0011606766,0.0038615912,0.0016994413,0.0022570258,0.0013828856,0.0019419611,0.00075841235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005110053,0.000060424496,0.00065244205,0.0035127047,0.00019646439,0.0002100365,0.00014769855,0.034441028,0.0024491032,0.31280565,0.01147761,0.6339957],"study_design_scores_gemma":[0.000039478786,0.00019955549,0.0015213942,0.0032910225,0.00031317605,0.0016846363,0.00019776118,0.16164799,0.0041041696,0.55551934,0.27132756,0.00015390174],"about_ca_topic_score_codex":0.0009404589,"about_ca_topic_score_gemma":0.00091865344,"teacher_disagreement_score":0.0032174673,"about_ca_system_score_codex":0.0014305856,"about_ca_system_score_gemma":0.00093696325,"threshold_uncertainty_score":0.01416713},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012722593608641882,"score_gpt":0.26132847081821237,"score_spread":0.24860587720957047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128670925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063793555,0.00010928065,0.93362325,0.00016588326,0.000021674443,0.00004337926,0.000021310369,0.00023571281,0.001986019],"genre_scores_gemma":[0.5735214,0.00022294892,0.42380482,0.00012399949,0.000022787483,0.00020277422,0.00009289161,0.000103487844,0.0019049782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997851,0.000049651033,0.000011718901,0.000052829713,0.000079914396,0.000020722397],"domain_scores_gemma":[0.9996164,0.00021999958,0.000055920118,0.000029921093,0.0000613461,0.00001636334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051070657,0.0005030739,0.00053361146,0.0006531249,0.0001938962,0.00073871855,0.00076474476,0.0006893261,0.0008090228],"category_scores_gemma":[0.0020906297,0.0002510417,0.00055902585,0.0004922966,0.00072425435,0.0007220773,0.00071626756,0.0007136719,0.00013972851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003970376,0.00005943529,0.0010436935,0.000049817336,0.000033777284,0.00017388491,0.00018483844,0.8674515,0.016386379,0.021183483,0.00045165623,0.09294186],"study_design_scores_gemma":[0.000007671678,0.00002601731,0.00012261863,0.0000049712003,0.000009331834,0.000039810868,0.000017114407,0.9912627,0.0018123093,0.0061253794,0.0005667357,0.000005411018],"about_ca_topic_score_codex":0.0011131655,"about_ca_topic_score_gemma":0.0008249867,"teacher_disagreement_score":0.0011131655,"about_ca_system_score_codex":0.00053289556,"about_ca_system_score_gemma":0.0003882293,"threshold_uncertainty_score":0.003866434},"labels":[],"label_agreement":null},{"id":"W2128780767","doi":"10.1007/978-1-4419-7747-2_10","title":"Symbolic Density Models of One-in-a-Billion Statistical Tails via Importance Sampling and Genetic Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Genetic programming; Sampling (signal processing); Computer science; Symbolic regression; Statistics; Econometrics; Mathematics; Artificial intelligence","score_opus":0.022841449790407496,"score_gpt":0.24486813069796118,"score_spread":0.22202668090755368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128780767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028432881,0.0009174772,0.95566505,0.0012319272,0.00014571456,0.000035378154,0.00013063998,0.0002789496,0.013161915],"genre_scores_gemma":[0.774788,0.0019101979,0.1881693,0.0006360574,0.0006515051,0.00034731597,0.00046655114,0.0006191677,0.032411948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944836,0.00026864442,0.000014453707,0.00005478154,0.00014718674,0.0000666883],"domain_scores_gemma":[0.9949184,0.004224394,0.00020883189,0.00022610644,0.00024562073,0.0001765597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015831988,0.0008587897,0.0018441209,0.0012572465,0.0009327254,0.0020424197,0.0028508352,0.0027486428,0.005087509],"category_scores_gemma":[0.0109244445,0.0009840309,0.0014145264,0.0014733017,0.0031325507,0.004027421,0.0016460709,0.0037688427,0.00062206894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015629008,0.000020166543,0.00025018625,0.000029501125,0.000016283897,0.00004734311,0.00006282616,0.43349525,0.00017166606,0.56020266,0.0013779708,0.0043105367],"study_design_scores_gemma":[0.00000316896,0.0000016273841,0.000028140232,0.000004062991,0.0000021935969,0.00000786519,0.000004872963,0.8475376,0.000026763395,0.15215993,0.00021913725,0.0000046054834],"about_ca_topic_score_codex":0.0068395236,"about_ca_topic_score_gemma":0.006515489,"teacher_disagreement_score":0.0068395236,"about_ca_system_score_codex":0.0021420023,"about_ca_system_score_gemma":0.0012848538,"threshold_uncertainty_score":0.017019391},"labels":[],"label_agreement":null},{"id":"W2129140651","doi":"10.1145/1569901.1570033","title":"Neutrality and variability","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Evolvability; Computer science; Exploit; Neutrality; Neutral network; Evolutionary biology; Artificial intelligence; Biology","score_opus":0.011607046838409841,"score_gpt":0.24984111687891367,"score_spread":0.23823407004050381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129140651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3869517,0.0037001823,0.4861343,0.0064222524,0.00039165624,0.00014239117,0.00029360788,0.00043531784,0.115528636],"genre_scores_gemma":[0.9823027,0.00047242656,0.013221724,0.00033586446,0.00019221328,0.00010946646,0.000058701175,0.00006188667,0.0032450845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970631,0.00096341013,0.00014308715,0.00075660803,0.000746353,0.00032743762],"domain_scores_gemma":[0.9916054,0.0053534554,0.000937321,0.0010743339,0.00061413646,0.00041542092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029793056,0.0005267386,0.0008220925,0.0010017644,0.0010548829,0.003338428,0.0010984617,0.0013642352,0.003647458],"category_scores_gemma":[0.015896916,0.00027835774,0.000823168,0.0006625067,0.0060441634,0.0040247464,0.0026503748,0.0020721536,0.0003862773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060308812,0.000023316847,0.003555783,0.00010022873,0.000092769296,0.0002834001,0.0006400193,0.024710625,0.0040160683,0.94116694,0.0005438048,0.024806632],"study_design_scores_gemma":[0.00002015192,0.0000678707,0.001620758,0.00002893906,0.000022770464,0.00044942723,0.00013613442,0.025909225,0.0011369722,0.96561396,0.004955094,0.000038709124],"about_ca_topic_score_codex":0.00045047593,"about_ca_topic_score_gemma":0.00017117936,"teacher_disagreement_score":0.003647458,"about_ca_system_score_codex":0.0011343894,"about_ca_system_score_gemma":0.0007235535,"threshold_uncertainty_score":0.01575625},"labels":[],"label_agreement":null},{"id":"W2130130539","doi":"10.1109/tsmcb.2008.927249","title":"Score-Based Resampling Method for Evolutionary Algorithms","year":2008,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Korea Institute of Industrial Technology","keywords":"Resampling; Chromosome; Evolutionary algorithm; Computer science; Fraction (chemistry); Algorithm; Realization (probability); Function (biology); Selection (genetic algorithm); Process (computing); Score; Artificial intelligence; Mathematical optimization; Mathematics; Machine learning; Gene; Statistics; Biology; Genetics","score_opus":0.04447657491174278,"score_gpt":0.2769372254744446,"score_spread":0.23246065056270182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130130539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026860612,0.000120958306,0.9965354,0.000045878336,0.000042565043,0.00004136912,0.000010455294,0.00015866604,0.00035862048],"genre_scores_gemma":[0.13408041,0.00021326811,0.8632622,0.000112034046,0.00013538705,0.00032994055,0.00016267749,0.000118873555,0.0015852378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739134,0.0011882923,0.00012294731,0.00029831173,0.0009236125,0.000075464086],"domain_scores_gemma":[0.99700516,0.0015332825,0.0002111499,0.00034512908,0.000821941,0.0000832211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034161669,0.0008833463,0.0011431283,0.0013964489,0.00056962605,0.0007879891,0.0015450596,0.0010789401,0.0014774224],"category_scores_gemma":[0.010869412,0.00027003136,0.0008595261,0.00089224573,0.00078196044,0.0009341131,0.0008048418,0.0011245314,0.0005362672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023728194,0.00018080274,0.0020269707,0.00024030115,0.00020972725,0.00019554881,0.00019912368,0.2999377,0.020200068,0.06541905,0.00345951,0.6076939],"study_design_scores_gemma":[0.000019881507,0.000079159196,0.00042975546,0.000010178224,0.0000221892,0.00009504051,0.00000955699,0.98669344,0.003605065,0.0062462124,0.0027660597,0.000023478031],"about_ca_topic_score_codex":0.0017764195,"about_ca_topic_score_gemma":0.0017804786,"teacher_disagreement_score":0.0034161669,"about_ca_system_score_codex":0.0005926012,"about_ca_system_score_gemma":0.0007344976,"threshold_uncertainty_score":0.018066645},"labels":[],"label_agreement":null},{"id":"W2130506830","doi":"10.1109/tai.1997.632230","title":"A generic tool for distributed AI with matching as message passing","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Inference; Inference engine; Genetic programming; Theoretical computer science; Message passing; Matching (statistics); Computation; Artificial intelligence; Programming language; Mathematics","score_opus":0.01602111604510606,"score_gpt":0.23923221527340724,"score_spread":0.22321109922830118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130506830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034316056,0.00008527059,0.99323905,0.00016004391,0.000100837606,0.000068427515,0.00007370868,0.0032011885,0.0027282804],"genre_scores_gemma":[0.032835398,0.0004508002,0.9535059,0.00044189123,0.00019908047,0.00054605375,0.000360488,0.0014252812,0.0102351755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867487,0.0002720884,0.00014293408,0.00031364348,0.0004616757,0.0001347764],"domain_scores_gemma":[0.9991542,0.00025393936,0.000062533094,0.00039189405,0.00007645015,0.000060975617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018198288,0.0010090331,0.0011818678,0.0015914872,0.0013849931,0.003528951,0.0043589147,0.002663921,0.01774953],"category_scores_gemma":[0.0036411814,0.0008808643,0.0021744643,0.0023707715,0.0026346168,0.005320415,0.003501468,0.0033894726,0.006590215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075605,0.000053374548,0.00014972487,0.00022535135,0.000051742052,0.0001948933,0.00026754345,0.011635747,0.0045666955,0.87694484,0.010693603,0.095140874],"study_design_scores_gemma":[0.00008138376,0.00007020351,0.00008363837,0.00010361296,0.000061530955,0.0004153516,0.000047566802,0.12728721,0.008573411,0.61539596,0.24783365,0.000046459958],"about_ca_topic_score_codex":0.0011750428,"about_ca_topic_score_gemma":0.00095161627,"teacher_disagreement_score":0.01774953,"about_ca_system_score_codex":0.0010340706,"about_ca_system_score_gemma":0.001285453,"threshold_uncertainty_score":0.059378028},"labels":[],"label_agreement":null},{"id":"W2132351374","doi":"10.1109/icsmc.2000.886606","title":"Page-based linear genetic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Crossover; Computer science; Genetic programming; Generality; Bottleneck; Genetic representation; Evolutionary computation; Overhead (engineering); Context (archaeology); Computation; Genetic algorithm; A priori and a posteriori; Theoretical computer science; Parallel computing; Algorithm; Programming language; Artificial intelligence; Machine learning","score_opus":0.023261568925511802,"score_gpt":0.23567850857716224,"score_spread":0.21241693965165043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132351374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004802596,0.00025164953,0.982547,0.00016657735,0.000050470833,0.000029783587,0.000045388046,0.0006722504,0.011434231],"genre_scores_gemma":[0.44132736,0.0008245442,0.5243605,0.0004813433,0.0001302757,0.0003661575,0.0004122365,0.00039692633,0.031700723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951136,0.00017798902,0.00001860953,0.000082522645,0.00016220374,0.000047328882],"domain_scores_gemma":[0.99937266,0.0003959691,0.000041830674,0.00006145469,0.00010524467,0.000022937804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000536306,0.00037666052,0.0006783492,0.000466534,0.0003384008,0.0013460431,0.0011896741,0.0009951773,0.006256737],"category_scores_gemma":[0.0024260634,0.00028250748,0.00047058257,0.00091751455,0.0008660722,0.0010708383,0.0010762176,0.0009946811,0.002004807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049746886,0.000036314537,0.00021598367,0.000079568264,0.000018851308,0.00006965502,0.000081173595,0.74581784,0.0017728118,0.12878373,0.0034473403,0.119626865],"study_design_scores_gemma":[0.000008119089,0.000032274125,0.00003967923,0.000009080471,0.0000062161644,0.000028496515,0.0000053089816,0.95204884,0.000689168,0.044011477,0.0031133348,0.000008076707],"about_ca_topic_score_codex":0.0015646941,"about_ca_topic_score_gemma":0.0018657419,"teacher_disagreement_score":0.006256737,"about_ca_system_score_codex":0.00068669283,"about_ca_system_score_gemma":0.00065804616,"threshold_uncertainty_score":0.020930827},"labels":[],"label_agreement":null},{"id":"W2132799405","doi":"10.1109/tcsi.2002.804545","title":"Design of piecewise maps for chaotic spread-spectrum communications using genetic programming","year":2002,"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":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Chaotic; Computer science; Piecewise; Genetic programming; Channel (broadcasting); Fitness function; Algorithm; Piecewise linear function; Spread spectrum; Genetic algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.05710074303601036,"score_gpt":0.265973811381937,"score_spread":0.20887306834592662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132799405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08719214,0.00029834107,0.9072109,0.0001831945,0.000041965224,0.00009039384,0.00003866106,0.0002558831,0.0046886723],"genre_scores_gemma":[0.7205089,0.00034062105,0.27541554,0.00008145923,0.000014927771,0.00021119429,0.00006880205,0.00007307058,0.003285542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979335,0.00006310188,0.000009451494,0.000040842315,0.00006338184,0.00002992565],"domain_scores_gemma":[0.9995659,0.00025143748,0.000059538863,0.000022891581,0.00007909802,0.000021033517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041891687,0.00071565615,0.00040892707,0.00062194536,0.00031095807,0.0005323904,0.0005064928,0.0006459545,0.0011187898],"category_scores_gemma":[0.001464168,0.00030216915,0.00054531015,0.00035774382,0.000598391,0.00043684195,0.0005622759,0.0006060853,0.0001785794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019828569,0.000021694965,0.0004616238,0.000057531477,0.000018977624,0.000083822044,0.00007903069,0.95864654,0.0066693407,0.009440599,0.00019325744,0.024307724],"study_design_scores_gemma":[0.000008178443,0.000054480097,0.000104362785,0.000009489539,0.000009224166,0.00003466931,0.00001932326,0.9922667,0.0021440377,0.004343704,0.0009974639,0.00000833795],"about_ca_topic_score_codex":0.0014118435,"about_ca_topic_score_gemma":0.0009832629,"teacher_disagreement_score":0.0014118435,"about_ca_system_score_codex":0.00058843405,"about_ca_system_score_gemma":0.0006156942,"threshold_uncertainty_score":0.004269421},"labels":[],"label_agreement":null},{"id":"W2133956363","doi":"10.1007/978-3-540-39869-1_18","title":"Improving Evolutionary Learning of Cooperative Behavior by Including Accountability of Strategy Components","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Accountability; Computer science; Evolutionary algorithm; Artificial intelligence; Action (physics); Process (computing); Evolutionary computation; Measure (data warehouse); Machine learning; Data mining","score_opus":0.026676161430804687,"score_gpt":0.2755858887287938,"score_spread":0.2489097272979891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133956363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13185269,0.0001302744,0.8587669,0.00060210883,0.0000703722,0.00006022251,0.000027506925,0.00036681443,0.008123111],"genre_scores_gemma":[0.90972364,0.00007636234,0.08728608,0.00012114196,0.000029229059,0.000088947214,0.00003829624,0.000051457002,0.0025848115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990439,0.00041971792,0.00005736336,0.0001720306,0.00020680163,0.00010013806],"domain_scores_gemma":[0.9887002,0.007999807,0.0006444958,0.0015324439,0.0008077885,0.00031529332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028157278,0.00063683366,0.0007525636,0.0003889969,0.000432674,0.0009017513,0.0014296835,0.001581558,0.0028639077],"category_scores_gemma":[0.0219477,0.00041682852,0.00043103902,0.00047643413,0.0010524417,0.0028601207,0.0020599,0.0021060128,0.0003116145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020635224,0.00040753922,0.0049843667,0.00012014172,0.0001133268,0.00011635366,0.00032008885,0.61613846,0.0074783857,0.14634813,0.0017063,0.22206058],"study_design_scores_gemma":[0.00003224053,0.00008542682,0.00045768303,0.000010799574,0.000022002449,0.000030804644,0.000020499228,0.93321157,0.0013902322,0.06425934,0.00046962313,0.000009741113],"about_ca_topic_score_codex":0.00077285,"about_ca_topic_score_gemma":0.001119918,"teacher_disagreement_score":0.0028639077,"about_ca_system_score_codex":0.00069405575,"about_ca_system_score_gemma":0.0010125325,"threshold_uncertainty_score":0.014891148},"labels":[],"label_agreement":null},{"id":"W2134177608","doi":"10.1109/ccece.2002.1013102","title":"Directing crossover for reduction of bloat in GP","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Genetic programming; Computer science; Reduction (mathematics); Genetic algorithm; Tree (set theory); Code (set theory); Operator (biology); Artificial intelligence; Algorithm; Machine learning; Mathematics; Programming language; Biology; Genetics","score_opus":0.017642199612866522,"score_gpt":0.2710642533116641,"score_spread":0.2534220536987976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134177608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1208187,0.0005289044,0.8755689,0.00014866452,0.000030867654,0.00012320573,0.000034677185,0.0008401697,0.0019059036],"genre_scores_gemma":[0.61942136,0.00046439675,0.3774475,0.00020249988,0.000038083377,0.00029552286,0.00016276057,0.00027420817,0.0016936886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993679,0.00025774242,0.00003127286,0.00009688901,0.00019897027,0.000047227502],"domain_scores_gemma":[0.9985084,0.00092912815,0.00017860887,0.00019109923,0.00015952846,0.000033129018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576961,0.00064736616,0.0007359532,0.0007677309,0.00035329492,0.00058130827,0.0007903433,0.0007515176,0.00080920436],"category_scores_gemma":[0.0044036675,0.0002819217,0.000542558,0.0008739367,0.0008236019,0.0007497172,0.0008637996,0.0008538284,0.00026875662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032493484,0.00022430865,0.0057674735,0.0002890981,0.00017134713,0.0005413912,0.0010906543,0.4381608,0.13410693,0.021317573,0.001589187,0.39641634],"study_design_scores_gemma":[0.0001183594,0.00048254977,0.0035658437,0.00004416571,0.00013322577,0.0005735187,0.00009921207,0.9394036,0.039700937,0.011894429,0.0039428007,0.000041356638],"about_ca_topic_score_codex":0.0010236694,"about_ca_topic_score_gemma":0.0011488808,"teacher_disagreement_score":0.0010576961,"about_ca_system_score_codex":0.00040475203,"about_ca_system_score_gemma":0.00046337416,"threshold_uncertainty_score":0.005593717},"labels":[],"label_agreement":null},{"id":"W2134574564","doi":"10.1109/micai.2009.25","title":"Comparison of Two Evolvable Systems in the Automated Analog Circuit Synthesis","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Spice; Analogue electronics; Computer science; Electronic circuit; Genetic algorithm; Representation (politics); Analogue filter; Algorithm; Electronic engineering; Filter (signal processing); Digital filter; Engineering; Electrical engineering; Machine learning","score_opus":0.03734124567761061,"score_gpt":0.3164469993104367,"score_spread":0.2791057536328261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134574564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2558832,0.001221608,0.73281884,0.00019540248,0.00007568831,0.0001246507,0.000054415268,0.001206485,0.008419812],"genre_scores_gemma":[0.72545993,0.0003654387,0.27181524,0.00007622231,0.000016532627,0.00016844779,0.00011010873,0.00008353607,0.0019045143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910337,0.00039990566,0.000035503923,0.00011396088,0.0002833216,0.00006387276],"domain_scores_gemma":[0.9981324,0.0012868232,0.00010166671,0.00017585723,0.00025038325,0.000052972297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014412482,0.00053713354,0.00047990892,0.0011363854,0.00033367713,0.00080616574,0.00087536976,0.0008510144,0.0015931065],"category_scores_gemma":[0.004468787,0.00017796035,0.00039976378,0.0006657959,0.00054294284,0.0005422444,0.0005647654,0.00049526064,0.00022377878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042676032,0.00018601191,0.002837708,0.00016124402,0.00010692641,0.00007154054,0.0001278017,0.73066175,0.008238103,0.016087798,0.0003307364,0.24076365],"study_design_scores_gemma":[0.000056960096,0.0002908978,0.000974571,0.000018306013,0.00003029898,0.00007715813,0.000035672267,0.9880288,0.0052740085,0.0033318473,0.001868112,0.000013355353],"about_ca_topic_score_codex":0.0018029717,"about_ca_topic_score_gemma":0.001350437,"teacher_disagreement_score":0.0018029717,"about_ca_system_score_codex":0.0008543167,"about_ca_system_score_gemma":0.00075689325,"threshold_uncertainty_score":0.0076221824},"labels":[],"label_agreement":null},{"id":"W2134922741","doi":"10.1142/s0219720012710023","title":"DETECTION AND DECOMPOSITION: TREATMENT-INDUCED CYCLIC GENE EXPRESSION DISRUPTION IN HIGH-THROUGHPUT TIME-SERIES DATASETS","year":2012,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Gene; Gene expression; Organism; Decomposition; Computational biology; Biology; Expression (computer science); Series (stratigraphy); Computer science; Genetics; Ecology","score_opus":0.012441089639826432,"score_gpt":0.27673103492857876,"score_spread":0.2642899452887523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134922741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678147,0.0026543548,0.2895722,0.0009693151,0.0003315684,0.00065508665,0.020560702,0.0060885125,0.0010212722],"genre_scores_gemma":[0.66824627,0.000812136,0.26199293,0.00030929636,0.0001425903,0.0009932233,0.06646763,0.0002707969,0.0007651626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982666,0.0005008699,0.00021138822,0.00056308025,0.00031607214,0.00014201275],"domain_scores_gemma":[0.997279,0.0014294374,0.00039378117,0.000536928,0.00025450138,0.00010641886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034395321,0.00096966745,0.0009918247,0.0020768286,0.0004664146,0.00074293395,0.00094801636,0.0011820737,0.00043499132],"category_scores_gemma":[0.0071334783,0.0002662303,0.0015046829,0.0024069324,0.0005682706,0.0007693656,0.00075088406,0.0012592882,0.00038557829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031748135,0.0020322322,0.15843135,0.0028907198,0.00203909,0.0018650537,0.00055314787,0.119110994,0.18299966,0.003797561,0.031611018,0.4914944],"study_design_scores_gemma":[0.00019292391,0.00065842405,0.11764348,0.000073979456,0.00036161198,0.0013214911,0.00022373162,0.8155354,0.046074364,0.0068608127,0.010918612,0.0001350981],"about_ca_topic_score_codex":0.0019634268,"about_ca_topic_score_gemma":0.0027153238,"teacher_disagreement_score":0.0034395321,"about_ca_system_score_codex":0.00052783045,"about_ca_system_score_gemma":0.0008986224,"threshold_uncertainty_score":0.018190205},"labels":[],"label_agreement":null},{"id":"W2135011160","doi":"10.1109/tvlsi.2005.844286","title":"Physical resource binding for a coarse-grain reconfigurable array using evolutionary algorithms","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Genetic algorithm; Kernel (algebra); Evolutionary algorithm; Resource (disambiguation); Algorithm; Computer engineering; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning","score_opus":0.022877395608439217,"score_gpt":0.26841290883269814,"score_spread":0.24553551322425893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135011160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07791239,0.00014189306,0.9142245,0.00025759367,0.000033822656,0.00007398243,0.000020243366,0.0006011428,0.0067344042],"genre_scores_gemma":[0.4910588,0.0001117459,0.5042868,0.00007777291,0.000011469841,0.00014396952,0.000040166,0.00010236139,0.0041668597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998431,0.000042391486,0.0000075095563,0.000027750526,0.00004773321,0.00003151241],"domain_scores_gemma":[0.99973553,0.00013308776,0.000029166351,0.00004351974,0.000043630575,0.000015087788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045288427,0.0003108872,0.00043077898,0.00037435407,0.00035952116,0.00069767266,0.00069320004,0.0005981697,0.0024015114],"category_scores_gemma":[0.0010534022,0.0002499207,0.0003764961,0.00029552513,0.00049934036,0.00056670175,0.00045190644,0.0006217877,0.00029709726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042291278,0.000045419063,0.0005417772,0.000053988242,0.000019697001,0.00008762463,0.000074354495,0.89561224,0.02113556,0.025999574,0.00073265546,0.05565471],"study_design_scores_gemma":[0.000014845691,0.00002604834,0.00009083253,0.0000038760923,0.000007275246,0.00001857466,0.00001527977,0.991672,0.0022620228,0.0047228173,0.0011619808,0.0000044438516],"about_ca_topic_score_codex":0.0016308725,"about_ca_topic_score_gemma":0.0025037099,"teacher_disagreement_score":0.0024015114,"about_ca_system_score_codex":0.0005602041,"about_ca_system_score_gemma":0.0007416914,"threshold_uncertainty_score":0.008033812},"labels":[],"label_agreement":null},{"id":"W2136859123","doi":"10.1109/dasc.2009.79","title":"Similarity Computation Using Reconfigurable Embedded Hardware","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Field-programmable gate array; Reconfigurable computing; Embedded system; Computer hardware; Multiplexer; Design space exploration; Software; Computation; Flexibility (engineering); Computer architecture; Hardware acceleration; Multiplexing; Algorithm","score_opus":0.03512040881234258,"score_gpt":0.29191302376524425,"score_spread":0.2567926149529017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136859123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3594134,0.00085744547,0.62569636,0.00025854437,0.00018338342,0.00008774875,0.00014989574,0.003727871,0.00962531],"genre_scores_gemma":[0.8168715,0.00021572162,0.17945157,0.000076318014,0.000030492452,0.000042733434,0.00011576383,0.000041676412,0.0031541877],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979573,0.00003116713,0.00001560783,0.00005123749,0.00008121043,0.000025046882],"domain_scores_gemma":[0.9996538,0.000112402646,0.000055130036,0.00009126339,0.000068242916,0.000019038955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015159324,0.00033314154,0.0002729784,0.0005727024,0.0002332466,0.0005881181,0.00085519796,0.00031681938,0.002788377],"category_scores_gemma":[0.00076042925,0.00017764416,0.00025713415,0.0006540359,0.00019916678,0.00074762315,0.00027559267,0.00022563289,0.0004249774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010010672,0.00016723928,0.002457916,0.00021755867,0.00014425578,0.0007693136,0.000097914526,0.15468955,0.27945754,0.016504923,0.0032375874,0.541255],"study_design_scores_gemma":[0.00013905414,0.00066073297,0.0021930516,0.000026965592,0.000074749354,0.0006672387,0.000058710175,0.8476937,0.13420972,0.0053969338,0.00883483,0.00004437682],"about_ca_topic_score_codex":0.0010134566,"about_ca_topic_score_gemma":0.0012701584,"teacher_disagreement_score":0.002788377,"about_ca_system_score_codex":0.00044245526,"about_ca_system_score_gemma":0.0003061088,"threshold_uncertainty_score":0.009328008},"labels":[],"label_agreement":null},{"id":"W2136903583","doi":"10.1109/cec.2007.4424559","title":"Genetic swarm grammar programming: Ecological breeding like a gardener","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Genetic programming; Grammatical evolution; Computer science; Rule-based machine translation; Grammar; Artificial intelligence; Fitness landscape; Swarm robotics; Theoretical computer science; Linguistics","score_opus":0.018087278131396482,"score_gpt":0.2531702290495113,"score_spread":0.23508295091811482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136903583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041062646,0.00012739097,0.9457979,0.0008090759,0.00006779647,0.000048231494,0.000037101112,0.0007198644,0.011330015],"genre_scores_gemma":[0.42892885,0.00029771338,0.55693334,0.0004332326,0.00004321463,0.00018371885,0.00008941308,0.00036805402,0.012722426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973804,0.00010020248,0.000011910267,0.00006886106,0.00005759739,0.000023407112],"domain_scores_gemma":[0.999574,0.00024109597,0.000039108163,0.000065974615,0.000035074754,0.000044844317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076388643,0.0003097668,0.00035126458,0.00031745824,0.00050859456,0.00093565683,0.000830625,0.0006176061,0.0024453332],"category_scores_gemma":[0.0017280837,0.0002399585,0.0005218487,0.00028592354,0.0019837448,0.0011656138,0.0010752329,0.0009110008,0.00028208838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049871967,0.000052184892,0.001558416,0.00007804075,0.00004347522,0.00041370775,0.00088114466,0.25962338,0.01071265,0.66240615,0.002590284,0.061590675],"study_design_scores_gemma":[0.00005165822,0.00005311546,0.00028410667,0.0000241975,0.000028577117,0.00017362107,0.00011742032,0.62095666,0.0032294162,0.35144848,0.023609998,0.000022844324],"about_ca_topic_score_codex":0.0013247418,"about_ca_topic_score_gemma":0.0020814568,"teacher_disagreement_score":0.0024453332,"about_ca_system_score_codex":0.0005570193,"about_ca_system_score_gemma":0.00071272475,"threshold_uncertainty_score":0.008180499},"labels":[],"label_agreement":null},{"id":"W2138819322","doi":"10.1109/iwfhr.2002.1030900","title":"Genetic engineering of handwriting representations","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Genetic programming; Computer science; Frame (networking); Artificial intelligence; Feature (linguistics); Character (mathematics); Handwriting; Pattern recognition (psychology); Set (abstract data type); Handwriting recognition; Representation (politics); Fuzzy set; Feature vector; Fuzzy logic; Feature extraction; Mathematics; Programming language","score_opus":0.010652180445997217,"score_gpt":0.23328401935266865,"score_spread":0.22263183890667143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138819322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80859,0.00037293308,0.18471771,0.00018767154,0.000111719986,0.00016729783,0.00016499385,0.0011648652,0.004522807],"genre_scores_gemma":[0.873239,0.00036285326,0.122556254,0.00005017377,0.00001664131,0.00013696532,0.00034771382,0.00016023072,0.003130132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996604,0.00006195031,0.000025816093,0.00008441135,0.00012756276,0.000039941908],"domain_scores_gemma":[0.9993942,0.00030171228,0.000109319015,0.000082916216,0.00007741935,0.000034343815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030819612,0.0005244016,0.00037718026,0.00037217687,0.00021442561,0.0005732436,0.0005215257,0.000463169,0.0011197457],"category_scores_gemma":[0.002104362,0.00023159897,0.00029541977,0.0003498129,0.00035629558,0.0003419081,0.00040840427,0.0007151401,0.00019979276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032722743,0.0004972048,0.001636572,0.00030159438,0.00007639993,0.00055169075,0.00022250967,0.16257979,0.6545811,0.011756312,0.0005571712,0.16691239],"study_design_scores_gemma":[0.00010765652,0.0006754307,0.0021628544,0.00004809181,0.00008077663,0.00049007917,0.00009489091,0.4846748,0.49765092,0.005424594,0.008539254,0.000050515224],"about_ca_topic_score_codex":0.00064716104,"about_ca_topic_score_gemma":0.00069594744,"teacher_disagreement_score":0.0011197457,"about_ca_system_score_codex":0.00035198868,"about_ca_system_score_gemma":0.00020826996,"threshold_uncertainty_score":0.003745854},"labels":[],"label_agreement":null},{"id":"W2140542500","doi":"10.1007/978-3-642-37192-9_49","title":"On GPU Based Fitness Evaluation with Decoupled Training Partition Cardinality","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Partition (number theory); Genetic programming; Implementation; Evolutionary computation; Computation; Population; Parallel computing; Pareto principle; Programming style; Evolutionary algorithm; Theoretical computer science; Artificial intelligence; Mathematical optimization; Algorithm; Programming language","score_opus":0.038098832401498195,"score_gpt":0.27502090626496234,"score_spread":0.23692207386346414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140542500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15663591,0.0010709944,0.8071635,0.0005996478,0.00038111574,0.00015286317,0.00026329773,0.004537504,0.029195162],"genre_scores_gemma":[0.649726,0.00016277799,0.3358603,0.0002820873,0.000090779045,0.00012043922,0.00049476215,0.0006813648,0.01258151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991868,0.00024943112,0.000036110367,0.00010303892,0.00031869492,0.000105843064],"domain_scores_gemma":[0.9985581,0.0007138758,0.000049812774,0.0002750145,0.00032694556,0.0000762732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083049363,0.00074412575,0.0010053675,0.00083922636,0.00059195794,0.0014398504,0.0013891436,0.0013331503,0.010303301],"category_scores_gemma":[0.004189441,0.0003303117,0.00045594393,0.0009883303,0.00042434968,0.0012114807,0.0014940881,0.0010048016,0.0011650216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007795267,0.00029254003,0.0020318932,0.00010334464,0.00010257924,0.00014872605,0.00009093921,0.44302824,0.01661437,0.009516127,0.00903831,0.51825345],"study_design_scores_gemma":[0.000020957645,0.000037193244,0.0005509004,0.000012568681,0.000011960134,0.00003022581,0.000013027027,0.99496907,0.001831263,0.0018035908,0.0007143538,0.000004889638],"about_ca_topic_score_codex":0.007432192,"about_ca_topic_score_gemma":0.012646747,"teacher_disagreement_score":0.010303301,"about_ca_system_score_codex":0.0007982582,"about_ca_system_score_gemma":0.00097407115,"threshold_uncertainty_score":0.034467936},"labels":[],"label_agreement":null},{"id":"W2140839263","doi":"10.1145/1143997.1144158","title":"Relaxed genetic programming","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Genetic programming; Generalization; Computer science; Set (abstract data type); Relaxation (psychology); Genetic algorithm; Degree (music); Mathematical optimization; Variation (astronomy); Artificial intelligence; Algorithm; Mathematics; Machine learning; Programming language","score_opus":0.007329911486107012,"score_gpt":0.2155496572390274,"score_spread":0.20821974575292038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140839263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10359925,0.0010146957,0.8755401,0.00057220855,0.00011944942,0.00015334846,0.00027038858,0.00045644544,0.018274104],"genre_scores_gemma":[0.57479656,0.000730477,0.4164051,0.00041677724,0.00006357819,0.0003628286,0.0008313249,0.00024207037,0.0061512943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976726,0.0012433392,0.00007488422,0.0003199614,0.0005152603,0.00017395287],"domain_scores_gemma":[0.99392265,0.0039500343,0.00041604438,0.0008511816,0.00070031954,0.00015976782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003322965,0.0010243269,0.0011401876,0.0007586722,0.000472134,0.0013972883,0.0019842112,0.0013258746,0.0030610089],"category_scores_gemma":[0.015391355,0.0004896725,0.0010074471,0.001045124,0.0012533445,0.0013285303,0.0014931635,0.0024156591,0.0006520029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016621807,0.00005780162,0.0005885765,0.00011936476,0.00008983715,0.00012289954,0.00013459801,0.92503726,0.0028353091,0.032695062,0.0013368838,0.03681618],"study_design_scores_gemma":[0.000041400777,0.00015841311,0.00029150303,0.000042522086,0.000034064997,0.00010351395,0.000034298206,0.97655654,0.001271128,0.019098947,0.002349602,0.000018039513],"about_ca_topic_score_codex":0.002535526,"about_ca_topic_score_gemma":0.001643217,"teacher_disagreement_score":0.003322965,"about_ca_system_score_codex":0.00083592144,"about_ca_system_score_gemma":0.00079879846,"threshold_uncertainty_score":0.017573714},"labels":[],"label_agreement":null},{"id":"W2140933216","doi":"10.1109/fuzzy.2008.4630598","title":"Derivation of relational fuzzy classification rules using evolutionary computation","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Artificial intelligence; Evolutionary computation; Fuzzy classification; Data mining; Fuzzy logic; Evolutionary algorithm; Genetic programming; Machine learning; Evolutionary programming; Neuro-fuzzy; Human-based evolutionary computation; Population; Fuzzy set; Fuzzy set operations; Grammatical evolution; Fuzzy rule; Membership function; Fuzzy control system; Interactive evolutionary computation","score_opus":0.07486622579595338,"score_gpt":0.2777606076500732,"score_spread":0.20289438185411984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140933216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084917145,0.0001078436,0.98927015,0.000082201914,0.000032066273,0.00010068881,0.000059090824,0.0005425487,0.0013137163],"genre_scores_gemma":[0.11964493,0.00016952246,0.8779636,0.0000865595,0.000021982853,0.00019390229,0.00029402526,0.000088902954,0.0015365053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873596,0.00024307417,0.00016589994,0.00030778837,0.00048567454,0.0000617065],"domain_scores_gemma":[0.9978472,0.0010147345,0.00013777579,0.00026917548,0.000683404,0.00004774253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001964124,0.0005319554,0.0010079243,0.0016144435,0.00095869903,0.0015727024,0.0013069422,0.00084173755,0.0021141616],"category_scores_gemma":[0.0075658653,0.00047320095,0.0012473654,0.0011282617,0.00060236355,0.001078434,0.0010788409,0.0012734163,0.00068867335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009427625,0.00017286873,0.0038235248,0.00029300232,0.00023119336,0.0007725887,0.000618551,0.2546386,0.02244966,0.055684645,0.0033546942,0.6578664],"study_design_scores_gemma":[0.000021158432,0.000045350665,0.00074592524,0.00006583535,0.00007130409,0.00024577673,0.000048266047,0.959779,0.00894867,0.024432953,0.0055599757,0.000035775498],"about_ca_topic_score_codex":0.004689045,"about_ca_topic_score_gemma":0.0037716348,"teacher_disagreement_score":0.004689045,"about_ca_system_score_codex":0.0006659961,"about_ca_system_score_gemma":0.0012011435,"threshold_uncertainty_score":0.010387421},"labels":[],"label_agreement":null},{"id":"W2141402868","doi":"10.1109/cec.2006.1688519","title":"On Clustering in Evolutionary Computation","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Local optimum; Evolutionary computation; Overhead (engineering); Evolutionary algorithm; Computer science; Computation; Mathematical optimization; Euclidean distance; Human-based evolutionary computation; Algorithm; Mathematics; Interactive evolutionary computation; Artificial intelligence; Evolutionary programming","score_opus":0.00989473800404137,"score_gpt":0.23887016261822003,"score_spread":0.22897542461417866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141402868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004963926,0.032365244,0.9286895,0.0035766265,0.00086071796,0.000100568875,0.0001252671,0.0002835779,0.029034609],"genre_scores_gemma":[0.29587075,0.054547198,0.61518013,0.0027831737,0.0043427893,0.00086091104,0.00060231984,0.0005297282,0.025283009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998409,0.0007273043,0.000104848696,0.000291623,0.0003694442,0.0000978393],"domain_scores_gemma":[0.9976708,0.0016483049,0.00008497536,0.00028290346,0.00024973007,0.0000633109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021627478,0.0012623359,0.0017336863,0.0020030139,0.0010299295,0.0023021817,0.0016520827,0.0022323637,0.0041798796],"category_scores_gemma":[0.007030313,0.00052404933,0.0011734555,0.004546358,0.0030948117,0.0034071964,0.0025406154,0.0029466038,0.0012288679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038184076,0.000030433479,0.0005350804,0.00046326034,0.000121873876,0.00013490827,0.00025721997,0.13959013,0.0005722995,0.7395665,0.009126588,0.10956348],"study_design_scores_gemma":[0.000020348685,0.000040316227,0.00031074518,0.00011607835,0.000023336,0.00013228212,0.00004875301,0.19340833,0.0004037146,0.7704236,0.035040956,0.00003161576],"about_ca_topic_score_codex":0.0024104936,"about_ca_topic_score_gemma":0.0017087912,"teacher_disagreement_score":0.0041798796,"about_ca_system_score_codex":0.0018886647,"about_ca_system_score_gemma":0.000869819,"threshold_uncertainty_score":0.013983071},"labels":[],"label_agreement":null},{"id":"W2141741329","doi":"10.1145/1102256.1102295","title":"802.11 network intrusion detection using genetic programming","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Computer science; Genetic programming; Intrusion detection system; Computer network; Computer security; Artificial intelligence","score_opus":0.014823818086247418,"score_gpt":0.24482172112387393,"score_spread":0.22999790303762652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141741329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14089678,0.00029598613,0.8517787,0.0008159947,0.00005084601,0.0001058306,0.0000513491,0.00084759603,0.005156874],"genre_scores_gemma":[0.7144946,0.0003509608,0.2816738,0.0002225271,0.00003132524,0.00023961559,0.00011708408,0.00006690676,0.002803202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996082,0.0001564577,0.000016629623,0.00006776231,0.00010728576,0.0000437161],"domain_scores_gemma":[0.9989869,0.0006985697,0.00009179202,0.00003748963,0.00016012187,0.000025042185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009555585,0.000566631,0.00058200286,0.0007072661,0.0003554713,0.00088729715,0.0008757463,0.00091263105,0.0007638984],"category_scores_gemma":[0.003967454,0.00036540657,0.0004999957,0.0006695932,0.0006832813,0.0006213434,0.00050373515,0.0008481232,0.00010759183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000293043,0.00004831702,0.0013901533,0.000021154936,0.000047433932,0.000052357373,0.000052733405,0.9411961,0.0011469892,0.0057248804,0.00049190334,0.049798753],"study_design_scores_gemma":[0.000007932046,0.000013379718,0.00012946177,0.0000040830673,0.000008055282,0.000010314503,0.000006668791,0.9964309,0.0003935728,0.0027512885,0.0002413082,0.0000030356932],"about_ca_topic_score_codex":0.006098218,"about_ca_topic_score_gemma":0.0035491905,"teacher_disagreement_score":0.006098218,"about_ca_system_score_codex":0.0008213835,"about_ca_system_score_gemma":0.0008553935,"threshold_uncertainty_score":0.0121254325},"labels":[],"label_agreement":null},{"id":"W2141962622","doi":"10.1109/icvd.1997.568186","title":"Shake And Bake: a method of mapping code to irregular DSPs","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Code (set theory); Parallel computing; Abstraction; Dead code; Unreachable code; Set (abstract data type); Redundant code; Schedule; Programming language; Code generation; Sequence (biology); Instruction set; Algorithm; Operating system","score_opus":0.034444363275410624,"score_gpt":0.2706422723919154,"score_spread":0.2361979091165048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141962622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010610197,0.0001035544,0.9832145,0.00012135566,0.00005037476,0.00007959624,0.000029279448,0.0013249788,0.004466199],"genre_scores_gemma":[0.09920902,0.00013089499,0.89285636,0.000104482664,0.000015307223,0.00016115382,0.000080920945,0.0005162025,0.0069257417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996177,0.000082402534,0.000016916214,0.00007932157,0.00015928935,0.000044341265],"domain_scores_gemma":[0.99951375,0.0001527248,0.000030374036,0.0001857685,0.00009478902,0.000022495713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050583587,0.00051201944,0.0004618695,0.000877947,0.0009852373,0.00072782603,0.001055189,0.000650583,0.0057718507],"category_scores_gemma":[0.0025808993,0.00042106104,0.0004846169,0.00064420543,0.001863588,0.0010346727,0.0013625284,0.0011096209,0.0011989732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030117072,0.00010760475,0.00073352875,0.00025914758,0.000059401693,0.00029799668,0.000732968,0.12073464,0.056623526,0.21872832,0.005896355,0.5955253],"study_design_scores_gemma":[0.00014499066,0.00026522027,0.00042252793,0.00006871622,0.000059582184,0.0005604383,0.00018389852,0.6561703,0.077347495,0.19211179,0.07259081,0.00007421051],"about_ca_topic_score_codex":0.0014234553,"about_ca_topic_score_gemma":0.00182593,"teacher_disagreement_score":0.0057718507,"about_ca_system_score_codex":0.00043067345,"about_ca_system_score_gemma":0.0009189471,"threshold_uncertainty_score":0.019308746},"labels":[],"label_agreement":null},{"id":"W2144425309","doi":"10.1109/tai.2003.1250213","title":"Experiments in automatic programming for general purposes","year":2004,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Crossover; Computer science; USable; Genetic programming; clone (Java method); Software engineering; Software; Selection (genetic algorithm); Set (abstract data type); Variety (cybernetics); Automatic programming; Usability; Programming language; Search-based software engineering; Software development; Artificial intelligence; Software construction; Human–computer interaction; World Wide Web","score_opus":0.0242388217915714,"score_gpt":0.300554049728991,"score_spread":0.27631522793741964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144425309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8657219,0.00080660783,0.09132423,0.0007952124,0.000156267,0.0010641945,0.0006666244,0.0029336552,0.03653138],"genre_scores_gemma":[0.87576234,0.00052392593,0.11236884,0.00033440784,0.00006258348,0.001632141,0.0012578102,0.0010438259,0.007014194],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959459,0.0021368794,0.00025333403,0.0005169111,0.0009215381,0.00022545474],"domain_scores_gemma":[0.9507083,0.042015202,0.0009298762,0.004544297,0.0013911589,0.00041109993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037819885,0.0005778102,0.00059162686,0.00057320646,0.0006209967,0.0011041026,0.0013590403,0.0013016379,0.0071798926],"category_scores_gemma":[0.030715315,0.0003872588,0.00048931764,0.0010707123,0.0012635859,0.0022315662,0.0012203592,0.0020404216,0.0014898061],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0076863905,0.015574154,0.008133446,0.0039701257,0.00025084402,0.00092093594,0.0084752245,0.15564676,0.098998226,0.07466225,0.021816999,0.60386467],"study_design_scores_gemma":[0.004623835,0.019533528,0.027174551,0.0005730332,0.00027763378,0.001555712,0.0022021122,0.572167,0.16651864,0.09390583,0.11119605,0.00027204555],"about_ca_topic_score_codex":0.0009861802,"about_ca_topic_score_gemma":0.0005259627,"teacher_disagreement_score":0.0071798926,"about_ca_system_score_codex":0.0006508159,"about_ca_system_score_gemma":0.0005536183,"threshold_uncertainty_score":0.024019122},"labels":[],"label_agreement":null},{"id":"W2145173052","doi":"10.1007/978-3-540-24840-8_11","title":"On Customizing Evolutionary Learning of Agent Behavior","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fitness function; Computer science; Fitness approximation; Artificial intelligence; Evolutionary algorithm; Function (biology); Representation (politics); Machine learning; Encoding (memory); Feature (linguistics); Genetic algorithm","score_opus":0.01602664295265665,"score_gpt":0.2507713468589779,"score_spread":0.23474470390632124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145173052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01808317,0.0001728695,0.9738139,0.00020385155,0.00006112468,0.000044060856,0.0000143456,0.00053608,0.007070495],"genre_scores_gemma":[0.570487,0.0005466309,0.4158772,0.00037667653,0.000104837876,0.00020635368,0.0001263435,0.0005455861,0.011729423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940836,0.00019368787,0.00003774971,0.000118206095,0.00018324293,0.000058696394],"domain_scores_gemma":[0.9959169,0.0028275813,0.00013284457,0.0008270132,0.00022281718,0.00007282892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017553103,0.0006284087,0.00079878396,0.00042574413,0.0003747324,0.0007783044,0.0017094389,0.0012586442,0.0040012756],"category_scores_gemma":[0.009037849,0.00044009625,0.0005606474,0.00068040553,0.0014646874,0.0021376812,0.00218332,0.0017938337,0.00040870334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006731727,0.00010670115,0.0009947458,0.00007533283,0.00005261778,0.00007603815,0.00016286407,0.7102152,0.0036891077,0.09576006,0.0016099089,0.18719016],"study_design_scores_gemma":[0.00001090199,0.000023691244,0.0001743467,0.000008501336,0.000009071901,0.00003065471,0.000012169777,0.9439231,0.0009104139,0.053838987,0.0010512782,0.000006756082],"about_ca_topic_score_codex":0.0018434831,"about_ca_topic_score_gemma":0.0018850727,"teacher_disagreement_score":0.0040012756,"about_ca_system_score_codex":0.00066653744,"about_ca_system_score_gemma":0.00045026213,"threshold_uncertainty_score":0.0133856535},"labels":[],"label_agreement":null},{"id":"W2145471143","doi":"10.19030/jber.v8i11.52","title":"Testing The Adaptive Efficiency Of U.S. Stock Markets: A Genetic Programming Approach","year":2010,"lang":"en","type":"article","venue":"Journal of Business & Economics Research (JBER)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Thompson Rivers University","funders":"","keywords":"Stock (firearms); Econometrics; Economics; Stock market; Equity (law); Financial economics","score_opus":0.07439495976308935,"score_gpt":0.3035433398305489,"score_spread":0.22914838006745952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145471143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8421404,0.0001869366,0.15100937,0.0006346422,0.000022930537,0.00018589533,0.000344098,0.0003900811,0.0050857347],"genre_scores_gemma":[0.91044116,0.000088526016,0.08755804,0.00014528936,0.000016230326,0.00019146525,0.00047521474,0.00004021214,0.0010438501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987232,0.00077100703,0.00004896075,0.00025667986,0.00010894816,0.0000912616],"domain_scores_gemma":[0.98954004,0.0095530795,0.00033066707,0.00016091068,0.0003263494,0.00008894574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049119415,0.00088007865,0.0006401333,0.0024299256,0.00040889924,0.0013831761,0.0011715629,0.0011836872,0.0012483115],"category_scores_gemma":[0.016503615,0.00041574516,0.00095131213,0.0012594254,0.00077347853,0.0007457532,0.0006630831,0.001002416,0.0001274889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007980488,0.00011777053,0.0103797605,0.000021393736,0.00014442392,0.000037624533,0.000043678323,0.9624398,0.00025115488,0.0027799425,0.00034173974,0.023362845],"study_design_scores_gemma":[0.000014309731,0.000021555164,0.0008722689,0.000003839237,0.00001031782,0.000004209903,0.0000150999695,0.9978669,0.000100889774,0.0010404582,0.000047206875,0.00000298002],"about_ca_topic_score_codex":0.013664489,"about_ca_topic_score_gemma":0.0080331955,"teacher_disagreement_score":0.013664489,"about_ca_system_score_codex":0.0013476574,"about_ca_system_score_gemma":0.0013910494,"threshold_uncertainty_score":0.027169883},"labels":[],"label_agreement":null},{"id":"W2147822566","doi":"10.1109/ares.2008.50","title":"Adaptabilty of a GP Based IDS on Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Natural Sciences and Engineering Research Council of Canada; Research Nova Scotia; Dalhousie University","keywords":"Computer science; Intrusion detection system; Wireless; Preprocessor; Wireless intrusion prevention system; Detector; Computer network; Machine learning; Wireless network; Artificial intelligence; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.021671949989626734,"score_gpt":0.2287732865955943,"score_spread":0.20710133660596755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147822566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6939508,0.000076360055,0.29907325,0.00060034805,0.00006651052,0.00009840928,0.000050862247,0.0012260919,0.004857401],"genre_scores_gemma":[0.9779269,0.000025144858,0.021067396,0.000058830497,0.000007629976,0.000042050553,0.000031568085,0.000025764628,0.0008147575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924386,0.00027797167,0.000033076994,0.00015807866,0.00017630005,0.000110661895],"domain_scores_gemma":[0.996876,0.0019495548,0.0003115485,0.00031754514,0.00045278278,0.00009250675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013336093,0.000405163,0.0004974709,0.0006882354,0.0003367391,0.0008027159,0.0006936474,0.00076054083,0.0008462793],"category_scores_gemma":[0.008491864,0.00023315163,0.00033721136,0.00031032428,0.0008059128,0.0006698856,0.00071770005,0.00076403207,0.00015419934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014521462,0.00008358434,0.0064189774,0.000022201275,0.00005526648,0.00021992429,0.00010365014,0.9420092,0.007683828,0.0046639857,0.00052707765,0.03806705],"study_design_scores_gemma":[0.0000053329227,0.000029823475,0.0005900607,0.0000019277193,0.000007884571,0.000036777205,0.000008758659,0.9967438,0.0012693921,0.001168059,0.00013527597,0.0000027958974],"about_ca_topic_score_codex":0.0038370935,"about_ca_topic_score_gemma":0.00102679,"teacher_disagreement_score":0.0038370935,"about_ca_system_score_codex":0.00097083626,"about_ca_system_score_gemma":0.00057708984,"threshold_uncertainty_score":0.0076295137},"labels":[],"label_agreement":null},{"id":"W2148538884","doi":"10.1109/ccece.2002.1013046","title":"Crossover context in page-based linear genetic programming","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Crossover; Genetic programming; Computer science; Context (archaeology); Fitness landscape; Relation (database); Tree (set theory); Artificial intelligence; Theoretical computer science; Data mining; Mathematics; Biology","score_opus":0.01627690065495219,"score_gpt":0.25371569650546333,"score_spread":0.23743879585051114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148538884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1318795,0.00092335115,0.84891665,0.0006252057,0.000097681455,0.00006698659,0.000032337997,0.0005688775,0.016889384],"genre_scores_gemma":[0.8205168,0.00052954536,0.17167208,0.00022181071,0.000072011266,0.00014589814,0.000065553744,0.00013719816,0.006639033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944633,0.00030946886,0.000016396963,0.000078260164,0.00010451814,0.000044975288],"domain_scores_gemma":[0.9979808,0.0015862795,0.000129383,0.00011264513,0.00011677939,0.00007402498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008059895,0.00026855632,0.00049361255,0.0004224849,0.00043435572,0.001493236,0.0007296424,0.0007871114,0.0025492215],"category_scores_gemma":[0.005450828,0.00024696667,0.0003451206,0.00091431267,0.0017266276,0.0014576287,0.0009997179,0.0009953674,0.00040018797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020085786,0.00008730182,0.0022855166,0.00015244015,0.000044522567,0.00037614905,0.00076386053,0.51385134,0.0039472184,0.35047582,0.0012381288,0.12657692],"study_design_scores_gemma":[0.000053504707,0.0002031407,0.00054381834,0.00004853647,0.000035584282,0.00017664982,0.00009466653,0.7325722,0.002104114,0.25945312,0.0046847113,0.00002998009],"about_ca_topic_score_codex":0.0009730356,"about_ca_topic_score_gemma":0.0012606706,"teacher_disagreement_score":0.0025492215,"about_ca_system_score_codex":0.0005126438,"about_ca_system_score_gemma":0.00058016414,"threshold_uncertainty_score":0.008528054},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013321120281480575,"score_gpt":0.2931154093691397,"score_spread":0.27979428908765913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148554518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06096872,0.00022203087,0.9324963,0.00015381476,0.00004548517,0.0000630627,0.000053573673,0.0015324419,0.004464563],"genre_scores_gemma":[0.44220167,0.00013092795,0.5534067,0.00008094179,0.000014719327,0.000087800676,0.000114715105,0.00022445139,0.0037379644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997985,0.000031801883,0.0000072060957,0.00006719322,0.00007104237,0.000024336607],"domain_scores_gemma":[0.99957806,0.000198918,0.00004355411,0.00004012768,0.00012421809,0.000015085368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042806863,0.0005845226,0.0007577773,0.0016081999,0.0006515802,0.00093405385,0.0010349236,0.001266512,0.0018595002],"category_scores_gemma":[0.0014391382,0.00045853906,0.00065446424,0.0009414707,0.00064365246,0.00086427224,0.0006652169,0.0006329767,0.0006158999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021964223,0.00013114298,0.0026595828,0.00010816939,0.000069927846,0.00021287664,0.00010492019,0.50074947,0.043300908,0.009946263,0.0017674057,0.4407297],"study_design_scores_gemma":[0.000013274979,0.000016742446,0.00027626578,0.0000057114366,0.000012831506,0.000042297095,0.000022477981,0.98837423,0.0051982724,0.0053381925,0.00069186103,0.000007872144],"about_ca_topic_score_codex":0.004007841,"about_ca_topic_score_gemma":0.004833434,"teacher_disagreement_score":0.004007841,"about_ca_system_score_codex":0.0005714927,"about_ca_system_score_gemma":0.0008645641,"threshold_uncertainty_score":0.007969022},"labels":[],"label_agreement":null},{"id":"W2150103191","doi":"10.1109/tmag.2006.892105","title":"Evolution of Wire Antennas in Three Dimensions Using a Novel Growth Process","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Process (computing); Antenna (radio); Implementation; Directional antenna; Task (project management); Electronic engineering; Telecommunications; Systems engineering; Engineering","score_opus":0.0211107758710047,"score_gpt":0.2604423649672919,"score_spread":0.23933158909628718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150103191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31252933,0.0004664027,0.6602003,0.0007302215,0.00010378999,0.00009197793,0.00006430568,0.00040630545,0.025407428],"genre_scores_gemma":[0.71447074,0.00053397316,0.27781844,0.00009336368,0.00002234866,0.00016855494,0.00007331247,0.000092035145,0.0067272843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990046,0.000027592641,0.0000060921925,0.000018528304,0.000033400793,0.000013947948],"domain_scores_gemma":[0.99963474,0.00021198783,0.000049141716,0.000044139164,0.000040416322,0.000019668321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024802948,0.00027937174,0.0002870976,0.00031722194,0.00042278005,0.00080021546,0.0004862457,0.00082107243,0.0011268315],"category_scores_gemma":[0.0011766662,0.00022951196,0.0004911309,0.0003500591,0.00078825984,0.0005618457,0.00072144344,0.00055553584,0.00027184992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008584475,0.00014545892,0.0020456975,0.00013723606,0.00004330337,0.00078482414,0.0006038755,0.51571226,0.17356192,0.2515613,0.0014161224,0.053902112],"study_design_scores_gemma":[0.000057101097,0.00013740506,0.000368996,0.000011120426,0.00001566009,0.00025162083,0.000063247906,0.9395376,0.015301238,0.037566688,0.006663525,0.000025802436],"about_ca_topic_score_codex":0.00053300906,"about_ca_topic_score_gemma":0.00045935364,"teacher_disagreement_score":0.0011268315,"about_ca_system_score_codex":0.0003368038,"about_ca_system_score_gemma":0.00024131448,"threshold_uncertainty_score":0.0037696362},"labels":[],"label_agreement":null},{"id":"W2152075570","doi":"10.1109/cec.2006.1688619","title":"Probabilistic (Genotype) Adaptive Mapping Combinations for Developmental Genetic Programming","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Probabilistic logic; Genetic programming; Benchmark (surveying); Computer science; Population; Genetic algorithm; Genotype; Machine learning; Artificial intelligence; Biology; Genetics","score_opus":0.02058731817041253,"score_gpt":0.22841392896738072,"score_spread":0.20782661079696818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152075570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011904728,0.00014473738,0.98576754,0.000098414515,0.000018429446,0.00003883354,0.000018071918,0.00018768405,0.0018215067],"genre_scores_gemma":[0.2581436,0.00019083008,0.73911583,0.0000974699,0.00002665665,0.00024871744,0.0000775711,0.000098424345,0.0020009056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.0002713674,0.000035124733,0.00012259374,0.00021861118,0.000029879508],"domain_scores_gemma":[0.99883145,0.0008689499,0.00007679529,0.000098715966,0.000099681194,0.0000243931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264564,0.0007059076,0.00054858613,0.0005859352,0.00031107548,0.00060589524,0.001240321,0.0008145638,0.0015397238],"category_scores_gemma":[0.0047056805,0.00032450698,0.00044435583,0.0008609162,0.000556359,0.0008952667,0.0011680095,0.0012562338,0.00025121696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006161972,0.000073048264,0.0010894904,0.000092390816,0.000049677434,0.00010151269,0.000080431375,0.6985122,0.005461515,0.0695827,0.0010283259,0.22386713],"study_design_scores_gemma":[0.000012375839,0.000064317435,0.00016156946,0.000008792387,0.000013924008,0.00007703224,0.0000107388505,0.96500564,0.0017602469,0.030320002,0.0025539063,0.000011291006],"about_ca_topic_score_codex":0.0006300005,"about_ca_topic_score_gemma":0.0008611468,"teacher_disagreement_score":0.0015397238,"about_ca_system_score_codex":0.0004284367,"about_ca_system_score_gemma":0.0004613943,"threshold_uncertainty_score":0.0066877007},"labels":[],"label_agreement":null},{"id":"W2152445702","doi":"10.1109/crv.2006.32","title":"Evolving a Vision-Based Line-Following Robot Controller","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; OpenGL; Mobile robot; Robot; Controller (irrigation); Evolutionary computation; Artificial intelligence; Simple (philosophy); Computation; Line (geometry); Computer vision; Ubiquitous robot; Genetic programming; Robot control; Human–computer interaction; Computer graphics (images); Visualization; Programming language; Mathematics","score_opus":0.0077125723807177984,"score_gpt":0.2454616681545138,"score_spread":0.23774909577379602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152445702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049670924,0.00008130294,0.94494855,0.00008798132,0.000041492425,0.00005806355,0.000018022276,0.0010997377,0.003993889],"genre_scores_gemma":[0.68203956,0.00008019499,0.3130516,0.00012748093,0.000015353873,0.00009399577,0.00005468938,0.00010159257,0.0044354564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998561,0.000013453087,0.0000047838307,0.00004074237,0.00006436388,0.000020478834],"domain_scores_gemma":[0.9998752,0.000035702607,0.000018135732,0.000015601345,0.00003819865,0.000017214363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002428211,0.00029335747,0.0003629565,0.00020216125,0.00036752,0.00045679617,0.0012253596,0.0008704247,0.0014214693],"category_scores_gemma":[0.00055285293,0.00020339673,0.00026895734,0.00013922472,0.0004373882,0.0004217558,0.00052374473,0.00062942074,0.00028463922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103927785,0.00019262411,0.0008369397,0.0000629505,0.000041424508,0.00035246846,0.00023417527,0.68274945,0.11955135,0.019108566,0.0017551853,0.17501092],"study_design_scores_gemma":[0.000020567586,0.00004979376,0.00010665476,0.0000030230879,0.000008834417,0.0000444298,0.000011196499,0.98890465,0.008165223,0.0012378601,0.0014404504,0.000007323667],"about_ca_topic_score_codex":0.003626324,"about_ca_topic_score_gemma":0.0027937323,"teacher_disagreement_score":0.003626324,"about_ca_system_score_codex":0.00041093436,"about_ca_system_score_gemma":0.00058283197,"threshold_uncertainty_score":0.0072104335},"labels":[],"label_agreement":null},{"id":"W2152792613","doi":"10.1109/icpr.2008.4761644","title":"Non-dominated Sorting Evolution Strategy-based K-means clustering algorithm for accent classification","year":2008,"lang":"en","type":"article","venue":"Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Stress (linguistics); Sorting; Computer science; Euclidean distance; Artificial intelligence; Pattern recognition (psychology); Correlation clustering; Algorithm; Data mining; Speech recognition","score_opus":0.10908912907059334,"score_gpt":0.30970280222733837,"score_spread":0.20061367315674503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152792613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008326825,0.0001770027,0.9895425,0.00009013271,0.00004369712,0.00006892542,0.000029974592,0.0004686879,0.001252331],"genre_scores_gemma":[0.106510155,0.00015377984,0.8892511,0.00013127895,0.00003775631,0.0002535408,0.00025115543,0.00014471747,0.0032665082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989728,0.0002320252,0.00008152358,0.00021678029,0.0004195744,0.000077354314],"domain_scores_gemma":[0.9993037,0.00016667554,0.000060340215,0.00007361982,0.00036052495,0.000035152425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147101,0.00090060587,0.001072877,0.0017055221,0.0009825933,0.0009466729,0.0020529288,0.0011018174,0.0014937238],"category_scores_gemma":[0.0022292933,0.00036651286,0.0008412043,0.0014708983,0.00072171097,0.0010757784,0.0007892505,0.0009844041,0.0007757457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019995788,0.0001794879,0.002494668,0.0001310602,0.00017652736,0.00007473284,0.00027331535,0.26443273,0.012524155,0.017091874,0.0058466247,0.69657487],"study_design_scores_gemma":[0.000014298128,0.000026960131,0.00042211954,0.00000600899,0.000013019748,0.00003449806,0.000029163535,0.99169886,0.0027262263,0.0032632311,0.0017442266,0.000021405893],"about_ca_topic_score_codex":0.007911093,"about_ca_topic_score_gemma":0.008443547,"teacher_disagreement_score":0.007911093,"about_ca_system_score_codex":0.001177943,"about_ca_system_score_gemma":0.0017351848,"threshold_uncertainty_score":0.015730083},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012114020439931227,"score_gpt":0.2381797935404474,"score_spread":0.22606577310051618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154605267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011803053,0.0001446014,0.9867942,0.00007306633,0.000041354393,0.000037554477,0.000013956222,0.00017613226,0.0009160788],"genre_scores_gemma":[0.29504654,0.00021041924,0.6997357,0.000115107534,0.00007190273,0.0004001713,0.00011532003,0.0000853485,0.004219563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913436,0.00022496862,0.00003921429,0.00016218523,0.0003743519,0.000064994565],"domain_scores_gemma":[0.99916625,0.00034372712,0.00006411235,0.00008989635,0.00028840144,0.000047714097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000959427,0.00077271747,0.0010365963,0.0010792942,0.00040465462,0.000963859,0.0016498561,0.0011038281,0.0011961279],"category_scores_gemma":[0.0023982592,0.0002553015,0.0005810216,0.0011991999,0.00062090595,0.0010398305,0.0007948141,0.0008997469,0.000334839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023455775,0.0002136951,0.0020319861,0.00011612414,0.0001521486,0.00021598686,0.00013169274,0.524657,0.025595056,0.028816408,0.001984637,0.41585073],"study_design_scores_gemma":[0.00006117113,0.000099007346,0.0003764874,0.000006856113,0.00002466289,0.000102166356,0.000011153262,0.99036837,0.0028020425,0.004570629,0.001560805,0.000016629758],"about_ca_topic_score_codex":0.0024721997,"about_ca_topic_score_gemma":0.0018951747,"teacher_disagreement_score":0.0024721997,"about_ca_system_score_codex":0.00088860636,"about_ca_system_score_gemma":0.0008797299,"threshold_uncertainty_score":0.0064472556},"labels":[],"label_agreement":null},{"id":"W2154967161","doi":"10.1109/isit.1994.394951","title":"On the determination of catastrophic convolutional encoders","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Encoder; Convolutional code; Computer science; Coding (social sciences); Software; Theoretical computer science; Algorithm; Computational complexity theory; Encoding (memory); Reduction (mathematics); Programming language; Artificial intelligence; Mathematics; Decoding methods; Statistics; Operating system","score_opus":0.021833029522724156,"score_gpt":0.2211207106192203,"score_spread":0.19928768109649617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154967161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081662916,0.00031077705,0.9047227,0.00024283916,0.00006783727,0.000058716436,0.0001279204,0.0006281738,0.012178152],"genre_scores_gemma":[0.8223618,0.00034056502,0.17372963,0.0002007727,0.00005701295,0.000085319836,0.00028788034,0.00013126497,0.0028057192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978751,0.00062237534,0.00015557099,0.0003761918,0.00071946176,0.00025127828],"domain_scores_gemma":[0.98702455,0.008392808,0.0014955956,0.0007798744,0.0019764996,0.00033070904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020961072,0.00058190443,0.0005259409,0.001249588,0.00088250043,0.001105355,0.0009542075,0.000981393,0.0031254992],"category_scores_gemma":[0.02275644,0.00056452595,0.00052042597,0.00047753126,0.002543584,0.0023052031,0.001804254,0.0012069115,0.0005700657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069946493,0.000056141573,0.010273328,0.00045111947,0.0000914174,0.0013007291,0.0005385457,0.19232966,0.030292876,0.61783254,0.0033829766,0.14275122],"study_design_scores_gemma":[0.00003645531,0.00016166343,0.0016189927,0.00011697594,0.000037185317,0.0010883546,0.00016442017,0.6183294,0.0476748,0.32674623,0.003922482,0.00010305964],"about_ca_topic_score_codex":0.0010441447,"about_ca_topic_score_gemma":0.0009459502,"teacher_disagreement_score":0.0031254992,"about_ca_system_score_codex":0.0009541551,"about_ca_system_score_gemma":0.0010762634,"threshold_uncertainty_score":0.011085391},"labels":[],"label_agreement":null},{"id":"W2155067110","doi":"10.1109/icma.2005.1626689","title":"Evolutionary swarm intelligence applied to robotics","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Evolutionary robotics; Artificial intelligence; Swarm robotics; Robot; Personality; Reinforcement learning; Process (computing); Computer science; Set (abstract data type); Swarm intelligence; Behavior-based robotics; Evolutionary computation; Computational intelligence; Robotics; Machine learning; Psychology; Particle swarm optimization; Social psychology","score_opus":0.012405001247808368,"score_gpt":0.23525834259802902,"score_spread":0.22285334135022067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155067110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038061112,0.020379303,0.94898736,0.0014742751,0.0009595406,0.000077894976,0.0000306631,0.00029373323,0.023991194],"genre_scores_gemma":[0.36627623,0.03960479,0.5682861,0.0008482061,0.0017135084,0.0005534542,0.0001415046,0.0002063625,0.022369798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935704,0.0003039247,0.000043635275,0.00006506214,0.00019903945,0.0000313556],"domain_scores_gemma":[0.99948776,0.0003183206,0.000033832308,0.00005934477,0.00007414467,0.00002659271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008562127,0.0012073691,0.0012772663,0.0010934268,0.0006083921,0.001318283,0.0007660789,0.0015331651,0.00245953],"category_scores_gemma":[0.0024728994,0.00042667578,0.0008935142,0.0013859122,0.0024419276,0.001231465,0.0015524928,0.0020894085,0.00067359034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021907254,0.000025338031,0.00048450436,0.00060153037,0.00013211083,0.0003349667,0.00030895535,0.20231107,0.0027005167,0.69514835,0.0033400496,0.09459074],"study_design_scores_gemma":[0.00002508002,0.000055329463,0.0002946002,0.00016493344,0.000038089194,0.00021697032,0.00007723989,0.34656852,0.00079917605,0.60873336,0.04299064,0.000036151792],"about_ca_topic_score_codex":0.0013636943,"about_ca_topic_score_gemma":0.0007338022,"teacher_disagreement_score":0.00245953,"about_ca_system_score_codex":0.0008601103,"about_ca_system_score_gemma":0.0005864914,"threshold_uncertainty_score":0.008227944},"labels":[],"label_agreement":null},{"id":"W2155400236","doi":"10.1109/coginf.2002.1039287","title":"System modeling and design using genetic programming","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Genetic programming; Computer science; Nonlinear system; Chaotic; Series (stratigraphy); Algorithm; Noise (video); Path (computing); Code (set theory); Piecewise; Radar; Dynamical systems theory; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.047107555035144834,"score_gpt":0.25365768666078253,"score_spread":0.2065501316256377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155400236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020625247,0.00016219237,0.9952526,0.0001241071,0.000018358247,0.00006345575,0.000027865772,0.00014854681,0.0021403106],"genre_scores_gemma":[0.15674005,0.001176739,0.8369491,0.00016508416,0.000051347506,0.0009490479,0.00021037643,0.000090378286,0.003667839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993907,0.00024912515,0.00003087688,0.000110577515,0.00017509499,0.000043621098],"domain_scores_gemma":[0.9993537,0.00042414176,0.00006475403,0.000051496794,0.00008955926,0.000016205855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012020132,0.0011077896,0.0008619944,0.0008556194,0.00037700107,0.0012256701,0.0010777952,0.0013137107,0.002589958],"category_scores_gemma":[0.00230975,0.00047308387,0.0011129561,0.000663938,0.0009900753,0.0006860848,0.0007722975,0.0011238898,0.00058836595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008749713,0.000014056685,0.00019356895,0.00007869036,0.000029531468,0.000049455142,0.00003571032,0.9568361,0.0008393158,0.02315116,0.00026724773,0.01849632],"study_design_scores_gemma":[0.000010497518,0.000020027957,0.00003794757,0.000018179458,0.000011058085,0.000019808978,0.00000914335,0.98188615,0.00045604276,0.015311209,0.0022136238,0.000006229689],"about_ca_topic_score_codex":0.0034607733,"about_ca_topic_score_gemma":0.0029104718,"teacher_disagreement_score":0.0034607733,"about_ca_system_score_codex":0.0008082203,"about_ca_system_score_gemma":0.001508119,"threshold_uncertainty_score":0.00866431},"labels":[],"label_agreement":null},{"id":"W2155832050","doi":"","title":"Using genetic programming to synthesize monotonic stochastic processes","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Genetic programming; Computer science; Monotonic function; Set (abstract data type); Programming language; Series (stratigraphy); Interpreter; Stochastic process; Theoretical computer science; Process calculus; Stochastic calculus; Genetic algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","score_opus":0.05219381325565875,"score_gpt":0.3324311843105771,"score_spread":0.28023737105491836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155832050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08543838,0.00013392276,0.9104877,0.000110915906,0.00003222353,0.00008207703,0.00002301125,0.0005852078,0.0031065722],"genre_scores_gemma":[0.5781585,0.00021033044,0.41939038,0.00005892445,0.00001282969,0.00021904576,0.000081503706,0.00014963487,0.0017188139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952185,0.00013251048,0.000028852679,0.0001070148,0.00016600135,0.00004380735],"domain_scores_gemma":[0.9985261,0.0010959996,0.00012625463,0.0001133636,0.00010178365,0.000036412206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094872806,0.00055651204,0.00037744734,0.0004913152,0.00036065746,0.00054567464,0.0006508711,0.00059166184,0.00083165494],"category_scores_gemma":[0.004666635,0.00034274964,0.0005498294,0.0004016579,0.0010763449,0.00045001178,0.00059059024,0.00069228665,0.00015125294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006400422,0.00008096286,0.0010274195,0.000097556156,0.00004221514,0.00025777618,0.00021779777,0.8601613,0.022414263,0.059200812,0.00024716018,0.056188717],"study_design_scores_gemma":[0.00003084617,0.000052827847,0.000118901204,0.000012059631,0.000018163297,0.000044982677,0.000015173137,0.9609091,0.009279427,0.027987525,0.0015198358,0.000011152369],"about_ca_topic_score_codex":0.0014349909,"about_ca_topic_score_gemma":0.0015311262,"teacher_disagreement_score":0.0014349909,"about_ca_system_score_codex":0.00062908133,"about_ca_system_score_gemma":0.0008103286,"threshold_uncertainty_score":0.0050174},"labels":[],"label_agreement":null},{"id":"W2155865786","doi":"10.1145/1569901.1570044","title":"Evolving stochastic processes using feature tests and genetic programming","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Genetic programming; Computer science; Feature (linguistics); Artificial intelligence; Machine learning","score_opus":0.01439480686996151,"score_gpt":0.26209389104461506,"score_spread":0.24769908417465356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155865786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05938407,0.000118392796,0.93788266,0.00020072126,0.000018026947,0.000060591046,0.00002762768,0.00023066152,0.002077274],"genre_scores_gemma":[0.66641015,0.00015651969,0.33184335,0.00007813959,0.000025604973,0.0002799194,0.000095646734,0.000081488775,0.0010291832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998865,0.0005539945,0.00006274016,0.00017774572,0.0002601286,0.00008035127],"domain_scores_gemma":[0.99315506,0.0057617812,0.00049826485,0.00020859898,0.0002978594,0.00007834071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025168841,0.000831691,0.000903418,0.0012649478,0.00039450038,0.0012713798,0.0010948125,0.0011228187,0.0009014463],"category_scores_gemma":[0.013236437,0.00038782627,0.00093669456,0.00092957314,0.0017877477,0.0012804045,0.00096983183,0.0010489639,0.00012044273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024942552,0.00003399308,0.0010468445,0.000035452307,0.000033570916,0.000072118826,0.00006678628,0.93068653,0.0012181147,0.04343864,0.00009658825,0.023246482],"study_design_scores_gemma":[0.000007837567,0.000019765488,0.00009880803,0.000005034648,0.000007005265,0.00001181268,0.0000062533277,0.97544277,0.00041420228,0.023816435,0.00016376238,0.000006284332],"about_ca_topic_score_codex":0.00248736,"about_ca_topic_score_gemma":0.001694588,"teacher_disagreement_score":0.0025168841,"about_ca_system_score_codex":0.0012863746,"about_ca_system_score_gemma":0.00094597996,"threshold_uncertainty_score":0.013310671},"labels":[],"label_agreement":null},{"id":"W2156547919","doi":"10.1109/ccece.2002.1013042","title":"Intelligence in architectures: reconfigurable learning techniques in autonomous agents","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Merge (version control); Evolvable hardware; Field-programmable gate array; Reconfigurable computing; Computer architecture; Genetic algorithm; Decomposition; Functional decomposition; Logic gate; Boolean circuit; Theoretical computer science; Computer engineering; Embedded system; Parallel computing; Algorithm; Machine learning","score_opus":0.01802214600495692,"score_gpt":0.2689420303442119,"score_spread":0.25091988433925494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156547919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072216983,0.0044044033,0.95753163,0.0019130934,0.00017398351,0.00006906937,0.00001969566,0.0003027496,0.02836364],"genre_scores_gemma":[0.33930197,0.0066186246,0.6374112,0.00081037416,0.0004263985,0.00044978727,0.00007212901,0.00011914664,0.014790354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963605,0.00013444066,0.000018711089,0.00007075619,0.00011361395,0.000026414886],"domain_scores_gemma":[0.99958724,0.00022063525,0.000039046332,0.00007489646,0.00004899217,0.000029146287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061722304,0.0004980915,0.00045240446,0.00048692472,0.00041793802,0.0017425872,0.0010097711,0.0013111151,0.0022854132],"category_scores_gemma":[0.0015295765,0.0002631041,0.000485731,0.0005233423,0.0021560222,0.00229089,0.0012326714,0.001572049,0.0006698428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026195514,0.000040685973,0.00035309824,0.00022489992,0.00005811197,0.00014457387,0.00038671494,0.088922046,0.0036583156,0.8160849,0.002595588,0.08750483],"study_design_scores_gemma":[0.000038823775,0.00007566472,0.00021305111,0.00010982611,0.000033103075,0.00018105107,0.00013032848,0.2873984,0.0028241787,0.65079635,0.058167476,0.000031793712],"about_ca_topic_score_codex":0.0006383939,"about_ca_topic_score_gemma":0.0007522237,"teacher_disagreement_score":0.0022854132,"about_ca_system_score_codex":0.0005491391,"about_ca_system_score_gemma":0.00048605286,"threshold_uncertainty_score":0.007645488},"labels":[],"label_agreement":null},{"id":"W2157880479","doi":"10.1145/2576768.2598303","title":"Automatic design of sound synthesizers as pure data patches using coevolutionary mixed-typed cartesian genetic programming","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Council for the Arts","keywords":"Computer science; Set (abstract data type); Mel-frequency cepstrum; Genetic algorithm; Population; Cepstrum; Fitness function; Genetic programming; Noise (video); Speech recognition; Artificial intelligence; Programming language; Machine learning; Feature extraction","score_opus":0.04763265770930345,"score_gpt":0.27596942713923117,"score_spread":0.22833676942992773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157880479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046008356,0.000063403815,0.9514667,0.000051021863,0.00001759858,0.00006205817,0.000014172462,0.0005012958,0.001815407],"genre_scores_gemma":[0.36428416,0.00009958849,0.6328879,0.000065936816,0.000008530738,0.00025392088,0.00005989627,0.0001775113,0.0021625396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969995,0.00008412345,0.000018043957,0.00008455279,0.00008056612,0.000032841082],"domain_scores_gemma":[0.99953544,0.0002475072,0.000038527614,0.000055287455,0.0000968489,0.000026465052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062826916,0.0005400466,0.00045776952,0.00044901227,0.00024824715,0.00076146476,0.0010202214,0.0005992665,0.0017515037],"category_scores_gemma":[0.001811284,0.00037904672,0.00060718786,0.00028644988,0.0006914209,0.0005385294,0.00081785914,0.00062718056,0.0002711378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015701751,0.000111900205,0.002245251,0.00017529118,0.00006573395,0.0002451439,0.00047482396,0.7202724,0.07980302,0.03411999,0.0007274874,0.16160195],"study_design_scores_gemma":[0.000023235967,0.0000602986,0.00013428192,0.000009147381,0.00001904548,0.000050351926,0.0000329916,0.9866115,0.006537529,0.0049879104,0.0015276024,0.0000060980033],"about_ca_topic_score_codex":0.0010270557,"about_ca_topic_score_gemma":0.001031337,"teacher_disagreement_score":0.0017515037,"about_ca_system_score_codex":0.00041149746,"about_ca_system_score_gemma":0.00047156794,"threshold_uncertainty_score":0.005859375},"labels":[],"label_agreement":null},{"id":"W2159270208","doi":"10.1145/1143997.1144162","title":"Pareto-coevolutionary genetic programming classifier","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Mitacs","keywords":"Classifier (UML); Artificial intelligence; Computer science; Genetic programming; Machine learning; Pareto principle; Pareto optimal; Pattern recognition (psychology); Coevolution; Multi-objective optimization; Mathematics; Mathematical optimization","score_opus":0.010063946008717916,"score_gpt":0.2214311828401011,"score_spread":0.2113672368313832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159270208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029342934,0.00018975427,0.96342534,0.00019974039,0.000066970024,0.00008969539,0.000047306236,0.0004542887,0.0061839907],"genre_scores_gemma":[0.41160178,0.0002867723,0.5785957,0.0002856009,0.00008403772,0.0003812861,0.00025772577,0.000089711604,0.008417416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956244,0.00012249438,0.000022305885,0.00007377216,0.00017748603,0.00004145258],"domain_scores_gemma":[0.9988998,0.000539897,0.000053028496,0.00012286218,0.00034684213,0.000037570964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013666775,0.00047560537,0.00085747,0.0007705516,0.00041784224,0.0008751453,0.0013191685,0.00096815533,0.0016417501],"category_scores_gemma":[0.0038754258,0.00020786605,0.00051407557,0.000855308,0.00046585832,0.0006772759,0.00069294707,0.0010775524,0.00048521016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000664023,0.00012081283,0.0023236803,0.000066100925,0.000077861936,0.000118259144,0.00009471193,0.5206205,0.0032042456,0.025448175,0.0031168174,0.44474235],"study_design_scores_gemma":[0.0000045501715,0.000027996715,0.00015265067,0.000005008723,0.0000073237247,0.000039790026,0.000005813612,0.99507684,0.0005635359,0.0032353848,0.00087825174,0.000002935963],"about_ca_topic_score_codex":0.0021251673,"about_ca_topic_score_gemma":0.002018353,"teacher_disagreement_score":0.0021251673,"about_ca_system_score_codex":0.00057752756,"about_ca_system_score_gemma":0.0008472836,"threshold_uncertainty_score":0.0072277784},"labels":[],"label_agreement":null},{"id":"W2160149488","doi":"10.1109/icnn.1996.549071","title":"Neurosolver solves blocks world problems","year":2002,"lang":"en","type":"article","venue":"Proceedings of International Conference on Neural Networks (ICNN'96)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Construct (python library); Problem solver; Task (project management); Solver; Process (computing); Artificial intelligence; Neuromorphic engineering; Control (management); Space (punctuation); State (computer science); Theoretical computer science; Programming language; Software engineering; Artificial neural network; Engineering","score_opus":0.04199792720959844,"score_gpt":0.24971038111181648,"score_spread":0.20771245390221804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160149488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18337736,0.0006744047,0.75484794,0.0015193496,0.00024735546,0.00031889454,0.0002867642,0.0024828273,0.056245055],"genre_scores_gemma":[0.51952386,0.0004784902,0.44032365,0.00030933938,0.00007980786,0.0004500627,0.00046848998,0.00047309106,0.037893195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983704,0.000040485997,0.000007951118,0.00003759607,0.00004939922,0.000027504719],"domain_scores_gemma":[0.99970704,0.00015983163,0.000025215393,0.000039886443,0.00003174256,0.00003628102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033527406,0.0006855234,0.0006225517,0.00030219136,0.000521387,0.0007580221,0.0009186591,0.00093493494,0.0077710594],"category_scores_gemma":[0.001300335,0.00024810186,0.00046827094,0.00022861434,0.00074279093,0.001138334,0.0013960175,0.00084274757,0.00085068203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024220519,0.00020125622,0.0012125388,0.00030605067,0.00009156926,0.00038156591,0.00034397587,0.5510232,0.010552444,0.20565759,0.018032538,0.21195504],"study_design_scores_gemma":[0.000068342924,0.00011459101,0.00014622822,0.000016154245,0.000013953933,0.00007755715,0.000084916275,0.91513413,0.0048689106,0.060540836,0.018922402,0.00001194388],"about_ca_topic_score_codex":0.0018974807,"about_ca_topic_score_gemma":0.0037844307,"teacher_disagreement_score":0.0077710594,"about_ca_system_score_codex":0.0005186588,"about_ca_system_score_gemma":0.0007233253,"threshold_uncertainty_score":0.025996745},"labels":[],"label_agreement":null},{"id":"W2160726062","doi":"10.1145/1389095.1389330","title":"Genetic programming with polymorphic types and higher-order functions","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Genetic programming; Computer science; Order (exchange); Artificial intelligence; Business","score_opus":0.013618625809282529,"score_gpt":0.2054709236671315,"score_spread":0.19185229785784896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160726062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111162895,0.00015114757,0.98332614,0.0002934099,0.000058793954,0.000024009925,0.000023162524,0.00028238166,0.0047245673],"genre_scores_gemma":[0.24051212,0.0006811944,0.7509046,0.00025704122,0.000103592116,0.00018513718,0.00009670933,0.00022137955,0.0070381993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877244,0.0004504948,0.00007259019,0.00021174074,0.0004079281,0.00008479146],"domain_scores_gemma":[0.99857116,0.0007878623,0.00013653444,0.00032848094,0.00011045354,0.00006546004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016319705,0.00047485405,0.00054485037,0.0006208041,0.00062149705,0.0018746539,0.0012635178,0.0011485924,0.0016818767],"category_scores_gemma":[0.0032035366,0.00032510152,0.0010932158,0.0010088134,0.0034389896,0.0023416725,0.0013478531,0.002709523,0.00042037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022323497,0.00002352526,0.0003129445,0.00005088803,0.000016814443,0.00011749771,0.00031920383,0.03641067,0.0037661798,0.9264825,0.00044351415,0.03203386],"study_design_scores_gemma":[0.000036425074,0.000052687887,0.00020891054,0.0000376756,0.00003550024,0.0002936764,0.000058335358,0.19384821,0.0058514215,0.7664713,0.033065658,0.00004017575],"about_ca_topic_score_codex":0.0009303626,"about_ca_topic_score_gemma":0.0010568001,"teacher_disagreement_score":0.0018746539,"about_ca_system_score_codex":0.0011130425,"about_ca_system_score_gemma":0.0010732444,"threshold_uncertainty_score":0.008630812},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08307800819345276,"score_gpt":0.32984414211450447,"score_spread":0.2467661339210517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161122238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04901284,0.002923209,0.9243235,0.0014610316,0.00006700468,0.00025038785,0.000043608718,0.0005937444,0.021324674],"genre_scores_gemma":[0.34609205,0.0027500994,0.64670783,0.00029450873,0.00006455825,0.00038103812,0.0001182128,0.0004014753,0.0031901663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930801,0.0038115524,0.00056802336,0.0004925786,0.001629614,0.00041820234],"domain_scores_gemma":[0.98920876,0.0076138363,0.00049391016,0.0017575886,0.0006945805,0.00023137353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009502843,0.0007539888,0.00090215437,0.002381221,0.0020329568,0.0049601384,0.0021954463,0.0036287422,0.0012798413],"category_scores_gemma":[0.019126466,0.00078470784,0.0013583209,0.0038876534,0.0068158642,0.0074712513,0.004553701,0.0034720402,0.00032999067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006756382,0.00014278703,0.0034165245,0.00043104423,0.000045135603,0.001128987,0.0031871004,0.029032687,0.0023958152,0.8546883,0.0016084696,0.10385561],"study_design_scores_gemma":[0.00011208958,0.0005138136,0.002237473,0.00097336975,0.000126805,0.0059151454,0.0020861092,0.20480397,0.012735115,0.59824693,0.17210492,0.00014421536],"about_ca_topic_score_codex":0.0011161907,"about_ca_topic_score_gemma":0.0013739106,"teacher_disagreement_score":0.009502843,"about_ca_system_score_codex":0.0010004906,"about_ca_system_score_gemma":0.0010803775,"threshold_uncertainty_score":0.05025643},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Evolutionary programming; Computer science; Evolutionary computation; Genetic programming; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.02066765419552845,"score_gpt":0.26997851228860686,"score_spread":0.2493108580930784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161148706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007890231,0.00019258146,0.99615026,0.000048022102,0.000033962897,0.000024268971,0.000013331606,0.000082744475,0.0026658892],"genre_scores_gemma":[0.0572358,0.00065429107,0.93168443,0.00012773012,0.000069096655,0.0004883984,0.00008078271,0.00011601203,0.009543541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963367,0.000113616494,0.000014027053,0.00004491826,0.00017385535,0.000019851146],"domain_scores_gemma":[0.99976546,0.00013109845,0.00001411953,0.000021767715,0.000057086618,0.0000104831915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058590306,0.0007943545,0.000749107,0.0007140712,0.0004193016,0.000688567,0.0011360174,0.001042753,0.0034973861],"category_scores_gemma":[0.00091311254,0.00038405566,0.00095685216,0.00093551766,0.000493072,0.0006374433,0.0007867526,0.001311809,0.00079906377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027737726,0.000053677686,0.00025396288,0.00018142778,0.00009303127,0.0001174593,0.000064731474,0.69248873,0.0073387604,0.09255592,0.0034094246,0.20341511],"study_design_scores_gemma":[0.000013234261,0.000028638586,0.000063642336,0.000014119634,0.000010259398,0.000065502885,0.0000047859608,0.97910964,0.0007747151,0.012275662,0.0076278,0.000012058853],"about_ca_topic_score_codex":0.0010086178,"about_ca_topic_score_gemma":0.0012027055,"teacher_disagreement_score":0.0034973861,"about_ca_system_score_codex":0.0004097967,"about_ca_system_score_gemma":0.0005757317,"threshold_uncertainty_score":0.011699915},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09710456400680863,"score_gpt":0.30396370292417885,"score_spread":0.20685913891737023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161213945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1537215,0.00005957661,0.8362226,0.00008410507,0.000029188352,0.000119638,0.00010473337,0.0011852039,0.008473425],"genre_scores_gemma":[0.69914913,0.000057391586,0.29636738,0.000043252832,0.0000053719914,0.00023533443,0.00021918496,0.00027533385,0.003647706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998135,0.000048651087,0.000010169696,0.00003845635,0.00005773868,0.000031552583],"domain_scores_gemma":[0.9995067,0.00026126913,0.000043954573,0.000066652385,0.00009356885,0.00002784679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039017384,0.00037594503,0.00028940718,0.0003452198,0.00022936845,0.0005692727,0.00070089207,0.00043980186,0.0017454156],"category_scores_gemma":[0.0018511923,0.00024032484,0.0004399945,0.00022158599,0.0005262167,0.000440039,0.00065308163,0.0004315375,0.00021343814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011020298,0.00009546783,0.001799397,0.00012822832,0.000029968036,0.00014498294,0.00027164372,0.8133831,0.044913378,0.0557685,0.0011981906,0.08215692],"study_design_scores_gemma":[0.000028088763,0.000088861525,0.00029873443,0.00001563848,0.00001230555,0.000044137687,0.000024995916,0.97775203,0.010218194,0.008801542,0.002702265,0.000013153319],"about_ca_topic_score_codex":0.0010124809,"about_ca_topic_score_gemma":0.0009842962,"teacher_disagreement_score":0.0017454156,"about_ca_system_score_codex":0.00053419644,"about_ca_system_score_gemma":0.0005085316,"threshold_uncertainty_score":0.0058389306},"labels":[],"label_agreement":null},{"id":"W2161383373","doi":"10.1109/nafips.2004.1336316","title":"Scheduling exploration/exploitation levels in genetically-generated fuzzy knowledge bases","year":2004,"lang":"en","type":"article","venue":"IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04.","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Crossover; Computer science; Scheduling (production processes); Fuzzy set; Fuzzy logic; Genetic algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","score_opus":0.027515157255777075,"score_gpt":0.2713248296591385,"score_spread":0.24380967240336143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161383373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79045695,0.00032077375,0.20637283,0.00013395362,0.000019540563,0.000088403955,0.000018666624,0.0002013588,0.0023874794],"genre_scores_gemma":[0.95668113,0.00008493938,0.0426917,0.000027716225,0.000006225416,0.000061719686,0.000026051539,0.000041637944,0.0003788935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923956,0.0002728708,0.00005268736,0.00009209727,0.00021893436,0.00012389544],"domain_scores_gemma":[0.99337304,0.0051137186,0.0005809606,0.00027733992,0.00049994746,0.00015503567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022279923,0.00045840838,0.00043101044,0.00065397634,0.0004235483,0.0009857833,0.00052724546,0.0006052344,0.0006739801],"category_scores_gemma":[0.013816931,0.00028616135,0.00017793116,0.0004008504,0.0005549737,0.0012661495,0.00054233155,0.00056701945,0.00013656764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000823365,0.0003133814,0.004215884,0.00012841023,0.0000679021,0.00017614379,0.00046369992,0.7952428,0.051758952,0.007044636,0.00017253419,0.13959233],"study_design_scores_gemma":[0.00010200679,0.00070389116,0.0023467124,0.000033254044,0.00007271883,0.0001009861,0.00015582329,0.93974066,0.048902232,0.0070203184,0.000789538,0.00003180755],"about_ca_topic_score_codex":0.0011408883,"about_ca_topic_score_gemma":0.0010678107,"teacher_disagreement_score":0.0022279923,"about_ca_system_score_codex":0.00074651325,"about_ca_system_score_gemma":0.00067852665,"threshold_uncertainty_score":0.011782885},"labels":[],"label_agreement":null},{"id":"W2162320128","doi":"10.1145/1274000.1274004","title":"An abstraction-based genetic programming system","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Genetic programming; Computer science; Programming language; Abstraction; Inductive programming; Recursion (computer science); Answer set programming; Theoretical computer science; Functional reactive programming; Reactive programming; Programming paradigm; Logic programming; Artificial intelligence","score_opus":0.010386384200326533,"score_gpt":0.2586890141189084,"score_spread":0.24830262991858185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162320128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007579923,0.00008642063,0.98679197,0.00018846305,0.000065476226,0.00004004773,0.0000864072,0.0012528313,0.003908411],"genre_scores_gemma":[0.13428493,0.00033295623,0.857048,0.0003005408,0.000053399184,0.00022827205,0.0003298257,0.00025415557,0.0071680704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994012,0.00016729924,0.00004457113,0.00016638433,0.00016432864,0.000056295226],"domain_scores_gemma":[0.9992854,0.00031201806,0.000054021642,0.00016000636,0.000120456934,0.00006815963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011105156,0.00037784534,0.00048797598,0.0006081055,0.000716973,0.0013401181,0.0011608198,0.00084102876,0.0034577635],"category_scores_gemma":[0.0025132464,0.0002560882,0.0009340107,0.00088465656,0.0009833782,0.0012303699,0.0013840714,0.0014859035,0.00089170894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010359735,0.00012136651,0.002168589,0.00015769675,0.000073434065,0.00049758464,0.0006364908,0.21968669,0.01949564,0.5455799,0.004931823,0.20654716],"study_design_scores_gemma":[0.00006366521,0.000085629006,0.00057568995,0.00006002466,0.00008246239,0.00044239813,0.000046967198,0.6452851,0.005865601,0.28072447,0.06669899,0.00006892568],"about_ca_topic_score_codex":0.002548623,"about_ca_topic_score_gemma":0.0017757145,"teacher_disagreement_score":0.0034577635,"about_ca_system_score_codex":0.00074973644,"about_ca_system_score_gemma":0.0015426949,"threshold_uncertainty_score":0.011567354},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.014664619315504774,"score_gpt":0.252159429944485,"score_spread":0.2374948106289802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163467402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13563111,0.0028593668,0.7610515,0.009536823,0.00016318171,0.000067172215,0.00016168253,0.0006053975,0.089923784],"genre_scores_gemma":[0.8987579,0.0012190491,0.092525385,0.0005148495,0.00017080083,0.00010509546,0.0000959773,0.00013407003,0.0064768377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984541,0.00045855876,0.00007418252,0.00048068256,0.00041742815,0.00011505995],"domain_scores_gemma":[0.99754214,0.0011594379,0.00030482077,0.00064589357,0.00018759647,0.00016011797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015087252,0.00044020556,0.00058192445,0.0007001594,0.0010066455,0.0027877847,0.00084202876,0.0012821149,0.0031445962],"category_scores_gemma":[0.007960172,0.0002993234,0.000607697,0.0007840949,0.007944324,0.0058841775,0.0034390893,0.0022600472,0.0003577247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001779002,0.000007615678,0.00047111948,0.000041928997,0.000013251764,0.0000803736,0.0003724158,0.012209187,0.00065666216,0.9621454,0.0006023673,0.023381874],"study_design_scores_gemma":[0.000009529364,0.000018802524,0.00030704556,0.00001149474,0.000006741523,0.00012638675,0.00005348225,0.01832543,0.00028525322,0.97515035,0.0056954483,0.000010042273],"about_ca_topic_score_codex":0.0015796233,"about_ca_topic_score_gemma":0.0009317651,"teacher_disagreement_score":0.0031445962,"about_ca_system_score_codex":0.0011902585,"about_ca_system_score_gemma":0.0007203326,"threshold_uncertainty_score":0.010519683},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010512190578176511,"score_gpt":0.24037666511955413,"score_spread":0.22986447454137762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163533082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1282462,0.0071179736,0.81648463,0.008959912,0.00033326322,0.00009137375,0.00011616853,0.00053682906,0.038113568],"genre_scores_gemma":[0.8745203,0.0036808492,0.115429014,0.00086933846,0.00027886414,0.00009519942,0.00010376313,0.00023482605,0.004787828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978897,0.0011195333,0.0000698073,0.00052336534,0.00024705325,0.00015055013],"domain_scores_gemma":[0.95933855,0.034708813,0.0013520088,0.002477331,0.0011901264,0.00093311426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00798237,0.00088971,0.0011503021,0.0009415304,0.001342142,0.0033335057,0.001796469,0.0026900084,0.0029643928],"category_scores_gemma":[0.045204636,0.00049650355,0.00084851036,0.0010260654,0.005609124,0.00908232,0.0027391764,0.0032933408,0.00052895537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004907317,0.00020314624,0.0065033026,0.0003975264,0.00019083077,0.00014302776,0.00074544665,0.45990533,0.0042736684,0.35010773,0.0031406991,0.17389855],"study_design_scores_gemma":[0.000050729348,0.00028369538,0.0020158486,0.00011379258,0.00007540614,0.00009318754,0.00014526199,0.6974562,0.0029050375,0.29376575,0.0030442746,0.000050793584],"about_ca_topic_score_codex":0.0032269796,"about_ca_topic_score_gemma":0.0014613569,"teacher_disagreement_score":0.00798237,"about_ca_system_score_codex":0.0011305236,"about_ca_system_score_gemma":0.001167315,"threshold_uncertainty_score":0.042215347},"labels":[],"label_agreement":null},{"id":"W2164159770","doi":"10.1109/cec.2008.4630965","title":"The geometry of Tartarus fitness cases","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"University of Guelph","keywords":"Fitness function; Fitness approximation; Metric (unit); Evolutionary algorithm; Computer science; Set (abstract data type); Mathematical optimization; Space (punctuation); Artificial intelligence; Machine learning; Mathematics; Genetic algorithm; Engineering","score_opus":0.022925050597744075,"score_gpt":0.24640187560226115,"score_spread":0.22347682500451707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164159770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20001231,0.0006980597,0.74508154,0.0009750157,0.00007783969,0.0003018181,0.00037385046,0.00056691724,0.051912673],"genre_scores_gemma":[0.82791454,0.0004034746,0.16488948,0.000094209114,0.000032706244,0.00031147385,0.00043200437,0.00015956366,0.0057625887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973367,0.0008274659,0.00024532474,0.00037143254,0.0009527962,0.000266362],"domain_scores_gemma":[0.99485683,0.00258123,0.00065005524,0.0006350233,0.0008724363,0.00040454254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017804445,0.0005956849,0.0006176617,0.002046273,0.0009004386,0.0030890943,0.001302967,0.0008923869,0.0054468852],"category_scores_gemma":[0.013575719,0.0004336629,0.0007419533,0.0009169464,0.002845854,0.002525988,0.0022606323,0.001224649,0.0008203471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034403105,0.00010679876,0.0054627624,0.00017421099,0.00005693213,0.00085988943,0.0006849624,0.33646834,0.007038596,0.52642983,0.0024084018,0.11996521],"study_design_scores_gemma":[0.00011478259,0.0005216112,0.0037631455,0.00009587948,0.0000555813,0.0011239714,0.00039677243,0.6325275,0.0088298,0.32768738,0.024802862,0.00008074039],"about_ca_topic_score_codex":0.002328479,"about_ca_topic_score_gemma":0.0012771788,"teacher_disagreement_score":0.0054468852,"about_ca_system_score_codex":0.0012937173,"about_ca_system_score_gemma":0.0009564274,"threshold_uncertainty_score":0.018221617},"labels":[],"label_agreement":null},{"id":"W2165666048","doi":"10.1109/snpd.2009.82","title":"Creating Objects Using Genetic Programming Techniques","year":2009,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Programming language; Java; Executable; Object-oriented programming; Genetic programming; Suite; Scala; Grammatical evolution; Test suite; Compiler; Artificial intelligence; Test case","score_opus":0.017482279157129146,"score_gpt":0.2792884129720104,"score_spread":0.26180613381488127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165666048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006566046,0.000110275774,0.98753536,0.000099744226,0.000042894095,0.00010939934,0.00003944473,0.00088510435,0.0046118004],"genre_scores_gemma":[0.04371264,0.00030077586,0.9519407,0.00006251391,0.000016731941,0.00025263938,0.00019665556,0.0003264973,0.0031908266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907386,0.00022949926,0.00006324431,0.00021222886,0.00034886997,0.00007225021],"domain_scores_gemma":[0.9990964,0.0004599019,0.00005590153,0.00023405334,0.0001067868,0.000047034682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015695026,0.00071667926,0.0007330445,0.0014754555,0.0010032658,0.0023174898,0.0018665805,0.0012766194,0.0036212448],"category_scores_gemma":[0.0027603987,0.0006480199,0.0014713759,0.0012601226,0.0018750009,0.0017148507,0.0019052975,0.0015366363,0.0010238591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047841484,0.00015162637,0.0019156341,0.00035169127,0.0001381053,0.00057866646,0.0011146847,0.20545831,0.01980724,0.5028168,0.004194661,0.2634247],"study_design_scores_gemma":[0.00009090153,0.00011967404,0.0006338574,0.00016486722,0.00013611896,0.00059698283,0.00023712506,0.5145817,0.021155981,0.34986237,0.112316206,0.00010431856],"about_ca_topic_score_codex":0.001496659,"about_ca_topic_score_gemma":0.001531143,"teacher_disagreement_score":0.0036212448,"about_ca_system_score_codex":0.00082338566,"about_ca_system_score_gemma":0.0010887333,"threshold_uncertainty_score":0.012114286},"labels":[],"label_agreement":null},{"id":"W2166145602","doi":"10.3758/bf03202543","title":"Using genetic programming to discover nonlinear variable interactions","year":2003,"lang":"en","type":"article","venue":"Behavior Research Methods, Instruments, & Computers","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Alberta","funders":"Government of Canada","keywords":"Genetic programming; Computer science; Focus (optics); Genetic representation; Variable (mathematics); Nonlinear programming; Multivariate statistics; Artificial intelligence; Genetic algorithm; Nonlinear system; Machine learning; Theoretical computer science; Mathematics","score_opus":0.20986342437627956,"score_gpt":0.5030617868324138,"score_spread":0.2931983624561342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166145602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2967592,0.00037740733,0.69530565,0.00061686867,0.00007237332,0.00010934769,0.00008364763,0.0004632807,0.006212291],"genre_scores_gemma":[0.8293969,0.00016491079,0.16778316,0.00012821787,0.000029395678,0.00012780841,0.00011482902,0.000069290036,0.002185583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968004,0.00012177472,0.000012464083,0.000062622225,0.000080867874,0.000042168827],"domain_scores_gemma":[0.99793774,0.0016467596,0.00016499325,0.00007421717,0.00012307827,0.000053162054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049901,0.00087533554,0.00083491724,0.001679929,0.00067101914,0.0009424135,0.0010720014,0.0014386695,0.001556714],"category_scores_gemma":[0.0050583924,0.0006500636,0.00085986237,0.00092574075,0.000866208,0.0011981204,0.0009258779,0.0012780105,0.00017629002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099497964,0.00015852037,0.0050494764,0.00006387478,0.00017196822,0.00019515063,0.00014730475,0.91474086,0.0018339192,0.01974542,0.00060419395,0.057189897],"study_design_scores_gemma":[0.000012775188,0.000011815264,0.0001614454,0.000003875423,0.000015956046,0.000009176315,0.000010395063,0.9910772,0.00020647782,0.008380112,0.00010717579,0.0000036668746],"about_ca_topic_score_codex":0.0042107888,"about_ca_topic_score_gemma":0.0047782077,"teacher_disagreement_score":0.0042107888,"about_ca_system_score_codex":0.00076433603,"about_ca_system_score_gemma":0.0008322277,"threshold_uncertainty_score":0.008372605},"labels":[],"label_agreement":null},{"id":"W2166306467","doi":"10.1142/s0129626407003046","title":"HOW SOLUTION DENSITY AFFECTS THE FINDING OF SPATIALLY ROBUST SOLUTIONS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Science Council","keywords":"Robustness (evolution); Mathematical optimization; Computer science; Parameter space; Mathematics; Algorithm; Statistics","score_opus":0.031801629663492925,"score_gpt":0.24488169129398402,"score_spread":0.2130800616304911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166306467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78954947,0.00082891394,0.20282713,0.0006422705,0.000057768186,0.00010634969,0.000106894506,0.00037776362,0.005503376],"genre_scores_gemma":[0.97791207,0.00013400255,0.021414293,0.000036391866,0.000012575301,0.000040287272,0.000046734054,0.000062378625,0.0003413746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973507,0.00091654924,0.00021203524,0.00044638017,0.00082657125,0.00024787796],"domain_scores_gemma":[0.94961494,0.041430473,0.0030730774,0.003156973,0.002176212,0.00054830307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005878791,0.0006038849,0.0009187471,0.001460783,0.00066771335,0.0019265797,0.00095721456,0.0015448661,0.00168212],"category_scores_gemma":[0.061981127,0.0005679687,0.0006657858,0.00079601014,0.0021121195,0.0029649283,0.0017596688,0.0010767822,0.0002653793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068417256,0.00026730757,0.02439209,0.000517467,0.00036691665,0.00074869377,0.00079586,0.77228063,0.082988225,0.031725228,0.0007076275,0.08452588],"study_design_scores_gemma":[0.00012013804,0.0009931448,0.02026032,0.00008858745,0.00025715385,0.0013352695,0.00046677364,0.8723318,0.06440046,0.037460063,0.0021448054,0.00014140853],"about_ca_topic_score_codex":0.0010763459,"about_ca_topic_score_gemma":0.000661758,"teacher_disagreement_score":0.005878791,"about_ca_system_score_codex":0.0006491817,"about_ca_system_score_gemma":0.0005073594,"threshold_uncertainty_score":0.031090379},"labels":[],"label_agreement":null},{"id":"W2166446567","doi":"10.1093/beheco/ars084","title":"We can study how mechanisms evolve without knowing the rules of chess or the workings of the brain","year":2012,"lang":"en","type":"article","venue":"Behavioral Ecology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Biology; Cognitive science; Psychology","score_opus":0.05184726366457516,"score_gpt":0.30707151496916973,"score_spread":0.2552242513045946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166446567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12587664,0.024923127,0.4322944,0.09673458,0.0025202378,0.00013450673,0.0007021981,0.00054073316,0.3162736],"genre_scores_gemma":[0.8128681,0.012536928,0.11871385,0.011751947,0.0007209613,0.00034641128,0.0002707176,0.00020289255,0.04258821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950624,0.00018102411,0.000014260743,0.00016360998,0.00006533975,0.000069498165],"domain_scores_gemma":[0.99827254,0.001025581,0.00014730888,0.00037078912,0.00009145804,0.00009220059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016412969,0.00077166746,0.00061578496,0.00053873373,0.0007636211,0.0033303704,0.0009624596,0.002388662,0.009968881],"category_scores_gemma":[0.003956416,0.00031505793,0.0007091657,0.00031803866,0.0046760645,0.007963034,0.0016594614,0.0034070052,0.0018254989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032791544,0.00007451411,0.0019008121,0.0001889636,0.00007263322,0.00011287783,0.00039978191,0.0076963445,0.0018091276,0.95262134,0.005051489,0.030039402],"study_design_scores_gemma":[0.000013287811,0.000032720156,0.0010596627,0.00011666603,0.000020348905,0.00007113461,0.00021118115,0.0058578975,0.0010009183,0.96317124,0.02842092,0.000023947345],"about_ca_topic_score_codex":0.0018385375,"about_ca_topic_score_gemma":0.0015260848,"teacher_disagreement_score":0.009968881,"about_ca_system_score_codex":0.00077956583,"about_ca_system_score_gemma":0.00091872,"threshold_uncertainty_score":0.033349216},"labels":[],"label_agreement":null},{"id":"W2166780985","doi":"10.1142/s0218001409007466","title":"SOLUTION OVER-FIT CONTROL IN EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION OF PATTERN CLASSIFICATION SYSTEMS","year":2009,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Ministry of Minority Affairs","keywords":"Computer science; Evolutionary algorithm; Artificial intelligence; Multi-objective optimization; Classifier (UML); Feature selection; Memetic algorithm; Optimization problem; Machine learning; Pattern recognition (psychology); Mathematical optimization; Mathematics; Algorithm","score_opus":0.06537619928971737,"score_gpt":0.3104808908962583,"score_spread":0.24510469160654091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166780985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20739445,0.00045782188,0.78923804,0.00019306212,0.000022950571,0.00006196997,0.0000083849645,0.00017181097,0.0024515246],"genre_scores_gemma":[0.92394894,0.00008041022,0.07507722,0.000052592022,0.000008020163,0.000063085456,0.00001002683,0.000026495367,0.00073325547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935704,0.0002728141,0.000041047566,0.00007039042,0.00020397516,0.00005467747],"domain_scores_gemma":[0.99841356,0.0009866583,0.00020813048,0.00010308553,0.00024481094,0.00004364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024569586,0.0005920285,0.000592451,0.00057324144,0.0004187424,0.0008892365,0.00049366965,0.0006911538,0.0005613589],"category_scores_gemma":[0.00638279,0.0002988606,0.0003122429,0.00042995624,0.00074071984,0.0005865096,0.00072433794,0.00052032334,0.00009511767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065489425,0.0000611145,0.00078365067,0.000051238105,0.000032718104,0.000048277267,0.00013324851,0.93275285,0.009801189,0.004645546,0.00011821261,0.051506575],"study_design_scores_gemma":[0.0000069570838,0.000072097486,0.00016520175,0.0000058195947,0.0000043029677,0.000013090729,0.000008910796,0.9966672,0.0017302406,0.001162646,0.00015925145,0.000004252415],"about_ca_topic_score_codex":0.0012468956,"about_ca_topic_score_gemma":0.00083395396,"teacher_disagreement_score":0.0024569586,"about_ca_system_score_codex":0.0005038634,"about_ca_system_score_gemma":0.00038336488,"threshold_uncertainty_score":0.012993813},"labels":[],"label_agreement":null},{"id":"W2168085447","doi":"10.1007/s10710-007-9027-9","title":"Introducing probabilistic adaptive mapping developmental genetic programming with redundant mappings","year":2007,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Probabilistic logic; Genetic programming; Set (abstract data type); Implementation; Encoding (memory); Grammatical evolution; Fitness function; Coevolution; Theoretical computer science; Genetic algorithm; Artificial intelligence; Machine learning; Biology","score_opus":0.010779933300425532,"score_gpt":0.21694746148033825,"score_spread":0.2061675281799127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168085447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007845954,0.00011287423,0.9877824,0.00010147319,0.000029677387,0.000013342068,0.000008766329,0.000100729136,0.004004805],"genre_scores_gemma":[0.2930322,0.00032082328,0.70018417,0.0001176719,0.00003625779,0.00013565902,0.000044352768,0.000113076785,0.006015882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994541,0.00019031837,0.000020495954,0.00010722105,0.00018630456,0.000041496733],"domain_scores_gemma":[0.9993162,0.0003877109,0.00006125124,0.000091562484,0.000109690394,0.00003358692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009389669,0.000495961,0.00039015617,0.0006441652,0.00036211594,0.00076801365,0.0017267335,0.0010073435,0.0020949387],"category_scores_gemma":[0.0035086847,0.00045762683,0.00056841277,0.0007106287,0.0012120607,0.0011291449,0.001958324,0.001192317,0.00032951127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027719703,0.00003586806,0.00054388266,0.0000834457,0.000032906068,0.00014867635,0.00016224546,0.2902733,0.0077764266,0.62834543,0.0007275946,0.07184248],"study_design_scores_gemma":[0.00001151076,0.000035801426,0.000115763556,0.000021224168,0.00001670298,0.00014515614,0.000017861501,0.8488884,0.0030012066,0.14260796,0.0051213726,0.000016998792],"about_ca_topic_score_codex":0.0006439206,"about_ca_topic_score_gemma":0.00078087224,"teacher_disagreement_score":0.0020949387,"about_ca_system_score_codex":0.0006253971,"about_ca_system_score_gemma":0.00062890863,"threshold_uncertainty_score":0.007008195},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.012556102580541509,"score_gpt":0.25219422325505947,"score_spread":0.23963812067451795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168924884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022721756,0.00018223061,0.9748701,0.00009557006,0.00003498854,0.000036033296,0.000012603096,0.00034117934,0.0017056047],"genre_scores_gemma":[0.6148521,0.00026819875,0.38077375,0.000283573,0.00007838289,0.0002297259,0.00011306292,0.0002118626,0.0031894085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988244,0.00046366543,0.00007384969,0.0002317685,0.00033220433,0.0000741149],"domain_scores_gemma":[0.9964585,0.0021177686,0.00028837213,0.00051172817,0.0005501808,0.00007335604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001964797,0.0008945487,0.00086209964,0.0006703844,0.00037199847,0.00089145417,0.0017194942,0.0011481834,0.0013486139],"category_scores_gemma":[0.009179033,0.0004299552,0.0005523123,0.00049488194,0.00075787737,0.0014351269,0.001289244,0.0011150982,0.0005592934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010450006,0.00016960983,0.0022349493,0.0001162074,0.0001667861,0.00014127308,0.00023394596,0.6580369,0.02882021,0.040461928,0.0015942877,0.26791945],"study_design_scores_gemma":[0.000029712377,0.000072356066,0.0002461149,0.000008553313,0.000021184678,0.00007663767,0.0000111923455,0.9854166,0.0033999993,0.009299714,0.0014009933,0.000016920418],"about_ca_topic_score_codex":0.0009952082,"about_ca_topic_score_gemma":0.0009364028,"teacher_disagreement_score":0.001964797,"about_ca_system_score_codex":0.0004440867,"about_ca_system_score_gemma":0.0006885021,"threshold_uncertainty_score":0.010390937},"labels":[],"label_agreement":null},{"id":"W2169464732","doi":"10.1109/cec.2006.1688330","title":"The Y-Test: Fairly Comparing Experimental Setups with Unequal Effort","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Statistic; Set (abstract data type); Test statistic; Computation; Work (physics); Test (biology); Statistical hypothesis testing; Point (geometry); Algorithm; Mathematics; Statistics; Engineering","score_opus":0.009359679556369516,"score_gpt":0.22770951037233608,"score_spread":0.21834983081596657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169464732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102140926,0.000863561,0.883175,0.0019225995,0.0008493187,0.001516774,0.0011575004,0.0016289175,0.0067454553],"genre_scores_gemma":[0.64346695,0.0004097032,0.34172136,0.0020736102,0.0005330241,0.0075620376,0.001412883,0.0013179174,0.0015025375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.7998534,0.15658812,0.0074882302,0.017051566,0.017408868,0.0016097628],"domain_scores_gemma":[0.46657583,0.42510682,0.022755021,0.07594806,0.007718169,0.0018960546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.15987097,0.002112947,0.0035076197,0.004140526,0.0019834107,0.0043997495,0.0047246297,0.0048487377,0.0034688406],"category_scores_gemma":[0.4553856,0.0010169961,0.002933879,0.0039171316,0.009752255,0.010083098,0.0068691205,0.004747083,0.00083607354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.019261437,0.0014925485,0.08066658,0.003312142,0.015707165,0.0006444102,0.0029192597,0.11058805,0.020615153,0.20612417,0.016770698,0.52189845],"study_design_scores_gemma":[0.0028875025,0.009450549,0.05307102,0.00069657166,0.0018389763,0.000841159,0.0015395203,0.29441243,0.033711344,0.58214045,0.01864046,0.00077001937],"about_ca_topic_score_codex":0.0010211709,"about_ca_topic_score_gemma":0.00064687803,"teacher_disagreement_score":0.15987097,"about_ca_system_score_codex":0.002721274,"about_ca_system_score_gemma":0.0020411147,"threshold_uncertainty_score":0.8454886},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.040226336561178175,"score_gpt":0.278419984426947,"score_spread":0.2381936478657688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170657595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62378436,0.00050134165,0.35277095,0.0007634318,0.000035793255,0.00007113853,0.00031144955,0.0012863962,0.020475043],"genre_scores_gemma":[0.877599,0.0002533021,0.116605744,0.00011053905,0.000014796042,0.00011487317,0.00033190128,0.00017414048,0.0047958246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997423,0.00009757713,0.000013803896,0.00005066862,0.000071652576,0.000024022476],"domain_scores_gemma":[0.9992878,0.00044885895,0.00010753373,0.00006463605,0.00006415636,0.000027005926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303112,0.00018189268,0.00017172523,0.000374244,0.00034769136,0.0006988298,0.00039365175,0.00037263503,0.0020850038],"category_scores_gemma":[0.0024994153,0.0001728436,0.00021857941,0.00056710915,0.0006483411,0.0005197706,0.00033909257,0.0005138189,0.00027027578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026764045,0.00013948092,0.003932057,0.00031729272,0.00005267859,0.0009542792,0.0009507039,0.37198126,0.04777731,0.43408674,0.0020903898,0.13745019],"study_design_scores_gemma":[0.000060804723,0.00021757571,0.0019746711,0.000039185164,0.00003118889,0.0006878513,0.00019150077,0.5576389,0.015965318,0.413928,0.009224834,0.000040198014],"about_ca_topic_score_codex":0.0010160587,"about_ca_topic_score_gemma":0.00089015544,"teacher_disagreement_score":0.0020850038,"about_ca_system_score_codex":0.00038793738,"about_ca_system_score_gemma":0.0003336612,"threshold_uncertainty_score":0.006974995},"labels":[],"label_agreement":null},{"id":"W2182921912","doi":"10.32920/ryerson.14651808.v1","title":"A Study on Financial Time Series Forecasting and Symbolic Regression by means of a Hybrid Probabilistic Model-Building Cartesian Genetic Programming Methodology","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Symbolic regression; Probabilistic logic; Genetic programming; Computer science; Hidden Markov model; Markov chain; Representation (politics); Statistical model; Stock market; Econometrics; Artificial intelligence; Machine learning; Mathematics; Geography","score_opus":0.060633634333013824,"score_gpt":0.30307290876519427,"score_spread":0.24243927443218044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182921912","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029518599,0.0004468558,0.9671202,0.00015300434,0.000029071542,0.00002726493,0.000012211099,0.00011699061,0.0025758268],"genre_scores_gemma":[0.4785557,0.00080200675,0.51800424,0.0000852087,0.00004570124,0.000102069615,0.00006591687,0.000069668255,0.0022694631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954635,0.00021569534,0.000016264506,0.00007555432,0.00012075527,0.000025462805],"domain_scores_gemma":[0.9988996,0.00084258954,0.00004370124,0.00005568659,0.00013264868,0.000025804024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013184381,0.0005113288,0.00051790074,0.000499209,0.0002574837,0.00059330004,0.00086203095,0.00071557536,0.0010757784],"category_scores_gemma":[0.003159923,0.00031019383,0.00060507836,0.0007992339,0.0006563791,0.0008581709,0.0005440289,0.000997218,0.00015118084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030846517,0.000055629145,0.0010029934,0.00011031865,0.000045471526,0.000059407826,0.00013144102,0.86076933,0.002090672,0.038630493,0.0003480443,0.096725255],"study_design_scores_gemma":[0.0000041363114,0.000037198162,0.00010252061,0.0000056480685,0.0000065472573,0.000021764354,0.0000070967,0.99561334,0.00038119845,0.003235552,0.0005817221,0.000003256464],"about_ca_topic_score_codex":0.004490878,"about_ca_topic_score_gemma":0.002115628,"teacher_disagreement_score":0.004490878,"about_ca_system_score_codex":0.00047015367,"about_ca_system_score_gemma":0.00082372554,"threshold_uncertainty_score":0.008929491},"labels":[],"label_agreement":null},{"id":"W2184042660","doi":"","title":"A computationally efficient modelling-to-generate-alternatives method using the firefly algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Firefly algorithm; Mathematical optimization; Algorithm; Mathematics","score_opus":0.056110026474821,"score_gpt":0.3348455909854567,"score_spread":0.2787355645106357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184042660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003036759,0.00008833723,0.99462223,0.00012896639,0.000029096818,0.00007519566,0.000016819498,0.00021517198,0.0017874093],"genre_scores_gemma":[0.056127433,0.00009992081,0.9417314,0.000101251295,0.000022569562,0.00032206313,0.00004719137,0.000060573428,0.001487735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.00029845268,0.000019934934,0.00006421723,0.00019434156,0.00004525185],"domain_scores_gemma":[0.99930286,0.0005049188,0.00004842969,0.00003759957,0.00007301864,0.000033099743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019476616,0.0010951181,0.001203889,0.0011537205,0.00079390116,0.0007957049,0.0017175734,0.0017748576,0.0033170779],"category_scores_gemma":[0.0028957373,0.000618157,0.0011950516,0.00095685263,0.00080432807,0.00093163335,0.0012577903,0.0017360846,0.00045292033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095543335,0.000095854186,0.0004003893,0.00011082713,0.00008871626,0.00009446787,0.0001127499,0.83538735,0.004014366,0.04711718,0.0026772728,0.10980523],"study_design_scores_gemma":[0.000032814256,0.000033197008,0.000035906647,0.0000077047125,0.000011159197,0.00002415021,0.0000062019317,0.99252033,0.0005649655,0.0052325088,0.001522161,0.000008918091],"about_ca_topic_score_codex":0.003681327,"about_ca_topic_score_gemma":0.0042062444,"teacher_disagreement_score":0.003681327,"about_ca_system_score_codex":0.0010179756,"about_ca_system_score_gemma":0.0017215442,"threshold_uncertainty_score":0.0110967755},"labels":[],"label_agreement":null},{"id":"W2184191074","doi":"","title":"An Evolutionary Approach to Behavioral-Level Synthesis","year":2003,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scheduling (production processes); High-level synthesis; Fitness function; Theoretical computer science; Mathematical optimization; Genetic algorithm; Field-programmable gate array; Mathematics; Machine learning","score_opus":0.050532267507820555,"score_gpt":0.28347590627638886,"score_spread":0.2329436387685683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184191074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062089157,0.00018672392,0.9866197,0.0002233361,0.00002884763,0.000032745593,0.000013524765,0.00011435287,0.0065718675],"genre_scores_gemma":[0.2045431,0.0004988935,0.7876168,0.00018505259,0.00004356316,0.00017490711,0.00007024253,0.00007556398,0.006791914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.000112532136,0.000015359748,0.00005499761,0.0001278739,0.000035154793],"domain_scores_gemma":[0.99971694,0.00013467704,0.000022504773,0.000047224265,0.00006215136,0.000016416803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005905292,0.00046155395,0.00031268704,0.00053666625,0.00050777086,0.0007649722,0.0009909185,0.0007186486,0.002391673],"category_scores_gemma":[0.0012734903,0.00027658002,0.0005825365,0.00045175655,0.0011188559,0.0005715014,0.0006669133,0.0009161239,0.00030129464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018129596,0.000052925705,0.00064863596,0.0001050697,0.000053727028,0.000115604016,0.00018595732,0.556533,0.009993204,0.31112406,0.0008234476,0.12034629],"study_design_scores_gemma":[0.000018991546,0.000045230765,0.00023734533,0.00002612845,0.00002798483,0.000074327196,0.000041915482,0.8729434,0.0022250786,0.11316704,0.0111809,0.000011639564],"about_ca_topic_score_codex":0.0020120123,"about_ca_topic_score_gemma":0.0028109336,"teacher_disagreement_score":0.002391673,"about_ca_system_score_codex":0.00087643636,"about_ca_system_score_gemma":0.0009840745,"threshold_uncertainty_score":0.00800091},"labels":[],"label_agreement":null},{"id":"W2189373833","doi":"","title":"Evolvability and Acceleration in Evolutionary Computation","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Human-based evolutionary computation; Evolutionary computation; Computer science; Evolutionary algorithm; Evolutionary theory; Interactive evolutionary computation; Artificial intelligence; Evolutionary biology; Evolutionary programming; Biology; Epistemology","score_opus":0.02608097211931804,"score_gpt":0.2551749405873212,"score_spread":0.22909396846800317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189373833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12924361,0.029146234,0.7350516,0.0052064382,0.00078003266,0.00014741637,0.00007953745,0.0005536437,0.099791385],"genre_scores_gemma":[0.86965674,0.0095781945,0.10979625,0.00042395724,0.0006399399,0.00015975522,0.000059862123,0.00015936019,0.009525903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989618,0.00040727033,0.000068354806,0.00018709287,0.0002735152,0.00010193067],"domain_scores_gemma":[0.99732685,0.0018407345,0.00017806828,0.00035812455,0.00021300135,0.000083074265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017317423,0.00068461813,0.00063307956,0.0010878496,0.0005785986,0.0021818557,0.00091316557,0.0016799346,0.0033806444],"category_scores_gemma":[0.008385733,0.00038927342,0.00075271813,0.00090541807,0.0040097353,0.00450537,0.0015455429,0.0020381662,0.00053129136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047975063,0.000017163064,0.0006043978,0.0001436528,0.000025454689,0.00010403569,0.00019787761,0.038980596,0.0023524761,0.9269511,0.0004446747,0.030130759],"study_design_scores_gemma":[0.000029961995,0.00008274413,0.000541629,0.00006833227,0.000020730844,0.00027386658,0.000052233918,0.07593249,0.0017005614,0.91090816,0.010365354,0.000023883777],"about_ca_topic_score_codex":0.0002967103,"about_ca_topic_score_gemma":0.00016749329,"teacher_disagreement_score":0.0033806444,"about_ca_system_score_codex":0.00071753556,"about_ca_system_score_gemma":0.00037672764,"threshold_uncertainty_score":0.011309445},"labels":[],"label_agreement":null},{"id":"W2190165019","doi":"10.1007/978-3-642-29142-5_2","title":"Aesthetic 3D Model Evolution","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Realm; Genetic programming; Evolutionary algorithm; Artificial intelligence; Entropy (arrow of time); Normality; Machine learning; Theoretical computer science; Mathematics; Statistics","score_opus":0.016613435031731957,"score_gpt":0.237412830465703,"score_spread":0.22079939543397104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190165019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015771247,0.0009744894,0.81991524,0.0005733141,0.0006904249,0.00008556541,0.0003321025,0.002222037,0.15943554],"genre_scores_gemma":[0.38777527,0.0019892522,0.44877774,0.00062043074,0.00023077532,0.00021925148,0.0011978114,0.0026719726,0.15651754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.000023820416,0.0000047765066,0.000028431297,0.00011202217,0.0000145449585],"domain_scores_gemma":[0.9998667,0.00003715095,0.000006406726,0.00005217016,0.0000230529,0.000014528041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022367277,0.0005554429,0.00043812787,0.00062188896,0.00035137328,0.0012169644,0.00089946354,0.00092387316,0.02579125],"category_scores_gemma":[0.00066550664,0.00044841625,0.00082622975,0.00044303722,0.00068373594,0.00079955277,0.0018204369,0.0011213196,0.003397778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009109501,0.000045612687,0.00038678828,0.00029195656,0.000068031964,0.00024973904,0.00024511732,0.3193453,0.028831553,0.33526376,0.031088136,0.2840929],"study_design_scores_gemma":[0.00003566471,0.000074690484,0.0003707201,0.00008442493,0.000029877263,0.00085695524,0.000057778074,0.6858844,0.00751698,0.1647949,0.14024325,0.000050289305],"about_ca_topic_score_codex":0.0004774566,"about_ca_topic_score_gemma":0.00089598435,"teacher_disagreement_score":0.02579125,"about_ca_system_score_codex":0.0004611401,"about_ca_system_score_gemma":0.0002051962,"threshold_uncertainty_score":0.086280346},"labels":[],"label_agreement":null},{"id":"W2191710555","doi":"10.1609/aaai.v28i1.9099","title":"Genotypic versus Behavioural Diversity for Teams of Programs under the 4-v-3 Keepaway Soccer Task","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Neuroevolution; Task (project management); Diversity (politics); Benchmark (surveying); Computer science; Reinforcement learning; Genetic programming; Artificial intelligence; Perspective (graphical); Function (biology); Machine learning; Variation (astronomy); Domain (mathematical analysis); Artificial neural network; Mathematics; Engineering; Biology; Sociology","score_opus":0.09984402336368582,"score_gpt":0.29562060442139904,"score_spread":0.19577658105771323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191710555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9377283,0.00017125059,0.05650172,0.00032594058,0.000020923064,0.00003780091,0.00010990831,0.00007009802,0.005034038],"genre_scores_gemma":[0.98995274,0.000037512953,0.008847989,0.000032622636,0.000009956537,0.00004201304,0.00012302265,0.000027391749,0.00092680607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992599,0.00029298707,0.000028418342,0.00016894031,0.00012702023,0.00012272387],"domain_scores_gemma":[0.99455464,0.0033250588,0.00069333793,0.00039398804,0.00038363368,0.00064935314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018721118,0.00036782425,0.0004611832,0.0004906679,0.00048493344,0.0009962252,0.0007180893,0.00078834244,0.0019485024],"category_scores_gemma":[0.011185127,0.00014586243,0.00037695505,0.00024892855,0.0010340554,0.0012098639,0.0014194639,0.000898455,0.00009568671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091511355,0.00031318318,0.01668635,0.000115647614,0.000097061464,0.00021534723,0.00044675657,0.8963357,0.0063396683,0.029212011,0.0010941931,0.04822891],"study_design_scores_gemma":[0.00004126764,0.0003794619,0.0062597315,0.000018039298,0.000025374213,0.00007212148,0.0002225525,0.9709008,0.0009825847,0.020557946,0.00052206207,0.00001802578],"about_ca_topic_score_codex":0.0021723257,"about_ca_topic_score_gemma":0.0018900604,"teacher_disagreement_score":0.0021723257,"about_ca_system_score_codex":0.00090822746,"about_ca_system_score_gemma":0.00059853273,"threshold_uncertainty_score":0.009900749},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Synchronization (alternating current); Parallel computing; Theoretical computer science; Distributed computing; Programming language; Artificial intelligence","score_opus":0.009439915812976206,"score_gpt":0.21800485307398076,"score_spread":0.20856493726100456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199868482","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053646103,0.01855243,0.39696062,0.005032431,0.001896238,0.00007932035,0.000117494485,0.00027254855,0.57172436],"genre_scores_gemma":[0.14938681,0.0250952,0.30011225,0.0022016007,0.0013897815,0.00036039457,0.00026075827,0.00050635147,0.520687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.0000628766,0.000004842829,0.00002634172,0.00006794387,0.0000106797315],"domain_scores_gemma":[0.99984837,0.000085561034,0.000006456339,0.000024577761,0.0000252468,0.000009770383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027076143,0.00061507546,0.00043796707,0.000517057,0.0004773574,0.0015117876,0.00083646807,0.0009318232,0.012081761],"category_scores_gemma":[0.0008373732,0.0002477742,0.000328371,0.0008741232,0.0024842904,0.0016834586,0.00072784885,0.0016958008,0.0024020828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036520316,0.000009607884,0.000027169754,0.000062823055,0.0000048385346,0.00001697764,0.00007885331,0.0059423484,0.00031226047,0.9387688,0.010088927,0.04468366],"study_design_scores_gemma":[0.0000048801558,0.000009956866,0.000041088042,0.000075982876,0.0000043233727,0.00004523242,0.000032928758,0.009101548,0.00032581724,0.85292935,0.13742207,0.000006715919],"about_ca_topic_score_codex":0.0008670845,"about_ca_topic_score_gemma":0.0011828667,"teacher_disagreement_score":0.012081761,"about_ca_system_score_codex":0.0009083395,"about_ca_system_score_gemma":0.0009106519,"threshold_uncertainty_score":0.040417552},"labels":[],"label_agreement":null},{"id":"W2209968826","doi":"10.1007/0-387-28111-8_14","title":"Evolution on Neutral Networks in Genetic Programming","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Genetic programming; Neutral network; Parallels; Computer science; Simple (philosophy); Genetic network; Genetic algorithm; Neutral theory of molecular evolution; Evolutionary programming; Population; Theoretical computer science; Boolean network; Mathematical optimization; Boolean function; Mathematics; Artificial intelligence; Algorithm; Biology; Machine learning; Genetics; Engineering; Artificial neural network","score_opus":0.013700692924903054,"score_gpt":0.22547362383367578,"score_spread":0.21177293090877272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209968826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16137898,0.0010618669,0.7958195,0.001714771,0.00010851678,0.000044484263,0.000052023,0.00014604465,0.03967384],"genre_scores_gemma":[0.8629269,0.0012316346,0.119875856,0.00034657813,0.00010635712,0.00014226795,0.000052028707,0.00010900491,0.015209368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997055,0.0001743374,0.000006513161,0.00003379836,0.00005031141,0.000029483952],"domain_scores_gemma":[0.99906415,0.00075121515,0.000056164718,0.00003037164,0.000055129265,0.00004289833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086777384,0.00039574303,0.00039332669,0.0004666361,0.0005108921,0.001169961,0.0006666375,0.0009829669,0.002193575],"category_scores_gemma":[0.003937634,0.00022486401,0.00040399592,0.0005734061,0.0017021252,0.0016009338,0.0007437131,0.001130444,0.0002791465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024396235,0.000017071452,0.00039379406,0.00003895646,0.000021294323,0.00009380921,0.00017698127,0.3753219,0.0017115254,0.6138305,0.00054335524,0.007826457],"study_design_scores_gemma":[0.000009766382,0.000017081007,0.00008362697,0.000008153141,0.000005384124,0.000028866796,0.000029652647,0.58513093,0.0003248054,0.41307083,0.0012828024,0.0000081963535],"about_ca_topic_score_codex":0.0011215317,"about_ca_topic_score_gemma":0.0008712955,"teacher_disagreement_score":0.002193575,"about_ca_system_score_codex":0.0009891419,"about_ca_system_score_gemma":0.0003430957,"threshold_uncertainty_score":0.007338226},"labels":[],"label_agreement":null},{"id":"W2230600954","doi":"10.5281/zenodo.50020","title":"SpaDES: v1.1.3","year":2016,"lang":"en","type":"article","venue":"INFM-OAR (INFN Catania)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Canadian Forest Service","funders":"","keywords":"Computer science","score_opus":0.015120438787445678,"score_gpt":0.2403209751858808,"score_spread":0.22520053639843512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230600954","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054002675,0.00019927425,0.03165182,0.00033085857,0.00031640267,0.00009630871,0.05413185,0.9019232,0.010810305],"genre_scores_gemma":[0.011365477,0.00037430343,0.036514234,0.0009168384,0.00013293306,0.00055244623,0.16441873,0.7647564,0.02096866],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984471,0.00019896978,0.00012747795,0.00042815815,0.00057096576,0.00022730582],"domain_scores_gemma":[0.99624026,0.0009793816,0.00017133773,0.0013497961,0.0010652912,0.00019384747],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025794131,0.0038289167,0.0017691761,0.0026739365,0.001110962,0.004384944,0.006927148,0.0027048155,0.35423318],"category_scores_gemma":[0.014006683,0.0043837847,0.0034021272,0.0022246735,0.0008541974,0.005608765,0.0045031677,0.0051377877,0.4066267],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013148562,0.000027461945,0.0005606048,0.00035279986,0.00005289765,0.000049789796,0.0000740071,0.0010846283,0.0007314946,0.0014802098,0.98070425,0.014750367],"study_design_scores_gemma":[0.00029192423,0.000049815244,0.0011517932,0.0002552281,0.000058880814,0.00021281956,0.000058579375,0.014190969,0.011869765,0.011609043,0.9601079,0.00014331439],"about_ca_topic_score_codex":0.0060653016,"about_ca_topic_score_gemma":0.0051928526,"teacher_disagreement_score":0.35423318,"about_ca_system_score_codex":0.0014237406,"about_ca_system_score_gemma":0.0021942318,"threshold_uncertainty_score":0.921108},"labels":[],"label_agreement":null},{"id":"W2250923797","doi":"10.5555/1999416.1999484","title":"Synergy of the reinforcement learning and agent-based technique for finding optimal solution in a predefined interval","year":2010,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Interval (graph theory); Actuator; Function (biology); Multi-agent system; Wireless; Q-learning; Artificial intelligence; Mathematical optimization; Engineering; Mathematics","score_opus":0.03310957087178093,"score_gpt":0.2911689759997367,"score_spread":0.2580594051279558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250923797","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007515132,0.0001634032,0.9904406,0.00005236934,0.00001924856,0.000028721575,0.0000034063717,0.00014823135,0.0016288548],"genre_scores_gemma":[0.5169013,0.00034348966,0.48052016,0.00007312411,0.00004328784,0.0001764467,0.000025787314,0.00006507552,0.001851316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994468,0.00018664697,0.00003644373,0.00009151516,0.00019989094,0.000038620834],"domain_scores_gemma":[0.99920374,0.00049467065,0.000070270915,0.00005829025,0.00013827263,0.000034799064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009986721,0.0004886846,0.0007202959,0.0004331023,0.00021939226,0.0005072965,0.00091767404,0.0005074745,0.0011500688],"category_scores_gemma":[0.0024418277,0.00020264022,0.00037525163,0.00033575366,0.00051979517,0.0007445453,0.00060102256,0.00085686316,0.00020914315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016241534,0.00016718435,0.0013413023,0.00028882458,0.000110340465,0.00016588948,0.00020005912,0.6715883,0.012746008,0.04389788,0.0009146652,0.2684171],"study_design_scores_gemma":[0.000020836258,0.0001090437,0.00016258826,0.000013572087,0.000016142909,0.00007867347,0.000009328269,0.9905439,0.0024570846,0.0051257242,0.0014537391,0.0000093306],"about_ca_topic_score_codex":0.0010933377,"about_ca_topic_score_gemma":0.0007930604,"teacher_disagreement_score":0.0011500688,"about_ca_system_score_codex":0.0003529058,"about_ca_system_score_gemma":0.00070336286,"threshold_uncertainty_score":0.0052815676},"labels":[],"label_agreement":null},{"id":"W2253367123","doi":"10.1007/978-3-662-44303-3_7","title":"On Diversity, Teaming, and Hierarchical Policies: Observations from the Keepaway Soccer Task","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Artificial intelligence; Benchmark (surveying); Diversity (politics); Champion; Evolutionary robotics; Field (mathematics); Machine learning; Evolutionary computation; Robotics; Function (biology); Evolutionary algorithm; Fitness function; Robot","score_opus":0.021963336922866943,"score_gpt":0.23709755532950846,"score_spread":0.21513421840664151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253367123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861536,0.0006801432,0.0035480082,0.00040290118,0.000026675818,0.000025792315,0.000496574,0.000039930776,0.008626336],"genre_scores_gemma":[0.99503976,0.00022719582,0.0013348036,0.000073064475,0.000015980762,0.000021800828,0.00091949926,0.000052928768,0.002314952],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99965215,0.00011745901,0.000017452912,0.00005863193,0.00007513111,0.00007930146],"domain_scores_gemma":[0.995876,0.0028874709,0.0003319282,0.00027741707,0.00028409445,0.0003431467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081045565,0.00032229756,0.0005253006,0.0004389581,0.0007495683,0.0009772237,0.0007972806,0.0009150434,0.003822791],"category_scores_gemma":[0.010548354,0.00029297732,0.00022307964,0.00088075065,0.00069325516,0.00096849806,0.0012385313,0.0011078359,0.000748997],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0070766225,0.0032412969,0.26859155,0.0015044643,0.00051914586,0.0022600584,0.030346246,0.18924266,0.032517746,0.020095857,0.08277402,0.36183035],"study_design_scores_gemma":[0.00044407276,0.0017723971,0.6319802,0.00038719564,0.00012678276,0.0013115028,0.02414128,0.21145046,0.005361472,0.08455348,0.03817348,0.00029764883],"about_ca_topic_score_codex":0.011922749,"about_ca_topic_score_gemma":0.016414091,"teacher_disagreement_score":0.011922749,"about_ca_system_score_codex":0.0002982785,"about_ca_system_score_gemma":0.00032783425,"threshold_uncertainty_score":0.023706675},"labels":[],"label_agreement":null},{"id":"W2271982690","doi":"","title":"A Review of Thresheld Convergence","year":2015,"lang":"en","type":"review","venue":"SSRN Electronic Journal","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Convergence (economics); Economics; Macroeconomics","score_opus":0.034865370073911585,"score_gpt":0.33219093624447926,"score_spread":0.29732556617056766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271982690","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020879175,0.9840904,0.0035796566,0.0013238158,0.000741273,0.000013008679,0.000028700011,0.000024376437,0.00998996],"genre_scores_gemma":[0.00400725,0.98755497,0.0029354682,0.0009971177,0.0011491666,0.000033847016,0.000064523694,0.000025559302,0.0032320314],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988323,0.00029971238,0.0001501896,0.00017851334,0.00045387994,0.00008548411],"domain_scores_gemma":[0.99680626,0.0018864541,0.00018705307,0.00012884458,0.00087875134,0.00011266074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021906788,0.0012481516,0.0016681737,0.0038211895,0.0008446452,0.0023128442,0.0021674724,0.0022971171,0.0088704415],"category_scores_gemma":[0.0069111623,0.0005698204,0.0009408023,0.0054452242,0.0017348875,0.0036514977,0.0013794387,0.0026353789,0.0058112834],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007246018,0.00008150647,0.0004815488,0.013958851,0.00008478832,0.00029785436,0.0002561292,0.0029777158,0.0004746013,0.08876519,0.08164718,0.8109022],"study_design_scores_gemma":[0.000009479888,0.000073914576,0.0004486634,0.0051486976,0.000040956922,0.0009625557,0.00008429146,0.0006086896,0.00031495062,0.020489393,0.9717836,0.000034731456],"about_ca_topic_score_codex":0.0027941666,"about_ca_topic_score_gemma":0.0025155342,"teacher_disagreement_score":0.0088704415,"about_ca_system_score_codex":0.0017438343,"about_ca_system_score_gemma":0.0031447818,"threshold_uncertainty_score":0.02967465},"labels":[],"label_agreement":null},{"id":"W2290614696","doi":"","title":"DETECTING TEXTUAL ENTAILMENT WITH CONDITIONS ON DIRECTIONAL TEXT RELATEDNESS SCORES","year":2009,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Logical consequence; Textual entailment; Heuristics; Natural language processing; Computer science; Word (group theory); Artificial intelligence; Exploit; Relation (database); Point (geometry); Identity (music); Mathematics; Data mining","score_opus":0.006591953534917815,"score_gpt":0.23918872799734936,"score_spread":0.23259677446243154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290614696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3537261,0.00061244145,0.61704284,0.0007645632,0.000100019606,0.0009410703,0.0056447904,0.014139845,0.0070283823],"genre_scores_gemma":[0.5649212,0.00014192921,0.4236332,0.00019521726,0.00012005912,0.00034772445,0.008551492,0.0005581163,0.0015310692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921503,0.0014364966,0.0011040919,0.0021141185,0.0026466711,0.0005483008],"domain_scores_gemma":[0.970523,0.018220292,0.0029624351,0.0022886393,0.00507378,0.00093182846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052340673,0.0010892816,0.0017300262,0.008991533,0.0009182679,0.0029835836,0.0017852979,0.0024442738,0.007122002],"category_scores_gemma":[0.044465296,0.00068971206,0.0014697599,0.0037510616,0.0011689917,0.007566133,0.0030526258,0.0016129991,0.0024685853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003493896,0.0012456533,0.07892164,0.0017891056,0.0004864362,0.002090761,0.0020341654,0.027421439,0.09856767,0.06815649,0.028199324,0.68759346],"study_design_scores_gemma":[0.00033978716,0.00056231796,0.024853064,0.00020298928,0.00027569785,0.0014737895,0.0010520475,0.7703474,0.087902516,0.101905376,0.01086138,0.0002235424],"about_ca_topic_score_codex":0.0021877924,"about_ca_topic_score_gemma":0.0037957227,"teacher_disagreement_score":0.008991533,"about_ca_system_score_codex":0.00132647,"about_ca_system_score_gemma":0.0019430973,"threshold_uncertainty_score":0.027680695},"labels":[],"label_agreement":null},{"id":"W2292265081","doi":"10.1139/tcsme-2013-0082","title":"AUTOMATIC DESIGN OF SHIFT-AND-ADD BASED COLOR SPACE CONVERTER USING A GENETIC ALGORITHM","year":2013,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"YCbCr; RGB color model; Color space; Computer science; Genetic algorithm; Artificial intelligence; Space (punctuation); Algorithm; Computer vision; Architecture; Color image; Image (mathematics); Image processing","score_opus":0.013301105424619946,"score_gpt":0.19948292128696524,"score_spread":0.18618181586234528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292265081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06595316,0.00015553556,0.9277009,0.0000971423,0.000047571844,0.00010933279,0.00002447808,0.0009857665,0.004926256],"genre_scores_gemma":[0.48960793,0.00013347436,0.5067401,0.00007474191,0.00001503657,0.00017639756,0.000044816647,0.000058305613,0.003149167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999881,0.000022324382,0.0000052319906,0.000026441525,0.000050235085,0.000014820459],"domain_scores_gemma":[0.9998994,0.000032816006,0.0000144845635,0.000008880874,0.000038798542,0.000005628653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021175652,0.00036716755,0.0002730083,0.00040406256,0.00025304029,0.0004499088,0.00068741664,0.0004114539,0.0013092129],"category_scores_gemma":[0.0003833906,0.00018457203,0.000244744,0.00023567246,0.00022884418,0.00021413037,0.00015874456,0.00030814233,0.00022251923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015623106,0.00019593019,0.0019196145,0.00018764354,0.00010874246,0.00024874977,0.00021235066,0.38607875,0.20979267,0.01890434,0.00192304,0.38027197],"study_design_scores_gemma":[0.000058280435,0.00014544182,0.0005032906,0.00001072589,0.000031489028,0.00014812722,0.00002004569,0.96402854,0.030077783,0.0013883631,0.003573497,0.0000142789795],"about_ca_topic_score_codex":0.0017539414,"about_ca_topic_score_gemma":0.0022638417,"teacher_disagreement_score":0.0017539414,"about_ca_system_score_codex":0.00038189848,"about_ca_system_score_gemma":0.0005994176,"threshold_uncertainty_score":0.0043797493},"labels":[],"label_agreement":null},{"id":"W2299870309","doi":"10.1108/ijicc-07-2015-0026","title":"Diploidy in evolutionary algorithms for dynamic optimization problems","year":2015,"lang":"en","type":"article","venue":"International Journal of Intelligent Computing and Cybernetics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ploidy; Algorithm; Computer science; Evolutionary algorithm; Fitness function; Genetic algorithm; Representation (politics); Mathematical optimization; Function (biology); Selection (genetic algorithm); Position (finance); Mathematics; Artificial intelligence; Biology; Genetics","score_opus":0.027162037825258785,"score_gpt":0.30257861420126114,"score_spread":0.27541657637600236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299870309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012111683,0.0034117384,0.97632104,0.00047592042,0.0002559687,0.00007177276,0.000058470498,0.00018392428,0.0071095303],"genre_scores_gemma":[0.33994025,0.0060385163,0.64342916,0.0004139063,0.00019106088,0.0002837935,0.00022401623,0.0001683388,0.009310885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918026,0.00041770103,0.000061652754,0.00011883087,0.00019355392,0.000027878688],"domain_scores_gemma":[0.99889,0.00076302374,0.00007679233,0.00013103339,0.00010593065,0.000033238917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018201763,0.00063367956,0.00062539196,0.000652305,0.000363562,0.0011544862,0.0006478149,0.00070509943,0.0032485486],"category_scores_gemma":[0.0044082734,0.0003019025,0.0005937311,0.001001366,0.0011630201,0.0013842415,0.0011458702,0.0012294457,0.0005827959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015660992,0.00006547702,0.0017859173,0.0005041172,0.00010388379,0.0002941707,0.00036234723,0.39029166,0.006311302,0.38734052,0.0027211558,0.21006289],"study_design_scores_gemma":[0.00008042,0.00030137677,0.0007316576,0.00022527283,0.0000647883,0.00044421043,0.00013634226,0.72109973,0.0033385705,0.22252214,0.051006615,0.000048853777],"about_ca_topic_score_codex":0.0011046907,"about_ca_topic_score_gemma":0.00078357273,"teacher_disagreement_score":0.0032485486,"about_ca_system_score_codex":0.00070222595,"about_ca_system_score_gemma":0.0006676733,"threshold_uncertainty_score":0.010867476},"labels":[],"label_agreement":null},{"id":"W2312298105","doi":"10.2316/journal.203.2012.2.203-4846","title":"OPTIMAL VAR PLANNING USING FACTS","year":2012,"lang":"en","type":"article","venue":"International Journal of Power and Energy Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Thyristor; Unified power flow controller; Control theory (sociology); Power flow; Capacitor; AC power; Static VAR compensator; Electric power system; Controller (irrigation); Series (stratigraphy); Computer science; Control engineering; Power (physics); Engineering; Control (management); Voltage; Electrical engineering; Physics; Artificial intelligence; Biology","score_opus":0.022118610907700686,"score_gpt":0.28162437977688676,"score_spread":0.2595057688691861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312298105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027294707,0.0004185274,0.9553862,0.0002258936,0.000054889686,0.000045071087,0.00007947652,0.00019544932,0.01629975],"genre_scores_gemma":[0.877828,0.00036954126,0.11612401,0.000068377034,0.00003840278,0.00008470972,0.00010308597,0.000060570375,0.0053233076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998429,0.0000514406,0.000006077341,0.000033333443,0.000040125913,0.000026054187],"domain_scores_gemma":[0.99982697,0.00009792455,0.00002143129,0.000009336993,0.000032567776,0.000011762848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028031386,0.00057717535,0.0005222213,0.0005065741,0.00026976294,0.0006998375,0.0004888845,0.00059197826,0.0025252528],"category_scores_gemma":[0.00081378565,0.00040976136,0.0003913077,0.0004985898,0.00022718802,0.00052214967,0.00031689036,0.00047908505,0.00023827735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002395609,0.0000151412005,0.00012686146,0.000024377106,0.000010933873,0.000049527527,0.000013221511,0.9697271,0.00061511784,0.007415684,0.00045862782,0.021519385],"study_design_scores_gemma":[0.0000061247874,0.000019265084,0.00005524603,0.0000068546174,0.0000058422956,0.000014199615,0.000007749386,0.9930943,0.00025506408,0.005881756,0.00065037777,0.00000325045],"about_ca_topic_score_codex":0.0032440647,"about_ca_topic_score_gemma":0.004058424,"teacher_disagreement_score":0.0032440647,"about_ca_system_score_codex":0.00041447987,"about_ca_system_score_gemma":0.0005252761,"threshold_uncertainty_score":0.008447766},"labels":[],"label_agreement":null},{"id":"W2313214159","doi":"10.7551/978-0-262-32621-6-ch108","title":"Evolving Autonomous Agent Controllers as Analytical Mathematical Models","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Autonomous agent; Artificial intelligence; Control engineering; Engineering","score_opus":0.01984280675682549,"score_gpt":0.25598515191446486,"score_spread":0.23614234515763938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313214159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15218666,0.00016192337,0.83648294,0.0003445326,0.000042223684,0.000046704383,0.000053984106,0.00032018818,0.010360977],"genre_scores_gemma":[0.81073684,0.00030352463,0.18098576,0.00009422709,0.00001599837,0.00019085784,0.00008856605,0.00006851822,0.0075157043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998652,0.000043064723,0.0000070183733,0.000019371662,0.000053926375,0.000011503694],"domain_scores_gemma":[0.99972945,0.0001386021,0.000050204333,0.000031216136,0.00003607802,0.000014410489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028676167,0.00029528266,0.00028879856,0.0002869137,0.00019423816,0.00083291,0.0006597973,0.0006009847,0.0011370492],"category_scores_gemma":[0.0013424219,0.00022515794,0.00033212805,0.00021381598,0.0005876662,0.0008081525,0.0005106279,0.00049243437,0.0002057538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016067965,0.000021388889,0.0002711898,0.00002953818,0.000014295667,0.00006764485,0.000098394885,0.840968,0.0085374825,0.1415802,0.00026795038,0.008127887],"study_design_scores_gemma":[0.0000055084492,0.000007764151,0.000021167982,0.0000020064592,0.0000020472353,0.000010722983,0.000005406849,0.98673147,0.00073805876,0.011766223,0.00070695265,0.0000026008981],"about_ca_topic_score_codex":0.00087912986,"about_ca_topic_score_gemma":0.0006530315,"teacher_disagreement_score":0.0011370492,"about_ca_system_score_codex":0.0005128471,"about_ca_system_score_gemma":0.00048238097,"threshold_uncertainty_score":0.0038037896},"labels":[],"label_agreement":null},{"id":"W2320280295","doi":"10.7227/ijmee.38.3.3","title":"Use of Linear Graphs and Thevenin/Norton Equivalent Circuits in the Modeling and Analysis of Electro-Mechanical Systems","year":2010,"lang":"en","type":"article","venue":"International Journal of Mechanical Engineering Education","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Thévenin's theorem; Equivalent circuit; Mechanical system; Computer science; Network analysis; Domain (mathematical analysis); Electronic circuit; Coupling (piping); Nonlinear system; Linear system; Control engineering; Mathematics; Engineering; Mechanical engineering; Electrical engineering; Physics; Mathematical analysis; Artificial intelligence; Voltage","score_opus":0.02001199515303856,"score_gpt":0.2720596230921013,"score_spread":0.25204762793906277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320280295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014902935,0.0004415819,0.99225897,0.00011905583,0.000046602752,0.000011821087,0.000022991777,0.00011470603,0.005493996],"genre_scores_gemma":[0.45959294,0.006119279,0.52021694,0.0005133384,0.00023055937,0.0002632094,0.00017045626,0.00026665867,0.012626537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995772,0.00018745234,0.00002365669,0.00006043887,0.00013116306,0.000019948688],"domain_scores_gemma":[0.9996722,0.00018934128,0.000044986267,0.000035147317,0.00004836546,0.000010094798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006517218,0.0011563011,0.0005109627,0.0010041398,0.00032374097,0.0011576997,0.00092726474,0.0008397524,0.001978869],"category_scores_gemma":[0.0013511016,0.00031129352,0.00062394585,0.0009770576,0.0011180935,0.0018178785,0.00066087185,0.0009500056,0.0006151933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029686626,0.000023315859,0.00022364417,0.00018578826,0.000033848723,0.00031406232,0.00017651953,0.29930153,0.006931977,0.6194121,0.0015606673,0.07180691],"study_design_scores_gemma":[0.0000101866235,0.00007348665,0.00019923365,0.000060159597,0.00004077821,0.00024116218,0.00006721613,0.64781845,0.0032939776,0.32632917,0.021828238,0.00003796484],"about_ca_topic_score_codex":0.0011883797,"about_ca_topic_score_gemma":0.0013154917,"teacher_disagreement_score":0.001978869,"about_ca_system_score_codex":0.00061772444,"about_ca_system_score_gemma":0.00035558027,"threshold_uncertainty_score":0.00661999},"labels":[],"label_agreement":null},{"id":"W2345195955","doi":"10.1007/s10489-016-0788-9","title":"XCS-based reinforcement learning algorithm for motion planning of a spherical mobile robot","year":2016,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Reinforcement learning; Mobile robot; Motion planning; Artificial intelligence; Motion (physics); Computer vision; Robot; Human–computer interaction; Algorithm","score_opus":0.023395401115473856,"score_gpt":0.2794243832167838,"score_spread":0.25602898210131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345195955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04769723,0.00035576193,0.94243634,0.00024846703,0.000116461495,0.00007855687,0.000044118297,0.00047390952,0.008549042],"genre_scores_gemma":[0.8947969,0.00015602837,0.10086799,0.00008811561,0.00002792104,0.00016716318,0.00006647669,0.00003216424,0.0037972615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998491,0.00003460493,0.000008171302,0.000025540132,0.00005952064,0.00002310254],"domain_scores_gemma":[0.9997421,0.000079763486,0.000027359849,0.000017042348,0.000111229936,0.000022446437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047038702,0.00042543255,0.00053085247,0.00036422565,0.00039438214,0.00036604964,0.0007376795,0.00065017334,0.002144398],"category_scores_gemma":[0.00088170526,0.00025117147,0.0002666291,0.00032667269,0.00046686473,0.0002456883,0.00069082814,0.0004369427,0.00025285315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085547676,0.000027016657,0.00056312,0.000050533,0.000018912828,0.000060777573,0.000051146468,0.9399269,0.0026862484,0.004869626,0.00084721454,0.05081287],"study_design_scores_gemma":[0.000009901455,0.000027301925,0.0000653324,0.0000034849181,0.000002898056,0.000010701432,0.0000033336862,0.9989889,0.00027406,0.00035042345,0.00026146596,0.0000021183773],"about_ca_topic_score_codex":0.0113569,"about_ca_topic_score_gemma":0.005809069,"teacher_disagreement_score":0.0113569,"about_ca_system_score_codex":0.00057839707,"about_ca_system_score_gemma":0.0011194593,"threshold_uncertainty_score":0.022581577},"labels":[],"label_agreement":null},{"id":"W2346479336","doi":"","title":"Edge detection of petrographic images using genetic programming","year":2000,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Edge detection; Detector; Computer vision; Genetic programming; Computer science; Artificial intelligence; Petrography; Canny edge detector; Image processing; Enhanced Data Rates for GSM Evolution; Sampling (signal processing); Pattern recognition (psychology); Image (mathematics); Mineralogy; Geology","score_opus":0.012131605469170513,"score_gpt":0.24019857016700447,"score_spread":0.22806696469783394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346479336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09977763,0.0001981608,0.8962911,0.00021533856,0.000027478349,0.00010199928,0.00003933555,0.00049592124,0.0028530476],"genre_scores_gemma":[0.32810673,0.00032935425,0.6678513,0.00018343073,0.000021441047,0.00027054615,0.00015486508,0.00013863124,0.0029437596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996182,0.00012536235,0.000019547011,0.00008507354,0.00010983399,0.000042002306],"domain_scores_gemma":[0.9989293,0.0007351715,0.00008746065,0.000047177524,0.00016422002,0.00003672721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011837662,0.00076853676,0.0008704317,0.00088275055,0.00040692673,0.0008498288,0.0010768792,0.0009326209,0.0011344645],"category_scores_gemma":[0.00259373,0.0004163746,0.00075562013,0.0006071245,0.00086600205,0.00059844,0.00060603296,0.0009633932,0.0001699586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042857377,0.00008826548,0.0018246967,0.000060106933,0.00006051714,0.00009497449,0.00014929891,0.88729346,0.00935956,0.009577204,0.00037879188,0.091070175],"study_design_scores_gemma":[0.000009021477,0.000024553012,0.0001645246,0.000007861629,0.000011948701,0.000018529026,0.000016487209,0.9939725,0.002179443,0.0029515927,0.00063563767,0.000007983521],"about_ca_topic_score_codex":0.0042121843,"about_ca_topic_score_gemma":0.0033821545,"teacher_disagreement_score":0.0042121843,"about_ca_system_score_codex":0.00089865876,"about_ca_system_score_gemma":0.0007340505,"threshold_uncertainty_score":0.008375287},"labels":[],"label_agreement":null},{"id":"W2347121625","doi":"10.1007/978-3-319-30668-1_14","title":"Modelling Evolvability in Genetic Programming","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Computer science; Genetic programming; A priori and a posteriori; Fitness landscape; Artificial intelligence; Genetic algorithm; Tree (set theory); Theoretical computer science; Machine learning; Mathematics","score_opus":0.019790579970375106,"score_gpt":0.2436607517646063,"score_spread":0.2238701717942312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347121625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05464835,0.0020946006,0.8879652,0.0009402391,0.00014796022,0.000057577454,0.000062261424,0.00019193604,0.05389197],"genre_scores_gemma":[0.8440439,0.0026005607,0.1301128,0.00019885306,0.000113561386,0.00016892815,0.0001158783,0.00021894477,0.022426499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995484,0.00021599303,0.00002014003,0.00005210473,0.00011708715,0.000046267127],"domain_scores_gemma":[0.9986469,0.0010319899,0.00009123409,0.000103420425,0.00008620366,0.000040253424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007212094,0.0005405039,0.00039446485,0.0004820206,0.00029646602,0.0014846793,0.0013111107,0.0014470526,0.0037774122],"category_scores_gemma":[0.0055980897,0.00038301453,0.0006894242,0.00067590666,0.0016139923,0.0018577335,0.0012820818,0.0015952111,0.0004978708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021245929,0.00002509614,0.00033583885,0.00009736753,0.000020944946,0.00013475423,0.00019297544,0.52418715,0.0013321637,0.45159647,0.000588472,0.021467498],"study_design_scores_gemma":[0.000008121882,0.00001580591,0.000082347506,0.00003189114,0.000007896231,0.000048081267,0.000027800406,0.6061361,0.000353974,0.3904384,0.0028408482,0.000008751191],"about_ca_topic_score_codex":0.0013824465,"about_ca_topic_score_gemma":0.0010098418,"teacher_disagreement_score":0.0037774122,"about_ca_system_score_codex":0.0009149435,"about_ca_system_score_gemma":0.00047912687,"threshold_uncertainty_score":0.012636721},"labels":[],"label_agreement":null},{"id":"W2369818440","doi":"10.1007/978-3-319-16501-1","title":"Genetic programming : 18th European conference, EuroGP 2015, Copenhagen, Denmark, April 8-10, 2015, proceedings","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Genetic programming; Computer science; Crossover; Symbolic regression; Theoretical computer science; Artificial intelligence; Genetic representation; Evolutionary algorithm; Common Lisp; Fitness function; Genetic algorithm; Programming language; Machine learning; Lisp","score_opus":0.03447444470900374,"score_gpt":0.2648129841430723,"score_spread":0.23033853943406857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369818440","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02931741,0.16236578,0.6076042,0.019436305,0.044142056,0.00045530061,0.0016806633,0.0062248954,0.1287734],"genre_scores_gemma":[0.15292084,0.10587311,0.29976672,0.003913332,0.007702002,0.000522529,0.008097311,0.003995746,0.4172084],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998789,0.00037504677,0.00006844317,0.00026293358,0.00037406926,0.0001305188],"domain_scores_gemma":[0.99853134,0.0003881319,0.00004060427,0.00021508601,0.0005975871,0.0002272446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004718383,0.0011856745,0.0014441066,0.0012288925,0.0006094019,0.003748085,0.001994589,0.0015785444,0.020243641],"category_scores_gemma":[0.003675026,0.00048041242,0.00077992515,0.0015418563,0.0014382963,0.0021237826,0.0020974851,0.0020859821,0.008572324],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052324584,0.00037295325,0.0008290728,0.00066950015,0.00013707773,0.00019923857,0.0002538354,0.01024472,0.003057877,0.024573343,0.35300282,0.60613626],"study_design_scores_gemma":[0.00016987443,0.00039613477,0.0043228776,0.0013172639,0.0002052241,0.0008931446,0.00043265484,0.047428392,0.008846497,0.040465605,0.8954471,0.0000752295],"about_ca_topic_score_codex":0.005551591,"about_ca_topic_score_gemma":0.0051384214,"teacher_disagreement_score":0.020243641,"about_ca_system_score_codex":0.0014474909,"about_ca_system_score_gemma":0.0031739075,"threshold_uncertainty_score":0.067721725},"labels":[],"label_agreement":null},{"id":"W2391037491","doi":"10.1007/978-3-319-30668-1_9","title":"A Genetic Programming Approach for the Traffic Signal Control Problem with Epigenetic Modifications","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Traffic signal; Genetic algorithm; Control (management); Epigenetics; Real-time computing; Artificial intelligence; Machine learning; Biology","score_opus":0.015855179646714398,"score_gpt":0.2243204114279859,"score_spread":0.2084652317812715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2391037491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008341713,0.00031200267,0.9807149,0.000549298,0.00007807717,0.00007955602,0.000055213994,0.000053646974,0.009815583],"genre_scores_gemma":[0.32106915,0.001010279,0.64654875,0.0006082225,0.00026112166,0.00092741486,0.00020164327,0.00017865797,0.029194778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954706,0.00019914433,0.000013748627,0.00008661005,0.00009956889,0.000053886604],"domain_scores_gemma":[0.9988612,0.0009140596,0.00005647258,0.000024634297,0.000098089295,0.000045614717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012568382,0.0011342878,0.0015049163,0.0008939485,0.000579099,0.0011621414,0.002583638,0.0030872796,0.0050769723],"category_scores_gemma":[0.0034314755,0.00070812093,0.0015181632,0.0011784098,0.0014991723,0.00095789885,0.0013871428,0.0025517861,0.0003828521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016774442,0.00004542813,0.00015781616,0.00005547259,0.00003484288,0.00007821889,0.000047767444,0.91893905,0.00061817135,0.0662828,0.0009046092,0.012819026],"study_design_scores_gemma":[0.000013899494,0.000015360269,0.000033699594,0.000009477239,0.000010059895,0.000014363966,0.0000088964725,0.97184575,0.00008859157,0.02735644,0.00059748435,0.000006077604],"about_ca_topic_score_codex":0.0069583305,"about_ca_topic_score_gemma":0.005281477,"teacher_disagreement_score":0.0069583305,"about_ca_system_score_codex":0.0015743152,"about_ca_system_score_gemma":0.0015642376,"threshold_uncertainty_score":0.016984165},"labels":[],"label_agreement":null},{"id":"W2395019440","doi":"","title":"Binary versus Real-valued Reward Functions under Coevolutionary Reinforcement Learning","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Coevolution; Binary number; Population; Computer science; Reinforcement learning; Sampling (signal processing); Software deployment; Artificial intelligence; Mathematics; Ecology","score_opus":0.021351452516815025,"score_gpt":0.26625294182542625,"score_spread":0.24490148930861122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395019440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22412771,0.00025089513,0.7685308,0.0006631789,0.000039021892,0.00006495835,0.00003434513,0.000110960085,0.0061781276],"genre_scores_gemma":[0.9723068,0.00005688721,0.02623797,0.00005297033,0.000011063853,0.00003799112,0.000014666984,0.000009909074,0.001271825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855644,0.0009109095,0.000052115705,0.00014863808,0.00022328032,0.00010858759],"domain_scores_gemma":[0.99604946,0.0026196593,0.00045292758,0.00026346016,0.00039572353,0.00021872758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003429648,0.00048625193,0.00062767783,0.00036620794,0.00027514764,0.0009952651,0.0011289663,0.00091932324,0.0017235473],"category_scores_gemma":[0.008464576,0.00023602013,0.0002991408,0.00029811816,0.0014635378,0.0013906658,0.0011186971,0.0010309784,0.00013296305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112077585,0.000077798715,0.0007528474,0.00003690841,0.000030474608,0.000049052764,0.00005759651,0.9088362,0.0009742454,0.07623443,0.00029393873,0.012544329],"study_design_scores_gemma":[0.00000971184,0.000025910886,0.00007203244,0.0000024951773,0.0000032018304,0.0000061852124,0.000004265068,0.98962575,0.000113815295,0.010063921,0.000070201466,0.0000025863471],"about_ca_topic_score_codex":0.0020014609,"about_ca_topic_score_gemma":0.0012319109,"teacher_disagreement_score":0.003429648,"about_ca_system_score_codex":0.0013478679,"about_ca_system_score_gemma":0.00070070045,"threshold_uncertainty_score":0.018137932},"labels":[],"label_agreement":null},{"id":"W2397401021","doi":"","title":"A Hybrid Cooperative Behavior Learning Method for a Rule-Based Shout-Ahead Architecture.","year":2012,"lang":"en","type":"article","venue":"IAT","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reinforcement learning; Architecture; Task (project management); Computer science; Set (abstract data type); Artificial intelligence; Quality (philosophy); Hybrid learning; Machine learning; Engineering","score_opus":0.025482849714282003,"score_gpt":0.3156425854667007,"score_spread":0.2901597357524187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397401021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008194468,0.000067346635,0.9889259,0.000070595845,0.000023318922,0.000066442415,0.000011681448,0.00040487913,0.0022354315],"genre_scores_gemma":[0.33874664,0.00009756527,0.6531349,0.0001450309,0.000021953309,0.0003531835,0.00007597493,0.00009230523,0.007332433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996123,0.00010839217,0.000019871803,0.00008565021,0.00014132216,0.00003244671],"domain_scores_gemma":[0.99940896,0.0002355022,0.000051716146,0.00010637352,0.00014378536,0.000053634463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086035987,0.000502257,0.00044336275,0.00044662284,0.00039813676,0.000529004,0.0016143634,0.0008956391,0.0033747547],"category_scores_gemma":[0.0019583893,0.00036470912,0.00051085115,0.0003104009,0.000766414,0.0007897192,0.00092485914,0.0009649604,0.0006807736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010841131,0.00026136334,0.0016148618,0.00012441527,0.00015125728,0.00021094654,0.00032508772,0.5930228,0.015061313,0.03928898,0.0023411426,0.34748942],"study_design_scores_gemma":[0.000010544391,0.000035399633,0.00009437704,0.000006253389,0.000010007841,0.000030413448,0.000009305695,0.99257445,0.0012175571,0.004888588,0.0011166994,0.000006458511],"about_ca_topic_score_codex":0.0030721289,"about_ca_topic_score_gemma":0.003920039,"teacher_disagreement_score":0.0033747547,"about_ca_system_score_codex":0.0004911808,"about_ca_system_score_gemma":0.00082787365,"threshold_uncertainty_score":0.011289656},"labels":[],"label_agreement":null},{"id":"W2404712476","doi":"","title":"Measures of disorder and straight insertion sort with erroneous comparisons.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"sort; Mathematics; Arithmetic; Statistics","score_opus":0.025323314013570887,"score_gpt":0.21994887072597255,"score_spread":0.19462555671240167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404712476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67911917,0.0025582248,0.28106144,0.0024937785,0.00044699217,0.00026192085,0.004872406,0.0023845346,0.026801547],"genre_scores_gemma":[0.9710952,0.00021363978,0.02491973,0.00015895329,0.00014706553,0.00011001723,0.0011814163,0.00017908588,0.0019950038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859747,0.004249409,0.0014186292,0.002327778,0.0045737303,0.0014556523],"domain_scores_gemma":[0.8230714,0.104115844,0.02565943,0.027926356,0.013306298,0.0059206137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010923677,0.00095922395,0.0015723506,0.009009876,0.0022424124,0.004602915,0.0031527728,0.0023684774,0.0051317075],"category_scores_gemma":[0.11876054,0.0005919625,0.0006412413,0.007227315,0.0066822744,0.011898652,0.0032778913,0.0020151667,0.0008956502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023235288,0.00041350554,0.09928066,0.00059602177,0.00043009664,0.0004890287,0.0011047823,0.08897923,0.005479728,0.6876339,0.012403078,0.10086651],"study_design_scores_gemma":[0.00010374835,0.0003747623,0.015851319,0.00014753253,0.00023700157,0.0013471316,0.0009002122,0.20699456,0.008882518,0.7582341,0.006747423,0.00017972343],"about_ca_topic_score_codex":0.0024094607,"about_ca_topic_score_gemma":0.0021739532,"teacher_disagreement_score":0.010923677,"about_ca_system_score_codex":0.003400406,"about_ca_system_score_gemma":0.00272138,"threshold_uncertainty_score":0.05777067},"labels":[],"label_agreement":null},{"id":"W2423572593","doi":"10.22215/etd/2009-06169","title":"Exaptation and functional shift in evolutionary computing","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Exaptation; Computer science; Humanities; Philosophy; Biology; Evolutionary biology","score_opus":0.012386559285714688,"score_gpt":0.24804945488768712,"score_spread":0.23566289560197243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2423572593","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10033829,0.00063447957,0.87893176,0.00092864624,0.00016177345,0.00006137294,0.000035323876,0.00066155754,0.018246869],"genre_scores_gemma":[0.8262844,0.00032847593,0.15266913,0.00024529014,0.00007922681,0.000105207306,0.000067727065,0.0002195764,0.020000953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.00018802896,0.00003072359,0.00009653441,0.000108616696,0.00005827555],"domain_scores_gemma":[0.99883634,0.0005006577,0.00006377219,0.00033294887,0.00020509139,0.00006120105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010144728,0.00031500173,0.00029578447,0.00042535894,0.00053500844,0.00084367674,0.0010270522,0.0006546367,0.006317878],"category_scores_gemma":[0.0045547453,0.00018244382,0.00034181817,0.0004673608,0.0011831586,0.0015879658,0.0012290657,0.0008471863,0.0006938554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002776129,0.0001104438,0.0016513155,0.00015128897,0.00004654057,0.00022554031,0.00081755867,0.19717799,0.016476855,0.33163765,0.002417771,0.44900945],"study_design_scores_gemma":[0.000056139765,0.00021925196,0.00078425015,0.000029307177,0.000029985613,0.00026433976,0.00013728945,0.7257064,0.008675095,0.25256577,0.011509657,0.000022502223],"about_ca_topic_score_codex":0.0008368061,"about_ca_topic_score_gemma":0.00087514916,"teacher_disagreement_score":0.006317878,"about_ca_system_score_codex":0.00046883323,"about_ca_system_score_gemma":0.0003934953,"threshold_uncertainty_score":0.02113545},"labels":[],"label_agreement":null},{"id":"W2436862416","doi":"10.1016/j.procs.2017.09.009","title":"A Comparative Analysis of the Performance of Scalable Parallel Patterns Applied to Genetic Algorithms and Configured for NVIDIA GPUs","year":2017,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Scalability; Algorithm; Computational science; Computer architecture; Operating system","score_opus":0.021249484756136673,"score_gpt":0.2718349738215539,"score_spread":0.2505854890654172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2436862416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9208462,0.0010550999,0.049654514,0.0004436362,0.00015303711,0.00018509901,0.0004371537,0.0026944694,0.024530686],"genre_scores_gemma":[0.9165596,0.0006106184,0.07842358,0.000092487106,0.000021024387,0.00017629913,0.00083387055,0.00037134287,0.0029113118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904436,0.00022514902,0.00006612302,0.00014803307,0.00038226778,0.00013410239],"domain_scores_gemma":[0.99729174,0.0010139858,0.00013454419,0.000500183,0.00090075744,0.00015862769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010140815,0.00051745813,0.0005068946,0.0010301174,0.00044743076,0.0008881446,0.0011037277,0.0005788835,0.0017288217],"category_scores_gemma":[0.005936582,0.0002161954,0.00032806903,0.0028008511,0.00042699455,0.00088665774,0.00043033407,0.00044686237,0.0004543536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002206898,0.00060196914,0.013500498,0.0005251858,0.00017877053,0.0005585127,0.00032456723,0.5583251,0.043163016,0.011185686,0.010151266,0.3592785],"study_design_scores_gemma":[0.00013481808,0.00081354845,0.010763647,0.00003467133,0.00005076995,0.00016230822,0.00021239596,0.95202583,0.026203563,0.002976789,0.00659298,0.000028710094],"about_ca_topic_score_codex":0.009198421,"about_ca_topic_score_gemma":0.006613397,"teacher_disagreement_score":0.009198421,"about_ca_system_score_codex":0.0010788548,"about_ca_system_score_gemma":0.0014360463,"threshold_uncertainty_score":0.018289745},"labels":[],"label_agreement":null},{"id":"W2478763563","doi":"10.1145/2908961.2909011","title":"mpEAd","year":2016,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Formalism (music); Notation; Theoretical computer science; Simple (philosophy); Population; Artificial intelligence; Epistemology; Mathematics; Sociology","score_opus":0.011886221092908307,"score_gpt":0.23149456568300242,"score_spread":0.21960834459009412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478763563","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035631203,0.0009141403,0.40283617,0.0017034373,0.001490408,0.00033657963,0.014234541,0.08907211,0.48584953],"genre_scores_gemma":[0.093423195,0.00176514,0.26423472,0.0021623133,0.0007529637,0.00080783374,0.037146356,0.021569889,0.5781375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992256,0.000114458664,0.00005151809,0.00020523492,0.0002956183,0.0001076166],"domain_scores_gemma":[0.9990441,0.00019379849,0.000057361074,0.0003798514,0.00022940754,0.000095475734],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072089885,0.00080211496,0.00064140785,0.0012890853,0.0013047091,0.0041564195,0.0022036594,0.0015448697,0.2930373],"category_scores_gemma":[0.0032953185,0.0005395732,0.000782863,0.0011867202,0.00058490044,0.0036025466,0.0033629797,0.0015825455,0.1704989],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031975788,0.000090644986,0.000735903,0.00056539365,0.000040678944,0.00032810424,0.00033944624,0.0039620944,0.0055199093,0.18510431,0.48448956,0.3185042],"study_design_scores_gemma":[0.00003498554,0.000027533762,0.00022226959,0.000060015675,0.000012081045,0.00028729363,0.000043818596,0.0062052463,0.0034609227,0.026368424,0.96325165,0.000025684782],"about_ca_topic_score_codex":0.00203911,"about_ca_topic_score_gemma":0.0022261834,"teacher_disagreement_score":0.7069627,"about_ca_system_score_codex":0.000718724,"about_ca_system_score_gemma":0.0011325107,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2483786840","doi":"10.4018/978-1-59904-982-3.ch007","title":"Genetic Learning","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Genetic representation; Genetic algorithm; Computer science; Initialization; Artificial intelligence; Population; Quality control and genetic algorithms; Cultural algorithm; Representation (politics); Machine learning; Population-based incremental learning; Meta-optimization; Sociology; Political science","score_opus":0.013013060463683727,"score_gpt":0.23206669493579107,"score_spread":0.21905363447210735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483786840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048071956,0.014423266,0.8190631,0.0028754254,0.0011502156,0.00022164508,0.0006104999,0.0014665578,0.15538204],"genre_scores_gemma":[0.19217922,0.028772553,0.6320498,0.002423815,0.0007510455,0.0007246078,0.0023663007,0.0006418399,0.14009076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999292,0.00021725135,0.000036204066,0.00015701156,0.0002520388,0.00004543966],"domain_scores_gemma":[0.9991553,0.00048493198,0.000047366644,0.00013930771,0.0001393412,0.000033704135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009734645,0.00093885686,0.0010667812,0.001196085,0.0007363026,0.0028787134,0.0020932406,0.0018937673,0.017599722],"category_scores_gemma":[0.0041482486,0.00030628132,0.0009009591,0.0016319279,0.0011692413,0.0019165896,0.0013783908,0.0014852541,0.0072608422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033416327,0.00005764987,0.0008270672,0.0004529578,0.00011727947,0.00015289767,0.00017071159,0.09272581,0.0012051237,0.48687991,0.025281094,0.39209616],"study_design_scores_gemma":[0.000032119955,0.000071753464,0.00039479695,0.00036166326,0.000051548883,0.0004180159,0.000112416725,0.1392672,0.00177377,0.48961872,0.36784092,0.000057073234],"about_ca_topic_score_codex":0.0015937103,"about_ca_topic_score_gemma":0.0018974411,"teacher_disagreement_score":0.017599722,"about_ca_system_score_codex":0.001308248,"about_ca_system_score_gemma":0.001185399,"threshold_uncertainty_score":0.05887699},"labels":[],"label_agreement":null},{"id":"W2484895019","doi":"","title":"Evolutionary optimization of logic-oriented systems","year":2001,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence; Curse of dimensionality; Fuzzy logic; Parametric statistics; Artificial neural network; Evolutionary algorithm; Evolutionary computation; Theoretical computer science; Mathematics","score_opus":0.02059902467514501,"score_gpt":0.2418151764635243,"score_spread":0.22121615178837928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484895019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06403903,0.00070005277,0.91391796,0.00080280204,0.00006528561,0.000066930894,0.000045534645,0.00014317369,0.020219205],"genre_scores_gemma":[0.88475686,0.0007353963,0.107806176,0.0001426117,0.00003082662,0.0001612114,0.00006707223,0.000038031867,0.00626182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.00016418414,0.000014608221,0.000046016088,0.00011036801,0.00004570992],"domain_scores_gemma":[0.9995333,0.00028633676,0.00006525166,0.000032395943,0.000056216286,0.000026414942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094431406,0.00055064075,0.0005053525,0.0004228282,0.00040237876,0.0013840761,0.0006997905,0.0010073906,0.0019185672],"category_scores_gemma":[0.00259517,0.0003219951,0.00041907886,0.00041168774,0.0012364438,0.0007977726,0.00087581645,0.000705089,0.00017760215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015824036,0.000015464786,0.00016074708,0.000028244633,0.000013072327,0.000051898725,0.000040690815,0.8925159,0.00079398503,0.09972668,0.00018215968,0.0064552985],"study_design_scores_gemma":[0.00000881739,0.000016703543,0.000041898384,0.0000055018972,0.0000032504347,0.00001070698,0.000010875902,0.9597957,0.00021320125,0.03920734,0.0006821522,0.0000038737826],"about_ca_topic_score_codex":0.001718415,"about_ca_topic_score_gemma":0.0013861273,"teacher_disagreement_score":0.0019185672,"about_ca_system_score_codex":0.0012659469,"about_ca_system_score_gemma":0.00073655136,"threshold_uncertainty_score":0.009185076},"labels":[],"label_agreement":null},{"id":"W2488334571","doi":"10.4018/978-1-59904-705-8.ch012","title":"Parallelizing Genetic Algorithms","year":2008,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Task (project management); Convergence (economics); Premature convergence; Parallelism (grammar); Process (computing); Algorithm; Genetic algorithm; Theoretical computer science; Parallel computing; Machine learning; Programming language","score_opus":0.022489245069433002,"score_gpt":0.24354347906873533,"score_spread":0.22105423399930232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488334571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125125,0.004088148,0.9264702,0.0007532224,0.0003542712,0.0001840939,0.00007935809,0.0015902178,0.053967927],"genre_scores_gemma":[0.15618369,0.009135323,0.8104323,0.00059033366,0.0002893627,0.00035317175,0.0003132499,0.000508016,0.0221946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.00014977154,0.000028533877,0.00017522981,0.00022834733,0.000054002714],"domain_scores_gemma":[0.9994615,0.00025059594,0.000026731987,0.00014361201,0.000101948885,0.00001566813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082979165,0.00087677414,0.00065669755,0.0007251208,0.0004797436,0.0016986746,0.0011819758,0.0009803846,0.0050134445],"category_scores_gemma":[0.002259686,0.0003719571,0.000803299,0.0011604296,0.00097197376,0.001686212,0.0012687366,0.0015225345,0.0014973739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007042088,0.00007243938,0.0005696144,0.00051671074,0.00008942971,0.0001705627,0.00026566454,0.25241736,0.011130917,0.26918715,0.008771808,0.456738],"study_design_scores_gemma":[0.00006640317,0.00011274251,0.00035029225,0.00019636961,0.000090841,0.0004007103,0.00012636487,0.47529408,0.010384255,0.34614763,0.16679244,0.000037905447],"about_ca_topic_score_codex":0.0013847175,"about_ca_topic_score_gemma":0.001379603,"teacher_disagreement_score":0.0050134445,"about_ca_system_score_codex":0.0009827609,"about_ca_system_score_gemma":0.0010660971,"threshold_uncertainty_score":0.016771615},"labels":[],"label_agreement":null},{"id":"W2489986895","doi":"10.1145/2908961.2931655","title":"On Synergies between Diversity and Task Decomposition in Constructing Complex Systems with GP","year":2016,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diversity (politics); Computer science; Task (project management); Context (archaeology); Decomposition; Genetic programming; Flexibility (engineering); Population; Reuse; Coevolution; Artificial intelligence; Knowledge management; Data science; Systems engineering; Mathematics; Engineering; Ecology; Biology","score_opus":0.020270269421836545,"score_gpt":0.23789670143369424,"score_spread":0.2176264320118577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489986895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035845935,0.0018167758,0.95483756,0.00097085896,0.00003225123,0.000051774772,0.000016556907,0.0001121151,0.006316298],"genre_scores_gemma":[0.5420273,0.0036003694,0.45103437,0.000334723,0.00016918953,0.00023760273,0.0000618438,0.00016902857,0.0023656257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882036,0.0006750732,0.000054980734,0.0001461185,0.00022268345,0.00008077714],"domain_scores_gemma":[0.99528706,0.0039004816,0.00019667459,0.00030581508,0.000207145,0.000102776045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034245767,0.0007872851,0.0007056651,0.0008477572,0.0005490661,0.0013114173,0.0009890924,0.0010918343,0.0010512281],"category_scores_gemma":[0.011350969,0.0006040855,0.0009253972,0.0009915602,0.0025314835,0.0026935402,0.002481591,0.0023015158,0.00019563011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036975594,0.000033319902,0.0023071135,0.00022579727,0.00008994813,0.00014159548,0.0004713995,0.7303979,0.0019305666,0.1919895,0.0005213771,0.0718546],"study_design_scores_gemma":[0.000022204196,0.00008625149,0.00057999394,0.00008373473,0.000049362945,0.000116844705,0.00005907571,0.81204337,0.0009553665,0.18283102,0.0031508969,0.000021805881],"about_ca_topic_score_codex":0.0013877975,"about_ca_topic_score_gemma":0.0017637829,"teacher_disagreement_score":0.0034245767,"about_ca_system_score_codex":0.00095356995,"about_ca_system_score_gemma":0.00070173625,"threshold_uncertainty_score":0.01811105},"labels":[],"label_agreement":null},{"id":"W2491583902","doi":"","title":"Simulating complex dynamical systems in a distributed programming environment","year":2015,"lang":"en","type":"other","venue":"ANU Open Research (Australian National University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiset; Computer science; Theoretical computer science; Dynamical systems theory; Swarm intelligence; Genetic programming; Grid; Computation; Distributed computing; Grid computing; Artificial intelligence; Algorithm; Particle swarm optimization; Mathematics","score_opus":0.1634572879478864,"score_gpt":0.3680877206618292,"score_spread":0.20463043271394282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491583902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24624608,0.00015829416,0.7274075,0.0005909921,0.00014941551,0.00009034938,0.00011559586,0.0011125078,0.024129234],"genre_scores_gemma":[0.8402388,0.0001352163,0.15021913,0.00007612962,0.000045437664,0.00013954176,0.0001166716,0.00020797514,0.008821142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974805,0.00011197969,0.000009993718,0.000041464547,0.000059088103,0.000029377652],"domain_scores_gemma":[0.99866664,0.00093375315,0.00006223949,0.00015321831,0.000087782886,0.000096437485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006665088,0.0004360903,0.00049126765,0.00022034885,0.0004998368,0.000903495,0.0010894907,0.0008899232,0.004912964],"category_scores_gemma":[0.0029102266,0.00028615972,0.00041160613,0.00033034384,0.0007474041,0.0009732738,0.0013797974,0.0011300886,0.00036826948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077653145,0.000092338945,0.0006950743,0.000029717388,0.000016354097,0.000076391814,0.000070449976,0.97068214,0.0012736032,0.015876627,0.0005361425,0.010573384],"study_design_scores_gemma":[0.000026678641,0.000014868313,0.00004083691,0.0000014478065,0.0000029771243,0.000009730339,0.000008939823,0.99390703,0.00035423719,0.005218692,0.0004126188,0.0000018841116],"about_ca_topic_score_codex":0.0021763241,"about_ca_topic_score_gemma":0.0022404992,"teacher_disagreement_score":0.004912964,"about_ca_system_score_codex":0.0003346641,"about_ca_system_score_gemma":0.0005332924,"threshold_uncertainty_score":0.016435504},"labels":[],"label_agreement":null},{"id":"W2496664933","doi":"10.1007/978-3-319-41192-7_7","title":"Estimation of Distribution Algorithms","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"EDAS; Estimation of distribution algorithm; Implementation; Evolutionary computation; Computation; Computer science; Evolutionary algorithm; Artificial intelligence; Algorithm; Mathematical optimization; Machine learning; Mathematics","score_opus":0.014147139335641925,"score_gpt":0.23897915676466613,"score_spread":0.2248320174290242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496664933","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014321196,0.0009403277,0.99227107,0.00019293858,0.00009798271,0.000020107247,0.0000641847,0.0003278505,0.004653451],"genre_scores_gemma":[0.17338392,0.003626746,0.788419,0.00037042407,0.0006888549,0.00031075045,0.0015073938,0.0009196683,0.03077332],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981059,0.00084282865,0.00006488247,0.0004219669,0.00046622742,0.00009828808],"domain_scores_gemma":[0.99467045,0.0037226984,0.0002126795,0.0007117044,0.00056418637,0.00011822595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002597872,0.0012947139,0.0014195207,0.0018809984,0.0005745238,0.002480341,0.0023809671,0.0017823805,0.011326943],"category_scores_gemma":[0.020373167,0.0009426407,0.0011408818,0.0019991002,0.0015309484,0.0035246962,0.0028735648,0.0030818763,0.004085023],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011311101,0.00007037168,0.0015081412,0.0002739119,0.00011758376,0.000050291317,0.000101220576,0.22583185,0.0017367771,0.22483835,0.015465262,0.5298931],"study_design_scores_gemma":[0.000014693596,0.000029428378,0.0005319963,0.00007946443,0.000021213533,0.0001019541,0.000023630226,0.7741776,0.0018906019,0.2104207,0.0126866205,0.000022099433],"about_ca_topic_score_codex":0.0016761092,"about_ca_topic_score_gemma":0.0013332689,"teacher_disagreement_score":0.011326943,"about_ca_system_score_codex":0.0012664505,"about_ca_system_score_gemma":0.0010957463,"threshold_uncertainty_score":0.0378924},"labels":[],"label_agreement":null},{"id":"W2497386324","doi":"10.4018/978-1-59140-941-1.ch007","title":"Fuzzy Logic Classifiers and Models in Quantitative Software Engineering","year":2007,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Fuzzy logic; Software; Transparency (behavior); Artificial intelligence; Software sizing; Exploit; Software construction; Software quality; Machine learning; Software engineering; Data mining; Software development; Theoretical computer science; Programming language","score_opus":0.045611369903866744,"score_gpt":0.2688839482030021,"score_spread":0.22327257829913535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497386324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033294605,0.02911184,0.9195085,0.0029404433,0.0005761382,0.000050856404,0.00018427797,0.00028180348,0.04401673],"genre_scores_gemma":[0.29313952,0.034407288,0.6161365,0.0015717802,0.0025260325,0.0004317359,0.0005456956,0.00020577932,0.05103563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998966,0.0004003885,0.000053253585,0.00012116963,0.0004148883,0.00004437511],"domain_scores_gemma":[0.99779725,0.0017373676,0.00009641071,0.00015275621,0.00017964303,0.000036594738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020790624,0.000907464,0.0009834194,0.0017896617,0.00047492443,0.002898845,0.0012454683,0.0017079521,0.0044210325],"category_scores_gemma":[0.004495946,0.00042343748,0.0007419731,0.002344689,0.002235648,0.004164824,0.0008393975,0.0022674568,0.0013235069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009770785,0.000018974806,0.00017916351,0.0002014599,0.000020829455,0.0000497161,0.00012774856,0.030873697,0.00030683304,0.885613,0.006584458,0.07601425],"study_design_scores_gemma":[0.0000033012034,0.000015268046,0.00008251608,0.000096666125,0.0000070661736,0.000051708696,0.00002863108,0.08262602,0.00019664995,0.89593786,0.02094259,0.0000117735935],"about_ca_topic_score_codex":0.0014279921,"about_ca_topic_score_gemma":0.0011003049,"teacher_disagreement_score":0.0044210325,"about_ca_system_score_codex":0.0017803862,"about_ca_system_score_gemma":0.00078328984,"threshold_uncertainty_score":0.01478982},"labels":[],"label_agreement":null},{"id":"W2504494579","doi":"10.1145/2908812.2908887","title":"Discovering Rubik's Cube Subgroups using Coevolutionary GP","year":2016,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reuse; Task (project management); Computer science; Genetic programming; Reinforcement learning; Cube (algebra); Population; Decomposition; Process (computing); Genetic algorithm; Sequence (biology); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Programming language; Engineering","score_opus":0.01973406502928331,"score_gpt":0.24889071332298685,"score_spread":0.22915664829370352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504494579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19410588,0.00022944127,0.79359365,0.00058580155,0.000035332832,0.00024895187,0.00012567345,0.0005654202,0.010509832],"genre_scores_gemma":[0.5869198,0.00019834911,0.4080837,0.00022940472,0.000019815632,0.0003715919,0.00030299305,0.00015073465,0.0037236419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994362,0.00020213147,0.000028350913,0.00012947929,0.000111594185,0.00009217981],"domain_scores_gemma":[0.9987691,0.0007362919,0.0001065105,0.00019213477,0.00011402862,0.000081816994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013834462,0.0006776568,0.0011287057,0.0008153147,0.0007895398,0.001141371,0.0014566086,0.0011281306,0.002381425],"category_scores_gemma":[0.003978933,0.0005502349,0.0016359051,0.0006339686,0.0013149306,0.001782977,0.0020812359,0.0016187524,0.00034793472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011487776,0.00013128488,0.003266157,0.00009620188,0.000092214665,0.00022973832,0.0004364909,0.83067054,0.002816659,0.07744622,0.0018675509,0.08283199],"study_design_scores_gemma":[0.000022503042,0.000046529345,0.00015092368,0.000009966816,0.00001642763,0.000027218166,0.00008650477,0.96315587,0.0007206383,0.03451096,0.0012433697,0.000009067286],"about_ca_topic_score_codex":0.00665096,"about_ca_topic_score_gemma":0.0058047906,"teacher_disagreement_score":0.00665096,"about_ca_system_score_codex":0.0012094658,"about_ca_system_score_gemma":0.0019406381,"threshold_uncertainty_score":0.013224483},"labels":[],"label_agreement":null},{"id":"W2516001042","doi":"10.1007/978-3-319-45823-6_95","title":"Tutorials at PPSN 2016","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Range (aeronautics); Field (mathematics); Computation; Operations research; Data science; Programming language; Engineering; Aerospace engineering","score_opus":0.014427402573505771,"score_gpt":0.24379239592993415,"score_spread":0.22936499335642838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516001042","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015415131,0.041027837,0.054183573,0.0036791188,0.024353119,0.0002019596,0.0043387283,0.005411615,0.86526257],"genre_scores_gemma":[0.0031038055,0.016555626,0.011162426,0.00059814495,0.0040835054,0.0001341179,0.0035526643,0.0018055517,0.95900416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995158,0.00005127441,0.000023802375,0.00009439851,0.00027048166,0.00004429549],"domain_scores_gemma":[0.99953306,0.00007020303,0.000023895012,0.000055596,0.00013708888,0.00018004498],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057583133,0.002062732,0.0014591439,0.0027963745,0.00077481417,0.0034784672,0.0012530707,0.00092814467,0.38390648],"category_scores_gemma":[0.0013037937,0.0006084371,0.00078631827,0.003370397,0.00033184065,0.003675026,0.0025142448,0.0018721892,0.34224364],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037446807,0.00006609423,0.00007294778,0.00038656488,0.000008288892,0.000039961873,0.000042395295,0.0010270519,0.0010798806,0.010245129,0.56310374,0.42389056],"study_design_scores_gemma":[0.0000067024307,0.000021040565,0.00017772398,0.00016783873,0.000006158332,0.00009749771,0.000019566007,0.00047041042,0.0003614584,0.008467655,0.990195,0.000008882004],"about_ca_topic_score_codex":0.0007709776,"about_ca_topic_score_gemma":0.0024318427,"teacher_disagreement_score":0.38390648,"about_ca_system_score_codex":0.0013157718,"about_ca_system_score_gemma":0.0014406842,"threshold_uncertainty_score":0.87878263},"labels":[],"label_agreement":null},{"id":"W2519194527","doi":"10.22215/etd/2007-06411","title":"Towards scalable genetic programming","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.01269992822284226,"score_gpt":0.2913360969828676,"score_spread":0.27863616876002534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519194527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013941625,0.0006633516,0.967421,0.0014133408,0.00021442893,0.00009035,0.00015283344,0.0028600995,0.013242965],"genre_scores_gemma":[0.12843667,0.0010568623,0.8599367,0.00048136807,0.00015150126,0.00021757919,0.0007717539,0.0007291275,0.008218459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989605,0.00032471027,0.000049224855,0.00018725077,0.00036472696,0.00011360734],"domain_scores_gemma":[0.9982672,0.00075401197,0.000070812166,0.00049213384,0.00030724632,0.00010855603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014496421,0.0006918638,0.00076556107,0.0008337116,0.00058167265,0.0021457297,0.0016802169,0.0011369307,0.006344643],"category_scores_gemma":[0.005893345,0.00050996157,0.00074593624,0.001375342,0.0010139381,0.0020959228,0.0022650117,0.0024944392,0.0020742184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014495346,0.00015909504,0.000978142,0.00028742297,0.000096540076,0.00018108437,0.00023052032,0.381404,0.013228536,0.25023976,0.020420618,0.33262944],"study_design_scores_gemma":[0.000049768678,0.000035551286,0.00014861969,0.000051821862,0.0000229014,0.000050811977,0.00006547013,0.7989336,0.0028911661,0.16906537,0.028674569,0.0000103680795],"about_ca_topic_score_codex":0.003305607,"about_ca_topic_score_gemma":0.0053452537,"teacher_disagreement_score":0.006344643,"about_ca_system_score_codex":0.0012373851,"about_ca_system_score_gemma":0.0018837532,"threshold_uncertainty_score":0.021224976},"labels":[],"label_agreement":null},{"id":"W2528200391","doi":"","title":"System Closure in an Integrated Newsprint Mill, Practical Application of the Genetic Algorithm","year":2004,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Mathematics; Computer science; Algorithm; Philosophy","score_opus":0.008216843736830145,"score_gpt":0.23900849732914048,"score_spread":0.23079165359231033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528200391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21351328,0.00027323136,0.7705332,0.00022702779,0.00006709578,0.00013630328,0.00008959223,0.0011207497,0.014039532],"genre_scores_gemma":[0.83781546,0.00012606014,0.15025437,0.00003236813,0.000008860886,0.00007713849,0.000073846735,0.00009915014,0.011512773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969506,0.00004027093,0.000013584061,0.00009841397,0.000113994225,0.00003859438],"domain_scores_gemma":[0.9994054,0.00031431712,0.00007277473,0.000057863534,0.000117010575,0.000032696793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005680643,0.00037180577,0.000689672,0.00035795994,0.0010167757,0.0012870977,0.00080551085,0.00096934324,0.005067068],"category_scores_gemma":[0.0016015421,0.00036790594,0.0004829199,0.0003363637,0.00079911365,0.00068937766,0.0005540396,0.0005510789,0.00036956303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019185856,0.00008696571,0.0013716907,0.00012582283,0.000017367036,0.00041372655,0.00017331835,0.9187873,0.03076892,0.007837929,0.0005558763,0.039669257],"study_design_scores_gemma":[0.00003712396,0.00011405023,0.00034170412,0.000009481954,0.000015710953,0.000089439854,0.000049463335,0.98542374,0.010115403,0.0020709496,0.0017238068,0.000009094069],"about_ca_topic_score_codex":0.010692396,"about_ca_topic_score_gemma":0.010614536,"teacher_disagreement_score":0.010692396,"about_ca_system_score_codex":0.0012182861,"about_ca_system_score_gemma":0.0014947263,"threshold_uncertainty_score":0.021260321},"labels":[],"label_agreement":null},{"id":"W253016372","doi":"10.1007/978-3-540-87700-4_45","title":"Nonsynonymous to Synonymous Substitution Ratio $k_{\\mathrm a}/k_{\\mathrm s}$ : Measurement for Rate of Evolution in Evolutionary Computation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Nonsynonymous substitution; Substitution (logic); Rate of evolution; Synonymous substitution; Evolutionary algorithm; Interactive evolutionary computation; Computation; Evolutionary computation; Population; Computer science; Sequence (biology); Evolution strategy; Algorithm; Evolutionary programming; Biology; Artificial intelligence; Gene; Genetics; Phylogenetics; Genome; Codon usage bias","score_opus":0.027453539716488923,"score_gpt":0.25228110349356647,"score_spread":0.22482756377707755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W253016372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094181046,0.014527127,0.8221417,0.0015170196,0.0022003013,0.000095566014,0.009062526,0.006463682,0.049811028],"genre_scores_gemma":[0.44072545,0.0058463286,0.5064517,0.000700321,0.00047102422,0.00029014406,0.0066151586,0.0036701476,0.03522967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876225,0.00036576862,0.00006018755,0.00041613617,0.00035872738,0.00003692605],"domain_scores_gemma":[0.99866736,0.00095013535,0.000111732086,0.00012870235,0.00010882577,0.00003323474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014052772,0.0009270387,0.0010449528,0.0016840622,0.00031136567,0.0014918902,0.0018078053,0.0013871283,0.009916511],"category_scores_gemma":[0.005648145,0.0005044244,0.0005443876,0.0024375813,0.0009268558,0.0017520724,0.0006045279,0.0014638368,0.0071718413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034228532,0.00008143211,0.010352933,0.0010991156,0.0003904952,0.000310023,0.00045634055,0.015488728,0.15709054,0.3189869,0.033181548,0.4622197],"study_design_scores_gemma":[0.000067110246,0.00026819535,0.026148172,0.0002861409,0.00028043764,0.0046310136,0.00024133566,0.15769291,0.2029566,0.46310607,0.14381054,0.0005115365],"about_ca_topic_score_codex":0.00023591572,"about_ca_topic_score_gemma":0.00039377148,"teacher_disagreement_score":0.009916511,"about_ca_system_score_codex":0.0005343235,"about_ca_system_score_gemma":0.00022072859,"threshold_uncertainty_score":0.033174038},"labels":[],"label_agreement":null},{"id":"W2538348493","doi":"10.1109/mutation.2006.7","title":"Finding Sufficient Mutation Operators via Variable Reduction","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Reduction (mathematics); Mutation; Variable (mathematics); Computer science; Carry (investment); Mutation testing; Algorithm; Mathematics; Programming language","score_opus":0.008100574292593496,"score_gpt":0.22619814370027033,"score_spread":0.21809756940767683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538348493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3551495,0.00014394065,0.6398425,0.00017147975,0.000019830846,0.00029145245,0.00045554715,0.001857896,0.0020678835],"genre_scores_gemma":[0.46026373,0.000058976886,0.53734785,0.000111912595,0.000017323835,0.00050236215,0.00079087546,0.00044110208,0.00046585448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650264,0.0012336582,0.00034395812,0.00066946977,0.0009646747,0.00028565864],"domain_scores_gemma":[0.9830949,0.012577007,0.0009316381,0.0018435268,0.0012853933,0.0002675705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036506734,0.00084082724,0.0011498568,0.0023129003,0.0009602389,0.0008948927,0.0010228315,0.0008622458,0.0022988238],"category_scores_gemma":[0.018742716,0.00045465882,0.0011139638,0.0010137361,0.0013905314,0.0016569456,0.0012600548,0.0012368049,0.00037916363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017027464,0.0010511281,0.024653364,0.001024113,0.00036155834,0.00069090584,0.0006986045,0.1483931,0.3157701,0.08677847,0.0062779593,0.41259795],"study_design_scores_gemma":[0.00043623068,0.0009870874,0.0054252422,0.00011398841,0.00028084317,0.0007187284,0.00036941213,0.66298157,0.21551561,0.10695854,0.006102187,0.0001106045],"about_ca_topic_score_codex":0.0005536983,"about_ca_topic_score_gemma":0.0010906486,"teacher_disagreement_score":0.0036506734,"about_ca_system_score_codex":0.000439334,"about_ca_system_score_gemma":0.0023076094,"threshold_uncertainty_score":0.019306898},"labels":[],"label_agreement":null},{"id":"W2553828788","doi":"10.1109/ijcnn.2016.7727774","title":"Contribution of data complexity features on dynamic classifier selection","year":2016,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Classifier (UML); Computer science; Machine learning; Artificial intelligence; Data mining; Test data; Quadratic classifier; Pattern recognition (psychology)","score_opus":0.04500460927729832,"score_gpt":0.30672469147853704,"score_spread":0.2617200822012387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553828788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3126682,0.0032408657,0.6743057,0.0010004713,0.00021027394,0.0005324189,0.00027157195,0.0009643541,0.0068062614],"genre_scores_gemma":[0.87033814,0.00060883106,0.12583686,0.00022911945,0.00025203862,0.00032935812,0.00044647546,0.00021382347,0.001745317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99225897,0.002593829,0.000744674,0.0010623867,0.0029418322,0.000398308],"domain_scores_gemma":[0.9443481,0.04378319,0.0023701326,0.0045370716,0.004346621,0.0006149249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060825706,0.0012998335,0.0016326397,0.0023376835,0.0006989534,0.0024096854,0.0015811416,0.001299417,0.0020450465],"category_scores_gemma":[0.038522564,0.00037233907,0.0011628784,0.0017438876,0.00092040084,0.0029878034,0.0019684369,0.0015090723,0.00046365272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001089676,0.0007211205,0.03771466,0.00064566586,0.0005041218,0.00069166196,0.00066960155,0.18911636,0.02657834,0.007954059,0.003053584,0.73126113],"study_design_scores_gemma":[0.00013960409,0.0015100682,0.024479188,0.00014922142,0.0005161449,0.0018571465,0.00034021348,0.92135334,0.022979494,0.016844649,0.009684509,0.00014648224],"about_ca_topic_score_codex":0.0009565609,"about_ca_topic_score_gemma":0.00088722695,"teacher_disagreement_score":0.0060825706,"about_ca_system_score_codex":0.00088758295,"about_ca_system_score_gemma":0.0011265062,"threshold_uncertainty_score":0.03216809},"labels":[],"label_agreement":null},{"id":"W2559615222","doi":"10.1109/cec.2016.7743875","title":"evoVersion: Visualizing evolutionary histories","year":2016,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Evolutionary computation; Game engine; Visualization; Interactive evolutionary computation; Data visualization; Evolutionary algorithm; Human-based evolutionary computation; Virtual reality; Field (mathematics); Human–computer interaction; Evolutionary programming; Artificial intelligence","score_opus":0.013577006584768457,"score_gpt":0.24491652655105875,"score_spread":0.2313395199662903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559615222","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07579875,0.0010669603,0.8451496,0.0006652971,0.00019202914,0.00021840105,0.0064567635,0.052454084,0.017998222],"genre_scores_gemma":[0.4608902,0.001222251,0.51252604,0.0002690286,0.000089256544,0.00040399283,0.0080551645,0.0063442937,0.010199763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997353,0.000076911856,0.000016847587,0.00005463488,0.00008912288,0.000027208434],"domain_scores_gemma":[0.9991565,0.0004798933,0.0000724545,0.00012069827,0.00009031361,0.00008017481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085418037,0.000658926,0.00036018447,0.0016393899,0.00037499506,0.0016116151,0.0008267211,0.0007349079,0.010835552],"category_scores_gemma":[0.0031154584,0.0002772062,0.00049434707,0.00074442435,0.0003429147,0.0014489244,0.0018337265,0.00064337923,0.00095603423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012168862,0.0002505216,0.015162126,0.0016224824,0.00025642687,0.0015838195,0.007696476,0.053707276,0.10007766,0.053537864,0.09629427,0.6685941],"study_design_scores_gemma":[0.00029725197,0.00043354553,0.019093577,0.0005447799,0.00013734709,0.0019048424,0.0013871115,0.44031227,0.06624468,0.08043248,0.38891992,0.0002922377],"about_ca_topic_score_codex":0.001447211,"about_ca_topic_score_gemma":0.002383526,"teacher_disagreement_score":0.010835552,"about_ca_system_score_codex":0.00021526177,"about_ca_system_score_gemma":0.0004517893,"threshold_uncertainty_score":0.036248565},"labels":[],"label_agreement":null},{"id":"W2570629401","doi":"10.1186/s13029-016-0061-y","title":"Erratum to: A bedr way of genomic interval processing","year":2017,"lang":"en","type":"erratum","venue":"Source Code for Biology and Medicine","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Ontario Institute for Cancer Research","funders":"","keywords":"Computer science; Interval (graph theory); Data science; Information retrieval; Data mining; Mathematics","score_opus":0.025984224497836828,"score_gpt":0.3223325845965977,"score_spread":0.29634836009876087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570629401","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027014833,0.003198233,0.018061223,0.06538672,0.8916572,0.00006859834,0.005213126,0.004412263,0.011732537],"genre_scores_gemma":[0.013186862,0.022141663,0.09100593,0.15184483,0.21938938,0.00044988067,0.026091967,0.025102846,0.45078668],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99644524,0.00057562365,0.00058040867,0.00042068207,0.001787424,0.00019067782],"domain_scores_gemma":[0.984568,0.0045699715,0.000782161,0.00121906,0.008023442,0.0008373844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028546562,0.0022369055,0.001431674,0.0036999667,0.0025900824,0.004420149,0.0031833716,0.0042202827,0.123944424],"category_scores_gemma":[0.045076266,0.0013114654,0.0016398653,0.0033083307,0.0022073206,0.0038264536,0.002613893,0.008561758,0.08675232],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025907048,0.0000053085178,0.000048690872,0.000080534795,0.000009335248,0.00011049683,0.000018456665,0.00007687792,0.00007911484,0.0012581156,0.98658353,0.011703628],"study_design_scores_gemma":[0.000022371221,0.000013966215,0.00019371309,0.00019852938,0.000019013787,0.00044349948,0.000037784666,0.0003411658,0.00041529397,0.0023201308,0.9959608,0.000033742992],"about_ca_topic_score_codex":0.010957769,"about_ca_topic_score_gemma":0.017174078,"teacher_disagreement_score":0.123944424,"about_ca_system_score_codex":0.0026408553,"about_ca_system_score_gemma":0.0044840593,"threshold_uncertainty_score":0.41463542},"labels":[],"label_agreement":null},{"id":"W2586650997","doi":"","title":"Reactive Agents Learn to Add Epistemic Structures to the World","year":2004,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Max-Planck-Institut für Bildungsforschung; Strong","keywords":"Task (project management); Cognition; Computer science; Action (physics); Function (biology); Term (time); Artificial intelligence; Cognitive science; Psychology; Engineering","score_opus":0.01565578062012701,"score_gpt":0.2370991400940564,"score_spread":0.22144335947392937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586650997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05068317,0.00004407109,0.9312526,0.0010780421,0.000040033116,0.00009894524,0.00015256125,0.00037607434,0.016274549],"genre_scores_gemma":[0.7020418,0.00014051689,0.28288317,0.0002847596,0.00004689835,0.00039170912,0.00020360682,0.000076865574,0.013930631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992461,0.00025545564,0.000039648636,0.00016231123,0.0001900336,0.00010646863],"domain_scores_gemma":[0.99743396,0.0012678433,0.00036293984,0.00054456864,0.0002231302,0.00016758441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012476542,0.0008791605,0.00057411985,0.0005820692,0.0007110291,0.0021922167,0.0024983527,0.002119858,0.0055180592],"category_scores_gemma":[0.0057227346,0.0007366998,0.0015036238,0.00043423273,0.00208915,0.004280862,0.0022790919,0.0025840288,0.00079687044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004933968,0.00006764463,0.0010527063,0.00005592966,0.000058927875,0.0002442907,0.00033549205,0.64387673,0.002005684,0.33967847,0.00065903284,0.0119158],"study_design_scores_gemma":[0.000035202545,0.00003633094,0.00011753747,0.000008831407,0.000017936063,0.000043737844,0.000034744906,0.8707316,0.00054593815,0.12651983,0.0018939923,0.000014463417],"about_ca_topic_score_codex":0.0032245314,"about_ca_topic_score_gemma":0.0035320225,"teacher_disagreement_score":0.0055180592,"about_ca_system_score_codex":0.0011832933,"about_ca_system_score_gemma":0.0012368367,"threshold_uncertainty_score":0.018459737},"labels":[],"label_agreement":null},{"id":"W2601435252","doi":"10.1371/journal.pone.0174635","title":"Improving HybrID: How to best combine indirect and direct encoding in evolutionary algorithms","year":2017,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Wyoming; Canadian Centre for Applied Research in Cancer Control; National Science Foundation","keywords":"Exploit; Encoding (memory); Computer science; Offset (computer science); Reuse; Algorithm; Evolutionary algorithm; Artificial intelligence; Engineering","score_opus":0.04094853997077438,"score_gpt":0.24069204830921767,"score_spread":0.1997435083384433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601435252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14481303,0.0019374015,0.83594567,0.0011989375,0.00023952284,0.00026701443,0.00019129946,0.0064287954,0.008978356],"genre_scores_gemma":[0.33447754,0.0004872447,0.6606784,0.0006491718,0.00005401068,0.00033560634,0.0003453045,0.0011171713,0.0018555458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807006,0.0007589502,0.00019665301,0.00038078614,0.00043011174,0.00016343972],"domain_scores_gemma":[0.99525213,0.002926599,0.00020868827,0.0008875644,0.0005821178,0.0001429041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037556633,0.0016070458,0.0012228453,0.0011495387,0.0007158867,0.0016096345,0.0019202058,0.0017884108,0.0029464806],"category_scores_gemma":[0.011914011,0.00068760896,0.0010447536,0.001017804,0.0011417125,0.0034612783,0.002131508,0.0019696136,0.0009845782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000493576,0.00058635126,0.015418271,0.00070789305,0.00035418794,0.00032449403,0.00067952514,0.2890876,0.04726192,0.02777576,0.0057504973,0.6115599],"study_design_scores_gemma":[0.00029249807,0.0006190909,0.0025000263,0.00021205258,0.00041917118,0.00051099045,0.00027413265,0.9113775,0.033545043,0.035382178,0.01471153,0.00015577863],"about_ca_topic_score_codex":0.001577908,"about_ca_topic_score_gemma":0.002510144,"teacher_disagreement_score":0.0037556633,"about_ca_system_score_codex":0.0007063588,"about_ca_system_score_gemma":0.0012705432,"threshold_uncertainty_score":0.019862056},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Graph; Benchmarking; Machine learning; Theoretical computer science","score_opus":0.03932165180850437,"score_gpt":0.3050081953230138,"score_spread":0.26568654351450943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604908377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274772,0.00036917208,0.83460724,0.00049705117,0.00011951593,0.00009042336,0.00051404553,0.0011970089,0.035128318],"genre_scores_gemma":[0.82333374,0.0002987097,0.15642208,0.000097962846,0.000040363684,0.00014265573,0.0007352737,0.00033812222,0.018591179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988425,0.00003695879,0.0000065423797,0.000029577946,0.000024756986,0.000017909262],"domain_scores_gemma":[0.9995579,0.00018979455,0.00004837788,0.00008050997,0.000057051475,0.000066309054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021088809,0.00041004876,0.00040983225,0.0008219347,0.0006225841,0.0014111599,0.00085982593,0.0010706614,0.009086115],"category_scores_gemma":[0.00147693,0.00027256957,0.00046894027,0.00052922266,0.0006930848,0.0020018436,0.0012265005,0.0010825241,0.00075885653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012899384,0.000087522894,0.0008234497,0.00013970135,0.00003318331,0.00033148818,0.00079132436,0.3075782,0.0063390713,0.6242365,0.0048217755,0.054688808],"study_design_scores_gemma":[0.000008220199,0.00001686701,0.00011406028,0.0000129052805,0.000005437294,0.000041988136,0.00009437884,0.79568934,0.0003729354,0.20136316,0.0022728238,0.000007903524],"about_ca_topic_score_codex":0.0019069096,"about_ca_topic_score_gemma":0.003377847,"teacher_disagreement_score":0.009086115,"about_ca_system_score_codex":0.0006709059,"about_ca_system_score_gemma":0.00034530737,"threshold_uncertainty_score":0.030396044},"labels":[],"label_agreement":null},{"id":"W2611879961","doi":"","title":"Predicting Ten Thousand Bits from Ten Thousand Inputs","year":2006,"lang":"en","type":"report","venue":"UCL Discovery (University College London)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Genetic programming; Task (project management); Code (set theory); Computer science; Series (stratigraphy); Evolutionary computation; Binary number; Computation; Artificial intelligence; Machine learning; Algorithm; Mathematics; Arithmetic; Programming language; Biology; Set (abstract data type); Engineering","score_opus":0.011509050703601226,"score_gpt":0.21513668909123376,"score_spread":0.20362763838763254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611879961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8934536,0.0010300728,0.086049035,0.0011678166,0.0003407512,0.000101293685,0.0059632566,0.003417875,0.008476434],"genre_scores_gemma":[0.96540844,0.00026999813,0.026048392,0.000106649386,0.00004490593,0.00006122888,0.0036851317,0.00007756748,0.004297688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998012,0.00002992386,0.0000108329095,0.000058714202,0.00007088082,0.000028431758],"domain_scores_gemma":[0.9985815,0.0009928198,0.000052242714,0.00014718973,0.00019121768,0.000034997185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035538373,0.0007935272,0.0004193362,0.0006022786,0.00028724733,0.0005039032,0.00050274964,0.0009559355,0.00534645],"category_scores_gemma":[0.0028105914,0.0003027733,0.00044263218,0.000875024,0.00027418425,0.0007771042,0.00036137414,0.0009676495,0.0010718334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008525962,0.00026645817,0.014772344,0.00023889939,0.00012549137,0.0005547214,0.00008887747,0.7847354,0.015944935,0.003426522,0.011388876,0.16760488],"study_design_scores_gemma":[0.000022217608,0.0001291959,0.0043755746,0.000017614871,0.000027490269,0.00006595924,0.000031600397,0.9763424,0.013907218,0.0038603835,0.0012049435,0.000015381442],"about_ca_topic_score_codex":0.0035175153,"about_ca_topic_score_gemma":0.0054489984,"teacher_disagreement_score":0.00534645,"about_ca_system_score_codex":0.00052046543,"about_ca_system_score_gemma":0.00041942354,"threshold_uncertainty_score":0.017885625},"labels":[],"label_agreement":null},{"id":"W2621359109","doi":"10.25088/complexsystems.15.3.183","title":"Evolving Distributed Control for an Object Clustering Task","year":2005,"lang":"en","type":"article","venue":"Complex Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Air Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Task (project management); Cluster analysis; Computer science; Scaling; Key (lock); Object (grammar); Population; Control (management); Distributed computing; Genetic algorithm; Sensitivity (control systems); Constant (computer programming); Robot; Cluster (spacecraft); Artificial intelligence; Machine learning; Mathematics; Engineering","score_opus":0.035838279984958386,"score_gpt":0.277652793157831,"score_spread":0.24181451317287259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621359109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30081648,0.00022038692,0.6901591,0.0003966023,0.00004687952,0.000081264545,0.00002564688,0.00035325202,0.007900406],"genre_scores_gemma":[0.9560867,0.000058190064,0.04104586,0.000055422766,0.000012406914,0.000072597184,0.000025735246,0.000030085224,0.0026129878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997781,0.000049847196,0.000008982636,0.00006943537,0.000050075996,0.00004363959],"domain_scores_gemma":[0.999253,0.00040584584,0.000098580815,0.00007561798,0.00009990202,0.000066939414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008981216,0.0005342344,0.0005447743,0.00031400716,0.00056699675,0.00077369635,0.00084188464,0.0009918115,0.0014078424],"category_scores_gemma":[0.002202612,0.00021644436,0.00031673964,0.00032281422,0.00080216,0.0006225772,0.001085101,0.0006907389,0.00014483214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007673199,0.00006822772,0.00040379795,0.000033639062,0.000024509585,0.00009445364,0.00013777238,0.9575352,0.007741421,0.009375582,0.00042044802,0.0240881],"study_design_scores_gemma":[0.00001844459,0.00004510191,0.00009722059,0.0000021041824,0.000004866489,0.000014218607,0.000019524688,0.996228,0.0009976755,0.0023001798,0.00026872152,0.0000039760052],"about_ca_topic_score_codex":0.003315163,"about_ca_topic_score_gemma":0.0020547211,"teacher_disagreement_score":0.003315163,"about_ca_system_score_codex":0.00076839724,"about_ca_system_score_gemma":0.0005101339,"threshold_uncertainty_score":0.0065917373},"labels":[],"label_agreement":null},{"id":"W2678408969","doi":"10.1007/978-94-017-7358-4_7-1","title":"Optimization Strategies in Design Space Exploration","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Benchmark (surveying); Computer science; Scalability; Heuristic; Set (abstract data type); Design space exploration; Software; Design of experiments; Convergence (economics); Space exploration; Space (punctuation); Mathematical optimization; Machine learning; Artificial intelligence; Engineering; Mathematics","score_opus":0.04272892741566849,"score_gpt":0.2447299224310419,"score_spread":0.2020009950153734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2678408969","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034898482,0.04380017,0.78781164,0.0011557654,0.0007214182,0.000065221924,0.00008557291,0.0003000397,0.16257031],"genre_scores_gemma":[0.19266167,0.07430961,0.5015975,0.0008745791,0.0009868019,0.0005579061,0.00035890652,0.000909955,0.22774309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996437,0.00010920416,0.000015632133,0.00003528364,0.00017243011,0.000023823999],"domain_scores_gemma":[0.99978477,0.0001327319,0.000013073535,0.00002493426,0.000035671237,0.000008787526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005091124,0.0013796778,0.0007765042,0.0008357331,0.0003183232,0.0015310511,0.0010347915,0.0009861534,0.009003373],"category_scores_gemma":[0.0014935078,0.0005209953,0.0004964224,0.0014500963,0.0010163452,0.001766279,0.00096048653,0.0013558315,0.002663845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021489404,0.000035979334,0.00011083673,0.0005158264,0.000038683327,0.000059911858,0.00014730847,0.09929597,0.0019259452,0.4831052,0.02275902,0.39198378],"study_design_scores_gemma":[0.000021618704,0.000054893975,0.00019795,0.0005686997,0.000033957844,0.00016312502,0.00008989086,0.19980755,0.0018537049,0.61325634,0.18391564,0.00003657055],"about_ca_topic_score_codex":0.00078638503,"about_ca_topic_score_gemma":0.0010809066,"teacher_disagreement_score":0.009003373,"about_ca_system_score_codex":0.0007080602,"about_ca_system_score_gemma":0.00059058797,"threshold_uncertainty_score":0.0301193},"labels":[],"label_agreement":null},{"id":"W27021769","doi":"10.1007/s11120-016-0245-y","title":"Real life applications of bio-inspired computing models: EAP and NEPs","year":2013,"lang":"en","type":"dissertation","venue":"Photosynthesis Research","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Natural computing; Von Neumann architecture; Field (mathematics); Programming paradigm; Unconventional computing; Turing machine; Theoretical computer science; Model of computation; Complex system; Parallelism (grammar); Artificial intelligence; Data science; Distributed computing; Computation; Programming language; Parallel computing; Mathematics","score_opus":0.06215257018466191,"score_gpt":0.3455819153192787,"score_spread":0.28342934513461676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27021769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039374366,0.0011205646,0.9464022,0.00078319875,0.00024064508,0.00011061521,0.0003675504,0.0018904066,0.009710418],"genre_scores_gemma":[0.66131514,0.00069997524,0.33132878,0.00025646345,0.00008868991,0.0005630301,0.00048289838,0.00035270688,0.00491233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998228,0.00007278479,0.000012009038,0.000039194267,0.000037009988,0.000016205548],"domain_scores_gemma":[0.99933296,0.0004535902,0.000045828292,0.000043659697,0.0000983894,0.000025539952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064582744,0.00096877397,0.0005947562,0.0004674528,0.00033533893,0.00096869696,0.00094773824,0.0012454523,0.0039083543],"category_scores_gemma":[0.002714193,0.00032111033,0.0007352199,0.00049215305,0.00041534982,0.00071481505,0.00084736996,0.0009845486,0.0006040516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034318986,0.000026188582,0.0004163588,0.000065038475,0.00003284289,0.000039469014,0.000022602553,0.97562575,0.00056107086,0.004515491,0.0007682882,0.01789242],"study_design_scores_gemma":[0.0000018774901,0.000004235826,0.000025051282,0.0000035561527,0.0000017804698,0.000003471248,0.0000029899265,0.9982115,0.00009290202,0.001348781,0.00030274023,0.0000012629732],"about_ca_topic_score_codex":0.004592571,"about_ca_topic_score_gemma":0.0037233161,"teacher_disagreement_score":0.004592571,"about_ca_system_score_codex":0.0005386539,"about_ca_system_score_gemma":0.0006659634,"threshold_uncertainty_score":0.013074815},"labels":[],"label_agreement":null},{"id":"W2724616504","doi":"","title":"Improving Robustness in Social Fabric-Based Cultural Algorithms with Two New Approaches in Population and Belief Spaces.","year":2017,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Robustness (evolution); Computer science; Artificial intelligence; Algorithm","score_opus":0.11114109451412298,"score_gpt":0.36274668935608123,"score_spread":0.25160559484195827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724616504","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1018921,0.0010016189,0.8852249,0.0010792244,0.00021831515,0.0001232245,0.000058249054,0.00043637384,0.0099660605],"genre_scores_gemma":[0.81224406,0.00026771694,0.18422286,0.00026786252,0.00012697316,0.00016545645,0.000071199545,0.000116237665,0.0025176413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987953,0.000570591,0.000060616047,0.0001692345,0.0002764487,0.00012774965],"domain_scores_gemma":[0.99449027,0.003355225,0.0003970032,0.00079909444,0.00066666247,0.0002917471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025660757,0.0010735549,0.0009918294,0.0011009292,0.0007669288,0.0017943933,0.0020975599,0.0019046465,0.0023182032],"category_scores_gemma":[0.017980685,0.000401477,0.00080292934,0.0005785035,0.0017911539,0.002443539,0.0037867434,0.0018571508,0.000375318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027644454,0.00027969424,0.0025009862,0.00014235119,0.00021770233,0.0000892688,0.0003969735,0.8135145,0.005763844,0.063477844,0.0017788437,0.11156156],"study_design_scores_gemma":[0.000032144482,0.00007776922,0.00020763928,0.00001339892,0.000028794817,0.000027768105,0.000040548843,0.9875568,0.00075432425,0.010816016,0.00043394888,0.000010845344],"about_ca_topic_score_codex":0.0020832573,"about_ca_topic_score_gemma":0.0018365837,"teacher_disagreement_score":0.0025660757,"about_ca_system_score_codex":0.0009349136,"about_ca_system_score_gemma":0.0007842357,"threshold_uncertainty_score":0.013570845},"labels":[],"label_agreement":null},{"id":"W2729584939","doi":"10.1145/3071178.3071316","title":"Coevolving deep hierarchies of programs to solve complex tasks","year":2017,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Coevolution; Computer science; Modularity (biology); Task (project management); Genetic programming; Reinforcement learning; Artificial intelligence; Theoretical computer science; Tree (set theory); Code (set theory); Diversity (politics); Machine learning; Programming language","score_opus":0.0344071226984597,"score_gpt":0.26587920758743583,"score_spread":0.23147208488897614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729584939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36419997,0.00036169746,0.6275266,0.00052953785,0.00004251968,0.00013281821,0.00006999295,0.0013966633,0.005740204],"genre_scores_gemma":[0.70778656,0.00026035635,0.28843185,0.00020917968,0.000028172197,0.0002449726,0.00018785987,0.0002131372,0.002637851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996778,0.00008438416,0.000019961657,0.00008124655,0.00007843686,0.00005816472],"domain_scores_gemma":[0.9987373,0.00065191084,0.00012611513,0.0002479503,0.00011844302,0.00011838328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070426264,0.0005527275,0.0006839034,0.00053354737,0.00035794202,0.0008840545,0.0014296733,0.0007834238,0.002214721],"category_scores_gemma":[0.0033539475,0.0005629464,0.0005558663,0.00054084015,0.0011404982,0.0017106378,0.00156513,0.0017847907,0.00043489574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006177803,0.0002011755,0.002690175,0.00011139524,0.000055536133,0.00009833576,0.00024507783,0.8701539,0.012203476,0.023860082,0.000894147,0.08942495],"study_design_scores_gemma":[0.0000089903515,0.000034819208,0.00013501647,0.0000062815407,0.000009584035,0.000012818058,0.000023664183,0.98489326,0.0010246753,0.013290195,0.00055657653,0.0000040864547],"about_ca_topic_score_codex":0.0022095144,"about_ca_topic_score_gemma":0.00456169,"teacher_disagreement_score":0.002214721,"about_ca_system_score_codex":0.0008705661,"about_ca_system_score_gemma":0.0010454556,"threshold_uncertainty_score":0.007409036},"labels":[],"label_agreement":null},{"id":"W2732956268","doi":"10.1109/cec.2017.7969310","title":"Lexicase selection promotes effective search and behavioural diversity of solutions in Linear Genetic Programming","year":2017,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Selection (genetic algorithm); Tournament selection; Genetic programming; Machine learning; Computer science; Fitness proportionate selection; Benchmark (surveying); Artificial intelligence; Tournament; Symbolic regression; Genetic algorithm; Mathematics; Fitness function","score_opus":0.040994639854643355,"score_gpt":0.29455653701659645,"score_spread":0.2535618971619531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732956268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49768457,0.00049450446,0.4909426,0.0005585892,0.00003800839,0.00014120067,0.00005078945,0.00037034854,0.0097194165],"genre_scores_gemma":[0.8905853,0.00021092324,0.10745464,0.00015874245,0.000027553884,0.0001377496,0.00008108545,0.00006706007,0.0012769281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987619,0.0006304986,0.000059072503,0.00012514298,0.00030828314,0.00011513099],"domain_scores_gemma":[0.99623317,0.002839134,0.0002732693,0.00020760605,0.00035451676,0.00009236038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021310395,0.0005542852,0.00079778593,0.00094377034,0.00047318582,0.0011745738,0.0006541621,0.00082478777,0.0011600516],"category_scores_gemma":[0.007769537,0.00028800394,0.00042918598,0.0008461742,0.000956006,0.0009558161,0.0011677175,0.00070785545,0.00017688963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035210644,0.00035583624,0.010840264,0.00024118497,0.00013862536,0.00054884836,0.00077356416,0.79619074,0.022044385,0.027096307,0.0013364448,0.14008181],"study_design_scores_gemma":[0.00008555845,0.00044756097,0.0024067173,0.000037107893,0.00004648588,0.00023083187,0.00017275372,0.97466904,0.0053223157,0.015170408,0.0013885077,0.000022783459],"about_ca_topic_score_codex":0.0013393308,"about_ca_topic_score_gemma":0.001745945,"teacher_disagreement_score":0.0021310395,"about_ca_system_score_codex":0.00061514956,"about_ca_system_score_gemma":0.0007044345,"threshold_uncertainty_score":0.011270165},"labels":[],"label_agreement":null},{"id":"W2734849651","doi":"10.1145/3067695.3067726","title":"Evolutionary computation in network management and security","year":2017,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Dalhousie University","keywords":"Citation; Evolutionary computation; Computer science; Computation; Operations research; Library science; Artificial intelligence; Engineering; Algorithm","score_opus":0.018798048576519847,"score_gpt":0.24817520331043738,"score_spread":0.22937715473391754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734849651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008772807,0.1987874,0.5762826,0.01975235,0.007092531,0.0001293337,0.00042100236,0.0011520265,0.1876099],"genre_scores_gemma":[0.18260218,0.27470627,0.25810623,0.0039842944,0.012413212,0.0004943621,0.0018798078,0.0010828776,0.2647308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962413,0.0001403754,0.000017317929,0.00006566168,0.00010819403,0.0000443109],"domain_scores_gemma":[0.99939394,0.00039019188,0.000017598322,0.000042459367,0.00010597187,0.000049841066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008873178,0.0009332151,0.00064648635,0.0009514799,0.0004802798,0.002081325,0.0006738613,0.0012513084,0.016945405],"category_scores_gemma":[0.002085081,0.00037943412,0.0007676723,0.0013121832,0.0009524127,0.0018196929,0.0010405127,0.0025356854,0.0031485567],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052239993,0.000064701366,0.00061804306,0.00055547146,0.0000994847,0.0001674338,0.00025103588,0.049024206,0.0016396828,0.35588995,0.15416941,0.4374684],"study_design_scores_gemma":[0.000023502385,0.00006358475,0.0010118339,0.0005350692,0.000043310323,0.0002713737,0.000152554,0.08095125,0.001069095,0.36979455,0.5460354,0.00004833583],"about_ca_topic_score_codex":0.0020972926,"about_ca_topic_score_gemma":0.002956501,"teacher_disagreement_score":0.016945405,"about_ca_system_score_codex":0.0012891797,"about_ca_system_score_gemma":0.0010573831,"threshold_uncertainty_score":0.05668801},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04521956076042407,"score_gpt":0.293682996712566,"score_spread":0.2484634359521419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736737873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006296972,0.00017041905,0.97531384,0.00041415327,0.000058423437,0.00009396583,0.000019343106,0.00022048816,0.017412541],"genre_scores_gemma":[0.3362987,0.0003268001,0.6482215,0.0006043519,0.00008594945,0.00081896683,0.00006151511,0.00011154936,0.013470601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887115,0.0002777302,0.00006685522,0.0002542105,0.00045916653,0.00007089192],"domain_scores_gemma":[0.99950254,0.00022039932,0.000046730074,0.0000838077,0.00011159233,0.000034912602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012792497,0.0004696554,0.0004028055,0.0005949572,0.0010559482,0.0011207381,0.0010931148,0.0013684051,0.0042024716],"category_scores_gemma":[0.0016093586,0.00044870848,0.0008277908,0.0003575815,0.002738628,0.0019906124,0.0022060333,0.0012361882,0.00084428914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033315806,0.00003721967,0.0002872869,0.00013566294,0.000030071753,0.00014670324,0.00040385604,0.025407903,0.036008663,0.87949765,0.0015112263,0.05650044],"study_design_scores_gemma":[0.00007916634,0.00033166882,0.00044499163,0.000081364946,0.000068077294,0.0007936065,0.00016102535,0.16917369,0.030377662,0.706601,0.09182251,0.00006510916],"about_ca_topic_score_codex":0.0003387914,"about_ca_topic_score_gemma":0.00027032165,"teacher_disagreement_score":0.0042024716,"about_ca_system_score_codex":0.0007886618,"about_ca_system_score_gemma":0.00075250183,"threshold_uncertainty_score":0.014058709},"labels":[],"label_agreement":null},{"id":"W2741017123","doi":"10.1109/cem.2017.7991862","title":"A novel massively-parallel processing framework for real-time MIMO and smart antenna array beam control","year":2017,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Dataflow; Computer science; Massively parallel; MIMO; Graphics processing unit; Graphics; Parallel processing; Parallel computing; Computational science; Computer hardware; Beamforming; Computer graphics (images); Telecommunications","score_opus":0.01869744357005282,"score_gpt":0.2733704878329659,"score_spread":0.2546730442629131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741017123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022487955,0.000038959275,0.99576855,0.000042962292,0.000023211898,0.000015054485,0.000016767988,0.0008638849,0.0009817717],"genre_scores_gemma":[0.12992464,0.00007851227,0.86739004,0.00007808359,0.000032489792,0.00011054112,0.00009709147,0.0001503296,0.0021382757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983764,0.000022241027,0.00000741334,0.00003630016,0.000074364485,0.000022069105],"domain_scores_gemma":[0.9998735,0.00003431932,0.000012831277,0.000024014174,0.000040162857,0.000015095468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028191687,0.0005584736,0.0003821928,0.00028350443,0.00033093078,0.0005834289,0.0012591982,0.00042406886,0.0031676302],"category_scores_gemma":[0.00044939233,0.00022153844,0.00034391208,0.00031407364,0.00032535644,0.0006403359,0.00051109784,0.0007634898,0.0007198115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019397998,0.00015001619,0.0005218317,0.00011709619,0.0000637978,0.00017246183,0.000095082396,0.5251831,0.08579708,0.05760978,0.007892511,0.32220325],"study_design_scores_gemma":[0.000015213338,0.000032935353,0.000056471818,0.0000023969537,0.0000051846146,0.000023742296,0.00000449823,0.9855693,0.006104694,0.004678621,0.0035005282,0.000006369976],"about_ca_topic_score_codex":0.001812834,"about_ca_topic_score_gemma":0.0030896699,"teacher_disagreement_score":0.0031676302,"about_ca_system_score_codex":0.00040762845,"about_ca_system_score_gemma":0.00069802115,"threshold_uncertainty_score":0.010596752},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013256513296389086,"score_gpt":0.2633503160558346,"score_spread":0.2500938027594455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755371172","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024186425,0.65791595,0.29568294,0.0054129697,0.0009843237,0.00007231162,0.00009023028,0.0002802655,0.015374607],"genre_scores_gemma":[0.44592214,0.3486313,0.1911507,0.0020357124,0.005180261,0.0001602446,0.0005130403,0.00019466916,0.0062119537],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985587,0.00041694826,0.000102819984,0.00036855997,0.00046001462,0.00009298664],"domain_scores_gemma":[0.99655825,0.0022691563,0.00019850816,0.00018064206,0.00068784866,0.00010559694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045937216,0.000775999,0.0019223337,0.0015741416,0.0004409483,0.0031212869,0.0018338924,0.0013137663,0.0018878612],"category_scores_gemma":[0.006503034,0.00035984573,0.00064554863,0.0021586963,0.00093367894,0.0028966044,0.0010859066,0.0012930558,0.0006374685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001644308,0.00019049947,0.0024119623,0.00093011785,0.00023886605,0.000075263895,0.00010599596,0.0109778205,0.0023909386,0.025139049,0.004032793,0.95334226],"study_design_scores_gemma":[0.00015179296,0.0011661414,0.009022546,0.0016432318,0.0009658551,0.0021689462,0.00058727065,0.52611214,0.013192609,0.21242923,0.23228323,0.00027705933],"about_ca_topic_score_codex":0.001168955,"about_ca_topic_score_gemma":0.0011267585,"teacher_disagreement_score":0.0045937216,"about_ca_system_score_codex":0.0007584401,"about_ca_system_score_gemma":0.0009085628,"threshold_uncertainty_score":0.024294198},"labels":[],"label_agreement":null},{"id":"W2761970546","doi":"10.1109/cibcb.2017.8058532","title":"Hybridization and ring optimization for larger sets of embeddable biomarkers","year":2017,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Guelph","funders":"","keywords":"Computer science; Algorithm; Code (set theory); Metric (unit); Ring (chemistry); Set (abstract data type); Alphabet; Levenshtein distance; Point (geometry); Evolutionary algorithm; Genetic algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning; Engineering","score_opus":0.017591924693344724,"score_gpt":0.27656566580256553,"score_spread":0.2589737411092208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761970546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23804194,0.00049351447,0.7521959,0.00042888918,0.00007737259,0.00008812823,0.00006687183,0.00059938396,0.008008014],"genre_scores_gemma":[0.5807118,0.00016260822,0.41286382,0.00021255531,0.00002978823,0.00014609966,0.00012432282,0.0001869023,0.005562023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893683,0.0003546604,0.00004519967,0.00031508735,0.00022899668,0.000119209464],"domain_scores_gemma":[0.99450374,0.003977927,0.00042294565,0.00056653406,0.00036734872,0.00016147496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026982105,0.00077344466,0.0010642628,0.00075190084,0.00052828423,0.0009531271,0.0014089202,0.0013606993,0.002901161],"category_scores_gemma":[0.0101375,0.00046676866,0.00088944286,0.000517374,0.0013728556,0.0023802242,0.0016826206,0.0013804619,0.00045539578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016157137,0.00012992967,0.0012227965,0.00009859476,0.00005766738,0.00007784231,0.00010029908,0.8983383,0.014162856,0.039331753,0.0005927873,0.045725547],"study_design_scores_gemma":[0.000018696153,0.00016674859,0.00016625713,0.0000093033195,0.000018511635,0.00003307564,0.00002965399,0.97938436,0.008849868,0.010435239,0.00087357056,0.0000147406045],"about_ca_topic_score_codex":0.0011113728,"about_ca_topic_score_gemma":0.0013706367,"teacher_disagreement_score":0.002901161,"about_ca_system_score_codex":0.0013541353,"about_ca_system_score_gemma":0.0007508858,"threshold_uncertainty_score":0.01426971},"labels":[],"label_agreement":null},{"id":"W2765509542","doi":"","title":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","year":2009,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science; Publishing; Evolutionary computation; Track (disk drive); Operations research; Political science; Law; Artificial intelligence; Mathematics","score_opus":0.016683599167998064,"score_gpt":0.24074105901689855,"score_spread":0.2240574598489005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765509542","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02300215,0.09235796,0.5677367,0.016101856,0.038287986,0.0009134326,0.0048261266,0.0057173283,0.2510564],"genre_scores_gemma":[0.2009517,0.07099389,0.3706579,0.006459461,0.0095861815,0.0011214251,0.015205676,0.0032487763,0.32177493],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859375,0.00047802043,0.00011921842,0.00025445272,0.000442417,0.00011221324],"domain_scores_gemma":[0.99772125,0.0010627195,0.000100792444,0.00034981963,0.00058328686,0.00018221221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022630545,0.0011185346,0.0014155289,0.0011391796,0.00046715344,0.0035464696,0.0015606656,0.00165283,0.048558384],"category_scores_gemma":[0.006150651,0.00030748322,0.0008803986,0.00092707534,0.001157708,0.0020071198,0.0013434497,0.0024353294,0.012411002],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023984342,0.00014075014,0.002099938,0.001128936,0.0004347943,0.00027336436,0.00020800215,0.021789614,0.0049493094,0.053046137,0.33171403,0.5839752],"study_design_scores_gemma":[0.000070187605,0.00021285104,0.0024048842,0.00054255454,0.00014269579,0.0005455054,0.00014970786,0.041644488,0.0025760788,0.06877691,0.8828597,0.00007443794],"about_ca_topic_score_codex":0.0020494284,"about_ca_topic_score_gemma":0.0022769808,"teacher_disagreement_score":0.048558384,"about_ca_system_score_codex":0.00096798525,"about_ca_system_score_gemma":0.001833148,"threshold_uncertainty_score":0.162444},"labels":[],"label_agreement":null},{"id":"W2765557598","doi":"10.1109/tciaig.2017.2766980","title":"Discovering Agent Behaviors Through Code Reuse: Examples From Half-Field Offense and Ms. Pac-Man","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Games","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reuse; Computer science; Task (project management); Code (set theory); Code reuse; Field (mathematics); Modular design; Genetic programming; Domain (mathematical analysis); Artificial intelligence; Function (biology); State (computer science); Machine learning; Software engineering; Human–computer interaction; Programming language; Engineering; Systems engineering; Software","score_opus":0.03455042442923823,"score_gpt":0.28432642967877675,"score_spread":0.24977600524953852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765557598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6786386,0.0018843223,0.29545444,0.0010813768,0.0000839858,0.00023617808,0.00035223147,0.002094668,0.020174189],"genre_scores_gemma":[0.9055451,0.0004069711,0.08977259,0.00015994682,0.000013365248,0.00012418229,0.00036165447,0.00018314034,0.0034329107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935204,0.00028173113,0.000022284907,0.00010587409,0.00015689763,0.00008121334],"domain_scores_gemma":[0.9977463,0.001551361,0.0000997124,0.00035799012,0.00015177277,0.00009283817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011209735,0.00076150143,0.0004648695,0.00057534745,0.00061521266,0.0005021955,0.0011786204,0.0012666839,0.0012527544],"category_scores_gemma":[0.004471395,0.00027413116,0.0004934909,0.00047797046,0.0013790171,0.000847374,0.0010564508,0.0014027482,0.00026039613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003699514,0.0005262547,0.010041525,0.00041661866,0.00012251931,0.0011236191,0.00096799235,0.7899097,0.008773548,0.019822177,0.005136688,0.16278942],"study_design_scores_gemma":[0.000050756786,0.00028563206,0.0023884864,0.000031658812,0.00001967098,0.00029542219,0.00025844332,0.9634685,0.006919281,0.018423662,0.007827193,0.00003132709],"about_ca_topic_score_codex":0.005078297,"about_ca_topic_score_gemma":0.008955335,"teacher_disagreement_score":0.005078297,"about_ca_system_score_codex":0.00057376374,"about_ca_system_score_gemma":0.0006175617,"threshold_uncertainty_score":0.010097444},"labels":[],"label_agreement":null},{"id":"W2765566141","doi":"10.1109/cig.2017.8080423","title":"Evolved communication strategies and emergent behaviour of multi-agents in pursuit domains","year":2017,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Outcome (game theory); Synchronization (alternating current); Domain (mathematical analysis); Simple (philosophy); Reinforcement learning; Tracking (education); Artificial intelligence; Human–computer interaction; Distributed computing; Channel (broadcasting); Psychology; Computer network","score_opus":0.06137127864165906,"score_gpt":0.3347600200252422,"score_spread":0.27338874138358316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765566141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94525546,0.000063658066,0.051899295,0.00012135592,0.0000061265246,0.000014765242,0.000011373756,0.000037213027,0.0025908665],"genre_scores_gemma":[0.9921069,0.00003222902,0.007275068,0.000009878256,0.0000013689348,0.000015118092,0.000011538988,0.000009318677,0.00053848344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998324,0.000078526464,0.000009085955,0.000022679227,0.000034101675,0.000023272047],"domain_scores_gemma":[0.99915636,0.00039348652,0.00019446033,0.00006388205,0.00010513112,0.00008664542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047328303,0.00021758508,0.00017476433,0.00033541856,0.00030777475,0.00063262536,0.0003818796,0.00047576855,0.00052446185],"category_scores_gemma":[0.0031946674,0.00015534293,0.0001679111,0.0001501764,0.00073545927,0.000701324,0.0005718144,0.0003499098,0.000074442774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020428881,0.00016692784,0.016661273,0.00012599846,0.0001429191,0.00096323213,0.0014989475,0.7742078,0.06738666,0.1087624,0.00043864193,0.02944094],"study_design_scores_gemma":[0.000029280127,0.00010976546,0.0032048784,0.000010790279,0.000016481574,0.00014127727,0.0003140516,0.9670174,0.0044308817,0.024196122,0.0005131254,0.00001596579],"about_ca_topic_score_codex":0.0007505639,"about_ca_topic_score_gemma":0.0005532564,"teacher_disagreement_score":0.0007505639,"about_ca_system_score_codex":0.0005161377,"about_ca_system_score_gemma":0.00029413938,"threshold_uncertainty_score":0.0037448406},"labels":[],"label_agreement":null},{"id":"W2766605685","doi":"10.1007/978-3-319-77583-8_3","title":"Non-photorealistic Rendering with Cartesian Genetic Programming Using Graphics Processing Units","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Rendering (computer graphics); Computer science; Computer graphics (images); Genetic programming; Population; Evolutionary algorithm; Artificial intelligence; Computer vision","score_opus":0.02509104614888687,"score_gpt":0.2526769971125446,"score_spread":0.22758595096365772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766605685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01156855,0.00019191319,0.9643922,0.00008018105,0.000097943324,0.000042696956,0.000034938454,0.0012717027,0.022319943],"genre_scores_gemma":[0.2049535,0.0002822135,0.77752554,0.000082957275,0.000029929084,0.00009034794,0.000105309286,0.0006484568,0.016281746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998012,0.00003407964,0.0000054674106,0.000031936856,0.000113268965,0.000014067401],"domain_scores_gemma":[0.9998056,0.00009714652,0.000010763024,0.00004480319,0.000030999032,0.000010782143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025132907,0.00058557425,0.00048923393,0.00030987224,0.0002647374,0.0012268166,0.0010927281,0.0006314947,0.008237189],"category_scores_gemma":[0.00065539643,0.00040564148,0.0007255663,0.00042533706,0.00057342474,0.0005750749,0.0008240941,0.0011906106,0.0012144886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019036801,0.00012306935,0.0005032176,0.000408416,0.00009807378,0.00033908398,0.00043906824,0.35771027,0.13649403,0.18077803,0.007127084,0.31578922],"study_design_scores_gemma":[0.00005825141,0.000088927554,0.00023139243,0.000035462952,0.000024602943,0.00031385059,0.00004406345,0.93998104,0.018264214,0.026909634,0.014019572,0.000028964316],"about_ca_topic_score_codex":0.0012331047,"about_ca_topic_score_gemma":0.0013823879,"teacher_disagreement_score":0.008237189,"about_ca_system_score_codex":0.0004790013,"about_ca_system_score_gemma":0.0004088505,"threshold_uncertainty_score":0.027556121},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019995423766872505,"score_gpt":0.2768263841359542,"score_spread":0.25683096036908165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768421170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046525104,0.00013906146,0.994422,0.00011256804,0.000019882973,0.000013814074,0.000012381699,0.0001801397,0.00044769642],"genre_scores_gemma":[0.28082484,0.00031232327,0.7152293,0.0001304143,0.000108603366,0.00015574765,0.00011122188,0.00024404435,0.0028835144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930227,0.00030560943,0.000042163345,0.00011551219,0.00019177828,0.00004267354],"domain_scores_gemma":[0.99805546,0.0013092324,0.0001187938,0.00023271544,0.00024845634,0.000035414832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017037798,0.0005712904,0.0011563683,0.0010343139,0.00044561946,0.0010767289,0.001107119,0.0011756775,0.0016662048],"category_scores_gemma":[0.006328037,0.0006051176,0.0011338887,0.0009578536,0.0006065212,0.001569369,0.0011895949,0.0013912785,0.00040946697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008000044,0.00014752905,0.0012988675,0.00012715216,0.00011656537,0.00010198856,0.000072066796,0.5431708,0.0054528415,0.071219824,0.0018408791,0.37637144],"study_design_scores_gemma":[0.000003570668,0.000014455786,0.00009230944,0.000004036361,0.0000057714583,0.0000129956925,0.0000023944594,0.98849595,0.0003991601,0.01064322,0.0003223256,0.0000037009088],"about_ca_topic_score_codex":0.0021949208,"about_ca_topic_score_gemma":0.0028697485,"teacher_disagreement_score":0.0021949208,"about_ca_system_score_codex":0.0006952159,"about_ca_system_score_gemma":0.0009959722,"threshold_uncertainty_score":0.009010553},"labels":[],"label_agreement":null},{"id":"W2771070736","doi":"10.15353/vsnl.v3i1.161","title":"Polyploidism in Deep Neural Networks: m-Parent Evolutionary Synthesis of Deep Neural Networks in Varying Population Sizes","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Vision and Imaging Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Nvidia","keywords":"MNIST database; Artificial neural network; Artificial intelligence; Modern evolutionary synthesis; Population; Deep neural networks; Computer science; Evolutionary algorithm; Evolutionary acquisition of neural topologies; Biology; Evolutionary biology; Time delay neural network; Demography","score_opus":0.011659559114029314,"score_gpt":0.27425315886240553,"score_spread":0.2625935997483762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771070736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7787293,0.00041572106,0.21596724,0.00027177014,0.000061791536,0.00006755458,0.00010011198,0.0004071491,0.0039793723],"genre_scores_gemma":[0.92542934,0.00012659881,0.072530374,0.000088800116,0.000005789285,0.000092408154,0.00009723623,0.000055186694,0.0015743409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981815,0.00005418334,0.00001086269,0.000047604917,0.00004446539,0.000024752659],"domain_scores_gemma":[0.9989728,0.00062419387,0.0001048559,0.00012644078,0.000124154,0.00004755659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716174,0.00036892202,0.00031514262,0.00028793255,0.00025966825,0.00041124804,0.0005261776,0.00060034584,0.0013431585],"category_scores_gemma":[0.0036390645,0.00022427028,0.00029055338,0.00022985577,0.00044959824,0.0008130168,0.00057275535,0.000619696,0.0001461803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039543564,0.00022355614,0.0048461366,0.00019166384,0.00010075153,0.0005390821,0.0003522972,0.64016,0.17782257,0.024078917,0.0010150452,0.15027453],"study_design_scores_gemma":[0.000040961615,0.00025409678,0.00082179543,0.000011501688,0.000026279062,0.00010480904,0.000053447664,0.945613,0.046491254,0.0046533444,0.001916111,0.000013404276],"about_ca_topic_score_codex":0.0006230281,"about_ca_topic_score_gemma":0.0011515552,"teacher_disagreement_score":0.0013431585,"about_ca_system_score_codex":0.0006193125,"about_ca_system_score_gemma":0.00028729034,"threshold_uncertainty_score":0.0044934154},"labels":[],"label_agreement":null},{"id":"W2775486426","doi":"10.11575/prism/24736","title":"A Framework for Improving Systems Performance by Minimizing Burstiness","year":2017,"lang":"en","type":"dissertation","venue":"PRISM (University of Calgary)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Burstiness; Computer science; Computer network","score_opus":0.012194241518858428,"score_gpt":0.226191948495836,"score_spread":0.21399770697697756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775486426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027596788,0.00037246657,0.9923226,0.00048782697,0.00004147391,0.00011597475,0.000052761636,0.00049193704,0.0033553527],"genre_scores_gemma":[0.22959012,0.0014165387,0.763768,0.00023256082,0.00019803793,0.0007688624,0.00016483027,0.00030900873,0.003552032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524695,0.0017185985,0.0003741084,0.00064284954,0.0016285786,0.00038898468],"domain_scores_gemma":[0.9944681,0.0029490665,0.0005538451,0.0009423486,0.00083679485,0.00024971872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075711873,0.0027603002,0.0012978425,0.0022795452,0.0011168481,0.0042585176,0.0036217575,0.0017796957,0.0034845504],"category_scores_gemma":[0.010841937,0.001123091,0.0015283994,0.0012578263,0.0032169642,0.0059554824,0.0035129737,0.0039167427,0.00096451864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093238865,0.00014461156,0.0007179946,0.00035422403,0.00007260827,0.00015700312,0.0004971623,0.49707583,0.008663815,0.44204494,0.0021974135,0.047981244],"study_design_scores_gemma":[0.000036344158,0.00020169672,0.00016577092,0.00010749293,0.0000360287,0.00008561359,0.00009932013,0.8686601,0.002273388,0.11746434,0.010828426,0.000041534247],"about_ca_topic_score_codex":0.0036346035,"about_ca_topic_score_gemma":0.0023711766,"teacher_disagreement_score":0.0075711873,"about_ca_system_score_codex":0.0022509377,"about_ca_system_score_gemma":0.003329011,"threshold_uncertainty_score":0.04004079},"labels":[],"label_agreement":null},{"id":"W2783272115","doi":"10.1109/icmla.2017.00-41","title":"Evolving Adaptive Traffic Signal Controllers for a Real Scenario Using Genetic Programming with an Epigenetic Mechanism","year":2017,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Mechanism (biology); Computer science; Genetic programming; Traffic signal; Epigenetics; SIGNAL (programming language); Real-time computing; Artificial intelligence; Biology; Programming language; Genetics","score_opus":0.034315909369502746,"score_gpt":0.27313176824835095,"score_spread":0.2388158588788482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783272115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43213272,0.00020279942,0.5607507,0.00021108447,0.00007880606,0.00011405118,0.000042494517,0.0004443869,0.0060227755],"genre_scores_gemma":[0.85334694,0.00016187794,0.14411512,0.00007591097,0.00001209109,0.00017018184,0.000056701883,0.000040479288,0.0020207097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998845,0.000029859557,0.000004707701,0.000028161694,0.000032639426,0.000020141655],"domain_scores_gemma":[0.99975497,0.00013724752,0.000032081258,0.000022281052,0.000036615977,0.00001691015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036283402,0.00047234946,0.0003028163,0.00034567312,0.00022022554,0.00050414033,0.00071827346,0.0006528694,0.0009827899],"category_scores_gemma":[0.001133481,0.00017625977,0.00034340753,0.00025917627,0.0005417941,0.00031849713,0.00045739964,0.00059280515,0.000090790454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045829664,0.00010821393,0.0013659284,0.000045076733,0.00005047247,0.00014856744,0.000098360346,0.9255518,0.02624006,0.011070127,0.00021137448,0.03506425],"study_design_scores_gemma":[0.000018478713,0.00007571606,0.00026660692,0.0000056844256,0.000022493277,0.000030893003,0.00002183165,0.9926925,0.0039559864,0.002174686,0.0007257755,0.000009292158],"about_ca_topic_score_codex":0.0013848183,"about_ca_topic_score_gemma":0.001235878,"teacher_disagreement_score":0.0013848183,"about_ca_system_score_codex":0.00038033078,"about_ca_system_score_gemma":0.0004891957,"threshold_uncertainty_score":0.0032877922},"labels":[],"label_agreement":null},{"id":"W2784330914","doi":"10.1007/978-3-030-36568-4_14","title":"A Random Walk Through Experimental Mathematics","year":2020,"lang":"en","type":"preprint","venue":"Springer proceedings in mathematics & statistics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics education; Presentation (obstetrics); Adventure; Sister; Course (navigation); Random walk; Computer science; Pedagogy; Mathematics; Psychology; Sociology; Engineering; Artificial intelligence; Statistics","score_opus":0.033325143667175816,"score_gpt":0.29629727922955795,"score_spread":0.26297213556238214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784330914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10239193,0.0019944475,0.8583169,0.009425224,0.00045245021,0.00020260584,0.00077798485,0.0005812236,0.025857268],"genre_scores_gemma":[0.87576604,0.0018815356,0.10599841,0.0010543336,0.00055060646,0.0007054127,0.00054156163,0.00034336638,0.0131588075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994609,0.0035053731,0.00020867518,0.00073001377,0.00074556546,0.00020135845],"domain_scores_gemma":[0.931695,0.05498018,0.0028559184,0.0075600985,0.0018930685,0.0010157863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009141418,0.0006564708,0.0013024998,0.0027847518,0.0012021341,0.003999708,0.001987216,0.0027138973,0.01347723],"category_scores_gemma":[0.069575906,0.00079917227,0.0010141564,0.0019778928,0.004925499,0.013725961,0.0022867043,0.0029104273,0.0009980086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024810824,0.000031996326,0.000740885,0.000060163056,0.000023489005,0.0000374817,0.00008149576,0.006607093,0.00022188174,0.9858554,0.0009593055,0.0053560934],"study_design_scores_gemma":[0.000013222951,0.000016197282,0.00030285175,0.000018583933,0.000008095201,0.000035944286,0.00002804881,0.03748574,0.00014498513,0.9609492,0.0009859774,0.0000112114],"about_ca_topic_score_codex":0.0008801545,"about_ca_topic_score_gemma":0.00060330477,"teacher_disagreement_score":0.01347723,"about_ca_system_score_codex":0.0017834022,"about_ca_system_score_gemma":0.0009510756,"threshold_uncertainty_score":0.04834503},"labels":[],"label_agreement":null},{"id":"W2786183742","doi":"10.1109/crv.2018.00058","title":"Nature vs. Nurture: The Role of Environmental Resources in Evolutionary Deep Intelligence","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Nvidia","keywords":"Nature versus nurture; MNIST database; Modern evolutionary synthesis; Artificial neural network; Computer science; Process (computing); Artificial intelligence; Evolutionary algorithm; Deep neural networks; Machine learning; Biology; Evolutionary biology; Genetics","score_opus":0.00489399679339767,"score_gpt":0.2192119511954768,"score_spread":0.21431795440207912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786183742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8043154,0.0005631505,0.18580996,0.00059636374,0.000043227235,0.000031241714,0.000097222335,0.00027506883,0.00826838],"genre_scores_gemma":[0.9630757,0.00012993753,0.035991933,0.00004798377,0.000005310339,0.000023137078,0.00005178979,0.000043016884,0.00063122815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998394,0.00005832355,0.000008069174,0.00004321934,0.000032531552,0.000018334093],"domain_scores_gemma":[0.99915123,0.0005669031,0.00005215023,0.00012861044,0.000067918845,0.000033202075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006705278,0.00035015625,0.0002698854,0.0001712138,0.00022042764,0.0007150474,0.00047785544,0.00048708697,0.0014400712],"category_scores_gemma":[0.0033639865,0.00021696235,0.00021938201,0.00022163754,0.00052746787,0.0014140394,0.0005447909,0.00067395635,0.00014665653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026235616,0.00012651629,0.0072510615,0.00020602,0.00010498856,0.00028708807,0.0002217277,0.73622966,0.08651606,0.028012441,0.00058446865,0.14019756],"study_design_scores_gemma":[0.000028244225,0.00023736064,0.0017451184,0.000020664467,0.000041759056,0.000111851565,0.0000806276,0.9458093,0.036143508,0.013088576,0.0026755456,0.000017434382],"about_ca_topic_score_codex":0.0005074704,"about_ca_topic_score_gemma":0.0013324235,"teacher_disagreement_score":0.0014400712,"about_ca_system_score_codex":0.0004004576,"about_ca_system_score_gemma":0.00027672615,"threshold_uncertainty_score":0.0048175454},"labels":[],"label_agreement":null},{"id":"W2791595938","doi":"10.1007/978-3-319-77583-8_8","title":"evoExplore: Multiscale Visualization of Evolutionary Histories in Virtual Reality","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Virtual reality; Game engine; Visualization; Human–computer interaction; Evolutionary algorithm; Virtual machine; Artificial intelligence","score_opus":0.022578637477935783,"score_gpt":0.27175204969171174,"score_spread":0.24917341221377595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791595938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030262763,0.001501046,0.91533595,0.0009952107,0.0003948583,0.00012119384,0.004515883,0.025603227,0.021269843],"genre_scores_gemma":[0.36473262,0.0033131707,0.5927397,0.0005950853,0.00028592424,0.000511371,0.0058270586,0.011229253,0.020765869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989796,0.000022686772,0.000005535064,0.0000144236155,0.000043420223,0.000016039274],"domain_scores_gemma":[0.9996227,0.00024804255,0.000018109897,0.000040308514,0.000033236665,0.000037558413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032538,0.00069307024,0.00050365255,0.00092373317,0.00027741137,0.0018535658,0.0010692837,0.0008897065,0.037186842],"category_scores_gemma":[0.0014737605,0.00049089105,0.00064272806,0.00072205806,0.00028767955,0.0012727955,0.0013914447,0.0012973277,0.002718404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041850918,0.00022089311,0.0019644767,0.0022179724,0.0002590636,0.0013627955,0.0026755459,0.17090592,0.06679436,0.10551413,0.17326394,0.47440234],"study_design_scores_gemma":[0.00021267845,0.00009848235,0.0031153301,0.00034460038,0.000077960794,0.0011622491,0.0004110979,0.658466,0.020702051,0.086021475,0.2291903,0.00019780452],"about_ca_topic_score_codex":0.0012687667,"about_ca_topic_score_gemma":0.002218316,"teacher_disagreement_score":0.037186842,"about_ca_system_score_codex":0.00022701154,"about_ca_system_score_gemma":0.0003805491,"threshold_uncertainty_score":0.124402344},"labels":[],"label_agreement":null},{"id":"W2792319327","doi":"10.3390/w10020142","title":"Gene Expression Programming Coupled with Unsupervised Learning: A Two-Stage Learning Process in Multi-Scale, Short-Term Water Demand Forecasts","year":2018,"lang":"en","type":"article","venue":"Water","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Cluster analysis; Gene expression programming; Term (time); Computer science; Scale (ratio); Unsupervised learning; Process (computing); Stage (stratigraphy); Machine learning; Artificial intelligence; Expression (computer science); Series (stratigraphy); Data mining; Geography","score_opus":0.022487061769244494,"score_gpt":0.27463007173298404,"score_spread":0.25214300996373956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792319327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050452936,0.00012504082,0.94850945,0.0001728452,0.00001765459,0.000027741586,0.000023932856,0.00011340851,0.00055697217],"genre_scores_gemma":[0.8277978,0.00016866597,0.16996112,0.00007484036,0.000047541493,0.00012913656,0.000077349374,0.00004932344,0.0016942497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996088,0.00016896581,0.000016504437,0.00010107283,0.00007006934,0.000034519897],"domain_scores_gemma":[0.9991252,0.00061467284,0.000088449044,0.000048000617,0.000093932715,0.000029677112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011009822,0.00044907755,0.00061503035,0.0002947165,0.00025906807,0.0005933572,0.0010511156,0.0008542028,0.00044916256],"category_scores_gemma":[0.0024142587,0.00041158102,0.0005699796,0.0004825364,0.00073838595,0.0010456912,0.00066602055,0.0008952291,0.00010454577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031123105,0.00002941847,0.00107856,0.000025888228,0.000029127994,0.00003466954,0.00005569058,0.96507406,0.0015424021,0.0046667615,0.000115634706,0.027316652],"study_design_scores_gemma":[0.00000110804,0.000008067188,0.00011473537,6.81085e-7,0.0000014898241,0.000002501223,0.0000025519446,0.9985044,0.00023085877,0.0010799716,0.000051575553,0.0000021064418],"about_ca_topic_score_codex":0.003657236,"about_ca_topic_score_gemma":0.0032572667,"teacher_disagreement_score":0.003657236,"about_ca_system_score_codex":0.00055472757,"about_ca_system_score_gemma":0.0006596885,"threshold_uncertainty_score":0.007271886},"labels":[],"label_agreement":null},{"id":"W2792671280","doi":"10.1155/2019/7293193","title":"Image Evolution Using 2D Power Spectra","year":2019,"lang":"en","type":"article","venue":"Complexity","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Heuristics; Genetic programming; Metric (unit); Pattern recognition (psychology); Image (mathematics); Perception; Field (mathematics); Machine learning; Computer vision; Mathematics","score_opus":0.0378402936208699,"score_gpt":0.2797179422517128,"score_spread":0.2418776486308429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792671280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16417852,0.00013229129,0.8278271,0.00021192509,0.000033567958,0.00009925466,0.000035152494,0.0004537608,0.00702841],"genre_scores_gemma":[0.7449058,0.00011606011,0.25195757,0.00009335319,0.000012143088,0.00014588579,0.00005092407,0.00013823468,0.0025799486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.00008030582,0.000012302233,0.000047953305,0.00010287761,0.00002437706],"domain_scores_gemma":[0.99894637,0.00063008064,0.00010433762,0.00012688365,0.00014616983,0.00004624852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077021465,0.0004914826,0.00037673017,0.0007521617,0.000297645,0.0011722132,0.00063123443,0.00072761445,0.0018087622],"category_scores_gemma":[0.003326882,0.00029295107,0.00044660433,0.00038293094,0.00071283954,0.0011728023,0.00083571114,0.00052059145,0.00023835825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007671118,0.00011377338,0.00302025,0.000105007544,0.000059640766,0.00018631299,0.0003811273,0.78309125,0.051904928,0.037791837,0.00061614567,0.12265308],"study_design_scores_gemma":[0.000013456106,0.000058743986,0.0006253223,0.0000099672525,0.00001002924,0.00007170689,0.00003936854,0.98421323,0.005249209,0.008681791,0.0010150487,0.000012069374],"about_ca_topic_score_codex":0.0010498486,"about_ca_topic_score_gemma":0.00089865614,"teacher_disagreement_score":0.0018087622,"about_ca_system_score_codex":0.00082043227,"about_ca_system_score_gemma":0.0003409258,"threshold_uncertainty_score":0.0060508847},"labels":[],"label_agreement":null},{"id":"W2801596509","doi":"10.1139/tcsme-2005-0014","title":"SENSOR BASED ROBOT LOCALISATION AND NAVIGATION: USING INTERVAL ANALYSIS AND NONLINEAR KALMAN FILTERS.","year":2005,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Extended Kalman filter; Kalman filter; Invariant extended Kalman filter; Inertial measurement unit; Control theory (sociology); Computer science; Robot; Fast Kalman filter; Encoder; Sensor fusion; Mobile robot; Monte Carlo localization; Artificial intelligence; Computer vision","score_opus":0.013532198304187807,"score_gpt":0.22325940936403857,"score_spread":0.20972721105985076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801596509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011607645,0.0015608268,0.99639136,0.00004447043,0.00004427594,0.000008139286,0.000009258482,0.00017207395,0.0006088224],"genre_scores_gemma":[0.297722,0.0054811914,0.69332886,0.00009033626,0.0002863073,0.00013403778,0.00017293697,0.00010700976,0.0026772744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952316,0.00014165175,0.00003206284,0.000103512946,0.00017872492,0.00002093548],"domain_scores_gemma":[0.99923885,0.0003839007,0.00012344222,0.00006466155,0.00017025834,0.000018984174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083316397,0.0007031795,0.0006957067,0.00079861155,0.0001843151,0.000846523,0.000678268,0.0007635764,0.0008821889],"category_scores_gemma":[0.0037757973,0.0003325523,0.0006438028,0.00085578446,0.00059110887,0.0016383553,0.0007156617,0.00076501555,0.0004842819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014205472,0.00004133512,0.0012123247,0.00042387185,0.000180912,0.00015326476,0.00019894782,0.3703265,0.01110205,0.054979485,0.0022517473,0.5589875],"study_design_scores_gemma":[0.000015157225,0.000075017495,0.0007627552,0.00004642155,0.000050792303,0.00013313114,0.0000273137,0.96022093,0.0035184214,0.028114915,0.0069986875,0.000036443784],"about_ca_topic_score_codex":0.0024713627,"about_ca_topic_score_gemma":0.0014681974,"teacher_disagreement_score":0.0024713627,"about_ca_system_score_codex":0.00048736532,"about_ca_system_score_gemma":0.00043120424,"threshold_uncertainty_score":0.0049139857},"labels":[],"label_agreement":null},{"id":"W2802803714","doi":"","title":"When Machines Design Machines!: ICED11 Futurology Keynote","year":2011,"lang":"en","type":"article","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cochrane","funders":"","keywords":"Computer science; Engineering ethics; Engineering","score_opus":0.02394983062227794,"score_gpt":0.2075804330920825,"score_spread":0.18363060246980456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802803714","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004012417,0.0546704,0.026697403,0.23511422,0.1698977,0.0000742691,0.0010893684,0.0010936159,0.5073507],"genre_scores_gemma":[0.071796015,0.021286175,0.011667932,0.016764486,0.03838195,0.00013820696,0.0014261644,0.0013434595,0.83719563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980903,0.00059585756,0.00005970256,0.00030156676,0.0005966946,0.00035578344],"domain_scores_gemma":[0.9973117,0.0011493909,0.000075092874,0.0003154649,0.0005726021,0.00057577406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044378694,0.001098222,0.0007733083,0.0010504728,0.00267157,0.009161646,0.0014313883,0.0042342143,0.08835648],"category_scores_gemma":[0.0079069175,0.00060568965,0.0007502728,0.0011044192,0.0020086246,0.008059098,0.0030668161,0.005337415,0.022898918],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010880353,0.000034945813,0.0000865811,0.00009600568,0.000009080974,0.000053515072,0.0001124236,0.0007629226,0.00021375062,0.09076662,0.84781396,0.059941374],"study_design_scores_gemma":[0.000019331535,0.00002683232,0.00019226507,0.00014403394,0.0000066007437,0.000059444894,0.00013874362,0.0007652139,0.00038702748,0.053220816,0.9450241,0.00001558003],"about_ca_topic_score_codex":0.0029866616,"about_ca_topic_score_gemma":0.0062435633,"teacher_disagreement_score":0.08835648,"about_ca_system_score_codex":0.004087848,"about_ca_system_score_gemma":0.0022429854,"threshold_uncertainty_score":0.29558188},"labels":[],"label_agreement":null},{"id":"W2806746572","doi":"10.1016/j.tcs.2018.05.033","title":"Unary patterns under permutations","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Unary operation; Combinatorics; Permutation (music); Mathematics; Alphabet; Integer (computer science); Word (group theory); Discrete mathematics; Function (biology); Combinatorics on words; Computer science","score_opus":0.01175273181836696,"score_gpt":0.2700564735631998,"score_spread":0.25830374174483284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806746572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34560326,0.0011378712,0.34659508,0.005420368,0.0011343986,0.00020497626,0.0014081075,0.0010783961,0.2974175],"genre_scores_gemma":[0.8721448,0.00090619706,0.0474453,0.0010738429,0.0007842224,0.00026960473,0.001061812,0.00051309064,0.07580111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734503,0.00070614746,0.00022307965,0.000656967,0.00058302656,0.0004857883],"domain_scores_gemma":[0.99615085,0.0015875879,0.0004375704,0.0010038893,0.00052675017,0.0002933736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195688,0.0006077266,0.0009608371,0.0019151615,0.0023976509,0.0059737205,0.0011082096,0.0017309331,0.012699144],"category_scores_gemma":[0.0064256485,0.0006344794,0.0010095095,0.002596564,0.0030586089,0.009975806,0.0031483024,0.0025735558,0.0028949457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050551615,0.000017644861,0.00017627765,0.000024453559,0.0000062087493,0.000080084224,0.00019945294,0.00028631085,0.0006096413,0.98273724,0.0013355686,0.014476481],"study_design_scores_gemma":[0.000008549126,0.000010629904,0.00008608273,0.0000083294035,0.0000068927975,0.00017659407,0.00005643968,0.0009935573,0.00054970337,0.9938261,0.004269491,0.000007487036],"about_ca_topic_score_codex":0.0004348195,"about_ca_topic_score_gemma":0.00036323376,"teacher_disagreement_score":0.012699144,"about_ca_system_score_codex":0.0009988201,"about_ca_system_score_gemma":0.00085554476,"threshold_uncertainty_score":0.042482913},"labels":[],"label_agreement":null},{"id":"W2808118317","doi":"10.22214/ijraset.2018.4686","title":"Design and Implementation of a Low Power Vedic Multiplier","year":2018,"lang":"en","type":"article","venue":"International Journal for Research in Applied Science and Engineering Technology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Multiplier (economics); Computer science; Arithmetic; Mathematics; Economics","score_opus":0.037975967247133535,"score_gpt":0.39198389520560883,"score_spread":0.3540079279584753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808118317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089958325,0.0011789255,0.88749284,0.00031466715,0.00029275124,0.00023312781,0.00015397862,0.0015070261,0.018868422],"genre_scores_gemma":[0.5025429,0.0006059133,0.4852064,0.00024731352,0.00007013407,0.00013606492,0.00019577249,0.000047129677,0.010948343],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998179,0.000028081402,0.000020245614,0.00003283637,0.000075958174,0.000024972378],"domain_scores_gemma":[0.9997607,0.000046504752,0.000036976006,0.000030090367,0.0001132944,0.000012412087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020708564,0.0003125449,0.00027299818,0.00046217427,0.00032335508,0.00056550285,0.0009940034,0.0004836515,0.004292926],"category_scores_gemma":[0.0004530574,0.0002442165,0.00027307993,0.00023853534,0.00014661683,0.0006300251,0.0002468014,0.00029340948,0.0009533351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043856417,0.00006923196,0.0009009168,0.0007172201,0.00012548789,0.0009501436,0.00019331738,0.021215325,0.6122205,0.027783956,0.0028446415,0.33254072],"study_design_scores_gemma":[0.00019322775,0.00247644,0.0025470892,0.00021180832,0.00026636609,0.005829202,0.00012944422,0.21337095,0.62177604,0.008191209,0.1448696,0.00013859381],"about_ca_topic_score_codex":0.00026164917,"about_ca_topic_score_gemma":0.00048927916,"teacher_disagreement_score":0.004292926,"about_ca_system_score_codex":0.00028801218,"about_ca_system_score_gemma":0.00043203146,"threshold_uncertainty_score":0.014361322},"labels":[],"label_agreement":null},{"id":"W2809097245","doi":"10.1162/evco_a_00232","title":"Emergent Solutions to High-Dimensional Multitask Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Task (project management); Neuroevolution; Representation (politics); Face (sociological concept); Machine learning; A priori and a posteriori; Artificial neural network","score_opus":0.018052462115047116,"score_gpt":0.26334435724358846,"score_spread":0.24529189512854133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809097245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0811915,0.00017164995,0.9124926,0.00059733604,0.000051135146,0.00004180891,0.00005849081,0.00024008667,0.005155415],"genre_scores_gemma":[0.9250739,0.00012798552,0.07076025,0.00012549222,0.00003067999,0.00017942858,0.00007241527,0.000054200027,0.0035757916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968493,0.0001292879,0.000015580641,0.00005881278,0.000052241816,0.000059193335],"domain_scores_gemma":[0.99866736,0.0008096903,0.00018887897,0.000096912176,0.0001215011,0.00011557683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009203601,0.0006009598,0.00067597587,0.000314115,0.00039265183,0.00075925223,0.0009821025,0.0009939437,0.0019617483],"category_scores_gemma":[0.0032876423,0.0003147667,0.00047151968,0.00020966868,0.0010798707,0.00067235605,0.0013379807,0.0011388286,0.00015680224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030152498,0.000029663686,0.0006226606,0.00003207452,0.000031494637,0.00006853536,0.000054303593,0.96011704,0.00071333465,0.030706296,0.00053247245,0.0070619932],"study_design_scores_gemma":[0.000009063062,0.000009807471,0.000068358975,0.0000023339883,0.0000024861529,0.000006955069,0.000009607675,0.9829914,0.00009244428,0.016584348,0.00022093186,0.000002230742],"about_ca_topic_score_codex":0.0021081404,"about_ca_topic_score_gemma":0.0024807835,"teacher_disagreement_score":0.0021081404,"about_ca_system_score_codex":0.00084373186,"about_ca_system_score_gemma":0.0008087515,"threshold_uncertainty_score":0.00656265},"labels":[],"label_agreement":null},{"id":"W2864378606","doi":"10.24963/ijcai.2018/740","title":"Emergent Tangled Program Graphs in Multi-Task Learning","year":2018,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Modularity (biology); Representation (politics); Simple (philosophy); Artificial intelligence; Process (computing); Genetic programming; Control (management); Task analysis; Human–computer interaction; Machine learning; Distributed computing; Programming language","score_opus":0.024566346383513543,"score_gpt":0.2990231576891648,"score_spread":0.27445681130565125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2864378606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07747728,0.00014506358,0.9189815,0.0004102467,0.000027041768,0.00003208531,0.00003854113,0.0002623843,0.0026258142],"genre_scores_gemma":[0.87007385,0.00014800509,0.12642825,0.00014455972,0.000023463475,0.00015210286,0.0000716263,0.00009495895,0.0028632083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971694,0.000111994785,0.000008941353,0.000069146525,0.000049129492,0.000043884644],"domain_scores_gemma":[0.99908876,0.000554905,0.00010988382,0.00007087505,0.000074260686,0.000101209735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066593837,0.0004953133,0.00052178645,0.00038298572,0.0003430952,0.0006289839,0.0010461954,0.0010078897,0.0015195871],"category_scores_gemma":[0.0029255676,0.00032569905,0.000438779,0.0003145303,0.0012631051,0.0012118488,0.0010848375,0.0011415075,0.00013892184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001743229,0.000023638173,0.00047823775,0.000023686194,0.000014912133,0.00007810718,0.00006455618,0.9465367,0.0010280669,0.041571114,0.0003180623,0.00984547],"study_design_scores_gemma":[0.000004623635,0.000010436807,0.00004443825,0.0000019241247,0.0000021612173,0.0000073415863,0.0000067549163,0.9697761,0.00012703822,0.02983964,0.00017748655,0.0000020240277],"about_ca_topic_score_codex":0.0028903368,"about_ca_topic_score_gemma":0.003013091,"teacher_disagreement_score":0.0028903368,"about_ca_system_score_codex":0.0008076879,"about_ca_system_score_gemma":0.00083914684,"threshold_uncertainty_score":0.0058602095},"labels":[],"label_agreement":null},{"id":"W2872295371","doi":"10.1145/3205651.3208282","title":"EvoNN","year":2018,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Evolutionary computation; Activation function; Process (computing); Computation; Function (biology); Artificial intelligence; Algorithm; Programming language; Artificial neural network; Evolutionary biology","score_opus":0.01971042689048337,"score_gpt":0.24282985155771283,"score_spread":0.22311942466722945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2872295371","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011382568,0.0015244753,0.09792648,0.0033584852,0.0033115353,0.0002094638,0.0152283525,0.04042074,0.82663786],"genre_scores_gemma":[0.11844991,0.0019291468,0.056860935,0.0051398263,0.00074066344,0.00032917605,0.0489416,0.017099772,0.75050896],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876946,0.00017980693,0.00007097561,0.0003133506,0.0004712049,0.00019509073],"domain_scores_gemma":[0.99852365,0.00020989146,0.000052935477,0.0004599279,0.0006062497,0.00014729294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093223836,0.00095966324,0.0004805924,0.001384343,0.0012231201,0.00345788,0.0015469865,0.0012517876,0.26952112],"category_scores_gemma":[0.0045196167,0.00036971614,0.0005704595,0.0010460174,0.00060132734,0.0029331665,0.003904393,0.0012529107,0.17099918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004283885,0.000095231815,0.002650591,0.0004765257,0.000042552747,0.00041781692,0.00029224597,0.002330878,0.004667581,0.08852843,0.5066709,0.39339894],"study_design_scores_gemma":[0.0000247829,0.00002863533,0.0006719533,0.00011395046,0.000011789296,0.00030287006,0.00009146595,0.0025937033,0.0031575651,0.015412104,0.9775709,0.00002029279],"about_ca_topic_score_codex":0.0025766983,"about_ca_topic_score_gemma":0.003384586,"teacher_disagreement_score":0.26952112,"about_ca_system_score_codex":0.0009643013,"about_ca_system_score_gemma":0.0011630113,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2887329137","doi":"10.1007/978-3-319-98812-2_34","title":"Learning Ranking Functions by Genetic Programming Revisited","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Singapore Management University; University of Science and Technology of China; Libera Università di Bolzano; Zayed University; University of the Aegean; Universidade Federal de Minas Gerais; Università degli Studi di Brescia; Università della Calabria; Università di Bologna; Turun Yliopisto; Université de Bourgogne; Högskolan i Skövde; Universität Wien; Massey University; Huazhong University of Science and Technology; Victoria University; Dalian University of Technology; Università degli Studi di Milano-Bicocca; Kangwon National University; Silesian University of Technology; Université de Fribourg; Sun Yat-sen University; Universidad de Zaragoza; National University of Singapore; University of Auckland; Griffith University; Université de Nantes; Monash University; Indian Council of Agricultural Research; Technische Universität Kaiserslautern; Macquarie University; Technische Universität Darmstadt; Aalborg Universitet; Università degli Studi di Napoli Federico II; Universidade de Coimbra; Memorial University of Newfoundland; Universität Passau; Georgia Southern University; University of Missouri-Kansas City; Northern Kentucky University; Ostravská Univerzita v Ostravě; Tallinna Tehnikaülikool; Victoria University of Wellington; Nanzan University; Université de Montpellier; University of Cyprus; National Taipei University of Technology; National Sun Yat-sen University; University of South Australia; University of Missouri; Universidad de Málaga; České Vysoké Učení Technické v Praze; Università degli Studi di Milano","keywords":"Genetic programming; Computer science; Ranking (information retrieval); Context (archaeology); Information retrieval; State (computer science); Artificial intelligence; Machine learning; Theoretical computer science; World Wide Web; Programming language","score_opus":0.010931864353635157,"score_gpt":0.2339228040835175,"score_spread":0.22299093972988235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887329137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008211871,0.0015514515,0.9817093,0.0011245898,0.00014390568,0.000027256476,0.00003292688,0.00018694383,0.007011698],"genre_scores_gemma":[0.3451265,0.002972051,0.6252689,0.00091874774,0.00061652635,0.00023064461,0.00023163282,0.0003456497,0.02428931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999213,0.0004025,0.000028848439,0.00013555342,0.00015676647,0.00006330604],"domain_scores_gemma":[0.99805105,0.0014836321,0.000072813054,0.00014515186,0.00020166296,0.000045643224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021555738,0.00083239353,0.0017966938,0.00089082366,0.0004949515,0.0017359961,0.0028234692,0.0022557396,0.0042444137],"category_scores_gemma":[0.0075053936,0.00064869743,0.00088778924,0.0017824416,0.0015126142,0.002917278,0.0012265256,0.0030601698,0.00094863167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047896614,0.0001032361,0.0006739336,0.00019989265,0.00012724503,0.000085039974,0.00013544621,0.5184058,0.0011467605,0.21728651,0.007635623,0.25415254],"study_design_scores_gemma":[0.000009393356,0.000020174593,0.0001162796,0.000028045733,0.000014530716,0.000024527331,0.000015640111,0.8757982,0.00023570986,0.122133285,0.0015932638,0.000011036795],"about_ca_topic_score_codex":0.0032576972,"about_ca_topic_score_gemma":0.003574768,"teacher_disagreement_score":0.0042444137,"about_ca_system_score_codex":0.0011198417,"about_ca_system_score_gemma":0.00083232054,"threshold_uncertainty_score":0.0141990185},"labels":[],"label_agreement":null},{"id":"W2892621690","doi":"10.5220/0006927800550066","title":"Expansion: A Novel Mutation Operator for Genetic Programming","year":2018,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Genetic programming; Computer science; Operator (biology); Mutation; Artificial intelligence; Genetics; Biology","score_opus":0.02213526835623724,"score_gpt":0.27822016451985343,"score_spread":0.2560848961636162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892621690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014995761,0.00018662133,0.9795513,0.00014380204,0.00014855413,0.000076710945,0.00004523905,0.0011190453,0.0037330317],"genre_scores_gemma":[0.30347773,0.00034976445,0.68302447,0.00040406597,0.00017961895,0.00022449349,0.00016756958,0.0006337761,0.011538469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955136,0.000104922925,0.0000267412,0.0000800781,0.0001938577,0.00004308908],"domain_scores_gemma":[0.9995123,0.00024220314,0.00003238319,0.00007499133,0.00010399468,0.000034017394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057710713,0.00070029387,0.000631535,0.0005444965,0.00035875133,0.00057693664,0.0014202663,0.0009985147,0.0035044127],"category_scores_gemma":[0.0016423952,0.00024489037,0.00050554716,0.00058667036,0.0006779882,0.0011116618,0.0014109744,0.0013908142,0.00063122326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032431862,0.00023469857,0.0009580035,0.0003006129,0.00008350108,0.0006687732,0.00031543616,0.09665542,0.13181563,0.1194169,0.007741347,0.64148533],"study_design_scores_gemma":[0.00011171615,0.00025183233,0.0005293133,0.00006501336,0.00010056557,0.0009158448,0.00004896816,0.88439345,0.03883866,0.05251577,0.02217085,0.000058057816],"about_ca_topic_score_codex":0.00058840064,"about_ca_topic_score_gemma":0.0007919751,"teacher_disagreement_score":0.0035044127,"about_ca_system_score_codex":0.00025957936,"about_ca_system_score_gemma":0.00046870904,"threshold_uncertainty_score":0.011723459},"labels":[],"label_agreement":null},{"id":"W2893797465","doi":"10.1007/978-3-030-16667-0_1","title":"Deep Learning Concepts for Evolutionary Art","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Genetic programming; Deep learning; Classifier (UML); Pattern recognition (psychology); Evolutionary algorithm; Feature (linguistics); Contextual image classification; Heuristic; Machine learning; Image (mathematics)","score_opus":0.013516434680253545,"score_gpt":0.25900320158066004,"score_spread":0.2454867669004065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893797465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008062087,0.017371766,0.79837674,0.003201592,0.0012604415,0.00003561406,0.00019633911,0.00033852947,0.1711569],"genre_scores_gemma":[0.34593508,0.021077702,0.39180362,0.0015156188,0.002255761,0.00022426025,0.0004332269,0.00050378614,0.23625092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999038,0.000021107373,0.00000629197,0.000021739565,0.000037668426,0.000009391519],"domain_scores_gemma":[0.99984634,0.00008049819,0.000011126737,0.000022612421,0.000026009739,0.000013455163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030739093,0.00050688954,0.00036680576,0.00064894697,0.0003425146,0.0013290497,0.00069581746,0.0008036611,0.011307504],"category_scores_gemma":[0.0009798482,0.0002344613,0.00036420813,0.00082942675,0.0013893864,0.0024803008,0.0010391913,0.0023039181,0.0014619748],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004404501,0.000007748133,0.000044018157,0.00008779271,0.0000060741836,0.0000140317425,0.000059271613,0.005265172,0.00054045056,0.9116019,0.0053569456,0.07701228],"study_design_scores_gemma":[0.0000025698646,0.000009148042,0.0000971429,0.000054651693,0.0000048978877,0.00004993621,0.000016512033,0.029428374,0.0003763031,0.9215095,0.048444774,0.0000061145115],"about_ca_topic_score_codex":0.0006852771,"about_ca_topic_score_gemma":0.0011586987,"teacher_disagreement_score":0.011307504,"about_ca_system_score_codex":0.0009561153,"about_ca_system_score_gemma":0.00032782424,"threshold_uncertainty_score":0.037827373},"labels":[],"label_agreement":null},{"id":"W2895736968","doi":"10.3389/fpls.2018.01412","title":"Minimal-Risk Seed Heteromorphism: Proportions of Seed Morphs for Optimal Risk-Averse Heteromorphic Strategies","year":2018,"lang":"en","type":"article","venue":"Frontiers in Plant Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Biology; Botany","score_opus":0.012707443289538278,"score_gpt":0.23975346731188624,"score_spread":0.22704602402234797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895736968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90048736,0.00009450318,0.09582153,0.00012661019,0.000006273582,0.000043435964,0.00015398036,0.00009849622,0.0031678518],"genre_scores_gemma":[0.97090036,0.00001940878,0.02859272,0.000019453963,0.0000029655673,0.00003545975,0.00011751276,0.00002615905,0.00028597313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996873,0.00008098763,0.000020423071,0.00009463367,0.00006939836,0.000047305624],"domain_scores_gemma":[0.99818414,0.0012291293,0.00024640135,0.00012544748,0.0000957229,0.00011910658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010538574,0.0003656653,0.00042893586,0.00090641977,0.0002502791,0.00082536764,0.00045870277,0.000757101,0.002659487],"category_scores_gemma":[0.008941938,0.00025521,0.00045572102,0.00027689346,0.0008498702,0.0008086517,0.0005443188,0.00042954696,0.00028116794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089614873,0.0002987026,0.11492985,0.0001785941,0.00013967982,0.00033177543,0.00030251886,0.72791594,0.039582603,0.050715916,0.0007979243,0.0639103],"study_design_scores_gemma":[0.00009126112,0.00021864798,0.036765628,0.00003380441,0.000047997575,0.00047591075,0.00021103291,0.91002494,0.010055655,0.04130342,0.0007297993,0.000041962798],"about_ca_topic_score_codex":0.0005238044,"about_ca_topic_score_gemma":0.0007658179,"teacher_disagreement_score":0.002659487,"about_ca_system_score_codex":0.00048618822,"about_ca_system_score_gemma":0.0005220977,"threshold_uncertainty_score":0.008896887},"labels":[],"label_agreement":null},{"id":"W2905077346","doi":"10.1109/ictai.2018.00097","title":"Inferring Stochastic L-Systems Using a Hybrid Greedy Algorithm","year":2018,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rewriting; Computer science; A priori and a posteriori; Algorithm; Context (archaeology); Theoretical computer science; Sequence (biology); Formal grammar; Greedy algorithm; Set (abstract data type); Software system; Process (computing); Software; Programming language; Artificial intelligence; Rule-based machine translation","score_opus":0.028344967868779436,"score_gpt":0.26972802123930795,"score_spread":0.2413830533705285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905077346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02758061,0.000084449995,0.96891695,0.00010650301,0.000015316578,0.00009771672,0.0000946861,0.002140131,0.0009635446],"genre_scores_gemma":[0.2151173,0.00005627035,0.78198946,0.00016335511,0.000020285008,0.0002417951,0.0006309091,0.00037002572,0.0014106696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983026,0.00056005776,0.000107933156,0.00050520647,0.0003417199,0.00018247495],"domain_scores_gemma":[0.99546474,0.0034451485,0.00023254608,0.0003315204,0.00039962018,0.00012636477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022054394,0.0013265788,0.0012152687,0.0023197467,0.0011292509,0.0013409926,0.002131787,0.001857562,0.0030274072],"category_scores_gemma":[0.008825204,0.0011575067,0.0019078128,0.0010849864,0.0014043748,0.0014362261,0.0020057037,0.0012835066,0.0008351544],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023926499,0.00016919183,0.004971565,0.00017309742,0.00016652491,0.00035508207,0.00030356605,0.7700575,0.008069178,0.024673231,0.0018919171,0.18892989],"study_design_scores_gemma":[0.000016750852,0.00001879889,0.00010011519,0.0000069526723,0.000012430963,0.0000313821,0.000018524253,0.9913453,0.00090108137,0.00722886,0.00031138165,0.000008384741],"about_ca_topic_score_codex":0.009297438,"about_ca_topic_score_gemma":0.014517591,"teacher_disagreement_score":0.009297438,"about_ca_system_score_codex":0.0018653024,"about_ca_system_score_gemma":0.0036193961,"threshold_uncertainty_score":0.018486619},"labels":[],"label_agreement":null},{"id":"W2910950947","doi":"10.1162/978-0-262-31050-5-ch024","title":"An ecology-based evolutionary algorithm to evolve solutions to complex problems","year":2012,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Army Research Office; College of Engineering, Michigan State University; Defense Advanced Research Projects Agency; Michigan State University; Ford Motor Company; National Science Foundation","keywords":"Evolutionary algorithm; Computer science; Suite; Population; Evolutionary computation; Ecology; Natural (archaeology); Artificial intelligence; Evolutionary dynamics; Theoretical computer science; Geography; Biology","score_opus":0.03954680335559447,"score_gpt":0.2837504091749189,"score_spread":0.24420360581932443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910950947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010552461,0.00036480726,0.98248017,0.00032622804,0.00010046208,0.00012379151,0.000035402318,0.00036625154,0.005650564],"genre_scores_gemma":[0.11282932,0.00043914435,0.88192195,0.00022898751,0.00004192719,0.00058422954,0.00012885168,0.00009411917,0.0037314068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996892,0.00011153655,0.000023715502,0.00004720535,0.00010497013,0.000023300116],"domain_scores_gemma":[0.99941194,0.00039577213,0.00002828174,0.00004205488,0.0000940983,0.00002787909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063758,0.0009286565,0.0007371651,0.0009896287,0.00062621024,0.0007306374,0.001410053,0.001525413,0.002631773],"category_scores_gemma":[0.0040108915,0.0004337677,0.0007487376,0.00096463354,0.00067793584,0.0008838211,0.0013174315,0.001431826,0.00040360502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022534046,0.00009864871,0.0013263011,0.00010025477,0.000094999545,0.00015252804,0.00012249521,0.84496135,0.0021422151,0.043671608,0.0025062643,0.10480079],"study_design_scores_gemma":[0.000026538572,0.000028411407,0.0000853409,0.000012854919,0.000013739723,0.000054169923,0.0000107111055,0.9876314,0.00029067456,0.008647905,0.0031922061,0.0000061210144],"about_ca_topic_score_codex":0.0021126552,"about_ca_topic_score_gemma":0.0030859036,"teacher_disagreement_score":0.002631773,"about_ca_system_score_codex":0.0005187661,"about_ca_system_score_gemma":0.0010935585,"threshold_uncertainty_score":0.008804202},"labels":[],"label_agreement":null},{"id":"W2912336406","doi":"10.32470/ccn.2018.1109-0","title":"Evidence for chunking vs. statistical learning in motor sequence production","year":2018,"lang":"en","type":"article","venue":"2018 Conference on Cognitive Computational Neuroscience","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Chunking (psychology); Computer science; Sequence (biology); Production (economics); Artificial intelligence; Statistical learning; Natural language processing; Speech recognition","score_opus":0.18488984138996217,"score_gpt":0.37914123268283073,"score_spread":0.19425139129286856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912336406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.922577,0.0014007702,0.04924581,0.00158038,0.00032743783,0.000117342555,0.0011295968,0.00051605323,0.023105526],"genre_scores_gemma":[0.9881989,0.00027675336,0.008609708,0.0002683053,0.00009819299,0.00007324812,0.00068971637,0.00023330319,0.0015518145],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99719715,0.00082207186,0.00036673335,0.00083324057,0.00054880575,0.00023196913],"domain_scores_gemma":[0.9003329,0.074953996,0.0078017204,0.0104566,0.005004535,0.0014502648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056672688,0.0006579201,0.000626298,0.0012132394,0.00042014665,0.0028832518,0.0011962149,0.0021290367,0.011940446],"category_scores_gemma":[0.07212021,0.0010202082,0.0005144199,0.0007897429,0.0018687156,0.004087866,0.002406722,0.002169699,0.0023520857],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0063587083,0.0012248848,0.16524333,0.0017986689,0.00075835735,0.0016468753,0.0036147097,0.019421438,0.31285834,0.045209877,0.005006028,0.4368589],"study_design_scores_gemma":[0.00057904946,0.0013642987,0.7093916,0.0003924499,0.00037986165,0.0044239466,0.001134378,0.08720756,0.04779698,0.14156312,0.0055080066,0.00025877278],"about_ca_topic_score_codex":0.0013046421,"about_ca_topic_score_gemma":0.00093612896,"teacher_disagreement_score":0.011940446,"about_ca_system_score_codex":0.00039893537,"about_ca_system_score_gemma":0.0007140284,"threshold_uncertainty_score":0.039944768},"labels":[],"label_agreement":null},{"id":"W2912577640","doi":"10.1007/978-1-4842-3988-9_10","title":"Searching and Sorting","year":2019,"lang":"en","type":"book-chapter","venue":"Apress eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hamilton Health Sciences","funders":"","keywords":"Sorting; Computer science; Data structure; Sorting algorithm; Theoretical computer science; Linked list; Algorithm","score_opus":0.024667387864618435,"score_gpt":0.24505025491596594,"score_spread":0.2203828670513475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912577640","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016126577,0.026202027,0.17269006,0.0054371897,0.0038779303,0.0001964904,0.000800623,0.0020649747,0.787118],"genre_scores_gemma":[0.024115432,0.028244162,0.19854577,0.0048192358,0.0014437165,0.00029978686,0.0016282598,0.001971938,0.7389316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998192,0.00024479628,0.00010295008,0.0004460143,0.0008700462,0.0001441311],"domain_scores_gemma":[0.9989396,0.00041534132,0.000034880824,0.00025929202,0.00027854103,0.0000724059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009667336,0.0014314232,0.00095366983,0.0023569132,0.0025928938,0.008228518,0.0019397184,0.0021885545,0.06384261],"category_scores_gemma":[0.0040543186,0.00068004156,0.0011026269,0.0038165802,0.0050515267,0.013268961,0.003278762,0.0034369736,0.03423775],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002400696,0.000016823004,0.00007381003,0.00029471,0.00000911703,0.000046752448,0.00049460726,0.0006345676,0.0006652225,0.7496659,0.10346945,0.14460503],"study_design_scores_gemma":[0.0000037839063,0.000011086616,0.000048505743,0.00015847372,0.000004424708,0.00016523179,0.00011270643,0.00053839793,0.0004852909,0.1415227,0.85693836,0.0000110677065],"about_ca_topic_score_codex":0.0029008521,"about_ca_topic_score_gemma":0.003488866,"teacher_disagreement_score":0.06384261,"about_ca_system_score_codex":0.0025366093,"about_ca_system_score_gemma":0.0023694276,"threshold_uncertainty_score":0.21357483},"labels":[],"label_agreement":null},{"id":"W2913620949","doi":"","title":"Proceedings of the 9th annual conference companion on Genetic and evolutionary computation","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolutionary computation; Computer science; Computation; Artificial intelligence; Programming language","score_opus":0.013130967192827133,"score_gpt":0.24147634732260345,"score_spread":0.22834538012977632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913620949","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018069897,0.061222665,0.37430274,0.015621549,0.20721196,0.0005303933,0.0017617899,0.007085186,0.31419387],"genre_scores_gemma":[0.059110697,0.024897395,0.09052962,0.0026404662,0.018524041,0.00025397327,0.0045582675,0.0029062156,0.7965793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921036,0.00018685835,0.000039915398,0.0001297443,0.00034943412,0.000083657615],"domain_scores_gemma":[0.9977149,0.00037509672,0.00006037075,0.00046252823,0.0010462988,0.00034079317],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001757417,0.00096259353,0.0019333712,0.0011636906,0.00079038326,0.003820536,0.0018341716,0.0014607671,0.083858624],"category_scores_gemma":[0.0037415135,0.00035432386,0.0007359648,0.0012489733,0.00078758074,0.0022949425,0.0017800125,0.002115635,0.036326487],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003057155,0.00020307337,0.00067854126,0.0002603682,0.00009738837,0.00015628179,0.00009792734,0.0018262491,0.0025518604,0.009231352,0.6644169,0.32017434],"study_design_scores_gemma":[0.00006472526,0.00017045731,0.0014781185,0.00016373408,0.00010360858,0.00045453766,0.00010774328,0.015074981,0.0026670648,0.014950565,0.96472764,0.0000366684],"about_ca_topic_score_codex":0.0020941931,"about_ca_topic_score_gemma":0.004873905,"teacher_disagreement_score":0.9161414,"about_ca_system_score_codex":0.00075700256,"about_ca_system_score_gemma":0.0011348142,"threshold_uncertainty_score":0.28053504},"labels":[],"label_agreement":null},{"id":"W2914338467","doi":"","title":"Revised Selected Papers of the 17th European Conference on Genetic Programming - Volume 8599","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Volume (thermodynamics); Computer science","score_opus":0.011571052860941627,"score_gpt":0.21031619780821895,"score_spread":0.19874514494727732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914338467","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004615837,0.07040308,0.045696966,0.056920763,0.60141873,0.00043877633,0.0038672483,0.0010278997,0.21561071],"genre_scores_gemma":[0.01923013,0.037941936,0.01881529,0.0050397064,0.06774109,0.00018051808,0.0043103257,0.0014486178,0.84529227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838555,0.00032036015,0.00010930872,0.00026528866,0.00079229655,0.00012732041],"domain_scores_gemma":[0.99439514,0.0009389568,0.00014554996,0.00038449146,0.0036073017,0.00052854366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562506,0.0013577329,0.0018139939,0.0033912465,0.00094126665,0.0048371484,0.0017521608,0.0016858694,0.15951058],"category_scores_gemma":[0.007056505,0.00037410395,0.0011375475,0.0035135895,0.00076089974,0.0022224053,0.0011761754,0.0026326077,0.04403356],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020416318,0.00009770554,0.00021981566,0.00036921716,0.00005324833,0.00009332566,0.000047865786,0.0018668558,0.0008148339,0.005266819,0.85653853,0.13442756],"study_design_scores_gemma":[0.000056966393,0.00011022832,0.0009923611,0.00036444952,0.000073366784,0.00016818715,0.000073074414,0.0023883684,0.0009386373,0.007968958,0.9868384,0.000026926757],"about_ca_topic_score_codex":0.0040331483,"about_ca_topic_score_gemma":0.0070494083,"teacher_disagreement_score":0.15951058,"about_ca_system_score_codex":0.002313873,"about_ca_system_score_gemma":0.0025169512,"threshold_uncertainty_score":0.53361607},"labels":[],"label_agreement":null},{"id":"W2918004253","doi":"10.1007/978-3-030-03730-7_2","title":"Origins of Stochastic Computing","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Stochastic computing; Computer science; Constructive; Terminology; Stochastic process; Implementation; Architecture; Stochastic modelling; Theoretical computer science; Software engineering; Algorithm; Mathematics; Programming language; Computation","score_opus":0.01810799894685636,"score_gpt":0.24161918417950437,"score_spread":0.223511185232648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918004253","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005468309,0.039852843,0.15218405,0.010798656,0.0021857095,0.000049399714,0.00016702706,0.000270077,0.7890238],"genre_scores_gemma":[0.40887776,0.050848886,0.073883906,0.003585305,0.0046800254,0.00027131368,0.00026674167,0.00056732143,0.45701876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994122,0.00022399658,0.00002404415,0.000095640804,0.00019989887,0.00004425797],"domain_scores_gemma":[0.99899393,0.00067018345,0.000034792523,0.00011505905,0.00014461867,0.00004143548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097435154,0.0007240446,0.0005186887,0.00085023715,0.00093310175,0.0036167763,0.0007657099,0.0015534548,0.008569047],"category_scores_gemma":[0.0036875168,0.0004011086,0.00041575788,0.001142628,0.006002235,0.0029591743,0.0011439965,0.0035102973,0.0024911952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024340802,0.0000037150492,0.000029648701,0.000017036893,0.000002258461,0.0000072516323,0.00007538682,0.0012231314,0.00004573545,0.9864117,0.004530883,0.0076507893],"study_design_scores_gemma":[0.0000027343833,0.00000431555,0.000064585976,0.000047943515,0.0000018684755,0.000023164675,0.000025573776,0.0031324266,0.00009389006,0.90616447,0.09043315,0.0000059533863],"about_ca_topic_score_codex":0.002576359,"about_ca_topic_score_gemma":0.0023415333,"teacher_disagreement_score":0.008569047,"about_ca_system_score_codex":0.0027553362,"about_ca_system_score_gemma":0.0015972301,"threshold_uncertainty_score":0.028666258},"labels":[],"label_agreement":null},{"id":"W2919452396","doi":"10.1162/978-0-262-32621-6-ch108","title":"Evolving Autonomous Agent Controllers as Analytical Mathematical Models","year":2014,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Autonomous agent; Control engineering; Artificial intelligence; Engineering","score_opus":0.01984280675682549,"score_gpt":0.25598515191446486,"score_spread":0.23614234515763938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919452396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12103837,0.00017788495,0.86875725,0.0003393474,0.000041132273,0.000041166764,0.000045113396,0.0002704683,0.009289256],"genre_scores_gemma":[0.7863675,0.0003600961,0.20535778,0.00010496137,0.000018551182,0.00019778116,0.000083083876,0.00007389139,0.00743643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985254,0.000047253692,0.000007324007,0.000020176345,0.000060666844,0.000012035054],"domain_scores_gemma":[0.99970454,0.00015233643,0.00005639368,0.000031558717,0.000040199484,0.00001500125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309017,0.00030726462,0.00029731746,0.000308458,0.00020108314,0.000852585,0.00068011053,0.0005994459,0.0010122948],"category_scores_gemma":[0.0014103276,0.00023229426,0.00035618962,0.00022804091,0.0006458139,0.0008366243,0.00051921996,0.00051645364,0.00020512089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015037258,0.000021230131,0.0002558298,0.000030075475,0.000014070372,0.00007132371,0.00009454588,0.82145727,0.008423867,0.16067284,0.00026957438,0.008674397],"study_design_scores_gemma":[0.0000053585372,0.000008174268,0.000021911934,0.0000022665856,0.000002220934,0.0000129187365,0.0000055508767,0.98305005,0.0008010811,0.015332348,0.0007551115,0.0000030060016],"about_ca_topic_score_codex":0.00081451645,"about_ca_topic_score_gemma":0.0005692195,"teacher_disagreement_score":0.0010122948,"about_ca_system_score_codex":0.0005126301,"about_ca_system_score_gemma":0.000499224,"threshold_uncertainty_score":0.0037193894},"labels":[],"label_agreement":null},{"id":"W2937081431","doi":"10.1007/978-3-030-16670-0_11","title":"A Model of External Memory for Navigation in Partially Observable Visual Reinforcement Learning Tasks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Reinforcement learning; Observability; Recall; Auxiliary memory; State (computer science); Probabilistic logic; Artificial intelligence; Memory model; Process (computing); Human–computer interaction; Shared memory; Cognitive psychology; Programming language","score_opus":0.02948238713968614,"score_gpt":0.2753781425012197,"score_spread":0.24589575536153357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937081431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1505575,0.0009371651,0.81810147,0.0017991512,0.00027042552,0.000092357106,0.0009392065,0.0010155538,0.026287157],"genre_scores_gemma":[0.9544094,0.00042070006,0.02598475,0.00012351054,0.00007509942,0.00016338118,0.00026388976,0.00008419291,0.018475082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996313,0.00009826309,0.000022083601,0.000107836524,0.00005401015,0.000086538006],"domain_scores_gemma":[0.99886864,0.00057587243,0.00016414524,0.00010728667,0.00015884486,0.00012507057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062659266,0.0007319015,0.0016098676,0.00054388685,0.00051554816,0.002255569,0.0035038064,0.0024380162,0.0107023325],"category_scores_gemma":[0.0032930407,0.00064518146,0.001024544,0.00092113035,0.0012590518,0.002259815,0.0014223095,0.0017515603,0.0009829815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018497411,0.00011352157,0.0005918663,0.00012013032,0.000080813676,0.00021293902,0.00014687309,0.82171226,0.0017711419,0.15646939,0.0016887545,0.016907355],"study_design_scores_gemma":[0.00003303974,0.00003648784,0.00012865136,0.00000712057,0.000013985197,0.000021222788,0.00000949591,0.9586708,0.00013375252,0.04067661,0.00025848878,0.000010326662],"about_ca_topic_score_codex":0.011902275,"about_ca_topic_score_gemma":0.0075570624,"teacher_disagreement_score":0.011902275,"about_ca_system_score_codex":0.0015106321,"about_ca_system_score_gemma":0.0013463001,"threshold_uncertainty_score":0.0358029},"labels":[],"label_agreement":null},{"id":"W2939728762","doi":"10.1109/cvprw.2019.00070","title":"Assessing Architectural Similarity in Populations of Deep Neural Networks","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Similarity (geometry); Computer science; Artificial intelligence; Artificial neural network; Selection (genetic algorithm); Process (computing); Architecture; Architectural design; Deep neural networks; Space (punctuation); Machine learning; Geography","score_opus":0.04659981070802097,"score_gpt":0.3181682499864549,"score_spread":0.2715684392784339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939728762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9233751,0.00011432177,0.074924394,0.000070906535,0.00001052696,0.000035039673,0.000030735533,0.00010887904,0.001330081],"genre_scores_gemma":[0.9733902,0.000039525312,0.025943467,0.000022892911,0.0000042496795,0.000043528915,0.00010151932,0.000026941509,0.00042757986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911827,0.0002884407,0.000056230412,0.00019988642,0.00025658534,0.00008061006],"domain_scores_gemma":[0.995849,0.0021559335,0.0005296336,0.0005380685,0.00070324016,0.00022411515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027550417,0.00038249203,0.00059885485,0.0012336705,0.00051070505,0.0012144956,0.00086764037,0.00092478155,0.0009780434],"category_scores_gemma":[0.011010128,0.00049565337,0.0003934876,0.00055415684,0.000887769,0.0013201036,0.0011293736,0.00079722964,0.00011495826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024933307,0.00014816177,0.02831514,0.000062190054,0.00021037721,0.00019193116,0.00039375594,0.8872333,0.020494228,0.015412597,0.00033057565,0.046958532],"study_design_scores_gemma":[0.000013928198,0.00014165163,0.0033252344,0.000005970209,0.000022794553,0.000051057115,0.000104794766,0.9835466,0.004243707,0.008246054,0.00028789154,0.000010303344],"about_ca_topic_score_codex":0.0011310133,"about_ca_topic_score_gemma":0.0017512628,"teacher_disagreement_score":0.0027550417,"about_ca_system_score_codex":0.0010812285,"about_ca_system_score_gemma":0.00043821515,"threshold_uncertainty_score":0.014570236},"labels":[],"label_agreement":null},{"id":"W2940223619","doi":"10.1007/978-3-030-16670-0_12","title":"Fault Detection and Classification for Induction Motors Using Genetic Programming","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Induction motor; Genetic programming; Feature selection; Artificial intelligence; Fault detection and isolation; Machine learning; Support vector machine; Fault (geology); Genetic algorithm; Decision tree; Feature (linguistics); Feature vector; Pattern recognition (psychology); Feature extraction; Engineering","score_opus":0.031873550370144145,"score_gpt":0.26661555339224285,"score_spread":0.23474200302209872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940223619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034459006,0.000495744,0.9622314,0.00011927802,0.00004038367,0.0000411024,0.00003071302,0.0008288526,0.0017534607],"genre_scores_gemma":[0.5400185,0.00041594717,0.45403102,0.00009324605,0.00003600411,0.00010846554,0.00012605895,0.00009758701,0.0050731557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998466,0.000027223661,0.000009124108,0.000037364167,0.000059885977,0.000019775985],"domain_scores_gemma":[0.99960524,0.00024119273,0.000038257927,0.000023893184,0.000083196566,0.000008274472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036180473,0.0005482072,0.00062698993,0.00063150853,0.0002289579,0.0005165031,0.00084013777,0.0010055605,0.0011390721],"category_scores_gemma":[0.0011476033,0.00025509397,0.00051436207,0.00061222276,0.0003199918,0.0004973713,0.00027609762,0.0006429777,0.00028236717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012901537,0.00008717445,0.0011083591,0.00007850495,0.000047442412,0.00006605883,0.00006457419,0.5038126,0.014094534,0.0036106487,0.001328082,0.475573],"study_design_scores_gemma":[0.000004183506,0.000022244862,0.00025009012,0.0000059846684,0.000007952569,0.000019373267,0.0000054010184,0.9954124,0.0022442853,0.0017575317,0.00026733516,0.000003273797],"about_ca_topic_score_codex":0.0031758999,"about_ca_topic_score_gemma":0.0026044645,"teacher_disagreement_score":0.0031758999,"about_ca_system_score_codex":0.00047641824,"about_ca_system_score_gemma":0.00032386166,"threshold_uncertainty_score":0.0063148737},"labels":[],"label_agreement":null},{"id":"W2942631528","doi":"10.13164/mendel.2018.1.017","title":"The Effects of CMA-ES Style Selection and Restart Criteria on DE","year":2018,"lang":"en","type":"article","venue":"MENDEL","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Selection (genetic algorithm); Population; Set (abstract data type); Operator (biology); Differential evolution; Function (biology); Computer science; Mathematics; Artificial intelligence; Evolutionary biology; Sociology; Biology; Demography","score_opus":0.008410064329425423,"score_gpt":0.26269854920294256,"score_spread":0.25428848487351713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942631528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7021997,0.012406834,0.24277885,0.0014271275,0.0007046575,0.00023605513,0.0004119779,0.003372479,0.036462326],"genre_scores_gemma":[0.92824835,0.0010663961,0.06673097,0.00033457796,0.00006854767,0.00009144751,0.00033986464,0.0004902548,0.0026296491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967043,0.001561588,0.00027100721,0.00043449693,0.0007474076,0.0002812246],"domain_scores_gemma":[0.9837024,0.012590602,0.0006343099,0.001455404,0.0013649964,0.00025231286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044282684,0.0014285987,0.00084805005,0.0012146959,0.00079036737,0.0017319665,0.0011217822,0.0011969495,0.0023219879],"category_scores_gemma":[0.023750473,0.00023959912,0.000727176,0.0009914072,0.00082297745,0.0015130572,0.00089090434,0.0012866417,0.00056111946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018346491,0.00052011455,0.010628885,0.00065313414,0.0004647587,0.0005245789,0.00036047347,0.6629242,0.026950616,0.020281332,0.0053730686,0.2694842],"study_design_scores_gemma":[0.00016931981,0.0010509462,0.005214067,0.00016531961,0.00025664538,0.00046921417,0.00021109321,0.94782203,0.029083688,0.0066982456,0.008769419,0.000090071575],"about_ca_topic_score_codex":0.0028400104,"about_ca_topic_score_gemma":0.0028864462,"teacher_disagreement_score":0.0044282684,"about_ca_system_score_codex":0.00089358864,"about_ca_system_score_gemma":0.0005906519,"threshold_uncertainty_score":0.023419201},"labels":[],"label_agreement":null},{"id":"W2949948747","doi":"10.48550/arxiv.1408.2314","title":"A Tentative Role for FOXP2 in the Evolution of Dual Processing Modes and\\n Generative Abilities","year":2014,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"FOXP2; Dual (grammatical number); Generative grammar; Cognitive science; Psychology; Computer science; Cognitive psychology; Artificial intelligence; Biology; Philosophy; Linguistics; Genetics; Gene","score_opus":0.054381765751771116,"score_gpt":0.2094161924522375,"score_spread":0.15503442670046638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949948747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95275396,0.00096871826,0.02588918,0.0021959087,0.00015020273,0.000029577855,0.00012422708,0.0002957361,0.017592587],"genre_scores_gemma":[0.986767,0.0002518022,0.009329998,0.00031458738,0.000034099536,0.000026077987,0.00007140787,0.000041585005,0.0031634436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997453,0.000039657058,0.000008734609,0.00010866743,0.00002630773,0.00007137617],"domain_scores_gemma":[0.9996644,0.00013777013,0.000034489138,0.00005805344,0.000029671473,0.00007568463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010796527,0.00028203917,0.00036270468,0.0006129231,0.0009649604,0.0015669835,0.00097467465,0.0014777931,0.0036283715],"category_scores_gemma":[0.0013610221,0.00025945937,0.00050210237,0.0002731966,0.0033734848,0.0021339464,0.0014448831,0.001464704,0.00031271568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012628256,0.00022196941,0.046351455,0.000308653,0.00011369322,0.0054390403,0.004631593,0.011661984,0.36971623,0.455007,0.0017427157,0.1035429],"study_design_scores_gemma":[0.0006633768,0.000812839,0.096992135,0.00022023443,0.00028138745,0.0072551956,0.0028738603,0.0797976,0.13026863,0.59872705,0.08167005,0.0004377087],"about_ca_topic_score_codex":0.0010556777,"about_ca_topic_score_gemma":0.0012080531,"teacher_disagreement_score":0.0036283715,"about_ca_system_score_codex":0.0006367317,"about_ca_system_score_gemma":0.00067329605,"threshold_uncertainty_score":0.012138128},"labels":[],"label_agreement":null},{"id":"W2950598025","doi":"10.48550/arxiv.1607.05213","title":"mpEAd: Multi-Population EA Diagrams","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Notation; Formalism (music); Computer science; Simple (philosophy); Theoretical computer science; Population; Artificial intelligence; Mathematics; Epistemology","score_opus":0.07301346330097529,"score_gpt":0.1971488351184071,"score_spread":0.12413537181743182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950598025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016781364,0.00020427036,0.9753048,0.00035455372,0.00011967404,0.00005712883,0.00049098604,0.002058386,0.019732146],"genre_scores_gemma":[0.13946356,0.0007595781,0.8338767,0.0004966504,0.000121566685,0.00067880825,0.0012037398,0.0009765536,0.022422807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00024956051,0.00004218094,0.00011670392,0.00012458899,0.000043079064],"domain_scores_gemma":[0.99910504,0.0005297804,0.000074567055,0.000119598066,0.000102015794,0.000068895155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011210387,0.00078156195,0.000404077,0.001040155,0.0007434322,0.002273547,0.0015373256,0.0014773302,0.024808655],"category_scores_gemma":[0.0038440665,0.00034712104,0.00086518715,0.0008954454,0.0008984014,0.0033794185,0.0017652005,0.0018716762,0.0041669547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034976554,0.000021894617,0.00021077375,0.00012769634,0.000016799724,0.00017650925,0.00023261011,0.03854516,0.0015168309,0.91404724,0.007819538,0.03724996],"study_design_scores_gemma":[0.000035951973,0.000032956475,0.00014817838,0.000082299746,0.000018603814,0.00025681895,0.00006543785,0.21176279,0.0019622531,0.5832422,0.20236328,0.000029262212],"about_ca_topic_score_codex":0.0018034128,"about_ca_topic_score_gemma":0.0021800667,"teacher_disagreement_score":0.024808655,"about_ca_system_score_codex":0.0008627179,"about_ca_system_score_gemma":0.0010183661,"threshold_uncertainty_score":0.08299321},"labels":[],"label_agreement":null},{"id":"W2952356721","doi":"10.1038/npre.2009.3913","title":"Design of a dynamic model of genes with multiple autonomous regulatory modules by evolution in silico","year":2010,"lang":"en","type":"preprint","venue":"Nature Precedings","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; National Science Foundation","keywords":"In silico; Benchmark (surveying); Crossover; Computer science; Exploit; Evolutionary algorithm; Genetic algorithm; Computational biology; Artificial intelligence; Gene; Machine learning; Biology; Genetics","score_opus":0.007717461571683098,"score_gpt":0.22871241982902168,"score_spread":0.2209949582573386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952356721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07908594,0.00019776613,0.9139824,0.0003492441,0.0000677285,0.000049441343,0.000108406486,0.00053617713,0.005622907],"genre_scores_gemma":[0.76317525,0.00058458274,0.22953513,0.00013040863,0.000026480073,0.0004992425,0.00024804508,0.00017598526,0.0056248643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987984,0.000031061973,0.0000063319517,0.000033938373,0.00003405113,0.0000147795945],"domain_scores_gemma":[0.9998615,0.000071437236,0.000017444667,0.000017274066,0.00001781729,0.000014583004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028332014,0.0004350162,0.00069970416,0.00026383254,0.00031447725,0.00072053756,0.001134095,0.000997397,0.0014224281],"category_scores_gemma":[0.0005096843,0.00041714733,0.00085938437,0.0002521259,0.00056652626,0.0006092394,0.0005022149,0.000767819,0.00032880175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027566832,0.000025136704,0.000285073,0.00003972354,0.000022891007,0.00007291819,0.000030950745,0.9592106,0.01844235,0.017742576,0.00016582871,0.0039344146],"study_design_scores_gemma":[0.0000141762675,0.000017943788,0.00004843128,0.0000021827116,0.000008936214,0.000018510456,0.000003873392,0.9935968,0.0023526966,0.0028515193,0.0010793719,0.0000055496903],"about_ca_topic_score_codex":0.0011023023,"about_ca_topic_score_gemma":0.0008533269,"teacher_disagreement_score":0.0014224281,"about_ca_system_score_codex":0.00048669148,"about_ca_system_score_gemma":0.00064831827,"threshold_uncertainty_score":0.004758537},"labels":[],"label_agreement":null},{"id":"W2955923207","doi":"10.1002/cjce.23590","title":"Prediction of pressure drop and minimum spouting velocity in draft tube conical spouted beds using genetic programming approach","year":2019,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dimensionless quantity; Pressure drop; Conical surface; Genetic programming; Draft tube; Mechanics; Tube (container); Mathematics; Physics; Geometry; Mechanical engineering; Computer science; Engineering; Artificial intelligence","score_opus":0.011526684272667672,"score_gpt":0.19266883955347494,"score_spread":0.18114215528080727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955923207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74831694,0.00015799198,0.24972868,0.00011384795,0.000016558672,0.00004776328,0.00023737454,0.0003193287,0.0010615222],"genre_scores_gemma":[0.9699864,0.00010004715,0.029357223,0.000015617205,0.0000024558453,0.00006503782,0.0001426327,0.00001550713,0.00031507498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998305,0.000042434305,0.000008905128,0.000041549356,0.000046316032,0.000030146843],"domain_scores_gemma":[0.99930453,0.00048771853,0.00006678765,0.000018847255,0.00009484033,0.000027298884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005414475,0.00059133593,0.00067033677,0.00058050954,0.00030010176,0.000649432,0.00058087514,0.0010612322,0.00033390464],"category_scores_gemma":[0.0014799824,0.00034194347,0.0004363691,0.0007223643,0.00046639767,0.0003514289,0.00032840294,0.0005905548,0.00007978317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004476452,0.000031952157,0.002368974,0.000024861685,0.0000075468993,0.000053438904,0.000016273792,0.98719645,0.0037362215,0.00027322062,0.00007191415,0.006174433],"study_design_scores_gemma":[0.0000020430405,0.000015687865,0.00037729234,0.0000010058762,0.0000017807449,0.0000031853479,0.0000043943883,0.9979317,0.0015529225,0.00009119841,0.000015776715,0.000002991136],"about_ca_topic_score_codex":0.010408039,"about_ca_topic_score_gemma":0.006378373,"teacher_disagreement_score":0.010408039,"about_ca_system_score_codex":0.0006983675,"about_ca_system_score_gemma":0.00127257,"threshold_uncertainty_score":0.020694911},"labels":[],"label_agreement":null},{"id":"W2961864530","doi":"10.1145/3319619.3322029","title":"Benchmarking genetic programming in dynamic insider threat detection","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmarking; Insider threat; Computer science; Dynamic programming; Insider; Genetic programming; Computer security; Artificial intelligence; Business; Algorithm; Political science","score_opus":0.011019953629421791,"score_gpt":0.22740538863839432,"score_spread":0.21638543500897253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961864530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57612807,0.00083224685,0.41097134,0.0011943827,0.00016359257,0.00019851456,0.00013292869,0.0017944853,0.008584454],"genre_scores_gemma":[0.88881373,0.0001471158,0.10924666,0.0002284157,0.000024469357,0.00010028303,0.00015622,0.00011805844,0.0011650472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978555,0.0011355416,0.00006171893,0.0003636071,0.00039230508,0.00019124783],"domain_scores_gemma":[0.9903262,0.0075413715,0.00043052196,0.00060899294,0.0009022109,0.0001906522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005113991,0.00088722224,0.00075260585,0.0009197272,0.00059576123,0.0013099755,0.0018540801,0.0015276697,0.0010582533],"category_scores_gemma":[0.018568188,0.00042104055,0.00042409616,0.00090641156,0.0011269136,0.001357492,0.0010335187,0.001579694,0.00026026534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013439714,0.0001632676,0.0030733708,0.00003770557,0.00004254811,0.000048976264,0.00007084434,0.9420036,0.0014547914,0.002891855,0.0004912289,0.049587354],"study_design_scores_gemma":[0.000012235539,0.00007220879,0.0003369052,0.0000054017123,0.000006466588,0.000012652479,0.000024786717,0.9966156,0.0009013653,0.0017533875,0.0002529514,0.0000060475945],"about_ca_topic_score_codex":0.008225744,"about_ca_topic_score_gemma":0.006203767,"teacher_disagreement_score":0.008225744,"about_ca_system_score_codex":0.0014714082,"about_ca_system_score_gemma":0.0014009993,"threshold_uncertainty_score":0.027045667},"labels":[],"label_agreement":null},{"id":"W2963131153","doi":"10.1162/isal_a_00204","title":"A-life Evolution with Human Proxies","year":2019,"lang":"en","type":"article","venue":"The 2019 Conference on Artificial Life","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Geology","score_opus":0.032208085897254976,"score_gpt":0.26134538385550937,"score_spread":0.22913729795825438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963131153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21573259,0.0023158055,0.471207,0.0072827116,0.0008725725,0.00023026994,0.000531801,0.002152745,0.29967448],"genre_scores_gemma":[0.85221815,0.0007204077,0.10341485,0.0009054073,0.00006731069,0.00021121946,0.00034659996,0.00035066917,0.04176545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993598,0.0002834316,0.00002074905,0.00016213258,0.000107527536,0.00006637138],"domain_scores_gemma":[0.99878377,0.00030382106,0.000082782324,0.00040768037,0.00018677893,0.000235146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009970004,0.00035731983,0.00037090655,0.0005327348,0.0016558667,0.0028148673,0.0010241645,0.0019205689,0.015235732],"category_scores_gemma":[0.00572376,0.0002863816,0.00045703747,0.00048409402,0.0024551197,0.0024949473,0.0025193682,0.0014826031,0.002770482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094202354,0.00007043598,0.002700771,0.000079135396,0.00005827821,0.00037276396,0.0010287205,0.040674265,0.006226627,0.8979934,0.006719283,0.043982122],"study_design_scores_gemma":[0.00006786888,0.00013741477,0.001471347,0.00008487235,0.000041525615,0.0007113015,0.0007853491,0.15312926,0.0030807287,0.6642398,0.17617826,0.00007232857],"about_ca_topic_score_codex":0.001696119,"about_ca_topic_score_gemma":0.0012679483,"teacher_disagreement_score":0.015235732,"about_ca_system_score_codex":0.0012975829,"about_ca_system_score_gemma":0.00084171986,"threshold_uncertainty_score":0.050968587},"labels":[],"label_agreement":null},{"id":"W2963190675","doi":"","title":"Symbolic regression by random search","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Symbolic regression; Hyperparameter; Genetic programming; Random search; Mathematics; Regression; Statistics; Binary number; Regression analysis; Random forest; Computer science; Algorithm; Artificial intelligence; Arithmetic","score_opus":0.05094565646964204,"score_gpt":0.20201521114838875,"score_spread":0.15106955467874672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963190675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17044805,0.0014305596,0.8073419,0.00083861797,0.00013781784,0.00032759234,0.00027864036,0.0016023294,0.017594581],"genre_scores_gemma":[0.7353337,0.00046593443,0.25954783,0.00030248865,0.00006241373,0.00050297193,0.0005869944,0.00032265135,0.0028749236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730814,0.0015722306,0.000087314205,0.00040200553,0.0004900264,0.00014025827],"domain_scores_gemma":[0.9894566,0.008358955,0.00054295454,0.00086087,0.0006741341,0.00010653937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034421908,0.0011247268,0.0010529843,0.0013926385,0.00041917295,0.0008385578,0.0011730795,0.0008683433,0.003734063],"category_scores_gemma":[0.018425211,0.0003305026,0.0007361051,0.0013030979,0.0010994833,0.0013179842,0.0008981353,0.001310232,0.00065234944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018759779,0.000077615725,0.0016786284,0.00015895261,0.000107515996,0.0000556095,0.000043555174,0.9133446,0.0008548644,0.014686574,0.0012936023,0.067510955],"study_design_scores_gemma":[0.0000697796,0.00010933519,0.0002640826,0.000025663921,0.00002065563,0.000032020023,0.00001751869,0.986166,0.000916467,0.011333544,0.0010366482,0.00000825912],"about_ca_topic_score_codex":0.003483668,"about_ca_topic_score_gemma":0.0026017544,"teacher_disagreement_score":0.003734063,"about_ca_system_score_codex":0.0010435574,"about_ca_system_score_gemma":0.001304915,"threshold_uncertainty_score":0.018204272},"labels":[],"label_agreement":null},{"id":"W2967706363","doi":"10.1109/cec.2019.8789964","title":"EvoDNN - An Evolutionary Deep Neural Network with Heterogeneous Activation Functions","year":2019,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial neural network; Activation function; Backpropagation; Flexibility (engineering); Artificial intelligence; Evolutionary algorithm; Deep learning; Feature (linguistics); Differentiable function; Evolutionary computation; Function (biology); Stochastic neural network; Time delay neural network; Mathematics; Biology","score_opus":0.00948284211519159,"score_gpt":0.21385724989163354,"score_spread":0.20437440777644195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967706363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06568512,0.000410696,0.9274418,0.0002684056,0.000082608494,0.00006218163,0.00009703463,0.0005217889,0.0054303277],"genre_scores_gemma":[0.5933386,0.00032778672,0.39771184,0.0003147,0.000020582951,0.00017601931,0.0002803429,0.00010508057,0.007725096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.000040355728,0.000012695806,0.000048937614,0.0000627402,0.000030043364],"domain_scores_gemma":[0.9997495,0.00010657205,0.000023418388,0.00002688521,0.000074926764,0.000018704932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074428954,0.0005472607,0.00049202825,0.00038811975,0.00033469027,0.00057564775,0.00113153,0.00086073374,0.0010231253],"category_scores_gemma":[0.0015839022,0.00033191912,0.00041314552,0.00037256046,0.00047958127,0.00067635253,0.0010530163,0.0009515709,0.00019375075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004477527,0.00004134576,0.0021345867,0.0000443563,0.000048370603,0.00010164448,0.00006088305,0.87621784,0.0069731805,0.008139453,0.0009136373,0.10527998],"study_design_scores_gemma":[0.000005026747,0.000015384325,0.00012077755,0.000006314955,0.0000055869396,0.000023714903,0.000005773443,0.9957838,0.0011963291,0.0020170293,0.00081624195,0.0000040176715],"about_ca_topic_score_codex":0.0039402363,"about_ca_topic_score_gemma":0.0064195865,"teacher_disagreement_score":0.0039402363,"about_ca_system_score_codex":0.00074186985,"about_ca_system_score_gemma":0.00061285327,"threshold_uncertainty_score":0.007834554},"labels":[],"label_agreement":null},{"id":"W2967780548","doi":"10.3233/jifs-179361","title":"Optimizing predictability of rating scales by differential evolution for the use by collective intelligent information and database systems","year":2019,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Predictability; Rating scale; Differential evolution; Computer science; Differential (mechanical device); Scale (ratio); Rating system; Data mining; Artificial intelligence; Machine learning; Statistics; Mathematics; Engineering","score_opus":0.021141157886429993,"score_gpt":0.24563167539529773,"score_spread":0.22449051750886773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967780548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08352978,0.00023757438,0.91391456,0.00021862866,0.00003617334,0.00008806866,0.000024825229,0.0001881581,0.0017621496],"genre_scores_gemma":[0.84818447,0.00013310334,0.15015255,0.00007369849,0.000032175798,0.00018158126,0.00010972448,0.000040535113,0.001092235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811804,0.0007104234,0.00017200249,0.00035413983,0.00052971405,0.000115667375],"domain_scores_gemma":[0.99618226,0.0020507965,0.00043448622,0.00037981514,0.00085897924,0.00009365228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030217078,0.000733468,0.00092851004,0.0008731114,0.00044580238,0.001154924,0.00085689384,0.00057137257,0.00073180767],"category_scores_gemma":[0.010486548,0.00035249707,0.00061125663,0.00073900016,0.00047842608,0.0009653742,0.00092128007,0.0008755891,0.00017200579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013656466,0.00019388403,0.007937927,0.00012829748,0.00015131445,0.00014315362,0.00024925586,0.7035905,0.0121623045,0.010682483,0.0010403277,0.263584],"study_design_scores_gemma":[0.000005627402,0.00006360536,0.00082907436,0.000005005358,0.000014199409,0.00001911419,0.000011755142,0.9964676,0.00082102476,0.0014756421,0.00028076448,0.0000064946607],"about_ca_topic_score_codex":0.0020974432,"about_ca_topic_score_gemma":0.0013907081,"teacher_disagreement_score":0.0030217078,"about_ca_system_score_codex":0.00077711896,"about_ca_system_score_gemma":0.0007960416,"threshold_uncertainty_score":0.015980482},"labels":[],"label_agreement":null},{"id":"W2971785444","doi":"10.1017/s0140525x01244161","title":"A single-process learning theory","year":2001,"lang":"en","type":"article","venue":"Behavioral and Brain Sciences","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Analogy; Natural selection; Process (computing); Extension (predicate logic); Punishment (psychology); Reinforcement learning; Selection (genetic algorithm); Learning theory; Psychology; Cognitive science; Adaptation (eye); Computer science; Artificial intelligence; Cognitive psychology; Epistemology; Social psychology; Neuroscience; Philosophy","score_opus":0.05305033914085085,"score_gpt":0.32296632030111017,"score_spread":0.26991598116025933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971785444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009712777,0.0026088634,0.7171715,0.0107439095,0.0007818336,0.00013761372,0.00033615838,0.00036977034,0.25813755],"genre_scores_gemma":[0.66745234,0.005226646,0.16528378,0.004047704,0.0023356723,0.00053125015,0.0003882682,0.00022527092,0.15450914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915135,0.00019473066,0.000030154562,0.00020466556,0.0003236944,0.00009533294],"domain_scores_gemma":[0.9984426,0.0007403717,0.00008912383,0.0002784447,0.00030506306,0.00014437655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161869,0.00075843075,0.0010242108,0.0008646852,0.0010871176,0.0027414556,0.002828995,0.0028265924,0.021621073],"category_scores_gemma":[0.0044676717,0.00031288716,0.001268345,0.0007677616,0.0040797614,0.0051862476,0.0017316978,0.003424233,0.005351471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005300251,0.00001254644,0.000061290535,0.000018654926,0.0000067453184,0.000018567389,0.000033013475,0.003849671,0.000043161785,0.9873174,0.0018755555,0.006758043],"study_design_scores_gemma":[0.000007853117,0.000009895699,0.00003282089,0.000011578815,0.0000037398675,0.000033591947,0.000008872309,0.015595471,0.000039732946,0.9784654,0.005786041,0.000004918786],"about_ca_topic_score_codex":0.0017747866,"about_ca_topic_score_gemma":0.0009301614,"teacher_disagreement_score":0.021621073,"about_ca_system_score_codex":0.0016031021,"about_ca_system_score_gemma":0.0017084138,"threshold_uncertainty_score":0.0723297},"labels":[],"label_agreement":null},{"id":"W2975651211","doi":"10.1109/iccse.2019.8845515","title":"Diabetes Mellitus Prediction Using Multi-objective Genetic Programming and Majority Voting","year":2019,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Genetic programming; Computer science; Diabetes mellitus; Symbolic regression; Predictive modelling; Machine learning; Voting; Genetic algorithm; Majority rule; Computation; Artificial intelligence; Data mining; Medicine; Algorithm","score_opus":0.013768260042193723,"score_gpt":0.2396370995375081,"score_spread":0.2258688394953144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975651211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3592355,0.00089103833,0.63317037,0.0010908503,0.00011421394,0.00011769662,0.00026558523,0.00042030707,0.004694388],"genre_scores_gemma":[0.92663306,0.00018964142,0.07112802,0.00014873191,0.000034786033,0.00007087065,0.00024420346,0.000022038992,0.0015287533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959654,0.00015098434,0.00001906617,0.00009367209,0.000079955505,0.00005977521],"domain_scores_gemma":[0.9990709,0.00060818647,0.00008911522,0.00003519636,0.00016085149,0.00003566889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011820366,0.0006466398,0.0009869895,0.00073900656,0.00036974312,0.00086640066,0.00095230876,0.00078705524,0.0007945922],"category_scores_gemma":[0.0025210907,0.00025988795,0.00079072296,0.00068168255,0.00026101308,0.00055686355,0.00056747685,0.0008555166,0.000120609846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008859933,0.0000948169,0.003988866,0.000030953695,0.000059349448,0.00006813408,0.000026268106,0.9231661,0.00068840134,0.0014533477,0.0005770527,0.06975816],"study_design_scores_gemma":[0.0000027646804,0.000014872922,0.00017796186,0.000002543996,0.0000045741126,0.000004217818,0.000004529069,0.99910444,0.000128561,0.0005136201,0.000040315444,0.000001557815],"about_ca_topic_score_codex":0.007320235,"about_ca_topic_score_gemma":0.0055014812,"teacher_disagreement_score":0.007320235,"about_ca_system_score_codex":0.00056683976,"about_ca_system_score_gemma":0.0008285855,"threshold_uncertainty_score":0.014555216},"labels":[],"label_agreement":null},{"id":"W2977089467","doi":"10.1109/iccse.2019.8845381","title":"Comparing Genetic Programming with Other Data Mining Techniques on Prediction Models","year":2019,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Symbolic regression; Genetic programming; Computer science; Machine learning; Artificial intelligence; Field (mathematics); Data mining; Regression analysis; Data modeling; Regression; Predictive modelling; Statistics; Mathematics","score_opus":0.05274053156540136,"score_gpt":0.26396420923016234,"score_spread":0.21122367766476097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977089467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34685045,0.0057892175,0.6290454,0.002680007,0.00027567905,0.00023575537,0.00055081624,0.0012231522,0.0133496],"genre_scores_gemma":[0.76314163,0.0027697259,0.2313381,0.00032630068,0.000107192034,0.00016732344,0.00055353035,0.00013456258,0.0014615486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763477,0.0011645562,0.00012755877,0.00032721474,0.00063298317,0.000112911475],"domain_scores_gemma":[0.98474693,0.013190765,0.0004894746,0.0005578989,0.00092711573,0.00008776596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043971706,0.0009894562,0.0010905759,0.0023314862,0.00041217153,0.0012228725,0.0012354532,0.001197222,0.0009995812],"category_scores_gemma":[0.018949157,0.00023481098,0.0008932264,0.0030489159,0.0005364348,0.001922911,0.0007878423,0.0014204598,0.00019034598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021953254,0.00021490653,0.005837346,0.00018619657,0.00031711307,0.00008610491,0.00008367483,0.85764825,0.00055222225,0.0076919706,0.0006875067,0.12647508],"study_design_scores_gemma":[0.0000150996575,0.00009421109,0.00093530957,0.000020614729,0.000039377774,0.000027258948,0.000034805023,0.9936187,0.00052319263,0.0042225844,0.0004605026,0.000008341081],"about_ca_topic_score_codex":0.007153869,"about_ca_topic_score_gemma":0.0045040357,"teacher_disagreement_score":0.007153869,"about_ca_system_score_codex":0.0010382734,"about_ca_system_score_gemma":0.00097362406,"threshold_uncertainty_score":0.023254752},"labels":[],"label_agreement":null},{"id":"W2991199419","doi":"10.6084/m9.figshare.7990835.v2","title":"Nigeria’s 2015 Presidential Election: A Spatial and Econometric Perspective Based on a Framing Strategy - Online Appendix","year":2019,"lang":"en","type":"article","venue":"Figshare","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations; Polytechnique Montréal","funders":"","keywords":"Framing (construction); Presidential system; Perspective (graphical); Presidential election; Political science; Computer science; Geography; Politics; Law; Artificial intelligence","score_opus":0.017808995329811225,"score_gpt":0.266649383999074,"score_spread":0.24884038866926278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991199419","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15356652,0.0021519177,0.046872593,0.024091173,0.0018474034,0.00028300428,0.033552647,0.000254522,0.7373803],"genre_scores_gemma":[0.8626769,0.0018512036,0.025044259,0.0007248076,0.00033419207,0.00022113207,0.008630397,0.000114983144,0.100402154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9997503,0.00012307955,0.000016059204,0.000029801588,0.000057502104,0.000023286655],"domain_scores_gemma":[0.99741274,0.0019648601,0.0002122813,0.00006652468,0.00029779653,0.00004583739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007585341,0.00014049324,0.00015462087,0.0010391873,0.00065548765,0.0016617973,0.00037494645,0.0006160173,0.071187906],"category_scores_gemma":[0.0069768787,0.00012829009,0.00014718919,0.0025330635,0.00031577723,0.0012089377,0.00048942026,0.00052036124,0.002988916],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053336385,0.00005217165,0.01394866,0.00019316247,0.000014547826,0.00032219468,0.001893739,0.009572373,0.00018507855,0.7317526,0.18467416,0.057338014],"study_design_scores_gemma":[0.000043382683,0.000075979326,0.06921495,0.0009596809,0.00005216995,0.00063106837,0.016651517,0.03739547,0.0006889183,0.28038478,0.5938001,0.00010195646],"about_ca_topic_score_codex":0.01914805,"about_ca_topic_score_gemma":0.028012883,"teacher_disagreement_score":0.071187906,"about_ca_system_score_codex":0.0010985532,"about_ca_system_score_gemma":0.0007466868,"threshold_uncertainty_score":0.23814732},"labels":[],"label_agreement":null},{"id":"W2992884018","doi":"10.1109/cw.2019.00053","title":"Person Identification from Visual Aesthetics Using Gene Expression Programming","year":2019,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence; Classifier (UML); Biometrics; Identification (biology); Curse of dimensionality; Expression (computer science); Dimensionality reduction; Domain (mathematical analysis); Machine learning; Computer vision; Mathematics","score_opus":0.024319413464244106,"score_gpt":0.278049378117753,"score_spread":0.2537299646535089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992884018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32864866,0.00023007039,0.66210634,0.00028662337,0.000053898606,0.00014872363,0.00058002974,0.0016470945,0.006298503],"genre_scores_gemma":[0.7551467,0.00020003505,0.2379205,0.00011412392,0.000029694556,0.00018661878,0.001091754,0.0001202211,0.0051904125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996112,0.000074483694,0.000013096484,0.00012767564,0.00012826081,0.00004537665],"domain_scores_gemma":[0.9997063,0.00011926182,0.000046153193,0.000029631121,0.00008319007,0.00001539346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036613655,0.0004041444,0.0004321766,0.0010181832,0.00022525156,0.0007550461,0.00051679194,0.00034181247,0.0017944982],"category_scores_gemma":[0.0013394348,0.00017329941,0.0006357648,0.00074319984,0.00039565586,0.00043889304,0.00047334438,0.00044213585,0.0006371156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035165314,0.00031570453,0.020186845,0.00013682657,0.000093868206,0.00028446878,0.00033197625,0.135263,0.094712175,0.0037648238,0.0028512497,0.7417074],"study_design_scores_gemma":[0.0000088852175,0.00008359464,0.0109517025,0.000013891788,0.000024995443,0.0002302887,0.00012780011,0.9635717,0.019436985,0.0036895312,0.0018362754,0.000024214287],"about_ca_topic_score_codex":0.002262317,"about_ca_topic_score_gemma":0.0020759858,"teacher_disagreement_score":0.002262317,"about_ca_system_score_codex":0.0005151439,"about_ca_system_score_gemma":0.00026550508,"threshold_uncertainty_score":0.0060031414},"labels":[],"label_agreement":null},{"id":"W2994040121","doi":"","title":"Vergence Adaptation And Convergence Accommodation In Convergence Insufficiency","year":2012,"lang":"en","type":"article","venue":"Investigative Ophthalmology & Visual Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Accommodation; Convergence insufficiency; Vergence (optics); Convergence (economics); Adaptation (eye); Computer science; Psychology; Medicine; Artificial intelligence; Neuroscience; Economics; Ophthalmology; Macroeconomics","score_opus":0.05396535678715794,"score_gpt":0.32675206097774645,"score_spread":0.2727867041905885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994040121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760852,0.0010767919,0.014860592,0.00040037424,0.00007127419,0.00004520192,0.0000724831,0.00006842518,0.0073196287],"genre_scores_gemma":[0.9988243,0.00009601247,0.00050148315,0.000015017329,0.000011787136,0.000009712927,0.00001531168,0.000011188715,0.0005152204],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993741,0.00021844576,0.00007922227,0.00009071035,0.00010108881,0.00013643794],"domain_scores_gemma":[0.9973673,0.0015089215,0.00032327115,0.00025355726,0.0002759866,0.0002709357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012883965,0.000571243,0.00087186316,0.0016713326,0.0006136584,0.0013121457,0.0006203558,0.0009527086,0.0065384097],"category_scores_gemma":[0.0111450115,0.00027507002,0.0005981629,0.0007172651,0.001650241,0.0012904069,0.0017538905,0.0009480065,0.00031937438],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.025266249,0.0013110738,0.29076537,0.0011924317,0.0005086789,0.030265657,0.0038065237,0.08690194,0.17341457,0.10338377,0.0026651102,0.28051865],"study_design_scores_gemma":[0.0012594047,0.004354759,0.5042142,0.000292724,0.00043464213,0.048364796,0.0032736408,0.29351914,0.0354084,0.10535485,0.0033017353,0.00022166324],"about_ca_topic_score_codex":0.0009749964,"about_ca_topic_score_gemma":0.0003222346,"teacher_disagreement_score":0.0065384097,"about_ca_system_score_codex":0.00054500904,"about_ca_system_score_gemma":0.00042946797,"threshold_uncertainty_score":0.021873176},"labels":[],"label_agreement":null},{"id":"W3004052295","doi":"","title":"MADMS: Mesh adaptive direct multisearch for blackbox multiobjective optimization","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Multi-objective optimization; Mathematical optimization; Mathematics; Machine learning","score_opus":0.019181359863907614,"score_gpt":0.2527260271919862,"score_spread":0.2335446673280786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004052295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009962171,0.00031910994,0.9807879,0.00022538859,0.00022162209,0.00008847961,0.00018284617,0.002705854,0.0055066315],"genre_scores_gemma":[0.18401782,0.00022899831,0.80437976,0.0003123002,0.00010002248,0.000690432,0.0003754535,0.0010084755,0.00888684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964154,0.00013513645,0.000013824807,0.000048656966,0.00012961325,0.000031232536],"domain_scores_gemma":[0.9991442,0.00056495745,0.0000439889,0.000080908205,0.0001166479,0.000049366587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576065,0.0009862027,0.001205956,0.0008791969,0.0005710016,0.0008651575,0.0015963521,0.0019967165,0.011697187],"category_scores_gemma":[0.003211678,0.0005413727,0.00082725106,0.0008506359,0.00059007964,0.000762425,0.0016612579,0.0017063724,0.0016659565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003145406,0.00010566158,0.00039668978,0.00032701434,0.00012096185,0.00009415876,0.00009559521,0.7847702,0.0064471634,0.017840123,0.009063393,0.1804244],"study_design_scores_gemma":[0.00003437682,0.000020062667,0.000041951793,0.00001030181,0.0000043298696,0.000009745627,0.0000040561745,0.99397165,0.00075789547,0.0035171744,0.0016249181,0.0000034957943],"about_ca_topic_score_codex":0.0021569477,"about_ca_topic_score_gemma":0.002278473,"teacher_disagreement_score":0.011697187,"about_ca_system_score_codex":0.0006069671,"about_ca_system_score_gemma":0.0007204916,"threshold_uncertainty_score":0.039130926},"labels":[],"label_agreement":null},{"id":"W3004224429","doi":"10.1145/3381343.3381345","title":"Big data driven genetic improvement for maintenance of legacy software systems","year":2020,"lang":"en","type":"article","venue":"ACM SIGEVOlution","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Software; Conversation; Artificial intelligence; Computer science; Library science; Sociology; Operating system","score_opus":0.06133430161237951,"score_gpt":0.263458571486809,"score_spread":0.2021242698744295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004224429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11924248,0.0034428497,0.84679127,0.006901224,0.0006873214,0.00015979657,0.00055253063,0.006914175,0.015308379],"genre_scores_gemma":[0.64911956,0.0014918325,0.33776397,0.00094936625,0.00018709808,0.00024262286,0.0013079433,0.00079266867,0.008144791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00018989008,0.000032168107,0.00011722643,0.00024411616,0.000065838954],"domain_scores_gemma":[0.998185,0.00078334345,0.00011716151,0.00035451044,0.00047398132,0.000085986234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017703292,0.0003781343,0.0004179942,0.0006733272,0.00045838847,0.0009771172,0.0014317633,0.00080348464,0.0029844532],"category_scores_gemma":[0.005528987,0.00025132525,0.00053275813,0.0008087954,0.0006006025,0.0013777207,0.0010066269,0.0011169007,0.00066221127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034358655,0.00035067776,0.0033310556,0.00029509026,0.000089825015,0.00022698447,0.00036103706,0.3091253,0.02304463,0.04069719,0.029489076,0.5926454],"study_design_scores_gemma":[0.000074711636,0.0001680483,0.0011265742,0.000044406956,0.00004909934,0.000072728246,0.00007827921,0.92183936,0.0124163665,0.045867942,0.018231772,0.000030806565],"about_ca_topic_score_codex":0.0027600573,"about_ca_topic_score_gemma":0.0040415023,"teacher_disagreement_score":0.0029844532,"about_ca_system_score_codex":0.0013916211,"about_ca_system_score_gemma":0.0009772694,"threshold_uncertainty_score":0.010096967},"labels":[],"label_agreement":null},{"id":"W3007116216","doi":"10.1145/3365953.3365955","title":"<i>BENIN</i>","year":2019,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Inference; Computer science; Benchmark (surveying); Resampling; Machine learning; Artificial intelligence; Feature selection; Complementarity (molecular biology); Data mining; Gene regulatory network; Gene expression; Gene; Biology","score_opus":0.006178601518985226,"score_gpt":0.21177739072335558,"score_spread":0.20559878920437036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007116216","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014531726,0.0086798845,0.8898125,0.040365033,0.005908744,0.00017534576,0.006342704,0.015174635,0.019009413],"genre_scores_gemma":[0.20062093,0.00945033,0.69597334,0.016814431,0.008630285,0.00061629445,0.026643759,0.007080161,0.034170423],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988753,0.00030947264,0.000045839337,0.00029550877,0.00041420548,0.000059631337],"domain_scores_gemma":[0.9966614,0.0015386583,0.00021226933,0.0006282346,0.00069856056,0.00026083118],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020056046,0.0011865705,0.0010033833,0.0015407843,0.00084245607,0.002073713,0.0021690002,0.0018667494,0.008161828],"category_scores_gemma":[0.008391064,0.00048440055,0.00072376657,0.0020175443,0.001069461,0.0024695154,0.0018748947,0.0032351743,0.007873171],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027940195,0.00015200212,0.00332306,0.00039531884,0.0001669001,0.00021348419,0.00009385912,0.04098431,0.006857921,0.023812693,0.5643987,0.35932237],"study_design_scores_gemma":[0.00006956956,0.00016689302,0.0038861095,0.0001579602,0.000070928916,0.0006218757,0.00009317875,0.50978297,0.024749827,0.098018385,0.3622025,0.00017981908],"about_ca_topic_score_codex":0.0044293157,"about_ca_topic_score_gemma":0.0067975316,"teacher_disagreement_score":0.99183816,"about_ca_system_score_codex":0.0007195765,"about_ca_system_score_gemma":0.0007837733,"threshold_uncertainty_score":0.027303994},"labels":[],"label_agreement":null},{"id":"W3021883800","doi":"10.1007/978-3-030-39958-0_17","title":"Evolving a Dota 2 Hero Bot with a Probabilistic Shared Memory Model","year":2020,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Reinforcement learning; Artificial intelligence; Probabilistic logic; Observability; Recall; Encoding (memory); Markov decision process; Genetic programming; HERO; Machine learning; Theoretical computer science; Markov process","score_opus":0.018144377941250137,"score_gpt":0.212850511694543,"score_spread":0.19470613375329288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021883800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5609429,0.00035041943,0.39738074,0.0013249359,0.00021337098,0.00009405417,0.00018945872,0.0011574815,0.038346637],"genre_scores_gemma":[0.9404051,0.00006596395,0.04188524,0.00009714676,0.000020693366,0.00005432601,0.00006272403,0.00010984658,0.017299082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998122,0.000041673316,0.0000065077215,0.00004430939,0.000050715476,0.00004453553],"domain_scores_gemma":[0.99946505,0.0003171516,0.000036841826,0.00007132139,0.000047338875,0.00006236932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042810294,0.00033619988,0.000683137,0.0002775214,0.00057887635,0.000812545,0.0012934492,0.0016844608,0.00562171],"category_scores_gemma":[0.001763154,0.0003700474,0.00048395956,0.0002735461,0.00079402333,0.0013302813,0.0015860603,0.0011267209,0.00047780265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011474336,0.000055662116,0.00059151097,0.000028572995,0.000025848065,0.0001694544,0.00008107058,0.953725,0.0019427071,0.029300017,0.0011147939,0.012850653],"study_design_scores_gemma":[0.000007363582,0.000013277068,0.00003919874,0.00000147665,0.0000028447107,0.000014871583,0.00000937692,0.99423176,0.00014611945,0.005302573,0.00022831534,0.0000028130037],"about_ca_topic_score_codex":0.0042737033,"about_ca_topic_score_gemma":0.0045566605,"teacher_disagreement_score":0.00562171,"about_ca_system_score_codex":0.0008441326,"about_ca_system_score_gemma":0.0007302329,"threshold_uncertainty_score":0.018806458},"labels":[],"label_agreement":null},{"id":"W3023259985","doi":"10.1007/978-3-030-39958-0_4","title":"Can Genetic Programming Perform Explainable Machine Learning for Bioinformatics?","year":2020,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Genetic programming; Computer science; Artificial intelligence; Machine learning","score_opus":0.014642432566419242,"score_gpt":0.21641990840556938,"score_spread":0.20177747583915012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023259985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028452214,0.012472399,0.85451466,0.029644737,0.0015195446,0.000051284584,0.00029605435,0.001758096,0.07129108],"genre_scores_gemma":[0.5026758,0.015758237,0.44192985,0.0034610888,0.0010923283,0.00018947349,0.00051233126,0.0008436932,0.03353721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974793,0.00012290143,0.000007907505,0.000036895297,0.00005729527,0.000027064938],"domain_scores_gemma":[0.9988418,0.00088821363,0.000046482262,0.0001379956,0.000059781596,0.000025732643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010713097,0.00053113844,0.0004422134,0.00033531303,0.00027315438,0.0013549383,0.0012335194,0.0015775544,0.0060136546],"category_scores_gemma":[0.0057144375,0.0002732052,0.00055176346,0.0005768492,0.0018400118,0.002893557,0.0006291884,0.0021843058,0.0014467129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025230816,0.000026544198,0.00042800757,0.00018990294,0.00003864914,0.000062461164,0.00013273567,0.045021713,0.0010164768,0.8750215,0.0069449833,0.071091756],"study_design_scores_gemma":[0.0000065517725,0.000010328009,0.00010731194,0.00004008505,0.000007123578,0.000021760408,0.000027520693,0.061771903,0.00051296584,0.9246592,0.012827646,0.000007603727],"about_ca_topic_score_codex":0.0012075659,"about_ca_topic_score_gemma":0.0010786431,"teacher_disagreement_score":0.0060136546,"about_ca_system_score_codex":0.00069342204,"about_ca_system_score_gemma":0.0006347897,"threshold_uncertainty_score":0.0201177},"labels":[],"label_agreement":null},{"id":"W3046276070","doi":"10.1145/3377929.3390007","title":"DarwiNN","year":2020,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Toolbox; Leverage (statistics); Cloud computing; Inference; Kernel (algebra); Neuroevolution; Deep neural networks; Artificial intelligence; Computation; Deep learning; Variety (cybernetics); Artificial neural network; Distributed computing; Machine learning; Theoretical computer science; Parallel computing; Algorithm; Programming language; Operating system","score_opus":0.022252824562664426,"score_gpt":0.23375072193385518,"score_spread":0.21149789737119076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046276070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020765733,0.00062542857,0.8713475,0.0004394026,0.00063656154,0.00019780008,0.0025559375,0.046955932,0.056475803],"genre_scores_gemma":[0.25906333,0.0007475491,0.6455152,0.0009058038,0.00015550008,0.0008982022,0.007817425,0.01845383,0.066443235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997358,0.000041709292,0.000014674721,0.000080809405,0.00009455914,0.00003250678],"domain_scores_gemma":[0.9996568,0.00011128209,0.000019674497,0.000078235076,0.000102746606,0.000031306376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004169865,0.0005490957,0.0004441614,0.00031708315,0.00043180023,0.00066941045,0.0013773503,0.0006789057,0.02317226],"category_scores_gemma":[0.0019957456,0.00027526732,0.0005014436,0.00031659743,0.00037685517,0.00081127393,0.001182847,0.001295947,0.0066209543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035168053,0.00013513942,0.0036593461,0.0005893367,0.00013798037,0.00027106164,0.0002824407,0.20270939,0.015054339,0.1160932,0.16929783,0.49141827],"study_design_scores_gemma":[0.00010447302,0.00006478407,0.0007548863,0.00004847039,0.00003339894,0.0002135693,0.000043522392,0.7691768,0.014036178,0.048710965,0.16677538,0.000037584472],"about_ca_topic_score_codex":0.0021822439,"about_ca_topic_score_gemma":0.0044016424,"teacher_disagreement_score":0.02317226,"about_ca_system_score_codex":0.0004961031,"about_ca_system_score_gemma":0.0007906243,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3068884712","doi":"10.48550/arxiv.2008.09017","title":"A summary of the prevalence of Genetic Algorithms in Bioinformatics from 2015 onwards","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Machine learning; Algorithm; Computer science; Artificial intelligence; Field (mathematics); Genetic algorithm; Support vector machine; Variety (cybernetics); Population; Data mining; Medicine; Mathematics","score_opus":0.04775831902471871,"score_gpt":0.1959859082601826,"score_spread":0.14822758923546392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3068884712","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057880804,0.9418182,0.0105296,0.0099654365,0.0023371466,0.000084751046,0.0029194255,0.00040370392,0.026153605],"genre_scores_gemma":[0.020500062,0.95336,0.012021695,0.004340957,0.00096059847,0.00011032011,0.0028717064,0.0001995874,0.0056350515],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99627507,0.0009111046,0.0008342248,0.00058477087,0.0012025984,0.00019228367],"domain_scores_gemma":[0.9753736,0.014485678,0.001730476,0.0005040109,0.0073459814,0.00056030723],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.004720777,0.0007677751,0.00077586074,0.011179053,0.00063590205,0.003858366,0.0009204881,0.0015712446,0.011168143],"category_scores_gemma":[0.02502004,0.00047073798,0.0012443591,0.01747834,0.00083927554,0.0034585586,0.0009947224,0.0018670682,0.0048632873],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020945097,0.00004362006,0.004405865,0.018340843,0.00019667507,0.00029597498,0.00047115958,0.0018846446,0.0018406461,0.01481147,0.060102135,0.8973975],"study_design_scores_gemma":[0.00001371981,0.00015186628,0.007616737,0.01502139,0.00023424132,0.0010446623,0.0004130238,0.00068573054,0.0012199964,0.0053724376,0.96816796,0.000058108988],"about_ca_topic_score_codex":0.0046061645,"about_ca_topic_score_gemma":0.005436101,"teacher_disagreement_score":0.98882097,"about_ca_system_score_codex":0.002324289,"about_ca_system_score_gemma":0.0037572535,"threshold_uncertainty_score":0.037361205},"labels":[],"label_agreement":null},{"id":"W3078478003","doi":"10.1109/tcds.2020.3017100","title":"Accurate and Fast Deep Evolutionary Networks Structured Representation Through Activating and Freezing Dense Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive and Developmental Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Variety (cybernetics); Convergence (economics); Construct (python library); Artificial neural network; Training (meteorology); Artificial intelligence; Deep learning; Representation (politics); Point (geometry); Evolutionary algorithm; Computer network","score_opus":0.027304680677245216,"score_gpt":0.2512561656906926,"score_spread":0.22395148501344736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3078478003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056761578,0.00020547041,0.93840504,0.00013025057,0.000047220306,0.0000646333,0.000091593094,0.0020253574,0.0022688229],"genre_scores_gemma":[0.66916263,0.00026673233,0.32557738,0.00016215685,0.000028189226,0.00017526081,0.00039125336,0.00026760527,0.0039688502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975365,0.000046237674,0.000014589917,0.00006495483,0.00007284113,0.000047829002],"domain_scores_gemma":[0.9993907,0.00023153264,0.00006403783,0.0001551954,0.00012815539,0.000030243964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008298782,0.001015538,0.00058983645,0.00043053617,0.00037393,0.0006750572,0.0015318269,0.00075034896,0.0019084568],"category_scores_gemma":[0.002351174,0.0005947069,0.0005764598,0.00036692014,0.00065515697,0.0015161183,0.0013899674,0.0015805607,0.0005312078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000850789,0.000054235312,0.0015925937,0.000058377427,0.00003843766,0.00012299993,0.00012197419,0.7590392,0.0172836,0.010076572,0.0020118414,0.20951506],"study_design_scores_gemma":[0.0000049981136,0.000021470958,0.00014189495,0.000007547675,0.000007926108,0.000026945796,0.000010468471,0.9913436,0.0045303027,0.0032575594,0.00064232684,0.000004879093],"about_ca_topic_score_codex":0.003933563,"about_ca_topic_score_gemma":0.0062581305,"teacher_disagreement_score":0.003933563,"about_ca_system_score_codex":0.00064146373,"about_ca_system_score_gemma":0.00062678946,"threshold_uncertainty_score":0.0078213215},"labels":[],"label_agreement":null},{"id":"W3097916346","doi":"10.1109/icpr48806.2021.9412137","title":"Classifier Pool Generation based on a Two-level Diversity Approach","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Classifier (UML); Computer science; Machine learning; Artificial intelligence; Data mining; Pattern recognition (psychology)","score_opus":0.09982846445948788,"score_gpt":0.26875265787152736,"score_spread":0.16892419341203946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097916346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018045139,0.00019256289,0.97952205,0.00012543554,0.000038533737,0.00021243702,0.000057817037,0.0005156254,0.0012904442],"genre_scores_gemma":[0.38356954,0.00017092357,0.6103828,0.00030942427,0.00014821262,0.0009771106,0.0005727213,0.00029027535,0.0035790426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503565,0.00146117,0.00027402662,0.0010714863,0.0017131949,0.0004445762],"domain_scores_gemma":[0.9913209,0.0041682087,0.0005287898,0.0013897095,0.0022422988,0.0003500922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059324442,0.0010973049,0.002015417,0.0025747395,0.0013658714,0.0017733664,0.0024750496,0.001682386,0.0026685935],"category_scores_gemma":[0.015856072,0.0006822779,0.001409481,0.0015638273,0.0008944167,0.0022383365,0.0038060902,0.0018100783,0.0010388418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056336896,0.00044632083,0.0063060382,0.00018939449,0.00036685436,0.00037733474,0.00060747314,0.24989703,0.03331141,0.01792004,0.0052078725,0.6848069],"study_design_scores_gemma":[0.000077626,0.00028257427,0.0013809941,0.000022070326,0.0000946285,0.00025054993,0.00005004685,0.9723345,0.010053531,0.011690945,0.0037172479,0.000045102064],"about_ca_topic_score_codex":0.0014730814,"about_ca_topic_score_gemma":0.0016160236,"teacher_disagreement_score":0.0059324442,"about_ca_system_score_codex":0.001165637,"about_ca_system_score_gemma":0.0018604881,"threshold_uncertainty_score":0.031374156},"labels":[],"label_agreement":null},{"id":"W3103264709","doi":"10.1016/j.swevo.2020.100801","title":"Global optimization with one-class classification-assisted selection","year":2020,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Selection (genetic algorithm); Fitness proportionate selection; Artificial intelligence; Machine learning; Classifier (UML); Class (philosophy); Evolutionary algorithm; Mathematical optimization; Population; Set (abstract data type); Genetic algorithm; Fitness function; Mathematics","score_opus":0.024264736390021194,"score_gpt":0.24265682985947187,"score_spread":0.21839209346945068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103264709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020729853,0.00034631026,0.97249055,0.0002850297,0.00016394311,0.00008572774,0.00004230867,0.00046302562,0.00539336],"genre_scores_gemma":[0.6320423,0.00021606515,0.35627252,0.00036753708,0.00020211619,0.000465572,0.00027020715,0.00029936314,0.009864299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990181,0.00037688916,0.000046461657,0.00020003073,0.000244767,0.000113817885],"domain_scores_gemma":[0.9981589,0.0010084595,0.00009914645,0.00020668899,0.00045040957,0.00007653134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023156097,0.0013324958,0.0025785496,0.0011310924,0.00095834385,0.0014219736,0.0025106536,0.0023564894,0.003410148],"category_scores_gemma":[0.004502539,0.0005330307,0.0012331078,0.0012412493,0.0012630888,0.0014022939,0.0015243487,0.0014049795,0.0006041552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024637702,0.00016165384,0.0009472253,0.00012556375,0.00014792176,0.00006957533,0.00010029325,0.779551,0.0019302896,0.022690428,0.00584014,0.18818952],"study_design_scores_gemma":[0.000012816687,0.000020882171,0.0000788897,0.0000032035944,0.000008575823,0.000009623848,0.000003697463,0.9977428,0.00018950138,0.0017249559,0.0002008624,0.000004283548],"about_ca_topic_score_codex":0.0050497414,"about_ca_topic_score_gemma":0.0044988003,"teacher_disagreement_score":0.0050497414,"about_ca_system_score_codex":0.001014697,"about_ca_system_score_gemma":0.0013167703,"threshold_uncertainty_score":0.012246251},"labels":[],"label_agreement":null},{"id":"W3105201135","doi":"","title":"Elaboration on Two Points Raised in “Classifier Technology and the Illusion of Progress”","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Elaboration; Illusion; Classifier (UML); Artificial intelligence; Computer science; Cognitive psychology; Machine learning; Psychology; Art; Humanities","score_opus":0.011590967297132979,"score_gpt":0.24818625818777018,"score_spread":0.2365952908906372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105201135","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007628576,0.0041934606,0.09958438,0.7236143,0.025309838,0.00013528822,0.00024089022,0.0003574374,0.13893576],"genre_scores_gemma":[0.41218647,0.00528742,0.06350695,0.39580578,0.04102231,0.0007025573,0.00021115123,0.00031537114,0.08096195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647564,0.0011566909,0.00017836106,0.0006123597,0.0012883899,0.00028862144],"domain_scores_gemma":[0.98740476,0.009288169,0.0005575036,0.0006941044,0.0017325317,0.0003228787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068413415,0.0006455308,0.0005343242,0.0013747677,0.0033631122,0.0052716406,0.0025155293,0.006783796,0.0071495282],"category_scores_gemma":[0.020646196,0.00031770955,0.00097322755,0.00091693376,0.018183358,0.009039805,0.0042121825,0.014189471,0.002085983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038150196,0.000012318834,0.00013879097,0.000044971683,0.000007907727,0.00015756306,0.0013950743,0.0002856616,0.00029927032,0.9311422,0.06071902,0.005759047],"study_design_scores_gemma":[0.000023763323,0.000024229283,0.00044466788,0.0001552147,0.00001590193,0.0002058262,0.00093355885,0.0014597914,0.00082011736,0.75891083,0.2369549,0.00005112998],"about_ca_topic_score_codex":0.0050341403,"about_ca_topic_score_gemma":0.0032491756,"teacher_disagreement_score":0.0071495282,"about_ca_system_score_codex":0.0025653106,"about_ca_system_score_gemma":0.001960242,"threshold_uncertainty_score":0.036180913},"labels":[],"label_agreement":null},{"id":"W3107241399","doi":"10.1109/ccece47787.2020.9255685","title":"Hybridizing UFO with Other ML Tools to Locate Faults by Just Knowing Relay Operating Times","year":2020,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Support vector machine; Artificial neural network; Margin (machine learning); Relay; Transformation (genetics); Nonlinear system; Artificial intelligence; Overcurrent; Algorithm; Power (physics); Machine learning; Computer engineering","score_opus":0.034963676424808875,"score_gpt":0.252868454785901,"score_spread":0.2179047783610921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107241399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060004495,0.00024214482,0.935548,0.00007888003,0.00003836318,0.000035125962,0.000078074816,0.002185666,0.0017893187],"genre_scores_gemma":[0.7692208,0.00014277769,0.22899266,0.000049258062,0.000033530236,0.00007293351,0.00016282352,0.00020571086,0.0011193333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995384,0.00011901457,0.00003696539,0.00012050767,0.0001392482,0.00004579756],"domain_scores_gemma":[0.99861467,0.0006465236,0.00023332753,0.00024325846,0.00022091196,0.00004127236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008737692,0.001048668,0.0008228041,0.0016331389,0.000230183,0.0010299466,0.00078521343,0.0004656139,0.0013385179],"category_scores_gemma":[0.0045934147,0.00023439089,0.0004344414,0.0012418417,0.00038779873,0.0016487687,0.0010209924,0.00046284532,0.0004988651],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043214866,0.00011841674,0.0131492885,0.0002358304,0.00013690273,0.00018757446,0.0003374251,0.34949607,0.022083944,0.00802828,0.0010721696,0.60472196],"study_design_scores_gemma":[0.000009692574,0.000086788146,0.0021601776,0.000014314918,0.000021995567,0.000069947644,0.00006762866,0.9843246,0.008525948,0.0027968308,0.0019029144,0.000019153542],"about_ca_topic_score_codex":0.0016117962,"about_ca_topic_score_gemma":0.0015039121,"teacher_disagreement_score":0.0016331389,"about_ca_system_score_codex":0.00037438638,"about_ca_system_score_gemma":0.00037751754,"threshold_uncertainty_score":0.004621029},"labels":[],"label_agreement":null},{"id":"W3111380077","doi":"10.1109/cibcb48159.2020.9277714","title":"Effective Side Effect Machines for Decoding","year":2020,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Metric (unit); Computer science; Code (set theory); Edit distance; Algorithm; Extension (predicate logic)","score_opus":0.011774200144269744,"score_gpt":0.2671198864667722,"score_spread":0.2553456863225025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111380077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024564529,0.00026146846,0.9706459,0.00022031064,0.00006664442,0.000060532177,0.00013791607,0.000663161,0.0033795882],"genre_scores_gemma":[0.30165428,0.00035280912,0.69227415,0.0002276413,0.00008403464,0.00027648607,0.0005378035,0.0002973817,0.0042953948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777967,0.0007713228,0.00019084015,0.00044337337,0.0006563369,0.0001585767],"domain_scores_gemma":[0.9923402,0.0048889355,0.00042401356,0.0010823173,0.0011044787,0.00016005745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021468634,0.0006408658,0.0009147039,0.0011589162,0.00067798886,0.0012188056,0.0011884386,0.0014276127,0.0036367956],"category_scores_gemma":[0.013580298,0.0003342719,0.0007757572,0.0009147191,0.0014244927,0.0026668923,0.001172603,0.0017796837,0.0012431489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021977519,0.00009757395,0.0011766473,0.00041925375,0.0000571795,0.0002547762,0.00029865516,0.36779827,0.020302132,0.31179547,0.0033466013,0.29423374],"study_design_scores_gemma":[0.000013336782,0.00011424664,0.00020896047,0.0000408498,0.000016151442,0.00016773771,0.000036364254,0.8076524,0.0154006975,0.17188811,0.0044362815,0.000024912564],"about_ca_topic_score_codex":0.000568658,"about_ca_topic_score_gemma":0.0009940545,"teacher_disagreement_score":0.0036367956,"about_ca_system_score_codex":0.0008654193,"about_ca_system_score_gemma":0.0010552186,"threshold_uncertainty_score":0.012166321},"labels":[],"label_agreement":null},{"id":"W3117642670","doi":"10.1109/iemcon51383.2020.9284951","title":"ECG Knowledge Discovery Based on Ontologies and Rules Learning for the Support of Personalized Medical Decision Making","year":2020,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Knowledge extraction; Knowledge base; Decision support system; Classifier (UML); Process (computing); Knowledge representation and reasoning; Artificial intelligence; Machine learning; Knowledge-based systems; Data mining; Data science","score_opus":0.03388454777414192,"score_gpt":0.313301576427752,"score_spread":0.2794170286536101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117642670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016607609,0.00059683085,0.97458696,0.0009487227,0.00006342646,0.00019263079,0.0003289114,0.0006082959,0.006066593],"genre_scores_gemma":[0.24362065,0.0007737528,0.7524929,0.0003004652,0.00007159836,0.00017824255,0.0009434689,0.00006521219,0.001553718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997414,0.0007855764,0.00034405245,0.0004330226,0.0009051976,0.000118132884],"domain_scores_gemma":[0.9958401,0.0021556397,0.00035108178,0.0006706517,0.0008604294,0.00012217657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00288878,0.00034033638,0.00063564966,0.0023248098,0.00083573436,0.0022401125,0.0010889393,0.0006763084,0.0011367633],"category_scores_gemma":[0.010358464,0.00030157255,0.001165359,0.0021542,0.0009116394,0.0028662386,0.0016011783,0.0011831248,0.00039903863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018526202,0.00044889736,0.0082946485,0.00052931433,0.00035856434,0.0010135125,0.0012443309,0.09967476,0.011144391,0.27821615,0.007496886,0.59139323],"study_design_scores_gemma":[0.000040116913,0.0000629363,0.0019132167,0.00022114464,0.0002028776,0.00034524073,0.0003031388,0.7409602,0.007912009,0.21924406,0.028748237,0.00004693185],"about_ca_topic_score_codex":0.007262341,"about_ca_topic_score_gemma":0.0078058187,"teacher_disagreement_score":0.007262341,"about_ca_system_score_codex":0.0011491084,"about_ca_system_score_gemma":0.002564609,"threshold_uncertainty_score":0.015277505},"labels":[],"label_agreement":null},{"id":"W3120403074","doi":"10.1109/tse.2021.3101818","title":"Combining Genetic Programming and Model Checking to Generate Environment Assumptions","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Software Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; H2020 Excellent Science; Fonds National de la Recherche Luxembourg","keywords":"Component (thermodynamics); Computer science; Spurious relationship; Soundness; Flexibility (engineering); Benchmark (surveying); Genetic programming; Software; State (computer science); Artificial intelligence; Machine learning; Algorithm; Programming language; Mathematics","score_opus":0.01687721823519412,"score_gpt":0.22193729267168105,"score_spread":0.20506007443648694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120403074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020988703,0.00008647426,0.97438025,0.00020925327,0.000027598115,0.00008068539,0.0001391782,0.0027134875,0.0013744638],"genre_scores_gemma":[0.42461088,0.0001958412,0.5721382,0.0002605287,0.000036118276,0.00021520785,0.0007393831,0.00060387974,0.0011998488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709094,0.0010686093,0.00013032972,0.0006195386,0.00087255373,0.00021800408],"domain_scores_gemma":[0.9830676,0.013611845,0.0008332565,0.0015812219,0.00080197334,0.000104143604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030858328,0.0021084102,0.0010011155,0.002183291,0.0006793241,0.0014814015,0.0023007132,0.0017462706,0.0018318049],"category_scores_gemma":[0.018951312,0.001030596,0.002130872,0.0010848509,0.0017782366,0.002417619,0.0018957811,0.0027336383,0.00049912813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054552813,0.00008554236,0.002914682,0.000105776984,0.00007616629,0.00015791583,0.000080526705,0.9324885,0.0019903672,0.010902705,0.00066110684,0.050482143],"study_design_scores_gemma":[0.0000075507373,0.000014475774,0.0000964122,0.000013839278,0.000013262907,0.000019071775,0.000009608026,0.9882931,0.0013802708,0.00975773,0.0003887912,0.0000059460203],"about_ca_topic_score_codex":0.009372694,"about_ca_topic_score_gemma":0.015404188,"teacher_disagreement_score":0.009372694,"about_ca_system_score_codex":0.0014375822,"about_ca_system_score_gemma":0.002740358,"threshold_uncertainty_score":0.018636227},"labels":[],"label_agreement":null},{"id":"W3126101431","doi":"","title":"A Fast Fractional Difference Algorithm","year":2013,"lang":"en","type":"preprint","venue":"Research at the University of Copenhagen (University of Copenhagen)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computation; Algorithm; Series (stratigraphy); Order (exchange); Mathematics; Sample (material); Implementation; Arithmetic; Computer science; Applied mathematics; Finance","score_opus":0.041749519855475294,"score_gpt":0.27284255009301783,"score_spread":0.23109303023754255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126101431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016981225,0.00021562414,0.9943199,0.0001388798,0.00018673888,0.00003937615,0.00008304778,0.0007672326,0.002551015],"genre_scores_gemma":[0.064143226,0.00031316708,0.9268232,0.00026297514,0.00019260068,0.00018333412,0.00035529485,0.00045910935,0.0072670793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988238,0.00022598982,0.000076805765,0.00019970919,0.00053106167,0.00014257392],"domain_scores_gemma":[0.99870145,0.00053699873,0.00006577284,0.00026478412,0.00036923098,0.000061804836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014498851,0.0008950104,0.0013287688,0.0013154648,0.0009401687,0.0021224865,0.0019137757,0.0022553802,0.017172903],"category_scores_gemma":[0.007219847,0.0004886122,0.0011333865,0.001561301,0.00081192504,0.0022296603,0.0021975709,0.0018897383,0.005981708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042368018,0.000121511664,0.0007909317,0.00028009014,0.00009824917,0.00023902403,0.00014830755,0.18059795,0.015800942,0.14577231,0.01691129,0.6388157],"study_design_scores_gemma":[0.00009764109,0.00006816245,0.00018437291,0.000036450092,0.000026616235,0.0001928596,0.000025037116,0.8859009,0.006907457,0.077063456,0.029463215,0.000033749326],"about_ca_topic_score_codex":0.0017447495,"about_ca_topic_score_gemma":0.0013936337,"teacher_disagreement_score":0.017172903,"about_ca_system_score_codex":0.00072583253,"about_ca_system_score_gemma":0.0014193923,"threshold_uncertainty_score":0.057449102},"labels":[],"label_agreement":null},{"id":"W3128274009","doi":"10.1002/eng2.12369","title":"An investigation of the effects of chaotic maps on the performance of metaheuristics","year":2021,"lang":"en","type":"article","venue":"Engineering Reports","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Metaheuristic; Chaotic; Simulated annealing; Particle swarm optimization; Computer science; Benchmark (surveying); MATLAB; Swarm behaviour; Algorithm; Statistical hypothesis testing; Mathematical optimization; Mathematics; Artificial intelligence; Statistics","score_opus":0.005006273311699667,"score_gpt":0.18356297519858625,"score_spread":0.17855670188688658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128274009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922132,0.00021491155,0.005698167,0.00006562419,0.000008012477,0.000041386367,0.00004744156,0.00003025588,0.0016810106],"genre_scores_gemma":[0.9979824,0.000035699857,0.0018324875,0.000005938581,0.0000028668915,0.000014275985,0.000031762705,0.000007384864,0.000087209824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963291,0.0022673616,0.00019121316,0.00022627205,0.00083216873,0.00015394932],"domain_scores_gemma":[0.9298573,0.06083552,0.0032588646,0.0026821932,0.003092569,0.0002736476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049623037,0.0003542357,0.00037735034,0.0009315006,0.00025653298,0.00082344894,0.0004108431,0.00044188852,0.000687307],"category_scores_gemma":[0.044815056,0.00016950026,0.0003475969,0.0007195659,0.00062289066,0.0007907354,0.00052945275,0.0005254896,0.00009647428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022779987,0.0011658805,0.09540783,0.00079554116,0.0007234506,0.00039727546,0.0006993909,0.71106637,0.033124007,0.005183799,0.00077566307,0.14838275],"study_design_scores_gemma":[0.00011431102,0.005441113,0.11955421,0.00009571368,0.00019524137,0.00029995924,0.00054713234,0.82491326,0.043943487,0.0028970004,0.0019310251,0.00006765893],"about_ca_topic_score_codex":0.0009946376,"about_ca_topic_score_gemma":0.0005212901,"teacher_disagreement_score":0.0049623037,"about_ca_system_score_codex":0.00048817767,"about_ca_system_score_gemma":0.00033072324,"threshold_uncertainty_score":0.026243508},"labels":[],"label_agreement":null},{"id":"W3143185403","doi":"10.1109/cefc-06.2006.1633087","title":"Evolution of Wire Antennas in Three Dimensions using a Novel Growth Process","year":2006,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Process (computing); Computer science; Antenna (radio); Implementation; Directional antenna; Reconfigurable antenna; Electronic engineering; Space (punctuation); Omnidirectional antenna; Engineering; Telecommunications; Antenna efficiency; Software engineering","score_opus":0.017955038621686736,"score_gpt":0.24947027105430483,"score_spread":0.2315152324326181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143185403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28307775,0.00046329774,0.69041413,0.0006839115,0.00008487687,0.00007352973,0.000056795856,0.00030546042,0.02484032],"genre_scores_gemma":[0.74033666,0.00061672856,0.2518772,0.00009166232,0.000022489845,0.00015733426,0.00006787894,0.000086133165,0.006743898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998958,0.000030559084,0.00000617793,0.000017612148,0.000035087687,0.0000147724895],"domain_scores_gemma":[0.99959284,0.00024678512,0.000055929362,0.000043254488,0.000041319443,0.00001986863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026022986,0.0002934632,0.00029331158,0.00033187197,0.00041145372,0.0008366741,0.0004704958,0.0008626969,0.0011177346],"category_scores_gemma":[0.0012928563,0.00022879402,0.0005187075,0.00038663577,0.0008328886,0.0006195481,0.0007882148,0.0005497364,0.00024680753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006632706,0.000099829434,0.0017790963,0.000106668944,0.00003846819,0.00069942,0.00053334294,0.59929985,0.1066777,0.24683218,0.0011343015,0.04273283],"study_design_scores_gemma":[0.000040113806,0.00009423038,0.0002972748,0.0000091766215,0.000012588673,0.00020744163,0.000054694694,0.9464784,0.008922766,0.03899446,0.004867416,0.000021383095],"about_ca_topic_score_codex":0.00057211536,"about_ca_topic_score_gemma":0.00046106454,"teacher_disagreement_score":0.0011177346,"about_ca_system_score_codex":0.00034485466,"about_ca_system_score_gemma":0.0002451331,"threshold_uncertainty_score":0.0037391782},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08461084795732692,"score_gpt":0.21562371089393645,"score_spread":0.13101286293660952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175526646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003586579,0.000119989076,0.9932279,0.00020718774,0.00003230266,0.000030486775,0.00034505004,0.00097332,0.001477287],"genre_scores_gemma":[0.41106114,0.0007916384,0.568956,0.00069367903,0.0001342325,0.00056502724,0.0029261967,0.0017637479,0.013108344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904126,0.000289308,0.000056429617,0.00024119232,0.0002912233,0.00008062014],"domain_scores_gemma":[0.9979243,0.0013456183,0.00015000673,0.0002721911,0.00022159856,0.00008617136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015473319,0.000935348,0.0011294042,0.0012561285,0.000426345,0.002051622,0.0026493112,0.0014379361,0.0068356735],"category_scores_gemma":[0.009530395,0.0005601763,0.0018104024,0.0017414719,0.0014477499,0.0028996249,0.0023303786,0.002202457,0.0024771402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010975957,0.00006908243,0.001260383,0.0001460702,0.00007972052,0.00022731496,0.0001363789,0.731614,0.0028536345,0.15891017,0.0058071697,0.09878623],"study_design_scores_gemma":[0.0000061677047,0.000010464609,0.000029938903,0.000006855342,0.000005432028,0.000036471363,0.0000046322707,0.9651891,0.0003880121,0.03314567,0.0011712427,0.0000060374664],"about_ca_topic_score_codex":0.0036814671,"about_ca_topic_score_gemma":0.0049182754,"teacher_disagreement_score":0.0068356735,"about_ca_system_score_codex":0.0010969552,"about_ca_system_score_gemma":0.001648457,"threshold_uncertainty_score":0.02286762},"labels":[],"label_agreement":null},{"id":"W3177052905","doi":"10.1007/s10710-021-09418-4","title":"Evolving hierarchical memory-prediction machines in multi-task reinforcement learning","year":2021,"lang":"en","type":"preprint","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Reinforcement learning; Computer science; Task (project management); Variety (cybernetics); Encoding (memory); Artificial intelligence; Action (physics); ENCODE; Identification (biology); Salient; Machine learning; Decomposition; Engineering","score_opus":0.015449851232142396,"score_gpt":0.2573528990363186,"score_spread":0.24190304780417618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177052905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18483922,0.00052977144,0.80952764,0.0005785468,0.00008632797,0.00005129819,0.00003732546,0.00027292463,0.004076976],"genre_scores_gemma":[0.9276383,0.00011387033,0.069029756,0.00010800867,0.000028675182,0.00009375601,0.000037554528,0.000039772232,0.0029103358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999716,0.00013337165,0.000013479569,0.000051878127,0.00004062423,0.000044660705],"domain_scores_gemma":[0.99797696,0.001600724,0.000110179564,0.00008649512,0.00015549343,0.000070136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181626,0.0003350916,0.00088697334,0.00031788042,0.00033535942,0.0006085044,0.0012115533,0.0012064581,0.0020491963],"category_scores_gemma":[0.005567675,0.00040065555,0.0003104154,0.00040194593,0.00091108156,0.00094774447,0.00097572734,0.0011773973,0.00015913117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004569807,0.000036487014,0.00032873786,0.000019959345,0.000017362989,0.000029281844,0.000041162697,0.9724892,0.0005322261,0.011363016,0.00030264686,0.014794263],"study_design_scores_gemma":[0.000004877747,0.0000059787753,0.000027146978,0.0000013682844,0.0000013735533,0.0000018328502,0.0000017524607,0.99707115,0.0000694189,0.0027813104,0.00003274551,0.0000010063641],"about_ca_topic_score_codex":0.005002498,"about_ca_topic_score_gemma":0.0046675233,"teacher_disagreement_score":0.005002498,"about_ca_system_score_codex":0.0008964006,"about_ca_system_score_gemma":0.0006726672,"threshold_uncertainty_score":0.0099467635},"labels":[],"label_agreement":null},{"id":"W3182064321","doi":"10.1145/3449726.3463141","title":"House price prediction using clustering and genetic programming along with conducting a comparative study","year":2021,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; DBSCAN; Artificial intelligence; Regression; Genetic programming; Machine learning; Artificial neural network; Regression analysis; CURE data clustering algorithm; Correlation clustering; Statistics; Mathematics","score_opus":0.05797735410638076,"score_gpt":0.27505070094710155,"score_spread":0.21707334684072077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182064321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82702476,0.001380944,0.15566553,0.00078728783,0.00009297955,0.00019504681,0.00049664185,0.000639615,0.013717201],"genre_scores_gemma":[0.9176235,0.0004255963,0.08017141,0.00006534341,0.000028464081,0.00005451556,0.0004956813,0.000053569893,0.0010818858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982627,0.0008388143,0.00006637628,0.00031956832,0.00041841136,0.0000941549],"domain_scores_gemma":[0.9951644,0.0032358174,0.00023059463,0.00035407837,0.00094442506,0.00007061039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032176035,0.00084096467,0.00092079863,0.002681057,0.0005574081,0.0011992925,0.001034379,0.0011139966,0.0009372173],"category_scores_gemma":[0.008696121,0.00024511883,0.0011574704,0.004083235,0.00042569445,0.0016205034,0.0003440918,0.0006474893,0.00015266509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023772134,0.00032710526,0.014654509,0.00012014501,0.00024932876,0.00011849945,0.000098008546,0.8873601,0.0008249672,0.0039416654,0.0011564969,0.09091144],"study_design_scores_gemma":[0.000010860418,0.000086880405,0.0037383302,0.0000086189875,0.000036724938,0.000023605518,0.00006684293,0.99359655,0.00090743665,0.0011491724,0.00036236955,0.000012537155],"about_ca_topic_score_codex":0.031452056,"about_ca_topic_score_gemma":0.01811017,"teacher_disagreement_score":0.031452056,"about_ca_system_score_codex":0.0016170748,"about_ca_system_score_gemma":0.0008972021,"threshold_uncertainty_score":0.06253797},"labels":[],"label_agreement":null},{"id":"W3187199493","doi":"10.1109/cec45853.2021.9504998","title":"Evolving Simple Solutions to the CIFAR-10 Benchmark using Tangled Program Graphs","year":2021,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Benchmark (surveying); Benchmarking; Genetic programming; Class (philosophy); Simplicity; Machine learning; Modularity (biology); Artificial intelligence; Cardinality (data modeling); Graph; Contextual image classification; Theoretical computer science; Data mining; Image (mathematics)","score_opus":0.030184984218675798,"score_gpt":0.2877595361043339,"score_spread":0.25757455188565814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187199493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78115416,0.0010689074,0.19062819,0.0016523544,0.00024019142,0.00024135008,0.0012718912,0.0034412446,0.020301793],"genre_scores_gemma":[0.72414905,0.00031773766,0.2678854,0.00035327507,0.000032430293,0.00032571025,0.002281951,0.0004432368,0.004211159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.0001451805,0.000019837265,0.00011237654,0.00009671115,0.00007464818],"domain_scores_gemma":[0.9976826,0.0016024478,0.00011282646,0.00022575939,0.00025529877,0.00012094302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012620469,0.0010881429,0.0005767423,0.0010825864,0.00060571596,0.00083475135,0.0015056201,0.0014472152,0.0021826313],"category_scores_gemma":[0.0050308118,0.00029263005,0.0006111524,0.000958468,0.0007652547,0.0009387061,0.0008665101,0.001397416,0.00029795818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001332431,0.0001914354,0.0020231956,0.00015964746,0.000069203634,0.00015800857,0.00010618315,0.93352926,0.0023091522,0.008645593,0.0057656504,0.046909343],"study_design_scores_gemma":[0.000040142826,0.00007884252,0.00028491803,0.000013293502,0.0000120263085,0.000032390526,0.00005287162,0.9887165,0.0015167019,0.0077971593,0.0014478421,0.000007283022],"about_ca_topic_score_codex":0.007442502,"about_ca_topic_score_gemma":0.013391042,"teacher_disagreement_score":0.007442502,"about_ca_system_score_codex":0.0014505327,"about_ca_system_score_gemma":0.0012256958,"threshold_uncertainty_score":0.014798343},"labels":[],"label_agreement":null},{"id":"W3188410362","doi":"10.1109/tse.2021.3101818","title":"Combining Genetic Programming and Model Checking to Generate Environment Assumptions","year":2022,"lang":"en","type":"article","venue":"Aisberg (University of Bergamo)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; H2020 Excellent Science; Fonds National de la Recherche Luxembourg","keywords":"Computer science; Component (thermodynamics); Spurious relationship; Soundness; Flexibility (engineering); Benchmark (surveying); Software; Genetic programming; State (computer science); Artificial intelligence; Machine learning; Algorithm; Programming language","score_opus":0.014199649875834691,"score_gpt":0.18986800576013804,"score_spread":0.17566835588430335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188410362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023371877,0.00008189016,0.97229743,0.000196354,0.00002552331,0.000081879225,0.0001286507,0.002406327,0.0014100218],"genre_scores_gemma":[0.44086453,0.0001782157,0.55623895,0.00022274499,0.000030166106,0.00020685671,0.0006296274,0.0004905772,0.0011383728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974426,0.0009808099,0.00011836903,0.0005247505,0.00073671073,0.00019677599],"domain_scores_gemma":[0.9847602,0.012335043,0.0007756678,0.001326483,0.0007102637,0.00009238656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029506104,0.0019857169,0.0009419184,0.00219242,0.00065323943,0.0013549228,0.0020955089,0.0015838365,0.0017927899],"category_scores_gemma":[0.017324544,0.0009726022,0.001988218,0.0010127901,0.0015895072,0.0022583178,0.0017569069,0.0023662343,0.00044840836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050696195,0.00007959666,0.0029538444,0.00009864485,0.00007544007,0.00014617312,0.0000782283,0.9349766,0.0017830132,0.009394705,0.0005440913,0.049818993],"study_design_scores_gemma":[0.0000071724703,0.000015715961,0.00010579768,0.000014183544,0.000014195304,0.000019144052,0.000010457502,0.9897912,0.0012828535,0.008358821,0.0003745047,0.000005870794],"about_ca_topic_score_codex":0.009401357,"about_ca_topic_score_gemma":0.015470421,"teacher_disagreement_score":0.009401357,"about_ca_system_score_codex":0.0013171121,"about_ca_system_score_gemma":0.0025658268,"threshold_uncertainty_score":0.018693268},"labels":[],"label_agreement":null},{"id":"W3190647433","doi":"10.1109/cec45853.2021.9504827","title":"Deep Neural Network Guided Evolution of L-System Trees","year":2021,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Artificial intelligence; Deep learning; Genetic programming; Tree (set theory); Artificial neural network; Convolutional neural network; Machine learning; Function (biology); Grammatical evolution; Evolutionary algorithm; Tree structure; Theoretical computer science; Algorithm; Binary tree; Mathematics","score_opus":0.015209141321788067,"score_gpt":0.2375788196839892,"score_spread":0.22236967836220112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190647433","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5634297,0.0002240434,0.4195512,0.00036734654,0.00011863186,0.000090737274,0.000104145554,0.0010530101,0.015061172],"genre_scores_gemma":[0.8941813,0.0000687303,0.10155714,0.00012642967,0.000007593221,0.00006971877,0.000115091396,0.00016654823,0.0037074497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986744,0.000029334908,0.0000061448277,0.000032491225,0.00003155164,0.00003289031],"domain_scores_gemma":[0.999521,0.00026371816,0.00004461381,0.000048820464,0.000087935936,0.00003395102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004896132,0.00046522348,0.0003250492,0.00033557144,0.0002983166,0.00054755155,0.0005711485,0.0005606063,0.0020381352],"category_scores_gemma":[0.0019182458,0.00023195517,0.00042329944,0.00020708624,0.0005441513,0.0006063819,0.0006245968,0.0007171216,0.0002358721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009847784,0.00009821466,0.003705415,0.00007752803,0.000031765714,0.00025513358,0.00031818912,0.8548784,0.032595508,0.020325406,0.001634448,0.08598158],"study_design_scores_gemma":[0.0000052622117,0.000019533767,0.00014255593,0.0000057818625,0.0000044716967,0.000015077749,0.000017450673,0.99426466,0.0025300542,0.0023746635,0.0006169473,0.0000035958444],"about_ca_topic_score_codex":0.0024194575,"about_ca_topic_score_gemma":0.0038800896,"teacher_disagreement_score":0.0024194575,"about_ca_system_score_codex":0.00088914426,"about_ca_system_score_gemma":0.0005248497,"threshold_uncertainty_score":0.0068181753},"labels":[],"label_agreement":null},{"id":"W3194234892","doi":"10.1145/3468857","title":"Emergent Tangled Program Graphs in Partially Observable Recursive Forecasting and ViZDoom Navigation Tasks","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Compute Canada","keywords":"Computer science; Modularity (biology); Representation (politics); Process (computing); Theoretical computer science; Theme (computing); Graph; Artificial intelligence; Task (project management); State (computer science); Programming language; Systems engineering","score_opus":0.02006204693976415,"score_gpt":0.2547973784544936,"score_spread":0.23473533151472942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194234892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6301133,0.00022240648,0.36510533,0.00032328643,0.000021502487,0.00008557501,0.00028280923,0.0008474181,0.0029983115],"genre_scores_gemma":[0.9344031,0.00006947496,0.06377899,0.000037150297,0.000005625639,0.00007928034,0.00032286666,0.000070574955,0.0012327251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947375,0.0002348034,0.000025125479,0.00015446909,0.000053073138,0.000058828795],"domain_scores_gemma":[0.9965754,0.002487846,0.00034374138,0.00026853415,0.00013405527,0.00019042958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039578,0.00048021937,0.000388129,0.00046349675,0.0003586891,0.00066565856,0.0008556719,0.00073968957,0.002775865],"category_scores_gemma":[0.007445902,0.00024430268,0.00043692856,0.00040132224,0.0007357249,0.0022268868,0.0009928468,0.00081054796,0.00018490336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040301663,0.00022267809,0.010543304,0.0002467656,0.000065694076,0.00048178967,0.0012626778,0.8104281,0.004874809,0.051328566,0.0014438605,0.1186988],"study_design_scores_gemma":[0.000025553725,0.00007826041,0.001475574,0.000012030628,0.000011136193,0.00003842776,0.00014535246,0.9324676,0.0010706596,0.06378095,0.00088162156,0.000012840192],"about_ca_topic_score_codex":0.0067833625,"about_ca_topic_score_gemma":0.007592075,"teacher_disagreement_score":0.0067833625,"about_ca_system_score_codex":0.0007155109,"about_ca_system_score_gemma":0.00072223076,"threshold_uncertainty_score":0.013487756},"labels":[],"label_agreement":null},{"id":"W3194342044","doi":"10.1162/evco_a_00296","title":"An Analysis of the Influence of Noneffective Instructions in Linear Genetic Programming","year":2021,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Aga Khan Foundation","funders":"","keywords":"Computer science; Genetic programming; Intron; Theoretical computer science; Population; Artificial intelligence; Biology; Genetics; Gene","score_opus":0.0064796780933728815,"score_gpt":0.2599060293352423,"score_spread":0.2534263512418694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194342044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91269755,0.0006854873,0.07963596,0.00027221278,0.00002673968,0.000031020376,0.000054089556,0.00028921134,0.0063077314],"genre_scores_gemma":[0.9922637,0.00011345012,0.007200186,0.000023693061,0.000006621108,0.000015735548,0.000036420573,0.00004294672,0.00029728428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907124,0.0003951193,0.00003375367,0.000120388286,0.00022424692,0.00015520291],"domain_scores_gemma":[0.9743843,0.0230775,0.0009962879,0.00044452594,0.0007853802,0.00031209653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016496095,0.0005364395,0.00039364648,0.0005608225,0.00033048025,0.00084222015,0.00060548855,0.0005226085,0.00090327166],"category_scores_gemma":[0.019375727,0.0002830097,0.00040649055,0.00040836458,0.0009827806,0.0006771255,0.000406445,0.0008867363,0.000072985276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019265428,0.000113536786,0.003985212,0.00009170284,0.00005318693,0.00015793582,0.00007360053,0.96616,0.008712093,0.0060332436,0.00019353654,0.014233331],"study_design_scores_gemma":[0.0000074587833,0.00009478385,0.0013385362,0.000006677134,0.0000236275,0.00002493789,0.000015583126,0.99434537,0.002632157,0.0013843084,0.000120470315,0.000006077258],"about_ca_topic_score_codex":0.0036991283,"about_ca_topic_score_gemma":0.002647185,"teacher_disagreement_score":0.0036991283,"about_ca_system_score_codex":0.0008544038,"about_ca_system_score_gemma":0.00083658885,"threshold_uncertainty_score":0.008724034},"labels":[],"label_agreement":null},{"id":"W3203790825","doi":"10.1007/978-3-030-88113-9_5","title":"Valentino Braitenberg’s Table: Downhill Innovation of Vehicles via Darwinian Evolution","year":2021,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Darwinism; Darwin (ADL); Survivability; Exploit; Context (archaeology); Artificial intelligence; Computer security; Evolutionary biology; Geography; Biology","score_opus":0.024604560431335815,"score_gpt":0.26546234600582497,"score_spread":0.24085778557448914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203790825","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057571847,0.043495275,0.15426475,0.023058098,0.009215739,0.00006754934,0.00042411484,0.0004759937,0.76324123],"genre_scores_gemma":[0.20817314,0.030049056,0.066681564,0.0045952806,0.002462074,0.00016256647,0.00034930508,0.0007258991,0.6868011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997756,0.000048489535,0.0000077045015,0.00006244072,0.0000751401,0.000030626416],"domain_scores_gemma":[0.9997578,0.00013568191,0.000010812303,0.000033977496,0.000041241146,0.000020440082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033517784,0.0005265729,0.0004912728,0.00064831297,0.001034176,0.002843134,0.0010326564,0.0017561293,0.024562001],"category_scores_gemma":[0.0016393282,0.00030166053,0.00045526316,0.00097531645,0.002269852,0.0039336206,0.0010350883,0.0026933837,0.005895203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009674028,0.0000053940694,0.00004198753,0.000043231787,0.0000071035347,0.000019193927,0.000084448926,0.002641958,0.00021779386,0.92563725,0.041878894,0.029413024],"study_design_scores_gemma":[0.000005018259,0.000009724429,0.000044106488,0.000047670932,0.0000042663232,0.00004826728,0.000031730837,0.0030967162,0.00035042904,0.74266607,0.2536832,0.000012777329],"about_ca_topic_score_codex":0.0028928968,"about_ca_topic_score_gemma":0.0036203575,"teacher_disagreement_score":0.024562001,"about_ca_system_score_codex":0.0016124638,"about_ca_system_score_gemma":0.0010212852,"threshold_uncertainty_score":0.0821681},"labels":[],"label_agreement":null},{"id":"W3210102196","doi":"10.5281/zenodo.3875691","title":"Generation of OPCs and Oligodendrocytes from iPSCs (interactive SOP)","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.06533867339507925,"score_gpt":0.25291111197397537,"score_spread":0.1875724385788961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210102196","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15715207,0.0043278616,0.6327686,0.0010147465,0.002072627,0.006998713,0.05584996,0.018021474,0.12179397],"genre_scores_gemma":[0.31569713,0.007181486,0.42680782,0.0012040111,0.0002542413,0.015399296,0.08441491,0.0077330098,0.14130807],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935347,0.000047004352,0.000070263144,0.00011096022,0.00031193046,0.00010640495],"domain_scores_gemma":[0.99958414,0.00009356192,0.0000316795,0.00014185208,0.000086933855,0.00006171875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008641132,0.00090754876,0.00060205365,0.0010302273,0.0008305954,0.0009101493,0.0011593959,0.0009235417,0.017375087],"category_scores_gemma":[0.00066905614,0.0007422493,0.0009358815,0.00053827494,0.0004178052,0.000574609,0.0010746492,0.0024235304,0.008997028],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016804972,0.00010075702,0.0003184829,0.0004631584,0.000041054205,0.0004170644,0.00020211752,0.0011232966,0.9540713,0.0065321876,0.0101792,0.026383346],"study_design_scores_gemma":[0.000046985173,0.00009212252,0.0010824195,0.00007737154,0.00007163038,0.0006777021,0.000056129033,0.0020336134,0.828648,0.0014933423,0.16568078,0.000039938175],"about_ca_topic_score_codex":0.0008528478,"about_ca_topic_score_gemma":0.0014928593,"teacher_disagreement_score":0.017375087,"about_ca_system_score_codex":0.00033393237,"about_ca_system_score_gemma":0.0006451393,"threshold_uncertainty_score":0.058125436},"labels":[],"label_agreement":null},{"id":"W3212075545","doi":"10.11606/d.45.2005.tde-20210729-143109","title":"Uma ferramenta interativa para análise de padrões baseada em entropia","year":2005,"lang":"pt","type":"dissertation","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto","keywords":"Humanities; Philosophy","score_opus":0.02318558703029229,"score_gpt":0.30354425542711827,"score_spread":0.280358668396826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212075545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10177656,0.008896939,0.832377,0.00425081,0.00071107503,0.0014138892,0.0030415982,0.009974705,0.037557356],"genre_scores_gemma":[0.4456643,0.003890916,0.5288569,0.0009935892,0.00025120718,0.00095037476,0.002209208,0.0012611318,0.015922397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9872197,0.003423734,0.001119937,0.0026707344,0.004951201,0.0006148186],"domain_scores_gemma":[0.9630809,0.020408222,0.002893003,0.006321458,0.006701283,0.00059510174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077861785,0.0023995475,0.0018580767,0.008009235,0.0018547093,0.010290516,0.0027385864,0.0021436377,0.009636345],"category_scores_gemma":[0.044749536,0.001137443,0.0019494811,0.0074514784,0.0027598972,0.0077634077,0.004476246,0.002838516,0.0040986133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010045794,0.00046718522,0.0625342,0.0038136533,0.00076966715,0.0006114252,0.004888294,0.024777671,0.049097374,0.0427338,0.010200002,0.7991021],"study_design_scores_gemma":[0.00024380365,0.0020668125,0.1214122,0.003735561,0.0011227805,0.0034709964,0.011060514,0.25731963,0.15598695,0.1383188,0.3042843,0.0009775821],"about_ca_topic_score_codex":0.009108152,"about_ca_topic_score_gemma":0.00877506,"teacher_disagreement_score":0.010290516,"about_ca_system_score_codex":0.0024327938,"about_ca_system_score_gemma":0.0030625258,"threshold_uncertainty_score":0.04117775},"labels":[],"label_agreement":null},{"id":"W3517843","doi":"10.22215/etd/2008-08625","title":"Co-evolutionary automatically defined functions in genetic programming","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Computer science; Artificial intelligence","score_opus":0.012121426303189764,"score_gpt":0.25776849591061735,"score_spread":0.24564706960742758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3517843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014157555,0.00017424439,0.98084587,0.000107264525,0.00003739081,0.000035274094,0.0000125188,0.00038642145,0.0042434772],"genre_scores_gemma":[0.25978735,0.0002600127,0.73077935,0.00013849804,0.000043033528,0.00018710838,0.00012458459,0.0004479777,0.008232097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988814,0.00048731818,0.000060036098,0.00014788323,0.00035264553,0.000070706024],"domain_scores_gemma":[0.9982324,0.0011711619,0.00006852602,0.00023803358,0.00025134883,0.000038525603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201601,0.00036341645,0.00042783635,0.0006845542,0.00039391808,0.0011169348,0.001353869,0.0009579044,0.0024255118],"category_scores_gemma":[0.005558429,0.0003098876,0.00050425687,0.00083669805,0.0010302003,0.001163593,0.0009786274,0.0014820541,0.00067597907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001224078,0.00015641766,0.0013307438,0.00013591071,0.000048692276,0.0001373817,0.00032996383,0.32570612,0.008994314,0.28194365,0.002081024,0.37901342],"study_design_scores_gemma":[0.000021123538,0.00004095065,0.00022453032,0.000037176418,0.000015295518,0.00010611363,0.00002745728,0.9392724,0.0056646583,0.04750467,0.0070732334,0.000012438986],"about_ca_topic_score_codex":0.0022694233,"about_ca_topic_score_gemma":0.002818036,"teacher_disagreement_score":0.0024255118,"about_ca_system_score_codex":0.00094007247,"about_ca_system_score_gemma":0.00074257335,"threshold_uncertainty_score":0.008114159},"labels":[],"label_agreement":null},{"id":"W4200199124","doi":"10.5540/03.2021.008.01.0411","title":"Evolução diferencial com mutação ordenada em problemas de otimização monobjetivo com restrições de caixa","year":2021,"lang":"pt","type":"article","venue":"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PTC (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.017802454329084966,"score_gpt":0.24075269294763832,"score_spread":0.22295023861855334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200199124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26638088,0.0029020538,0.70581925,0.00085328735,0.0002960984,0.0002265131,0.00015835077,0.0014939483,0.021869695],"genre_scores_gemma":[0.70710087,0.0009340644,0.2752772,0.00038194965,0.00006559206,0.0002695452,0.0001959366,0.00025205564,0.01552281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987431,0.00027169395,0.000100142,0.00031681315,0.00041565363,0.00015267226],"domain_scores_gemma":[0.99739885,0.001364779,0.00029423652,0.00038239395,0.00042475693,0.00013504844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017344713,0.0010453968,0.0009822283,0.0010966653,0.0008706714,0.0022144134,0.0016594424,0.0011894753,0.0038570063],"category_scores_gemma":[0.0056021786,0.0004949525,0.00087951944,0.00092835707,0.0010354236,0.0016022726,0.0015032422,0.0012154464,0.0005483569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067880115,0.00041371374,0.008507851,0.0008921745,0.00022956548,0.00046840293,0.00073406607,0.4449843,0.060252246,0.068569265,0.0032328924,0.4110367],"study_design_scores_gemma":[0.000094896604,0.0006375995,0.0034697985,0.00012175695,0.0001400305,0.00055462157,0.00029961418,0.9161855,0.03228465,0.029362587,0.016787764,0.000061138984],"about_ca_topic_score_codex":0.0030082618,"about_ca_topic_score_gemma":0.003422081,"teacher_disagreement_score":0.0038570063,"about_ca_system_score_codex":0.001418023,"about_ca_system_score_gemma":0.0016725957,"threshold_uncertainty_score":0.012903035},"labels":[],"label_agreement":null},{"id":"W4205441696","doi":"10.1145/1830761.1830913","title":"Statistical analysis for evolutionary computation","year":2010,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Government of Canada; University of Guelph","funders":"","keywords":"Evolutionary computation; Citation; Computer science; Government (linguistics); Library science; Operations research; Artificial intelligence; Mathematics","score_opus":0.013696854163332222,"score_gpt":0.2860462464602212,"score_spread":0.272349392296889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205441696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033645163,0.0050666844,0.98117363,0.0018423321,0.00085283275,0.00013401767,0.0010042827,0.0034088057,0.006180926],"genre_scores_gemma":[0.025362054,0.008672645,0.9387957,0.0019233307,0.0031018835,0.0019716816,0.0038402379,0.0043493854,0.011983189],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98953736,0.0064786724,0.00071195734,0.00090784644,0.0021051902,0.00025910488],"domain_scores_gemma":[0.9697955,0.021330796,0.0009070951,0.0035011158,0.004049191,0.0004162949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011311066,0.0021432706,0.0020329927,0.0046722284,0.0010537234,0.003967187,0.0024571165,0.0021943029,0.0460196],"category_scores_gemma":[0.053235784,0.001393473,0.0032042572,0.004745434,0.0023981438,0.0039076232,0.0030445014,0.005548322,0.01823457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007420395,0.00007343393,0.0012728348,0.001506507,0.0004218205,0.0002128465,0.0002438971,0.015375288,0.0013795078,0.38178033,0.20457691,0.39308232],"study_design_scores_gemma":[0.000051093735,0.00006829604,0.0012030813,0.0004921654,0.000089612964,0.0004015049,0.0000837999,0.0761865,0.0008710219,0.6586998,0.2617833,0.00006982261],"about_ca_topic_score_codex":0.0017656931,"about_ca_topic_score_gemma":0.001838948,"teacher_disagreement_score":0.0460196,"about_ca_system_score_codex":0.0016986933,"about_ca_system_score_gemma":0.0033437284,"threshold_uncertainty_score":0.15395087},"labels":[],"label_agreement":null},{"id":"W4205958788","doi":"10.1109/smc52423.2021.9659280","title":"The Behavioural and Topological Effects of Measurement Noise on Evolutionary Neurocontrollers","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"","keywords":"Noise (video); Computer science; Topology (electrical circuits); Artificial intelligence; Engineering; Electrical engineering","score_opus":0.04878738255001716,"score_gpt":0.26713096991248897,"score_spread":0.2183435873624718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205958788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9354233,0.00009709086,0.061937507,0.00017713668,0.000028796396,0.000020928557,0.000020683077,0.00014335626,0.0021513205],"genre_scores_gemma":[0.99520254,0.000023393033,0.004492002,0.000020513808,0.0000017625996,0.000011877419,0.000011980454,0.000012958753,0.00022301436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933976,0.00027269314,0.000037622303,0.0000731696,0.0002042233,0.00007253078],"domain_scores_gemma":[0.99543273,0.002957378,0.0004929539,0.000413989,0.00054358575,0.00015941744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009379815,0.00039928444,0.00029864753,0.00037037156,0.00036876413,0.00060539646,0.00055437896,0.0006582161,0.0007028221],"category_scores_gemma":[0.0121961655,0.00029560406,0.00028996257,0.00015100391,0.001077884,0.0007574192,0.00060997636,0.00055659685,0.000083773666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015821945,0.000091254726,0.0063265488,0.0000781357,0.00005431807,0.00026938895,0.000206986,0.9113116,0.059255496,0.004662872,0.00009910794,0.017486045],"study_design_scores_gemma":[0.000015423504,0.00032870902,0.00617439,0.000012683641,0.000022165581,0.00019051963,0.00009272142,0.9731015,0.016981015,0.002753586,0.0003029937,0.000024296742],"about_ca_topic_score_codex":0.0009644378,"about_ca_topic_score_gemma":0.0009678306,"teacher_disagreement_score":0.0009644378,"about_ca_system_score_codex":0.00056967355,"about_ca_system_score_gemma":0.00034081042,"threshold_uncertainty_score":0.0049605966},"labels":[],"label_agreement":null},{"id":"W4211198679","doi":"10.1007/978-981-16-8113-4_1","title":"Finding Simple Solutions to Multi-Task Visual Reinforcement Learning Problems with Tangled Program Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reinforcement learning; Task (project management); Benchmark (surveying); Computer science; Modularity (biology); Artificial intelligence; Population; Benchmarking; Action (physics); Machine learning; Simple (philosophy); Theoretical computer science; Biology; Engineering","score_opus":0.0228751579642623,"score_gpt":0.2598006715739276,"score_spread":0.23692551360966532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211198679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0958375,0.00041815618,0.8893353,0.00026850702,0.000055134507,0.00017807026,0.00012014631,0.00075127196,0.013035934],"genre_scores_gemma":[0.64503294,0.00034665363,0.3403035,0.00011275242,0.00003692635,0.0003732893,0.0002106125,0.00022564348,0.013357718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998685,0.00003345251,0.0000076034016,0.000045024717,0.00002170499,0.000023671893],"domain_scores_gemma":[0.99930394,0.0005179933,0.0000674402,0.000031068244,0.00003503052,0.00004459566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037776303,0.0009815141,0.000808995,0.00047224946,0.00034345975,0.000683604,0.0010583617,0.0015748057,0.0067241164],"category_scores_gemma":[0.0023365093,0.00056835805,0.0005884741,0.0005174966,0.00076065754,0.0011814405,0.0011869565,0.0011682103,0.00045500268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010820402,0.00009425921,0.00027211697,0.00022532156,0.000039382445,0.000120191544,0.00011078258,0.90316343,0.0026794574,0.01986768,0.0019201728,0.07139897],"study_design_scores_gemma":[0.00003183484,0.000057468482,0.00007461192,0.000014194417,0.000007269815,0.00002268997,0.000020640706,0.97277695,0.0004401652,0.026021104,0.0005273486,0.000005670507],"about_ca_topic_score_codex":0.002034968,"about_ca_topic_score_gemma":0.0032131486,"teacher_disagreement_score":0.0067241164,"about_ca_system_score_codex":0.0005701823,"about_ca_system_score_gemma":0.00060131564,"threshold_uncertainty_score":0.022494435},"labels":[],"label_agreement":null},{"id":"W42125416","doi":"10.1007/978-1-4419-9685-5_8","title":"Evolutionary Algorithms and Speech Recognition","year":2011,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Robustness (evolution); Computer science; Speech recognition; Front and back ends; TIMIT; Noise (video); Variance (accounting); Limit (mathematics); Algorithm; Artificial intelligence; Hidden Markov model; Mathematics","score_opus":0.013369227126444016,"score_gpt":0.19053204435400098,"score_spread":0.17716281722755697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42125416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006784141,0.10804709,0.77715915,0.0023644734,0.004845338,0.000049661296,0.00018044931,0.0009833261,0.099586286],"genre_scores_gemma":[0.1606805,0.07081841,0.2864663,0.0011334093,0.0042422,0.00015842915,0.000868986,0.00079909666,0.47483262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997471,0.000059461698,0.000017247432,0.000053659976,0.00010386883,0.000018595076],"domain_scores_gemma":[0.99974996,0.00014349203,0.000011774881,0.000036461213,0.00004760843,0.000010787683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033532295,0.000692575,0.0009042878,0.00075298647,0.0002736241,0.0015660923,0.00066396216,0.0013253322,0.013113246],"category_scores_gemma":[0.0014327466,0.00033242197,0.00034736583,0.0012537385,0.0008080855,0.0014665185,0.0006038573,0.001071818,0.004557833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029366993,0.00003720707,0.00015739426,0.00024939454,0.00003467545,0.00012265045,0.00010636938,0.029447028,0.0038406628,0.11266488,0.034149695,0.81916064],"study_design_scores_gemma":[0.000021316733,0.000105146915,0.0013435645,0.0003496631,0.000051909425,0.0010712151,0.00014529619,0.23925437,0.008654406,0.3504754,0.3984535,0.00007429147],"about_ca_topic_score_codex":0.0008725625,"about_ca_topic_score_gemma":0.0010707164,"teacher_disagreement_score":0.013113246,"about_ca_system_score_codex":0.0003477502,"about_ca_system_score_gemma":0.00025551775,"threshold_uncertainty_score":0.043868244},"labels":[],"label_agreement":null},{"id":"W4225395200","doi":"10.1109/tevc.2022.3152257","title":"IEEE Transactions on Evolutionary Computation Publication Information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Southern University of Science and Technology; Universität Bielefeld; Xidian University; Guangdong University of Technology; Brock University; Universidad Veracruzana; Zhengzhou University; University of Hong Kong; Swinburne University of Technology; Griffith University; RMIT University; Nanyang Technological University; Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; Shenzhen University; Nanjing University; Dalhousie University; University of Melbourne; University of Sheffield; University of Exeter; South China University of Technology; City University of Hong Kong; Aberystwyth University; Norges Teknisk-Naturvitenskapelige Universitet","keywords":"Evolutionary computation; Computer science; Computation; Evolutionary algorithm; Human-based evolutionary computation; Artificial intelligence; Theoretical computer science; Interactive evolutionary computation; Evolutionary programming; Algorithm","score_opus":0.014466550623449472,"score_gpt":0.24034917080551912,"score_spread":0.22588262018206964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225395200","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076593026,0.021666966,0.24968003,0.01065577,0.0570504,0.00046269206,0.01530828,0.0060635065,0.6314531],"genre_scores_gemma":[0.04385564,0.02387403,0.051835652,0.0014731337,0.0054960013,0.00027955577,0.023148537,0.0025249796,0.84751254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943393,0.00005306475,0.000038577968,0.000059633516,0.00036961335,0.000045139866],"domain_scores_gemma":[0.99850285,0.0003017098,0.000046727433,0.00030316203,0.00071413856,0.00013136552],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00091064454,0.0007566437,0.0013173587,0.002071419,0.00056389865,0.0026273446,0.0009867337,0.0017150628,0.3370863],"category_scores_gemma":[0.0030992182,0.00035696366,0.00051182427,0.0025355972,0.00032483265,0.0021721139,0.0010980901,0.0013611628,0.13660088],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010177876,0.00009792485,0.00044639895,0.0004607607,0.000020848967,0.00015387799,0.000024205256,0.0035352774,0.0025504064,0.018279389,0.52497655,0.4493526],"study_design_scores_gemma":[0.000037692203,0.00006683725,0.0011215344,0.00025740807,0.000040874173,0.0004506011,0.000033422628,0.016714646,0.003258999,0.029017597,0.9489585,0.000041991632],"about_ca_topic_score_codex":0.0007082877,"about_ca_topic_score_gemma":0.00096990017,"teacher_disagreement_score":0.6629137,"about_ca_system_score_codex":0.00034184536,"about_ca_system_score_gemma":0.0010214506,"threshold_uncertainty_score":0.94556594},"labels":[],"label_agreement":null},{"id":"W4225566301","doi":"10.5206/mt.v2i1.14421","title":"The art of algorithmic guessing in gfun","year":2022,"lang":"en","type":"preprint","venue":"Maple Transactions","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Computer science","score_opus":0.016563302652947868,"score_gpt":0.2588338502748661,"score_spread":0.24227054762191824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225566301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00560756,0.0037014205,0.9512139,0.0068116784,0.0008031023,0.000060866645,0.00015643277,0.0009561036,0.030688897],"genre_scores_gemma":[0.20350064,0.0053602844,0.7667241,0.0039189835,0.0017663381,0.00052864867,0.00039489235,0.0014113911,0.016394773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99171937,0.0039826706,0.00046320574,0.0014430097,0.0019433361,0.00044846552],"domain_scores_gemma":[0.9784232,0.016102957,0.0004968837,0.0040519577,0.0007267009,0.00019832962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00981451,0.0016900604,0.0019868012,0.0025082212,0.0029681018,0.006162064,0.003150421,0.004360966,0.015871802],"category_scores_gemma":[0.04684308,0.0012764502,0.0027812105,0.0028268667,0.016606543,0.018675897,0.006557881,0.011340486,0.005074581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055649234,0.000016249183,0.0001875493,0.00021080542,0.00002743084,0.000059068498,0.00033028156,0.0068800524,0.00031159032,0.95380986,0.004715068,0.033396445],"study_design_scores_gemma":[0.000010802124,0.000013828096,0.00003408064,0.00008317256,0.000007762068,0.00004557285,0.000028136823,0.012504552,0.0003632004,0.9764107,0.010477414,0.000020660409],"about_ca_topic_score_codex":0.0015462502,"about_ca_topic_score_gemma":0.0011585696,"teacher_disagreement_score":0.015871802,"about_ca_system_score_codex":0.0022274505,"about_ca_system_score_gemma":0.0015591765,"threshold_uncertainty_score":0.053096414},"labels":[],"label_agreement":null},{"id":"W4230231196","doi":"10.1007/978-3-642-21822-4_7","title":"Basic Object Oriented Genetic Programming","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Genetic programming; Object (grammar); Object-oriented programming; Theoretical computer science; Programming language; Linear programming; Artificial intelligence; Algorithm","score_opus":0.01606424199300017,"score_gpt":0.23396050537295532,"score_spread":0.21789626337995516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230231196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027411676,0.0012923247,0.87971586,0.00025505596,0.0002215897,0.00011270077,0.00020668046,0.0016909542,0.11376371],"genre_scores_gemma":[0.05213085,0.0034975177,0.8393544,0.00042012866,0.00013976615,0.0003717286,0.0009754632,0.0007462648,0.1023638],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998097,0.000021073649,0.000010878656,0.000034119406,0.00010656607,0.000017731089],"domain_scores_gemma":[0.9999118,0.000028093227,0.000005607399,0.000024065946,0.000023377535,0.0000070487386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025262567,0.00055376027,0.00044273853,0.00049261533,0.0003474917,0.0013060414,0.0012574239,0.00088918355,0.011009972],"category_scores_gemma":[0.00047292205,0.00031641638,0.0005941024,0.0010100006,0.00058937166,0.00085237337,0.0006263147,0.0011776183,0.0050276695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027770602,0.000071924514,0.00019083061,0.00034738937,0.000030331308,0.00012305731,0.00020544614,0.016626934,0.008921353,0.44157416,0.013684992,0.51819575],"study_design_scores_gemma":[0.000043462995,0.000074485055,0.00044901093,0.00028414707,0.000047637397,0.0006126282,0.00004928691,0.065979205,0.008795859,0.47825631,0.44536436,0.000043690816],"about_ca_topic_score_codex":0.0005204607,"about_ca_topic_score_gemma":0.0005587555,"teacher_disagreement_score":0.011009972,"about_ca_system_score_codex":0.00029508173,"about_ca_system_score_gemma":0.00047972327,"threshold_uncertainty_score":0.036831975},"labels":[],"label_agreement":null},{"id":"W4230253172","doi":"10.1038/npre.2009.3913.1","title":"Design of a dynamic model of genes with multiple autonomous regulatory modules by evolution in silico","year":2009,"lang":"en","type":"preprint","venue":"Nature Precedings","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; National Science Foundation","keywords":"In silico; Benchmark (surveying); Crossover; Computer science; Exploit; Evolutionary algorithm; Genetic algorithm; Computational biology; Artificial intelligence; Gene; Machine learning; Biology; Genetics","score_opus":0.00811556879099194,"score_gpt":0.22971087267270823,"score_spread":0.2215953038817163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230253172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19775371,0.00018011159,0.79306155,0.00044890644,0.00007333598,0.00006587865,0.00013160592,0.00057323906,0.0077115684],"genre_scores_gemma":[0.8979613,0.00023953075,0.09687764,0.00007909363,0.00001362739,0.0002813303,0.00013326605,0.00009696524,0.0043172752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998698,0.000036925776,0.0000056645763,0.00003464478,0.000037307316,0.000015582364],"domain_scores_gemma":[0.9998603,0.00007047458,0.000018488268,0.000015674323,0.000018687211,0.000016298469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030424615,0.00037138702,0.0006644391,0.0002596524,0.0003074979,0.00072035805,0.00090821186,0.0008119347,0.0017216728],"category_scores_gemma":[0.0004894954,0.00035526077,0.0007275437,0.00021721653,0.0005763307,0.00045749056,0.00046626254,0.00054831797,0.00027650144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026693362,0.000022349106,0.00025067042,0.000023520442,0.000015413627,0.00005572428,0.00002060061,0.97378695,0.013378407,0.010292313,0.00009277266,0.002034598],"study_design_scores_gemma":[0.000015298316,0.000017237291,0.00004208119,0.0000017304269,0.0000059999866,0.000009823096,0.0000030793524,0.9958287,0.001981353,0.0014792978,0.00061161094,0.000003824116],"about_ca_topic_score_codex":0.0012867802,"about_ca_topic_score_gemma":0.0008224357,"teacher_disagreement_score":0.0017216728,"about_ca_system_score_codex":0.00060410367,"about_ca_system_score_gemma":0.0005908101,"threshold_uncertainty_score":0.005759597},"labels":[],"label_agreement":null},{"id":"W4230401539","doi":"10.32920/ryerson.14662446.v1","title":"Texture classification using gene expression programming","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Artificial intelligence; Image texture; Pattern recognition (psychology); Computer science; Segmentation; Image segmentation; Computer vision; Pixel; Contextual image classification; Image processing; Digital image; Scale-space segmentation; Feature extraction; Texture (cosmology); Digital image processing; Feature (linguistics); Image (mathematics)","score_opus":0.0541649198913891,"score_gpt":0.3010817169562901,"score_spread":0.246916797064901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230401539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086602755,0.00020369627,0.90860456,0.00023199014,0.00004971539,0.00008853029,0.00014025175,0.0010663947,0.003012143],"genre_scores_gemma":[0.4423683,0.00030328013,0.55055726,0.00018615254,0.000038981194,0.00038934514,0.00047897667,0.00029317802,0.0053844783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997917,0.00004129792,0.000009265179,0.00007407992,0.000060549457,0.000023128065],"domain_scores_gemma":[0.99966836,0.0001928148,0.00003423119,0.000022652597,0.00006828759,0.000013684257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050345965,0.00051831064,0.00049506663,0.00061785866,0.0003147547,0.0010105434,0.0007840396,0.0006683879,0.0014696319],"category_scores_gemma":[0.0012238153,0.00025408805,0.0007322437,0.0006477818,0.00064336206,0.0005024277,0.0004768201,0.0008596416,0.00028813357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012204056,0.00017396832,0.0040183747,0.00015490205,0.00007866061,0.00015616565,0.00020731447,0.64645195,0.07383265,0.017034203,0.0016418399,0.25612798],"study_design_scores_gemma":[0.000004324354,0.00002541353,0.00031182406,0.000005698297,0.000008790324,0.000025408151,0.000013528159,0.9865398,0.0076322476,0.0042481595,0.001179096,0.000005811479],"about_ca_topic_score_codex":0.0016090085,"about_ca_topic_score_gemma":0.0010828364,"teacher_disagreement_score":0.0016090085,"about_ca_system_score_codex":0.0007848091,"about_ca_system_score_gemma":0.00033745734,"threshold_uncertainty_score":0.00569427},"labels":[],"label_agreement":null},{"id":"W4230496309","doi":"10.1145/3067695.3067712","title":"Introductory statistics for EC","year":2017,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Citation; Computer science; Library science; Information retrieval; World Wide Web","score_opus":0.025675285711625303,"score_gpt":0.2639686961726163,"score_spread":0.238293410460991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230496309","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020790787,0.011455706,0.43045598,0.037444368,0.017765831,0.0017677874,0.100251295,0.04450558,0.3542744],"genre_scores_gemma":[0.047677927,0.024280244,0.32340166,0.02583534,0.035501726,0.009909117,0.17938782,0.0412309,0.31277525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932828,0.0025865317,0.00074890046,0.0006787745,0.002302078,0.00040080323],"domain_scores_gemma":[0.9334152,0.040823698,0.002407644,0.0069527244,0.014436156,0.0019645167],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008060184,0.0015834068,0.0015559677,0.0061351024,0.0010255894,0.0052970764,0.001884588,0.0023935135,0.30948138],"category_scores_gemma":[0.093785666,0.0009004016,0.0012504655,0.00987226,0.0010048451,0.0059042866,0.0025453279,0.003926513,0.16347037],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032489217,0.000021540456,0.00025393534,0.00016683053,0.000007901756,0.00003454296,0.000035913756,0.0006516473,0.00009285818,0.012321149,0.9187174,0.06766379],"study_design_scores_gemma":[0.000019876083,0.000041235253,0.00078180386,0.00027927913,0.00000628067,0.00012739893,0.00006875817,0.0018974396,0.0001964734,0.050522268,0.9460276,0.000031621836],"about_ca_topic_score_codex":0.004952432,"about_ca_topic_score_gemma":0.0044575497,"teacher_disagreement_score":0.30948138,"about_ca_system_score_codex":0.0024314472,"about_ca_system_score_gemma":0.005601908,"threshold_uncertainty_score":0.984941},"labels":[],"label_agreement":null},{"id":"W4230649915","doi":"10.32920/ryerson.14646798","title":"Indirect Estimation Of Distribution Algorithms For The Evolution Of Tree-Shaped Structures","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gene expression programming; Algorithm; Estimation of distribution algorithm; Tree (set theory); Computer science; Sampling distribution; Sampling (signal processing); Population; Mathematics; Distribution (mathematics); Probabilistic logic; Mathematical optimization; Statistics; Artificial intelligence; Filter (signal processing)","score_opus":0.022581532623731457,"score_gpt":0.28123412853360324,"score_spread":0.2586525959098718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230649915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015047589,0.00009793781,0.9836917,0.000050609688,0.00000944075,0.00003546396,0.000014220414,0.0003154713,0.0007376266],"genre_scores_gemma":[0.3374812,0.00026287264,0.6592243,0.00010400943,0.00002985581,0.00035792225,0.00020730919,0.00033423307,0.0019982615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987729,0.0005417801,0.000051065083,0.000235794,0.0003171473,0.000081273625],"domain_scores_gemma":[0.9926016,0.0059447926,0.0003866989,0.0005263405,0.00043285266,0.000107774016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025454524,0.00079052255,0.0007829499,0.0010091441,0.00035323162,0.0009305559,0.0014858992,0.00087118463,0.0016944548],"category_scores_gemma":[0.015396819,0.00049634126,0.0007277268,0.0007037702,0.0010893102,0.0019301635,0.0016674576,0.001709582,0.0003495339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106783016,0.00011268321,0.005770505,0.00013592395,0.0000743691,0.000061355364,0.00023758858,0.66642565,0.0048852237,0.06050374,0.0007297719,0.26095653],"study_design_scores_gemma":[0.000014038867,0.00003954567,0.00027220132,0.000009338453,0.000007982638,0.000030107549,0.000013258867,0.9843768,0.0015234565,0.013041618,0.00066522235,0.000006379073],"about_ca_topic_score_codex":0.001206403,"about_ca_topic_score_gemma":0.0016107714,"teacher_disagreement_score":0.0025454524,"about_ca_system_score_codex":0.00094518764,"about_ca_system_score_gemma":0.001008235,"threshold_uncertainty_score":0.013461769},"labels":[],"label_agreement":null},{"id":"W4231385108","doi":"10.22215/etd/2008-08966","title":"Grammar-based object-oriented genetic programming: an initial implementation","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Grammar; Object (grammar); Programming language; Artificial intelligence; Linguistics; Philosophy","score_opus":0.018822490395583445,"score_gpt":0.3257691646648061,"score_spread":0.3069466742692227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231385108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003289471,0.00008978079,0.97674155,0.00014330795,0.00005738047,0.00029246556,0.00021942127,0.011106281,0.008060419],"genre_scores_gemma":[0.032757785,0.00036427483,0.95534736,0.00012941386,0.000019079029,0.00036152898,0.0006433495,0.001439223,0.008937979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962807,0.00007393872,0.00003173878,0.000059740163,0.00016228379,0.00004425178],"domain_scores_gemma":[0.9994512,0.00019340322,0.000016934104,0.00011436142,0.00017911097,0.000045037104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009949963,0.00047303137,0.00039547562,0.0004996929,0.0004339921,0.002147417,0.0028003675,0.0012833226,0.00979163],"category_scores_gemma":[0.0021435858,0.0004735078,0.0007145774,0.00086482865,0.00068775704,0.0009490128,0.0009988549,0.0016633248,0.0045741377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039703498,0.00054764206,0.0015067764,0.00054631085,0.00012903362,0.00045483507,0.001130098,0.06702242,0.03045662,0.20618738,0.017518455,0.6741033],"study_design_scores_gemma":[0.000369435,0.00027915312,0.0008550607,0.00031763053,0.00016347227,0.0006111988,0.00018701426,0.5899523,0.04199786,0.062768415,0.3024081,0.00009040926],"about_ca_topic_score_codex":0.0043391758,"about_ca_topic_score_gemma":0.0041624755,"teacher_disagreement_score":0.00979163,"about_ca_system_score_codex":0.0006898275,"about_ca_system_score_gemma":0.0012912092,"threshold_uncertainty_score":0.03275633},"labels":[],"label_agreement":null},{"id":"W4231974562","doi":"10.1155/2006/183949","title":"A Game Theoretic Approach to Swarm Robotics","year":2006,"lang":"en","type":"article","venue":"Applied Bionics and Biomechanics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Artificial intelligence; Evolutionary robotics; Robot; Swarm robotics; Set (abstract data type); Personality; Reinforcement learning; Process (computing); Computer science; Swarm behaviour; Robotics; Behavior-based robotics; Machine learning; Human–computer interaction; Psychology; Social psychology","score_opus":0.008189348044613621,"score_gpt":0.2005669144531002,"score_spread":0.19237756640848658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231974562","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002729672,0.0027929097,0.94752014,0.0029056931,0.00033231606,0.00011092303,0.000051892384,0.000068977664,0.04348754],"genre_scores_gemma":[0.48349035,0.009813698,0.47191042,0.0018155758,0.0012223488,0.001129324,0.00014030217,0.000094002295,0.030383898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914014,0.00046916428,0.000039134193,0.00008155745,0.00021261022,0.000057342244],"domain_scores_gemma":[0.9994629,0.00033808404,0.000041724325,0.000040623938,0.00005811324,0.00005857925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095967605,0.001389266,0.0009839555,0.0008333486,0.0010584061,0.0019563772,0.0017741523,0.0018632448,0.0039866487],"category_scores_gemma":[0.0017693082,0.0003939301,0.0011537749,0.0007991898,0.003762662,0.002085319,0.0015909617,0.0028433653,0.0006358406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000495316,0.000016886537,0.00004838552,0.00007146901,0.000020455172,0.000067481196,0.00010963687,0.037062258,0.00031548945,0.9558615,0.0011290405,0.005292476],"study_design_scores_gemma":[0.000016832662,0.000041180385,0.000042470336,0.000033613724,0.000010537348,0.00006239479,0.00006505045,0.12740828,0.00012802616,0.8572768,0.014901148,0.000013616368],"about_ca_topic_score_codex":0.0022929364,"about_ca_topic_score_gemma":0.0018579104,"teacher_disagreement_score":0.0039866487,"about_ca_system_score_codex":0.0016066434,"about_ca_system_score_gemma":0.0012108156,"threshold_uncertainty_score":0.013336718},"labels":[],"label_agreement":null},{"id":"W4232518276","doi":"10.32920/ryerson.14662446","title":"Texture classification using gene expression programming","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Artificial intelligence; Image texture; Pattern recognition (psychology); Computer science; Segmentation; Image segmentation; Computer vision; Pixel; Digital image; Image processing; Contextual image classification; Scale-space segmentation; Feature extraction; Texture (cosmology); Digital image processing; Image (mathematics); Feature (linguistics)","score_opus":0.0541649198913891,"score_gpt":0.3010817169562901,"score_spread":0.246916797064901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232518276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086602755,0.00020369627,0.90860456,0.00023199014,0.00004971539,0.00008853029,0.00014025175,0.0010663947,0.003012143],"genre_scores_gemma":[0.4423683,0.00030328013,0.55055726,0.00018615254,0.000038981194,0.00038934514,0.00047897667,0.00029317802,0.0053844783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997917,0.00004129792,0.000009265179,0.00007407992,0.000060549457,0.000023128065],"domain_scores_gemma":[0.99966836,0.0001928148,0.00003423119,0.000022652597,0.00006828759,0.000013684257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050345965,0.00051831064,0.00049506663,0.00061785866,0.0003147547,0.0010105434,0.0007840396,0.0006683879,0.0014696319],"category_scores_gemma":[0.0012238153,0.00025408805,0.0007322437,0.0006477818,0.00064336206,0.0005024277,0.0004768201,0.0008596416,0.00028813357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012204056,0.00017396832,0.0040183747,0.00015490205,0.00007866061,0.00015616565,0.00020731447,0.64645195,0.07383265,0.017034203,0.0016418399,0.25612798],"study_design_scores_gemma":[0.000004324354,0.00002541353,0.00031182406,0.000005698297,0.000008790324,0.000025408151,0.000013528159,0.9865398,0.0076322476,0.0042481595,0.001179096,0.000005811479],"about_ca_topic_score_codex":0.0016090085,"about_ca_topic_score_gemma":0.0010828364,"teacher_disagreement_score":0.0016090085,"about_ca_system_score_codex":0.0007848091,"about_ca_system_score_gemma":0.00033745734,"threshold_uncertainty_score":0.00569427},"labels":[],"label_agreement":null},{"id":"W4232646195","doi":"10.32920/ryerson.14652885.v1","title":"A novel developmental genetic programming methodology for mathematical modeling and neuroevolution","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Neuroevolution; Symbolic regression; Genetic programming; Computer science; Artificial intelligence; Artificial neural network; Pairwise comparison; Representation (politics); Genetic algorithm; Set (abstract data type); Interpretation (philosophy); Theoretical computer science; Machine learning; Programming language","score_opus":0.1301289569377599,"score_gpt":0.3282239170783256,"score_spread":0.1980949601405657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232646195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093726855,0.00005685857,0.9973569,0.00006306648,0.000017034212,0.000013852705,0.00001135366,0.00006735009,0.0014763654],"genre_scores_gemma":[0.052193787,0.00026668498,0.9441717,0.00011033473,0.000026270605,0.00019069605,0.00005584277,0.00010465797,0.0028799658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00013688441,0.000017327284,0.0000706417,0.0001490115,0.000022764558],"domain_scores_gemma":[0.99972206,0.00015797492,0.000026470243,0.000031471565,0.00004460743,0.000017435998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066381594,0.0005343273,0.0003676628,0.0005400669,0.00038618248,0.00072885636,0.0012290176,0.0006531339,0.0022824546],"category_scores_gemma":[0.001448041,0.00028406503,0.0007831622,0.00047893985,0.0010609748,0.0006789096,0.0011253539,0.0018039623,0.00046579924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017868437,0.000032075244,0.0002966123,0.0001479405,0.000033329194,0.0001335597,0.00017782494,0.21505956,0.01478245,0.65520555,0.0018037235,0.11230944],"study_design_scores_gemma":[0.000014897563,0.000057588495,0.00008970194,0.00004127503,0.00001956131,0.00018340023,0.000025637442,0.84044,0.0061202017,0.1206699,0.032316353,0.000021405976],"about_ca_topic_score_codex":0.0009669335,"about_ca_topic_score_gemma":0.0009710061,"teacher_disagreement_score":0.0022824546,"about_ca_system_score_codex":0.00074754946,"about_ca_system_score_gemma":0.00082786655,"threshold_uncertainty_score":0.007635534},"labels":[],"label_agreement":null},{"id":"W4233887172","doi":"10.1007/978-1-4939-7131-2_100359","title":"Evolving Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.017480166612028118,"score_gpt":0.23096192419778314,"score_spread":0.21348175758575502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233887172","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012263356,0.0041606897,0.6347466,0.0015189119,0.0010439891,0.00013231562,0.0006102985,0.0020019964,0.34352186],"genre_scores_gemma":[0.19805719,0.010569674,0.39965045,0.0010309577,0.00053944625,0.00026929952,0.0034046255,0.002293286,0.38418502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997801,0.00003733319,0.000006554575,0.00007170369,0.00008931662,0.000015086302],"domain_scores_gemma":[0.99969757,0.00011484169,0.000012280753,0.00009575281,0.000055821234,0.000023770677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024698407,0.00060122844,0.00033101565,0.00085119565,0.00042377607,0.0011014275,0.0010105906,0.00067901507,0.023368228],"category_scores_gemma":[0.0014819285,0.00030226857,0.0004623168,0.0011089547,0.00052876986,0.0019635062,0.0010961023,0.0014042639,0.006949769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024083687,0.000040323048,0.00021479452,0.00022021988,0.000027540682,0.000096509924,0.00014978202,0.038574006,0.0051312894,0.4086414,0.048533984,0.4983461],"study_design_scores_gemma":[0.000012347065,0.00003680483,0.00036155613,0.00013421434,0.000033147375,0.00043816562,0.00007665155,0.10991911,0.006602285,0.52928257,0.35307854,0.000024619882],"about_ca_topic_score_codex":0.00088793016,"about_ca_topic_score_gemma":0.0011577471,"teacher_disagreement_score":0.023368228,"about_ca_system_score_codex":0.00065057934,"about_ca_system_score_gemma":0.00034961654,"threshold_uncertainty_score":0.07817453},"labels":[],"label_agreement":null},{"id":"W4234407257","doi":"10.32920/ryerson.14645649.v1","title":"On the Evolvability of a Hybrid Ant Colony-Cartesian Genetic Programming Methodology","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Evolvability; Representation (politics); Computer science; Genetic programming; Rank (graph theory); Formicoidea; Ant colony; Ant colony optimization algorithms; Artificial intelligence; Theoretical computer science; Mathematical optimization; Mathematics; Ecology; Biology; Evolutionary biology; Aculeata","score_opus":0.06438474259163568,"score_gpt":0.30902303631426026,"score_spread":0.24463829372262458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234407257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072405025,0.00016980572,0.9240397,0.000115553754,0.000014070496,0.000035827004,0.000006765948,0.00015260617,0.003060664],"genre_scores_gemma":[0.6265648,0.00025774402,0.37097907,0.000053576718,0.00001625595,0.00012678385,0.00002327374,0.00006245792,0.0019160295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00032035197,0.000021656377,0.000081693055,0.00019578428,0.000029780018],"domain_scores_gemma":[0.9986389,0.00092218735,0.00011988511,0.00013916177,0.00014153481,0.000038233848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015858467,0.00038828718,0.0003164879,0.0004535146,0.00026652514,0.000586955,0.00072206324,0.00046125488,0.0006299266],"category_scores_gemma":[0.0041236435,0.00027671666,0.0003680415,0.0003536371,0.0012602324,0.0006378152,0.0008915785,0.00069590594,0.00010743334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072207855,0.00005290019,0.001896029,0.00008317884,0.000048062055,0.00012569445,0.00026271978,0.8242254,0.009560975,0.10020123,0.00021097448,0.06326058],"study_design_scores_gemma":[0.000010922419,0.00008196668,0.00014763362,0.000009057835,0.000011993448,0.00005683603,0.000011275604,0.9809006,0.0013830637,0.01666979,0.00071204815,0.000004858289],"about_ca_topic_score_codex":0.0005981424,"about_ca_topic_score_gemma":0.0004158046,"teacher_disagreement_score":0.0015858467,"about_ca_system_score_codex":0.0003748678,"about_ca_system_score_gemma":0.00041163023,"threshold_uncertainty_score":0.00838685},"labels":[],"label_agreement":null},{"id":"W4234443174","doi":"10.1145/1388969.1389071","title":"An introduction to statistical analysis for evolutionary computation","year":2008,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Citation; Computer science; Evolutionary computation; Library science; Artificial intelligence","score_opus":0.01886113577918248,"score_gpt":0.2895190277285327,"score_spread":0.27065789194935025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234443174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034642956,0.025842603,0.9413392,0.005678736,0.0027555907,0.00018653627,0.0013797395,0.0029651355,0.019505972],"genre_scores_gemma":[0.019330367,0.044576675,0.8754343,0.0061881836,0.012889708,0.0020182661,0.003680668,0.004928625,0.030953234],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99277943,0.0039236303,0.0005841831,0.00072904874,0.0017758367,0.00020789342],"domain_scores_gemma":[0.9770428,0.0180217,0.0005067617,0.0018563666,0.0022507927,0.00032154756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007889065,0.0020669608,0.0018101136,0.0037916482,0.00084416446,0.003501811,0.002387984,0.002930458,0.043937076],"category_scores_gemma":[0.029609365,0.0015027977,0.003352639,0.004888622,0.0026694455,0.004144177,0.0022979742,0.006588077,0.022983095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000520525,0.000097726974,0.00094786694,0.0016975309,0.00028759998,0.00029875094,0.00028591522,0.010094491,0.001492194,0.250245,0.3128132,0.42168766],"study_design_scores_gemma":[0.000027785425,0.000058713464,0.0009311275,0.0005470888,0.000039816725,0.0004725849,0.00005068353,0.018470591,0.0004970154,0.51859546,0.46022806,0.00008106175],"about_ca_topic_score_codex":0.0016587898,"about_ca_topic_score_gemma":0.0018814926,"teacher_disagreement_score":0.043937076,"about_ca_system_score_codex":0.0015351094,"about_ca_system_score_gemma":0.0026293772,"threshold_uncertainty_score":0.14698422},"labels":[],"label_agreement":null},{"id":"W4234818670","doi":"10.1002/0470871822.part2","title":"Part Introduction","year":2006,"lang":"en","type":"other","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Library science; Citation; Engineering; Computer science; Art history; History","score_opus":0.0069765364591289035,"score_gpt":0.21423423406044342,"score_spread":0.20725769760131452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234818670","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008586104,0.005628263,0.011250259,0.0021246362,0.013413256,0.00025412458,0.0042287624,0.0017693859,0.9604727],"genre_scores_gemma":[0.0016518136,0.0024322914,0.0017074493,0.00052718807,0.0017870738,0.00008425152,0.0025199666,0.0004987598,0.98879135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994411,0.00005926406,0.00002458357,0.00012382073,0.00029069374,0.000060571652],"domain_scores_gemma":[0.99902475,0.00014609336,0.00004715522,0.0001816901,0.0003979676,0.00020229447],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00066632975,0.0015218026,0.000901912,0.003256719,0.00091459835,0.003822177,0.0012930218,0.0013977227,0.55655223],"category_scores_gemma":[0.0020184796,0.0004374224,0.00068684336,0.0030323162,0.0005603213,0.0022042547,0.0015937559,0.0014005837,0.4701157],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030628325,0.000061857994,0.00012565748,0.00017400084,0.0000055110036,0.000028519102,0.000021413503,0.000375885,0.0006697326,0.009179647,0.82061476,0.16871232],"study_design_scores_gemma":[0.0000040698405,0.000019168225,0.00032588674,0.00008487572,0.000004198206,0.000051811003,0.000014712228,0.00024484302,0.00026206396,0.002834145,0.9961494,0.0000048463758],"about_ca_topic_score_codex":0.0017904447,"about_ca_topic_score_gemma":0.0042426386,"teacher_disagreement_score":0.44344777,"about_ca_system_score_codex":0.0011904496,"about_ca_system_score_gemma":0.0013153465,"threshold_uncertainty_score":0.6325244},"labels":[],"label_agreement":null},{"id":"W4237268483","doi":"10.1109/tevc.2015.2415203","title":"IEEE Transactions on Evolutionary Computation publication information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Dalhousie University","funders":"","keywords":"Computer science; Evolutionary computation; Evolutionary algorithm; Computation; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.024158947341346736,"score_gpt":0.25668197319355296,"score_spread":0.23252302585220622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237268483","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076199076,0.018011406,0.24310157,0.010827269,0.053040344,0.00048082293,0.018881187,0.006512654,0.64152485],"genre_scores_gemma":[0.04352973,0.02015076,0.049595915,0.0014229683,0.0051925476,0.00028286327,0.026486909,0.0027593167,0.8505791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941206,0.000051783525,0.000041731313,0.000059961254,0.000387258,0.000047253645],"domain_scores_gemma":[0.9984059,0.00033099612,0.00005298383,0.00034271087,0.00073174015,0.0001357592],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00092971843,0.0007619467,0.0013063642,0.002083284,0.00056163775,0.0026309805,0.001084356,0.0017847695,0.37714356],"category_scores_gemma":[0.0035216308,0.0003855952,0.0005332411,0.002470802,0.00032039997,0.0023338234,0.0011494095,0.0013614558,0.1550484],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010440007,0.000099995974,0.00042516002,0.0004725537,0.000020080284,0.00016373825,0.00002246238,0.003554897,0.0025109025,0.017686669,0.54067403,0.43426523],"study_design_scores_gemma":[0.000041442403,0.000066866,0.001092489,0.0002646552,0.000038789745,0.0004954605,0.000031901127,0.017252658,0.0036241945,0.03159837,0.945449,0.000044203145],"about_ca_topic_score_codex":0.00065964326,"about_ca_topic_score_gemma":0.0009380901,"teacher_disagreement_score":0.62285644,"about_ca_system_score_codex":0.0003600976,"about_ca_system_score_gemma":0.0010607996,"threshold_uncertainty_score":0.8884291},"labels":[],"label_agreement":null},{"id":"W4239091323","doi":"10.1002/0470871822.part1","title":"Part Introduction","year":2006,"lang":"en","type":"other","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Library science; Citation; Engineering; Computer science","score_opus":0.0069765364591289035,"score_gpt":0.21423423406044342,"score_spread":0.20725769760131452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239091323","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008586104,0.005628263,0.011250259,0.0021246362,0.013413256,0.00025412458,0.0042287624,0.0017693859,0.9604727],"genre_scores_gemma":[0.0016518136,0.0024322914,0.0017074493,0.00052718807,0.0017870738,0.00008425152,0.0025199666,0.0004987598,0.98879135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994411,0.00005926406,0.00002458357,0.00012382073,0.00029069374,0.000060571652],"domain_scores_gemma":[0.99902475,0.00014609336,0.00004715522,0.0001816901,0.0003979676,0.00020229447],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066632975,0.0015218026,0.000901912,0.003256719,0.00091459835,0.003822177,0.0012930218,0.0013977227,0.55655223],"category_scores_gemma":[0.0020184796,0.0004374224,0.00068684336,0.0030323162,0.0005603213,0.0022042547,0.0015937559,0.0014005837,0.4701157],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030628325,0.000061857994,0.00012565748,0.00017400084,0.0000055110036,0.000028519102,0.000021413503,0.000375885,0.0006697326,0.009179647,0.82061476,0.16871232],"study_design_scores_gemma":[0.0000040698405,0.000019168225,0.00032588674,0.00008487572,0.000004198206,0.000051811003,0.000014712228,0.00024484302,0.00026206396,0.002834145,0.9961494,0.0000048463758],"about_ca_topic_score_codex":0.0017904447,"about_ca_topic_score_gemma":0.0042426386,"teacher_disagreement_score":0.55655223,"about_ca_system_score_codex":0.0011904496,"about_ca_system_score_gemma":0.0013153465,"threshold_uncertainty_score":0.6325244},"labels":[],"label_agreement":null},{"id":"W4239486805","doi":"10.32920/ryerson.14652885","title":"A novel developmental genetic programming methodology for mathematical modeling and neuroevolution","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Neuroevolution; Symbolic regression; Genetic programming; Computer science; Artificial intelligence; Artificial neural network; Pairwise comparison; Representation (politics); Set (abstract data type); Genetic algorithm; Interpretation (philosophy); Theoretical computer science; Machine learning; Programming language","score_opus":0.1301289569377599,"score_gpt":0.3282239170783256,"score_spread":0.1980949601405657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239486805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093726855,0.00005685857,0.9973569,0.00006306648,0.000017034212,0.000013852705,0.00001135366,0.00006735009,0.0014763654],"genre_scores_gemma":[0.052193787,0.00026668498,0.9441717,0.00011033473,0.000026270605,0.00019069605,0.00005584277,0.00010465797,0.0028799658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00013688441,0.000017327284,0.0000706417,0.0001490115,0.000022764558],"domain_scores_gemma":[0.99972206,0.00015797492,0.000026470243,0.000031471565,0.00004460743,0.000017435998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066381594,0.0005343273,0.0003676628,0.0005400669,0.00038618248,0.00072885636,0.0012290176,0.0006531339,0.0022824546],"category_scores_gemma":[0.001448041,0.00028406503,0.0007831622,0.00047893985,0.0010609748,0.0006789096,0.0011253539,0.0018039623,0.00046579924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017868437,0.000032075244,0.0002966123,0.0001479405,0.000033329194,0.0001335597,0.00017782494,0.21505956,0.01478245,0.65520555,0.0018037235,0.11230944],"study_design_scores_gemma":[0.000014897563,0.000057588495,0.00008970194,0.00004127503,0.00001956131,0.00018340023,0.000025637442,0.84044,0.0061202017,0.1206699,0.032316353,0.000021405976],"about_ca_topic_score_codex":0.0009669335,"about_ca_topic_score_gemma":0.0009710061,"teacher_disagreement_score":0.0022824546,"about_ca_system_score_codex":0.00074754946,"about_ca_system_score_gemma":0.00082786655,"threshold_uncertainty_score":0.007635534},"labels":[],"label_agreement":null},{"id":"W4240179485","doi":"10.1007/978-1-4615-0377-4_6","title":"Genetic Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"TRIUMF","funders":"","keywords":"Simulated annealing; Computer science; Genetic algorithm; Algorithm; Theoretical computer science; Machine learning","score_opus":0.013758157240657971,"score_gpt":0.21743094720136755,"score_spread":0.2036727899607096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240179485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030602512,0.0064620273,0.5922792,0.0009828905,0.00094805734,0.00016723748,0.00032474322,0.0021958365,0.39357987],"genre_scores_gemma":[0.073016115,0.010267374,0.45050701,0.0011602617,0.0003896815,0.00036932886,0.0012862176,0.0009230717,0.46208093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997831,0.00003858243,0.000006883531,0.000044465396,0.000114243056,0.000012630999],"domain_scores_gemma":[0.99987066,0.00004046474,0.0000057691486,0.000034616212,0.00004174437,0.0000068568565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022478683,0.0007020754,0.0005549994,0.0007396987,0.00044406464,0.0013237591,0.0010524392,0.0012015216,0.026266068],"category_scores_gemma":[0.0008095553,0.00023461539,0.00036715806,0.0011382607,0.0005236459,0.0009247552,0.00072047504,0.0009973862,0.013150917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022770584,0.000055169254,0.0001820741,0.00023781636,0.000035440804,0.000085815635,0.0000794026,0.033751708,0.0032382205,0.19576222,0.07547847,0.69107085],"study_design_scores_gemma":[0.0000282659,0.0000654561,0.00035085095,0.00027157334,0.000045261964,0.00049356895,0.00005783233,0.099003725,0.0060654143,0.18930246,0.70427716,0.000038338123],"about_ca_topic_score_codex":0.0011477759,"about_ca_topic_score_gemma":0.0013700814,"teacher_disagreement_score":0.026266068,"about_ca_system_score_codex":0.00051740144,"about_ca_system_score_gemma":0.0007375881,"threshold_uncertainty_score":0.08786875},"labels":[],"label_agreement":null},{"id":"W4240996730","doi":"10.32920/ryerson.14646798.v1","title":"Indirect Estimation Of Distribution Algorithms For The Evolution Of Tree-Shaped Structures","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gene expression programming; Estimation of distribution algorithm; Algorithm; Tree (set theory); Computer science; Sampling distribution; Population; Sampling (signal processing); Mathematics; Distribution (mathematics); Probabilistic logic; Statistics; Machine learning; Filter (signal processing)","score_opus":0.022581532623731457,"score_gpt":0.28123412853360324,"score_spread":0.2586525959098718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240996730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015047589,0.00009793781,0.9836917,0.000050609688,0.00000944075,0.00003546396,0.000014220414,0.0003154713,0.0007376266],"genre_scores_gemma":[0.3374812,0.00026287264,0.6592243,0.00010400943,0.00002985581,0.00035792225,0.00020730919,0.00033423307,0.0019982615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987729,0.0005417801,0.000051065083,0.000235794,0.0003171473,0.000081273625],"domain_scores_gemma":[0.9926016,0.0059447926,0.0003866989,0.0005263405,0.00043285266,0.000107774016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025454524,0.00079052255,0.0007829499,0.0010091441,0.00035323162,0.0009305559,0.0014858992,0.00087118463,0.0016944548],"category_scores_gemma":[0.015396819,0.00049634126,0.0007277268,0.0007037702,0.0010893102,0.0019301635,0.0016674576,0.001709582,0.0003495339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106783016,0.00011268321,0.005770505,0.00013592395,0.0000743691,0.000061355364,0.00023758858,0.66642565,0.0048852237,0.06050374,0.0007297719,0.26095653],"study_design_scores_gemma":[0.000014038867,0.00003954567,0.00027220132,0.000009338453,0.000007982638,0.000030107549,0.000013258867,0.9843768,0.0015234565,0.013041618,0.00066522235,0.000006379073],"about_ca_topic_score_codex":0.001206403,"about_ca_topic_score_gemma":0.0016107714,"teacher_disagreement_score":0.0025454524,"about_ca_system_score_codex":0.00094518764,"about_ca_system_score_gemma":0.001008235,"threshold_uncertainty_score":0.013461769},"labels":[],"label_agreement":null},{"id":"W4241234484","doi":"10.1109/tevc.2015.2432412","title":"IEEE Transactions on Evolutionary Computation publication information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Dalhousie University","funders":"","keywords":"Computer science; Evolutionary computation; Computation; Evolutionary algorithm; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.024158947341346736,"score_gpt":0.25668197319355296,"score_spread":0.23252302585220622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241234484","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076199076,0.018011406,0.24310157,0.010827269,0.053040344,0.00048082293,0.018881187,0.006512654,0.64152485],"genre_scores_gemma":[0.04352973,0.02015076,0.049595915,0.0014229683,0.0051925476,0.00028286327,0.026486909,0.0027593167,0.8505791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941206,0.000051783525,0.000041731313,0.000059961254,0.000387258,0.000047253645],"domain_scores_gemma":[0.9984059,0.00033099612,0.00005298383,0.00034271087,0.00073174015,0.0001357592],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00092971843,0.0007619467,0.0013063642,0.002083284,0.00056163775,0.0026309805,0.001084356,0.0017847695,0.37714356],"category_scores_gemma":[0.0035216308,0.0003855952,0.0005332411,0.002470802,0.00032039997,0.0023338234,0.0011494095,0.0013614558,0.1550484],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010440007,0.000099995974,0.00042516002,0.0004725537,0.000020080284,0.00016373825,0.00002246238,0.003554897,0.0025109025,0.017686669,0.54067403,0.43426523],"study_design_scores_gemma":[0.000041442403,0.000066866,0.001092489,0.0002646552,0.000038789745,0.0004954605,0.000031901127,0.017252658,0.0036241945,0.03159837,0.945449,0.000044203145],"about_ca_topic_score_codex":0.00065964326,"about_ca_topic_score_gemma":0.0009380901,"teacher_disagreement_score":0.62285644,"about_ca_system_score_codex":0.0003600976,"about_ca_system_score_gemma":0.0010607996,"threshold_uncertainty_score":0.8884291},"labels":[],"label_agreement":null},{"id":"W4241360849","doi":"10.3765/salt.v0i0.2478","title":"Classifiers and Number Marking","year":2015,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Natural language processing; Mathematics","score_opus":0.01844661278574656,"score_gpt":0.24456928804325934,"score_spread":0.22612267525751278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241360849","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012365746,0.10989392,0.22736542,0.07151385,0.09914077,0.00025153067,0.005468825,0.0028347995,0.47116518],"genre_scores_gemma":[0.2542235,0.06470047,0.07254125,0.014707555,0.047805265,0.00076690404,0.014169606,0.0013485552,0.52973694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985374,0.00031142173,0.00009319852,0.0005610869,0.00038114144,0.00011572921],"domain_scores_gemma":[0.9956862,0.002186135,0.00022647265,0.0006828122,0.0009240581,0.00029436083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001903733,0.001155472,0.0015346586,0.0015228014,0.0015257958,0.0035372793,0.0022198544,0.0020912017,0.100790046],"category_scores_gemma":[0.011704477,0.0005057566,0.0011903045,0.002370589,0.0016681802,0.0076421592,0.002187685,0.002814043,0.053026773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046779265,0.00019645705,0.0009230911,0.0019117118,0.000161492,0.00027420238,0.00024478638,0.0018917989,0.0021382263,0.3412568,0.33949286,0.31104085],"study_design_scores_gemma":[0.000053195046,0.00012200169,0.0012934962,0.00059081096,0.00012888502,0.0003569217,0.00016346507,0.0038796042,0.00298175,0.49138024,0.49898034,0.00006931718],"about_ca_topic_score_codex":0.0011037887,"about_ca_topic_score_gemma":0.0013297885,"teacher_disagreement_score":0.100790046,"about_ca_system_score_codex":0.0017670963,"about_ca_system_score_gemma":0.0012555616,"threshold_uncertainty_score":0.33717632},"labels":[],"label_agreement":null},{"id":"W4241477819","doi":"10.1109/tevc.2021.3079536","title":"IEEE Transactions on Evolutionary Computation Society Information","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Southern University of Science and Technology; Universidad de Granada; Inyuvesi Yakwazulu-Natali; Swinburne University of Technology; University of Warwick; Universidad del Atlántico; Università degli Studi di Milano-Bicocca; Università degli Studi di Milano; St. Francis Xavier University; University of Essex; Florida Atlantic University","keywords":"Evolutionary computation; Computer science; Computation; Evolutionary algorithm; Human-based evolutionary computation; Interactive evolutionary computation; Artificial intelligence; Theoretical computer science; Evolutionary programming; Algorithm","score_opus":0.014148062668026515,"score_gpt":0.24466855154596032,"score_spread":0.2305204888779338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241477819","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02234231,0.016649323,0.68552977,0.011828262,0.012799933,0.00024302004,0.0020343803,0.0020833095,0.24648966],"genre_scores_gemma":[0.32401824,0.01870092,0.20629823,0.0019536163,0.0019344151,0.00033629665,0.005250936,0.0006641224,0.4408433],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947876,0.00008987868,0.000035652836,0.00006300675,0.00029143892,0.0000413035],"domain_scores_gemma":[0.9987049,0.00034045937,0.000048571892,0.00035840468,0.0004874668,0.00006023382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009181761,0.0004014378,0.0006624613,0.0013134086,0.00046375702,0.0021873666,0.0006164241,0.0011290573,0.040456228],"category_scores_gemma":[0.003682394,0.00020588447,0.00040931217,0.0015389763,0.0005012125,0.0015908101,0.0011103151,0.0010353669,0.0067809084],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001125932,0.00009242676,0.0012566964,0.00028878418,0.00007889727,0.00026535455,0.000081122285,0.016832566,0.004342056,0.113235384,0.09969338,0.7637207],"study_design_scores_gemma":[0.000051331346,0.00013057339,0.0031565782,0.00026604524,0.000111919275,0.0008409619,0.000112062495,0.13523646,0.009425362,0.20792055,0.6426905,0.000057708654],"about_ca_topic_score_codex":0.0014119914,"about_ca_topic_score_gemma":0.0014606911,"teacher_disagreement_score":0.040456228,"about_ca_system_score_codex":0.00050259486,"about_ca_system_score_gemma":0.001025822,"threshold_uncertainty_score":0.13533962},"labels":[],"label_agreement":null},{"id":"W4244080053","doi":"10.1007/978-1-4939-7131-2_100361","title":"Evolving Networks or Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.02050179703952979,"score_gpt":0.23709873838588766,"score_spread":0.21659694134635787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244080053","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026834877,0.029322986,0.17596565,0.00305757,0.00413621,0.000068765745,0.00038720795,0.0007468585,0.7836313],"genre_scores_gemma":[0.039756685,0.034234945,0.065459326,0.0017450012,0.001953282,0.00015553068,0.00086753216,0.0008707179,0.854957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984777,0.000025671035,0.0000048405177,0.000043535794,0.00006709024,0.00001100053],"domain_scores_gemma":[0.999866,0.000061540755,0.000007987777,0.000029030121,0.00002265232,0.0000127447865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017782887,0.0008125772,0.00037940717,0.000846694,0.0003792768,0.0016359229,0.0008094674,0.00088980823,0.039965462],"category_scores_gemma":[0.0009989557,0.00027937043,0.00030264547,0.0012584062,0.000959176,0.0032001187,0.0009718936,0.0013625362,0.012806207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010627803,0.000018128589,0.000077087105,0.00028368406,0.0000132800305,0.000053726144,0.00013826975,0.0053010206,0.0012150733,0.57961226,0.11632355,0.29695323],"study_design_scores_gemma":[0.0000035657781,0.000010728716,0.00009499919,0.00013307907,0.000007813202,0.00015379267,0.000044642275,0.0052125803,0.0006336478,0.32054403,0.673152,0.000009060854],"about_ca_topic_score_codex":0.0005386624,"about_ca_topic_score_gemma":0.001008125,"teacher_disagreement_score":0.039965462,"about_ca_system_score_codex":0.00060040166,"about_ca_system_score_gemma":0.00034148054,"threshold_uncertainty_score":0.13369775},"labels":[],"label_agreement":null},{"id":"W4246177449","doi":"10.1109/ijcnn.2006.1716100","title":"Opposition-Based Q(λ) Algorithm","year":2006,"lang":"en","type":"article","venue":"The 2006 IEEE International Joint Conference on Neural Network Proceedings","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Opposition (politics); Reinforcement learning; Computer science; Lambda; Reinforcement; Artificial intelligence; Algorithm; Theoretical computer science; Engineering; Political science; Law; Physics; Structural engineering","score_opus":0.030114229558463834,"score_gpt":0.25399593957540195,"score_spread":0.22388171001693813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246177449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010568964,0.00010597527,0.98571014,0.00014415741,0.00004718171,0.00008988825,0.0000253614,0.0003358576,0.0029724902],"genre_scores_gemma":[0.45401198,0.00014718814,0.53587294,0.00046695484,0.00006481749,0.0005103963,0.00016880836,0.00014815536,0.008608689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991517,0.00032616174,0.000040868374,0.00013054976,0.00023177902,0.00011888278],"domain_scores_gemma":[0.9985474,0.00084930146,0.000076836724,0.00009841448,0.00032082517,0.00010729064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001871091,0.0005838658,0.0010890882,0.00068622536,0.00052236,0.00069791405,0.0019828225,0.0013163792,0.0062958626],"category_scores_gemma":[0.003580891,0.00030732967,0.00044916,0.00062306464,0.00084086135,0.00097222475,0.0016494619,0.001268632,0.0010723528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049883017,0.00038063858,0.0010977353,0.00020201456,0.000103006496,0.00012361215,0.00018401268,0.41725782,0.005851138,0.082453065,0.006318087,0.48553002],"study_design_scores_gemma":[0.00010259077,0.00013316162,0.000113373455,0.00000803052,0.000013162687,0.000041562438,0.000013389262,0.9798117,0.0010358979,0.016944276,0.0017739049,0.000009066006],"about_ca_topic_score_codex":0.0016382999,"about_ca_topic_score_gemma":0.0015760649,"teacher_disagreement_score":0.0062958626,"about_ca_system_score_codex":0.00076675153,"about_ca_system_score_gemma":0.0015773477,"threshold_uncertainty_score":0.021061778},"labels":[],"label_agreement":null},{"id":"W4246584857","doi":"10.1109/ijcnn.2006.1716072","title":"Aggregation of Reinforcement Learning Algorithms","year":2006,"lang":"en","type":"article","venue":"The 2006 IEEE International Joint Conference on Neural Network Proceedings","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Learning classifier system; Instance-based learning; Machine learning; Robustness (evolution); Robot learning; Algorithm; Online machine learning; Unsupervised learning; Computational learning theory; Proactive learning; Robot; Mobile robot","score_opus":0.031508803972247715,"score_gpt":0.25756897615265123,"score_spread":0.22606017218040353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246584857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027975371,0.0005272459,0.96624726,0.00016038373,0.000105065126,0.000117422984,0.000025605514,0.00093570864,0.0039059538],"genre_scores_gemma":[0.83275944,0.00034138846,0.16332446,0.00013516759,0.00009261077,0.00024338033,0.00008178712,0.00007766206,0.0029441174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998396,0.00050533423,0.00013173472,0.0003341451,0.00045544302,0.00017730038],"domain_scores_gemma":[0.9969975,0.0014110712,0.0003171483,0.0004692752,0.00064163486,0.00016345804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002471974,0.0010501991,0.0016251776,0.0007534099,0.00048212465,0.0011440052,0.0013408253,0.0008166509,0.0024622993],"category_scores_gemma":[0.0062980913,0.00040463769,0.00070651027,0.0005961248,0.0007344641,0.0012915086,0.0017248925,0.0013117404,0.00047935822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016114254,0.00014532686,0.0017186578,0.00013795798,0.0001647179,0.00011329579,0.00012689858,0.78275454,0.002927013,0.014620665,0.0015266886,0.19560316],"study_design_scores_gemma":[0.000023719436,0.00008040322,0.00016161811,0.000009753989,0.00001921604,0.000032317766,0.000009357356,0.9908336,0.00084983686,0.0068590688,0.0011139798,0.0000071741447],"about_ca_topic_score_codex":0.0018686933,"about_ca_topic_score_gemma":0.0013901037,"teacher_disagreement_score":0.002471974,"about_ca_system_score_codex":0.00079068873,"about_ca_system_score_gemma":0.00083169626,"threshold_uncertainty_score":0.013073146},"labels":[],"label_agreement":null},{"id":"W4247167517","doi":"10.1109/ahs.2015.7231148","title":"Preface","year":2015,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.03523017411762691,"score_gpt":0.26367665345040087,"score_spread":0.22844647933277396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247167517","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011996482,0.012751855,0.008403084,0.03661969,0.27424577,0.0007720967,0.019585975,0.0026969905,0.6437249],"genre_scores_gemma":[0.005660544,0.009518359,0.0036492667,0.0067301737,0.04638889,0.0004245226,0.017332006,0.0014860556,0.9088102],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869555,0.00015094383,0.00010485629,0.00020280568,0.00075010955,0.00009565118],"domain_scores_gemma":[0.9912777,0.0013130152,0.00035007574,0.00070582324,0.0051897885,0.0011636675],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001675282,0.0009007114,0.0007550195,0.0037057523,0.0019786665,0.005617588,0.0014636703,0.0013106845,0.49083972],"category_scores_gemma":[0.015557744,0.00029636596,0.0005804609,0.0028653163,0.00056078983,0.0035297994,0.0019631633,0.0027811313,0.36623058],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016136128,0.000013361,0.000043237695,0.00010049069,0.0000015776706,0.000023487066,0.000046072793,0.000043064156,0.00008462003,0.0021248544,0.9655235,0.031979624],"study_design_scores_gemma":[0.0000029904566,0.000009981087,0.00014238677,0.00010906661,0.000001376692,0.000032226475,0.00003923905,0.00001879886,0.00004693523,0.00095622404,0.9986369,0.0000038038918],"about_ca_topic_score_codex":0.0029504688,"about_ca_topic_score_gemma":0.00319875,"teacher_disagreement_score":0.5091603,"about_ca_system_score_codex":0.0017074521,"about_ca_system_score_gemma":0.0021001326,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4247884300","doi":"10.1109/tevc.2015.2455356","title":"IEEE Transactions on Evolutionary Computation publication information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Dalhousie University","funders":"","keywords":"Evolutionary computation; Computer science; Computation; Evolutionary algorithm; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.024158947341346736,"score_gpt":0.25668197319355296,"score_spread":0.23252302585220622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247884300","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076199076,0.018011406,0.24310157,0.010827269,0.053040344,0.00048082293,0.018881187,0.006512654,0.64152485],"genre_scores_gemma":[0.04352973,0.02015076,0.049595915,0.0014229683,0.0051925476,0.00028286327,0.026486909,0.0027593167,0.8505791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941206,0.000051783525,0.000041731313,0.000059961254,0.000387258,0.000047253645],"domain_scores_gemma":[0.9984059,0.00033099612,0.00005298383,0.00034271087,0.00073174015,0.0001357592],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092971843,0.0007619467,0.0013063642,0.002083284,0.00056163775,0.0026309805,0.001084356,0.0017847695,0.37714356],"category_scores_gemma":[0.0035216308,0.0003855952,0.0005332411,0.002470802,0.00032039997,0.0023338234,0.0011494095,0.0013614558,0.1550484],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010440007,0.000099995974,0.00042516002,0.0004725537,0.000020080284,0.00016373825,0.00002246238,0.003554897,0.0025109025,0.017686669,0.54067403,0.43426523],"study_design_scores_gemma":[0.000041442403,0.000066866,0.001092489,0.0002646552,0.000038789745,0.0004954605,0.000031901127,0.017252658,0.0036241945,0.03159837,0.945449,0.000044203145],"about_ca_topic_score_codex":0.00065964326,"about_ca_topic_score_gemma":0.0009380901,"teacher_disagreement_score":0.37714356,"about_ca_system_score_codex":0.0003600976,"about_ca_system_score_gemma":0.0010607996,"threshold_uncertainty_score":0.8884291},"labels":[],"label_agreement":null},{"id":"W4248338987","doi":"10.1093/obo/9780199941728-0122","title":"Evolutionary Computation","year":2019,"lang":"en","type":"reference-entry","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Evolutionary computation; Benchmark (surveying); Evolutionary algorithm; Heuristic; Selection (genetic algorithm); Computation; Interactive evolutionary computation; Evolution strategy; Evolutionary programming; Artificial intelligence; Machine learning; Theoretical computer science; Algorithm","score_opus":0.022525941804213825,"score_gpt":0.266930267438085,"score_spread":0.24440432563387118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248338987","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009450786,0.012308205,0.7217032,0.0049767885,0.002145542,0.00038443593,0.0018955183,0.0025546972,0.24458086],"genre_scores_gemma":[0.37591052,0.019923596,0.45401534,0.003433571,0.0011405422,0.001013533,0.0063411426,0.0013586966,0.13686308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989429,0.00030108725,0.00007803582,0.00029346507,0.00030406483,0.00008048415],"domain_scores_gemma":[0.9988115,0.0004818386,0.000064560285,0.00031507306,0.00026308198,0.000063988446],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009867332,0.000998774,0.0010227549,0.0014085344,0.0010980462,0.0039181327,0.0015830819,0.0019639116,0.029849635],"category_scores_gemma":[0.0047763735,0.00042813516,0.0011442003,0.0013517431,0.0014843541,0.002393404,0.0024689785,0.0015735765,0.00985014],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057803147,0.000050791732,0.0017598242,0.0006585302,0.0001781906,0.0002901569,0.00018509093,0.07571903,0.0019297113,0.5818489,0.05123251,0.28608948],"study_design_scores_gemma":[0.0000419897,0.00006125434,0.00059876795,0.00026727506,0.00006297453,0.00048766428,0.00012244741,0.11030669,0.0014095862,0.55487347,0.33171618,0.000051724815],"about_ca_topic_score_codex":0.0013099051,"about_ca_topic_score_gemma":0.0011324239,"teacher_disagreement_score":0.97015035,"about_ca_system_score_codex":0.0010962167,"about_ca_system_score_gemma":0.0012703944,"threshold_uncertainty_score":0.09985703},"labels":[],"label_agreement":null},{"id":"W4248503900","doi":"10.1007/978-0-387-39940-9_2601","title":"Evolutionary Computation","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.015446435704062695,"score_gpt":0.24117460025809984,"score_spread":0.22572816455403713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248503900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068017873,0.009567851,0.64082587,0.0011837806,0.0009785438,0.0001024821,0.00052059354,0.0014830373,0.33853608],"genre_scores_gemma":[0.2205382,0.011875377,0.40266126,0.0007951685,0.0005492544,0.0003214748,0.002125053,0.0009090424,0.36022523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998542,0.000026641612,0.0000068802137,0.00004247171,0.000058125126,0.000011634596],"domain_scores_gemma":[0.9998467,0.00005199289,0.000006420225,0.000046736535,0.00003747787,0.000010675122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024687813,0.00050623337,0.00056013657,0.0006950281,0.00046666543,0.0017070661,0.0009026733,0.0007847905,0.029171553],"category_scores_gemma":[0.00090970186,0.0002924747,0.0004523206,0.0008227324,0.000608195,0.00093137287,0.0008310652,0.0009445574,0.007863932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002742562,0.00004059201,0.0005628754,0.00026689577,0.00007298414,0.000117078205,0.000121329445,0.035476994,0.0040110573,0.4557316,0.049942985,0.4536281],"study_design_scores_gemma":[0.000031182713,0.00005537823,0.0008983101,0.0001629728,0.00005120892,0.0005693617,0.00006283793,0.12816292,0.004105504,0.48022914,0.38562816,0.00004303563],"about_ca_topic_score_codex":0.00062198384,"about_ca_topic_score_gemma":0.0009581626,"teacher_disagreement_score":0.029171553,"about_ca_system_score_codex":0.00042674656,"about_ca_system_score_gemma":0.00033832114,"threshold_uncertainty_score":0.0975886},"labels":[],"label_agreement":null},{"id":"W4249884558","doi":"10.32920/ryerson.14645649","title":"On the Evolvability of a Hybrid Ant Colony-Cartesian Genetic Programming Methodology","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Evolvability; Representation (politics); Computer science; Rank (graph theory); Genetic programming; Formicoidea; Ant colony; Artificial intelligence; Theoretical computer science; Ant colony optimization algorithms; Mathematical optimization; Mathematics; Biology; Ecology; Evolutionary biology; Aculeata","score_opus":0.06438474259163568,"score_gpt":0.30902303631426026,"score_spread":0.24463829372262458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249884558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072405025,0.00016980572,0.9240397,0.000115553754,0.000014070496,0.000035827004,0.000006765948,0.00015260617,0.003060664],"genre_scores_gemma":[0.6265648,0.00025774402,0.37097907,0.000053576718,0.00001625595,0.00012678385,0.00002327374,0.00006245792,0.0019160295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00032035197,0.000021656377,0.000081693055,0.00019578428,0.000029780018],"domain_scores_gemma":[0.9986389,0.00092218735,0.00011988511,0.00013916177,0.00014153481,0.000038233848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015858467,0.00038828718,0.0003164879,0.0004535146,0.00026652514,0.000586955,0.00072206324,0.00046125488,0.0006299266],"category_scores_gemma":[0.0041236435,0.00027671666,0.0003680415,0.0003536371,0.0012602324,0.0006378152,0.0008915785,0.00069590594,0.00010743334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072207855,0.00005290019,0.001896029,0.00008317884,0.000048062055,0.00012569445,0.00026271978,0.8242254,0.009560975,0.10020123,0.00021097448,0.06326058],"study_design_scores_gemma":[0.000010922419,0.00008196668,0.00014763362,0.000009057835,0.000011993448,0.00005683603,0.000011275604,0.9809006,0.0013830637,0.01666979,0.00071204815,0.000004858289],"about_ca_topic_score_codex":0.0005981424,"about_ca_topic_score_gemma":0.0004158046,"teacher_disagreement_score":0.0015858467,"about_ca_system_score_codex":0.0003748678,"about_ca_system_score_gemma":0.00041163023,"threshold_uncertainty_score":0.00838685},"labels":[],"label_agreement":null},{"id":"W4251062538","doi":"10.1109/tevc.2015.2480234","title":"IEEE Transactions on Evolutionary Computation publication information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Dalhousie University","funders":"","keywords":"Computer science; Evolutionary computation; Computation; Evolutionary algorithm; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.024158947341346736,"score_gpt":0.25668197319355296,"score_spread":0.23252302585220622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251062538","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076199076,0.018011406,0.24310157,0.010827269,0.053040344,0.00048082293,0.018881187,0.006512654,0.64152485],"genre_scores_gemma":[0.04352973,0.02015076,0.049595915,0.0014229683,0.0051925476,0.00028286327,0.026486909,0.0027593167,0.8505791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941206,0.000051783525,0.000041731313,0.000059961254,0.000387258,0.000047253645],"domain_scores_gemma":[0.9984059,0.00033099612,0.00005298383,0.00034271087,0.00073174015,0.0001357592],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092971843,0.0007619467,0.0013063642,0.002083284,0.00056163775,0.0026309805,0.001084356,0.0017847695,0.37714356],"category_scores_gemma":[0.0035216308,0.0003855952,0.0005332411,0.002470802,0.00032039997,0.0023338234,0.0011494095,0.0013614558,0.1550484],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010440007,0.000099995974,0.00042516002,0.0004725537,0.000020080284,0.00016373825,0.00002246238,0.003554897,0.0025109025,0.017686669,0.54067403,0.43426523],"study_design_scores_gemma":[0.000041442403,0.000066866,0.001092489,0.0002646552,0.000038789745,0.0004954605,0.000031901127,0.017252658,0.0036241945,0.03159837,0.945449,0.000044203145],"about_ca_topic_score_codex":0.00065964326,"about_ca_topic_score_gemma":0.0009380901,"teacher_disagreement_score":0.37714356,"about_ca_system_score_codex":0.0003600976,"about_ca_system_score_gemma":0.0010607996,"threshold_uncertainty_score":0.8884291},"labels":[],"label_agreement":null},{"id":"W4251507379","doi":"10.32920/ryerson.14643771.v1","title":"Adaptive representations for improving evolvability, parameter tuning, and parallelization of gene expression programming","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gene expression programming; Evolvability; Computer science; Genetic programming; Population; Transposition (logic); Symbolic regression; Tree (set theory); Representation (politics); Encoding (memory); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Biology; Genetics","score_opus":0.036910055541007535,"score_gpt":0.29822233896101363,"score_spread":0.2613122834200061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251507379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084068455,0.0001946052,0.911966,0.00017010489,0.0000355567,0.00005119071,0.00003238574,0.0011089069,0.002372704],"genre_scores_gemma":[0.5523312,0.00017403862,0.44511893,0.000092647606,0.000031007145,0.0001910264,0.00010726155,0.00033200748,0.0016218207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.00019371306,0.000032432374,0.000117673786,0.00015943371,0.0000612548],"domain_scores_gemma":[0.9986228,0.00074223784,0.00013309857,0.00030902872,0.00015155939,0.000041332565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980948,0.0006168913,0.0004809778,0.00056311174,0.00027301224,0.0008532648,0.0011686884,0.000800275,0.0012046334],"category_scores_gemma":[0.0051777503,0.0002812988,0.0004445742,0.0006625275,0.0007415751,0.0011247509,0.0011750114,0.0013609378,0.0002839521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015589611,0.00016278127,0.0011597492,0.000092865295,0.000035255023,0.00012866098,0.00024423026,0.68589365,0.03768047,0.029562747,0.0010741362,0.24380961],"study_design_scores_gemma":[0.000019869985,0.000051650415,0.000109885324,0.000006560917,0.000008915132,0.00003550135,0.000015087858,0.9826818,0.008158979,0.0076842257,0.0012207036,0.000006755743],"about_ca_topic_score_codex":0.0007215257,"about_ca_topic_score_gemma":0.0006500194,"teacher_disagreement_score":0.0012046334,"about_ca_system_score_codex":0.0005417348,"about_ca_system_score_gemma":0.0005037582,"threshold_uncertainty_score":0.0051878095},"labels":[],"label_agreement":null},{"id":"W4251697033","doi":"10.1080/17513472.2011.574870","title":"Cover","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics and the Arts","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cover (algebra); Variation (astronomy); Painting; Computer science; Cluster analysis; Pheromone; Art history; Artificial intelligence; Art; Ecology; Engineering; Biology","score_opus":0.029029071602069204,"score_gpt":0.23520470107581576,"score_spread":0.20617562947374657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251697033","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044715125,0.0023911456,0.0010760823,0.0024415634,0.007722792,0.00014230814,0.0025673194,0.0011481468,0.98206353],"genre_scores_gemma":[0.0019486141,0.001169668,0.00051387143,0.0009998081,0.0014882068,0.00004739641,0.0014222673,0.00044909792,0.99196106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977595,0.000019330606,0.000008841179,0.000055862412,0.0001109358,0.00002912242],"domain_scores_gemma":[0.9994073,0.000104911305,0.000024077259,0.000073647745,0.00022986264,0.00016024457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015959387,0.00091963157,0.0006270665,0.0013580932,0.0014840779,0.0023922988,0.0011186225,0.0015655055,0.84091043],"category_scores_gemma":[0.001300231,0.00025486836,0.0006874668,0.0017127915,0.0003781181,0.0020432353,0.0020941643,0.0014148518,0.6748363],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011484541,0.000011432438,0.000026494761,0.0000495781,9.451697e-7,0.0000414843,0.000011318443,0.00004594636,0.00013684474,0.0011713225,0.97098666,0.027506482],"study_design_scores_gemma":[0.000002965494,0.0000046170526,0.0001073608,0.000030326664,7.1549636e-7,0.000061554594,0.000012577853,0.000048262627,0.00004172944,0.00038547756,0.9993024,0.0000020268867],"about_ca_topic_score_codex":0.0019864333,"about_ca_topic_score_gemma":0.0050284043,"teacher_disagreement_score":0.84091043,"about_ca_system_score_codex":0.0010453794,"about_ca_system_score_gemma":0.00049888407,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4252262041","doi":"10.1007/978-3-662-44185-5_100372","title":"Evolutionary Tree","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Astrobiology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Tree (set theory); Computer science; Mathematics; Combinatorics","score_opus":0.016715210855324823,"score_gpt":0.235683127992004,"score_spread":0.21896791713667918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252262041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010337067,0.0029297448,0.6424565,0.001435321,0.00077233143,0.00020264824,0.0042533283,0.002698436,0.3349146],"genre_scores_gemma":[0.15508345,0.0061399275,0.5898855,0.0010731951,0.00044456983,0.00035891525,0.012826269,0.0023127554,0.23187543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997608,0.000039177776,0.000012274598,0.00007573872,0.000091147034,0.000020855916],"domain_scores_gemma":[0.99965715,0.000121591605,0.000014436323,0.000089575864,0.00009013766,0.000027216038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032742132,0.00041761005,0.0004263635,0.0009613562,0.00071065105,0.0015757934,0.00085270026,0.00085586024,0.046895567],"category_scores_gemma":[0.0017004197,0.00026334124,0.0005830384,0.0013237919,0.0003991079,0.0016882938,0.000922315,0.0011456154,0.017554665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058082205,0.000044975215,0.000600311,0.000363529,0.000047845057,0.00020731962,0.0002130129,0.01697519,0.0047865077,0.38800463,0.07872314,0.50997543],"study_design_scores_gemma":[0.000025084737,0.000053476815,0.00065143185,0.00017059606,0.00004520626,0.00072836224,0.00008573209,0.053795643,0.002971396,0.35048276,0.5909632,0.000027123482],"about_ca_topic_score_codex":0.00056845346,"about_ca_topic_score_gemma":0.0010700591,"teacher_disagreement_score":0.046895567,"about_ca_system_score_codex":0.0004342497,"about_ca_system_score_gemma":0.0005748412,"threshold_uncertainty_score":0.15688127},"labels":[],"label_agreement":null},{"id":"W4252545596","doi":"10.32920/ryerson.14643771","title":"Adaptive representations for improving evolvability, parameter tuning, and parallelization of gene expression programming","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gene expression programming; Evolvability; Computer science; Genetic programming; Population; Transposition (logic); Symbolic regression; Representation (politics); Tree (set theory); Encoding (memory); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Biology; Genetics","score_opus":0.036910055541007535,"score_gpt":0.29822233896101363,"score_spread":0.2613122834200061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252545596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084068455,0.0001946052,0.911966,0.00017010489,0.0000355567,0.00005119071,0.00003238574,0.0011089069,0.002372704],"genre_scores_gemma":[0.5523312,0.00017403862,0.44511893,0.000092647606,0.000031007145,0.0001910264,0.00010726155,0.00033200748,0.0016218207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.00019371306,0.000032432374,0.000117673786,0.00015943371,0.0000612548],"domain_scores_gemma":[0.9986228,0.00074223784,0.00013309857,0.00030902872,0.00015155939,0.000041332565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980948,0.0006168913,0.0004809778,0.00056311174,0.00027301224,0.0008532648,0.0011686884,0.000800275,0.0012046334],"category_scores_gemma":[0.0051777503,0.0002812988,0.0004445742,0.0006625275,0.0007415751,0.0011247509,0.0011750114,0.0013609378,0.0002839521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015589611,0.00016278127,0.0011597492,0.000092865295,0.000035255023,0.00012866098,0.00024423026,0.68589365,0.03768047,0.029562747,0.0010741362,0.24380961],"study_design_scores_gemma":[0.000019869985,0.000051650415,0.000109885324,0.000006560917,0.000008915132,0.00003550135,0.000015087858,0.9826818,0.008158979,0.0076842257,0.0012207036,0.000006755743],"about_ca_topic_score_codex":0.0007215257,"about_ca_topic_score_gemma":0.0006500194,"teacher_disagreement_score":0.0012046334,"about_ca_system_score_codex":0.0005417348,"about_ca_system_score_gemma":0.0005037582,"threshold_uncertainty_score":0.0051878095},"labels":[],"label_agreement":null},{"id":"W4253061157","doi":"10.4018/978-1-4666-2476-4.ch018","title":"Time and Frequency Analysis of Particle Swarm Trajectories for Cognitive Machines","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Position (finance); Trajectory; Computer science; Dimension (graph theory); Particle (ecology); Mathematical optimization; Control theory (sociology); Algorithm; Mathematics; Artificial intelligence; Control (management); Physics","score_opus":0.016899147478968896,"score_gpt":0.25724579025161404,"score_spread":0.24034664277264514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253061157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0660958,0.000874695,0.9245105,0.00030839443,0.00006490243,0.00003233708,0.00009267781,0.000214751,0.0078059225],"genre_scores_gemma":[0.8107251,0.0011282944,0.18246794,0.00004574349,0.00007821815,0.00009076554,0.0002546221,0.00015196165,0.005057436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999866,0.00003359002,0.000007495397,0.000017853788,0.000065682325,0.000009330832],"domain_scores_gemma":[0.9994198,0.00036300806,0.00007462057,0.000043522225,0.00007913829,0.000020024412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042904384,0.0003825376,0.0002721022,0.0010014867,0.00038266802,0.0008205773,0.0003282868,0.00046047286,0.0016523013],"category_scores_gemma":[0.0029111,0.00015427788,0.0003341591,0.0007298201,0.00049077295,0.0006967404,0.00033299738,0.00045757755,0.000243974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006771381,0.000023934792,0.0022851254,0.00012326127,0.00003545973,0.00013338187,0.0002873974,0.77381927,0.005362318,0.14492263,0.001235257,0.07170428],"study_design_scores_gemma":[0.0000010021537,0.000006423078,0.00050389627,0.0000061764185,0.0000020820808,0.000019739637,0.000018599907,0.98325896,0.00035444862,0.015012021,0.00081292953,0.0000037901693],"about_ca_topic_score_codex":0.0030966585,"about_ca_topic_score_gemma":0.0013619486,"teacher_disagreement_score":0.0030966585,"about_ca_system_score_codex":0.0006660681,"about_ca_system_score_gemma":0.00033417408,"threshold_uncertainty_score":0.006157279},"labels":[],"label_agreement":null},{"id":"W4253480471","doi":"10.22215/etd/2009-09227","title":"Learning the neuron functions within neural networks based on genetic programming","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"Universitat Politècnica de Catalunya","keywords":"Genetic programming; Artificial neural network; Computer science; Artificial intelligence; Humanities; Art","score_opus":0.009179212263049779,"score_gpt":0.23533304844879593,"score_spread":0.22615383618574617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253480471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0550426,0.00041221717,0.93856364,0.00031770594,0.0000701693,0.00003942727,0.000017027463,0.0002884529,0.0052488167],"genre_scores_gemma":[0.64918774,0.0007127895,0.34165803,0.000117180076,0.000060450955,0.00011521351,0.000065324304,0.000161752,0.007921553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998591,0.000043036463,0.0000067207257,0.000027751048,0.000043517357,0.000019971867],"domain_scores_gemma":[0.99964166,0.00021182238,0.00002756614,0.000026912734,0.00007253712,0.000019497353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054744276,0.0003255491,0.0004337053,0.0002836388,0.00022546879,0.0008079292,0.00077883375,0.0006926588,0.0011933919],"category_scores_gemma":[0.002079446,0.0002560682,0.00038869033,0.00035943944,0.0005371896,0.0008018616,0.00043196944,0.0010594205,0.00026971873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003368847,0.000032542775,0.0003923782,0.000023878745,0.000025980793,0.000026112546,0.000048501308,0.92406964,0.0030235178,0.014966652,0.000371301,0.05698576],"study_design_scores_gemma":[0.0000033324714,0.000008371554,0.000045394776,0.0000036403603,0.0000039499123,0.0000039392285,0.0000031823874,0.9956731,0.00062288815,0.003405518,0.00022498281,0.0000017078548],"about_ca_topic_score_codex":0.00448141,"about_ca_topic_score_gemma":0.0051312307,"teacher_disagreement_score":0.00448141,"about_ca_system_score_codex":0.0007114534,"about_ca_system_score_gemma":0.00056044734,"threshold_uncertainty_score":0.008910656},"labels":[],"label_agreement":null},{"id":"W4253844258","doi":"10.1007/978-1-4614-6170-8_100652","title":"Evolving Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.013973330836175158,"score_gpt":0.21919849711277614,"score_spread":0.20522516627660098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253844258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012159172,0.004064617,0.6471424,0.0013481115,0.0008973806,0.00012524858,0.00053973106,0.001851446,0.33187193],"genre_scores_gemma":[0.19459307,0.010345882,0.40992892,0.0009276367,0.00046580736,0.0002584934,0.0030119603,0.0021165903,0.37835157],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997898,0.00003633888,0.000006268381,0.00006641545,0.00008658054,0.000014631381],"domain_scores_gemma":[0.9997261,0.00010482504,0.000011381977,0.00008561602,0.000050862614,0.000021138589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023607166,0.0005818049,0.00032868295,0.00085734134,0.0004209517,0.0010401426,0.000998585,0.0006462409,0.021815296],"category_scores_gemma":[0.0013222969,0.00030196583,0.00044919812,0.0011054961,0.00053344184,0.0018669253,0.0010593382,0.0013283684,0.006162739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022410559,0.00003829261,0.00021204005,0.00019968743,0.000026119167,0.00009498486,0.0001501772,0.03957712,0.0050689736,0.39706978,0.046001986,0.5115383],"study_design_scores_gemma":[0.000011944234,0.00003495105,0.00036838104,0.00013004494,0.00003199468,0.00045118894,0.00007884593,0.1158871,0.006755605,0.5381967,0.33802807,0.000025175113],"about_ca_topic_score_codex":0.0009617474,"about_ca_topic_score_gemma":0.0012667594,"teacher_disagreement_score":0.021815296,"about_ca_system_score_codex":0.00063925417,"about_ca_system_score_gemma":0.00033706333,"threshold_uncertainty_score":0.07297945},"labels":[],"label_agreement":null},{"id":"W4254113190","doi":"10.1007/978-1-4939-7131-2_100360","title":"Evolving Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.015515252700059667,"score_gpt":0.22466145872537727,"score_spread":0.2091462060253176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254113190","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00702736,0.009204753,0.44193542,0.001945946,0.0015631574,0.00008358521,0.00035244695,0.0010146848,0.53687274],"genre_scores_gemma":[0.13112669,0.019500922,0.14723007,0.00076406536,0.0009824032,0.00023684994,0.0012233728,0.00080061215,0.698135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998591,0.00002049947,0.0000046787395,0.000041704414,0.00006326126,0.000010716291],"domain_scores_gemma":[0.99982363,0.000068865585,0.0000091034735,0.00004487447,0.000040113202,0.000013456218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020603118,0.0005621401,0.00030424006,0.00061211694,0.00037581407,0.0011246218,0.00076735707,0.00069502316,0.02543905],"category_scores_gemma":[0.0010832605,0.00026291327,0.00026800612,0.00077759643,0.0005213286,0.0020466326,0.00091895723,0.0011383757,0.007719607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021420765,0.000025874995,0.000180089,0.00021807922,0.000021561591,0.00010506411,0.00012314416,0.033419874,0.0037859078,0.44576147,0.05150561,0.46483192],"study_design_scores_gemma":[0.000007705223,0.000030146142,0.0002821927,0.00014612541,0.000021871943,0.00044957458,0.00005268678,0.07403562,0.0043566516,0.381417,0.5391802,0.00002020892],"about_ca_topic_score_codex":0.0006148744,"about_ca_topic_score_gemma":0.0008000337,"teacher_disagreement_score":0.02543905,"about_ca_system_score_codex":0.0006042925,"about_ca_system_score_gemma":0.00030305283,"threshold_uncertainty_score":0.08510214},"labels":[],"label_agreement":null},{"id":"W4281627470","doi":"10.5281/zenodo.6633719","title":"The Experimental Multi-Arm Pendulum on a Cart: A Benchmark System for Chaos, Learning, and Control","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Benchmark (surveying); CHAOS (operating system); Cart; Pendulum; Computer science; Control (management); Inverted pendulum; Artificial intelligence; Control theory (sociology); Physics; Engineering; Mechanical engineering; Cartography; Geography; Nonlinear system; Operating system","score_opus":0.0195745055684784,"score_gpt":0.24370860537004582,"score_spread":0.22413409980156743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281627470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8120179,0.0010130809,0.14174779,0.0013006579,0.00065434154,0.00070069905,0.0025088629,0.0012350911,0.03882152],"genre_scores_gemma":[0.95782924,0.00031537886,0.03492521,0.00009785329,0.000034204466,0.00042948374,0.0008686536,0.000054463457,0.0054455437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961865,0.00008693753,0.000024687468,0.00006171723,0.00014697743,0.000061031024],"domain_scores_gemma":[0.9995808,0.00011600425,0.000045016233,0.00008146234,0.00010316885,0.00007354871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058055413,0.00040001978,0.00040976843,0.0003679428,0.00079131813,0.00055269647,0.0007486341,0.0007790508,0.005925955],"category_scores_gemma":[0.0012076303,0.00014991485,0.00030558422,0.00032181278,0.00064171234,0.00047690165,0.0007539777,0.0004792077,0.0006079751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016231228,0.0010818751,0.0067326576,0.0018449839,0.00020809266,0.0019959519,0.0006430485,0.48171145,0.30146018,0.07747389,0.017614355,0.1076104],"study_design_scores_gemma":[0.00033486966,0.0042387014,0.0077192825,0.00011499087,0.00006239425,0.00031060787,0.0003806983,0.8228474,0.114810705,0.011488701,0.03755298,0.00013866696],"about_ca_topic_score_codex":0.0018982559,"about_ca_topic_score_gemma":0.0021621871,"teacher_disagreement_score":0.005925955,"about_ca_system_score_codex":0.0004268672,"about_ca_system_score_gemma":0.0006281063,"threshold_uncertainty_score":0.019824266},"labels":[],"label_agreement":null},{"id":"W4281745141","doi":"10.5281/zenodo.6632782","title":"The Experimental Multi-Arm Pendulum on a Cart: A Benchmark System for Chaos, Learning, and Control","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Benchmark (surveying); Cart; CHAOS (operating system); Control theory (sociology); Pendulum; Computer science; Inverted pendulum; Double pendulum; Control (management); Artificial intelligence; Physics; Nonlinear system; Engineering; Geography","score_opus":0.0195745055684784,"score_gpt":0.24370860537004582,"score_spread":0.22413409980156743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281745141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8120179,0.0010130809,0.14174779,0.0013006579,0.00065434154,0.00070069905,0.0025088629,0.0012350911,0.03882152],"genre_scores_gemma":[0.95782924,0.00031537886,0.03492521,0.00009785329,0.000034204466,0.00042948374,0.0008686536,0.000054463457,0.0054455437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961865,0.00008693753,0.000024687468,0.00006171723,0.00014697743,0.000061031024],"domain_scores_gemma":[0.9995808,0.00011600425,0.000045016233,0.00008146234,0.00010316885,0.00007354871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058055413,0.00040001978,0.00040976843,0.0003679428,0.00079131813,0.00055269647,0.0007486341,0.0007790508,0.005925955],"category_scores_gemma":[0.0012076303,0.00014991485,0.00030558422,0.00032181278,0.00064171234,0.00047690165,0.0007539777,0.0004792077,0.0006079751],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016231228,0.0010818751,0.0067326576,0.0018449839,0.00020809266,0.0019959519,0.0006430485,0.48171145,0.30146018,0.07747389,0.017614355,0.1076104],"study_design_scores_gemma":[0.00033486966,0.0042387014,0.0077192825,0.00011499087,0.00006239425,0.00031060787,0.0003806983,0.8228474,0.114810705,0.011488701,0.03755298,0.00013866696],"about_ca_topic_score_codex":0.0018982559,"about_ca_topic_score_gemma":0.0021621871,"teacher_disagreement_score":0.005925955,"about_ca_system_score_codex":0.0004268672,"about_ca_system_score_gemma":0.0006281063,"threshold_uncertainty_score":0.019824266},"labels":[],"label_agreement":null},{"id":"W4281920676","doi":"10.1109/tevc.2022.3174737","title":"IEEE Transactions on Evolutionary Computation Publication Information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Southern University of Science and Technology; Universität Bielefeld; Xidian University; Guangdong University of Technology; Brock University; Universidad Veracruzana; Zhengzhou University; University of Hong Kong; Swinburne University of Technology; Griffith University; RMIT University; Nanyang Technological University; Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; Shenzhen University; Nanjing University; Dalhousie University; University of Melbourne; University of Sheffield; University of Exeter; South China University of Technology; City University of Hong Kong; Aberystwyth University; Norges Teknisk-Naturvitenskapelige Universitet","keywords":"Evolutionary computation; Computer science; Computation; Evolutionary algorithm; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.014466550623449472,"score_gpt":0.24034917080551912,"score_spread":0.22588262018206964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281920676","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076593026,0.021666966,0.24968003,0.01065577,0.0570504,0.00046269206,0.01530828,0.0060635065,0.6314531],"genre_scores_gemma":[0.04385564,0.02387403,0.051835652,0.0014731337,0.0054960013,0.00027955577,0.023148537,0.0025249796,0.84751254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943393,0.00005306475,0.000038577968,0.000059633516,0.00036961335,0.000045139866],"domain_scores_gemma":[0.99850285,0.0003017098,0.000046727433,0.00030316203,0.00071413856,0.00013136552],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00091064454,0.0007566437,0.0013173587,0.002071419,0.00056389865,0.0026273446,0.0009867337,0.0017150628,0.3370863],"category_scores_gemma":[0.0030992182,0.00035696366,0.00051182427,0.0025355972,0.00032483265,0.0021721139,0.0010980901,0.0013611628,0.13660088],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010177876,0.00009792485,0.00044639895,0.0004607607,0.000020848967,0.00015387799,0.000024205256,0.0035352774,0.0025504064,0.018279389,0.52497655,0.4493526],"study_design_scores_gemma":[0.000037692203,0.00006683725,0.0011215344,0.00025740807,0.000040874173,0.0004506011,0.000033422628,0.016714646,0.003258999,0.029017597,0.9489585,0.000041991632],"about_ca_topic_score_codex":0.0007082877,"about_ca_topic_score_gemma":0.00096990017,"teacher_disagreement_score":0.3370863,"about_ca_system_score_codex":0.00034184536,"about_ca_system_score_gemma":0.0010214506,"threshold_uncertainty_score":0.94556594},"labels":[],"label_agreement":null},{"id":"W4285101299","doi":"10.1109/aiiot54504.2022.9817370","title":"An Approach for Automatic Discovery of Rules Based on ECG Data Using Learning Classifier Systems","year":2022,"lang":"en","type":"article","venue":"2022 IEEE World AI IoT Congress (AIIoT)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Machine learning; Classifier (UML); Artificial intelligence; Component (thermodynamics); Personalized medicine; Decision support system; Association rule learning; Data mining; Bioinformatics","score_opus":0.05134884789720748,"score_gpt":0.3044739133264933,"score_spread":0.2531250654292858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285101299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077212886,0.0001850673,0.98771125,0.00028766287,0.000057412697,0.00025395016,0.00019299016,0.002328523,0.0012618375],"genre_scores_gemma":[0.10145963,0.00020225,0.89588,0.00018241243,0.00004663498,0.00025461096,0.00050227693,0.000102806516,0.001369515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965064,0.00065908046,0.00041324916,0.0008113128,0.0014549784,0.00015496371],"domain_scores_gemma":[0.992755,0.003613002,0.00043709506,0.00094233523,0.0021313399,0.0001213746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033078936,0.0008482691,0.0010670115,0.0029000305,0.0007951576,0.002536472,0.0022115053,0.0016168908,0.0019745184],"category_scores_gemma":[0.014657125,0.0005496591,0.001059096,0.0018556215,0.00070507155,0.001837178,0.0009898674,0.0018513721,0.0010381597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017713536,0.00034067672,0.0070804562,0.00027310947,0.00020631908,0.0006048954,0.00043766896,0.08213249,0.018239722,0.01963983,0.0049302885,0.8659375],"study_design_scores_gemma":[0.00003405931,0.00011272609,0.0017202722,0.00008265295,0.00008988577,0.00031160787,0.0000983387,0.9487567,0.019386327,0.018261114,0.011096584,0.000049639348],"about_ca_topic_score_codex":0.0067899316,"about_ca_topic_score_gemma":0.0058343215,"teacher_disagreement_score":0.0067899316,"about_ca_system_score_codex":0.0009784508,"about_ca_system_score_gemma":0.0018615349,"threshold_uncertainty_score":0.017494023},"labels":[],"label_agreement":null},{"id":"W4285217523","doi":"10.1007/978-3-031-79167-3","title":"Applying Reinforcement Learning on Real-World Data with Practical Examples in Python","year":2022,"lang":"en","type":"book","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Canadian Institute for Advanced Research","funders":"","keywords":"Python (programming language); Computer science; Reinforcement learning; Artificial intelligence; Machine learning; Programming language","score_opus":0.08124021256867234,"score_gpt":0.32675245957882326,"score_spread":0.24551224701015092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285217523","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052469783,0.00021090521,0.92393386,0.00043875672,0.00015778125,0.000100389654,0.0014839114,0.03620021,0.032227155],"genre_scores_gemma":[0.07470069,0.0003822954,0.8883657,0.00023312196,0.00004245337,0.000298161,0.0028044195,0.005492083,0.02768109],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964845,0.00006943259,0.000030040199,0.0000654823,0.00015562291,0.00003092044],"domain_scores_gemma":[0.99880815,0.00072200526,0.000038049562,0.00023052543,0.0001571185,0.000044037228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007461413,0.000720474,0.000554277,0.0004958995,0.00035986782,0.0011584663,0.0017740831,0.0006535072,0.047371928],"category_scores_gemma":[0.0048944172,0.00050199975,0.0006068884,0.0008022151,0.00053774234,0.0015426002,0.0016920182,0.0015865465,0.011531264],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015032191,0.00013260462,0.0011799611,0.0007358609,0.00005963339,0.0003389182,0.00020220426,0.1789789,0.004821827,0.053765472,0.13843288,0.62120146],"study_design_scores_gemma":[0.00004409299,0.000020710933,0.0004612481,0.000084784544,0.000012253187,0.00023330774,0.000040826042,0.8452202,0.0065424074,0.06745557,0.07986192,0.000022629045],"about_ca_topic_score_codex":0.0025467156,"about_ca_topic_score_gemma":0.0047153025,"teacher_disagreement_score":0.047371928,"about_ca_system_score_codex":0.00051440985,"about_ca_system_score_gemma":0.0007943344,"threshold_uncertainty_score":0.15847486},"labels":[],"label_agreement":null},{"id":"W4285464742","doi":"10.32920/ryerson.14651808","title":"A Study on Financial Time Series Forecasting and Symbolic Regression by means of a Hybrid Probabilistic Model-Building Cartesian Genetic Programming Methodology","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Symbolic regression; Probabilistic logic; Genetic programming; Computer science; Hidden Markov model; Markov chain; Representation (politics); Stock market; Regression; Statistical model; Econometrics; Artificial intelligence; Machine learning; Mathematics; Statistics; Geography","score_opus":0.060633634333013824,"score_gpt":0.30307290876519427,"score_spread":0.24243927443218044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285464742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029518599,0.0004468558,0.9671202,0.00015300434,0.000029071542,0.00002726493,0.000012211099,0.00011699061,0.0025758268],"genre_scores_gemma":[0.4785557,0.00080200675,0.51800424,0.0000852087,0.00004570124,0.000102069615,0.00006591687,0.000069668255,0.0022694631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954635,0.00021569534,0.000016264506,0.00007555432,0.00012075527,0.000025462805],"domain_scores_gemma":[0.9988996,0.00084258954,0.00004370124,0.00005568659,0.00013264868,0.000025804024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013184381,0.0005113288,0.00051790074,0.000499209,0.0002574837,0.00059330004,0.00086203095,0.00071557536,0.0010757784],"category_scores_gemma":[0.003159923,0.00031019383,0.00060507836,0.0007992339,0.0006563791,0.0008581709,0.0005440289,0.000997218,0.00015118084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030846517,0.000055629145,0.0010029934,0.00011031865,0.000045471526,0.000059407826,0.00013144102,0.86076933,0.002090672,0.038630493,0.0003480443,0.096725255],"study_design_scores_gemma":[0.0000041363114,0.000037198162,0.00010252061,0.0000056480685,0.0000065472573,0.000021764354,0.0000070967,0.99561334,0.00038119845,0.003235552,0.0005817221,0.000003256464],"about_ca_topic_score_codex":0.004490878,"about_ca_topic_score_gemma":0.002115628,"teacher_disagreement_score":0.004490878,"about_ca_system_score_codex":0.00047015367,"about_ca_system_score_gemma":0.00082372554,"threshold_uncertainty_score":0.008929491},"labels":[],"label_agreement":null},{"id":"W4285734686","doi":"10.1145/3512290.3528694","title":"Evolving transferable neural pruning functions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research; National Science Foundation","keywords":"Pruning; Computer science; Artificial intelligence; Machine learning; Inference; Artificial neural network; Deep learning; Process (computing); Function (biology); Genetic programming","score_opus":0.016475071863052915,"score_gpt":0.21564160838079635,"score_spread":0.19916653651774344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285734686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09624294,0.00038139473,0.8971895,0.00024183786,0.00005006399,0.00008547058,0.00005552185,0.0007254503,0.005027816],"genre_scores_gemma":[0.6856552,0.00035024993,0.3093628,0.00020372328,0.000029812782,0.0003862791,0.00018868997,0.00034243218,0.0034807953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992494,0.0002390887,0.000048593,0.00011856909,0.00025933952,0.00008502577],"domain_scores_gemma":[0.9980556,0.0011402472,0.00016116825,0.00020258527,0.000377255,0.0000630825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002086845,0.0010523845,0.0006780263,0.0009948119,0.00035701506,0.00087484316,0.0011069139,0.0013573884,0.0014871464],"category_scores_gemma":[0.008612367,0.00040017004,0.00061019993,0.0005092198,0.0008762613,0.0013566758,0.0013306913,0.0014124163,0.0003286698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055390014,0.000074773554,0.0012075318,0.00008213624,0.000037411155,0.00015227134,0.0001220912,0.84320873,0.00960298,0.028992698,0.0012554476,0.115208566],"study_design_scores_gemma":[0.0000099925355,0.00003678333,0.00012881975,0.000017926612,0.000011303121,0.00003618358,0.000012804939,0.98791504,0.0027346658,0.008180844,0.00091040804,0.0000051808715],"about_ca_topic_score_codex":0.00094281265,"about_ca_topic_score_gemma":0.0012166875,"teacher_disagreement_score":0.002086845,"about_ca_system_score_codex":0.0011112447,"about_ca_system_score_gemma":0.00082728296,"threshold_uncertainty_score":0.011036456},"labels":[],"label_agreement":null},{"id":"W4285805245","doi":"10.1145/3520304.3528883","title":"Genetic programming with external memory in sequence recall tasks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Benchmark (surveying); Recall; Task (project management); Machine learning; Scalability; Artificial intelligence; Sequence (biology); Set (abstract data type); Theoretical computer science; Programming language; Cognitive psychology; Psychology","score_opus":0.02325489766358696,"score_gpt":0.2404040909826295,"score_spread":0.21714919331904253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285805245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5496954,0.00043651275,0.4359851,0.00090806873,0.000068720175,0.00022688224,0.00025681776,0.0012390274,0.01118353],"genre_scores_gemma":[0.88944966,0.00017196103,0.10600848,0.00018426149,0.000022298203,0.00026790003,0.0002376407,0.00008189523,0.0035758398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919444,0.00034283963,0.000040906234,0.00018596828,0.0001451713,0.00009065626],"domain_scores_gemma":[0.99426067,0.0044112084,0.00036112074,0.00047597644,0.00031825952,0.00017282889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017026609,0.0007487248,0.00056432636,0.00036447053,0.00040867843,0.001211535,0.0015043505,0.0012861982,0.00248032],"category_scores_gemma":[0.0108538065,0.00026822416,0.0003866092,0.00059535116,0.0010243006,0.0024076598,0.0011110859,0.0020243013,0.00030263103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029954137,0.00042415684,0.0013842492,0.00011393796,0.000036330486,0.0001314394,0.00015808207,0.899516,0.0027756428,0.020875148,0.00087590003,0.07340947],"study_design_scores_gemma":[0.00006565415,0.00021444367,0.00033213524,0.000017249307,0.00001941194,0.00002260004,0.000034833523,0.95931685,0.0031756226,0.03605577,0.00073242956,0.00001308454],"about_ca_topic_score_codex":0.004001308,"about_ca_topic_score_gemma":0.005093167,"teacher_disagreement_score":0.004001308,"about_ca_system_score_codex":0.0010041666,"about_ca_system_score_gemma":0.0014380031,"threshold_uncertainty_score":0.0090046525},"labels":[],"label_agreement":null},{"id":"W4285805253","doi":"10.1145/3520304.3529043","title":"Regulatory genotype-to-phenotype mappings improve evolvability in genetic programming","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Evolvability; Robustness (evolution); Phenotype; Genetic programming; Fitness landscape; Novelty; Computer science; Genotype; Biology; Grammatical evolution; Neutral network; Computational biology; Genetics; Gene; Artificial intelligence; Population","score_opus":0.013898914795487155,"score_gpt":0.22730685067141557,"score_spread":0.2134079358759284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285805253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31706426,0.000204257,0.6766729,0.00024180491,0.00002349642,0.000064243766,0.00002061717,0.00087068864,0.0048376666],"genre_scores_gemma":[0.94407356,0.0000937843,0.054831643,0.0000545409,0.000008228478,0.00006819173,0.000016425542,0.0000611089,0.00079247187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931717,0.0003225752,0.000037240814,0.00013267009,0.00012447235,0.00006576421],"domain_scores_gemma":[0.997715,0.001587763,0.00022724055,0.00026188747,0.00014741486,0.00006071887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014004275,0.0008671535,0.00046800342,0.00047314007,0.00026810783,0.00071107823,0.00084359193,0.0007823771,0.0011918775],"category_scores_gemma":[0.006955139,0.00027564022,0.00039448103,0.00032025186,0.0008849904,0.0010053421,0.0010128943,0.0007830824,0.00016983079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001199724,0.00016715683,0.0015793667,0.00008953807,0.000042380754,0.0001728659,0.00017249883,0.8570127,0.04137449,0.040105235,0.00022237905,0.058941424],"study_design_scores_gemma":[0.000030019988,0.00015098028,0.00048757374,0.0000104655555,0.00002540017,0.000086515174,0.000020973404,0.9735536,0.008272686,0.016846403,0.0005031143,0.000012308598],"about_ca_topic_score_codex":0.000317451,"about_ca_topic_score_gemma":0.00023717871,"teacher_disagreement_score":0.0014004275,"about_ca_system_score_codex":0.0003536673,"about_ca_system_score_gemma":0.00047707968,"threshold_uncertainty_score":0.0074062347},"labels":[],"label_agreement":null},{"id":"W4285805506","doi":"10.1145/3520304.3528765","title":"On the interaction between lexicase selection, modularity and data subsets","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Modularity (biology); Selection (genetic algorithm); Computer science; Representation (politics); Population; Benchmarking; Range (aeronautics); Artificial intelligence; Machine learning; Theoretical computer science; Biology; Engineering","score_opus":0.05248454930940616,"score_gpt":0.28094247180006954,"score_spread":0.22845792249066338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285805506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8390683,0.0013110428,0.14667705,0.0017761353,0.000027534334,0.00011883624,0.00020032887,0.0003231567,0.0104975635],"genre_scores_gemma":[0.9793076,0.00017411636,0.019786308,0.00008381686,0.00001866759,0.000033958277,0.0000814282,0.00004646693,0.00046765766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970892,0.0020298834,0.00009248533,0.0002993977,0.00034080952,0.00014830762],"domain_scores_gemma":[0.9058025,0.08548199,0.0034431699,0.0024501637,0.0018273636,0.0009948363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077120466,0.0005077692,0.00057862035,0.0017240216,0.0006703818,0.00219357,0.00065578445,0.0009084481,0.0016080743],"category_scores_gemma":[0.054917265,0.00022394056,0.00036559434,0.0015742427,0.0017253081,0.0028746321,0.0015184083,0.00087396876,0.00019100666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018089531,0.0005552858,0.16559254,0.0006981556,0.00081247074,0.00063132617,0.001739874,0.3485157,0.03638066,0.11554026,0.004566212,0.32315862],"study_design_scores_gemma":[0.00011419503,0.0015153154,0.07067152,0.00017125318,0.00035536825,0.0009006311,0.00082460477,0.7756067,0.009487522,0.136757,0.0034801038,0.00011584177],"about_ca_topic_score_codex":0.0013832294,"about_ca_topic_score_gemma":0.003020108,"teacher_disagreement_score":0.0077120466,"about_ca_system_score_codex":0.0010024785,"about_ca_system_score_gemma":0.00058909145,"threshold_uncertainty_score":0.04078573},"labels":[],"label_agreement":null},{"id":"W4285805521","doi":"10.1145/3520304.3528766","title":"Benchmarking genetic programming in a multi-action reinforcement learning locomotion task","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Benchmarking; Reinforcement learning; Benchmark (surveying); Computer science; Task (project management); Scalability; Artificial intelligence; Action (physics); Genetic programming; Machine learning; Engineering","score_opus":0.032416746657698725,"score_gpt":0.2598119153093554,"score_spread":0.22739516865165665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285805521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8601046,0.000947754,0.119035855,0.0010152621,0.00024637458,0.00020350663,0.00050899055,0.0011479986,0.01678954],"genre_scores_gemma":[0.9377414,0.00016525468,0.05907408,0.00017175019,0.000019390252,0.00015103225,0.0005317349,0.00009182173,0.0020535858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924135,0.00033730984,0.000036612382,0.0001245318,0.00015616212,0.00010404713],"domain_scores_gemma":[0.9975561,0.001735983,0.00010195395,0.00017068358,0.00029222653,0.00014317755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021593147,0.00075571047,0.0006875205,0.0005593309,0.0003896397,0.0007388931,0.0012967348,0.0016398443,0.0017097847],"category_scores_gemma":[0.0056475643,0.00022545095,0.00054251007,0.00060242845,0.0007560721,0.00061629835,0.00061081705,0.0012282705,0.00028229906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021186256,0.000232654,0.0012263331,0.000098538396,0.000047557533,0.000076270815,0.000040673964,0.97153765,0.0012511598,0.0030423615,0.0010796909,0.021155303],"study_design_scores_gemma":[0.00004181847,0.00016843172,0.00043171906,0.0000102986905,0.000007919932,0.000011252284,0.000023780773,0.9959001,0.0010618764,0.0018522571,0.00048387353,0.0000067104197],"about_ca_topic_score_codex":0.005844802,"about_ca_topic_score_gemma":0.004655512,"teacher_disagreement_score":0.005844802,"about_ca_system_score_codex":0.0007876851,"about_ca_system_score_gemma":0.001016951,"threshold_uncertainty_score":0.011621535},"labels":[],"label_agreement":null},{"id":"W4288720071","doi":"10.3390/s22155659","title":"Plant Tissue Modelling Using Power-Law Filters","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Academy of Scientific Research and Technology","keywords":"Electrical impedance; Filter (signal processing); Power (physics); Dielectric spectroscopy; Equivalent circuit; Heuristic; Electronic engineering; Biological system; Computer science; Engineering; Electrical engineering; Voltage; Chemistry; Electrode; Electrochemistry; Physics; Artificial intelligence; Biology","score_opus":0.030473856898595057,"score_gpt":0.24876777781564605,"score_spread":0.218293920917051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288720071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04941055,0.0001587319,0.94694984,0.00004918185,0.000011252733,0.000036951897,0.000097235854,0.0004349903,0.0028512704],"genre_scores_gemma":[0.7738249,0.0005228615,0.21690843,0.000059815706,0.000010935832,0.00022751867,0.00030183414,0.00018794824,0.007955851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999882,0.00002896093,0.0000057389334,0.000034775563,0.000034055876,0.0000144950345],"domain_scores_gemma":[0.99977237,0.00012760467,0.000025484063,0.000022006527,0.000046871966,0.0000056583985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027415497,0.0005528643,0.00036353618,0.0004855826,0.00017693752,0.00068222097,0.00078830414,0.0010981696,0.0016419736],"category_scores_gemma":[0.0008041948,0.00024961637,0.0007833104,0.00045027287,0.00024718855,0.0006299669,0.0002245022,0.0004395005,0.00062012905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025511292,0.00002029876,0.00032446248,0.000050430484,0.000017889024,0.000048720947,0.00006962487,0.9580546,0.023405975,0.002290728,0.00015427297,0.015537527],"study_design_scores_gemma":[0.0000014776255,0.0000120409795,0.00010677035,0.0000026285184,0.0000040973623,0.000015768495,0.0000056738763,0.9962149,0.0025321515,0.0005367762,0.00056446076,0.0000031984937],"about_ca_topic_score_codex":0.0042162025,"about_ca_topic_score_gemma":0.0025850688,"teacher_disagreement_score":0.0042162025,"about_ca_system_score_codex":0.0005751306,"about_ca_system_score_gemma":0.00040518405,"threshold_uncertainty_score":0.008383334},"labels":[],"label_agreement":null},{"id":"W4292072693","doi":"10.1109/newcas52662.2022.9842014","title":"An FPGA Implementation of A Portable DNA Sequencing Device Based on RISC-V","year":2022,"lang":"en","type":"article","venue":"2022 20th IEEE Interregional NEWCAS Conference (NEWCAS)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Field-programmable gate array; Computer science; x86; Application-specific integrated circuit; Reduced instruction set computing; Embedded system; Efficient energy use; Mobile device; Computer architecture; ARM architecture; Instruction set; Computer hardware; Operating system; Software; Engineering","score_opus":0.06194817081840881,"score_gpt":0.3270940042653912,"score_spread":0.2651458334469824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292072693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4399984,0.0021538555,0.41181228,0.0008345943,0.0013295874,0.0007862995,0.0019065342,0.020731358,0.12044712],"genre_scores_gemma":[0.87738514,0.00041202857,0.10194546,0.0002697309,0.00003809397,0.00012134788,0.00064045965,0.00014013554,0.019047622],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998821,0.000017833892,0.0000067727146,0.000023490054,0.000041328167,0.000028347984],"domain_scores_gemma":[0.9999113,0.00001865814,0.000012908239,0.000016903168,0.000032576703,0.000007667897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009376843,0.00039092088,0.00019690396,0.0003211085,0.00016415713,0.0003490607,0.0007050484,0.00027760793,0.005781548],"category_scores_gemma":[0.00018519485,0.00013552453,0.00015162925,0.00021340964,0.00010042592,0.00022302262,0.00008622886,0.00022191329,0.0012780634],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013099007,0.000362252,0.0067205396,0.0015003813,0.00023684077,0.0031723836,0.00037681183,0.04451748,0.4181598,0.023711616,0.037118133,0.46281382],"study_design_scores_gemma":[0.00050789287,0.004750751,0.011558714,0.00022673795,0.00025397225,0.0050533824,0.00016875046,0.17910182,0.6138298,0.0022296198,0.1821882,0.00013036431],"about_ca_topic_score_codex":0.0011423494,"about_ca_topic_score_gemma":0.0016887706,"teacher_disagreement_score":0.005781548,"about_ca_system_score_codex":0.00024699845,"about_ca_system_score_gemma":0.00044348682,"threshold_uncertainty_score":0.01934123},"labels":[],"label_agreement":null},{"id":"W4292415121","doi":"10.1007/s10710-022-09437-9","title":"Editorial Introduction","year":2022,"lang":"en","type":"editorial","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.004277830987765302,"score_gpt":0.22872496680388982,"score_spread":0.22444713581612452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292415121","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030100113,0.0033278589,0.00008277338,0.020556727,0.96953154,0.000026919626,0.00006105539,0.00005862329,0.006324415],"genre_scores_gemma":[0.00055862044,0.0030013388,0.00011117862,0.023300081,0.92927784,0.000046181573,0.00010165804,0.00007145221,0.04353169],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956197,0.000728891,0.000343654,0.00054314494,0.0023298908,0.0004346913],"domain_scores_gemma":[0.9859637,0.0030422471,0.0011103351,0.0005371109,0.0059778476,0.0033686715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047125015,0.0030397866,0.0030253227,0.004163153,0.0032842767,0.008350107,0.0025766592,0.012943645,0.06871533],"category_scores_gemma":[0.01968982,0.0010108121,0.0021179405,0.0014944714,0.0016669022,0.0032834588,0.0026189077,0.011088348,0.0416486],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018432434,0.0000047096555,0.000009259372,0.00007704802,0.000005925665,0.00005797587,0.0000038993617,0.0000110575775,0.000028096782,0.000120569064,0.9956541,0.0040088883],"study_design_scores_gemma":[0.00003982856,0.000013059485,0.00010857108,0.00017902034,0.000018053192,0.00013905988,0.000015202456,0.000051781426,0.0000473057,0.00060393824,0.9987741,0.000010078623],"about_ca_topic_score_codex":0.0013801306,"about_ca_topic_score_gemma":0.0044416045,"teacher_disagreement_score":0.06871533,"about_ca_system_score_codex":0.0027352064,"about_ca_system_score_gemma":0.0029044806,"threshold_uncertainty_score":0.22987568},"labels":[],"label_agreement":null},{"id":"W4293519282","doi":"10.1109/cibcb55180.2022.9863054","title":"EvoDNN - Evolving Weights, Biases, and Activation Functions in a Deep Neural Network","year":2022,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Activation function; Computer science; Differentiable function; Artificial neural network; Artificial intelligence; Deep neural networks; Set (abstract data type); Flexibility (engineering); Feature (linguistics); Coding (social sciences); Function (biology); Code (set theory); Theoretical computer science; Mathematics; Biology","score_opus":0.01799613487483072,"score_gpt":0.23022305169533416,"score_spread":0.21222691682050343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293519282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13390367,0.00076911174,0.8544555,0.00060963363,0.00021818967,0.0001222651,0.00055673084,0.002511319,0.0068535507],"genre_scores_gemma":[0.6620909,0.00035135567,0.32698813,0.00043958353,0.00003246026,0.00026563028,0.0011488813,0.00039106223,0.008292043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999729,0.000056338937,0.000020199168,0.0000829777,0.00007345691,0.000038166592],"domain_scores_gemma":[0.99925405,0.00034824276,0.000048684233,0.000117304444,0.00019928828,0.000032414522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013852972,0.0007752462,0.0005573032,0.00043965137,0.0003677073,0.0007485381,0.0015931346,0.0011262551,0.0020489078],"category_scores_gemma":[0.003821302,0.00048236808,0.0005442854,0.0005299463,0.0005442488,0.0012181671,0.0011531377,0.0017492024,0.0004766533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007146964,0.0000628407,0.0029479656,0.00007083911,0.000060360508,0.000074359916,0.00006573207,0.8836155,0.0053257984,0.00534802,0.0021424154,0.10021468],"study_design_scores_gemma":[0.000007901313,0.000015757474,0.0001862763,0.000013198536,0.000007094793,0.000027551509,0.000006985378,0.99427855,0.0021738233,0.0024754172,0.00080158445,0.0000059410118],"about_ca_topic_score_codex":0.0077431654,"about_ca_topic_score_gemma":0.011494417,"teacher_disagreement_score":0.0077431654,"about_ca_system_score_codex":0.0011438684,"about_ca_system_score_gemma":0.00078166096,"threshold_uncertainty_score":0.015396237},"labels":[],"label_agreement":null},{"id":"W4294723731","doi":"10.1016/j.inffus.2022.09.001","title":"Exploring diversity in data complexity and classifier decision spaces for pool generation","year":2022,"lang":"en","type":"article","venue":"Information Fusion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Classifier (UML); Computer science; Artificial intelligence; Machine learning; Data mining; Pattern recognition (psychology)","score_opus":0.32454960079118994,"score_gpt":0.30275272053261065,"score_spread":0.021796880258579288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294723731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100302584,0.00040448236,0.89623535,0.0006740592,0.000029388393,0.00010705519,0.00009025962,0.00022328566,0.0019334805],"genre_scores_gemma":[0.76216316,0.00016951951,0.23559992,0.00022560898,0.00007976978,0.00022520527,0.0002764678,0.00013233884,0.0011280073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720085,0.0011510106,0.00019792706,0.0004883416,0.0007306506,0.0002312647],"domain_scores_gemma":[0.98187685,0.014310344,0.00064272154,0.0011740765,0.0016423741,0.00035360825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009085772,0.0010566732,0.0019303004,0.0025716238,0.001235755,0.0028797868,0.0018916901,0.0021525668,0.0021302619],"category_scores_gemma":[0.033957653,0.00076388934,0.0014695458,0.0014057932,0.0013331599,0.005261456,0.0035276231,0.0023899532,0.00028370396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033740417,0.00033317052,0.0074300948,0.00013320491,0.00025156932,0.00013705883,0.00055605074,0.76532716,0.0046133255,0.032061912,0.001781432,0.18703763],"study_design_scores_gemma":[0.000020325833,0.000067098954,0.00037745363,0.000016433461,0.000026623693,0.00002365509,0.000038651302,0.9820458,0.00085923483,0.016256675,0.00025833835,0.000009619253],"about_ca_topic_score_codex":0.002296454,"about_ca_topic_score_gemma":0.0028373757,"teacher_disagreement_score":0.009085772,"about_ca_system_score_codex":0.0016568336,"about_ca_system_score_gemma":0.0017993486,"threshold_uncertainty_score":0.04805076},"labels":[],"label_agreement":null},{"id":"W4294811494","doi":"10.1109/cec55065.2022.9870271","title":"Mixed Media in Evolutionary Art","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Congress on Evolutionary Computation (CEC)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Computer graphics (images); Bitmap; Variety (cybernetics); Stylized fact; Digital art; Genetic programming; Pixel; Image (mathematics); Object (grammar); Computer vision; Artificial intelligence; Simple (philosophy); Media arts; Digital media; Art; Visual arts; World Wide Web","score_opus":0.023231085893861393,"score_gpt":0.25065400120207504,"score_spread":0.22742291530821365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026668403,0.012493598,0.7762807,0.0024214252,0.00080170715,0.0001653231,0.00014547726,0.0005986695,0.18042472],"genre_scores_gemma":[0.58033186,0.0055002277,0.36311474,0.0011194447,0.0005393321,0.00051496376,0.00022936372,0.00050346315,0.04814649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998982,0.00043913594,0.000049520862,0.00018258956,0.0002778527,0.00006886637],"domain_scores_gemma":[0.99830925,0.0010818384,0.0001096816,0.00024371318,0.00016896917,0.00008643057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012304578,0.00079008046,0.0005711167,0.0012590009,0.001342945,0.0042761676,0.0012174521,0.0018701357,0.01329402],"category_scores_gemma":[0.005180076,0.00041218547,0.00077156455,0.0011390276,0.003564092,0.003661097,0.0032185793,0.0018045848,0.0013926586],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045504104,0.000037104855,0.00045352563,0.00026559897,0.000034577708,0.00016445194,0.00038497194,0.03446027,0.0026317416,0.89364016,0.0023136933,0.06556835],"study_design_scores_gemma":[0.000038896203,0.00010181465,0.0005813084,0.00022386872,0.000038956823,0.00052712625,0.00020406935,0.12638958,0.00372955,0.777599,0.09050189,0.000063954016],"about_ca_topic_score_codex":0.0009726505,"about_ca_topic_score_gemma":0.0011133532,"teacher_disagreement_score":0.01329402,"about_ca_system_score_codex":0.0014308051,"about_ca_system_score_gemma":0.00048756032,"threshold_uncertainty_score":0.044472873},"labels":[],"label_agreement":null},{"id":"W4294811616","doi":"10.1109/cec55065.2022.9870353","title":"Managing Diversity and Many Objectives in Evolutionary Design","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Congress on Evolutionary Computation (CEC)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Evolutionary algorithm; Image (mathematics); Diversity (politics); Quality (philosophy); Genetic programming; Artificial intelligence; Road map; Evolutionary computation; Mathematical optimization; Theoretical computer science; Mathematics; Geography; Law","score_opus":0.023409568731471677,"score_gpt":0.24729910156788587,"score_spread":0.2238895328364142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013787217,0.00078482984,0.98027956,0.00029668486,0.000041398922,0.00004063147,0.000010139923,0.00015721736,0.0046022986],"genre_scores_gemma":[0.36636284,0.0011909538,0.6258115,0.00028939903,0.0001646515,0.00030031614,0.000051560284,0.00015934055,0.0056693708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824786,0.0007162818,0.000088171706,0.00015391987,0.0006822123,0.000111594556],"domain_scores_gemma":[0.99812907,0.0011170729,0.00016823543,0.00023546655,0.00026199894,0.00008817786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028437127,0.00090470404,0.0008979608,0.0012460081,0.00090825214,0.0016467941,0.0012744368,0.0011862495,0.0019913588],"category_scores_gemma":[0.005250442,0.00059529697,0.00094201893,0.000916212,0.0015616489,0.0023495548,0.002615553,0.0020059433,0.0003187532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094687835,0.000108031876,0.0017899422,0.0002548191,0.00018381503,0.00020938602,0.0005679429,0.58735925,0.009084383,0.12979738,0.0015030737,0.2690473],"study_design_scores_gemma":[0.00006673886,0.00030741768,0.00048322903,0.00010068342,0.000091568356,0.00035599133,0.00010695782,0.83642024,0.0044560917,0.14151268,0.01604314,0.000055355842],"about_ca_topic_score_codex":0.0009346415,"about_ca_topic_score_gemma":0.0012600519,"teacher_disagreement_score":0.0028437127,"about_ca_system_score_codex":0.0009997688,"about_ca_system_score_gemma":0.0008536393,"threshold_uncertainty_score":0.015039146},"labels":[],"label_agreement":null},{"id":"W4299812029","doi":"10.48550/arxiv.1802.03318","title":"Nature vs. Nurture: The Role of Environmental Resources in Evolutionary\\n Deep Intelligence","year":2018,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nature versus nurture; Modern evolutionary synthesis; MNIST database; Artificial neural network; Computer science; Artificial intelligence; Process (computing); Evolutionary algorithm; Deep neural networks; Biology; Machine learning; Evolutionary biology; Genetics","score_opus":0.01606193551316163,"score_gpt":0.16903891216838832,"score_spread":0.1529769766552267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299812029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8364844,0.0006180981,0.15053174,0.00063477893,0.000051488118,0.000028040951,0.00009207225,0.00040423224,0.011155351],"genre_scores_gemma":[0.97075135,0.00013461206,0.02811188,0.000059192233,0.0000052148134,0.000017886468,0.000052742595,0.00003938742,0.0008276407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998846,0.00003554002,0.0000061058754,0.00003336715,0.000023702047,0.000016701602],"domain_scores_gemma":[0.9994844,0.00030922133,0.000040895437,0.00008752745,0.000051858096,0.000026088625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049791305,0.00032273604,0.00022089873,0.0001587441,0.00022584229,0.0007312542,0.0005128246,0.00047045067,0.0015951829],"category_scores_gemma":[0.0024294828,0.00018349566,0.00018553261,0.00019513177,0.0004902063,0.0012871498,0.0005475174,0.000638974,0.00016278095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030046212,0.00014316267,0.006418566,0.00017705275,0.00009230821,0.00026382972,0.0001876848,0.71707445,0.08558585,0.027416507,0.00081238075,0.1615278],"study_design_scores_gemma":[0.000028138647,0.00024348895,0.0016604637,0.0000213284,0.000042450298,0.0000844747,0.00007891844,0.9419684,0.04235708,0.010617187,0.0028816394,0.000016362334],"about_ca_topic_score_codex":0.00077629555,"about_ca_topic_score_gemma":0.0021721357,"teacher_disagreement_score":0.0015951829,"about_ca_system_score_codex":0.0004640489,"about_ca_system_score_gemma":0.0002952666,"threshold_uncertainty_score":0.0053363442},"labels":[],"label_agreement":null},{"id":"W4300019589","doi":"10.48550/arxiv.1802.02423","title":"On the Generalizability of Linear and Non-Linear Region of\\n Interest-Based Multivariate Regression Models for fMRI Data","year":2018,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multivariate statistics; Univariate; Overfitting; General linear model; Bayesian multivariate linear regression; Linear regression; Generalizability theory; Functional magnetic resonance imaging; Linear model; Artificial intelligence; Computer science; Proper linear model; Regression; Statistics; Pattern recognition (psychology); Machine learning; Mathematics; Psychology; Artificial neural network","score_opus":0.26806971921984746,"score_gpt":0.26782813762062274,"score_spread":0.00024158159922471611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300019589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046534523,0.0012256303,0.9461717,0.0018308634,0.00010567967,0.00035143708,0.00028542356,0.0009826985,0.002511978],"genre_scores_gemma":[0.68850857,0.0027536594,0.30046505,0.001575118,0.00043336165,0.0012088246,0.0015055705,0.0010232398,0.0025265312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.959335,0.030441519,0.0015289545,0.005558628,0.00263163,0.00050428894],"domain_scores_gemma":[0.798891,0.1703845,0.0060428777,0.020088635,0.0040042396,0.0005887383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08972578,0.0023765133,0.0019264275,0.0027640564,0.00089050166,0.0036136587,0.0028038493,0.0030254938,0.002957571],"category_scores_gemma":[0.23460378,0.00087731227,0.0036476033,0.002500789,0.004202637,0.004675321,0.0041010664,0.0042798826,0.0010254639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008113675,0.0002621489,0.033401012,0.00083974574,0.0033924347,0.0004893016,0.0014435346,0.6868178,0.003720063,0.07472612,0.0028434196,0.19125299],"study_design_scores_gemma":[0.00011279357,0.000568157,0.011286299,0.00027620606,0.0004022026,0.000317356,0.0002481287,0.8867111,0.0011493374,0.09634479,0.0024983513,0.000085272775],"about_ca_topic_score_codex":0.0054943087,"about_ca_topic_score_gemma":0.0055909804,"teacher_disagreement_score":0.08972578,"about_ca_system_score_codex":0.00146116,"about_ca_system_score_gemma":0.0018512876,"threshold_uncertainty_score":0.47452092},"labels":[],"label_agreement":null},{"id":"W4302343786","doi":"10.1007/978-3-642-17508-4","title":"Learning Classifier Systems","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Classifier (UML); Artificial intelligence; Computer science","score_opus":0.012436757185495206,"score_gpt":0.24047724926240355,"score_spread":0.22804049207690835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302343786","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009503432,0.0046001147,0.939965,0.001286325,0.000982818,0.00017198958,0.00056195515,0.002891831,0.040036485],"genre_scores_gemma":[0.2559618,0.006044311,0.5806965,0.0009762706,0.0013048704,0.0005078799,0.0044804965,0.00072495634,0.14930293],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936706,0.00010061451,0.00004014539,0.00022744627,0.00022233135,0.000042462198],"domain_scores_gemma":[0.99918324,0.0003037154,0.00002913862,0.00025224677,0.00020609921,0.000025514119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008935626,0.00066345546,0.0008937079,0.0009480642,0.0007481392,0.0020981599,0.0012508503,0.0011341453,0.017964838],"category_scores_gemma":[0.00340851,0.0004285296,0.0006846622,0.0009545448,0.0006635304,0.002813814,0.0013269711,0.0016748608,0.01032196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005871712,0.000058165246,0.0007129312,0.00018826607,0.00007300819,0.000071549526,0.00011069291,0.015480388,0.0051125786,0.08510876,0.035324294,0.8577008],"study_design_scores_gemma":[0.000026436706,0.00013373823,0.000971904,0.0001628747,0.00011219073,0.0004960415,0.00010075739,0.42278835,0.014050301,0.3823301,0.17878452,0.00004282434],"about_ca_topic_score_codex":0.00081764255,"about_ca_topic_score_gemma":0.00122625,"teacher_disagreement_score":0.017964838,"about_ca_system_score_codex":0.0006076382,"about_ca_system_score_gemma":0.00063836103,"threshold_uncertainty_score":0.06009835},"labels":[],"label_agreement":null},{"id":"W4308272241","doi":"10.21203/rs.3.rs-2208846/v1","title":"Evolutionary design of swing-up controllers for stabilization task of underactuated inverted pendulums","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Holland Bloorview Kids Rehabilitation Hospital","funders":"","keywords":"Underactuation; Inverted pendulum; Genetic programming; Control theory (sociology); Control engineering; Computer science; Nonlinear system; Set (abstract data type); Nonlinear control; Controller (irrigation); Fitness function; Process (computing); Genetic algorithm; Artificial intelligence; Engineering; Control (management); Machine learning","score_opus":0.11388763413710282,"score_gpt":0.38418929037160443,"score_spread":0.27030165623450164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308272241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29201698,0.00017944194,0.6964608,0.000153828,0.00004771304,0.00014716665,0.00003749749,0.0002736874,0.010682904],"genre_scores_gemma":[0.9739556,0.000047211313,0.024633942,0.000019420548,0.000004352154,0.00008462242,0.000017011802,0.000008339405,0.0012295024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998766,0.000024119185,0.000006163982,0.00002325668,0.00004343437,0.000026432257],"domain_scores_gemma":[0.9998337,0.000046006004,0.000039391307,0.000014346005,0.00005312066,0.000013409838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030497974,0.00037849697,0.00033390083,0.00033697512,0.00027589052,0.00048866856,0.0004983119,0.0004418616,0.0012918144],"category_scores_gemma":[0.00059670885,0.0001852683,0.00028107146,0.00016028578,0.00035029883,0.00016389921,0.0004692097,0.00033154056,0.00011037748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007347189,0.00008320408,0.00084733753,0.00009753748,0.000048896785,0.0002405327,0.00015885147,0.9030057,0.04204071,0.011416965,0.00030540113,0.04168127],"study_design_scores_gemma":[0.000011103729,0.00009849755,0.00024524538,0.000006363365,0.000009985805,0.00001771145,0.000011495828,0.9949994,0.0031661296,0.00089687784,0.000533456,0.0000036999495],"about_ca_topic_score_codex":0.0016739012,"about_ca_topic_score_gemma":0.0012078292,"teacher_disagreement_score":0.0016739012,"about_ca_system_score_codex":0.00032329437,"about_ca_system_score_gemma":0.00044193782,"threshold_uncertainty_score":0.0043215156},"labels":[],"label_agreement":null},{"id":"W4308594125","doi":"10.31234/osf.io/5tzph","title":"How a Generation Was Misled About Natural Selection (Natural Selection: How it Works, How it Applies to Culture)","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Natural selection; Natural (archaeology); Selection (genetic algorithm); Cultural transmission in animals; Process (computing); Darwinism; Adaptation (eye); Protocell; Computer science; Biology; Evolutionary biology; Artificial intelligence; Paleontology; Genetics","score_opus":0.017775267760908958,"score_gpt":0.25450726524025963,"score_spread":0.23673199747935067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308594125","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17605132,0.06025638,0.1839919,0.2411454,0.0119359875,0.00013064711,0.00043467668,0.0006017991,0.32545185],"genre_scores_gemma":[0.858259,0.014872403,0.032417256,0.019500662,0.0011425164,0.00010688927,0.00014498796,0.00041297244,0.073143296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976261,0.0012829386,0.00007398018,0.0004854192,0.0003405598,0.00019092254],"domain_scores_gemma":[0.99811894,0.0008308575,0.00014129243,0.00039092317,0.00037568333,0.00014232825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033184432,0.00032357345,0.00030419132,0.000819936,0.002987914,0.006456762,0.00065610075,0.0027103904,0.0024231097],"category_scores_gemma":[0.00914097,0.00027333832,0.00039134893,0.00059754745,0.0142374225,0.009982034,0.0021340724,0.0036356705,0.00095911615],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005110141,0.000020330885,0.001737105,0.000082357605,0.000033862958,0.0003026355,0.0090407375,0.0009891272,0.00092849834,0.9313528,0.0109523535,0.04450906],"study_design_scores_gemma":[0.000016364997,0.00004320728,0.0011446269,0.00020953928,0.00002672074,0.0006673131,0.0033155698,0.0011289344,0.0015184731,0.72230285,0.26955613,0.000070224094],"about_ca_topic_score_codex":0.0034324473,"about_ca_topic_score_gemma":0.0024312807,"teacher_disagreement_score":0.006456762,"about_ca_system_score_codex":0.0020424898,"about_ca_system_score_gemma":0.0012955873,"threshold_uncertainty_score":0.017549813},"labels":[],"label_agreement":null},{"id":"W4310375416","doi":"10.1007/s10710-022-09446-8","title":"Benchmarking ensemble genetic programming with a linked list external memory on scalable partially observable tasks","year":2022,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Benchmarking; Computer science; Observable; Scalability; Operator (biology); State (computer science); Artificial intelligence; Machine learning; Set (abstract data type); Genetic programming; Identification (biology); Algorithm; Programming language","score_opus":0.013273359654309161,"score_gpt":0.2288545776728534,"score_spread":0.21558121801854424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310375416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9204996,0.000973147,0.06250623,0.00074457395,0.0004020394,0.00014369807,0.00082383497,0.0037055537,0.010201357],"genre_scores_gemma":[0.9554749,0.00013174352,0.040522974,0.00016142738,0.000047642858,0.00014301768,0.0015266688,0.0002073842,0.0017842831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988961,0.00042233482,0.00006186135,0.00022007222,0.00018639243,0.00021320085],"domain_scores_gemma":[0.99495304,0.0032187907,0.00013035897,0.00068280287,0.0007078372,0.00030723022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017444721,0.0012173094,0.0012203448,0.00067426666,0.0006580176,0.00096049294,0.001993386,0.0022942524,0.0038112823],"category_scores_gemma":[0.0075917165,0.000522549,0.00075307756,0.0010416022,0.00081529183,0.001516789,0.0012267021,0.0021002055,0.00057921547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004707977,0.00031031814,0.0010816474,0.000088355264,0.00009548499,0.00006015975,0.000031978372,0.9694809,0.0006744461,0.0014752803,0.0021669318,0.024063729],"study_design_scores_gemma":[0.000051063984,0.00007916582,0.00019387165,0.0000038130163,0.000009732728,0.000004670616,0.00001294289,0.99826103,0.00047408728,0.0007570704,0.00014892325,0.0000036415577],"about_ca_topic_score_codex":0.013843121,"about_ca_topic_score_gemma":0.013302203,"teacher_disagreement_score":0.013843121,"about_ca_system_score_codex":0.0011371841,"about_ca_system_score_gemma":0.0022543182,"threshold_uncertainty_score":0.027525067},"labels":[],"label_agreement":null},{"id":"W4312472887","doi":"10.1109/access.2022.3225435","title":"Facing Up Fare War: Generating Competitive Price Models With Gene Expression Programming","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"European Regional Development Fund; Ministerio de Ciencia e Innovación","keywords":"Gene expression programming; Computer science; Genetic programming; Artificial intelligence","score_opus":0.03221900081480514,"score_gpt":0.2765023299847848,"score_spread":0.24428332916997966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312472887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2557298,0.0004471246,0.7350404,0.001145363,0.00011469396,0.00018923946,0.00049759675,0.0014217215,0.0054140254],"genre_scores_gemma":[0.8159645,0.00015978594,0.17913483,0.00034591267,0.000049993003,0.00025641528,0.0009851048,0.00013868298,0.0029646782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953234,0.00017667937,0.00001700601,0.00012266968,0.00008811255,0.000063178784],"domain_scores_gemma":[0.9974031,0.0021983332,0.00010339125,0.000056914752,0.0001955375,0.00004265516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402871,0.0009834362,0.00077864935,0.0010219871,0.0004452566,0.0012699775,0.0013460142,0.0013855783,0.0019819604],"category_scores_gemma":[0.0047390084,0.00046817897,0.00095167477,0.000947656,0.00061871985,0.0006044665,0.0005927187,0.0014726907,0.00047182178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067008856,0.00009288799,0.0024942728,0.000031159572,0.00003454199,0.00009026164,0.00006433046,0.95673406,0.00050548295,0.0025987308,0.00081100175,0.03647631],"study_design_scores_gemma":[0.0000025777595,0.000009937263,0.0001050536,0.0000018848593,0.00000258953,0.000005662092,0.000009485259,0.9983663,0.00014421895,0.0012525158,0.00009792127,0.000001974321],"about_ca_topic_score_codex":0.009399096,"about_ca_topic_score_gemma":0.007932258,"teacher_disagreement_score":0.009399096,"about_ca_system_score_codex":0.001118332,"about_ca_system_score_gemma":0.0006875841,"threshold_uncertainty_score":0.018688738},"labels":[],"label_agreement":null},{"id":"W4320855027","doi":"10.48550/arxiv.2302.06548","title":"Automatic Noise Filtering with Dynamic Sparse Training in Deep Reinforcement Learning","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Noise (video); Focus (optics); Task (project management); Artificial intelligence; Margin (machine learning); Robot; Code (set theory); Machine learning; Deep learning; Pattern recognition (psychology); Set (abstract data type)","score_opus":0.0645443691250533,"score_gpt":0.19874993150394174,"score_spread":0.13420556237888842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320855027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025660593,0.00028747303,0.96970683,0.00036729348,0.000060343988,0.00005239563,0.000082053426,0.0017918672,0.0019911535],"genre_scores_gemma":[0.8082381,0.00018067838,0.18746287,0.00041641618,0.000061954684,0.00020612052,0.00026471927,0.00020818556,0.0029608838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995073,0.0001486741,0.000023030663,0.000120903926,0.00012011175,0.00008002305],"domain_scores_gemma":[0.99843436,0.0009585708,0.00015419607,0.0001664099,0.00019052679,0.000095811745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013479058,0.0010004335,0.0009209219,0.00028022967,0.00035717216,0.0006544346,0.0016275259,0.0010460224,0.0019629474],"category_scores_gemma":[0.0055550565,0.0004835323,0.00043462016,0.00031752966,0.0012327154,0.0011511133,0.0012518484,0.0024367778,0.0004284716],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010861658,0.00009264244,0.0008877908,0.00006240943,0.0000323392,0.000051994517,0.00005477076,0.9295664,0.0022730608,0.009036077,0.0016605322,0.056173354],"study_design_scores_gemma":[0.000010105011,0.00001593515,0.000032596454,0.000003718025,0.0000024924602,0.0000044972876,0.0000022968059,0.99614465,0.00043057415,0.0031551989,0.00019565075,0.0000023830469],"about_ca_topic_score_codex":0.0077112988,"about_ca_topic_score_gemma":0.009594936,"teacher_disagreement_score":0.0077112988,"about_ca_system_score_codex":0.0010527981,"about_ca_system_score_gemma":0.0015666388,"threshold_uncertainty_score":0.015332818},"labels":[],"label_agreement":null},{"id":"W4323967467","doi":"10.1007/978-981-19-8460-0_4","title":"Genetic Programming for Interpretable and Explainable Machine Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Interpretability; Genetic programming; Artificial intelligence; Machine learning; Computer science; Field (mathematics); Mathematics","score_opus":0.015279925989371296,"score_gpt":0.2302078721210929,"score_spread":0.2149279461317216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323967467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033818597,0.00611031,0.9162273,0.0013308587,0.000353864,0.000039588747,0.00012636976,0.00056195096,0.071867816],"genre_scores_gemma":[0.16020241,0.010350527,0.7381358,0.00059788616,0.0005644213,0.00026257415,0.00045552393,0.0006296616,0.08880112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998368,0.000045853936,0.0000068956683,0.000028087024,0.00007210397,0.000010175677],"domain_scores_gemma":[0.999754,0.00017469288,0.000010393737,0.00003457575,0.000021353897,0.000005032908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551134,0.0006199267,0.00044729796,0.00036680175,0.00020401143,0.0010002371,0.0010028649,0.0010676389,0.0074171205],"category_scores_gemma":[0.0012183256,0.0002904412,0.0005142733,0.0007205523,0.0014276713,0.0012713573,0.0005842608,0.0018398855,0.0011650709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008453379,0.000017342909,0.0000545421,0.0001765158,0.00001744025,0.00007670016,0.00011162426,0.056420308,0.0016173219,0.8253957,0.008131967,0.1079721],"study_design_scores_gemma":[0.000005569946,0.000007350935,0.00007565031,0.0000645163,0.000008107819,0.000063494204,0.000017784996,0.08622237,0.0008858992,0.87519133,0.037448462,0.000009543365],"about_ca_topic_score_codex":0.0009297932,"about_ca_topic_score_gemma":0.0011979282,"teacher_disagreement_score":0.0074171205,"about_ca_system_score_codex":0.0007581172,"about_ca_system_score_gemma":0.00040940213,"threshold_uncertainty_score":0.024812698},"labels":[],"label_agreement":null},{"id":"W4360798737","doi":"10.1016/j.cam.2023.115225","title":"A new deterministic PSO algorithm for real-time systems implemented on low-power devices","year":2023,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Algorithm; Realization (probability); Flexibility (engineering); Block (permutation group theory); Emulation; Function (biology); Computer science; Mathematical optimization; Mathematics","score_opus":0.0171070896693709,"score_gpt":0.2817058613901625,"score_spread":0.2645987717207916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360798737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010051526,0.0004095322,0.9827818,0.00013297351,0.00023515504,0.000052252013,0.00002845931,0.00055427884,0.0057539684],"genre_scores_gemma":[0.34300128,0.00039985252,0.6478434,0.00015751956,0.00011199142,0.00023523856,0.00012261179,0.0001246169,0.008003388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978644,0.000046008172,0.000012737479,0.00003415081,0.000101568745,0.000019118523],"domain_scores_gemma":[0.9997998,0.00006569251,0.000019754098,0.000028019636,0.000073569456,0.0000132035675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027378954,0.0004760063,0.00064777135,0.0002496587,0.00036152216,0.00061289035,0.00088977936,0.00064212224,0.0024040374],"category_scores_gemma":[0.0008092915,0.000247671,0.00046384567,0.00035447336,0.00021235216,0.00040658336,0.0004208648,0.0005652274,0.00048347196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011586646,0.00007475325,0.00068433397,0.00020058382,0.00010762681,0.00012512463,0.00006234821,0.74281955,0.012126501,0.012603272,0.0038165895,0.22726347],"study_design_scores_gemma":[0.000017400966,0.000028992274,0.0001274477,0.0000037456923,0.000009151946,0.000025264393,0.0000025755526,0.99712926,0.0005234849,0.00046257296,0.0016655708,0.000004573999],"about_ca_topic_score_codex":0.0030656194,"about_ca_topic_score_gemma":0.00468467,"teacher_disagreement_score":0.0030656194,"about_ca_system_score_codex":0.00030551403,"about_ca_system_score_gemma":0.0006788549,"threshold_uncertainty_score":0.008042276},"labels":[],"label_agreement":null},{"id":"W4360897297","doi":"10.2139/ssrn.4321420","title":"An Individual Evolutionary Learning Model Meets Cournot","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cournot competition; Computer science; Economics; Artificial intelligence; Mathematical economics","score_opus":0.015018501455154392,"score_gpt":0.26498052890551677,"score_spread":0.24996202745036236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360897297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086384766,0.00033405254,0.8380908,0.0033612507,0.00023783714,0.00006837941,0.00012851169,0.00023704483,0.07115745],"genre_scores_gemma":[0.9114428,0.0003385479,0.04506957,0.00030649302,0.00013603452,0.000114598864,0.00007486905,0.00007060353,0.04244648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934775,0.00029075588,0.000018155059,0.00013349835,0.0001090687,0.00010070702],"domain_scores_gemma":[0.9980501,0.0012432297,0.00017912035,0.00013317558,0.00020006976,0.00019423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795801,0.000747538,0.0011678404,0.00046185695,0.0009427906,0.0023313076,0.0016269028,0.0029096068,0.0112923905],"category_scores_gemma":[0.0057529514,0.0003871121,0.0007117969,0.00072621723,0.0014692422,0.0027287197,0.0015273155,0.0022759498,0.0010048964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004818905,0.00003875387,0.00043964194,0.000044160668,0.000033052074,0.00019548179,0.00012565874,0.262295,0.0002868156,0.72161204,0.0021664219,0.012714779],"study_design_scores_gemma":[0.00002022133,0.00004097994,0.0000932502,0.000006864501,0.000009299936,0.00004866952,0.000026032341,0.6545224,0.0000696042,0.3434096,0.0017423251,0.000010792704],"about_ca_topic_score_codex":0.0025391649,"about_ca_topic_score_gemma":0.0016318447,"teacher_disagreement_score":0.0112923905,"about_ca_system_score_codex":0.0013655475,"about_ca_system_score_gemma":0.0010827766,"threshold_uncertainty_score":0.037776828},"labels":[],"label_agreement":null},{"id":"W4361767974","doi":"10.1007/978-3-031-29573-7_4","title":"Phenotype Search Trajectory Networks for Linear Genetic Programming","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Phenotype; Genetic programming; Trajectory; Graph; Genotype-phenotype distinction; Theoretical computer science; Artificial intelligence; Biology; Gene; Genetics","score_opus":0.029315099092381978,"score_gpt":0.27389622426426324,"score_spread":0.24458112517188127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361767974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066282637,0.00038774958,0.9783999,0.00029991296,0.000058518486,0.0000436637,0.000080489015,0.00020258225,0.013898917],"genre_scores_gemma":[0.3628059,0.0013604575,0.58335626,0.00026169815,0.00010092601,0.000671662,0.0004557229,0.00043653746,0.05055085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998323,0.0000668328,0.000006260248,0.000032035186,0.000045542598,0.000016962773],"domain_scores_gemma":[0.9995622,0.00030440977,0.00003099347,0.000025064639,0.000057443165,0.000019842893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547015,0.0006168728,0.00059715577,0.00055192364,0.00040145326,0.0008966903,0.0011592971,0.0011127113,0.009581619],"category_scores_gemma":[0.0026349376,0.00040329545,0.0004687032,0.0008605878,0.0007011714,0.0009586812,0.0011758019,0.00154513,0.0011171295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019911944,0.000018883364,0.0001256731,0.00004774341,0.000012395495,0.000025185393,0.000037747694,0.854739,0.00058430416,0.08935725,0.0016898116,0.053342044],"study_design_scores_gemma":[0.000002716771,0.000005857468,0.000020389174,0.000009177116,0.0000017526411,0.000005850238,0.0000044022668,0.97036,0.00010022361,0.0286306,0.0008569845,0.0000019960394],"about_ca_topic_score_codex":0.0051887827,"about_ca_topic_score_gemma":0.004664038,"teacher_disagreement_score":0.009581619,"about_ca_system_score_codex":0.0013230313,"about_ca_system_score_gemma":0.0007242599,"threshold_uncertainty_score":0.03205371},"labels":[],"label_agreement":null},{"id":"W4361770952","doi":"10.1007/978-3-031-29573-7_9","title":"A Boosting Approach to Constructing an Ensemble Stack","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Boosting (machine learning); Computer science; Residual; Interpretability; Genetic programming; Ensemble learning; Benchmarking; Machine learning; Artificial intelligence; Classifier (UML); Data mining; Algorithm","score_opus":0.03509581858218008,"score_gpt":0.2648130078073741,"score_spread":0.22971718922519402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361770952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003633175,0.00021155865,0.99338806,0.0000650392,0.00005673578,0.000028654295,0.000033016826,0.0003796195,0.0022041101],"genre_scores_gemma":[0.1266528,0.00046439408,0.86246675,0.00021701337,0.00023312107,0.00017820585,0.00035671348,0.0003662724,0.009064681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990007,0.00026385425,0.000054520744,0.000171992,0.00038531894,0.00012355791],"domain_scores_gemma":[0.99859756,0.00049958826,0.00005277245,0.00025925442,0.00050559686,0.00008523082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023793401,0.00092513143,0.0015943456,0.0013100405,0.0011229255,0.0014930661,0.0028661992,0.0017461035,0.0049158116],"category_scores_gemma":[0.0036844604,0.0008436414,0.0016477056,0.0015279127,0.0006868047,0.0022701165,0.0024102873,0.0026389481,0.0017783814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015285493,0.00015390826,0.0011434607,0.00012042761,0.00024773282,0.00010518107,0.00012361618,0.34637648,0.010637178,0.08787161,0.008326521,0.5447411],"study_design_scores_gemma":[0.0000058524015,0.000038418908,0.00015932108,0.00001470867,0.00003782858,0.000047357888,0.000009963762,0.96600527,0.0020710637,0.028590584,0.0030078618,0.000011772717],"about_ca_topic_score_codex":0.0022606892,"about_ca_topic_score_gemma":0.0033055018,"teacher_disagreement_score":0.0049158116,"about_ca_system_score_codex":0.00065211975,"about_ca_system_score_gemma":0.0008368384,"threshold_uncertainty_score":0.016444981},"labels":[],"label_agreement":null},{"id":"W4379801796","doi":"10.1002/cjs.11775","title":"Objective model selection with parallel genetic algorithms using an eradication strategy","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; HEC Montréal","keywords":"Feature selection; Selection (genetic algorithm); Computer science; Model selection; Machine learning; Genetic algorithm; Artificial intelligence; Population; Algorithm; Feature (linguistics)","score_opus":0.03842926554301982,"score_gpt":0.2630375572372838,"score_spread":0.22460829169426397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379801796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067495696,0.000175167,0.9293288,0.00036745932,0.00002867866,0.00014720383,0.00002306013,0.0005023649,0.0019316152],"genre_scores_gemma":[0.66379553,0.000112862646,0.33279088,0.00032280444,0.00006816398,0.00050886197,0.00012717521,0.00015897374,0.0021147707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979572,0.001237666,0.00006885618,0.00017692661,0.00041592433,0.0001433666],"domain_scores_gemma":[0.9941056,0.0043621645,0.00037469892,0.00029393955,0.00069263834,0.00017094956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005704458,0.0014525205,0.0017082716,0.0018158703,0.0008808979,0.0011107023,0.0019162712,0.0014502655,0.0013723202],"category_scores_gemma":[0.009285815,0.00064643886,0.000996817,0.0011580703,0.0016713645,0.001029848,0.0018380361,0.0018147927,0.00029348503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008788559,0.00009770184,0.0010453014,0.000017789536,0.000063616746,0.00007236831,0.000062314626,0.95535314,0.0006931476,0.008699733,0.00035433535,0.033452712],"study_design_scores_gemma":[0.000017597476,0.00001928343,0.000046776382,0.0000020732232,0.0000047575327,0.000006023653,0.0000031743814,0.99762326,0.00010769957,0.0021061602,0.00006095638,0.0000022458103],"about_ca_topic_score_codex":0.0063629462,"about_ca_topic_score_gemma":0.004376276,"teacher_disagreement_score":0.0063629462,"about_ca_system_score_codex":0.0014411776,"about_ca_system_score_gemma":0.0017675944,"threshold_uncertainty_score":0.030168414},"labels":[],"label_agreement":null},{"id":"W4384663720","doi":"10.1162/artl_a_00407","title":"Does the Field of Nature-Inspired Computing Contribute to Achieving Lifelike Features?","year":2023,"lang":"en","type":"article","venue":"Artificial Life","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Field (mathematics); Artificial intelligence; Artificial life; Ubiquitous computing; Human–computer interaction; Data science; Mathematics","score_opus":0.011618171340337848,"score_gpt":0.2894958695313705,"score_spread":0.2778776981910327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384663720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041992705,0.21299434,0.29576144,0.18315707,0.008740144,0.000152396,0.00013281482,0.0005056133,0.25656357],"genre_scores_gemma":[0.5993189,0.18596295,0.16758619,0.017312609,0.006296797,0.00024287579,0.00012391107,0.00019521816,0.02296054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.00027702033,0.000029249788,0.00009319263,0.00026447736,0.00008148539],"domain_scores_gemma":[0.9970521,0.001874456,0.00016141392,0.00033302547,0.0004181908,0.0001609167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018081521,0.00041709805,0.000528034,0.0007864798,0.0011374647,0.003468455,0.0008941444,0.002488398,0.003002518],"category_scores_gemma":[0.0044456036,0.00024694004,0.0005970545,0.000949602,0.0047273547,0.0077035595,0.0012826059,0.0029202143,0.0011747635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035283407,0.0000787194,0.0010133696,0.0007008306,0.000030734085,0.00011436099,0.00048775217,0.0015654155,0.0013989796,0.87668073,0.008048967,0.10984497],"study_design_scores_gemma":[0.000017612429,0.000101646314,0.00070328586,0.0005099775,0.000032862044,0.0004598247,0.00068414595,0.0064662453,0.0018871743,0.77204734,0.21704935,0.000040627805],"about_ca_topic_score_codex":0.0003373668,"about_ca_topic_score_gemma":0.0003463297,"teacher_disagreement_score":0.003468455,"about_ca_system_score_codex":0.0007205173,"about_ca_system_score_gemma":0.00091493136,"threshold_uncertainty_score":0.0100444555},"labels":[],"label_agreement":null},{"id":"W4385216284","doi":"10.1145/3583133.3596356","title":"Gaggle: Genetic Algorithms on the GPU using PyTorch","year":2023,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Computer science; Scalability; Usability; Interface (matter); Artificial intelligence; Artificial neural network; Deep learning; Neuroevolution; Parallel computing; Machine learning; Computer architecture; Human–computer interaction; Operating system","score_opus":0.053250387202081854,"score_gpt":0.2889604164032335,"score_spread":0.23571002920115164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385216284","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015486845,0.0010100817,0.7143483,0.00084000104,0.00046087074,0.00016489666,0.0029326591,0.23923016,0.025526233],"genre_scores_gemma":[0.1553441,0.0011351665,0.76484424,0.0011689065,0.0001223443,0.000981663,0.007696,0.0518484,0.016859107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992623,0.00016802055,0.00005264325,0.00012324727,0.00028380562,0.000110042485],"domain_scores_gemma":[0.99835336,0.0008411351,0.00007629888,0.00033578745,0.0002850536,0.00010841425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011818577,0.0012610159,0.0012390394,0.0010270948,0.00063109276,0.0021134787,0.0038102746,0.0018355236,0.029354373],"category_scores_gemma":[0.006924505,0.00083016406,0.0014473536,0.0017995678,0.0010276287,0.0025451705,0.0020305058,0.0039777467,0.010806571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080994,0.00031301848,0.004255511,0.0014333129,0.0004098169,0.000708116,0.0006495978,0.24642642,0.012378633,0.07770007,0.2823044,0.37261117],"study_design_scores_gemma":[0.00045423605,0.00008900837,0.0009454348,0.00013817199,0.00004863299,0.0002469589,0.00007810962,0.81698555,0.01419938,0.059193164,0.10752721,0.000094151095],"about_ca_topic_score_codex":0.005275035,"about_ca_topic_score_gemma":0.0053129387,"teacher_disagreement_score":0.029354373,"about_ca_system_score_codex":0.0011064411,"about_ca_system_score_gemma":0.0018614216,"threshold_uncertainty_score":0.09820014},"labels":[],"label_agreement":null},{"id":"W4385282513","doi":"10.1109/icde55515.2023.00364","title":"MMCo-Clus – An Evolutionary Co-clustering Algorithm for Gene Selection (Extended abstract)","year":2023,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cluster analysis; Selection (genetic algorithm); Gene selection; Selection algorithm; Gene; Algorithm; Artificial intelligence; Biology; Genetics; Gene expression; Microarray analysis techniques","score_opus":0.02534786924191622,"score_gpt":0.29872157663116744,"score_spread":0.2733737073892512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385282513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013542839,0.0003386925,0.9835671,0.00018529691,0.000091721544,0.0000832133,0.00011404028,0.00087855273,0.0011983898],"genre_scores_gemma":[0.14060749,0.00022220655,0.8549036,0.00018392432,0.000071957824,0.00039589452,0.00050552597,0.00025758275,0.0028519467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941325,0.00012491638,0.000028584442,0.00014321283,0.00023960478,0.000050435803],"domain_scores_gemma":[0.99948055,0.00017207969,0.00004778968,0.00005699431,0.00020867544,0.000033951976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077092217,0.00084961264,0.0010288924,0.0013606598,0.0008377275,0.0007739666,0.0012132614,0.000942523,0.0021847861],"category_scores_gemma":[0.0017937312,0.00034351787,0.00091715704,0.0018877714,0.00051621813,0.00053587934,0.000996386,0.0010103269,0.0005684437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002494047,0.00017974828,0.0039590793,0.00023364696,0.00037393012,0.0002603179,0.00019221823,0.344523,0.025977317,0.0131917745,0.010964162,0.5998955],"study_design_scores_gemma":[0.000025132693,0.000053162745,0.0007459703,0.000011159884,0.00002445196,0.00009713623,0.00002255806,0.98714674,0.0046084514,0.0037333816,0.003513637,0.000018239436],"about_ca_topic_score_codex":0.0046437127,"about_ca_topic_score_gemma":0.0057119327,"teacher_disagreement_score":0.0046437127,"about_ca_system_score_codex":0.00057380256,"about_ca_system_score_gemma":0.0011522768,"threshold_uncertainty_score":0.0092333555},"labels":[],"label_agreement":null},{"id":"W4385573703","doi":"10.18653/v1/2022.findings-emnlp.114","title":"Text Editing as Imitation Game","year":2022,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Security token; Decoding methods; Artificial intelligence; Sequence (biology); Robustness (evolution); Reinforcement learning; Sequence learning; Encoding (memory); Natural language processing; Theoretical computer science; Algorithm","score_opus":0.013058678216677172,"score_gpt":0.24589753300885053,"score_spread":0.23283885479217337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385573703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045565024,0.00024233892,0.93608105,0.0009743848,0.0001609193,0.0002267833,0.00023504003,0.0020634138,0.014451025],"genre_scores_gemma":[0.7890571,0.00021840504,0.18403655,0.00040550268,0.00006747572,0.00040250286,0.00035505937,0.00034123866,0.025116194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987532,0.00039416176,0.000067819434,0.00038886903,0.00029107602,0.0001047483],"domain_scores_gemma":[0.99628603,0.0026015993,0.00025721238,0.0003887326,0.0002810385,0.00018533327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013024954,0.00088695856,0.0008695787,0.00039862838,0.0004608969,0.0011539299,0.0019282022,0.0014945072,0.006688358],"category_scores_gemma":[0.008793627,0.00035460264,0.00065125985,0.0003398894,0.0015302546,0.002171242,0.0015072348,0.0017276298,0.0011392279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025823497,0.0002556968,0.0015128881,0.00025545756,0.00007463446,0.0007469937,0.000563644,0.6985218,0.016384868,0.13411888,0.0057642446,0.14154272],"study_design_scores_gemma":[0.000018151637,0.000036882404,0.000099816774,0.0000082986,0.000008609311,0.000060397473,0.000017522007,0.9686716,0.0018016082,0.027051575,0.0022133728,0.000012149496],"about_ca_topic_score_codex":0.003110995,"about_ca_topic_score_gemma":0.0032338952,"teacher_disagreement_score":0.006688358,"about_ca_system_score_codex":0.00087300746,"about_ca_system_score_gemma":0.0011905386,"threshold_uncertainty_score":0.022374809},"labels":[],"label_agreement":null},{"id":"W4386902952","doi":"10.1162/isal_a_00664","title":"Finding Sparse Initialisations using Neuroevolutionary Ticket Search (NeTS)","year":2023,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"UK Research and Innovation","keywords":"Ticket; Computer science; Computer network","score_opus":0.1289051437679396,"score_gpt":0.33602778849513965,"score_spread":0.20712264472720004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386902952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12275536,0.0007713994,0.86718917,0.0005425074,0.00015859312,0.0001674004,0.00013423499,0.0012598739,0.0070215324],"genre_scores_gemma":[0.58507925,0.00044192848,0.4066102,0.00052406633,0.000064996915,0.0005075222,0.0005436663,0.00051880215,0.005709527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995535,0.00013662208,0.000031490876,0.0001127093,0.0001019964,0.000063684885],"domain_scores_gemma":[0.99742043,0.0018312451,0.00021426663,0.00017089261,0.00024004553,0.00012309238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015148543,0.0012100051,0.0013385479,0.0011837397,0.00060978596,0.0008678946,0.0014406644,0.0016928174,0.0041638156],"category_scores_gemma":[0.009144905,0.00074803684,0.0008314783,0.00071497384,0.0012966581,0.001416108,0.002027507,0.0017923488,0.0006300534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013739026,0.00009378203,0.0033865238,0.0001250795,0.000106420375,0.00018091137,0.00021735733,0.8703052,0.0031402458,0.02069426,0.0026403568,0.09897256],"study_design_scores_gemma":[0.00002801736,0.00005631225,0.0001634529,0.000028206206,0.000018907409,0.00003838031,0.000046641813,0.988277,0.0006441324,0.00959942,0.0010908672,0.000008670993],"about_ca_topic_score_codex":0.0029254227,"about_ca_topic_score_gemma":0.0054788874,"teacher_disagreement_score":0.0041638156,"about_ca_system_score_codex":0.00091919623,"about_ca_system_score_gemma":0.0010325708,"threshold_uncertainty_score":0.013929307},"labels":[],"label_agreement":null},{"id":"W4386919946","doi":"10.1109/icaiss58487.2023.10250749","title":"Artificial Intelligence for Development of Variable Power Biomedical Electronics Gadgets Applications","year":2023,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Electronics; Power electronics; Variable (mathematics); Computer science; Power (physics); Electrical engineering; Engineering; Voltage","score_opus":0.02995225608399267,"score_gpt":0.29740776866959845,"score_spread":0.2674555125856058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919946","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03446326,0.04810883,0.4198748,0.008482792,0.0014394503,0.00029930178,0.00014051443,0.0009044072,0.4862867],"genre_scores_gemma":[0.40412155,0.055156443,0.3759651,0.001739706,0.0005083201,0.00032307234,0.00029131284,0.0002104741,0.16168399],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996972,0.00006662403,0.00001656598,0.000037241123,0.0001603253,0.00002209774],"domain_scores_gemma":[0.9997869,0.000079567464,0.000018537421,0.000020640386,0.00007639992,0.000017870532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057497877,0.0003032994,0.00018985929,0.00076081307,0.00033328577,0.001337429,0.00058187474,0.000749958,0.0047474476],"category_scores_gemma":[0.00096771494,0.00015799268,0.0003224857,0.00059414544,0.0004537427,0.00094003964,0.0006908249,0.0007097759,0.0017261255],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062297426,0.00009152491,0.0010351246,0.0007921132,0.00002830026,0.00047988567,0.00057702826,0.0095311785,0.0295331,0.2919935,0.017251896,0.6486241],"study_design_scores_gemma":[0.000019577,0.0002467498,0.00218321,0.00069371983,0.00004375651,0.0012582637,0.00038081198,0.043193445,0.027275207,0.09735072,0.8273176,0.00003700021],"about_ca_topic_score_codex":0.00025150622,"about_ca_topic_score_gemma":0.00048338488,"teacher_disagreement_score":0.0047474476,"about_ca_system_score_codex":0.00044173104,"about_ca_system_score_gemma":0.0005909878,"threshold_uncertainty_score":0.015881777},"labels":[],"label_agreement":null},{"id":"W4387005942","doi":"10.1109/cec53210.2023.10254093","title":"Increasing Features in MAP-Elites Using an Age-Layered Population Structure","year":2023,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Feature (linguistics); Population; Computer science; Grid; Set (abstract data type); Genetic algorithm; Layer (electronics); Feature vector; Space (punctuation); Artificial intelligence; Algorithm; Theoretical computer science; Data mining; Mathematics; Machine learning; Materials science","score_opus":0.02554115033438046,"score_gpt":0.28984046312766387,"score_spread":0.2642993127932834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387005942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13011418,0.00039239594,0.85959613,0.0003793397,0.00007818713,0.00014682362,0.000108072796,0.00091963675,0.008265105],"genre_scores_gemma":[0.6559444,0.00024512273,0.33783823,0.00027142125,0.000063476095,0.00029952044,0.00024094831,0.00012752609,0.004969341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993825,0.00018403641,0.000039228107,0.00009298758,0.00020876287,0.000092583374],"domain_scores_gemma":[0.9985051,0.00055186165,0.00017891685,0.00023706,0.00039223902,0.00013482806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014479264,0.0005958737,0.0007691537,0.0011295893,0.0007192975,0.0013238776,0.0017110385,0.001010273,0.0026397465],"category_scores_gemma":[0.0051442557,0.00037249774,0.00071035005,0.0007940241,0.0006650837,0.0020148484,0.0022174697,0.0011257447,0.00057126966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018816133,0.00025133713,0.009434617,0.00014996852,0.00016562003,0.0003781526,0.00087966473,0.6328998,0.017173477,0.05392129,0.0039270325,0.28063092],"study_design_scores_gemma":[0.000045087334,0.000168532,0.00095200294,0.000023019506,0.00004533006,0.00015912873,0.00009285146,0.97566026,0.0030084965,0.015185329,0.0046351985,0.000024744419],"about_ca_topic_score_codex":0.0019952527,"about_ca_topic_score_gemma":0.002289576,"teacher_disagreement_score":0.0026397465,"about_ca_system_score_codex":0.0007132147,"about_ca_system_score_gemma":0.00080508145,"threshold_uncertainty_score":0.008830786},"labels":[],"label_agreement":null},{"id":"W4387143486","doi":"10.48550/arxiv.2309.14307","title":"A post-selection algorithm for improving dynamic ensemble selection methods","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Selection (genetic algorithm); Classifier (UML); Machine learning; Ensemble learning; Data mining; Metric (unit); Artificial intelligence; Algorithm","score_opus":0.05432604121401534,"score_gpt":0.24761642378344834,"score_spread":0.19329038256943298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387143486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066369246,0.00023254854,0.9902316,0.000083794475,0.00009286833,0.00010371579,0.000071379014,0.0014497025,0.0010975407],"genre_scores_gemma":[0.17472805,0.00026473138,0.81711125,0.00028424317,0.00030626505,0.0005062415,0.0011646575,0.0006607554,0.0049738283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996126,0.0010541921,0.00022422003,0.0006585217,0.001668659,0.0002684937],"domain_scores_gemma":[0.9936393,0.002797494,0.00026899425,0.0010545485,0.0020442526,0.00019542873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004397392,0.0017663875,0.00203045,0.0023089885,0.0012059681,0.0012625632,0.0027194058,0.0014932225,0.0061595473],"category_scores_gemma":[0.011426717,0.00057756633,0.0014368698,0.002095814,0.00065169943,0.002091363,0.0021305305,0.0021898816,0.0023164847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002538559,0.00024026088,0.0023211567,0.00010642729,0.00023532505,0.00013795416,0.00015576687,0.21914627,0.009067654,0.009077518,0.0087500345,0.75050765],"study_design_scores_gemma":[0.000025501115,0.000108849745,0.00037471307,0.000010665601,0.000033651588,0.000057530047,0.000018178303,0.9886264,0.003009575,0.0043361075,0.0033862758,0.000012585644],"about_ca_topic_score_codex":0.002882647,"about_ca_topic_score_gemma":0.004370915,"teacher_disagreement_score":0.0061595473,"about_ca_system_score_codex":0.0007120445,"about_ca_system_score_gemma":0.0014656605,"threshold_uncertainty_score":0.023255885},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.027581158289016614,"score_gpt":0.25943459655944207,"score_spread":0.23185343827042545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387265244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060740835,0.0021115486,0.98719424,0.00016870203,0.00011280089,0.00007801903,0.000051511695,0.0003831083,0.003825944],"genre_scores_gemma":[0.13648853,0.002568158,0.853385,0.00042583674,0.0001241078,0.0007104392,0.00035833268,0.00028732698,0.005652344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949265,0.00016132383,0.00003623441,0.000079677746,0.00018726192,0.00004284087],"domain_scores_gemma":[0.99974996,0.00011842536,0.000039488656,0.000024175863,0.000052544372,0.000015479414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066495093,0.0012800737,0.0013106095,0.0012027285,0.00056978484,0.0011386864,0.0016506433,0.0016441866,0.001738324],"category_scores_gemma":[0.0012589272,0.00048648138,0.0014953619,0.0013127208,0.00068137405,0.001306814,0.0010906508,0.0015713674,0.000796383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010721286,0.00012291029,0.0010161137,0.00046439338,0.0003063142,0.00012176009,0.00011216765,0.74388736,0.010000359,0.031291947,0.0045092115,0.20806019],"study_design_scores_gemma":[0.000044641925,0.000083678315,0.00021043327,0.00004589949,0.00005404275,0.00012473586,0.000021541398,0.9771025,0.0017777301,0.006812147,0.013696289,0.000026285388],"about_ca_topic_score_codex":0.002416435,"about_ca_topic_score_gemma":0.0026637006,"teacher_disagreement_score":0.002416435,"about_ca_system_score_codex":0.0005747007,"about_ca_system_score_gemma":0.0013015207,"threshold_uncertainty_score":0.005815208},"labels":[],"label_agreement":null},{"id":"W4388134984","doi":"10.1007/978-981-99-3814-8_4","title":"Evolutionary Computation and the Reinforcement Learning Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Observability; Population; Adaptation (eye); Action selection; Evolutionary computation; Evolutionary robotics; Selection (genetic algorithm); Natural selection; Task (project management); Machine learning; Engineering; Mathematics; Agency (philosophy); Biology","score_opus":0.014655601929874309,"score_gpt":0.22384900742274824,"score_spread":0.20919340549287394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388134984","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011095089,0.061767098,0.36956373,0.0107331555,0.0020080276,0.000053783566,0.0001244228,0.00021122384,0.5444435],"genre_scores_gemma":[0.48541096,0.04476473,0.14162427,0.0019164413,0.0020838315,0.0002157403,0.00026269807,0.00023652444,0.32348478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984586,0.000057118876,0.0000052896976,0.000022913851,0.000054404903,0.000014446431],"domain_scores_gemma":[0.9997203,0.0002050737,0.000014218952,0.00002156877,0.000026249354,0.000012686714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929505,0.0004985903,0.00047918392,0.000301174,0.00034279632,0.001251905,0.0006109422,0.0011941748,0.007326353],"category_scores_gemma":[0.0013013348,0.00020455723,0.00033216667,0.0007704704,0.0015365946,0.0013896518,0.0005585641,0.0019309097,0.0009982926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013270948,0.000021643194,0.00009978254,0.0001080447,0.000014787048,0.000050921626,0.00004906247,0.040333048,0.0003552447,0.86660445,0.0146460505,0.07770364],"study_design_scores_gemma":[0.000008368138,0.000012854986,0.00016311627,0.0000683605,0.000005403098,0.00006828186,0.000025377518,0.041995034,0.00023125905,0.8980774,0.05933604,0.00000852345],"about_ca_topic_score_codex":0.0013399515,"about_ca_topic_score_gemma":0.0013540585,"teacher_disagreement_score":0.007326353,"about_ca_system_score_codex":0.00086193735,"about_ca_system_score_gemma":0.00054628664,"threshold_uncertainty_score":0.024509132},"labels":[],"label_agreement":null},{"id":"W4388486995","doi":"10.1007/s10710-023-09462-2","title":"Denoising autoencoder genetic programming: strategies to control exploration and exploitation in search","year":2023,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Johannes Gutenberg-Universität Mainz; Deutscher Akademischer Austauschdienst","keywords":"Computer science; Genetic programming; Autoencoder; Artificial intelligence; Machine learning; Sampling (signal processing); Probabilistic logic; Mathematical optimization; Artificial neural network; Mathematics","score_opus":0.023510881475824343,"score_gpt":0.2816448645220405,"score_spread":0.25813398304621615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388486995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077030085,0.0002801107,0.9187566,0.00042728466,0.000033394685,0.00004827108,0.000017529825,0.0001876307,0.003219071],"genre_scores_gemma":[0.85471874,0.00018062342,0.14247663,0.00019933598,0.000030566804,0.00013895353,0.00003132123,0.0000606646,0.0021631187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.00024322454,0.000024540057,0.00009575887,0.00013502079,0.000059973365],"domain_scores_gemma":[0.9975254,0.0016952438,0.00025167794,0.00013260788,0.00030323115,0.000091892114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020282797,0.00059080165,0.00070495025,0.0005867866,0.00027860573,0.00069997157,0.0010865207,0.0011097578,0.00077399245],"category_scores_gemma":[0.0068308967,0.00041254458,0.00040547096,0.00044312153,0.0013663546,0.00078883546,0.0011509241,0.0011647918,0.00011432629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030434787,0.00003011816,0.00066262233,0.000022505825,0.0000322781,0.000031657313,0.000053372456,0.9629866,0.0016438141,0.012900317,0.0002869911,0.021319298],"study_design_scores_gemma":[0.000004706536,0.00001294745,0.000039950162,0.0000039512397,0.0000034696411,0.000005436463,0.0000040718437,0.99624336,0.00025016977,0.003307695,0.00012220144,0.0000020549182],"about_ca_topic_score_codex":0.0026887537,"about_ca_topic_score_gemma":0.0022028468,"teacher_disagreement_score":0.0026887537,"about_ca_system_score_codex":0.00093947107,"about_ca_system_score_gemma":0.0008293458,"threshold_uncertainty_score":0.01072675},"labels":[],"label_agreement":null},{"id":"W4388912745","doi":"10.1007/s10710-023-09473-z","title":"W. B. Langdon “Jaws 30”","year":2023,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Bioethics Society","funders":"","keywords":"Computer science; Genetic programming; Coevolution; Field (mathematics); Order (exchange); Field-programmable gate array; Computer graphics (images); Artificial intelligence; Operating system; Biology; Mathematics; Evolutionary biology","score_opus":0.01232736480788241,"score_gpt":0.24722457078725016,"score_spread":0.23489720597936775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388912745","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003942282,0.05952542,0.18650927,0.16165651,0.11078482,0.00020536555,0.0015675019,0.0063627176,0.46944612],"genre_scores_gemma":[0.021988299,0.015773566,0.04287411,0.01275857,0.010538225,0.00011327843,0.0007931013,0.002395772,0.89276516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907327,0.00014472673,0.000047668815,0.00020037439,0.00047936666,0.000054649852],"domain_scores_gemma":[0.9986628,0.0003625372,0.000057973484,0.00013374139,0.00060839625,0.00017460942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014191328,0.0007895476,0.00053997454,0.001437491,0.0015153923,0.002780519,0.0010978596,0.0019468247,0.09116424],"category_scores_gemma":[0.0048549837,0.00043748517,0.00049756264,0.0012532622,0.00095840957,0.0027120123,0.0011946087,0.002592863,0.05166456],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006162443,0.000022606995,0.00015807977,0.00013542625,0.0000126597815,0.0000841748,0.00011460225,0.0004288252,0.0013917118,0.044560563,0.81199795,0.1410318],"study_design_scores_gemma":[0.000006009352,0.00001286761,0.00011514048,0.000052150364,0.0000047647322,0.00009159669,0.000022811724,0.00048375927,0.0009935874,0.010030189,0.9881728,0.000014297897],"about_ca_topic_score_codex":0.0027622,"about_ca_topic_score_gemma":0.004900257,"teacher_disagreement_score":0.09116424,"about_ca_system_score_codex":0.0012495939,"about_ca_system_score_gemma":0.0012130777,"threshold_uncertainty_score":0.30497473},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Python (programming language); Programming language; Algorithm","score_opus":0.01994590268256709,"score_gpt":0.25662432333338914,"score_spread":0.23667842065082204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389976716","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032740904,0.00017963193,0.7336704,0.00020230528,0.00030060174,0.00019429588,0.0078052254,0.24008492,0.014288428],"genre_scores_gemma":[0.076701425,0.0006163965,0.7744795,0.0011678424,0.00012890958,0.0019693505,0.016444108,0.098904125,0.029588351],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956936,0.00008188825,0.000039370865,0.00007282604,0.00017349966,0.00006308318],"domain_scores_gemma":[0.9991122,0.00048176054,0.000045691148,0.00013094535,0.00015402112,0.00007534109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090700586,0.0012041435,0.00081611564,0.0010994666,0.00071213336,0.0013224599,0.0032125132,0.0012624201,0.058468413],"category_scores_gemma":[0.0036259312,0.00086906634,0.0014460298,0.000868031,0.0005705435,0.0014078578,0.0017113268,0.0022968145,0.018485554],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049622625,0.0004234657,0.0027481893,0.0021222846,0.00031719945,0.00066476857,0.00043354512,0.11132618,0.019092986,0.05549194,0.4660679,0.3408153],"study_design_scores_gemma":[0.00054552895,0.000094744944,0.0012154793,0.00027965318,0.00009953845,0.0006093493,0.00006729426,0.5002212,0.033291213,0.08244997,0.38089356,0.00023244954],"about_ca_topic_score_codex":0.0025189824,"about_ca_topic_score_gemma":0.0035346563,"teacher_disagreement_score":0.058468413,"about_ca_system_score_codex":0.0005594517,"about_ca_system_score_gemma":0.0013197806,"threshold_uncertainty_score":0.19559634},"labels":[],"label_agreement":null},{"id":"W4391058219","doi":"10.1016/j.eswa.2024.123289","title":"Covariance matrix adaptation evolution strategy based on correlated evolution paths with application to reinforcement learning","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation of Korea; Ministry of Education; CHEO Research Institute","keywords":"CMA-ES; Reinforcement learning; Benchmark (surveying); Evolution strategy; Computer science; Suite; Covariance matrix; Population; Mathematical optimization; Algorithm; Adaptation (eye); Path (computing); Covariance; Artificial intelligence; Evolutionary algorithm; Mathematics","score_opus":0.009727315906889298,"score_gpt":0.24972470431190918,"score_spread":0.23999738840501988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391058219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013624978,0.0001887344,0.98384017,0.000118176715,0.000055453533,0.00004400189,0.000010825868,0.00013533168,0.0019823231],"genre_scores_gemma":[0.69176924,0.00033891306,0.3023739,0.00015574248,0.00007602627,0.00034821045,0.00006416638,0.00013047106,0.0047434205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995204,0.00016473063,0.00002467106,0.0000950007,0.0001526239,0.000042590957],"domain_scores_gemma":[0.9977102,0.0014267644,0.00014997297,0.000100883364,0.0005137326,0.00009850262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014311778,0.00070626417,0.0011643409,0.0007525654,0.0005844014,0.0007610944,0.0012887985,0.0013138835,0.0020222978],"category_scores_gemma":[0.004767166,0.00047264644,0.0006926964,0.00087048346,0.00100521,0.00091258157,0.0012662158,0.0013463155,0.00022829673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006191573,0.00007923411,0.00055133656,0.000058057987,0.00006384387,0.00008680721,0.00007380481,0.9173306,0.0018945907,0.027910389,0.0008066929,0.05108275],"study_design_scores_gemma":[0.000006379072,0.000014079774,0.00004086149,0.000002185272,0.0000047621697,0.000008990779,0.0000013538481,0.9982938,0.0001013415,0.0014251613,0.00009776851,0.000003351749],"about_ca_topic_score_codex":0.0056328527,"about_ca_topic_score_gemma":0.0037462676,"teacher_disagreement_score":0.0056328527,"about_ca_system_score_codex":0.0007432767,"about_ca_system_score_gemma":0.001547866,"threshold_uncertainty_score":0.01120013},"labels":[],"label_agreement":null},{"id":"W4391307056","doi":"10.1109/smc53992.2023.10394281","title":"Feature Selection Using Evolutionary Techniques","year":2023,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Feature selection; Selection (genetic algorithm); Artificial intelligence; Feature (linguistics); Pattern recognition (psychology); Machine learning","score_opus":0.019652971092212472,"score_gpt":0.27912994831970434,"score_spread":0.25947697722749186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391307056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030653484,0.00040737496,0.96611595,0.00015857925,0.00006538793,0.00013705171,0.000059564783,0.00042298163,0.001979591],"genre_scores_gemma":[0.36504942,0.0003672358,0.63111204,0.00018953058,0.00007837449,0.0004452485,0.00033244828,0.00013868429,0.0022870125],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921215,0.00019658216,0.00005642732,0.00016645952,0.00028497467,0.00008339903],"domain_scores_gemma":[0.99903023,0.0004464989,0.00008228226,0.00007039385,0.00033681493,0.000033842985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013677087,0.0011011878,0.0014733557,0.0023172041,0.00069463276,0.000886763,0.0009774361,0.00085550157,0.0016156158],"category_scores_gemma":[0.0035513414,0.00045275287,0.0012477718,0.0020611442,0.00037343337,0.0007298291,0.00077653234,0.0005763107,0.00043038206],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011429098,0.0001669684,0.0038402479,0.00018612927,0.0002109432,0.00032567728,0.00016631524,0.38823634,0.020967752,0.007488048,0.002550657,0.5757467],"study_design_scores_gemma":[0.000033391407,0.00007467457,0.0010985567,0.000017421462,0.000046602778,0.00015736661,0.000036950518,0.9879745,0.0038982464,0.0039817058,0.0026628985,0.000017636303],"about_ca_topic_score_codex":0.0015743814,"about_ca_topic_score_gemma":0.0012674587,"teacher_disagreement_score":0.0023172041,"about_ca_system_score_codex":0.00043248635,"about_ca_system_score_gemma":0.00056674116,"threshold_uncertainty_score":0.0072332025},"labels":[],"label_agreement":null},{"id":"W4391307601","doi":"10.1109/smc53992.2023.10393938","title":"A Pairwise Surrogate Model using GNN for Evolutionary Optimization","year":2023,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Brock University; Ontario Tech University","funders":"","keywords":"Pairwise comparison; Surrogate model; Computer science; Mathematical optimization; Evolutionary algorithm; Evolutionary computation; Artificial intelligence; Mathematics; Machine learning","score_opus":0.0519913286415911,"score_gpt":0.2885033772274616,"score_spread":0.2365120485858705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391307601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02111373,0.00028831605,0.9729811,0.00025952148,0.00008305348,0.00006289878,0.00005985884,0.00024931433,0.0049022166],"genre_scores_gemma":[0.75190955,0.00035162608,0.24005973,0.00024413124,0.0000627171,0.00036002888,0.0002993881,0.000121439145,0.006591396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922824,0.00030964223,0.000035483037,0.00013684556,0.0002239861,0.00006581833],"domain_scores_gemma":[0.9990085,0.00049885554,0.0001165431,0.00008050256,0.0002431289,0.000052436393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014819313,0.0010472689,0.0009588868,0.0008686607,0.00046174598,0.00078729144,0.0016448473,0.0016155228,0.0025672123],"category_scores_gemma":[0.0043642484,0.0003540888,0.0008675213,0.001015301,0.0007319388,0.0014125286,0.0010911194,0.0014416203,0.00038710007],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020354284,0.000016485792,0.00033539874,0.000021509524,0.000015277823,0.000028949584,0.000014389438,0.9835752,0.00042667994,0.004711627,0.00023479093,0.010599215],"study_design_scores_gemma":[0.0000013100223,0.000012182109,0.000034001227,0.0000022217432,0.0000021942303,0.0000075510125,0.0000015565107,0.99842876,0.00007430037,0.0012991567,0.00013492141,0.0000018643086],"about_ca_topic_score_codex":0.004282643,"about_ca_topic_score_gemma":0.0037291313,"teacher_disagreement_score":0.004282643,"about_ca_system_score_codex":0.0010764509,"about_ca_system_score_gemma":0.0008474668,"threshold_uncertainty_score":0.008588135},"labels":[],"label_agreement":null},{"id":"W4391339190","doi":"10.1016/j.engappai.2023.107426","title":"Incremental reinforcement learning for multi-objective analog circuit design acceleration","year":2024,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; CMC Microsystems","keywords":"Computer science; Reinforcement learning; Electronic circuit; Process (computing); Analogue electronics; Circuit design; Computer engineering; Artificial intelligence; Embedded system; Electrical engineering","score_opus":0.06568879306288473,"score_gpt":0.303612491369805,"score_spread":0.23792369830692028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391339190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040109504,0.00033147982,0.9499178,0.00013773191,0.00006753046,0.000061643834,0.000020224968,0.000630244,0.00872372],"genre_scores_gemma":[0.88021755,0.00009390942,0.116042145,0.00008936585,0.00002499597,0.000097734934,0.000033474793,0.000050447812,0.0033504209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998411,0.000044094668,0.0000059193853,0.000024286866,0.000059384998,0.000025218342],"domain_scores_gemma":[0.9995691,0.00026162207,0.000037890397,0.000030231859,0.000081825856,0.000019250581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005311769,0.0005885106,0.0005852484,0.0004200247,0.00024309538,0.00039385576,0.0008475892,0.0005850772,0.0041520935],"category_scores_gemma":[0.0012438643,0.0002507293,0.00033276348,0.00025324206,0.00034681408,0.0003761386,0.0006075383,0.00077172363,0.00033494338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059273643,0.000082259954,0.00026110664,0.000059425103,0.00002071417,0.000040361632,0.000026090365,0.9042671,0.003811138,0.004092041,0.000808652,0.0864718],"study_design_scores_gemma":[0.0000064702754,0.00002444818,0.000037763486,0.0000023883852,0.000002864983,0.000006345328,0.0000014805968,0.99865615,0.00035217937,0.00071974035,0.00018888226,0.0000013151995],"about_ca_topic_score_codex":0.0021673103,"about_ca_topic_score_gemma":0.003282766,"teacher_disagreement_score":0.0041520935,"about_ca_system_score_codex":0.0004911792,"about_ca_system_score_gemma":0.00053693616,"threshold_uncertainty_score":0.013890147},"labels":[],"label_agreement":null},{"id":"W4391341579","doi":"10.1109/tevc.2024.3349664","title":"IEEE Transactions on Evolutionary Computation Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Southern University of Science and Technology; Department of Artificial Intelligence, Korea University; Zhengzhou University; Xiamen University; Brock University; Aberystwyth University; South China University of Technology; Shenzhen University; Dalhousie University; Università degli Studi di Trento; Victoria University; Griffith University; Victoria University of Wellington; University of Exeter","keywords":"Evolutionary computation; Computer science; Computation; Evolutionary algorithm; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.014521498867787738,"score_gpt":0.25264165059608495,"score_spread":0.2381201517282972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391341579","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076732608,0.021327656,0.25050163,0.0106380945,0.055798158,0.00046491768,0.015770912,0.006132508,0.63169295],"genre_scores_gemma":[0.04397326,0.023711283,0.052351724,0.0014749744,0.005454692,0.00028287465,0.02396459,0.002561903,0.8462247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943167,0.000053092823,0.000038577477,0.00005956608,0.00037172786,0.00004530304],"domain_scores_gemma":[0.99850273,0.0003040329,0.00004687561,0.0003034255,0.0007123849,0.00013058598],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009086035,0.000758223,0.0013156277,0.0020788943,0.00056366273,0.0026264915,0.0009925228,0.0017211379,0.33807212],"category_scores_gemma":[0.00313001,0.00035861623,0.00051337434,0.0025449258,0.00032399077,0.002169542,0.0010992269,0.0013626596,0.13718241],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010122541,0.00009768511,0.00044709796,0.00046012513,0.00002063981,0.0001519043,0.000023904407,0.0035453695,0.0025253505,0.01808906,0.52518266,0.44935498],"study_design_scores_gemma":[0.00003821792,0.00006711179,0.0011311504,0.00026031147,0.000040827355,0.00044759264,0.000033338147,0.01698543,0.0032728703,0.029378816,0.94830185,0.00004241577],"about_ca_topic_score_codex":0.0007208391,"about_ca_topic_score_gemma":0.000988441,"teacher_disagreement_score":0.6619279,"about_ca_system_score_codex":0.00034419957,"about_ca_system_score_gemma":0.0010267626,"threshold_uncertainty_score":0.9441598},"labels":[],"label_agreement":null},{"id":"W4391890201","doi":"10.1007/978-3-031-49295-2_4","title":"Size Optimization","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadore College","funders":"","keywords":"Computer science","score_opus":0.01184608861927017,"score_gpt":0.2223375410829743,"score_spread":0.21049145246370413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391890201","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059908396,0.003396449,0.46317494,0.0012876071,0.0009143533,0.00015378647,0.0007267175,0.0035306283,0.5208247],"genre_scores_gemma":[0.12915505,0.004655622,0.22703227,0.0010680755,0.0006668133,0.00048679372,0.0021733125,0.0047791195,0.62998295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995566,0.000040441228,0.000012710721,0.00010360372,0.00023864183,0.000047937014],"domain_scores_gemma":[0.99964166,0.00010431797,0.000022237475,0.000108773114,0.0000918486,0.00003111677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032216302,0.0009794747,0.00075121433,0.0008880169,0.00058484665,0.001133469,0.0014112036,0.0007561153,0.07859811],"category_scores_gemma":[0.0013856924,0.00044880348,0.0006375998,0.0010278393,0.000584378,0.0018914309,0.0015905744,0.001316737,0.021683194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012542523,0.00009200561,0.00021637337,0.0003676664,0.000029117482,0.00007094092,0.00005982627,0.044530105,0.030956998,0.20126611,0.11826208,0.6040233],"study_design_scores_gemma":[0.00004909204,0.0001622467,0.00079340587,0.00015036552,0.00005330944,0.00051020365,0.000083716564,0.18289156,0.046735607,0.18304557,0.58546686,0.00005810895],"about_ca_topic_score_codex":0.00088601164,"about_ca_topic_score_gemma":0.0015167111,"teacher_disagreement_score":0.07859811,"about_ca_system_score_codex":0.00087320706,"about_ca_system_score_gemma":0.0006647282,"threshold_uncertainty_score":0.2629369},"labels":[],"label_agreement":null},{"id":"W4392642750","doi":"10.5194/egusphere-egu24-22282","title":"A data-driven approach to understanding esker morphogenesis","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Morphogenesis; Computer science; Business","score_opus":0.1485162418992593,"score_gpt":0.31155008501879433,"score_spread":0.16303384311953503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392642750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025442872,0.0018378677,0.94060385,0.0034881274,0.0001623679,0.00085334555,0.01952632,0.00380413,0.004281051],"genre_scores_gemma":[0.10645055,0.0018173035,0.86633664,0.00033661516,0.00008482377,0.0009371844,0.022329155,0.0002773223,0.0014303478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966198,0.0008159707,0.000579057,0.0009163799,0.00095843285,0.00011035004],"domain_scores_gemma":[0.98943466,0.005164618,0.0008034404,0.0024856785,0.0018132611,0.00029829476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005903315,0.00085064356,0.0012680497,0.0070118224,0.0009981528,0.0074120276,0.0033983462,0.001763494,0.0019645202],"category_scores_gemma":[0.016943086,0.0007384549,0.0024381308,0.006113364,0.0016930221,0.005650403,0.0024224862,0.0022584563,0.0009747949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034890097,0.00062058907,0.053268492,0.0026221832,0.0005420333,0.0019773655,0.0030567704,0.11661622,0.020284249,0.15982763,0.018467566,0.6223681],"study_design_scores_gemma":[0.000050002356,0.00024429156,0.023312476,0.0008687843,0.00021644488,0.0009957019,0.0034094078,0.53464216,0.015624374,0.22527604,0.19516352,0.00019681835],"about_ca_topic_score_codex":0.007846158,"about_ca_topic_score_gemma":0.009754198,"teacher_disagreement_score":0.007846158,"about_ca_system_score_codex":0.0025274279,"about_ca_system_score_gemma":0.0024754931,"threshold_uncertainty_score":0.031220078},"labels":[],"label_agreement":null},{"id":"W4392978796","doi":"10.1007/978-3-031-56852-7","title":"Applications of Evolutionary Computation","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Information and Communications Technology; Universitat Politècnica de València; Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California; College of Engineering, Michigan State University; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Région Normandie; Technische Universität Dortmund; Universidade da Coruña; Universitat Oberta de Catalunya; Eötvös Loránd Tudományegyetem; University of South Africa; University of Tsukuba; Universidad de Granada; Syddansk Universitet; ITMO University; Universidade Nova de Lisboa; Universidade de Coimbra; Silesian University of Technology; Universidad Complutense de Madrid; Universität Bielefeld; Michigan State University; Newcastle University; Università degli Studi di Trento; Technische Universität Darmstadt; Hakim Sabzevari University; King's College London; Centre National de la Recherche Scientifique; Johannes Gutenberg-Universität Mainz; Université du Luxembourg; Università degli Studi di Milano; Università degli Studi di Firenze; Universitetet i Oslo; Universität zu Lübeck; Sorbonne Université; Università degli Studi di Salerno; Queensland University of Technology; Universidad Politécnica de Madrid; Universidad de Extremadura; Universidad de Guadalajara; Euskal Herriko Unibertsitatea; University of Twente; Hong Kong Baptist University; York University; Universiteit Leiden; Indian Council of Agricultural Research; Swansea University; Radboud Universiteit; Universidad Rey Juan Carlos; Edinburgh Napier University; Carl von Ossietzky Universität Oldenburg; University of Southampton; Iran Telecommunication Research Center; De Montfort University; Università per Stranieri di Perugia; University of Exeter; Universidad de Cádiz; Universidad de Málaga; University of Cape Town; Institut \"Jožef Stefan\"; Università degli Studi di Perugia; Heriot-Watt University; Pomona College; Ostravská Univerzita v Ostravě; Technische Universität Dresden; Politecnico di Torino; University of Central Florida; Yeditepe Üniversitesi; Tecnológico Nacional de México; České Vysoké Učení Technické v Praze; Università degli Studi di Parma; Universidad de Sevilla; Sveučilište u Zagrebu; Queen Mary University of London; Universität Basel","keywords":"Computer science; Evolutionary computation; Computation; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.009796253796092282,"score_gpt":0.258472270848703,"score_spread":0.24867601705261072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392978796","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00599059,0.10447847,0.44436958,0.0029114978,0.0029622994,0.00007215512,0.00021387318,0.0008799301,0.43812177],"genre_scores_gemma":[0.28010464,0.09409874,0.3662197,0.0012466176,0.0031864597,0.0002339626,0.0006532161,0.000682452,0.25357422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996315,0.00009597311,0.000016041164,0.00006049497,0.00017415534,0.000021794478],"domain_scores_gemma":[0.99952376,0.00028197496,0.000017852171,0.00008491936,0.00006893979,0.000022524557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004552582,0.0008104997,0.0009048816,0.0013001999,0.0004906188,0.0019055397,0.00086668105,0.0011449766,0.018441008],"category_scores_gemma":[0.0018033723,0.00039772879,0.0007272526,0.0015381603,0.0011145062,0.0014490921,0.0014485016,0.0014792855,0.004086653],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036847963,0.00003902606,0.00044339066,0.00049143453,0.00007723926,0.0001864186,0.00014410252,0.023987474,0.0028564455,0.5259972,0.033907823,0.4118326],"study_design_scores_gemma":[0.000016434635,0.000037633894,0.00068174204,0.00019575712,0.000026894322,0.0005459673,0.000060632432,0.065636806,0.0016175689,0.6466169,0.28453764,0.000025970865],"about_ca_topic_score_codex":0.0005193272,"about_ca_topic_score_gemma":0.0005725965,"teacher_disagreement_score":0.018441008,"about_ca_system_score_codex":0.0006003873,"about_ca_system_score_gemma":0.00036582377,"threshold_uncertainty_score":0.061691344},"labels":[],"label_agreement":null},{"id":"W4393106948","doi":"10.1007/978-981-99-8413-8_10","title":"The OpenELM Library: Leveraging Progress in Language Models for Novel Evolutionary Algorithms","year":2024,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Implementation; Computer science; Leverage (statistics); Python (programming language); Genetic programming; Evolutionary algorithm; Artificial intelligence; Inference; Machine learning; Programming language; Data science","score_opus":0.020340674609139922,"score_gpt":0.24823851598543117,"score_spread":0.22789784137629127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393106948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012956044,0.001938372,0.96505785,0.0005215339,0.00031189155,0.00004436787,0.0005733632,0.008857421,0.021399539],"genre_scores_gemma":[0.02909435,0.0044455463,0.9299659,0.00043355243,0.00028952284,0.0003262671,0.0024374132,0.007403569,0.025603833],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995048,0.0001220695,0.0000328591,0.00008540383,0.00022692357,0.000027882852],"domain_scores_gemma":[0.999153,0.00051361544,0.000029195011,0.00018396696,0.00009048882,0.00002966645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081615185,0.0011334799,0.00087897165,0.0013554359,0.0006735065,0.002826349,0.0026055388,0.0011635964,0.02615393],"category_scores_gemma":[0.003880305,0.0007859142,0.0015443027,0.0015661094,0.00093111285,0.0051503037,0.002238018,0.0031149476,0.010982742],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054023716,0.00007405168,0.0002245296,0.0007683105,0.00006675595,0.00011829937,0.00019957252,0.034262963,0.0035738721,0.3937637,0.061167847,0.50572604],"study_design_scores_gemma":[0.00003149365,0.000030330912,0.00011116764,0.00024791743,0.00005225759,0.00024066409,0.00004479191,0.2667906,0.007437172,0.39095116,0.33401275,0.000049708044],"about_ca_topic_score_codex":0.0010985511,"about_ca_topic_score_gemma":0.00220296,"teacher_disagreement_score":0.02615393,"about_ca_system_score_codex":0.0008232198,"about_ca_system_score_gemma":0.0009306166,"threshold_uncertainty_score":0.0874936},"labels":[],"label_agreement":null},{"id":"W4393106956","doi":"10.1007/978-981-99-8413-8_16","title":"Let’s Evolve Intelligence, Not Solutions","year":2024,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"John Abbott College","funders":"","keywords":"Computer science; Artificial intelligence; Framing (construction); Intelligence cycle; Data science; Knowledge management; Cognitive science; Management science; Engineering; Military intelligence; Psychology","score_opus":0.02750249213461001,"score_gpt":0.2428350913914425,"score_spread":0.21533259925683249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393106956","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010371004,0.03373499,0.21383104,0.102090955,0.0061744703,0.00011803336,0.00017824835,0.0005562699,0.63294506],"genre_scores_gemma":[0.23446418,0.029908929,0.22593172,0.035647336,0.00256206,0.0002928675,0.00035500884,0.0010806234,0.46975723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993637,0.0002114398,0.000024470892,0.0001256645,0.00020664801,0.000068038964],"domain_scores_gemma":[0.99904364,0.0005235212,0.000042993655,0.00017818013,0.00014079879,0.00007081319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014797223,0.0006597391,0.00051172916,0.00053869374,0.0010840982,0.004631417,0.0011274215,0.0026484518,0.008469355],"category_scores_gemma":[0.004351149,0.00034695826,0.00044818784,0.0006038941,0.006583223,0.009906937,0.0018666781,0.003968532,0.0040683867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014666989,0.000023160394,0.00025625085,0.0002076606,0.000036970832,0.000103847786,0.00089527597,0.002197727,0.0010144472,0.90012944,0.0296816,0.065438904],"study_design_scores_gemma":[0.000014751206,0.00002917618,0.00014349945,0.00027249765,0.00002262638,0.00027254963,0.00042456036,0.0020359366,0.00088408834,0.60564977,0.3902292,0.00002132032],"about_ca_topic_score_codex":0.0013836833,"about_ca_topic_score_gemma":0.0018065607,"teacher_disagreement_score":0.008469355,"about_ca_system_score_codex":0.0008599902,"about_ca_system_score_gemma":0.0010460803,"threshold_uncertainty_score":0.02833277},"labels":[],"label_agreement":null},{"id":"W4393107025","doi":"10.1007/978-981-99-8413-8_4","title":"How the Combinatorics of Neutral Spaces Leads Genetic Programming to Discover Simple Solutions","year":2024,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Neutral network; Genetic programming; Space (punctuation); Phenotype; Neutral theory of molecular evolution; Genetic algorithm; Exponential function; Key (lock); Computer science; Mathematics; Evolutionary biology; Biology; Mathematical optimization; Genetics; Artificial intelligence; Gene; Philosophy","score_opus":0.01903676189982518,"score_gpt":0.2339239389063061,"score_spread":0.21488717700648094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393107025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01905229,0.0025244637,0.80394727,0.002718975,0.00038258897,0.00005774968,0.00012951714,0.00031113162,0.170876],"genre_scores_gemma":[0.39654863,0.006428538,0.5382085,0.0012062747,0.00041796357,0.00024893697,0.0002730895,0.0005621467,0.05610605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964917,0.00013113771,0.000016314587,0.00007451551,0.00010376777,0.000025082149],"domain_scores_gemma":[0.9990094,0.00071657874,0.000050310762,0.00012458282,0.000060760838,0.000038459588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007384356,0.00055273174,0.0005869883,0.0009365683,0.0008787919,0.002974948,0.0011699409,0.0012951518,0.008087068],"category_scores_gemma":[0.0043232427,0.00041068878,0.0008207913,0.0012151112,0.0040519685,0.004251933,0.0013913296,0.0026064236,0.0014632383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066104776,0.000006940246,0.000107132335,0.000044036387,0.000010306123,0.000043195603,0.000082916384,0.008738602,0.00059533434,0.9719792,0.0011911367,0.017194616],"study_design_scores_gemma":[0.0000037124423,0.0000041888215,0.00003182546,0.000013163571,0.0000040244563,0.000051927364,0.000018588446,0.009401136,0.0002557,0.98515564,0.0050537987,0.0000062615245],"about_ca_topic_score_codex":0.00094217376,"about_ca_topic_score_gemma":0.0017164048,"teacher_disagreement_score":0.008087068,"about_ca_system_score_codex":0.0009309031,"about_ca_system_score_gemma":0.0006577665,"threshold_uncertainty_score":0.027053952},"labels":[],"label_agreement":null},{"id":"W4393107140","doi":"10.1007/978-981-99-8413-8","title":"Genetic Programming Theory and Practice XX","year":2024,"lang":"en","type":"book","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Genetic programming; Field (mathematics); Computer science; Artificial intelligence; Mathematics","score_opus":0.010807876526377816,"score_gpt":0.2554978167080033,"score_spread":0.2446899401816255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393107140","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017159195,0.03401088,0.14658202,0.0069572786,0.0019983589,0.000070028436,0.00015693894,0.00030545273,0.80820316],"genre_scores_gemma":[0.067692555,0.045786794,0.08332094,0.002512967,0.0014706277,0.0003067502,0.00026287977,0.00043748392,0.79820895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967957,0.00009024212,0.000010303739,0.000036721056,0.00016565475,0.000017566876],"domain_scores_gemma":[0.99972147,0.00015432212,0.000012214632,0.00003668266,0.00006113178,0.000014230228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004024649,0.0006094066,0.0005199307,0.00078471267,0.0005077019,0.0024605552,0.0007002875,0.001295802,0.023524323],"category_scores_gemma":[0.0014722323,0.000277658,0.00023217204,0.0017462083,0.002205709,0.0015903632,0.0008579555,0.0018225271,0.008374444],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041038916,0.000016218457,0.00008526463,0.00013474874,0.000006856235,0.000043181135,0.00017770032,0.0041271253,0.00024664187,0.7823481,0.06960735,0.1432027],"study_design_scores_gemma":[0.0000045536412,0.000012172876,0.00017444017,0.0002375114,0.000005740378,0.00012932891,0.00011579278,0.0053282543,0.00020920667,0.53148466,0.46228948,0.000008903336],"about_ca_topic_score_codex":0.0019884629,"about_ca_topic_score_gemma":0.0023787834,"teacher_disagreement_score":0.023524323,"about_ca_system_score_codex":0.0012687322,"about_ca_system_score_gemma":0.0010560715,"threshold_uncertainty_score":0.07869667},"labels":[],"label_agreement":null},{"id":"W4393121770","doi":"10.1007/978-3-031-56855-8_21","title":"Strategies for Evolving Diverse and Effective Behaviours in Pursuit Domains","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.012782275775669616,"score_gpt":0.2618745035610549,"score_spread":0.24909222778538528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11150878,0.00064056483,0.85769516,0.0004178312,0.0000571584,0.00014694949,0.00005691667,0.0003710449,0.029105555],"genre_scores_gemma":[0.71566117,0.00069366064,0.26863718,0.0001663013,0.000034414043,0.00047746144,0.00014622377,0.00015373273,0.014029857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997249,0.00008044107,0.000019643401,0.000048243677,0.00007891002,0.000047816775],"domain_scores_gemma":[0.9990245,0.0005617337,0.0000853649,0.000112353744,0.000106408996,0.00010970984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082138507,0.0007239611,0.000516414,0.0008139442,0.00060482667,0.0014463608,0.0012395876,0.0011741577,0.0044456203],"category_scores_gemma":[0.0038579023,0.00037044944,0.00052312354,0.00052264065,0.0010946342,0.0015291717,0.0026398783,0.0012872196,0.000876013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012721305,0.00017727578,0.0019188063,0.00031194038,0.00009943824,0.00028106378,0.0010020529,0.28760123,0.023504632,0.42981794,0.003272312,0.25188616],"study_design_scores_gemma":[0.00005480759,0.00021902472,0.00049124635,0.000071061695,0.000046069195,0.00023466034,0.00046663356,0.7719571,0.0038954425,0.21644217,0.0060938774,0.000027877117],"about_ca_topic_score_codex":0.00050374115,"about_ca_topic_score_gemma":0.000755438,"teacher_disagreement_score":0.0044456203,"about_ca_system_score_codex":0.00045560964,"about_ca_system_score_gemma":0.00042745497,"threshold_uncertainty_score":0.014872074},"labels":[],"label_agreement":null},{"id":"W4393121851","doi":"10.1007/978-3-031-56855-8","title":"Applications of Evolutionary Computation","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Information and Communications Technology; Universitat Politècnica de València; Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California; College of Engineering, Michigan State University; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Région Normandie; Technische Universität Dortmund; Universidade da Coruña; Universitat Oberta de Catalunya; Eötvös Loránd Tudományegyetem; University of South Africa; University of Tsukuba; Universidad de Granada; Syddansk Universitet; ITMO University; Universidade Nova de Lisboa; Universidade de Coimbra; Silesian University of Technology; Universidad Complutense de Madrid; Universität Bielefeld; Michigan State University; Newcastle University; Università degli Studi di Trento; Technische Universität Darmstadt; Hakim Sabzevari University; King's College London; Centre National de la Recherche Scientifique; Johannes Gutenberg-Universität Mainz; Université du Luxembourg; Università degli Studi di Milano; Università degli Studi di Firenze; Universitetet i Oslo; Universität zu Lübeck; Sorbonne Université; Università degli Studi di Salerno; Queensland University of Technology; Universidad Politécnica de Madrid; Universidad de Extremadura; Universidad de Guadalajara; Euskal Herriko Unibertsitatea; University of Twente; Hong Kong Baptist University; York University; Universiteit Leiden; Indian Council of Agricultural Research; Swansea University; Radboud Universiteit; Universidad Rey Juan Carlos; Edinburgh Napier University; Carl von Ossietzky Universität Oldenburg; University of Southampton; Iran Telecommunication Research Center; De Montfort University; Università per Stranieri di Perugia; University of Exeter; Universidad de Cádiz; Universidad de Málaga; University of Cape Town; Institut \"Jožef Stefan\"; Università degli Studi di Perugia; Heriot-Watt University; Pomona College; Ostravská Univerzita v Ostravě; Technische Universität Dresden; Politecnico di Torino; University of Central Florida; Yeditepe Üniversitesi; Tecnológico Nacional de México; České Vysoké Učení Technické v Praze; Università degli Studi di Parma; Universidad de Sevilla; Sveučilište u Zagrebu; Queen Mary University of London; Universität Basel","keywords":"Computer science; Evolutionary computation; Computation; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.009796253796092282,"score_gpt":0.258472270848703,"score_spread":0.24867601705261072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121851","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00599059,0.10447847,0.44436958,0.0029114978,0.0029622994,0.00007215512,0.00021387318,0.0008799301,0.43812177],"genre_scores_gemma":[0.28010464,0.09409874,0.3662197,0.0012466176,0.0031864597,0.0002339626,0.0006532161,0.000682452,0.25357422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996315,0.00009597311,0.000016041164,0.00006049497,0.00017415534,0.000021794478],"domain_scores_gemma":[0.99952376,0.00028197496,0.000017852171,0.00008491936,0.00006893979,0.000022524557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004552582,0.0008104997,0.0009048816,0.0013001999,0.0004906188,0.0019055397,0.00086668105,0.0011449766,0.018441008],"category_scores_gemma":[0.0018033723,0.00039772879,0.0007272526,0.0015381603,0.0011145062,0.0014490921,0.0014485016,0.0014792855,0.004086653],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036847963,0.00003902606,0.00044339066,0.00049143453,0.00007723926,0.0001864186,0.00014410252,0.023987474,0.0028564455,0.5259972,0.033907823,0.4118326],"study_design_scores_gemma":[0.000016434635,0.000037633894,0.00068174204,0.00019575712,0.000026894322,0.0005459673,0.000060632432,0.065636806,0.0016175689,0.6466169,0.28453764,0.000025970865],"about_ca_topic_score_codex":0.0005193272,"about_ca_topic_score_gemma":0.0005725965,"teacher_disagreement_score":0.018441008,"about_ca_system_score_codex":0.0006003873,"about_ca_system_score_gemma":0.00036582377,"threshold_uncertainty_score":0.061691344},"labels":[],"label_agreement":null},{"id":"W4393393641","doi":"10.1109/tevc.2024.3377800","title":"IEEE Transactions on Evolutionary Computation Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Southern University of Science and Technology; Department of Artificial Intelligence, Korea University; Zhengzhou University; Xiamen University; Brock University; Aberystwyth University; South China University of Technology; Shenzhen University; Dalhousie University; Università degli Studi di Trento; Victoria University; Griffith University; Victoria University of Wellington; University of Exeter","keywords":"Evolutionary computation; Computer science; Computation; Evolutionary algorithm; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.014521498867787738,"score_gpt":0.25264165059608495,"score_spread":0.2381201517282972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393393641","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076732608,0.021327656,0.25050163,0.0106380945,0.055798158,0.00046491768,0.015770912,0.006132508,0.63169295],"genre_scores_gemma":[0.04397326,0.023711283,0.052351724,0.0014749744,0.005454692,0.00028287465,0.02396459,0.002561903,0.8462247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943167,0.000053092823,0.000038577477,0.00005956608,0.00037172786,0.00004530304],"domain_scores_gemma":[0.99850273,0.0003040329,0.00004687561,0.0003034255,0.0007123849,0.00013058598],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009086035,0.000758223,0.0013156277,0.0020788943,0.00056366273,0.0026264915,0.0009925228,0.0017211379,0.33807212],"category_scores_gemma":[0.00313001,0.00035861623,0.00051337434,0.0025449258,0.00032399077,0.002169542,0.0010992269,0.0013626596,0.13718241],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010122541,0.00009768511,0.00044709796,0.00046012513,0.00002063981,0.0001519043,0.000023904407,0.0035453695,0.0025253505,0.01808906,0.52518266,0.44935498],"study_design_scores_gemma":[0.00003821792,0.00006711179,0.0011311504,0.00026031147,0.000040827355,0.00044759264,0.000033338147,0.01698543,0.0032728703,0.029378816,0.94830185,0.00004241577],"about_ca_topic_score_codex":0.0007208391,"about_ca_topic_score_gemma":0.000988441,"teacher_disagreement_score":0.6619279,"about_ca_system_score_codex":0.00034419957,"about_ca_system_score_gemma":0.0010267626,"threshold_uncertainty_score":0.9441598},"labels":[],"label_agreement":null},{"id":"W4393801284","doi":"10.5281/zenodo.3601563","title":"A Large Scale Empirical Study of the Impact of Spaghetti Code and Blob Anti-patterns on Program Comprehension","year":2020,"lang":"en","type":"dataset","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Polytechnique Montréal; Concordia University","funders":"","keywords":"Code (set theory); Comprehension; Program comprehension; Scale (ratio); Computer science; Empirical research; Programming language; Geography; Mathematics; Statistics; Cartography; Software","score_opus":0.018941593472656233,"score_gpt":0.3008489220331326,"score_spread":0.2819073285604764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393801284","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021269593,0.00022933104,0.0004992538,0.00032802855,0.000056678487,0.00009732377,0.97367233,0.001622315,0.002225139],"genre_scores_gemma":[0.007995701,0.00004122819,0.0009639522,0.0000796314,0.000008839507,0.00014389174,0.9896387,0.00009691514,0.001031108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840975,0.00038194336,0.00017012341,0.00039902082,0.00047831197,0.00016088937],"domain_scores_gemma":[0.99321836,0.002306239,0.00055588846,0.0015656892,0.0016690709,0.00068472046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014938747,0.001597672,0.00069544546,0.0028940714,0.00088054745,0.0011437131,0.0023929533,0.0019302965,0.008513871],"category_scores_gemma":[0.007949726,0.0003921799,0.0010568101,0.0035915184,0.00057029753,0.0009795569,0.0015500372,0.001881371,0.016427075],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059084286,0.00068313116,0.02201092,0.0011364068,0.00014791201,0.0001697036,0.00028961065,0.0021529724,0.0009478423,0.0008704246,0.9551795,0.01582084],"study_design_scores_gemma":[0.0014010482,0.0004893138,0.21037991,0.00062951096,0.00020233146,0.00085179374,0.0013024261,0.016272577,0.0048868586,0.003374181,0.7599989,0.00021107089],"about_ca_topic_score_codex":0.03851132,"about_ca_topic_score_gemma":0.08504528,"teacher_disagreement_score":0.03851132,"about_ca_system_score_codex":0.0015431835,"about_ca_system_score_gemma":0.0016952254,"threshold_uncertainty_score":0.076574326},"labels":[],"label_agreement":null},{"id":"W4394818527","doi":"10.2174/0129503779282967240315040931","title":"Evolutionary Perspectives on Neural Network Generations: A Critical Examination of Models and Design Strategies","year":2024,"lang":"en","type":"article","venue":"Current Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Artificial neural network; Computer science; Cognitive science; Management science; Artificial intelligence; Psychology; Engineering","score_opus":0.06059255933555021,"score_gpt":0.3205799325048251,"score_spread":0.2599873731692749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394818527","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034142856,0.0372177,0.7804447,0.024740996,0.0010570175,0.00013955665,0.00016161765,0.00025179895,0.12184381],"genre_scores_gemma":[0.64133906,0.048264075,0.2704654,0.0025621417,0.0010860343,0.0005220963,0.00016824671,0.00040333564,0.035189573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915123,0.00038483983,0.000043475604,0.00013338697,0.00021758772,0.00006949144],"domain_scores_gemma":[0.9979038,0.0013926146,0.0001558276,0.00019413952,0.00028438232,0.000069166024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030776614,0.0008523543,0.0007053804,0.0010552251,0.00084550644,0.0025582279,0.001911602,0.0024300735,0.0058228024],"category_scores_gemma":[0.0071295886,0.00053790485,0.0007615322,0.00094326097,0.0026694732,0.0048982836,0.001329964,0.002487398,0.0008423778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016178254,0.000023739796,0.00050281483,0.00015463338,0.00003152769,0.000061441846,0.00017091708,0.07792369,0.00039345678,0.8736488,0.0020528142,0.045019962],"study_design_scores_gemma":[0.000019495272,0.00008041228,0.00034203278,0.00026239484,0.000023164612,0.00023027667,0.00017497853,0.22267805,0.00066964276,0.7336679,0.04181573,0.000035886267],"about_ca_topic_score_codex":0.0017140973,"about_ca_topic_score_gemma":0.0015878727,"teacher_disagreement_score":0.0058228024,"about_ca_system_score_codex":0.002011076,"about_ca_system_score_gemma":0.00090016617,"threshold_uncertainty_score":0.019479215},"labels":[],"label_agreement":null},{"id":"W4394891968","doi":"10.3390/educsci14040423","title":"Learning Multiplication by Translating across Microworlds","year":2024,"lang":"en","type":"article","venue":"Education Sciences","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multiplication (music); Mathematics education; Computer science; Arithmetic; Psychology; Mathematics","score_opus":0.020763428895235247,"score_gpt":0.3483114264254637,"score_spread":0.32754799753022845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394891968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8994244,0.0003090845,0.05170137,0.0020702556,0.00010225575,0.00015995024,0.000025163501,0.00017533088,0.046032187],"genre_scores_gemma":[0.9730102,0.00029340608,0.018513752,0.0002643155,0.00002374642,0.0001223082,0.000053064134,0.000059417216,0.007659735],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99550503,0.0031754966,0.00011781552,0.00045068347,0.00047376688,0.00027720165],"domain_scores_gemma":[0.9952787,0.0030860268,0.00044916608,0.00050540414,0.0002365524,0.0004441063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032925366,0.0007828298,0.000329592,0.00058381853,0.0013891866,0.005576217,0.0008955678,0.0012176288,0.0062029585],"category_scores_gemma":[0.012313764,0.0002806575,0.00044327782,0.0005521712,0.003973579,0.0060740784,0.0046375054,0.0018400467,0.0012446494],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003487291,0.0012214052,0.022718962,0.0006057424,0.000047098147,0.0018054951,0.6300885,0.0032940193,0.026438704,0.08992862,0.0056863083,0.21781655],"study_design_scores_gemma":[0.0001442325,0.0022474818,0.01904364,0.00046923675,0.00007416343,0.003001573,0.5747546,0.013570287,0.018302653,0.10253816,0.26563224,0.00022170701],"about_ca_topic_score_codex":0.00027460884,"about_ca_topic_score_gemma":0.0005351081,"teacher_disagreement_score":0.0062029585,"about_ca_system_score_codex":0.0005859961,"about_ca_system_score_gemma":0.00061230856,"threshold_uncertainty_score":0.020751},"labels":[],"label_agreement":null},{"id":"W4395093887","doi":"10.1007/978-3-031-56957-9","title":"Genetic Programming","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Lausanne; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Universidade de Coimbra; Ben-Gurion University of the Negev; Vysoké Učení Technické v Brně; Queen's University; Radboud Universiteit; Universidade de Lisboa; Victoria University; University of Galway; Politechnika Poznańska; Lingnan University; Victoria University of Wellington; Universidade Nova de Lisboa; Indian Council of Agricultural Research; University College London; Universidade Federal de Juiz de Fora; Dalhousie University; University of Exeter; Sveučilište u Zagrebu","keywords":"Computer science; Genetic programming; Programming language; Artificial intelligence","score_opus":0.011434735953502157,"score_gpt":0.24961093494173464,"score_spread":0.23817619898823247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395093887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043338053,0.0034630885,0.55413944,0.0009540502,0.0006949569,0.00009427217,0.0003385653,0.0015280518,0.43445373],"genre_scores_gemma":[0.1040425,0.0056997244,0.33922338,0.00086978695,0.00028175602,0.00028526926,0.0012136421,0.0008971249,0.5474868],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984443,0.000028747056,0.0000046021214,0.00003584131,0.00007558075,0.000010695306],"domain_scores_gemma":[0.9998826,0.000042997555,0.0000054922357,0.000031781754,0.000029033707,0.000008015541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017401623,0.0005651232,0.0004377901,0.0005330043,0.00038778764,0.0010656075,0.0007238932,0.0007887318,0.027666276],"category_scores_gemma":[0.000705336,0.00023748171,0.0004018831,0.00080619694,0.0004749109,0.0006353072,0.0006999389,0.0010652437,0.010216473],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028440973,0.000057613765,0.00019858559,0.0001961011,0.000033589728,0.00010094303,0.00009432212,0.03707563,0.0042622485,0.34406233,0.058786277,0.55510396],"study_design_scores_gemma":[0.000025882166,0.00006378283,0.00037343628,0.00021594446,0.000036196012,0.0004391171,0.000062454856,0.090844035,0.0061608176,0.3975553,0.5041944,0.000028657716],"about_ca_topic_score_codex":0.0008187637,"about_ca_topic_score_gemma":0.0011385183,"teacher_disagreement_score":0.027666276,"about_ca_system_score_codex":0.0004717294,"about_ca_system_score_gemma":0.0005309633,"threshold_uncertainty_score":0.0925529},"labels":[],"label_agreement":null},{"id":"W4395955281","doi":"10.18280/jesa.570214","title":"Balancing of Robustness and Performance for Triple Inverted Pendulum Using μ-Synthesis and Gazelle Optimization","year":2024,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robustness (evolution); Inverted pendulum; Control theory (sociology); Computer science; Mathematics; Physics; Biology; Nonlinear system; Artificial intelligence; Control (management); Genetics","score_opus":0.02297723769677302,"score_gpt":0.24924848972530522,"score_spread":0.2262712520285322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395955281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10573449,0.0004237957,0.88517326,0.00017362958,0.00003398615,0.00006911943,0.000032021995,0.00032961834,0.00803019],"genre_scores_gemma":[0.9479869,0.0001510235,0.050237663,0.000041449082,0.0000090118565,0.00011509507,0.000040755374,0.00003002314,0.0013880773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981195,0.000047480567,0.000011192571,0.000036305664,0.00006691033,0.000026201813],"domain_scores_gemma":[0.9997731,0.000102552774,0.00005239172,0.000016415534,0.00004736277,0.000008223716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005319344,0.0005447839,0.00045060823,0.00033329814,0.00024240218,0.00065967935,0.0003183232,0.000483327,0.0012245143],"category_scores_gemma":[0.00087926356,0.00020728458,0.00051774725,0.00015293929,0.00035556537,0.00027019694,0.0004992475,0.00032241928,0.00016214781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001192436,0.00005299447,0.0006463632,0.00024860795,0.000044952027,0.00008783704,0.00009245636,0.9046039,0.043768253,0.0047420296,0.00033623667,0.045257136],"study_design_scores_gemma":[0.000012705529,0.00019553512,0.00030651296,0.000013447219,0.0000116479905,0.000022780443,0.000015146059,0.9912963,0.006780271,0.0006851201,0.0006519086,0.000008653724],"about_ca_topic_score_codex":0.0019280189,"about_ca_topic_score_gemma":0.0013294986,"teacher_disagreement_score":0.0019280189,"about_ca_system_score_codex":0.00033444405,"about_ca_system_score_gemma":0.00051375595,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4398239758","doi":"10.31468/dwr.1093","title":"Two perspectives on generative AI now","year":2024,"lang":"en","type":"article","venue":"Discourse and Writing/Rédactologie","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generative grammar; Computer science; Artificial intelligence","score_opus":0.059836138254525516,"score_gpt":0.4016007775668646,"score_spread":0.3417646393123391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398239758","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075042495,0.02707087,0.052291766,0.15830208,0.0028073627,0.000021000664,0.00010759391,0.00015990708,0.75173515],"genre_scores_gemma":[0.8017493,0.018671185,0.030680535,0.029494796,0.0057350667,0.00019985445,0.00024634544,0.00044981833,0.11277322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99561226,0.0028625813,0.000099741774,0.00040637612,0.0006681136,0.00035102107],"domain_scores_gemma":[0.9939144,0.0041342718,0.00020572337,0.0007677888,0.00045489828,0.0005230155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042872555,0.00078471453,0.0006557082,0.0021572248,0.004536758,0.01140309,0.0016221436,0.0058473013,0.014129805],"category_scores_gemma":[0.0062168925,0.0003784614,0.00075546245,0.0017450999,0.028388053,0.012422445,0.004510238,0.009602276,0.002598407],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032056491,0.000004257687,0.000027106063,0.000008969304,7.8320227e-7,0.000021328675,0.0012276199,0.000038342183,0.000018773728,0.99547344,0.0012521866,0.0019239455],"study_design_scores_gemma":[0.0000068377994,0.0000063780353,0.00006535089,0.00007961631,0.0000017356233,0.00009927988,0.0015575173,0.00021155323,0.00006719151,0.9015742,0.09632486,0.0000054123025],"about_ca_topic_score_codex":0.0016894354,"about_ca_topic_score_gemma":0.0020261768,"teacher_disagreement_score":0.014129805,"about_ca_system_score_codex":0.0037186723,"about_ca_system_score_gemma":0.0018236786,"threshold_uncertainty_score":0.047268927},"labels":[],"label_agreement":null},{"id":"W4398529402","doi":"10.7910/dvn/dnw5rw","title":"TTalk: Ron's Numbers","year":2019,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics","score_opus":0.015559025699883043,"score_gpt":0.2480815617388779,"score_spread":0.23252253603899486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398529402","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002801445,0.00034940106,0.00029456802,0.0012820374,0.0011367351,0.00006081404,0.97858936,0.0038926166,0.014114381],"genre_scores_gemma":[0.0011881804,0.00025676202,0.0007216441,0.0006479268,0.00018193388,0.00016173019,0.9805674,0.0011013354,0.015173027],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871886,0.00020460741,0.00015108545,0.00031651554,0.00035214322,0.00025674974],"domain_scores_gemma":[0.99612194,0.00062599796,0.00020494642,0.0010981752,0.0012262448,0.00072261225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015060655,0.0028215407,0.0018328173,0.003993496,0.0018922881,0.0068153576,0.0035964653,0.002241335,0.3681706],"category_scores_gemma":[0.010844868,0.00084972,0.0015713471,0.004711705,0.00054781884,0.004061266,0.0041016624,0.0033925711,0.54071724],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010979972,0.0000031494892,0.000071991155,0.000042641466,0.0000014372033,0.0000033002805,0.0000031072768,0.000011842,0.000008121604,0.00011213573,0.9987942,0.00093709485],"study_design_scores_gemma":[0.000054245513,0.000007409319,0.0004901728,0.000104819956,0.0000038727812,0.000024777848,0.000057171164,0.00017194414,0.0001037344,0.00078865734,0.99818283,0.00001040258],"about_ca_topic_score_codex":0.013563069,"about_ca_topic_score_gemma":0.03552477,"teacher_disagreement_score":0.3681706,"about_ca_system_score_codex":0.0012506846,"about_ca_system_score_gemma":0.0026559278,"threshold_uncertainty_score":0.90122795},"labels":[],"label_agreement":null},{"id":"W4399151368","doi":"10.48550/arxiv.2405.17631","title":"BioDiscoveryAgent: An AI Agent for Designing Genetic Perturbation Experiments","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wu Tsai Neurosciences Institute, Stanford University; Genentech; Defense Advanced Research Projects Agency; Institute for Catastrophic Loss Reduction; National Science Foundation","keywords":"Computer science; Perturbation (astronomy); Artificial intelligence; Physics; Quantum mechanics","score_opus":0.09494131121400051,"score_gpt":0.23107603008475666,"score_spread":0.13613471887075615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399151368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019348944,0.0004188478,0.9253454,0.00095737894,0.00019960351,0.0006399507,0.0009043782,0.04043478,0.011750676],"genre_scores_gemma":[0.16875863,0.00032926956,0.81833917,0.0010662272,0.00004726211,0.001245125,0.0015822215,0.0014847664,0.007147466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933726,0.00023264195,0.00005307505,0.00017031132,0.00016290152,0.00004383327],"domain_scores_gemma":[0.9976152,0.0014831505,0.00018561061,0.0003233429,0.00026181832,0.00013084082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002559232,0.0011708082,0.0006804791,0.00068189594,0.00054982025,0.0011045919,0.002345008,0.0013771495,0.0075049773],"category_scores_gemma":[0.007047436,0.0006401574,0.0009549782,0.0002638806,0.000943898,0.0016577707,0.0015838592,0.0019661393,0.0018565473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013076334,0.00095686107,0.009714692,0.0013493274,0.000470649,0.000877444,0.00070520473,0.4814951,0.051001664,0.06214966,0.05969984,0.3302719],"study_design_scores_gemma":[0.00009642148,0.00010984744,0.00025045252,0.000029712046,0.00004127104,0.000075659715,0.0000391249,0.9573887,0.009699307,0.010432153,0.02181024,0.000027120133],"about_ca_topic_score_codex":0.0028248953,"about_ca_topic_score_gemma":0.0055655977,"teacher_disagreement_score":0.0075049773,"about_ca_system_score_codex":0.001004445,"about_ca_system_score_gemma":0.0020952725,"threshold_uncertainty_score":0.025106609},"labels":[],"label_agreement":null},{"id":"W4400032549","doi":"10.1016/b978-0-443-28824-1.50289-1","title":"A Deep Reinforcement Learning PI Tuning Strategy for Closed-loop Operation of a Recirculating Aquaculture System","year":2024,"lang":"en","type":"book-chapter","venue":"Computer-aided chemical engineering/Computer aided chemical engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Loop (graph theory); Control theory (sociology); Closed loop; Aquaculture; Computer science; Artificial intelligence; Engineering; Control engineering; Fishery; Biology; Mathematics; Fish <Actinopterygii>; Control (management)","score_opus":0.012778282181801786,"score_gpt":0.21144299598898555,"score_spread":0.19866471380718376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400032549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03954881,0.00047629644,0.9424561,0.00017534167,0.0001226225,0.000060334267,0.00002908243,0.0008772671,0.016254133],"genre_scores_gemma":[0.937993,0.00014247248,0.054153495,0.00008739603,0.000022551578,0.000043819186,0.00002225713,0.000033074495,0.0075019244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999294,0.000011429437,0.00000425559,0.000017545144,0.000024149736,0.000013054694],"domain_scores_gemma":[0.9999132,0.000029477033,0.000010689587,0.000008332318,0.000031162737,0.0000071747604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024316236,0.00040952215,0.00036450822,0.00013742184,0.00027966546,0.0004179458,0.0007008637,0.0005359335,0.003013429],"category_scores_gemma":[0.00027506033,0.00015963968,0.00020759074,0.000114130875,0.00025817152,0.00024543874,0.0003667257,0.0005369019,0.0003772574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020789477,0.000111864116,0.00046848133,0.00012381544,0.000044129443,0.00013581708,0.00007201657,0.6548673,0.034053862,0.0058557712,0.0025227366,0.30153632],"study_design_scores_gemma":[0.000006634031,0.00006021624,0.000116290656,0.000005376051,0.0000062531467,0.000016768794,0.000003067783,0.9968141,0.0017205202,0.0005875862,0.00065948366,0.000003686054],"about_ca_topic_score_codex":0.0058434913,"about_ca_topic_score_gemma":0.0062068193,"teacher_disagreement_score":0.0058434913,"about_ca_system_score_codex":0.0004190207,"about_ca_system_score_gemma":0.00041485875,"threshold_uncertainty_score":0.011618972},"labels":[],"label_agreement":null},{"id":"W4400529018","doi":"10.1145/3626772.3657979","title":"Can Query Expansion Improve Generalization of Strong Cross-Encoder Rankers?","year":2024,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Generalization; Encoder; Query expansion; Artificial intelligence; Data mining; Information retrieval; Mathematics; Operating system","score_opus":0.012247478305655517,"score_gpt":0.2762828888245987,"score_spread":0.2640354105189432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400529018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41168872,0.0036079702,0.5628011,0.0016286965,0.00022598403,0.0003253551,0.0007919192,0.009175562,0.0097546885],"genre_scores_gemma":[0.8883022,0.0004870219,0.103099205,0.00065329816,0.00015063722,0.000097746306,0.0010876005,0.0003490867,0.00577326],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99671966,0.001141818,0.00022797474,0.00080688717,0.0007973432,0.00030628653],"domain_scores_gemma":[0.9910109,0.004065307,0.0005807958,0.0025290893,0.0015126342,0.00030131865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005729945,0.0013886614,0.0015112781,0.0016858156,0.00060223497,0.0013954067,0.0019845916,0.001432656,0.0027497916],"category_scores_gemma":[0.02002782,0.00050237286,0.0010121824,0.0010811316,0.0011132207,0.0048141526,0.0021301585,0.001595663,0.0018013761],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015128773,0.001206094,0.021109378,0.00063076854,0.00043409364,0.0005006965,0.0009199693,0.14207514,0.064415455,0.016181704,0.014388758,0.7366251],"study_design_scores_gemma":[0.00011955873,0.0009242656,0.0050101723,0.000045153043,0.00021022187,0.000613336,0.00025456698,0.94175,0.030893736,0.014381185,0.0057038334,0.00009392026],"about_ca_topic_score_codex":0.0038534335,"about_ca_topic_score_gemma":0.0055438965,"teacher_disagreement_score":0.005729945,"about_ca_system_score_codex":0.0009446222,"about_ca_system_score_gemma":0.0011950561,"threshold_uncertainty_score":0.03030318},"labels":[],"label_agreement":null},{"id":"W4401214196","doi":"10.1145/3638530.3664168","title":"Accelerating GP Genome Evaluation Through Real Compilation with a Multiple Program Single Data Approach","year":2024,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Computer science; Programming language","score_opus":0.09710511390660542,"score_gpt":0.30142283220778654,"score_spread":0.20431771830118112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401214196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14909971,0.00031619088,0.8288012,0.00043637565,0.00016110993,0.00013699406,0.00015236018,0.014196563,0.006699532],"genre_scores_gemma":[0.39009324,0.00015113776,0.60458255,0.0002000618,0.000029724168,0.00024245023,0.00046435848,0.0018203792,0.0024160729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928826,0.00021762273,0.000032317872,0.00014231207,0.00023913335,0.00008049309],"domain_scores_gemma":[0.9979241,0.0010995133,0.00013650973,0.00035310676,0.00043281724,0.000053897398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147678,0.0008401665,0.0005931807,0.0008122284,0.00043645193,0.0010434972,0.0011887974,0.0007654713,0.0029451586],"category_scores_gemma":[0.0049801967,0.0004014464,0.0007201929,0.00063171797,0.00064061396,0.0010743425,0.00091986166,0.0011656953,0.0007789714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039599664,0.00035877782,0.006656182,0.00037542908,0.00017372392,0.00043926464,0.00039520982,0.43663886,0.04107631,0.017603606,0.009182824,0.48670375],"study_design_scores_gemma":[0.00007213974,0.00013835322,0.00084493775,0.000023499184,0.000045999474,0.00009763903,0.000059235867,0.96859264,0.018964626,0.0058146617,0.005326022,0.000020244817],"about_ca_topic_score_codex":0.0019631034,"about_ca_topic_score_gemma":0.0021418883,"teacher_disagreement_score":0.0029451586,"about_ca_system_score_codex":0.0007094834,"about_ca_system_score_gemma":0.0011287885,"threshold_uncertainty_score":0.009852529},"labels":[],"label_agreement":null},{"id":"W4401389346","doi":"10.3390/proceedings2024105049","title":"Analyzing Power Consumption in a Coaxial Bioreactor Using Machine Learning Techniques with Computational Fluid Dynamics","year":2024,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Coaxial; Power consumption; Computational fluid dynamics; Bioreactor; Computer science; Power (physics); Dynamics (music); Process engineering; Engineering; Chemistry; Physics; Aerospace engineering; Acoustics; Thermodynamics","score_opus":0.014162311089204786,"score_gpt":0.2717983959801246,"score_spread":0.2576360848909198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401389346","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.644216,0.001983984,0.34921327,0.00029498106,0.00007574808,0.00011073559,0.00042578363,0.0007039024,0.0029755405],"genre_scores_gemma":[0.9360888,0.0010005706,0.061498832,0.000040581584,0.000011325186,0.0001666357,0.00030716413,0.000028862485,0.00085733936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997938,0.000032498505,0.000022731185,0.000046599573,0.00008561676,0.000018795887],"domain_scores_gemma":[0.99946815,0.00033870622,0.00006560468,0.000025388,0.000091436516,0.000010680733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055658066,0.0007259875,0.0007499855,0.0007181338,0.00032997556,0.0006383464,0.00045356862,0.0006094362,0.0005294086],"category_scores_gemma":[0.001155877,0.00026458927,0.0006596643,0.0008981935,0.00026452017,0.00062959956,0.00028609234,0.00053091877,0.00014765067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001957141,0.0001739564,0.008299922,0.00041725693,0.00006711051,0.00022866137,0.00008250829,0.87727344,0.040440552,0.0008649917,0.00035185023,0.071604036],"study_design_scores_gemma":[0.000003706081,0.000064273,0.0012693729,0.0000063860552,0.000011235036,0.000019164188,0.000016973154,0.98927724,0.008785062,0.00022815983,0.0003090461,0.000009435368],"about_ca_topic_score_codex":0.00517928,"about_ca_topic_score_gemma":0.0038266296,"teacher_disagreement_score":0.00517928,"about_ca_system_score_codex":0.0005222109,"about_ca_system_score_gemma":0.00067909015,"threshold_uncertainty_score":0.010298252},"labels":[],"label_agreement":null},{"id":"W4402294425","doi":"10.1016/j.jpdc.2024.104977","title":"Accelerating Fortran codes: A method for integrating Coarray Fortran with CUDA Fortran and OpenMP","year":2024,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Austrian Science Fund; Russian Foundation for Basic Research","keywords":"Fortran; Computer science; Parallel computing; CUDA; Computational science; Programming language","score_opus":0.021641870002693332,"score_gpt":0.30461748124396143,"score_spread":0.2829756112412681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402294425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000786438,0.0006275145,0.98016584,0.00037527498,0.0005609367,0.00025287207,0.00026163438,0.010697082,0.006272459],"genre_scores_gemma":[0.009455228,0.00072704983,0.9786695,0.00021190022,0.00020534155,0.00077812496,0.00047527894,0.003850876,0.005626659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975616,0.00064925465,0.0001765452,0.00026130292,0.0012071686,0.0001441294],"domain_scores_gemma":[0.99731773,0.0007312793,0.0002776108,0.00044585913,0.0010959195,0.00013160423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022584058,0.0018758249,0.001072246,0.0031383215,0.001284255,0.0021990456,0.0032502892,0.0016086057,0.011456013],"category_scores_gemma":[0.008171994,0.0013119158,0.0015682344,0.0029793936,0.001399915,0.0023009202,0.0033004016,0.0036264479,0.0095861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010640538,0.00013108997,0.0017243805,0.0010840159,0.00034227988,0.0006475554,0.0009288763,0.053827673,0.010201885,0.24704193,0.19711658,0.4868473],"study_design_scores_gemma":[0.00011334098,0.000105495696,0.0008064789,0.00039760047,0.000103538725,0.00089214486,0.00013513323,0.24063188,0.012950031,0.06956196,0.6741046,0.00019779972],"about_ca_topic_score_codex":0.00471441,"about_ca_topic_score_gemma":0.0042993105,"teacher_disagreement_score":0.011456013,"about_ca_system_score_codex":0.00071395416,"about_ca_system_score_gemma":0.0032270974,"threshold_uncertainty_score":0.038324177},"labels":[],"label_agreement":null},{"id":"W4402306010","doi":"10.1016/j.ifacol.2024.08.328","title":"Semi-centralized Multi-agent RL for Irrigation Scheduling","year":2024,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Scheduling (production processes); Distributed computing; Mathematical optimization; Mathematics","score_opus":0.031947511233262386,"score_gpt":0.3045211252260924,"score_spread":0.27257361399283003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402306010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0215193,0.00028053563,0.9753515,0.00018468063,0.000041993288,0.00003336738,0.000028828526,0.00034684877,0.0022129773],"genre_scores_gemma":[0.95141816,0.000100590245,0.046488646,0.00009236139,0.00003554172,0.000075363045,0.000041671217,0.000033842036,0.0017138857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994029,0.0002536644,0.000023813898,0.00012071722,0.0001245669,0.00007428446],"domain_scores_gemma":[0.99862635,0.00074003456,0.00020671127,0.00012069281,0.00022061559,0.00008573416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193882,0.00060945336,0.0011941019,0.00023751297,0.00035152672,0.0007627801,0.0013669495,0.00079845637,0.0011869124],"category_scores_gemma":[0.0022295213,0.00040354655,0.00047096267,0.00029932937,0.0009362654,0.00065757346,0.0008627097,0.0009781991,0.00025830226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025487228,0.000018212313,0.00014449663,0.000026175854,0.000014678941,0.00002302487,0.000017462422,0.9905449,0.0005713705,0.0018031232,0.00018777061,0.006623221],"study_design_scores_gemma":[0.0000043095038,0.000009745565,0.000020912854,8.440387e-7,0.000001362805,0.0000022561123,0.000001362366,0.99936694,0.00005986261,0.0004715745,0.000059640435,0.0000012224323],"about_ca_topic_score_codex":0.006196665,"about_ca_topic_score_gemma":0.0051167333,"teacher_disagreement_score":0.006196665,"about_ca_system_score_codex":0.0007763588,"about_ca_system_score_gemma":0.0014273354,"threshold_uncertainty_score":0.012321234},"labels":[],"label_agreement":null},{"id":"W4402540999","doi":"10.1093/jas/skae234.178","title":"510 Utilizing python programming for modern genetic evaluation systems","year":2024,"lang":"en","type":"article","venue":"Journal of Animal Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Python (programming language); Programming language; Computer science; Genetic programming; Software engineering; Computational biology; Biology; Artificial intelligence","score_opus":0.05364888096777835,"score_gpt":0.34361280391383053,"score_spread":0.28996392294605217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402540999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010375183,0.00011242318,0.8566665,0.0004945254,0.00013651849,0.00051431556,0.0030769557,0.11923995,0.009383635],"genre_scores_gemma":[0.11712831,0.0002741352,0.84409374,0.0006247395,0.00008723243,0.0017443493,0.007693242,0.022415934,0.0059383684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667585,0.00123144,0.00041611184,0.00057391106,0.0008578818,0.00024493202],"domain_scores_gemma":[0.9938006,0.0028414864,0.00054943643,0.0011110931,0.0014368346,0.00026052882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067806453,0.0011967409,0.00063258165,0.0011426667,0.00069117884,0.002904058,0.0027647705,0.0005310213,0.016528308],"category_scores_gemma":[0.017459033,0.00082885,0.0014770377,0.0011844656,0.0010937883,0.0023803317,0.0033221089,0.0020615472,0.007631679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014536368,0.00069185573,0.02026011,0.0017175823,0.0005845627,0.0013962721,0.0014708701,0.18552673,0.016472269,0.14850241,0.15260449,0.46931922],"study_design_scores_gemma":[0.00032832954,0.00019338366,0.0035059596,0.00024748742,0.000095424766,0.00043015892,0.00014082465,0.73139054,0.018181643,0.10432757,0.14100733,0.00015126994],"about_ca_topic_score_codex":0.003599214,"about_ca_topic_score_gemma":0.0027754174,"teacher_disagreement_score":0.016528308,"about_ca_system_score_codex":0.00093080016,"about_ca_system_score_gemma":0.003550349,"threshold_uncertainty_score":0.055292726},"labels":[],"label_agreement":null},{"id":"W4402812287","doi":"10.1007/978-3-031-64373-6_2","title":"Evolutionary Computation","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on learning, networks, and algorithms","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Guelph; Brock University; St. Francis Xavier University","funders":"","keywords":"Computer science; Evolutionary biology; Biology","score_opus":0.01005193352964428,"score_gpt":0.2260725710332572,"score_spread":0.21602063750361292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402812287","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005595464,0.02125382,0.4415819,0.0034536112,0.0025267242,0.00010252012,0.00062201085,0.0013041955,0.52355975],"genre_scores_gemma":[0.2196232,0.017788151,0.23524077,0.0015599263,0.0014146421,0.00033665035,0.0019017644,0.001011515,0.5211233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977237,0.000051358937,0.00000894219,0.00006651781,0.000083364255,0.000017479566],"domain_scores_gemma":[0.9997894,0.00007182255,0.000008491847,0.000063960026,0.000048236572,0.000018054901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038905456,0.00066977,0.00067790877,0.0007797223,0.0005961501,0.0020356432,0.00080952945,0.0010053292,0.035234373],"category_scores_gemma":[0.0012237232,0.0003752039,0.000489427,0.00080281496,0.0010515507,0.0013372105,0.00097343756,0.001626851,0.01050904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023810391,0.00003431261,0.00032411562,0.00019279274,0.00005618631,0.00007175149,0.00010663773,0.015977465,0.0018765611,0.6514645,0.06651323,0.26335862],"study_design_scores_gemma":[0.000020403908,0.000033927325,0.00048092575,0.00012937067,0.000022828312,0.00021901651,0.000044908185,0.030862711,0.0017181608,0.566891,0.39955318,0.00002363689],"about_ca_topic_score_codex":0.00068255427,"about_ca_topic_score_gemma":0.0010834722,"teacher_disagreement_score":0.035234373,"about_ca_system_score_codex":0.00069364475,"about_ca_system_score_gemma":0.0004426799,"threshold_uncertainty_score":0.11787069},"labels":[],"label_agreement":null},{"id":"W4403305809","doi":"10.1017/9781009302180","title":"How to Think about Algorithms","year":2024,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.016623194362335805,"score_gpt":0.20835828953529031,"score_spread":0.1917350951729545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011847991,0.04965925,0.45352426,0.054787353,0.009276081,0.0003759611,0.0009938439,0.0041441987,0.4260542],"genre_scores_gemma":[0.025201634,0.04776279,0.5035907,0.029882919,0.0056028445,0.0010994379,0.002019062,0.003662683,0.38117796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974486,0.00069546583,0.00017848141,0.00046601525,0.0010359886,0.00017540273],"domain_scores_gemma":[0.99649554,0.0020295428,0.00012711453,0.00046623047,0.0006966604,0.00018485499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023544142,0.0019348778,0.0010239449,0.002023111,0.0015291446,0.011025211,0.0022588496,0.003257278,0.046733838],"category_scores_gemma":[0.00993412,0.0008736203,0.001442109,0.0016124363,0.004818781,0.013286459,0.0028282998,0.009002054,0.045636635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013877865,0.00003891995,0.00015938807,0.0006581806,0.000029952556,0.000081937644,0.001050164,0.0016292324,0.0005773509,0.5422105,0.28392944,0.169621],"study_design_scores_gemma":[0.000005854099,0.000010627248,0.000072917275,0.00039890132,0.000004815157,0.00015163027,0.00017579609,0.00092940143,0.00017273474,0.2581402,0.7399236,0.0000135189375],"about_ca_topic_score_codex":0.0011862919,"about_ca_topic_score_gemma":0.0013151553,"teacher_disagreement_score":0.046733838,"about_ca_system_score_codex":0.0019719752,"about_ca_system_score_gemma":0.002568601,"threshold_uncertainty_score":0.15634024},"labels":[],"label_agreement":null},{"id":"W4403371077","doi":"10.19184/ejlh.v11i2.43512","title":"Analysing Discrimination based on Genetic Information","year":2024,"lang":"en","type":"article","venue":"Lentera Hukum","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Data science","score_opus":0.009128101008679345,"score_gpt":0.24327851796331715,"score_spread":0.2341504169546378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403371077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7792603,0.00463797,0.019345015,0.030116951,0.00025706404,0.00013446699,0.0002883513,0.00002462803,0.16593532],"genre_scores_gemma":[0.994522,0.0008362897,0.0017667384,0.0011638703,0.000043948432,0.00004502506,0.00005297352,0.000009173044,0.0015600127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9813938,0.0115669295,0.00049018796,0.0009800931,0.0042833416,0.0012856986],"domain_scores_gemma":[0.90554756,0.079955846,0.008153328,0.0026687013,0.0029534637,0.0007209914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01273853,0.00029107492,0.00038689421,0.0033903313,0.003220806,0.0044954536,0.0011246471,0.002094822,0.004094905],"category_scores_gemma":[0.049414605,0.00014626398,0.00043673598,0.0050282422,0.0141952345,0.0042019924,0.005487874,0.0025182911,0.00026367916],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084358944,0.0001285131,0.08201306,0.0004734774,0.000054107557,0.0015128969,0.18392324,0.0009101631,0.0004880327,0.65417486,0.003708309,0.07252904],"study_design_scores_gemma":[0.000035621764,0.00016589665,0.13161078,0.0026799755,0.00010668134,0.0018201902,0.31488824,0.0036926162,0.0013518336,0.43356174,0.10998149,0.00010499093],"about_ca_topic_score_codex":0.008027653,"about_ca_topic_score_gemma":0.007340867,"teacher_disagreement_score":0.01273853,"about_ca_system_score_codex":0.006137409,"about_ca_system_score_gemma":0.0043424396,"threshold_uncertainty_score":0.06736857},"labels":[],"label_agreement":null},{"id":"W4403406779","doi":"10.1145/3638530.3648422","title":"Linear Genetic Programming","year":2024,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence","score_opus":0.01981866932713728,"score_gpt":0.25185721868199507,"score_spread":0.2320385493548578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403406779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056759785,0.0017314273,0.88648283,0.0009959462,0.00029688625,0.000063783395,0.00023239727,0.00085622974,0.10366457],"genre_scores_gemma":[0.38788423,0.0022231324,0.42211714,0.0009715537,0.0003876818,0.00036799468,0.0010519146,0.0006100202,0.18438639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966025,0.00011960257,0.000010281307,0.00007808351,0.00009598548,0.000035871395],"domain_scores_gemma":[0.9995702,0.0002300045,0.000023514101,0.00004587175,0.000108664666,0.00002182865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046485357,0.0005948452,0.00063826796,0.0005682977,0.0004910862,0.0014496256,0.0009108281,0.000968331,0.017823922],"category_scores_gemma":[0.001772849,0.00033076992,0.0005394349,0.0007038359,0.000640966,0.0007125275,0.0008537426,0.0012805924,0.004426003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005906818,0.00009761422,0.00045565047,0.00016557497,0.00006793761,0.000091981485,0.000084431675,0.3668845,0.0020630136,0.32690927,0.025192957,0.27792794],"study_design_scores_gemma":[0.000024402047,0.000038244958,0.00015991744,0.00004794403,0.00001831209,0.000051890314,0.000023131393,0.8299582,0.0010919397,0.14115004,0.027420914,0.000015097803],"about_ca_topic_score_codex":0.0034630087,"about_ca_topic_score_gemma":0.0038168593,"teacher_disagreement_score":0.017823922,"about_ca_system_score_codex":0.000998772,"about_ca_system_score_gemma":0.00097270514,"threshold_uncertainty_score":0.059626997},"labels":[],"label_agreement":null},{"id":"W4403919476","doi":"10.1109/ro-man60168.2024.10731289","title":"A Biologically Inspired Program-level Imitation Approach for Robots: Proof-of-Concept","year":2024,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Proof of concept; Robot; Imitation; Computer science; Artificial intelligence; Human–computer interaction; Psychology; Neuroscience","score_opus":0.0716537637075071,"score_gpt":0.30560753306992205,"score_spread":0.23395376936241497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403919476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017029632,0.00027062208,0.97365916,0.00044646516,0.00011084912,0.00029337814,0.00004039668,0.0010629267,0.0070866076],"genre_scores_gemma":[0.24282137,0.00039851406,0.75064486,0.00022076083,0.000030737374,0.00078795204,0.00008493922,0.00019900152,0.00481185],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995522,0.00009888372,0.00001783828,0.000071393755,0.00021656374,0.000043113985],"domain_scores_gemma":[0.99950206,0.00023336991,0.000040529212,0.00007380499,0.00008809846,0.00006218637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008622943,0.000634075,0.00040683692,0.00023899542,0.00039079564,0.00059293763,0.0013791871,0.001078187,0.0040343665],"category_scores_gemma":[0.0020687585,0.0002849099,0.00068252825,0.000117580785,0.0012776642,0.0010311106,0.0013710407,0.0013449499,0.0007967569],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002399732,0.00081513193,0.0014423887,0.0011458094,0.00016072864,0.0012857139,0.0007413128,0.22693428,0.29365554,0.19565529,0.0065211733,0.2714028],"study_design_scores_gemma":[0.00021219361,0.0012359505,0.0006318261,0.00010551676,0.000042898213,0.0010018806,0.00009711319,0.83112085,0.07834633,0.04776069,0.039359506,0.00008529636],"about_ca_topic_score_codex":0.00065333536,"about_ca_topic_score_gemma":0.0003843639,"teacher_disagreement_score":0.0040343665,"about_ca_system_score_codex":0.0003457364,"about_ca_system_score_gemma":0.0006642412,"threshold_uncertainty_score":0.013496339},"labels":[],"label_agreement":null},{"id":"W4404741643","doi":"10.1080/24751448.2024.2405339","title":"Variegated Coding","year":2024,"lang":"en","type":"article","venue":"Technology|Architecture + Design","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Biology; Computer science","score_opus":0.0144772310707161,"score_gpt":0.24480233153881858,"score_spread":0.23032510046810248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404741643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058680275,0.002278895,0.52136827,0.015320396,0.004139997,0.0004158702,0.0032170166,0.0022110082,0.44518057],"genre_scores_gemma":[0.3088719,0.0042294357,0.3906087,0.011085635,0.0013175821,0.002730039,0.006743026,0.0030661325,0.2713476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9903346,0.005189424,0.0005521932,0.0012943862,0.0020249537,0.00060456083],"domain_scores_gemma":[0.9822678,0.008540289,0.00070099684,0.0040217508,0.004139828,0.0003293806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064404486,0.00073148694,0.0005087623,0.002418653,0.0032363879,0.0047648884,0.0025499566,0.0015549324,0.06972774],"category_scores_gemma":[0.04304515,0.00036997176,0.00073011575,0.004123594,0.005645251,0.0054084877,0.004333491,0.003499141,0.019908741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037339538,0.0000074136933,0.00037605828,0.00009350035,0.0000051740817,0.000046537923,0.0012574579,0.00023498881,0.00017397142,0.8458203,0.07030744,0.08163978],"study_design_scores_gemma":[0.000012741853,0.0000174471,0.00036357145,0.00034606052,0.0000093712,0.00028016386,0.0009971034,0.002273928,0.0011749478,0.42248055,0.5720118,0.00003226585],"about_ca_topic_score_codex":0.0054463577,"about_ca_topic_score_gemma":0.006315789,"teacher_disagreement_score":0.06972774,"about_ca_system_score_codex":0.0031838047,"about_ca_system_score_gemma":0.0040946486,"threshold_uncertainty_score":0.23326254},"labels":[],"label_agreement":null},{"id":"W4404862210","doi":"","title":"On-chain optimal aggregation of Uniswap v3 clones","year":2024,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Chain (unit); Computer science; Business; Physics","score_opus":0.011859672200662941,"score_gpt":0.2329932973588489,"score_spread":0.22113362515818596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404862210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61254215,0.00069009693,0.3490515,0.0006365859,0.00025164365,0.0003735002,0.0011541222,0.0037549005,0.031545445],"genre_scores_gemma":[0.6968095,0.0003082876,0.27948934,0.00019435407,0.00006480425,0.00028270128,0.0036596165,0.0011070039,0.018084422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985514,0.00029954867,0.00008922472,0.00033187956,0.00033073704,0.00039721766],"domain_scores_gemma":[0.9968844,0.0009842484,0.00021044067,0.00106435,0.00059100706,0.00026554894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011997906,0.0006324502,0.0013173543,0.0009699488,0.001144276,0.0018681253,0.0010501152,0.0009811159,0.008335392],"category_scores_gemma":[0.0043000085,0.0004952989,0.0009618523,0.0017086187,0.00065425405,0.0012739599,0.0022553243,0.00086702214,0.0020774375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002874418,0.00052209536,0.008505146,0.0006291789,0.00019234861,0.0007353925,0.0009291649,0.24577549,0.17494157,0.070460744,0.024017189,0.47041723],"study_design_scores_gemma":[0.0001436721,0.0005663666,0.0025528877,0.0001018372,0.000120767894,0.0002489881,0.00052383693,0.7913208,0.08274955,0.094812386,0.026811317,0.00004765077],"about_ca_topic_score_codex":0.0026609786,"about_ca_topic_score_gemma":0.0034645344,"teacher_disagreement_score":0.008335392,"about_ca_system_score_codex":0.0012998291,"about_ca_system_score_gemma":0.0016855306,"threshold_uncertainty_score":0.027884603},"labels":[],"label_agreement":null},{"id":"W4404916257","doi":"10.1109/icons62911.2024.00020","title":"Timing Actions in Games Through Bio-Inspired Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Error-driven learning; Reinforcement; Human–computer interaction; Engineering","score_opus":0.04102234093842048,"score_gpt":0.30151768002617596,"score_spread":0.26049533908775546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404916257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092045516,0.00022758784,0.89944065,0.00056995393,0.000060904127,0.000094754185,0.00003870312,0.00042184824,0.0071000713],"genre_scores_gemma":[0.8989616,0.00013080947,0.09762831,0.000121823454,0.00001839117,0.00014819474,0.000033847187,0.000042191452,0.0029147177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997918,0.000092653005,0.000010509935,0.00003455583,0.000045939363,0.000024619276],"domain_scores_gemma":[0.9993735,0.00039922126,0.0000770843,0.000045995264,0.000057366582,0.000046808247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622035,0.0005223993,0.00045018256,0.0002525768,0.00025438404,0.0005879281,0.0008733922,0.0006660869,0.001328877],"category_scores_gemma":[0.0029672706,0.00026105042,0.00031760143,0.00014843512,0.0012161598,0.0008066707,0.0006866614,0.00084876426,0.00015123158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037866328,0.000051307266,0.0006648071,0.00004061399,0.000027584541,0.00005437858,0.00009254149,0.93376076,0.002399307,0.04072118,0.00047531698,0.021674361],"study_design_scores_gemma":[0.0000126062,0.000021476122,0.00006178099,0.0000045118522,0.0000032818725,0.000008644291,0.0000070185556,0.9816312,0.0004320637,0.017398607,0.00041457015,0.0000041034323],"about_ca_topic_score_codex":0.0028445392,"about_ca_topic_score_gemma":0.0029756082,"teacher_disagreement_score":0.0028445392,"about_ca_system_score_codex":0.0007111599,"about_ca_system_score_gemma":0.0005613356,"threshold_uncertainty_score":0.0056558847},"labels":[],"label_agreement":null},{"id":"W4404917641","doi":"10.1016/j.conengprac.2024.106183","title":"A semi-centralized multi-agent RL framework for efficient irrigation scheduling","year":2024,"lang":"en","type":"article","venue":"Control Engineering Practice","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Multi-agent system; Distributed computing; Scheduling (production processes); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.01596670665170339,"score_gpt":0.28777967915878044,"score_spread":0.27181297250707703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404917641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010303856,0.00020623763,0.9859277,0.00019748633,0.000034043962,0.000032486187,0.000034691195,0.00036248926,0.0029010333],"genre_scores_gemma":[0.87163794,0.00020414288,0.12458598,0.00013424711,0.00005155622,0.0001499903,0.000086877626,0.00006450129,0.0030847741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962914,0.00013025886,0.000015790443,0.00008280958,0.000084269566,0.000057700683],"domain_scores_gemma":[0.9993432,0.00031489012,0.00008863285,0.000047910973,0.00014618022,0.0000591278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091869896,0.0006128913,0.0009154187,0.00023419812,0.00043562995,0.0009491719,0.0014207913,0.0008274253,0.0020132507],"category_scores_gemma":[0.0015038277,0.0004320238,0.0004789997,0.00034466683,0.0007755129,0.00068945746,0.0008758774,0.0011113378,0.00041556565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013956286,0.000013850135,0.00010276387,0.000019735236,0.0000076744755,0.00002231491,0.000015660678,0.98991394,0.00047108557,0.0023830624,0.000315799,0.0067201215],"study_design_scores_gemma":[0.000004158573,0.0000065371282,0.000016228472,9.161583e-7,0.0000012535374,0.000002152115,0.000002178333,0.99923885,0.0000511004,0.00055939605,0.00011603924,0.000001181903],"about_ca_topic_score_codex":0.010011075,"about_ca_topic_score_gemma":0.009884628,"teacher_disagreement_score":0.010011075,"about_ca_system_score_codex":0.0007900267,"about_ca_system_score_gemma":0.0022003695,"threshold_uncertainty_score":0.019905627},"labels":[],"label_agreement":null},{"id":"W4405090288","doi":"10.48550/arxiv.2412.03330","title":"Testing CPS with Design Assumptions-Based Metamorphic Relations and Genetic Programming","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; Fonds National de la Recherche Luxembourg; European Commission; Université du Luxembourg","keywords":"Genetic programming; Computer science; Metamorphic rock; Programming language; Artificial intelligence; Geology; Geochemistry","score_opus":0.10069527051975839,"score_gpt":0.19483084433641687,"score_spread":0.09413557381665848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405090288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13268554,0.0002113478,0.8611519,0.00087185914,0.000040749565,0.00021451006,0.00011384626,0.001598196,0.0031119785],"genre_scores_gemma":[0.66766304,0.0002376294,0.329816,0.00041068782,0.00003494947,0.00027151307,0.00029821415,0.00017915224,0.0010887984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99258524,0.0027656858,0.00041897575,0.0014371347,0.0022803594,0.0005125994],"domain_scores_gemma":[0.983196,0.012167147,0.0018544734,0.0015471183,0.001025185,0.00021004208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037434106,0.0014305442,0.00067673647,0.0012129667,0.00048178906,0.001734166,0.0018713383,0.0015006327,0.0012091818],"category_scores_gemma":[0.023797983,0.0006514505,0.0016181361,0.0007130135,0.0039200485,0.0026039209,0.0022044647,0.0025916595,0.00018255919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003056826,0.00035294448,0.0077394107,0.00029335034,0.00011155676,0.00089662964,0.00071389007,0.7797692,0.014163551,0.09713448,0.0008947995,0.09762455],"study_design_scores_gemma":[0.000046570614,0.00019836039,0.0004555389,0.000053497195,0.000046549434,0.00015944362,0.00008084748,0.9367712,0.0078001595,0.053216815,0.0011422236,0.000028913073],"about_ca_topic_score_codex":0.0043245014,"about_ca_topic_score_gemma":0.002855354,"teacher_disagreement_score":0.0043245014,"about_ca_system_score_codex":0.0016708769,"about_ca_system_score_gemma":0.0019991286,"threshold_uncertainty_score":0.019797266},"labels":[],"label_agreement":null},{"id":"W4405254983","doi":"10.48550/arxiv.2412.07165","title":"A Method for Evaluating Hyperparameter Sensitivity in Reinforcement Learning","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Hyperparameter; Sensitivity (control systems); Reinforcement learning; Reinforcement; Machine learning; Artificial intelligence; Psychology; Computer science; Social psychology; Engineering","score_opus":0.11148995560475027,"score_gpt":0.2707874725826567,"score_spread":0.1592975169779064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405254983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025451388,0.00058054476,0.9694531,0.0002076936,0.000097607845,0.00041515712,0.00019116868,0.00097390736,0.0026294235],"genre_scores_gemma":[0.45824963,0.00036074227,0.53645825,0.00037545298,0.00009835267,0.0021497603,0.0005262076,0.00051980506,0.0012618315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98387736,0.007989405,0.0010958142,0.002434035,0.0041837753,0.0004196805],"domain_scores_gemma":[0.9052563,0.07227198,0.007206001,0.010011369,0.0045972983,0.00065707375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021928927,0.0021438643,0.0016022017,0.0046931193,0.0011970322,0.0027158544,0.0028826485,0.0031372327,0.0025921552],"category_scores_gemma":[0.13718964,0.0008915514,0.0013947012,0.0030729922,0.0035737336,0.003166545,0.0035111164,0.0056951717,0.000552415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049480493,0.0004070871,0.016444858,0.00053731346,0.0006936666,0.00017839209,0.0006168215,0.73680437,0.008024438,0.038626745,0.0029235398,0.19424799],"study_design_scores_gemma":[0.00008407124,0.00042246468,0.004560263,0.00013718843,0.00008438885,0.00026454276,0.000097304626,0.94022536,0.007977146,0.043302793,0.0027243083,0.000120187724],"about_ca_topic_score_codex":0.0023365505,"about_ca_topic_score_gemma":0.0015455738,"teacher_disagreement_score":0.021928927,"about_ca_system_score_codex":0.0018196114,"about_ca_system_score_gemma":0.0017358029,"threshold_uncertainty_score":0.11597258},"labels":[],"label_agreement":null},{"id":"W4405468205","doi":"10.48550/arxiv.2412.10592","title":"Self-Exciting Random Evolutions (SEREs) and their Applications (Version 2)","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.02734859515317418,"score_gpt":0.17761374449626435,"score_spread":0.15026514934309018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405468205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04790095,0.012511088,0.8950884,0.002053724,0.001075224,0.00007464526,0.00028245425,0.0002930423,0.04072047],"genre_scores_gemma":[0.76368445,0.014487638,0.15146472,0.0015281757,0.0026203727,0.00037071263,0.0005284302,0.00034576765,0.06496975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999413,0.00018816855,0.000040930285,0.00014490109,0.00015415317,0.000058728023],"domain_scores_gemma":[0.9986811,0.0006324834,0.0002100371,0.00015003618,0.00023262849,0.00009367738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011736824,0.0006546483,0.00069391285,0.0008486001,0.00043174406,0.0010200216,0.0007379681,0.0012372348,0.004696027],"category_scores_gemma":[0.003707059,0.0003092896,0.0016962473,0.00068061857,0.0013151404,0.0017827717,0.0012200698,0.0020576261,0.0006456779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015907965,0.000022243308,0.00068094156,0.00015019783,0.000044245466,0.00018845515,0.00012131417,0.028142646,0.001740336,0.95341915,0.0017218066,0.013752743],"study_design_scores_gemma":[0.00001880903,0.0000791107,0.0011799805,0.000074608855,0.000032064367,0.0005927373,0.00004838524,0.305957,0.000975877,0.66441584,0.026583314,0.000042236377],"about_ca_topic_score_codex":0.0011631009,"about_ca_topic_score_gemma":0.00049809297,"teacher_disagreement_score":0.004696027,"about_ca_system_score_codex":0.00057511445,"about_ca_system_score_gemma":0.00046444737,"threshold_uncertainty_score":0.015709817},"labels":[],"label_agreement":null},{"id":"W4406575091","doi":"10.1016/s1558-0164(08)70284-0","title":"10.1016/s1558-0164(08)70284-0","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medicine; Sleep (system call); Audiology; Computer science","score_opus":0.005764958076330504,"score_gpt":0.17947520500583586,"score_spread":0.17371024692950535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406575091","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042351233,0.00032688238,0.0010952902,0.00040050983,0.0002653549,0.000103900195,0.00076877023,0.001129427,0.9954863],"genre_scores_gemma":[0.00065364636,0.00015165938,0.0004779874,0.00017543638,0.000053713924,0.000048912076,0.00044627103,0.0001877518,0.9978046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926406,0.000060932503,0.000056784826,0.00026705267,0.00020063162,0.00015047895],"domain_scores_gemma":[0.9976985,0.0005469989,0.00014932387,0.0003432836,0.0005167707,0.0007450854],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011507794,0.002524028,0.0014737191,0.0028381273,0.002132901,0.004140424,0.0033104776,0.005388737,0.98882735],"category_scores_gemma":[0.0018510813,0.0008056198,0.00130033,0.0029677982,0.0017880771,0.005051886,0.0030398448,0.0024210853,0.9914725],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003102421,0.00021031353,0.00083474413,0.00046584825,0.00003720534,0.00023705594,0.00009499076,0.0005233958,0.0020754996,0.007749269,0.3586896,0.6287717],"study_design_scores_gemma":[0.000043560332,0.000088374414,0.00053640275,0.00021288598,0.000011660523,0.0002325411,0.000089140376,0.00028718144,0.00037082806,0.00075632724,0.9973506,0.000020502284],"about_ca_topic_score_codex":0.0041689947,"about_ca_topic_score_gemma":0.0031086507,"teacher_disagreement_score":0.011172652,"about_ca_system_score_codex":0.0012983104,"about_ca_system_score_gemma":0.0013041428,"threshold_uncertainty_score":0.015936375},"labels":[],"label_agreement":null},{"id":"W4407240655","doi":"10.1016/j.ins.2025.121957","title":"NEEP-ADF: Neuro-encoded expression programming with automatically defined functions","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Taishan Scholar Project of Shandong Province; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Computer science; Expression (computer science); Artificial intelligence; Programming language","score_opus":0.011140181132587027,"score_gpt":0.2515186582510849,"score_spread":0.24037847711849786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407240655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034635903,0.000046009816,0.99084455,0.00006805818,0.000051260595,0.00003826174,0.00015099139,0.00220937,0.0031280129],"genre_scores_gemma":[0.100665316,0.0001084881,0.8903987,0.00019864416,0.00003001024,0.000316557,0.00059746526,0.0009229745,0.0067619286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.000100795965,0.000028303335,0.000091578964,0.0001543624,0.00004503835],"domain_scores_gemma":[0.99956673,0.00023015641,0.000022111235,0.00006670058,0.00009418157,0.000020078036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066541403,0.00060990197,0.00053729455,0.00041993885,0.00037941366,0.0009934438,0.0017215016,0.00090952724,0.0067668827],"category_scores_gemma":[0.0024750836,0.00030963274,0.00074817735,0.00040359714,0.00066158583,0.00097188394,0.0011676619,0.0023774789,0.0016581008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024601797,0.00022243174,0.000720525,0.0003061904,0.00005485541,0.00025894804,0.00022360579,0.23633572,0.013766012,0.21356769,0.016585493,0.5177125],"study_design_scores_gemma":[0.000038160662,0.00004420631,0.00008648038,0.000045612094,0.000017343697,0.00011751834,0.000020374084,0.9163266,0.010418959,0.056703966,0.016162429,0.000018380751],"about_ca_topic_score_codex":0.0013787951,"about_ca_topic_score_gemma":0.0023944436,"teacher_disagreement_score":0.0067668827,"about_ca_system_score_codex":0.00052648835,"about_ca_system_score_gemma":0.0008288741,"threshold_uncertainty_score":0.022637486},"labels":[],"label_agreement":null},{"id":"W4407394592","doi":"10.1126/sciadv.adr7338","title":"Self-supervised machine learning methods for protein design improve sampling but not the identification of high-fitness variants","year":2025,"lang":"en","type":"article","venue":"Science Advances","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Machine learning; Identification (biology); Toolbox; Sampling (signal processing); Artificial intelligence; Data mining; Biology","score_opus":0.030003625555809713,"score_gpt":0.3482759882634606,"score_spread":0.3182723627076509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407394592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111560464,0.00076891424,0.88165927,0.0004538693,0.00006602301,0.00008860506,0.00009700285,0.0018939793,0.003411851],"genre_scores_gemma":[0.6626272,0.00032627935,0.33419865,0.00035903705,0.000067264424,0.00017173853,0.000338364,0.00036339645,0.001548106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977022,0.001348109,0.00010773594,0.00033212203,0.0004455634,0.000064357286],"domain_scores_gemma":[0.99117565,0.0056605106,0.0006408851,0.0015986704,0.00078726385,0.00013695541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874969,0.0009299806,0.0010527396,0.0008537722,0.00050257856,0.00096157426,0.0013240485,0.0010821889,0.0012740884],"category_scores_gemma":[0.0115912855,0.00036712867,0.00082530396,0.00057214266,0.00089633145,0.0015432583,0.0010751612,0.00143195,0.0007615359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002028284,0.0003628613,0.00913141,0.00030400176,0.00028604822,0.000086092965,0.00017471517,0.71035963,0.011457282,0.01931199,0.0025013275,0.2458218],"study_design_scores_gemma":[0.000016275973,0.00007518245,0.0004490229,0.000013139709,0.000014626371,0.000030409437,0.00000796766,0.9873947,0.0026500106,0.008487685,0.00085374975,0.0000071697627],"about_ca_topic_score_codex":0.00052191433,"about_ca_topic_score_gemma":0.0012757872,"teacher_disagreement_score":0.004874969,"about_ca_system_score_codex":0.00058872264,"about_ca_system_score_gemma":0.00090465706,"threshold_uncertainty_score":0.025781631},"labels":[],"label_agreement":null},{"id":"W4407684169","doi":"10.48550/arxiv.2502.10760","title":"Why is prompting hard? Understanding prompts on binary sequence predictors","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Catastrophic Loss Reduction","keywords":"Sequence (biology); Binary number; Psychology; Computer science; Genetics; Mathematics; Biology; Arithmetic","score_opus":0.13581339880455442,"score_gpt":0.30891189849653033,"score_spread":0.1730984996919759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407684169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36353838,0.0012755098,0.617029,0.0037514656,0.00017875822,0.00014475289,0.00085943955,0.001845632,0.01137714],"genre_scores_gemma":[0.9415037,0.00042667164,0.053501155,0.00036418563,0.00006038611,0.00019464604,0.0005963808,0.00039385594,0.0029589736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977197,0.0011221893,0.00010255689,0.00057479215,0.00027169133,0.00020915901],"domain_scores_gemma":[0.9615892,0.030971747,0.0025844304,0.0025626228,0.0012064986,0.0010854822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049517555,0.0009131391,0.0010188746,0.0005717057,0.0006791578,0.0022701544,0.00097009994,0.0016985589,0.010221908],"category_scores_gemma":[0.067159064,0.00060280005,0.00048091318,0.0005511929,0.0022626175,0.0057286764,0.001969251,0.0039583463,0.0013135512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024089995,0.0006257366,0.031167116,0.0012776615,0.0001647241,0.0006628822,0.0037732646,0.33529195,0.017604697,0.3082718,0.017038878,0.28171232],"study_design_scores_gemma":[0.0000948532,0.00031479725,0.007860957,0.00019612428,0.000039699546,0.00015048236,0.00067597406,0.45704624,0.004321478,0.5253171,0.0039011133,0.00008119246],"about_ca_topic_score_codex":0.001501118,"about_ca_topic_score_gemma":0.0015186468,"teacher_disagreement_score":0.010221908,"about_ca_system_score_codex":0.001104766,"about_ca_system_score_gemma":0.0012468054,"threshold_uncertainty_score":0.03419566},"labels":[],"label_agreement":null},{"id":"W4408919023","doi":"10.21203/rs.3.rs-6233867/v1","title":"The Alpha-Alternator: Dynamic Adaptation To Varying Noise Levels In Sequences Using The Vendi Score For Improved Robustness and Performance","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Alpha (finance); Alternator; Noise (video); Mathematics; Computer science; Control theory (sociology); Artificial intelligence; Statistics; Biology; Physics","score_opus":0.11772006856972303,"score_gpt":0.403362236107371,"score_spread":0.28564216753764793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408919023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12768768,0.0006128503,0.86611867,0.00021486005,0.00019665137,0.00011125553,0.00012574985,0.001919728,0.0030125775],"genre_scores_gemma":[0.7253761,0.00017200764,0.2709252,0.00011785383,0.0000760915,0.00015958888,0.0002924379,0.00039857463,0.0024821204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892694,0.00036689438,0.0000782771,0.00028496914,0.00025278112,0.00009010697],"domain_scores_gemma":[0.99734664,0.0013043982,0.0001913721,0.00043245274,0.00054771936,0.00017733123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026833594,0.0010485817,0.0012941961,0.00092292204,0.00047927303,0.0012519212,0.0016086731,0.0014937815,0.0023068993],"category_scores_gemma":[0.008580803,0.00036046442,0.00048391457,0.0007280525,0.00067290285,0.00119556,0.0014434996,0.0015911259,0.0008691338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015225186,0.0004624366,0.002946795,0.00023018917,0.0002300564,0.00016963099,0.00020383131,0.22085743,0.086953394,0.0063215275,0.0021592507,0.677943],"study_design_scores_gemma":[0.00006626523,0.0004579834,0.0013451391,0.000019375811,0.000043541895,0.0001175129,0.000025551279,0.9799452,0.014965302,0.0021092305,0.00086749333,0.000037351558],"about_ca_topic_score_codex":0.0014544133,"about_ca_topic_score_gemma":0.0016481095,"teacher_disagreement_score":0.0026833594,"about_ca_system_score_codex":0.00041182456,"about_ca_system_score_gemma":0.0008243399,"threshold_uncertainty_score":0.014191091},"labels":[],"label_agreement":null},{"id":"W4409121959","doi":"10.1007/s11227-025-07132-x","title":"SPINEX-symbolic regression: similarity-based symbolic regression with explainable neighbors exploration","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Clemson University","keywords":"Symbolic regression; Computer science; Similarity (geometry); Regression; The Symbolic; Regression analysis; Symbolic data analysis; Artificial intelligence; Theoretical computer science; Machine learning; Statistics; Mathematics; Genetic programming","score_opus":0.01733863392500166,"score_gpt":0.26642008987218996,"score_spread":0.2490814559471883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409121959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052933108,0.0003241269,0.9403163,0.00032971846,0.00005565029,0.000082498744,0.00011322168,0.0019312913,0.003914068],"genre_scores_gemma":[0.6033216,0.00018649834,0.39045,0.00022852543,0.00005481227,0.00021929278,0.00053286547,0.0005860425,0.0044203154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924314,0.00029227554,0.000031046216,0.00013681027,0.0002348473,0.00006184591],"domain_scores_gemma":[0.99827826,0.0011129637,0.00014406,0.00017220888,0.00023939591,0.000052995903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013367375,0.00089195586,0.0010155234,0.0009944101,0.00047786775,0.00092989823,0.001618888,0.0009581804,0.0036317257],"category_scores_gemma":[0.005919753,0.0002704869,0.0007920922,0.0008153256,0.00072098954,0.0010165442,0.0013289833,0.0011618885,0.0006685255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096107186,0.000087764165,0.0020748898,0.000080768834,0.00004673213,0.00010411087,0.00009423572,0.83868736,0.0026775496,0.016321208,0.0025108936,0.13721834],"study_design_scores_gemma":[0.0000069504376,0.000018834833,0.000060102942,0.00000400219,0.0000031634788,0.000011387758,0.0000069639786,0.99680007,0.0004567011,0.0022813138,0.000347951,0.0000025763677],"about_ca_topic_score_codex":0.0039268667,"about_ca_topic_score_gemma":0.0032364891,"teacher_disagreement_score":0.0039268667,"about_ca_system_score_codex":0.00068233476,"about_ca_system_score_gemma":0.0012821039,"threshold_uncertainty_score":0.012149274},"labels":[],"label_agreement":null},{"id":"W4409200114","doi":"10.1016/j.automatica.2025.112290","title":"Algorithms enhancement for optimal triggering control in logical dynamic systems: Leveraging data structure storage","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Innovation and Technology Commission; National Natural Science Foundation of China","keywords":"Computer science; Control (management); Algorithm; Artificial intelligence","score_opus":0.019753706924003616,"score_gpt":0.2931144804648437,"score_spread":0.27336077354084004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409200114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03328884,0.00021190498,0.9631895,0.00017181647,0.00006900534,0.000040510906,0.00002855601,0.0005656229,0.0024342013],"genre_scores_gemma":[0.8182513,0.00016230941,0.17966643,0.0000994252,0.000041064635,0.00007995281,0.000066104556,0.00010574465,0.0015276065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995671,0.00009312297,0.00003568286,0.00009797251,0.00013420942,0.00007195601],"domain_scores_gemma":[0.99897873,0.00044389456,0.00007840347,0.00023725638,0.00021301299,0.00004867908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007495068,0.0005268325,0.00067907263,0.0005069255,0.0005083832,0.0012452768,0.0010002352,0.00064173527,0.0027084295],"category_scores_gemma":[0.0029933196,0.00026716472,0.00040432054,0.0004726672,0.0005539202,0.001384606,0.0011058631,0.0009184097,0.0003227985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003264551,0.00018880442,0.0012310608,0.00011516458,0.00005284373,0.000114850125,0.00014997218,0.6854799,0.020281255,0.044927195,0.0018048545,0.24532762],"study_design_scores_gemma":[0.000008470363,0.000022219303,0.000057213383,0.0000030919734,0.0000059038116,0.00001280858,0.0000067341457,0.9925113,0.0017372353,0.005255586,0.00037614588,0.0000032893713],"about_ca_topic_score_codex":0.0020934518,"about_ca_topic_score_gemma":0.0023456295,"teacher_disagreement_score":0.0027084295,"about_ca_system_score_codex":0.0004919021,"about_ca_system_score_gemma":0.0014485264,"threshold_uncertainty_score":0.009060621},"labels":[],"label_agreement":null},{"id":"W4409278218","doi":"10.1101/2025.04.03.646975","title":"REvolutionH-tl: A Fast and Robust Tool for Decoding Evolutionary Gene Histories","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Decoding methods; Gene; Genetics; Biology; Evolutionary biology; Computer science; Computational biology; Algorithm","score_opus":0.016288723684395396,"score_gpt":0.22140098843240097,"score_spread":0.20511226474800556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409278218","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01236936,0.0009795694,0.580121,0.00038113658,0.00036154556,0.0001514929,0.033532154,0.36836246,0.0037412974],"genre_scores_gemma":[0.099808484,0.0006759367,0.73525506,0.00067105494,0.00017940669,0.0007632231,0.097758435,0.059851125,0.005037248],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982369,0.00034229245,0.00013542642,0.00062338915,0.0005408898,0.00012114114],"domain_scores_gemma":[0.9968028,0.0016327128,0.00033201542,0.0007139494,0.00038446346,0.00013409914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032502473,0.0021541037,0.0015891151,0.0052374303,0.0014209672,0.003437062,0.0037903748,0.0019024796,0.03222143],"category_scores_gemma":[0.013312665,0.0017445849,0.0028743919,0.0035730682,0.0013216578,0.0035744538,0.0039838157,0.0030430125,0.016950252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011010901,0.00019563819,0.012771815,0.0039893654,0.0011493844,0.0013485358,0.0013376503,0.06876394,0.041779637,0.040869292,0.42142776,0.4052659],"study_design_scores_gemma":[0.00058141205,0.00019235093,0.0042032124,0.0005291313,0.0002840383,0.0010864445,0.00045598965,0.6166556,0.04545647,0.09790427,0.23225497,0.00039610875],"about_ca_topic_score_codex":0.0036260101,"about_ca_topic_score_gemma":0.004842146,"teacher_disagreement_score":0.03222143,"about_ca_system_score_codex":0.00096503843,"about_ca_system_score_gemma":0.002377281,"threshold_uncertainty_score":0.107791424},"labels":[],"label_agreement":null},{"id":"W4409543171","doi":"10.1016/j.eswa.2025.127487","title":"Predicting wind turbines faults using Multi-Objective Genetic Programming","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Genetic programming; Computer science; Wind power; Genetic algorithm; Machine learning; Electrical engineering","score_opus":0.01614303241012859,"score_gpt":0.2805800546306219,"score_spread":0.2644370222204933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409543171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45679727,0.000483422,0.5366845,0.00038686057,0.00012821214,0.00010105639,0.00016211567,0.00051135407,0.004745144],"genre_scores_gemma":[0.9671651,0.000087220964,0.03169661,0.00003602318,0.0000142966,0.000042482206,0.00007408089,0.00002032468,0.0008637672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999772,0.00007362566,0.000012742119,0.000050601746,0.000058133817,0.000032824722],"domain_scores_gemma":[0.99894327,0.00076233095,0.00009659806,0.000025103356,0.00014343478,0.000029414758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072996825,0.0010912851,0.0010021133,0.0008997546,0.00036739773,0.0009905971,0.0007854021,0.0016430981,0.0008399136],"category_scores_gemma":[0.002577141,0.00059084245,0.0006246331,0.0007379375,0.00044709037,0.000705689,0.00038027842,0.0008602725,0.00013877012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013205996,0.000011423519,0.0003134869,0.0000050948183,0.000010605509,0.000015271831,0.0000032276846,0.9965346,0.00012863391,0.00009694622,0.00003754988,0.00282995],"study_design_scores_gemma":[0.000002069627,0.000005054839,0.0000726831,9.016628e-7,0.0000019491488,0.0000016071975,0.000001389874,0.99972373,0.000057354184,0.00012650061,0.0000060335215,7.982585e-7],"about_ca_topic_score_codex":0.011365952,"about_ca_topic_score_gemma":0.009221583,"teacher_disagreement_score":0.011365952,"about_ca_system_score_codex":0.0006803228,"about_ca_system_score_gemma":0.0006675699,"threshold_uncertainty_score":0.022599578},"labels":[],"label_agreement":null},{"id":"W4409694726","doi":"10.1007/978-3-031-90065-5","title":"Applications of Evolutionary Computation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Information and Communications Technology; Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement; Sorbonne Université; Région Normandie; Universität Konstanz; University of South Africa; Universidad de Granada; Syddansk Universitet; Technische Universität Berlin; Universidade de Lisboa; Universidade de Coimbra; Universitat Oberta de Catalunya; Universitetet i Oslo; Hong Kong Baptist University; Università degli Studi di Milano-Bicocca; Universidad Complutense de Madrid; University of Waterloo; University of Twente; Universidad de Extremadura; Università degli Studi di Torino; Università degli Studi di Trento; Università degli Studi di Parma; Heriot-Watt University; Queensland University of Technology; Iran Telecommunication Research Center; Swansea University; Edinburgh Napier University; Technische Universität Darmstadt; Cardiff University; Pomona College; Université de Lille; Universidad de Málaga; Carl von Ossietzky Universität Oldenburg; Università Degli Studi di Modena e Reggio Emila; Universiteit Leiden; Institut \"Jožef Stefan\"; Yeditepe Üniversitesi; Massachusetts Institute of Technology; University of North Carolina Wilmington; Eötvös Loránd Tudományegyetem; Silesian University of Technology; Université du Luxembourg; Sveučilište u Zagrebu; Aberystwyth University","keywords":"Computer science; Evolutionary computation; Computation; Artificial intelligence; Algorithm","score_opus":0.008527978703050977,"score_gpt":0.2561397067334402,"score_spread":0.24761172803038925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409694726","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056872964,0.09953815,0.44748417,0.0027351496,0.0029640172,0.00007156117,0.00021254722,0.00089021144,0.44041684],"genre_scores_gemma":[0.26391914,0.09266819,0.3667829,0.001217681,0.0031080712,0.000231595,0.000660267,0.00069493416,0.2707173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996495,0.00008903334,0.000015324476,0.0000576815,0.00016778617,0.000020630621],"domain_scores_gemma":[0.9995578,0.00025849178,0.000016627326,0.00007980986,0.00006552752,0.000021698805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043022048,0.0008053431,0.00089388154,0.0012892828,0.00047936596,0.0018758096,0.00085530063,0.0011101015,0.019173779],"category_scores_gemma":[0.0016880431,0.00039115554,0.00072092906,0.0015404021,0.0010496875,0.0014074516,0.001417219,0.0014473529,0.0042925673],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003661564,0.000039192182,0.00041974697,0.00049770356,0.000076421275,0.0001893363,0.00014232645,0.023951078,0.0030444786,0.5017631,0.035894178,0.4339458],"study_design_scores_gemma":[0.000016428537,0.000039558934,0.0006934495,0.00020269855,0.000027701579,0.0005823048,0.000060762843,0.06775698,0.0017398923,0.62561417,0.3032394,0.000026680136],"about_ca_topic_score_codex":0.0004965426,"about_ca_topic_score_gemma":0.00055739057,"teacher_disagreement_score":0.019173779,"about_ca_system_score_codex":0.00057409686,"about_ca_system_score_gemma":0.00035084056,"threshold_uncertainty_score":0.064142644},"labels":[],"label_agreement":null},{"id":"W4409771286","doi":"10.1109/tse.2025.3563121","title":"Testing CPS With Design Assumptions-Based Metamorphic Relations and Genetic Programming","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"HORIZON EUROPE European Innovation Council; Natural Sciences and Engineering Research Council of Canada; Fonds National de la Recherche Luxembourg; Science Foundation Ireland","keywords":"Computer science; Genetic programming; Programming language; Software engineering; Artificial intelligence","score_opus":0.01636564723815365,"score_gpt":0.2155209431462641,"score_spread":0.19915529590811046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409771286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07920576,0.000094476985,0.91626513,0.00063467247,0.00002042133,0.00015806263,0.00007558714,0.0010253225,0.0025205412],"genre_scores_gemma":[0.55949396,0.00019259556,0.43816915,0.00033609322,0.000033390428,0.0002994505,0.00025368025,0.00016133788,0.0010603338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926116,0.003266515,0.0004288764,0.0012883175,0.0019537013,0.00045100908],"domain_scores_gemma":[0.97777474,0.01752826,0.002006635,0.0015468065,0.0009376369,0.00020597248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044389125,0.0013716553,0.0006444028,0.0014228075,0.0004619307,0.001766617,0.001922481,0.0015423982,0.0011039538],"category_scores_gemma":[0.0274029,0.0006858266,0.0016689076,0.0008174268,0.0048361407,0.002521993,0.002185091,0.002384483,0.00015582595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002160026,0.00025254276,0.006050607,0.00019855796,0.00009095623,0.0008308699,0.0007552606,0.7633412,0.008002294,0.15004088,0.0006573038,0.06956354],"study_design_scores_gemma":[0.00004308347,0.00013293482,0.0003477371,0.000051165815,0.000037637896,0.00013017144,0.00007274424,0.9252043,0.0066712857,0.06632603,0.0009566597,0.000026259953],"about_ca_topic_score_codex":0.0042478936,"about_ca_topic_score_gemma":0.0026984108,"teacher_disagreement_score":0.0044389125,"about_ca_system_score_codex":0.0016565244,"about_ca_system_score_gemma":0.0017790173,"threshold_uncertainty_score":0.023475468},"labels":[],"label_agreement":null},{"id":"W4409852885","doi":"10.31468/dwr.1119","title":"Ctrl+AI+Learn","year":2025,"lang":"en","type":"article","venue":"Discourse and Writing/Rédactologie","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Psychology","score_opus":0.050864660082488314,"score_gpt":0.3887336018004602,"score_spread":0.3378689417179719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409852885","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049228915,0.0005249494,0.07744174,0.004540103,0.0016309522,0.0005145616,0.02043096,0.079251245,0.8107426],"genre_scores_gemma":[0.018536108,0.000338572,0.03025514,0.0010413502,0.00023572678,0.0004159577,0.017804299,0.010116004,0.92125684],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907434,0.00014169201,0.000042638098,0.00023725508,0.00037965394,0.00012439134],"domain_scores_gemma":[0.99858713,0.00035670836,0.000054889217,0.00035784143,0.00034182248,0.0003017255],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00091613515,0.0009814954,0.0005103146,0.0008255005,0.0011679718,0.0045715743,0.002063853,0.0010521079,0.4961302],"category_scores_gemma":[0.002621361,0.0005351974,0.00050820736,0.00092122256,0.0005947114,0.0027716495,0.003718342,0.0019148597,0.33991072],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013017468,0.00007266001,0.000244708,0.00020405232,0.0000041594562,0.00012069217,0.00046894897,0.00046081774,0.0023655049,0.013611522,0.7942727,0.188044],"study_design_scores_gemma":[0.000015209397,0.000021710339,0.00016670367,0.000023848803,0.0000014106365,0.000072603034,0.000078702295,0.0007648328,0.00085180736,0.001529053,0.9964629,0.00001118288],"about_ca_topic_score_codex":0.01065049,"about_ca_topic_score_gemma":0.025997784,"teacher_disagreement_score":0.4961302,"about_ca_system_score_codex":0.0021018242,"about_ca_system_score_gemma":0.0014855844,"threshold_uncertainty_score":0.7187091},"labels":[],"label_agreement":null},{"id":"W4409921220","doi":"10.1016/j.patter.2025.101242","title":"Fine-Pruning: A biologically inspired algorithm for personalization of machine learning models","year":2025,"lang":"en","type":"article","venue":"Patterns","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation; U.S. Department of Energy; National Science Foundation","keywords":"Pruning; Personalization; Computer science; Artificial intelligence; Machine learning; Algorithm; World Wide Web; Biology","score_opus":0.03328274057532203,"score_gpt":0.26833274286982406,"score_spread":0.23505000229450201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409921220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016261442,0.00017757068,0.9795292,0.00022465904,0.000039980827,0.000061918145,0.000039736715,0.0010406602,0.0026248666],"genre_scores_gemma":[0.29690018,0.00027914566,0.6966561,0.000389908,0.000059006077,0.0002950497,0.00025236563,0.0006214686,0.0045467964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995788,0.00011734972,0.000024683848,0.00010535606,0.00012004795,0.000053861902],"domain_scores_gemma":[0.99908197,0.00044474957,0.00008215041,0.00024777555,0.00009513923,0.000048147955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013435283,0.0009783943,0.0010686854,0.0011228175,0.0007548447,0.0008493197,0.0017758472,0.0012670326,0.0036592395],"category_scores_gemma":[0.0041677086,0.000773661,0.001017675,0.0007720043,0.0010755602,0.0014327788,0.0021765656,0.0016455317,0.0007789937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007172134,0.00010515635,0.0017810069,0.00008805519,0.000111807545,0.00020214748,0.0002733921,0.7040783,0.008910689,0.03386079,0.0048226207,0.24569432],"study_design_scores_gemma":[0.000012230441,0.0000271764,0.00008840602,0.000014317993,0.000014971351,0.000060670012,0.000015595753,0.98154163,0.0013071478,0.014751851,0.0021597021,0.000006392554],"about_ca_topic_score_codex":0.00239179,"about_ca_topic_score_gemma":0.0046608425,"teacher_disagreement_score":0.0036592395,"about_ca_system_score_codex":0.00073564646,"about_ca_system_score_gemma":0.0008311531,"threshold_uncertainty_score":0.012241423},"labels":[],"label_agreement":null},{"id":"W4409958101","doi":"10.3389/fgene.2025.1569358","title":"Constructing ancestral recombination graphs through reinforcement learning","year":2025,"lang":"en","type":"article","venue":"Frontiers in Genetics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Reinforcement learning; Recombination; Reinforcement; Computer science; Biology; Evolutionary biology; Artificial intelligence; Genetics; Psychology; Gene; Social psychology","score_opus":0.01157861896777953,"score_gpt":0.25415070241463295,"score_spread":0.2425720834468534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409958101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03313537,0.00028170433,0.9620517,0.00039901148,0.000039786333,0.00006910529,0.00009678971,0.0007976124,0.0031289067],"genre_scores_gemma":[0.5728036,0.00035632803,0.4224743,0.00032736518,0.000074168216,0.00024899704,0.0006011684,0.0003493544,0.0027646623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989974,0.00041247503,0.000045964276,0.00027349652,0.00018630915,0.00008444253],"domain_scores_gemma":[0.993309,0.0047147577,0.00054924114,0.00062173285,0.00053968944,0.00026558933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019555488,0.00085582363,0.0010280674,0.0012088916,0.00066013343,0.0009625174,0.0018514708,0.0012353066,0.004588699],"category_scores_gemma":[0.010000939,0.00059611,0.0011093223,0.0007522703,0.0017917559,0.0022332636,0.0017215047,0.0020236531,0.00072854874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069683156,0.0000910041,0.003398492,0.0001265628,0.00006205828,0.00014401652,0.0001523904,0.877781,0.0015102385,0.035338446,0.0020110346,0.079315014],"study_design_scores_gemma":[0.000013090799,0.000022203925,0.00016382949,0.000020146324,0.000011581835,0.000041383726,0.000015358357,0.9664642,0.00059097615,0.031592883,0.0010554295,0.000008917789],"about_ca_topic_score_codex":0.0034001768,"about_ca_topic_score_gemma":0.0030294864,"teacher_disagreement_score":0.004588699,"about_ca_system_score_codex":0.0013011519,"about_ca_system_score_gemma":0.0012832828,"threshold_uncertainty_score":0.015350699},"labels":[],"label_agreement":null},{"id":"W4410398148","doi":"10.1007/978-1-4614-6624-6_52-1","title":"Computing Distances Between Evolutionary Trees","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Evolutionary biology; Biology","score_opus":0.017450258892019514,"score_gpt":0.24873660732839176,"score_spread":0.23128634843637225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410398148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030158728,0.0015394813,0.9495037,0.00024708328,0.0002835094,0.000052215997,0.00050891965,0.001095224,0.016611176],"genre_scores_gemma":[0.17801678,0.0011966433,0.8005266,0.000106548054,0.00015502886,0.000084487474,0.0025538204,0.00079624396,0.016563818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987784,0.00018735613,0.000092287264,0.0003283242,0.0005532644,0.00006031816],"domain_scores_gemma":[0.99746585,0.0014935533,0.00013537642,0.00043092674,0.00038416084,0.000090102854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000851252,0.00067735434,0.0009712411,0.0021642798,0.0005704981,0.0020188976,0.0018542258,0.0009338786,0.010704297],"category_scores_gemma":[0.008693667,0.0005730082,0.00073701056,0.0029775086,0.0007487076,0.0038152642,0.0019999393,0.0015983308,0.0031554848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013258845,0.00006504351,0.0018418207,0.00037321635,0.000098981654,0.000099106335,0.00023844765,0.08490587,0.007987248,0.11903547,0.008709115,0.7765131],"study_design_scores_gemma":[0.000028834766,0.00015426111,0.0024180152,0.00016641374,0.000063715604,0.00052823924,0.00023749367,0.51455724,0.012012694,0.43155405,0.03822732,0.000051706687],"about_ca_topic_score_codex":0.00079571886,"about_ca_topic_score_gemma":0.0013903402,"teacher_disagreement_score":0.010704297,"about_ca_system_score_codex":0.0007193311,"about_ca_system_score_gemma":0.00044627793,"threshold_uncertainty_score":0.035809457},"labels":[],"label_agreement":null},{"id":"W4410427548","doi":"10.1109/access.2025.3570922","title":"A Biologically Inspired Program-Level Imitation Approach for Robots","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada Research Chairs","keywords":"Computer science; Robot; Imitation; Artificial intelligence; Human–computer interaction; Psychology","score_opus":0.09777814735732306,"score_gpt":0.3644676978081124,"score_spread":0.26668955045078935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410427548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016334286,0.00014264724,0.97795093,0.00022038312,0.00001898826,0.000041150633,0.000013625994,0.0005078334,0.0047700806],"genre_scores_gemma":[0.49288076,0.00036254377,0.49897555,0.0001471979,0.000023757057,0.000249562,0.000063758365,0.00012654906,0.0071703754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998634,0.000038908525,0.000005998967,0.000033418604,0.000045926135,0.000012445034],"domain_scores_gemma":[0.999833,0.000071567556,0.000021269345,0.000032223128,0.000027537677,0.0000144431315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002405495,0.00030330982,0.0002815129,0.00020945448,0.00029515853,0.00044069742,0.0009519241,0.0006594949,0.0015943993],"category_scores_gemma":[0.0008847202,0.00018635561,0.0004273519,0.00017326373,0.00086967024,0.00059276447,0.00061452994,0.00068962935,0.00029945784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055795495,0.00010473545,0.0012356297,0.0002177835,0.00007230651,0.00024663692,0.0003900168,0.6480279,0.07489597,0.14014591,0.0013610274,0.13324629],"study_design_scores_gemma":[0.000008866158,0.000070964285,0.00019410171,0.000010525691,0.000013129401,0.00009095559,0.00002019067,0.96315867,0.0052928394,0.026291626,0.004837768,0.000010423481],"about_ca_topic_score_codex":0.0010761013,"about_ca_topic_score_gemma":0.0011595804,"teacher_disagreement_score":0.0015943993,"about_ca_system_score_codex":0.00044121695,"about_ca_system_score_gemma":0.0004414418,"threshold_uncertainty_score":0.0053337812},"labels":[],"label_agreement":null},{"id":"W4410492186","doi":"10.2139/ssrn.5257327","title":"Why is Dating Exclusive? Signaling, Mimicking Behavior, and the Impact of Dating Technologies","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Dating violence; Medicine","score_opus":0.013026445975623647,"score_gpt":0.29490185030259225,"score_spread":0.2818754043269686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410492186","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7264134,0.005453644,0.059105948,0.032639023,0.0003324819,0.000080064965,0.00053312746,0.00016651314,0.17527576],"genre_scores_gemma":[0.9926922,0.001180153,0.0018138587,0.0008362506,0.00019108088,0.000021610163,0.000043568554,0.000021334823,0.0032000162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995891,0.0022754292,0.00017541948,0.0006661356,0.0005593502,0.00043256843],"domain_scores_gemma":[0.9271736,0.05182432,0.011537925,0.0054231766,0.0017831362,0.0022578712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011225793,0.0003490928,0.0014141303,0.0009829983,0.0018214752,0.0062124217,0.0014527577,0.006014678,0.016562192],"category_scores_gemma":[0.07921897,0.0005401542,0.0004942922,0.0013337084,0.0041827625,0.006535963,0.0020089324,0.0040058736,0.0012062984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094223104,0.00026023368,0.036141053,0.00032189992,0.00020838973,0.0005848349,0.0014931206,0.008444588,0.0025967932,0.8588163,0.003512781,0.08667778],"study_design_scores_gemma":[0.00012600767,0.00015674431,0.012225341,0.00010284073,0.0001432229,0.00077022053,0.0012337328,0.013396278,0.0009386223,0.96186507,0.00898396,0.000057927908],"about_ca_topic_score_codex":0.0010046116,"about_ca_topic_score_gemma":0.0009045541,"teacher_disagreement_score":0.016562192,"about_ca_system_score_codex":0.0009883435,"about_ca_system_score_gemma":0.0011153569,"threshold_uncertainty_score":0.059368372},"labels":[],"label_agreement":null},{"id":"W4410610472","doi":"10.1016/j.buildenv.2025.113170","title":"An economic room-level thermal management of air-cooled cloud data centers based on human brain emotional intelligence","year":2025,"lang":"en","type":"article","venue":"Building and Environment","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Emotional intelligence; Psychology; Environmental science; Business; Engineering; Computer science; Social psychology; Operating system","score_opus":0.033883484528934395,"score_gpt":0.28036408985791267,"score_spread":0.24648060532897828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410610472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38240364,0.0007931963,0.60148466,0.00044010943,0.00017452083,0.00023073296,0.00007899739,0.0015968373,0.012797281],"genre_scores_gemma":[0.9910479,0.00007218233,0.007782552,0.000046209687,0.00001140809,0.000032971675,0.000021060418,0.000009381525,0.00097616564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997727,0.000033646196,0.000009738036,0.0000644362,0.000079528174,0.000039989467],"domain_scores_gemma":[0.9998337,0.000030305684,0.000023901812,0.0000146145085,0.00007670816,0.000020621044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025682102,0.0004146164,0.00037455896,0.00021434283,0.00047552303,0.00072007696,0.0007899853,0.000277372,0.001022059],"category_scores_gemma":[0.00045330604,0.000117625976,0.00019715758,0.00015297474,0.00032022467,0.00052771607,0.0005230592,0.00037036525,0.000148387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010726177,0.00045400276,0.0067908,0.0003075293,0.00009108932,0.00043992864,0.000264667,0.6026756,0.14996527,0.00490151,0.004365436,0.2286716],"study_design_scores_gemma":[0.000028924718,0.00021853387,0.0017910592,0.000008544881,0.000023565804,0.0000430004,0.00005478634,0.9783149,0.01745106,0.0006407906,0.0014067157,0.000018173618],"about_ca_topic_score_codex":0.0026625518,"about_ca_topic_score_gemma":0.0030950971,"teacher_disagreement_score":0.0026625518,"about_ca_system_score_codex":0.0005618551,"about_ca_system_score_gemma":0.0006434078,"threshold_uncertainty_score":0.0052940845},"labels":[],"label_agreement":null},{"id":"W4410738697","doi":"10.1109/ciescompanion65073.2025.11010904","title":"Validation-based Decision Making in Data-driven Evolutionary Computation: A Case Study in Multi-objective Feature Selection","year":2025,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Wilfrid Laurier University","funders":"","keywords":"Feature selection; Computer science; Evolutionary computation; Artificial intelligence; Machine learning; Selection (genetic algorithm); Computation; Feature (linguistics); Data mining; Algorithm","score_opus":0.036870381968374624,"score_gpt":0.35318435986654967,"score_spread":0.31631397789817506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410738697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33929053,0.0013348722,0.6542311,0.0011169199,0.000071522045,0.00018246802,0.0000863598,0.00025787833,0.0034283367],"genre_scores_gemma":[0.88470525,0.00016144723,0.1142721,0.00011563891,0.000017608805,0.00009891157,0.00007328757,0.00003899139,0.00051680533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953492,0.0031639428,0.00020497733,0.00031272604,0.00077719096,0.00019194254],"domain_scores_gemma":[0.9685273,0.026764212,0.0008479934,0.0014585449,0.0021378524,0.00026404238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01361846,0.00095308985,0.0012462153,0.0009147806,0.00084795104,0.0015297877,0.0013836958,0.001922103,0.0006891493],"category_scores_gemma":[0.028529057,0.00036901172,0.00082372123,0.0011854803,0.001387125,0.0013561551,0.0012149886,0.0021794185,0.00010850799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022175824,0.00021820155,0.006755812,0.00016150359,0.000099097575,0.00032451918,0.00032188967,0.8850461,0.0020944,0.0088954475,0.00060671486,0.09525464],"study_design_scores_gemma":[0.00002053676,0.00010751753,0.0010395545,0.00003657953,0.000014837356,0.00007193516,0.000056685483,0.9879067,0.0032219368,0.0068942136,0.0006138098,0.000015658612],"about_ca_topic_score_codex":0.002340403,"about_ca_topic_score_gemma":0.0019709535,"teacher_disagreement_score":0.01361846,"about_ca_system_score_codex":0.0009902153,"about_ca_system_score_gemma":0.0009006711,"threshold_uncertainty_score":0.07202214},"labels":[],"label_agreement":null},{"id":"W4411335038","doi":"10.1101/2025.06.13.659495","title":"Paralog interference preserves genetic redundancy","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; PROTEO","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Interference (communication); Computer science; Telecommunications","score_opus":0.01650423017213794,"score_gpt":0.23464784609830824,"score_spread":0.2181436159261703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411335038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9225483,0.00027055657,0.0692312,0.00016187024,0.000030049514,0.000021277958,0.00013852971,0.00064067217,0.0069575915],"genre_scores_gemma":[0.9916236,0.000108877575,0.007342396,0.000054904674,0.00000936722,0.00001781097,0.0000908016,0.00008470164,0.0006675532],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993782,0.0001283075,0.00003994038,0.00015885044,0.00019893874,0.00009570205],"domain_scores_gemma":[0.9981317,0.0006475354,0.00028353994,0.0006534558,0.00012876096,0.00015508565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073312555,0.0006816461,0.00080820837,0.00062549807,0.00040920472,0.0008797982,0.0007269806,0.0006381731,0.0015378995],"category_scores_gemma":[0.0026293334,0.00033185456,0.00038765548,0.00035910206,0.000623991,0.0008447068,0.001246986,0.00081499113,0.00054426386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037039968,0.00016377491,0.012176594,0.0002104053,0.0001220857,0.0013048357,0.00029904395,0.052151605,0.845451,0.035899907,0.0006777498,0.051172607],"study_design_scores_gemma":[0.00009156998,0.0010024825,0.027954655,0.00005264041,0.0002402945,0.0061015226,0.00030255105,0.4923032,0.36034548,0.09437234,0.017129686,0.00010366565],"about_ca_topic_score_codex":0.00023613898,"about_ca_topic_score_gemma":0.0003110992,"teacher_disagreement_score":0.0015378995,"about_ca_system_score_codex":0.0005233318,"about_ca_system_score_gemma":0.00052942324,"threshold_uncertainty_score":0.005144775},"labels":[],"label_agreement":null},{"id":"W4412066749","doi":"10.55214/25768484.v9i7.8530","title":"Self-optimization of falaj irrigation using case-based reasoning algorithms","year":2025,"lang":"en","type":"article","venue":"Edelweiss Applied Science and Technology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Algorithm","score_opus":0.008829321260474858,"score_gpt":0.2508229381819166,"score_spread":0.24199361692144172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412066749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11341993,0.00023531818,0.87405944,0.0003649554,0.00004246844,0.00027582623,0.00012378067,0.00054789014,0.0109304525],"genre_scores_gemma":[0.7287318,0.000119764074,0.26826453,0.00007657835,0.000015889202,0.00022705393,0.00017147986,0.000051966785,0.0023409566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991234,0.00036543547,0.000057024663,0.0001731083,0.00018671757,0.00009430163],"domain_scores_gemma":[0.9985238,0.0009634882,0.00014382304,0.000106033505,0.0002124815,0.000050520353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015880981,0.000736966,0.00086186547,0.0013383636,0.00056515285,0.0015812628,0.0011991172,0.0011296743,0.0026107607],"category_scores_gemma":[0.0037046066,0.00052380766,0.00083892775,0.00090483896,0.0006855962,0.0010249936,0.001122662,0.0006088748,0.00019327085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024898587,0.0000420706,0.00065947324,0.000029889534,0.000019290183,0.000089858775,0.00004530313,0.975248,0.0004794934,0.0038876806,0.00026108942,0.019212974],"study_design_scores_gemma":[0.0000055502874,0.0000121971025,0.00006670417,0.0000038811118,0.000005254365,0.000009107711,0.000019518144,0.99785453,0.00015521258,0.0016528652,0.00021300878,0.0000022178049],"about_ca_topic_score_codex":0.00883657,"about_ca_topic_score_gemma":0.008200559,"teacher_disagreement_score":0.00883657,"about_ca_system_score_codex":0.0013870535,"about_ca_system_score_gemma":0.0014114382,"threshold_uncertainty_score":0.017570257},"labels":[],"label_agreement":null},{"id":"W4412505633","doi":"10.70777/si.v2i3.15063","title":"Darwin Gödel Machine: Open-Ended Evolution of Self-Improving Agents","year":2025,"lang":"en","type":"article","venue":"SuperIntelligence - Robotics - Safety & Alignment","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Darwin (ADL); Computer science; Software engineering","score_opus":0.017501471754553053,"score_gpt":0.28034707022915495,"score_spread":0.26284559847460187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412505633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097335786,0.00058013445,0.8791125,0.0009115592,0.00016244077,0.00016072324,0.00012315772,0.0019883302,0.01962548],"genre_scores_gemma":[0.65178573,0.00038776724,0.33982494,0.00028903387,0.000039824925,0.00029607242,0.00016706841,0.00036611038,0.0068434607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995198,0.0001527553,0.000021268157,0.0001007334,0.00015278356,0.00005277929],"domain_scores_gemma":[0.99832195,0.0008145462,0.00015536333,0.0004044744,0.00021371589,0.00008992409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011679055,0.0005028654,0.00048479775,0.0005275081,0.0006906063,0.0011576546,0.0015954875,0.0012100339,0.002358855],"category_scores_gemma":[0.0062058424,0.00038698828,0.0006253699,0.0003384255,0.002719186,0.0014752868,0.0014552874,0.0012138285,0.0004559798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013334623,0.0000655442,0.0029874118,0.00024414968,0.00010894938,0.0003420681,0.0008348593,0.5342573,0.01822562,0.35659447,0.004208212,0.08199814],"study_design_scores_gemma":[0.00005012832,0.00010379473,0.00044603978,0.000034400786,0.000033075466,0.00013003376,0.000076594326,0.85932255,0.0060755,0.12098952,0.012701004,0.00003739116],"about_ca_topic_score_codex":0.0017825782,"about_ca_topic_score_gemma":0.0013604525,"teacher_disagreement_score":0.002358855,"about_ca_system_score_codex":0.00084477843,"about_ca_system_score_gemma":0.0010089658,"threshold_uncertainty_score":0.007891178},"labels":[],"label_agreement":null},{"id":"W4412621057","doi":"10.1016/bs.host.2025.04.003","title":"Active learning of computer experiment with both quantitative and qualitative inputs","year":2025,"lang":"en","type":"book-chapter","venue":"Handbook of statistics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.026381038918473338,"score_gpt":0.3044409708634153,"score_spread":0.278059931944942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412621057","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002645389,0.00097110105,0.9856806,0.00024045997,0.00004296356,0.000051944975,0.00006502572,0.00031563526,0.009986974],"genre_scores_gemma":[0.23223542,0.002246041,0.75007194,0.00026679024,0.00022484038,0.0007372412,0.00028176542,0.00031028033,0.013625761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779665,0.0012877306,0.00008472284,0.00035652643,0.0004245934,0.000049728296],"domain_scores_gemma":[0.98129004,0.016539278,0.00037165533,0.001335032,0.00033604322,0.00012787597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004281403,0.0008614689,0.0010927223,0.0010861544,0.00030676936,0.0030532978,0.0019802134,0.0011226877,0.0077004153],"category_scores_gemma":[0.018317575,0.00072056946,0.0005867279,0.0013500436,0.0031935894,0.004859806,0.0016235876,0.0017974096,0.0012650429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011803304,0.0001701204,0.0016251483,0.0009242559,0.00013968624,0.000059805225,0.0006035392,0.09413449,0.003587388,0.5055508,0.0055560116,0.38753077],"study_design_scores_gemma":[0.000021524393,0.000055782657,0.0004442992,0.00011177602,0.000023199404,0.00007114911,0.00007924021,0.36186317,0.0028780745,0.6252107,0.009218692,0.000022337046],"about_ca_topic_score_codex":0.0005020002,"about_ca_topic_score_gemma":0.0008497528,"teacher_disagreement_score":0.0077004153,"about_ca_system_score_codex":0.0008619567,"about_ca_system_score_gemma":0.00084440666,"threshold_uncertainty_score":0.025760472},"labels":[],"label_agreement":null},{"id":"W4412846920","doi":"10.5376/cgg.2025.16.0015","title":"AI-Assisted Genomic Prediction Models in Cotton Breeding","year":2025,"lang":"en","type":"article","venue":"Cotton Genomics and Genetics","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genomic selection; Biology; Computational biology; Computer science; Biotechnology; Genetics; Genotype; Gene; Single-nucleotide polymorphism","score_opus":0.015345241814357199,"score_gpt":0.23835623768540784,"score_spread":0.22301099587105064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412846920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15539996,0.002168865,0.83092195,0.0016936859,0.00019076867,0.00007669673,0.0004992601,0.0023111524,0.0067377244],"genre_scores_gemma":[0.84804326,0.00063089014,0.14566375,0.00035403212,0.00013394038,0.00011830064,0.00075313274,0.0001340949,0.0041685896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965465,0.00015990605,0.00001750924,0.000072730225,0.00006605435,0.000029232604],"domain_scores_gemma":[0.99716645,0.0023164565,0.00009334354,0.00009874644,0.00026350396,0.00006143556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011303729,0.00043777676,0.0007523302,0.0009939328,0.00046858683,0.0008275656,0.0011640714,0.00091494754,0.0022837352],"category_scores_gemma":[0.004416703,0.00032450515,0.00049928535,0.0011150684,0.00046490986,0.0012235204,0.00058570737,0.0012871621,0.00043841297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009123438,0.0000860812,0.0017162792,0.000043737848,0.000056593963,0.00005701956,0.000041969157,0.902589,0.00094058196,0.0055678845,0.0016542382,0.0871553],"study_design_scores_gemma":[0.0000025948614,0.0000056358977,0.00008534883,0.0000017859054,0.0000030625397,0.000004147921,0.0000034587215,0.9969921,0.00010279504,0.0026859944,0.00011161723,0.0000014118301],"about_ca_topic_score_codex":0.011377917,"about_ca_topic_score_gemma":0.009204672,"teacher_disagreement_score":0.011377917,"about_ca_system_score_codex":0.0007777891,"about_ca_system_score_gemma":0.0007160375,"threshold_uncertainty_score":0.02262342},"labels":[],"label_agreement":null},{"id":"W4413195088","doi":"10.1016/j.chaos.2025.117007","title":"Connection-based framework for assessing natural complexity in nonlinear adaptive systems","year":2025,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia; Fulbright Portugal; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Connection (principal bundle); Nonlinear system; Natural (archaeology); Computer science; Mathematics; Mathematical optimization; Geology; Physics; Geometry","score_opus":0.050451259360212136,"score_gpt":0.3436959667600328,"score_spread":0.29324470739982067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413195088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01461135,0.00036221443,0.9818148,0.00014890761,0.000032072443,0.00007637103,0.00011766908,0.000114523114,0.0027220792],"genre_scores_gemma":[0.74523705,0.00079146086,0.25122118,0.000106001775,0.00016945547,0.00061910274,0.00030939287,0.000103772036,0.0014426879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978136,0.0010449444,0.00017443615,0.0003847689,0.0004654752,0.00011684158],"domain_scores_gemma":[0.9958383,0.002637975,0.00055903476,0.00028179336,0.000476718,0.00020618488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002945894,0.0019258132,0.00095587893,0.004745416,0.0008071532,0.0021869652,0.0014470125,0.0012514283,0.0023712125],"category_scores_gemma":[0.009630122,0.0005334708,0.0014926646,0.0019472806,0.0023820298,0.003838348,0.002498082,0.0016976643,0.00021156073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042699703,0.00006349339,0.0049096867,0.00021876709,0.00022715489,0.0002169945,0.00034299216,0.7067088,0.0030521576,0.25406677,0.0007316056,0.029418934],"study_design_scores_gemma":[0.000005240041,0.00004940829,0.0013761497,0.00002937742,0.000029810779,0.00006501469,0.00005340603,0.8936667,0.00027559334,0.1031309,0.0012853933,0.00003308197],"about_ca_topic_score_codex":0.0031861963,"about_ca_topic_score_gemma":0.001910195,"teacher_disagreement_score":0.004745416,"about_ca_system_score_codex":0.0015644594,"about_ca_system_score_gemma":0.0009108399,"threshold_uncertainty_score":0.015579581},"labels":[],"label_agreement":null},{"id":"W4413216311","doi":"10.1145/3712255.3716528","title":"Linear Genetic Programming","year":2025,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Genetic programming; Computer science; Linear programming; Artificial intelligence; Algorithm","score_opus":0.015980443105565623,"score_gpt":0.25074904061007236,"score_spread":0.23476859750450674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413216311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056490907,0.0016990165,0.88708794,0.0009838096,0.0002977509,0.000063945066,0.00023031652,0.0008461273,0.103141904],"genre_scores_gemma":[0.38686192,0.0022036799,0.4236335,0.00096188445,0.00038639543,0.00037009967,0.0010447841,0.00059929595,0.1839385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996623,0.000118647156,0.000010305585,0.000077577235,0.000095718206,0.000035574565],"domain_scores_gemma":[0.99956864,0.00023078767,0.000023538387,0.000045382767,0.000109796194,0.000021812424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046648574,0.00059385895,0.0006375144,0.00057052914,0.00048837124,0.0014527653,0.0009126754,0.00096619804,0.017851021],"category_scores_gemma":[0.001775411,0.00033046797,0.00053795945,0.00070652144,0.0006337681,0.00070785376,0.00084837456,0.001263735,0.004409209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059137757,0.000097649274,0.0004567374,0.00016577174,0.00006776713,0.00009244762,0.000084212494,0.37346914,0.0020730728,0.32081372,0.024952972,0.27766728],"study_design_scores_gemma":[0.000024146719,0.000038066417,0.00015826634,0.00004736742,0.000018136492,0.000051386694,0.000022885037,0.8360103,0.0010829923,0.13567394,0.02685767,0.000014967508],"about_ca_topic_score_codex":0.0034750027,"about_ca_topic_score_gemma":0.0038394877,"teacher_disagreement_score":0.017851021,"about_ca_system_score_codex":0.0009925403,"about_ca_system_score_gemma":0.0009698725,"threshold_uncertainty_score":0.059717655},"labels":[],"label_agreement":null},{"id":"W4414153585","doi":"10.1145/3767167","title":"The Havoc Paradox in Generator-Based Fuzzing—RCR Report","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fuzz testing; Artifact (error); Scripting language; Exploit; Affect (linguistics)","score_opus":0.04416990580043428,"score_gpt":0.3086626128790792,"score_spread":0.2644927070786449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414153585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09683044,0.0015775076,0.8334335,0.009699812,0.00207708,0.00040104843,0.0010032931,0.011718565,0.043258816],"genre_scores_gemma":[0.5992621,0.0012372722,0.37836614,0.0018828484,0.00060929515,0.00040560067,0.0015717249,0.0027376416,0.013927435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98660266,0.0038798745,0.00076489284,0.0012026146,0.0071211094,0.0004288488],"domain_scores_gemma":[0.9410555,0.035714664,0.0019522089,0.014074937,0.00662064,0.00058205065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012988102,0.00066526816,0.0007177486,0.0016171841,0.0010512888,0.003371084,0.0019034105,0.0015372824,0.0071406253],"category_scores_gemma":[0.061365854,0.0005465377,0.00068196224,0.0010574965,0.0021180897,0.0044787605,0.001850485,0.00308384,0.0013245549],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008827287,0.0008168563,0.0039350684,0.0007631406,0.00015180896,0.0008914797,0.0019454436,0.043856755,0.03729241,0.5345412,0.07382233,0.30110082],"study_design_scores_gemma":[0.00028035676,0.001195467,0.0030202137,0.00040329123,0.00016649223,0.0017039912,0.00048017234,0.37438384,0.2436597,0.257823,0.11656208,0.00032140547],"about_ca_topic_score_codex":0.0023954415,"about_ca_topic_score_gemma":0.0017049676,"teacher_disagreement_score":0.012988102,"about_ca_system_score_codex":0.0015576094,"about_ca_system_score_gemma":0.0020620457,"threshold_uncertainty_score":0.06868851},"labels":[],"label_agreement":null},{"id":"W4414158670","doi":"10.1007/978-3-031-94940-1_22","title":"Genetic Algorithm Visualization","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Knapsack problem; Attractor; Crossover; Visualization; Set (abstract data type); Genetic algorithm; Mutation","score_opus":0.02142362223658602,"score_gpt":0.29258255861860377,"score_spread":0.27115893638201777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414158670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055592014,0.0014089181,0.7763156,0.0011752875,0.0008703733,0.00012025804,0.0017601182,0.021658922,0.19113126],"genre_scores_gemma":[0.10730733,0.0024384703,0.7074626,0.00064286013,0.00023814016,0.00031929597,0.0038102935,0.0072908388,0.17049016],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999821,0.000038505816,0.0000064798855,0.000033280052,0.00008667875,0.000014097521],"domain_scores_gemma":[0.9997305,0.00010453131,0.000010813523,0.000052133804,0.000083744206,0.000018200955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029970717,0.0009273757,0.0004971964,0.0010602368,0.00038208187,0.0017361977,0.0009838683,0.0008610955,0.06296286],"category_scores_gemma":[0.0012586424,0.00036958593,0.0006334695,0.0011836749,0.00027833332,0.00089198,0.0009092436,0.001057756,0.013402146],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009945789,0.000069949616,0.00038948367,0.0002934067,0.000046032546,0.00018545032,0.00014559439,0.072397165,0.01613386,0.08328382,0.1727848,0.65417093],"study_design_scores_gemma":[0.000050538936,0.000062536725,0.0005513357,0.00021011072,0.00003506206,0.00035751433,0.00008384994,0.48655143,0.02430977,0.09946191,0.38827273,0.00005319868],"about_ca_topic_score_codex":0.0017344591,"about_ca_topic_score_gemma":0.0020381915,"teacher_disagreement_score":0.06296286,"about_ca_system_score_codex":0.00045586287,"about_ca_system_score_gemma":0.0006266665,"threshold_uncertainty_score":0.21063173},"labels":[],"label_agreement":null},{"id":"W4414359075","doi":"10.1108/jpbm-10-2024-5527","title":"How to identify line extensions that survive","year":2025,"lang":"en","type":"article","venue":"Journal of Product & Brand Management","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Penetration rate; Penetration (warfare); Market penetration; Product (mathematics); Product line","score_opus":0.022085224514505595,"score_gpt":0.2976231254936046,"score_spread":0.27553790097909897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414359075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96497667,0.0012997598,0.011405123,0.0023297889,0.00012792618,0.00033274625,0.0013395386,0.0005518282,0.01763659],"genre_scores_gemma":[0.9792651,0.0006628854,0.010758117,0.00037177018,0.000056157278,0.00008616307,0.0012715055,0.000113175214,0.007415126],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99795,0.00044741985,0.00023995433,0.00033411087,0.0007585615,0.00026998715],"domain_scores_gemma":[0.9644641,0.0077664885,0.015123294,0.002295669,0.0078038117,0.0025465784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003970712,0.0007014487,0.00046177817,0.0028514995,0.0007645502,0.0031008257,0.0010567805,0.00085736706,0.013750362],"category_scores_gemma":[0.032620095,0.00031055542,0.0005221223,0.0012508895,0.00075864873,0.004896815,0.0014427025,0.00101159,0.0066139135],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037221622,0.00022180077,0.77572507,0.00029860705,0.00005444774,0.00058348454,0.00228701,0.0012649004,0.0016146271,0.0012075953,0.0089572985,0.20741305],"study_design_scores_gemma":[0.00005797366,0.001676655,0.91691244,0.00085966877,0.00012297263,0.0030152935,0.018822066,0.013492849,0.006397155,0.006429823,0.032004047,0.00020924395],"about_ca_topic_score_codex":0.0035066565,"about_ca_topic_score_gemma":0.004897417,"teacher_disagreement_score":0.013750362,"about_ca_system_score_codex":0.00078239694,"about_ca_system_score_gemma":0.0011226021,"threshold_uncertainty_score":0.045999587},"labels":[],"label_agreement":null},{"id":"W4414437473","doi":"10.1007/978-3-032-05134-9_14","title":"Arithmetic Circuit Compilation Using Symbolic Probabilistic Inference and Indicator-Determined Buckets","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Benchmark (surveying); Inference; Probabilistic logic; Bayesian network; Key (lock); Reduction (mathematics); Construct (python library); Variable elimination","score_opus":0.026544622731242473,"score_gpt":0.269126548051733,"score_spread":0.24258192532049055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414437473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01588903,0.00020535593,0.9620252,0.0002063676,0.00014182394,0.00007226898,0.00023458825,0.007957613,0.013267586],"genre_scores_gemma":[0.39357936,0.00032011568,0.5939523,0.00022943423,0.0001170345,0.00019316238,0.0008292936,0.002210523,0.0085688485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985257,0.0002594309,0.00010665072,0.00034026217,0.0005685619,0.00019953995],"domain_scores_gemma":[0.9969337,0.0016434775,0.00014916614,0.0007809585,0.0004347474,0.00005801114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080797233,0.0008725247,0.0009388434,0.0015154608,0.0009603369,0.0026031618,0.00276168,0.0006927024,0.0146289915],"category_scores_gemma":[0.006178263,0.0008838232,0.0016169155,0.0018838142,0.0016205929,0.00380257,0.0024269337,0.0020679613,0.002422764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004146328,0.00013942645,0.0009960375,0.00062117033,0.00010520046,0.00019280912,0.00030360452,0.112957895,0.016861463,0.39037234,0.010689057,0.46634638],"study_design_scores_gemma":[0.00008090302,0.00008957659,0.00034125528,0.00014967732,0.00013950901,0.00018820941,0.000083395564,0.46841216,0.032694425,0.4845272,0.013213799,0.00007994111],"about_ca_topic_score_codex":0.0020797579,"about_ca_topic_score_gemma":0.004484117,"teacher_disagreement_score":0.0146289915,"about_ca_system_score_codex":0.0017153927,"about_ca_system_score_gemma":0.002123844,"threshold_uncertainty_score":0.04893881},"labels":[],"label_agreement":null},{"id":"W4414558358","doi":"","title":"Theory of arrays, high-performance code generation. Denotational semantics and mathematical problems","year":2025,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Denotational semantics; Semantics (computer science); Algebra over a field; Denotational semantics of the Actor model; Domain theory; Code (set theory); Calculus (dental)","score_opus":0.011269956160855089,"score_gpt":0.22421618346018934,"score_spread":0.21294622729933427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414558358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014974064,0.025648465,0.9016417,0.007083008,0.0008093952,0.000056754154,0.0003429783,0.0008978545,0.048545774],"genre_scores_gemma":[0.56463104,0.01760702,0.38995558,0.0017288972,0.0020594425,0.00044419031,0.00078471046,0.0005956535,0.022193544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987338,0.00041996277,0.00009793369,0.00023516722,0.00039600558,0.00011707901],"domain_scores_gemma":[0.99759716,0.0015464064,0.00018816855,0.00032188854,0.00028572272,0.000060628383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015748409,0.0010784324,0.00102643,0.0022126052,0.0014286294,0.0049704756,0.0019638126,0.0023298995,0.0053286077],"category_scores_gemma":[0.00610963,0.00086177804,0.0014136267,0.0034266114,0.0072890054,0.009404741,0.0017924323,0.003552965,0.001128676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068583167,0.000011579378,0.00005412149,0.00008423997,0.0000054702946,0.000015067642,0.000049706272,0.0038459224,0.00017739678,0.9842173,0.0016630124,0.009869302],"study_design_scores_gemma":[0.0000055114456,0.0000036379136,0.000043328688,0.000019614228,0.000005489372,0.00003107024,0.000015957816,0.0085835485,0.00017799524,0.9863338,0.0047746426,0.0000054680813],"about_ca_topic_score_codex":0.003023057,"about_ca_topic_score_gemma":0.0024852147,"teacher_disagreement_score":0.0053286077,"about_ca_system_score_codex":0.0034556347,"about_ca_system_score_gemma":0.0019310594,"threshold_uncertainty_score":0.025072515},"labels":[],"label_agreement":null},{"id":"W4414786717","doi":"10.1177/02783649251364000","title":"FORESEER: Recognize and utilize uncertainties by integrating data-based learning and symbolic feedback","year":2025,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Key Research and Development Program of China; Fundamental Research Funds for the Central Universities; Beijing Nova Program; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Adaptability; Robot; Parametric statistics; Feed forward; Feature (linguistics); Online model; Control (management)","score_opus":0.07047487487588197,"score_gpt":0.39788590281290953,"score_spread":0.3274110279370276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414786717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014040939,0.00013504615,0.9834146,0.00007564862,0.000028385608,0.00003376028,0.000030599804,0.00089954044,0.0013415568],"genre_scores_gemma":[0.80984646,0.00019695215,0.18760574,0.000080602615,0.00003760285,0.00009823862,0.00013480672,0.0001057063,0.0018938093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997569,0.00003172404,0.00001389237,0.00006864658,0.000093795905,0.000034964673],"domain_scores_gemma":[0.9994093,0.00019809789,0.00011820891,0.00012958056,0.00010796403,0.000036921934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354742,0.0008248342,0.0005071911,0.00036436247,0.00029660368,0.0006917221,0.0009424745,0.00053631497,0.0012959494],"category_scores_gemma":[0.0016634072,0.0002908042,0.0003918484,0.000225003,0.0007272252,0.0012566198,0.0016961964,0.000922116,0.00032974663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001569695,0.000086419925,0.0018847437,0.00014378707,0.000055485525,0.00018625574,0.00024670112,0.6593747,0.018501213,0.011381893,0.0011903117,0.30679148],"study_design_scores_gemma":[0.000007902722,0.000060713835,0.00020534034,0.000012609307,0.0000075471758,0.000031595486,0.000018541428,0.99115986,0.003848469,0.0036625534,0.0009745373,0.000010366417],"about_ca_topic_score_codex":0.002938772,"about_ca_topic_score_gemma":0.0037341749,"teacher_disagreement_score":0.002938772,"about_ca_system_score_codex":0.00030820316,"about_ca_system_score_gemma":0.0009719306,"threshold_uncertainty_score":0.0058433414},"labels":[],"label_agreement":null},{"id":"W4415018261","doi":"10.1016/b978-0-443-33633-1.00017-4","title":"Applications of generative AI for optimizing research in the agricultural business sector","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Campbell Scientific (Canada); Semtech (Canada)","funders":"","keywords":"Food security; Agribusiness; Supply chain; Agriculture; Resilience (materials science); Agricultural productivity; Carbon footprint; Production (economics); Big data","score_opus":0.04158669488209784,"score_gpt":0.31305694918031973,"score_spread":0.2714702542982219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415018261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074733538,0.0113017075,0.8494847,0.00232769,0.00026458804,0.00005452194,0.00010739996,0.00060352794,0.1283824],"genre_scores_gemma":[0.30551296,0.0135968365,0.6258303,0.00050263805,0.00030168222,0.00013858693,0.0002673803,0.0004307333,0.05341892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996643,0.00015844029,0.00001748396,0.00004232085,0.000101178455,0.000016272972],"domain_scores_gemma":[0.9986571,0.0010824961,0.000040142662,0.00011921269,0.000063515974,0.00003742864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139457,0.00058453955,0.00040012464,0.0007612623,0.0003538629,0.0015762766,0.0008415262,0.0008355324,0.0109200245],"category_scores_gemma":[0.002632563,0.00032601994,0.00050575874,0.0014750501,0.0010593685,0.0008472016,0.001016506,0.0011011494,0.0011418614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002266152,0.000046688067,0.00081534346,0.0002974436,0.000060341456,0.000111806105,0.00021259079,0.17708601,0.0027948783,0.40763095,0.008834837,0.4020865],"study_design_scores_gemma":[0.000015057404,0.000037044974,0.00058353896,0.00015355549,0.000031798736,0.00017544936,0.0001234955,0.36599478,0.0020870995,0.5672968,0.063481815,0.000019595755],"about_ca_topic_score_codex":0.0019900808,"about_ca_topic_score_gemma":0.003982904,"teacher_disagreement_score":0.0109200245,"about_ca_system_score_codex":0.000874771,"about_ca_system_score_gemma":0.0006865227,"threshold_uncertainty_score":0.03653109},"labels":[],"label_agreement":null},{"id":"W4415340732","doi":"10.1016/j.tcs.2025.115597","title":"Degrees are useless in Snort when measuring temperature","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Degree (music); Graph; Measure (data warehouse); Simple (philosophy); Position (finance)","score_opus":0.013955894777330653,"score_gpt":0.2413300981591317,"score_spread":0.22737420338180106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415340732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6925572,0.00058249786,0.28031823,0.0015246511,0.00023779501,0.000074852,0.0002902798,0.00077498646,0.023639433],"genre_scores_gemma":[0.9690121,0.00017001838,0.026658352,0.00030145232,0.000039800263,0.00008291987,0.00011046113,0.00023489627,0.0033899355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996042,0.001178843,0.00019651825,0.00092116,0.0008636131,0.0007979258],"domain_scores_gemma":[0.97570544,0.014138964,0.002200906,0.004139629,0.0016773958,0.0021376826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028662523,0.0008467097,0.0010203443,0.001175359,0.0016048729,0.0035599286,0.0018356397,0.0012600259,0.002812586],"category_scores_gemma":[0.03307235,0.0008432106,0.0008756913,0.00075338513,0.005280169,0.0076475777,0.0028031373,0.0028604944,0.00050808094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015532401,0.00017904375,0.013111834,0.00024592847,0.00010893814,0.0005984908,0.0019927807,0.14173806,0.032930113,0.7816185,0.0030807373,0.022842307],"study_design_scores_gemma":[0.00008362193,0.00022138545,0.0036814273,0.00008991674,0.00007462455,0.00073303375,0.00062073383,0.3874147,0.018240575,0.5829808,0.005699854,0.00015935108],"about_ca_topic_score_codex":0.0015900022,"about_ca_topic_score_gemma":0.001295665,"teacher_disagreement_score":0.0035599286,"about_ca_system_score_codex":0.0018891429,"about_ca_system_score_gemma":0.0010473856,"threshold_uncertainty_score":0.015158355},"labels":[],"label_agreement":null},{"id":"W4415367403","doi":"10.1109/isit63088.2025.11195651","title":"Communication with Perfect Feedback for Bit Flips and Erasures","year":2025,"lang":"","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bit (key); Encoding (memory); Sequence (biology); Decoding methods; Noise (video)","score_opus":0.012786026886733212,"score_gpt":0.25933863284913855,"score_spread":0.24655260596240533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415367403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18211684,0.00195515,0.77201945,0.004980887,0.0011059921,0.00012156808,0.0005990523,0.00072561204,0.03637549],"genre_scores_gemma":[0.96664757,0.00045871103,0.025250455,0.0003719972,0.00016131459,0.000066192646,0.000089092835,0.000060888167,0.0068937624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811244,0.00056267716,0.000094916286,0.00027686183,0.00051170273,0.00044136617],"domain_scores_gemma":[0.99204683,0.005331177,0.00047187152,0.0012504607,0.00070357,0.00019615698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023048106,0.0005947735,0.00090048875,0.00073364796,0.0013845209,0.0017034092,0.0009534946,0.0022853187,0.005775828],"category_scores_gemma":[0.018413998,0.0004274641,0.00049709785,0.0006538473,0.0019044781,0.0037565948,0.002861247,0.001612077,0.0006892761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008797849,0.00008317494,0.0009435519,0.00038104624,0.000068324014,0.00052589393,0.0004053215,0.21747042,0.010215943,0.6836196,0.007748234,0.077658705],"study_design_scores_gemma":[0.00008268574,0.000144346,0.00028188876,0.00008809704,0.000035873796,0.00032373398,0.00007658333,0.39845526,0.008409422,0.5881494,0.0038907048,0.00006192315],"about_ca_topic_score_codex":0.00074274564,"about_ca_topic_score_gemma":0.0007791143,"teacher_disagreement_score":0.005775828,"about_ca_system_score_codex":0.0009063412,"about_ca_system_score_gemma":0.0012208464,"threshold_uncertainty_score":0.019322097},"labels":[],"label_agreement":null},{"id":"W4415528645","doi":"10.1002/9781394296262.ch3","title":"Animal‐Behavior‐Inspired Algorithms in Analog Circuit Sizing Optimization","year":2025,"lang":"en","type":"other","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Firefly algorithm; Cuckoo search; Metaheuristic; Particle swarm optimization; Population; Ant colony optimization algorithms; Sizing; Extremal optimization","score_opus":0.018685776941413157,"score_gpt":0.260050342670579,"score_spread":0.24136456572916587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415528645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037697628,0.0032068293,0.9750845,0.0002482345,0.00008115549,0.000036074092,0.000038855145,0.0002695333,0.017265076],"genre_scores_gemma":[0.16060671,0.008620873,0.81022626,0.0002321103,0.00015453699,0.0002596393,0.00014424212,0.00019987149,0.019555734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999056,0.000026986543,0.0000056180374,0.000013394172,0.000041911215,0.0000064650576],"domain_scores_gemma":[0.99987304,0.00007812874,0.000014047698,0.0000128957,0.000018225472,0.0000035951455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929586,0.0006185135,0.00052079966,0.00039330762,0.0002324961,0.0006557454,0.00056578557,0.00057674997,0.0030297774],"category_scores_gemma":[0.0006613447,0.00025691578,0.00041127036,0.0008260561,0.00050469686,0.00047455452,0.0003959611,0.0007293038,0.0007287626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144574005,0.000032417352,0.00044220555,0.00020339311,0.000044268214,0.000042228778,0.000058357746,0.7324521,0.0033363262,0.0724769,0.0029617338,0.18793559],"study_design_scores_gemma":[0.000006740526,0.000019679166,0.00015511579,0.000033151653,0.000008831133,0.000039834067,0.0000127164185,0.95676804,0.0009860339,0.0258624,0.016099969,0.0000075964203],"about_ca_topic_score_codex":0.0014311048,"about_ca_topic_score_gemma":0.0018324509,"teacher_disagreement_score":0.0030297774,"about_ca_system_score_codex":0.00043926158,"about_ca_system_score_gemma":0.0003766077,"threshold_uncertainty_score":0.010135591},"labels":[],"label_agreement":null},{"id":"W4416530745","doi":"10.1007/s00170-025-17034-0","title":"Correction: Reinforcement learning for self-adaptive genetic algorithm in assembly sequence planning","year":2025,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Sequence (biology); Reinforcement learning; Genetic algorithm; Reinforcement; Genetic programming; Production planning","score_opus":0.011899152124682493,"score_gpt":0.2846941335728143,"score_spread":0.2727949814481318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416530745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018863322,0.00033940826,0.9681599,0.00084413553,0.0020572245,0.00012314529,0.00008621492,0.004329286,0.0051973406],"genre_scores_gemma":[0.6239443,0.00017586663,0.3576292,0.00045394723,0.00028910322,0.00017801028,0.00020594643,0.0007240623,0.016399618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991561,0.00027431245,0.00004272251,0.00013723309,0.00031543133,0.000074161086],"domain_scores_gemma":[0.99617684,0.001540144,0.00018648055,0.0005350202,0.0014575965,0.00010397355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015120324,0.0005384848,0.0006491947,0.00055543974,0.000634464,0.0007821856,0.001759338,0.0013621256,0.012105335],"category_scores_gemma":[0.013776772,0.00027412517,0.00034091668,0.0005161065,0.00066958583,0.0007843321,0.0012551377,0.0015247617,0.0016036966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059723575,0.00010784617,0.0019494673,0.0002563263,0.0000708372,0.0003043578,0.00015762092,0.46406898,0.006579199,0.019133048,0.021525944,0.4852491],"study_design_scores_gemma":[0.00004463705,0.000054735694,0.00022670963,0.000022811728,0.000011282257,0.00007434128,0.000013293102,0.98807496,0.0038695426,0.0038197702,0.0037779538,0.000010078908],"about_ca_topic_score_codex":0.0052532763,"about_ca_topic_score_gemma":0.0041397377,"teacher_disagreement_score":0.012105335,"about_ca_system_score_codex":0.00066719623,"about_ca_system_score_gemma":0.0014341958,"threshold_uncertainty_score":0.04049641},"labels":[],"label_agreement":null},{"id":"W4416727775","doi":"10.1109/mwscas53549.2025.11244398","title":"SymXplorer: A Designer's Toolbox for Automated Analog Circuit Topology Exploration","year":2025,"lang":"","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Network topology; Python (programming language); Transimpedance amplifier; Toolbox; Bayesian optimization; Circuit design; Analogue electronics; Electronic circuit; Topology (electrical circuits); Amplifier","score_opus":0.045182734352124,"score_gpt":0.30363177053484974,"score_spread":0.25844903618272574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416727775","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001443776,0.00035433032,0.81578803,0.00017274232,0.00012286668,0.00016584717,0.005989052,0.16679376,0.009169627],"genre_scores_gemma":[0.032003447,0.0015655952,0.8494669,0.0007298957,0.00011509671,0.0017552103,0.017327055,0.07038443,0.026652321],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917895,0.00015553854,0.00007175555,0.00013386259,0.0003851999,0.00007469521],"domain_scores_gemma":[0.998123,0.0011452482,0.00010860445,0.0002360731,0.0003081447,0.000078907724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017788056,0.0026308594,0.0011034864,0.0017972405,0.00046778395,0.0018608981,0.0035068197,0.0013618285,0.13613766],"category_scores_gemma":[0.0041777743,0.0014720508,0.0018161737,0.0010008881,0.00052735023,0.0018991153,0.0018939683,0.0030798365,0.03686172],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048744256,0.00024357063,0.0020741127,0.0034041423,0.00027176333,0.0011147237,0.0005014855,0.0486787,0.030049039,0.038831435,0.39006537,0.4842782],"study_design_scores_gemma":[0.0005120364,0.00019163844,0.001521694,0.00064974633,0.000088024855,0.0014437506,0.00015892462,0.29826358,0.037478447,0.05157156,0.60795254,0.00016807746],"about_ca_topic_score_codex":0.0010941213,"about_ca_topic_score_gemma":0.002134236,"teacher_disagreement_score":0.13613766,"about_ca_system_score_codex":0.00057541736,"about_ca_system_score_gemma":0.0014041094,"threshold_uncertainty_score":0.45542586},"labels":[],"label_agreement":null},{"id":"W4417124673","doi":"10.1162/isal.a.858","title":"Genetic Encoding and Shared Knowledge in Reinforcement Learning with Structured Memory","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Reinforcement learning; Encoding (memory); Genetic programming; Reinforcement; Constant (computer programming); Control (management)","score_opus":0.011801822491799889,"score_gpt":0.2528365909080778,"score_spread":0.2410347684162779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417124673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18627909,0.00023144942,0.81012744,0.00024540487,0.000032201842,0.00006358071,0.000051249855,0.0005199647,0.0024495886],"genre_scores_gemma":[0.9262463,0.000072339484,0.07234613,0.00005159236,0.000007752635,0.000100552075,0.000044431094,0.00003202688,0.0010988761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965906,0.000119636876,0.000019216726,0.00008443611,0.00006960943,0.000048066362],"domain_scores_gemma":[0.9985286,0.00087441574,0.00018297217,0.00019287821,0.00014298703,0.000078180245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008387472,0.00052941864,0.00051980483,0.00037955405,0.00029715477,0.0006163383,0.0011771808,0.0007723645,0.0013965387],"category_scores_gemma":[0.0043152226,0.0002940034,0.00031252226,0.00031769928,0.0011251587,0.0012027067,0.0008971646,0.0008505726,0.000117656375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053516695,0.000049097926,0.000761713,0.000028247723,0.000022062968,0.00008083516,0.000104027975,0.9535491,0.0020632101,0.01570629,0.00014758464,0.027434343],"study_design_scores_gemma":[0.000020060585,0.00005326825,0.0001252256,0.0000074070163,0.000008460142,0.000017377191,0.000011780589,0.98430574,0.00087159366,0.01431098,0.000262107,0.00000608785],"about_ca_topic_score_codex":0.002912472,"about_ca_topic_score_gemma":0.002865256,"teacher_disagreement_score":0.002912472,"about_ca_system_score_codex":0.00076997397,"about_ca_system_score_gemma":0.0008331727,"threshold_uncertainty_score":0.0057910085},"labels":[],"label_agreement":null},{"id":"W4417133656","doi":"10.1162/isal.a.897","title":"Integrating Neuroplasticity into Genetic Programming Agents for Adaptive Decision Making","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Reinforcement learning; Core (optical fiber); Memetics; Path (computing); Genetic programming; Adaptation (eye); Reinforcement; Order (exchange); Ant colony","score_opus":0.02546671363974189,"score_gpt":0.3179001603880881,"score_spread":0.2924334467483462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417133656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09449772,0.00029969553,0.8961745,0.00046833904,0.00007595918,0.00006392178,0.00003388795,0.0006241892,0.007761869],"genre_scores_gemma":[0.79534763,0.00023994746,0.20138678,0.00016824472,0.000019163997,0.00014241332,0.00003237117,0.000078601464,0.0025848835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998747,0.000042636373,0.000006566558,0.00002539852,0.000035695986,0.000015000842],"domain_scores_gemma":[0.99954766,0.00024807788,0.000057942125,0.00005710685,0.000052994415,0.000036200003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048177852,0.00035472316,0.00030837217,0.00031027902,0.00023661,0.00067378837,0.0008718494,0.00061432936,0.0018475034],"category_scores_gemma":[0.0018454198,0.00019475371,0.00028938454,0.00022263001,0.0008697063,0.00063890184,0.00072092353,0.0010026719,0.00021003364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041946692,0.00007800659,0.0008434874,0.00007089141,0.00005041929,0.00010778768,0.00010576801,0.8740576,0.015742047,0.051878568,0.00058472616,0.056438733],"study_design_scores_gemma":[0.000009165201,0.000035591274,0.000114132476,0.00000877821,0.000008005252,0.000028972197,0.000012020805,0.97260654,0.0017342668,0.024175439,0.0012605442,0.000006517125],"about_ca_topic_score_codex":0.001157208,"about_ca_topic_score_gemma":0.0014995956,"teacher_disagreement_score":0.0018475034,"about_ca_system_score_codex":0.0005071938,"about_ca_system_score_gemma":0.0005620471,"threshold_uncertainty_score":0.006180525},"labels":[],"label_agreement":null},{"id":"W4417470439","doi":"10.2139/ssrn.5744303","title":"&lt;div&gt; Evolutionary Market Intelligence Framework for Self-Adaptive Quantitative System&lt;/div&gt;","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alpha Technologies (Canada)","funders":"","keywords":"Key (lock); Interpretability; Expert system; Order (exchange)","score_opus":0.017813132719415495,"score_gpt":0.28435438349982534,"score_spread":0.26654125078040986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417470439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004333557,0.00080028846,0.9396198,0.0035270266,0.00030092095,0.00006448341,0.00020615551,0.0003890164,0.05075875],"genre_scores_gemma":[0.57632893,0.0015205124,0.33542344,0.0014719262,0.0007631117,0.0003278902,0.00036214577,0.000595089,0.08320699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996191,0.0001316572,0.0000150200385,0.000061125815,0.00013784009,0.00003520288],"domain_scores_gemma":[0.99958175,0.00015951025,0.000039541435,0.00006672131,0.00011091679,0.000041506148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011117544,0.0006870198,0.00088681455,0.00060536707,0.00058292336,0.0016892923,0.0018289421,0.0018200341,0.01835412],"category_scores_gemma":[0.0022364107,0.0003007333,0.0008881269,0.0009582005,0.0016342751,0.002020545,0.0015458218,0.0022147493,0.0019689775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014892536,0.000016054126,0.000106280975,0.00006330061,0.000026328122,0.00006630071,0.0000445916,0.04179381,0.00059453485,0.92844415,0.0074037714,0.02142599],"study_design_scores_gemma":[0.000014713466,0.000018331684,0.00014085924,0.000016304675,0.000008821048,0.00003876042,0.00001390171,0.40724435,0.00035061853,0.5802997,0.011839762,0.000014050403],"about_ca_topic_score_codex":0.0043380074,"about_ca_topic_score_gemma":0.0028902723,"teacher_disagreement_score":0.01835412,"about_ca_system_score_codex":0.0015155814,"about_ca_system_score_gemma":0.00095190376,"threshold_uncertainty_score":0.061400652},"labels":[],"label_agreement":null},{"id":"W54112846","doi":"10.1007/978-1-4615-1681-1_3","title":"Software Techniques for Efficient Polymorphic Calls","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Section (typography); Software; Operating system","score_opus":0.019462620312918136,"score_gpt":0.2457890954890806,"score_spread":0.22632647517616244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54112846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032969061,0.00079928956,0.9798427,0.00016185374,0.00009386039,0.000045218858,0.000041311945,0.0020076141,0.0137112085],"genre_scores_gemma":[0.07669653,0.0020587246,0.89177316,0.0001989068,0.00016299813,0.0002805913,0.00026335893,0.0018390268,0.026726786],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990227,0.00016005266,0.000051915024,0.00010928298,0.0005573046,0.000098686956],"domain_scores_gemma":[0.9987047,0.00063296745,0.00005949097,0.00043402892,0.00014652715,0.000022277754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072745985,0.0010048341,0.0007128922,0.0011441077,0.00093484274,0.001486069,0.0022062347,0.0011408873,0.011350927],"category_scores_gemma":[0.0038981894,0.0009734709,0.0011661663,0.002075336,0.001399633,0.0029554188,0.0020079797,0.0033073039,0.0045262873],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006355772,0.000057194455,0.00022495489,0.0003728121,0.000037321173,0.00011604957,0.0003788837,0.010059957,0.012549559,0.38871986,0.01380203,0.5736178],"study_design_scores_gemma":[0.00008838083,0.000101194026,0.00044893468,0.00024908833,0.00012470913,0.0010313526,0.00012194671,0.12299582,0.023772841,0.65702444,0.19397536,0.00006592034],"about_ca_topic_score_codex":0.0003903686,"about_ca_topic_score_gemma":0.0007145015,"teacher_disagreement_score":0.011350927,"about_ca_system_score_codex":0.0004708769,"about_ca_system_score_gemma":0.0007095315,"threshold_uncertainty_score":0.03797263},"labels":[],"label_agreement":null},{"id":"W58691558","doi":"","title":"The evaluation of a stochastic regular motif language for protein sequences","year":2001,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Regular expression; Hidden Markov model; DNA sequencing; Motif (music); Sequence motif; Natural language processing; Probabilistic logic; Markov chain; Artificial intelligence; DNA; Theoretical computer science; Computational biology; Genetics; Biology; Programming language; Machine learning","score_opus":0.034976796700390514,"score_gpt":0.31268179699816545,"score_spread":0.27770500029777495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58691558","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26438576,0.00035702842,0.7207769,0.0007617041,0.000111981244,0.00014637025,0.00043957308,0.0022793948,0.010741289],"genre_scores_gemma":[0.7313384,0.00022324274,0.2624933,0.00017625798,0.00004325839,0.00013732667,0.0007883764,0.0004933775,0.00430646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974548,0.00096449937,0.0001467204,0.00038002356,0.000895685,0.00015822903],"domain_scores_gemma":[0.9963929,0.002014738,0.00027186802,0.00032488667,0.000875035,0.000120505814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586295,0.00048399257,0.00056830066,0.00064054434,0.00041362806,0.0013940943,0.0009204464,0.00084518216,0.0017855674],"category_scores_gemma":[0.008708495,0.0002027471,0.00072248926,0.00050540117,0.0010948454,0.0016697429,0.00068582495,0.0007186277,0.00040846618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054871844,0.00023174816,0.0019541774,0.00052180345,0.00006690164,0.0005385589,0.00044686775,0.47719434,0.062625185,0.2883599,0.004327669,0.163184],"study_design_scores_gemma":[0.00001935692,0.00018239644,0.0001844337,0.000016107415,0.00001372416,0.00012810083,0.000059413036,0.9475952,0.018424498,0.030590313,0.0027645973,0.000021927655],"about_ca_topic_score_codex":0.0016405149,"about_ca_topic_score_gemma":0.001523082,"teacher_disagreement_score":0.002586295,"about_ca_system_score_codex":0.0013552887,"about_ca_system_score_gemma":0.0010746655,"threshold_uncertainty_score":0.013677776},"labels":[],"label_agreement":null},{"id":"W586938665","doi":"","title":"Reflections on adaptive behavior : essays in honor of J.E.R. Staddon","year":2008,"lang":"de","type":"book","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Behaviorism; Honor; Psychology; Psychoanalysis; Sociology; Humanities; Cognitive science; Epistemology; Philosophy; Computer science","score_opus":0.06352086191095974,"score_gpt":0.32111016593329367,"score_spread":0.25758930402233393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W586938665","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005101698,0.042885974,0.00019611699,0.92144644,0.029236346,0.0000042392953,0.0000149400175,0.000010403459,0.0056953686],"genre_scores_gemma":[0.055270355,0.10149828,0.0010203994,0.6821397,0.116564006,0.000094099174,0.000056844856,0.00020296675,0.043153353],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99428564,0.0030269055,0.00018536375,0.00074261986,0.0011576863,0.00060181704],"domain_scores_gemma":[0.98291355,0.010992943,0.0005802334,0.0004722094,0.002775564,0.002265412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00980796,0.0013792674,0.001294508,0.0010261168,0.004881003,0.0062025087,0.0027126302,0.009713809,0.004124117],"category_scores_gemma":[0.027899712,0.00059372827,0.0008072259,0.0011232033,0.012724643,0.0074067186,0.0038388988,0.026806625,0.002255351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001823835,0.000051192445,0.00016445245,0.00007068891,0.000008931216,0.000089952286,0.0029297825,0.000053150157,0.00004536745,0.020999294,0.9639408,0.011628265],"study_design_scores_gemma":[0.000012766806,0.000016295873,0.0007765549,0.0004815453,0.0000055593387,0.00011012756,0.0037034294,0.000050591207,0.000043141055,0.019362506,0.9754159,0.000021521695],"about_ca_topic_score_codex":0.0072165593,"about_ca_topic_score_gemma":0.009074247,"teacher_disagreement_score":0.00980796,"about_ca_system_score_codex":0.0061727697,"about_ca_system_score_gemma":0.0041588224,"threshold_uncertainty_score":0.051870048},"labels":[],"label_agreement":null},{"id":"W649579275","doi":"","title":"Learning Classifier Systems : 11th International Workshop, IWLCS 2008, Atlanta, GA, USA, July 13, 2008, and 12th International Workshop, IWLCS 2009, Montreal, QC, Canada, July 9, 2009 : revised selected papers","year":2010,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Atlanta; Library science; Artificial intelligence; Geography; Operations research; Computer science; Engineering; Archaeology","score_opus":0.00955745056348549,"score_gpt":0.21491400588531884,"score_spread":0.20535655532183333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W649579275","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070782085,0.18924515,0.55076414,0.02015795,0.048273277,0.0008488113,0.0069841594,0.013422416,0.16322592],"genre_scores_gemma":[0.015396851,0.06348734,0.21520552,0.0032559284,0.0062804776,0.0004942723,0.014168758,0.0034723228,0.67823863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987935,0.00015830787,0.0000868795,0.00024029025,0.0006245415,0.00009642095],"domain_scores_gemma":[0.9978083,0.00037288014,0.0000538729,0.00023256443,0.0013226698,0.00020969489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027374562,0.0015684001,0.001862383,0.0017861155,0.00080195634,0.004320655,0.002186065,0.0020443974,0.033697948],"category_scores_gemma":[0.0035787143,0.0009562979,0.0008891438,0.0029691616,0.000823159,0.0044055786,0.0016508665,0.0030495783,0.0290529],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005987545,0.000087036715,0.00021223682,0.00034164533,0.00003217096,0.00004681239,0.000060916045,0.0011785106,0.0013448403,0.0039561107,0.72075933,0.27192053],"study_design_scores_gemma":[0.000030421888,0.000103241306,0.0013031542,0.00039203156,0.00004722217,0.00042861846,0.00009077328,0.013348841,0.0025310388,0.012065551,0.9696258,0.00003329244],"about_ca_topic_score_codex":0.007211549,"about_ca_topic_score_gemma":0.017103633,"teacher_disagreement_score":0.033697948,"about_ca_system_score_codex":0.0016600768,"about_ca_system_score_gemma":0.0030746812,"threshold_uncertainty_score":0.1127308},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007714113838109909,"score_gpt":0.21976280536040188,"score_spread":0.21204869152229197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6539208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7611672,0.00031874076,0.22677453,0.00046794812,0.000106642925,0.000068262336,0.00007921705,0.0017384343,0.009278937],"genre_scores_gemma":[0.911677,0.00020419376,0.08485409,0.00012279178,0.000015134106,0.0000705392,0.00008333544,0.00013598113,0.002836974],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987304,0.000024156343,0.00000552955,0.000029807747,0.00003067392,0.000036881233],"domain_scores_gemma":[0.9997025,0.00011129684,0.000033426742,0.00008926413,0.00004211773,0.000021438946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017507172,0.00045430206,0.00042244204,0.0002563083,0.00022085491,0.00058680115,0.000600248,0.00085900247,0.0008567399],"category_scores_gemma":[0.0011156827,0.0001769939,0.0002518698,0.0002493799,0.00031059183,0.00039074387,0.00039397576,0.00050048897,0.00034962784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001354169,0.00016285572,0.0035489893,0.00018404548,0.00011766628,0.0005508203,0.00025350918,0.2807386,0.56380236,0.0078100814,0.0013993961,0.14129621],"study_design_scores_gemma":[0.000058828973,0.00031161096,0.0036038181,0.00002633324,0.000116469935,0.00096627587,0.00013086353,0.8614862,0.10970711,0.006455701,0.017085332,0.00005136609],"about_ca_topic_score_codex":0.0008618281,"about_ca_topic_score_gemma":0.0012228022,"teacher_disagreement_score":0.0008618281,"about_ca_system_score_codex":0.00015161104,"about_ca_system_score_gemma":0.0003360986,"threshold_uncertainty_score":0.0028660297},"labels":[],"label_agreement":null},{"id":"W66126747","doi":"10.1007/978-3-662-44303-3_4","title":"Semantic Crossover Based on the Partial Derivative Error","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Addiction and Mental Health","funders":"","keywords":"Crossover; Symbolic regression; Genetic programming; Computer science; Operator (biology); Genetic algorithm; Semantics (computer science); Artificial intelligence; Theoretical computer science; Algorithm; Machine learning; Programming language","score_opus":0.01993822553721742,"score_gpt":0.2539230823723656,"score_spread":0.2339848568351482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66126747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04340729,0.0006153545,0.9361336,0.00024909194,0.00038563414,0.00010503471,0.00007979259,0.0006704369,0.018353792],"genre_scores_gemma":[0.67873,0.00037256524,0.30619842,0.0002240596,0.00014586859,0.0001557524,0.0002118901,0.0003959406,0.013565525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995111,0.00011002813,0.00003144309,0.000087880406,0.00020058747,0.000059007038],"domain_scores_gemma":[0.99924195,0.00036916966,0.000038472284,0.0001714838,0.00013844865,0.00004051233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097571855,0.0004003921,0.0010809009,0.000875766,0.0006261915,0.0010843435,0.0011681792,0.0009437051,0.0074254866],"category_scores_gemma":[0.0022119903,0.00018855064,0.00064917706,0.0011783723,0.0009977453,0.0014650968,0.0012486143,0.0013195436,0.0005201515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039390646,0.00020617414,0.0005064015,0.00023937896,0.00007398457,0.0002036281,0.00019304012,0.09322766,0.027776115,0.53133506,0.0039617554,0.34188282],"study_design_scores_gemma":[0.00018490461,0.00027759848,0.00090096175,0.000064010615,0.00012096943,0.00049007154,0.00006126464,0.7437227,0.014622147,0.23040764,0.009091439,0.00005627484],"about_ca_topic_score_codex":0.00040642178,"about_ca_topic_score_gemma":0.00063050294,"teacher_disagreement_score":0.0074254866,"about_ca_system_score_codex":0.00060139043,"about_ca_system_score_gemma":0.0005463241,"threshold_uncertainty_score":0.024840713},"labels":[],"label_agreement":null},{"id":"W6893963877","doi":"10.5281/zenodo.5967132","title":"Pleocoma laker Marshall 2018, new species","year":2018,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Seta; Type locality; Arthropod; Groove (engineering); Holotype","score_opus":0.04159437940257591,"score_gpt":0.24381786294624444,"score_spread":0.20222348354366854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893963877","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11587402,0.015934248,0.007824829,0.0034232496,0.0012751245,0.00081955537,0.004670717,0.0023215744,0.84785664],"genre_scores_gemma":[0.78706026,0.008587294,0.012471219,0.002064579,0.0012990983,0.0007422121,0.0056443443,0.00040199273,0.18172911],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997104,0.000024778592,0.00002305611,0.00008970707,0.00010702744,0.00004506644],"domain_scores_gemma":[0.99970406,0.00003635718,0.00009944625,0.000041630556,0.0000700151,0.00004851326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022659615,0.00075136364,0.00033629747,0.0015732568,0.0021860963,0.00091047323,0.0011453889,0.0006120136,0.04856275],"category_scores_gemma":[0.0007735718,0.00026044928,0.000193709,0.0009710042,0.0008673164,0.00261517,0.0019896717,0.0016244451,0.011488395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003319577,0.00014490876,0.021936197,0.0012550452,0.0000821508,0.0041045113,0.004022015,0.0003533085,0.013858742,0.017022168,0.18842357,0.7484655],"study_design_scores_gemma":[0.000041675183,0.000099220444,0.049462717,0.0006058322,0.00009788958,0.0048001893,0.0015290814,0.00031378365,0.0011171598,0.0026717125,0.93922675,0.000034007448],"about_ca_topic_score_codex":0.00888642,"about_ca_topic_score_gemma":0.021462088,"teacher_disagreement_score":0.04856275,"about_ca_system_score_codex":0.0010515016,"about_ca_system_score_gemma":0.00079857203,"threshold_uncertainty_score":0.16245854},"labels":[],"label_agreement":null},{"id":"W6908337423","doi":"10.26071/eee1e907-cc6a-4e04","title":"Mémoires et évaluations environnementales stratégiques rédigés par le Comité ZIP CNG","year":2025,"lang":"en","type":"dataset","venue":"OGSL repository","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Bay; Environmental impact assessment; Submarine pipeline; Offshore oil and gas; Strategic environmental assessment; Fossil fuel","score_opus":0.011374596972211942,"score_gpt":0.2657174862730781,"score_spread":0.2543428893008662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6908337423","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012146934,0.00028626915,0.00018788678,0.000254943,0.000064367916,0.00003681306,0.9955771,0.0003596552,0.002018323],"genre_scores_gemma":[0.002438462,0.00015142762,0.00083777064,0.0000884566,0.000014603812,0.00022160416,0.9942562,0.00007001611,0.001921516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770904,0.00063853397,0.00022498859,0.0004922838,0.0006860472,0.00024905748],"domain_scores_gemma":[0.99484813,0.0022743745,0.00036380757,0.0010751579,0.0011541027,0.00028445586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022658815,0.0020808142,0.0010345924,0.0041224137,0.0009290361,0.0032140515,0.0025734813,0.0024880522,0.03172166],"category_scores_gemma":[0.01247866,0.00059497677,0.0014326144,0.006471242,0.0004824605,0.0014185159,0.0017402802,0.0020368486,0.031378236],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009686568,0.00005362246,0.0027621284,0.0006665368,0.000044224762,0.00003076957,0.00008083912,0.0012489172,0.00007544619,0.0010343426,0.98786,0.0060463306],"study_design_scores_gemma":[0.00038164874,0.00005649363,0.011200028,0.0006608983,0.00004743921,0.000080806014,0.00039971902,0.003497603,0.000486145,0.0022952335,0.9808462,0.000047816662],"about_ca_topic_score_codex":0.08730457,"about_ca_topic_score_gemma":0.16928431,"teacher_disagreement_score":0.08730457,"about_ca_system_score_codex":0.0037577585,"about_ca_system_score_gemma":0.0034402807,"threshold_uncertainty_score":0.1735928},"labels":[],"label_agreement":null},{"id":"W6924581681","doi":"10.15468/dl.wyw3tt","title":"Occurrence Download","year":2019,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Order (exchange)","score_opus":0.016684649335686825,"score_gpt":0.22463040174169718,"score_spread":0.20794575240601035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924581681","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005557925,0.000039139733,0.00005170171,0.000041225896,0.00001474643,0.0000077315335,0.99853563,0.0004987752,0.0007555596],"genre_scores_gemma":[0.00017279712,0.000036314144,0.00020563968,0.00004893523,0.0000037470363,0.000041691987,0.99892646,0.00012617883,0.00043817304],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896646,0.00013533451,0.00013247461,0.00035278505,0.000240841,0.00017216627],"domain_scores_gemma":[0.99785763,0.0005175042,0.00018418141,0.0005991515,0.00057214685,0.00026940714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009018823,0.0019714704,0.0014596254,0.005035621,0.0009255577,0.0023054925,0.0027971684,0.0020079596,0.13893294],"category_scores_gemma":[0.0054717083,0.0007847415,0.0011914677,0.008986954,0.00041413013,0.0021926612,0.0025266465,0.0018627705,0.20798658],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002904754,0.00001129062,0.00031245913,0.00045733576,0.000013557558,0.000013708845,0.000016524262,0.00011629503,0.00011549627,0.00033198667,0.9970408,0.0015414503],"study_design_scores_gemma":[0.00007379116,0.000008948844,0.0016644303,0.00016821052,0.00001303084,0.00003988262,0.00006047563,0.0001843953,0.00021239847,0.00076356623,0.99679524,0.000015647212],"about_ca_topic_score_codex":0.01978637,"about_ca_topic_score_gemma":0.037617344,"teacher_disagreement_score":0.86106706,"about_ca_system_score_codex":0.0015796894,"about_ca_system_score_gemma":0.0022966408,"threshold_uncertainty_score":0.464777},"labels":[],"label_agreement":null},{"id":"W6924798317","doi":"10.15468/dl.rdaxx5","title":"Occurrence Download","year":2023,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); R package; Data set","score_opus":0.017232849828101738,"score_gpt":0.2276852754107917,"score_spread":0.21045242558268995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924798317","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006275455,0.00003961286,0.000051189276,0.000041585645,0.000012162636,0.000006158606,0.99874926,0.00041193864,0.00062525726],"genre_scores_gemma":[0.0001875335,0.00003740072,0.0001995842,0.0000448247,0.0000030722936,0.000039237508,0.9990244,0.00010275586,0.00036116515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905807,0.00012952341,0.00012175282,0.00032445844,0.0002159991,0.0001502068],"domain_scores_gemma":[0.9981219,0.00052123936,0.00017300458,0.0004974567,0.0004632912,0.00022308528],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089694525,0.0020483744,0.0015817388,0.004572722,0.0009662179,0.0023647286,0.0029086927,0.0021697062,0.11342701],"category_scores_gemma":[0.005222263,0.0008202271,0.0012137457,0.0090919165,0.00043023666,0.0020879335,0.0022698736,0.0020246191,0.16802122],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003386722,0.000014814978,0.00042505137,0.0005664768,0.000017188006,0.000016707905,0.000020911048,0.00017125133,0.000132274,0.00040981866,0.99661773,0.0015738462],"study_design_scores_gemma":[0.00009997516,0.000010198797,0.0019599646,0.00018948462,0.000016369502,0.000047305875,0.000073003524,0.00025303542,0.00023271979,0.0009061626,0.9961941,0.000017715696],"about_ca_topic_score_codex":0.018790908,"about_ca_topic_score_gemma":0.031125411,"teacher_disagreement_score":0.88657296,"about_ca_system_score_codex":0.0016107077,"about_ca_system_score_gemma":0.002148437,"threshold_uncertainty_score":0.37945116},"labels":[],"label_agreement":null},{"id":"W6925067063","doi":"10.17605/osf.io/he3wa","title":"A new tool to assess quality of epidemiological studies with their risk of bias – Extension of The Newcastle Ottawa Scale and The Risk Of Bias In Non-randomized Studies Tools (ROBINS-E and ROBINS-I)","year":2024,"lang":"en","type":"article","venue":"OSF Preprints (OSF Preprints)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Observational study; Scale (ratio); Quality (philosophy); Risk assessment; Extension (predicate logic); Information bias; Observational methods in psychology","score_opus":0.10561222441925909,"score_gpt":0.34744514346721006,"score_spread":0.24183291904795096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925067063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008517849,0.011326262,0.9555406,0.002322383,0.00089563854,0.008188704,0.0071707447,0.0018647981,0.004173054],"genre_scores_gemma":[0.06641906,0.002203346,0.9139518,0.00083160034,0.0002644339,0.013009684,0.0021121574,0.0002551074,0.0009528777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.6416396,0.19032326,0.09666129,0.010068476,0.059480768,0.001826654],"domain_scores_gemma":[0.35453194,0.48436803,0.054065887,0.02881281,0.07506689,0.003154457],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.21879359,0.0028043399,0.00610855,0.022900077,0.0015258248,0.0077661714,0.004025775,0.00319754,0.0061784945],"category_scores_gemma":[0.50456023,0.0021327375,0.017382886,0.010161065,0.0033928568,0.007837643,0.010913959,0.006585609,0.0009267547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026448213,0.0004195732,0.055232212,0.040975265,0.02962542,0.00033436815,0.0041427435,0.011227474,0.002900816,0.08200453,0.028415065,0.7420777],"study_design_scores_gemma":[0.0055700406,0.005687998,0.16124661,0.035665024,0.042673063,0.005094655,0.0029818132,0.13779959,0.014943144,0.36525166,0.21944556,0.0036407826],"about_ca_topic_score_codex":0.005468336,"about_ca_topic_score_gemma":0.006663816,"teacher_disagreement_score":0.7812064,"about_ca_system_score_codex":0.006236523,"about_ca_system_score_gemma":0.013792386,"threshold_uncertainty_score":0.96336657},"labels":[],"label_agreement":null},{"id":"W6926466286","doi":"10.25316/ir-13514","title":"The Nanaimo Free Press [Saturday, April 18, 1891]","year":2019,"lang":"en","type":"other","venue":"VIUSpace (Vancouver Island University Library)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.007455022191139195,"score_gpt":0.1834933708990702,"score_spread":0.176038348707931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926466286","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058400654,0.020140719,0.0001686354,0.00361478,0.005683467,0.000027333399,0.0021429877,0.00012150813,0.9675167],"genre_scores_gemma":[0.0013322324,0.0029489014,0.00006467552,0.00015906438,0.00020287509,0.000008854115,0.00022460037,0.000058656813,0.9950001],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996271,0.000026730935,0.000014064227,0.0000660014,0.00019549752,0.00007053122],"domain_scores_gemma":[0.9997693,0.000030356026,0.0000140544,0.000016609525,0.000114885865,0.00005479343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030131216,0.0010554921,0.0006955601,0.0022269886,0.0042007635,0.0054367813,0.0007871216,0.0016319209,0.2925115],"category_scores_gemma":[0.0013176447,0.0004660364,0.0003283178,0.0037105104,0.00080693676,0.002068975,0.0015173625,0.0026530267,0.10356025],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023266415,0.000007761884,0.00017306837,0.00009591245,0.0000039196198,0.000072039686,0.000111525536,0.00006965479,0.000070645096,0.0112003805,0.94815123,0.040020492],"study_design_scores_gemma":[0.0000012932335,0.0000016479379,0.00031139428,0.00005401693,6.808787e-7,0.000014673463,0.00003151886,0.000011606956,0.000023598835,0.00035084586,0.99919635,0.0000022978343],"about_ca_topic_score_codex":0.13147137,"about_ca_topic_score_gemma":0.49788752,"teacher_disagreement_score":0.8685286,"about_ca_system_score_codex":0.0049431543,"about_ca_system_score_gemma":0.0032970132,"threshold_uncertainty_score":0.9785484},"labels":[],"label_agreement":null},{"id":"W6928604205","doi":"10.3886/e235344v1","title":"Investigating Nature-based Preschoolers Gains in Early Literacy and Select Executive Function Skills","year":2025,"lang":"en","type":"dataset","venue":"ICPSR Data Holdings","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Learning Partnership","funders":"","keywords":"Early literacy; Early childhood; Literacy; Executive functions; Working memory; Function (biology); Early childhood education","score_opus":0.01356173153692664,"score_gpt":0.2900138833691069,"score_spread":0.27645215183218025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928604205","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004102458,0.000012243151,0.001106763,0.0002172911,0.00003452946,0.0004053606,0.9851269,0.001448727,0.0075456765],"genre_scores_gemma":[0.019774713,0.00010509464,0.007984789,0.00019973799,0.000034501834,0.006011853,0.94407886,0.0010866782,0.020723745],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9987238,0.0002130529,0.00019338341,0.00015432875,0.0005962665,0.000119157],"domain_scores_gemma":[0.9810985,0.0095595,0.0018921583,0.0027179834,0.004209085,0.00052282517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023029898,0.0004919415,0.00055411697,0.0031286296,0.00081934663,0.0010194184,0.0012434676,0.00062291796,0.22325347],"category_scores_gemma":[0.01923398,0.00031569682,0.00036002774,0.0041952836,0.00037744592,0.00086329767,0.0012328423,0.00096693623,0.052805196],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040883617,0.0002147525,0.009203865,0.0004046917,0.00001845429,0.00009247424,0.00066646666,0.00046420703,0.0005878237,0.0019623162,0.9510103,0.03496576],"study_design_scores_gemma":[0.0005561514,0.00028454047,0.1704272,0.0007429041,0.000035039167,0.0002608315,0.002473793,0.0019142012,0.005395231,0.0029119411,0.8148794,0.000118720935],"about_ca_topic_score_codex":0.016229779,"about_ca_topic_score_gemma":0.020953547,"teacher_disagreement_score":0.22325347,"about_ca_system_score_codex":0.0015841465,"about_ca_system_score_gemma":0.0023509245,"threshold_uncertainty_score":0.7468573},"labels":[],"label_agreement":null},{"id":"W6929325549","doi":"10.48550/arxiv.1708.04316","title":"A High Resolution Survey of the Galactic Plane at 408 MHz","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Galactic plane; Angular resolution (graph drawing); Telescope; Longitude; Radio telescope; Observatory; Latitude; Interstellar medium; Geographic coordinate system","score_opus":0.08303354448292977,"score_gpt":0.19911620096719226,"score_spread":0.1160826564842625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929325549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8558807,0.0020198692,0.010633579,0.00059869845,0.000058020894,0.000119217715,0.0704189,0.0016363626,0.058634557],"genre_scores_gemma":[0.8659718,0.0017580041,0.028192792,0.00021587448,0.00012069307,0.00008595595,0.08983345,0.00024281032,0.013578584],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995857,0.000027237642,0.000008864434,0.0000644885,0.00022056486,0.00009325091],"domain_scores_gemma":[0.9995528,0.000029925297,0.000050172497,0.00006431981,0.00021402306,0.00008874347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002084136,0.00022185658,0.00020876701,0.0034068823,0.00048024827,0.0003934261,0.0003520145,0.0002739953,0.002914277],"category_scores_gemma":[0.0007309884,0.0001680096,0.00013621236,0.0056272973,0.00016136783,0.00022613081,0.00045354827,0.00022224699,0.0017085766],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034137344,0.00014842967,0.387739,0.00023763144,0.00018574494,0.0010762345,0.0019356987,0.007102309,0.07827437,0.002905728,0.09130048,0.428753],"study_design_scores_gemma":[0.00002394686,0.000027730748,0.867267,0.000035251574,0.000029107647,0.00038756605,0.0004034606,0.0024437064,0.0034689168,0.00052018,0.12536211,0.00003109505],"about_ca_topic_score_codex":0.33428508,"about_ca_topic_score_gemma":0.4471702,"teacher_disagreement_score":0.33428508,"about_ca_system_score_codex":0.00097622524,"about_ca_system_score_gemma":0.001023078,"threshold_uncertainty_score":0.6646787},"labels":[],"label_agreement":null},{"id":"W6930206760","doi":"10.5281/zenodo.11716417","title":"Fly pattern encyclopedia pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Encyclopedia; Trout; Fishing; On the fly; Fish <Actinopterygii>","score_opus":0.018174348772054486,"score_gpt":0.23459296043622999,"score_spread":0.2164186116641755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930206760","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033305708,0.0033606952,0.002199249,0.00075948954,0.0025317322,0.00022490243,0.039917238,0.009270123,0.94140345],"genre_scores_gemma":[0.0008557272,0.0026396438,0.0011126974,0.000761708,0.00044090586,0.00012370707,0.021238199,0.0030831778,0.96974427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996197,0.00002004879,0.00003056332,0.000055920995,0.00021825891,0.00005548889],"domain_scores_gemma":[0.9991473,0.00013442275,0.00004845846,0.00011847131,0.00039587004,0.00015538446],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023863361,0.0014511123,0.001079506,0.00359015,0.0008845954,0.006132152,0.0013760292,0.0010133644,0.8052023],"category_scores_gemma":[0.0014872,0.00058068027,0.00056158955,0.005020552,0.0003504555,0.004077284,0.0021635352,0.001630652,0.7582337],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012673151,0.000012233042,0.00002912367,0.00015208905,0.0000017979153,0.000021296852,0.000013706683,0.00003729467,0.00019238716,0.00067397044,0.9492031,0.049650416],"study_design_scores_gemma":[0.0000028168615,0.0000041604717,0.00018859087,0.000060297443,0.0000010061623,0.000038702477,0.000017015947,0.000022067743,0.00007757126,0.0001943087,0.99938893,0.000004554296],"about_ca_topic_score_codex":0.004846104,"about_ca_topic_score_gemma":0.0068494426,"teacher_disagreement_score":0.1947977,"about_ca_system_score_codex":0.0009678989,"about_ca_system_score_gemma":0.0012512321,"threshold_uncertainty_score":0.27785528},"labels":[],"label_agreement":null},{"id":"W6930209331","doi":"10.5281/zenodo.11247719","title":"Careocallus densicollis Cherman and Smith 2024","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Museum of Nature","funders":"","keywords":"Paratype; Holotype; Matrix (chemical analysis); Class (philosophy); Trinomial","score_opus":0.03027393476302507,"score_gpt":0.24296890767239468,"score_spread":0.21269497290936962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930209331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5176554,0.019076861,0.0075527034,0.0046482175,0.002654432,0.0009369589,0.004880867,0.00064795435,0.44194663],"genre_scores_gemma":[0.91044015,0.006624966,0.007466287,0.0015803116,0.00026742124,0.0002348211,0.0027556417,0.000032321746,0.070598066],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999853,0.000010607439,0.000010949814,0.000039361763,0.000063372456,0.0000226278],"domain_scores_gemma":[0.999846,0.000020364092,0.000045568337,0.000011824052,0.000059117843,0.000017174276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011210029,0.00037291416,0.00020876623,0.0011089024,0.0009844055,0.0003172791,0.0005077677,0.00044642598,0.012486983],"category_scores_gemma":[0.00048430864,0.00017919038,0.00016863587,0.00077900925,0.0006939317,0.00085864577,0.0006742936,0.0005403764,0.0030369975],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024933898,0.00007036109,0.022833308,0.0005791177,0.000047133264,0.0027555365,0.0012433793,0.00070662826,0.014159985,0.0040878584,0.05610977,0.89715755],"study_design_scores_gemma":[0.00008206542,0.00036047195,0.34656835,0.00090749166,0.00013276257,0.012102557,0.0027182798,0.0017552276,0.006735907,0.0018331705,0.6267459,0.00005787524],"about_ca_topic_score_codex":0.02888834,"about_ca_topic_score_gemma":0.06119251,"teacher_disagreement_score":0.02888834,"about_ca_system_score_codex":0.0010574602,"about_ca_system_score_gemma":0.0008194779,"threshold_uncertainty_score":0.0574404},"labels":[],"label_agreement":null},{"id":"W6931321244","doi":"10.5281/zenodo.5595764","title":"Geographic homogenization but little net change in the local richness of Canadian butterflies","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Species richness; Generalist and specialist species; Biodiversity; Species diversity; Beta diversity; Range (aeronautics); Butterfly; Global biodiversity; Taxon","score_opus":0.030200388838904947,"score_gpt":0.22490379363660265,"score_spread":0.1947034047976977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931321244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99638087,0.0005439851,0.000112387126,0.000106631516,0.000003564241,0.000006170979,0.00081902294,0.00001110771,0.0020162072],"genre_scores_gemma":[0.99890757,0.00012091092,0.00010630536,0.00002906903,0.0000019498452,0.0000020273362,0.00039802928,0.0000023103635,0.00043184147],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99971074,0.000012962241,0.0000102324575,0.00011149588,0.000078954225,0.00007546369],"domain_scores_gemma":[0.99913615,0.000052852396,0.00027162983,0.000071992654,0.00031036488,0.00015696324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034966605,0.00016934019,0.0002114958,0.0012981299,0.001198891,0.0008307592,0.0005475445,0.00025376654,0.0020807993],"category_scores_gemma":[0.001187125,0.00017005003,0.0002964267,0.0014373624,0.0009905688,0.0004120099,0.00048014068,0.0002497518,0.000101579644],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001229227,0.000009347665,0.981043,0.00006679051,0.0001376648,0.000069146736,0.001000833,0.00035562203,0.0035724004,0.00017996877,0.0007163632,0.012725991],"study_design_scores_gemma":[4.598425e-7,0.0000029484825,0.9995154,0.0000022237411,0.000005083916,0.000009277507,0.00016334222,0.00003001521,0.000032041622,0.000005513789,0.00023224072,0.0000015540598],"about_ca_topic_score_codex":0.9563182,"about_ca_topic_score_gemma":0.98442715,"teacher_disagreement_score":0.0436818,"about_ca_system_score_codex":0.008270733,"about_ca_system_score_gemma":0.004814484,"threshold_uncertainty_score":0.08787805},"labels":[],"label_agreement":null},{"id":"W6931380245","doi":"10.5281/zenodo.4298244","title":"Fig. 51 in The 'red-tailed' Lasioglossum (Dialictus) (Hymenoptera: Halictidae) of the western Nearctic","year":2020,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Nearctic ecozone; Principle of maximum entropy; Georeference; Niche; Entropy (arrow of time)","score_opus":0.024904850325662645,"score_gpt":0.23575087438584233,"score_spread":0.2108460240601797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931380245","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9043838,0.00056645664,0.0008546049,0.0001678046,0.000040881645,0.000028736082,0.015757252,0.00017369157,0.07802692],"genre_scores_gemma":[0.9696759,0.00019268604,0.0012152378,0.000049771166,0.000004640331,0.000019190727,0.008955633,0.000021522583,0.019865304],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999502,0.00000912119,0.0000017709591,0.0000197382,0.000006151656,0.000012999667],"domain_scores_gemma":[0.99994206,0.0000079557085,0.000018237335,0.0000052401147,0.000011730503,0.000014790413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006454301,0.00012156356,0.00006163356,0.0008364027,0.00042101688,0.00026445207,0.00012163859,0.00010119467,0.017691843],"category_scores_gemma":[0.00013484327,0.000050767823,0.00008938615,0.0007833309,0.00021325772,0.00012911123,0.00020471311,0.00011652134,0.0032509088],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003894645,0.00007862744,0.7515116,0.00021867528,0.00006280569,0.00081329123,0.0055334875,0.00092031935,0.019622281,0.001725798,0.048664954,0.1704587],"study_design_scores_gemma":[0.000003920082,0.00002417271,0.96922684,0.000014818055,0.000009747713,0.00022615585,0.0016669511,0.00017022352,0.00030253446,0.000068390684,0.028282272,0.0000038734474],"about_ca_topic_score_codex":0.04618503,"about_ca_topic_score_gemma":0.1895287,"teacher_disagreement_score":0.04618503,"about_ca_system_score_codex":0.00030297283,"about_ca_system_score_gemma":0.00009844595,"threshold_uncertainty_score":0.0918324},"labels":[],"label_agreement":null},{"id":"W6967885775","doi":"10.5281/zenodo.12444636","title":"ad&amp;d 1st edition fiend folio pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ridiculous; Subject (documents); Staring; Paraphernalia; TSG101","score_opus":0.02960183482362941,"score_gpt":0.2513329299512042,"score_spread":0.2217310951275748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967885775","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022373596,0.0010945507,0.0016087535,0.0009724042,0.0028084049,0.00016605633,0.0066205678,0.0051487153,0.98135686],"genre_scores_gemma":[0.0007566854,0.00071530696,0.0007350112,0.00041682718,0.00030259276,0.000054135602,0.0024979706,0.0018169439,0.9927045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992938,0.000032621323,0.000038332477,0.00011303282,0.00043538056,0.00008677519],"domain_scores_gemma":[0.9975587,0.00030408427,0.00007938332,0.00030726258,0.0012888927,0.00046162217],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00070259214,0.001799729,0.0014790278,0.0030839078,0.0018693926,0.007940342,0.0023196274,0.0024781888,0.92967445],"category_scores_gemma":[0.004328297,0.0010183229,0.0011292294,0.0022463738,0.00088962,0.006278491,0.002735559,0.0030069593,0.9284018],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006806498,0.000030442166,0.000032702002,0.00032700165,0.0000030836882,0.00008254263,0.00004331692,0.000046718313,0.0015749332,0.0019208876,0.9308316,0.06503879],"study_design_scores_gemma":[0.0000068938925,0.000011339342,0.00008536197,0.000053540716,0.0000016087961,0.00005309706,0.000021983797,0.000016325399,0.00037160565,0.00037830212,0.99899405,0.0000057546267],"about_ca_topic_score_codex":0.004013168,"about_ca_topic_score_gemma":0.0069744545,"teacher_disagreement_score":0.07032555,"about_ca_system_score_codex":0.0017088408,"about_ca_system_score_gemma":0.0017779751,"threshold_uncertainty_score":0.10031086},"labels":[],"label_agreement":null},{"id":"W6977082686","doi":"10.6084/m9.figshare.26670396","title":"Additional file 1 of Evolutionary shift detection with ensemble variable selection","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Feature selection; Variable (mathematics); Selection (genetic algorithm); Pattern recognition (psychology)","score_opus":0.011011703944231468,"score_gpt":0.20593272718519942,"score_spread":0.19492102324096794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977082686","genre_codex":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002975236,0.000046297573,0.0016615073,0.00010248572,0.00005159137,0.000095560536,0.9950818,0.0012493654,0.0014138537],"genre_scores_gemma":[0.013693032,0.0002344226,0.014728038,0.0007529627,0.00015137973,0.0019500253,0.95079494,0.0051942677,0.012500858],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992472,0.00016885555,0.000082918414,0.00026136127,0.00014935811,0.0000902989],"domain_scores_gemma":[0.977838,0.018192258,0.000536702,0.0014136764,0.0016319569,0.00038747198],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018911177,0.001416916,0.0015682224,0.0020855058,0.0009840947,0.0022971828,0.0027157627,0.00154997,0.88019186],"category_scores_gemma":[0.03250971,0.00085813453,0.0011846732,0.0035938143,0.00041086518,0.0020070854,0.0011799623,0.00145076,0.25408086],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046649206,0.00010795878,0.0018449132,0.0029071514,0.00010540613,0.000113005895,0.000056911224,0.0016280906,0.00034097533,0.0013544598,0.97546977,0.015604999],"study_design_scores_gemma":[0.0061101317,0.00047376688,0.012740221,0.0019561194,0.00045630502,0.00073114684,0.00028694034,0.008676296,0.0028272746,0.03341398,0.93207365,0.00025418063],"about_ca_topic_score_codex":0.0041525173,"about_ca_topic_score_gemma":0.007860804,"teacher_disagreement_score":0.88019186,"about_ca_system_score_codex":0.00070535415,"about_ca_system_score_gemma":0.0017720686,"threshold_uncertainty_score":0.17089176},"labels":[],"label_agreement":null},{"id":"W6977343171","doi":"10.6084/m9.figshare.14490230","title":"Additional file 5 of Joint hypermobility in athletes is associated with shoulder injuries: a systematic review and meta-analysis","year":2021,"lang":"en","type":"article","venue":"Figshare","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Memorial Chiropractic College","funders":"","keywords":"Athletes; Joint hypermobility; Joint (building); Hypermobility (travel); Joint instability","score_opus":0.059057525288557594,"score_gpt":0.26682440472603886,"score_spread":0.20776687943748126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977343171","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008337399,0.0009463354,0.00068900303,0.00047120592,0.000110516594,0.0016101124,0.99386495,0.00033780496,0.0011363197],"genre_scores_gemma":[0.07556551,0.006117275,0.029792301,0.005791278,0.0009197649,0.102860115,0.73218054,0.0015432388,0.045229957],"study_design_codex":"systematic_review","study_design_gemma":"meta_analysis","domain_scores_codex":[0.9971927,0.0006434268,0.0010502706,0.0004293799,0.00044423656,0.00024005596],"domain_scores_gemma":[0.9420836,0.045528132,0.0074682883,0.0013210075,0.0030944464,0.00050457363],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00526424,0.0015690454,0.0038799273,0.0048221187,0.00072646263,0.0020418735,0.0018257172,0.00180939,0.7912611],"category_scores_gemma":[0.07407552,0.0010165437,0.0050469893,0.007584075,0.0004215008,0.0032359662,0.0015681463,0.001164469,0.023118258],"study_design_candidate":"meta_analysis","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034956743,0.00014897001,0.00513158,0.58547735,0.0045335963,0.00024001795,0.00023788295,0.0012960389,0.00040055043,0.0026856253,0.37349245,0.022860296],"study_design_scores_gemma":[0.08191619,0.002079258,0.07077929,0.26719558,0.03237312,0.0017364405,0.0011152278,0.00809725,0.0021916528,0.036312047,0.4953561,0.000847837],"about_ca_topic_score_codex":0.004498444,"about_ca_topic_score_gemma":0.011136124,"teacher_disagreement_score":0.7912611,"about_ca_system_score_codex":0.0017392237,"about_ca_system_score_gemma":0.0033354529,"threshold_uncertainty_score":0.2977407},"labels":[],"label_agreement":null},{"id":"W6977418317","doi":"10.6084/m9.figshare.28873966","title":"Additional file 1 of Connecting women who are diagnosed and treated for breast cancer to engage in physical activity: a two-arm randomized controlled trial","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Hospitalier de l’Université de Montréal; University of Calgary; University of Toronto; University Health Network; Queen's University; McMaster University","funders":"","keywords":"Randomized controlled trial; Breast cancer; MEDLINE; Clinical trial","score_opus":0.01654812176527181,"score_gpt":0.28193962177878573,"score_spread":0.2653915000135139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977418317","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012570784,0.0019588247,0.005751201,0.0028581081,0.0016191428,0.0833548,0.8714823,0.001391086,0.019013757],"genre_scores_gemma":[0.13434128,0.0019724208,0.03423826,0.008305904,0.001135159,0.60760874,0.13516852,0.0008249272,0.076404795],"study_design_codex":"not_applicable","study_design_gemma":"randomized_trial","domain_scores_codex":[0.99804723,0.0010470466,0.0002121123,0.00032678922,0.00014418071,0.00022264014],"domain_scores_gemma":[0.98573375,0.011058744,0.0013065407,0.0005697205,0.00067177386,0.00065942045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0041870186,0.0027996632,0.0039878516,0.0013247158,0.0016162188,0.0017962405,0.0017659024,0.0031853227,0.75941414],"category_scores_gemma":[0.023004169,0.0013748974,0.0031159294,0.0016529905,0.000738803,0.002121936,0.000893782,0.0025297345,0.038508683],"study_design_candidate":"randomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.31077638,0.0063993153,0.0018557649,0.06673025,0.004114637,0.0002298435,0.00029305284,0.0020829178,0.00065147696,0.007218032,0.5522909,0.047357354],"study_design_scores_gemma":[0.9449137,0.00526512,0.0032231198,0.0025066517,0.0020625968,0.00007703257,0.000088472465,0.0015547406,0.00023519018,0.0055569317,0.034439184,0.000077311575],"about_ca_topic_score_codex":0.0026864314,"about_ca_topic_score_gemma":0.005894021,"teacher_disagreement_score":0.75941414,"about_ca_system_score_codex":0.0015498379,"about_ca_system_score_gemma":0.0028440373,"threshold_uncertainty_score":0.34316653},"labels":[],"label_agreement":null},{"id":"W6986098463","doi":"","title":"Opening doors : building your career in Ontario : a guide to finding work and training for the internationally trained","year":2004,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Doors; Training (meteorology); Work (physics); Craft; On-the-job training","score_opus":0.019005081570915294,"score_gpt":0.23018008015093278,"score_spread":0.21117499858001748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986098463","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008139042,0.038707297,0.0071676867,0.10662991,0.008487443,0.0013338623,0.006735294,0.0023520696,0.82044744],"genre_scores_gemma":[0.0065758834,0.013352572,0.0042226682,0.003412337,0.00015734936,0.00020755288,0.0009406663,0.00030364702,0.9708273],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988626,0.00009828533,0.000046726887,0.00005558213,0.0005803042,0.00035659195],"domain_scores_gemma":[0.9981502,0.00010106356,0.00006572463,0.00004330487,0.00063917093,0.0010005808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012374434,0.001059212,0.00054153625,0.0017471336,0.011609742,0.0040697064,0.0018176931,0.0026742318,0.1380797],"category_scores_gemma":[0.0022509026,0.00087869354,0.0004769594,0.003608805,0.0020377694,0.0030476884,0.002629501,0.0028144044,0.05380053],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005980597,0.000022037011,0.0003848067,0.00008451043,9.72633e-7,0.00010282628,0.0027365913,0.000030081694,0.000096813084,0.00092409697,0.94004834,0.05556292],"study_design_scores_gemma":[0.0000030284898,0.000009643972,0.0017262936,0.00010254756,0.0000023724438,0.00005728293,0.0037572512,0.000013176443,0.000025927022,0.0002423631,0.99404943,0.000010725724],"about_ca_topic_score_codex":0.8792783,"about_ca_topic_score_gemma":0.98319787,"teacher_disagreement_score":0.1380797,"about_ca_system_score_codex":0.016568094,"about_ca_system_score_gemma":0.064206764,"threshold_uncertainty_score":0.46192265},"labels":[],"label_agreement":null},{"id":"W6986175427","doi":"","title":"Osgoode LLM candidate Veronica Guido receives $5K CELF scholarship to study Anishinaabe law","year":2020,"lang":"en","type":"article","venue":"eYLS (Yale Law School)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scholarship; Foundation (evidence); Energy (signal processing); Latin Americans","score_opus":0.025607057600995388,"score_gpt":0.2727552639437389,"score_spread":0.2471482063427435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986175427","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003967844,0.0017311447,0.00095859426,0.06959648,0.003339143,0.00007186743,0.0005677176,0.00017055112,0.9195966],"genre_scores_gemma":[0.009477127,0.0005922462,0.00040990862,0.0024867076,0.00009557212,0.00001622421,0.00009568857,0.00005431003,0.98677224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988939,0.000091962385,0.000029912047,0.00014667855,0.0005531914,0.0002843717],"domain_scores_gemma":[0.9963085,0.00043722746,0.0001090837,0.00013264127,0.0012446451,0.0017679214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014583006,0.00029049217,0.00051559607,0.0014288784,0.008322521,0.0049514147,0.0005600565,0.0025154385,0.29006103],"category_scores_gemma":[0.0051110056,0.00028916722,0.00026235485,0.00090687635,0.0015096909,0.0024490908,0.0021477463,0.003015024,0.06819591],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013455127,0.000044764663,0.0008037045,0.000019758734,0.0000014694308,0.00014255664,0.0004522746,0.00002864501,0.00021859052,0.043250516,0.92178637,0.0332379],"study_design_scores_gemma":[0.0000022187048,0.000009296758,0.000768233,0.00004017362,0.0000013181269,0.00007908095,0.0008020849,0.000058778955,0.00013279585,0.0013125,0.99678683,0.000006770964],"about_ca_topic_score_codex":0.06392421,"about_ca_topic_score_gemma":0.28007895,"teacher_disagreement_score":0.9360758,"about_ca_system_score_codex":0.0068489816,"about_ca_system_score_gemma":0.010179291,"threshold_uncertainty_score":0.9703508},"labels":[],"label_agreement":null},{"id":"W7002062273","doi":"","title":"L'Organisation d'un club science au Québec /","year":2015,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Club; Work (physics); Agency (philosophy); Government (linguistics); Subject (documents)","score_opus":0.013672864456473397,"score_gpt":0.231958138665434,"score_spread":0.2182852742089606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7002062273","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042861495,0.020973707,0.0074127163,0.04432083,0.0049672215,0.0006857155,0.019433632,0.0013682018,0.8579763],"genre_scores_gemma":[0.08362063,0.0030507974,0.004200661,0.0013923501,0.00022057505,0.00015309738,0.0029941886,0.00024923118,0.90411854],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763846,0.0002781589,0.000053875956,0.00026885522,0.001030414,0.0007303247],"domain_scores_gemma":[0.9949793,0.00040715476,0.00018396058,0.0003097556,0.0024638444,0.0016558823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526369,0.00080939714,0.00077611173,0.003284809,0.008966584,0.007270679,0.0014869501,0.0023880238,0.12130498],"category_scores_gemma":[0.0038818722,0.00049373956,0.00089673896,0.004309359,0.0016894059,0.0015080222,0.0019650664,0.0024174466,0.010020101],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035619654,0.00027075852,0.016147556,0.000532213,0.00009874349,0.00070470234,0.0012329274,0.0018582758,0.0016269815,0.08792825,0.6227117,0.2665317],"study_design_scores_gemma":[0.000035882287,0.000021560325,0.022581318,0.00016566266,0.00001080889,0.00006946363,0.0006078259,0.0008120088,0.00045641186,0.001120422,0.97409534,0.000023396482],"about_ca_topic_score_codex":0.97891426,"about_ca_topic_score_gemma":0.98288095,"teacher_disagreement_score":0.12130498,"about_ca_system_score_codex":0.05753965,"about_ca_system_score_gemma":0.13211358,"threshold_uncertainty_score":0.4174813},"labels":[],"label_agreement":null},{"id":"W7010613354","doi":"","title":"Fiscal Year 2018","year":2019,"lang":"en","type":"report","venue":"The Portal to Texas History (University of North Texas)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Fiscal year; Quarter (Canadian coin); Commission; State (computer science); Duration (music)","score_opus":0.025989778917925553,"score_gpt":0.21720376371252273,"score_spread":0.19121398479459717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010613354","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010594986,0.0016267621,0.00045600373,0.011576318,0.02616342,0.0005554068,0.17776386,0.0017877651,0.77901095],"genre_scores_gemma":[0.0026853888,0.002501423,0.000377282,0.0028245265,0.002092511,0.00062600675,0.097456254,0.00063977664,0.89079684],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974032,0.00013913572,0.00021100628,0.00022934131,0.0014874547,0.0005298691],"domain_scores_gemma":[0.99413574,0.00024212908,0.00028722733,0.00036536873,0.0041642934,0.00080511125],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002214955,0.0014590216,0.0011747003,0.0038169336,0.00236055,0.010416593,0.0022632827,0.0026156302,0.48257327],"category_scores_gemma":[0.009628117,0.00056599244,0.0007342625,0.004670178,0.0004393868,0.0036747917,0.0025538222,0.0025800536,0.5944759],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020798689,0.000011579216,0.000113705944,0.000046451118,0.0000013515204,0.0000086213395,0.000007099177,0.00001563207,0.000016134238,0.00095750054,0.9916504,0.007150713],"study_design_scores_gemma":[0.000012596665,0.00001054654,0.0013032471,0.000081728,0.0000017111029,0.000010132851,0.000045655284,0.000017936489,0.000035150708,0.00029723693,0.99817765,0.0000064302685],"about_ca_topic_score_codex":0.035987522,"about_ca_topic_score_gemma":0.041005205,"teacher_disagreement_score":0.48257327,"about_ca_system_score_codex":0.004133059,"about_ca_system_score_gemma":0.012214201,"threshold_uncertainty_score":0.7380464},"labels":[],"label_agreement":null},{"id":"W7024220225","doi":"","title":"Rapid evidence profile #41: What do we know from the best-available evidence and from the experiences of other jurisdictions about the functions that local-systems are responsible for and the ways in which they are held accountable for performing these functions?","year":2022,"lang":"en","type":"other","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"McMaster University","keywords":"Empirical evidence; Qualitative research; Compliance (psychology); Context (archaeology); Evidence-based policy","score_opus":0.06182326533319117,"score_gpt":0.27133030949802756,"score_spread":0.2095070441648364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024220225","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031916185,0.07556717,0.0137552405,0.4847045,0.015444188,0.011141434,0.15521859,0.0018332109,0.23914415],"genre_scores_gemma":[0.047992222,0.1744027,0.14177814,0.3227606,0.013687837,0.040180165,0.11000433,0.00341732,0.14577666],"study_design_codex":"not_applicable","study_design_gemma":"systematic_review","domain_scores_codex":[0.94627106,0.022771096,0.011401689,0.0014226432,0.01603933,0.0020942297],"domain_scores_gemma":[0.4503453,0.3713514,0.028574927,0.021626465,0.11701812,0.011083768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08150466,0.0010806492,0.0031349894,0.01943471,0.0019489236,0.012301266,0.0054052155,0.009352011,0.17440924],"category_scores_gemma":[0.41209924,0.0012204493,0.002895243,0.02090541,0.002637311,0.012488764,0.007106778,0.00567968,0.049072146],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003543923,0.000034526078,0.00095287524,0.058879655,0.00016284245,0.00025462438,0.0006675515,0.0002230678,0.00032416297,0.011629201,0.7847904,0.14172679],"study_design_scores_gemma":[0.0002667156,0.0000843505,0.0027586655,0.09417223,0.00040716302,0.00034362904,0.0013091168,0.0002649084,0.00059798773,0.018802075,0.8808972,0.0000959398],"about_ca_topic_score_codex":0.009602443,"about_ca_topic_score_gemma":0.027441375,"teacher_disagreement_score":0.17440924,"about_ca_system_score_codex":0.0075624967,"about_ca_system_score_gemma":0.029903524,"threshold_uncertainty_score":0.583457},"labels":[],"label_agreement":null},{"id":"W7024889260","doi":"","title":"Traitement de l'islam et du monde musulman à l'école : perceptions des jeunes musulmans(es) du cégep au Québec","year":2008,"lang":"fr","type":"other","venue":"EspaceINRS (National Institute for Scientific Research (Canada))","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Nucleofection; Gestational period; TSG101; Hyporeflexia; Pretext; Dysgeusia","score_opus":0.04713461931900343,"score_gpt":0.30991081777856067,"score_spread":0.26277619845955724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024889260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9973652,0.0001335848,0.000033213793,0.00056710094,0.000007184151,0.0000079814345,0.000020929367,0.0000011652428,0.0018638119],"genre_scores_gemma":[0.99603856,0.00021769217,0.000057289653,0.00012299081,0.000002302032,0.000011140116,0.000018200495,0.0000015473961,0.0035303216],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9992378,0.00019021715,0.000023515855,0.000055793324,0.000188739,0.00030412967],"domain_scores_gemma":[0.9974347,0.000418174,0.00032605583,0.0000554759,0.00089312764,0.00087260647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013110015,0.00024825116,0.0003020378,0.0007876843,0.009936231,0.00263845,0.00068039057,0.00068823906,0.003382163],"category_scores_gemma":[0.0021745295,0.00024407778,0.0001584486,0.0011626707,0.0040901885,0.0009730314,0.0015265507,0.0014262497,0.00016637603],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042148735,0.000064838605,0.1907113,0.000080312144,0.000014788375,0.0005562893,0.79320353,0.000063531894,0.0013640532,0.0014648474,0.0012093108,0.011224972],"study_design_scores_gemma":[0.0000018792704,0.000035190864,0.22445737,0.000057347697,0.0000058110604,0.00007054304,0.7673957,0.000067706664,0.00013405306,0.000050540388,0.007709014,0.000014898007],"about_ca_topic_score_codex":0.9343064,"about_ca_topic_score_gemma":0.9734789,"teacher_disagreement_score":0.06569362,"about_ca_system_score_codex":0.013177549,"about_ca_system_score_gemma":0.013433784,"threshold_uncertainty_score":0.13216096},"labels":[],"label_agreement":null},{"id":"W7027379868","doi":"","title":"Colliers Brokers Sale of New 1 MSF Industrial Building in Metro Louisville Leased to Canadian Solar","year":2024,"lang":"en","type":"other","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Metropolitan area","score_opus":0.024248697762346786,"score_gpt":0.25784678657058285,"score_spread":0.23359808880823607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027379868","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011282613,0.00032415075,0.0007204037,0.004289636,0.0010134934,0.0002094298,0.0019356781,0.0005974213,0.97962713],"genre_scores_gemma":[0.0048867995,0.000051696657,0.00010922912,0.00013651387,0.000042351414,0.0000069217467,0.00024843996,0.00008544678,0.9944326],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896955,0.000038808066,0.000011818602,0.00014552311,0.00040926933,0.00042509008],"domain_scores_gemma":[0.99847144,0.00007219218,0.000036550624,0.000093252995,0.0006760499,0.0006504942],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005332571,0.00083217776,0.00058675,0.0015971428,0.008908702,0.003840097,0.0010893388,0.0025243966,0.55675256],"category_scores_gemma":[0.0013968911,0.000595308,0.00064911117,0.0010138782,0.0007695224,0.0009764964,0.0020394283,0.002168798,0.16446003],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002509385,0.00013426351,0.0034237327,0.00004443268,0.000015291049,0.00072848325,0.0003023166,0.00029411665,0.0019426942,0.010557331,0.9323022,0.05000426],"study_design_scores_gemma":[0.000019608966,0.000040659794,0.0026189946,0.00001840982,0.000004685918,0.00008138859,0.00044319627,0.00036540147,0.0003674517,0.00024998788,0.9957801,0.000009988182],"about_ca_topic_score_codex":0.49705073,"about_ca_topic_score_gemma":0.8050061,"teacher_disagreement_score":0.55675256,"about_ca_system_score_codex":0.008083779,"about_ca_system_score_gemma":0.011968365,"threshold_uncertainty_score":0.98831517},"labels":[],"label_agreement":null},{"id":"W7028641559","doi":"","title":"Féminisation des titres et des textes /","year":2015,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rickettsiales; Ethnic community; Derogation","score_opus":0.022338961720341034,"score_gpt":0.2493713284822736,"score_spread":0.22703236676193259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028641559","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068179324,0.051895715,0.010280319,0.06312265,0.005035683,0.00009254427,0.0010705047,0.00041151364,0.79991174],"genre_scores_gemma":[0.49706894,0.011040767,0.0037289641,0.00314443,0.000738891,0.0000647965,0.00031308955,0.00044658978,0.48345357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983668,0.00081008446,0.0000510158,0.0002267573,0.00040233982,0.00014294096],"domain_scores_gemma":[0.9988869,0.0004307175,0.0001274485,0.00007959719,0.0003729519,0.00010244955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015997925,0.0005580058,0.00020302586,0.001305555,0.004272831,0.0040811137,0.00034859762,0.0006806205,0.01729802],"category_scores_gemma":[0.0019878233,0.00027597471,0.00020770161,0.0007862655,0.006124554,0.0020644777,0.0014023874,0.0019005148,0.0026822686],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001715907,0.00003941328,0.00696387,0.00046992992,0.00001854095,0.0005532559,0.14124739,0.00018166592,0.006132538,0.47638077,0.14806181,0.21977931],"study_design_scores_gemma":[0.0000031871564,0.000015129799,0.006258187,0.00017208628,0.0000037713232,0.00017823886,0.010882891,0.00008687372,0.001694829,0.0038316338,0.97685766,0.000015557342],"about_ca_topic_score_codex":0.08689537,"about_ca_topic_score_gemma":0.13913868,"teacher_disagreement_score":0.08689537,"about_ca_system_score_codex":0.007057748,"about_ca_system_score_gemma":0.0032302237,"threshold_uncertainty_score":0.1727792},"labels":[],"label_agreement":null},{"id":"W7068997215","doi":"","title":"Page 105","year":2011,"lang":"en","type":"article","venue":"Pittsburg State University Digital Commons (Pittsburg State University)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ledger; Period (music); Register (sociolinguistics); Quarter (Canadian coin); FLAGS register","score_opus":0.01947301086159729,"score_gpt":0.18423680498057007,"score_spread":0.1647637941189728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7068997215","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019856074,0.001550747,0.00023058282,0.003136746,0.007095032,0.000064248416,0.0019106911,0.00051807414,0.9852953],"genre_scores_gemma":[0.0006951053,0.0005676494,0.000078340956,0.0011155858,0.0006063626,0.00001809931,0.00083048077,0.00011686769,0.9959714],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995289,0.000038240887,0.000026809696,0.00008708978,0.0002649302,0.000054166114],"domain_scores_gemma":[0.998475,0.00020085536,0.000056936213,0.00015643988,0.00088957365,0.00022117999],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004124392,0.0006718593,0.00052120193,0.0016398552,0.0018797196,0.0056566484,0.0007394366,0.0016649417,0.796752],"category_scores_gemma":[0.0030191361,0.00030484368,0.0003499767,0.0017678645,0.0004824276,0.0021106587,0.0013418768,0.0014432061,0.76626164],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045474835,0.0000075810945,0.00005274285,0.000023905588,5.495771e-7,0.000011300991,0.000019618512,0.000008596004,0.00004474781,0.0011709534,0.98048353,0.018171988],"study_design_scores_gemma":[0.0000015748016,0.0000030414642,0.00015489958,0.000042444553,5.373672e-7,0.000018162773,0.000028981462,0.000008650521,0.00002201816,0.00022118159,0.99949694,0.0000015128637],"about_ca_topic_score_codex":0.0063042063,"about_ca_topic_score_gemma":0.012008923,"teacher_disagreement_score":0.20324802,"about_ca_system_score_codex":0.0013029949,"about_ca_system_score_gemma":0.0015476532,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7089663828","doi":"10.1007/978-3-032-06112-6_13","title":"Primary Graft Dysfunction","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypoxemia; ARDS; Pulmonary edema; Extracorporeal membrane oxygenation; Lung; Extracorporeal","score_opus":0.01012619801359335,"score_gpt":0.20809581139230685,"score_spread":0.1979696133787135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7089663828","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12874125,0.12096915,0.063532904,0.010832369,0.010696595,0.00039650165,0.0016862773,0.0025359644,0.66060907],"genre_scores_gemma":[0.37503192,0.050434705,0.016671047,0.011652965,0.0041324086,0.00027053006,0.0022003998,0.0006824882,0.53892356],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998022,0.00002167734,0.000011396552,0.000033548113,0.0000644676,0.000066713175],"domain_scores_gemma":[0.9997775,0.00004545341,0.000029853285,0.00004195247,0.000023277673,0.00008203554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048580693,0.00082159444,0.00074588007,0.000936567,0.0006785554,0.0014238233,0.00067134853,0.00094317837,0.03336531],"category_scores_gemma":[0.0005549415,0.00015298394,0.00064970506,0.00055418926,0.0007238266,0.00069367053,0.00074761285,0.0018263273,0.0110745],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059056457,0.00070044986,0.003998625,0.0008698891,0.00010395598,0.01711963,0.00016983162,0.00052406394,0.018621609,0.022938292,0.10865899,0.8257042],"study_design_scores_gemma":[0.000102499995,0.0016030058,0.014364489,0.0018883342,0.00019465054,0.33682483,0.0002550997,0.0014276075,0.016813409,0.023360195,0.60309714,0.000068825284],"about_ca_topic_score_codex":0.00025316337,"about_ca_topic_score_gemma":0.00063903246,"teacher_disagreement_score":0.03336531,"about_ca_system_score_codex":0.0005517527,"about_ca_system_score_gemma":0.00053687533,"threshold_uncertainty_score":0.1116181},"labels":[],"label_agreement":null},{"id":"W7096493495","doi":"","title":"Recommended C Style and Coding Standards","year":2000,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Coding (social sciences); Style (visual arts); Scope (computer science); Miller; Set (abstract data type)","score_opus":0.011820763784610253,"score_gpt":0.2591402804207473,"score_spread":0.24731951663613708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096493495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013649518,0.0011669842,0.4897665,0.013115182,0.021967389,0.018292798,0.10646785,0.14218257,0.20567575],"genre_scores_gemma":[0.01051423,0.0036466282,0.42686707,0.010741838,0.005223703,0.03113224,0.16652758,0.08329258,0.2620541],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.96859443,0.0072293,0.005802658,0.0022852472,0.014707581,0.0013809017],"domain_scores_gemma":[0.780851,0.03282211,0.0077447915,0.034109224,0.14134483,0.0031280238],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015727894,0.0032026842,0.0024307382,0.0119127305,0.0035485786,0.008787544,0.006786412,0.004065287,0.41572994],"category_scores_gemma":[0.18887183,0.0022451016,0.0021373152,0.01613945,0.002548412,0.0067686965,0.0034187832,0.00833592,0.4716205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070587994,0.00004132628,0.000116534284,0.00040208892,0.000011366354,0.000055931523,0.0001174504,0.0005046373,0.0005704974,0.0050978325,0.94090545,0.052106295],"study_design_scores_gemma":[0.0000780109,0.000057922538,0.0006289913,0.0008756659,0.000018990864,0.00020230724,0.0001283156,0.0018157073,0.001248369,0.008194503,0.986616,0.00013511945],"about_ca_topic_score_codex":0.01330204,"about_ca_topic_score_gemma":0.007313415,"teacher_disagreement_score":0.41572994,"about_ca_system_score_codex":0.0058574695,"about_ca_system_score_gemma":0.011703258,"threshold_uncertainty_score":0.83339036},"labels":[],"label_agreement":null},{"id":"W7100583189","doi":"","title":"Economic evaluation of Avonex (interferon beta-la) in patients following a single demyelinating event,” Multiple Sclerosis","year":2005,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multiple sclerosis; Christian ministry; Economic evaluation; Cost–benefit analysis; Quality-adjusted life year; Multivariate analysis; Outcome (game theory); Economic analysis; Cost effectiveness","score_opus":0.04628665552023966,"score_gpt":0.27189510585764637,"score_spread":0.2256084503374067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100583189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372161,0.02835332,0.00998875,0.004019505,0.00028570922,0.0023688443,0.0043107267,0.000066023684,0.0133911455],"genre_scores_gemma":[0.9958222,0.0016186764,0.0012820865,0.00016398393,0.000019144505,0.00021403532,0.00051080476,0.0000040241503,0.00036503273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9943988,0.0046221917,0.00017880561,0.00015538263,0.00030201272,0.00034280913],"domain_scores_gemma":[0.99186194,0.0062180064,0.00083206716,0.00012562425,0.00045793623,0.00050440256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008323367,0.0010006106,0.0012396979,0.0010894747,0.0004313551,0.0019030174,0.00094058167,0.0012203847,0.003546724],"category_scores_gemma":[0.023689298,0.0004541873,0.0033350696,0.001086008,0.0005327305,0.0009634744,0.0010766966,0.001290182,0.00012578747],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.08443353,0.0023823897,0.060694244,0.006184584,0.0127641745,0.0009489651,0.0002968379,0.71823525,0.00095130416,0.012298024,0.0046883835,0.096122265],"study_design_scores_gemma":[0.016189383,0.01877226,0.045470513,0.0028809512,0.013985443,0.0010783134,0.0006349464,0.8817894,0.0015284189,0.0076416824,0.009808199,0.00022057506],"about_ca_topic_score_codex":0.04064373,"about_ca_topic_score_gemma":0.024701627,"teacher_disagreement_score":0.04064373,"about_ca_system_score_codex":0.011719103,"about_ca_system_score_gemma":0.007066786,"threshold_uncertainty_score":0.08502847},"labels":[],"label_agreement":null},{"id":"W7100933117","doi":"","title":"Evolvable View Environment","year":2007,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"IBM; General partnership; Architecture; Work (physics); Information system","score_opus":0.011182285998384393,"score_gpt":0.22786989263902174,"score_spread":0.21668760664063735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100933117","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009140283,0.00079686026,0.9285499,0.0008553389,0.00022757074,0.00019249614,0.0009943958,0.013885183,0.045358013],"genre_scores_gemma":[0.1891619,0.0015838688,0.7620439,0.0009857488,0.00010292934,0.00062016054,0.0052514696,0.0029496108,0.0373004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992168,0.00021192104,0.0000366345,0.00015583113,0.00028974126,0.00008904269],"domain_scores_gemma":[0.9988172,0.00031067798,0.00006257785,0.00049411017,0.00014314803,0.00017233702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008719554,0.00063221133,0.00046714232,0.0005108677,0.0006846116,0.0020274587,0.0025541417,0.0012823531,0.015298938],"category_scores_gemma":[0.0027646073,0.00045290607,0.00085625675,0.0004270147,0.0008886,0.0030117806,0.0048577427,0.0023285742,0.0037601728],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004623935,0.00023409196,0.0021486436,0.0005904756,0.00017166605,0.00088565727,0.0009831368,0.04844043,0.015546086,0.40499938,0.06572216,0.45981583],"study_design_scores_gemma":[0.00011075702,0.00014950738,0.0004330366,0.000116233205,0.00006628878,0.00067691406,0.00019827261,0.1353999,0.010773523,0.13996491,0.7120457,0.0000648665],"about_ca_topic_score_codex":0.0010015435,"about_ca_topic_score_gemma":0.0016538493,"teacher_disagreement_score":0.015298938,"about_ca_system_score_codex":0.00047425335,"about_ca_system_score_gemma":0.0011319994,"threshold_uncertainty_score":0.051180005},"labels":[],"label_agreement":null},{"id":"W7113380925","doi":"","title":"A Possible Canvasback x Ruddy Duck Hybrid","year":2025,"lang":"","type":"article","venue":"Digital Commons - University of South Florida (University of South Florida)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"","score_opus":0.013988400727369963,"score_gpt":0.19176470921194777,"score_spread":0.17777630848457782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7113380925","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21528421,0.0007810283,0.37021568,0.001825774,0.0013096565,0.0002852776,0.00072477653,0.01333279,0.3962409],"genre_scores_gemma":[0.4585548,0.00027235647,0.18574922,0.00068203034,0.000037896752,0.0001061778,0.00056276476,0.00073805475,0.35329664],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998536,0.000017601733,0.0000047842977,0.000045442743,0.000043825312,0.00003474587],"domain_scores_gemma":[0.99986947,0.00001660305,0.0000037589707,0.000048599322,0.000030449653,0.000031078627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019629979,0.00038973242,0.00041073712,0.0003180981,0.00096770393,0.0013767987,0.0011265535,0.00096842693,0.040134415],"category_scores_gemma":[0.00029076787,0.00024606765,0.00036850147,0.0002380353,0.00044823356,0.00090091396,0.0012522772,0.00055164885,0.0059708613],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018984469,0.0005053584,0.002611271,0.00033127933,0.00016039403,0.0018500119,0.0007519485,0.048979025,0.13839889,0.19497187,0.06271285,0.5468287],"study_design_scores_gemma":[0.00034665948,0.0015287781,0.0027372583,0.00018023932,0.00021452503,0.0023758442,0.0009974329,0.3203672,0.09160438,0.06024927,0.51915467,0.00024377636],"about_ca_topic_score_codex":0.0027280387,"about_ca_topic_score_gemma":0.0039169085,"teacher_disagreement_score":0.040134415,"about_ca_system_score_codex":0.0004550846,"about_ca_system_score_gemma":0.0002912412,"threshold_uncertainty_score":0.13426292},"labels":[],"label_agreement":null},{"id":"W72577311","doi":"10.4018/978-1-60566-717-1.ch009","title":"An Integrated Framework for Fuzzy Classification and Analysis of Gene Expression Data","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Classifier (UML); Gene selection; Fuzzy logic; Correlation; Artificial intelligence; Computer science; Fuzzy rule; Gene; Feature selection; Machine learning; Data mining; Pattern recognition (psychology); Mathematics; Fuzzy set; Biology; Gene expression; Genetics","score_opus":0.04428926122515509,"score_gpt":0.3067072035141715,"score_spread":0.26241794228901644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72577311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034896872,0.00052227685,0.997695,0.00007190822,0.000031553784,0.000038906914,0.00011315589,0.0003729886,0.0008052867],"genre_scores_gemma":[0.010394256,0.00076455326,0.9868297,0.00007145702,0.00006062461,0.00017042836,0.00040265924,0.00007018615,0.0012361465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849546,0.00034989815,0.00015612681,0.00027777514,0.0006603365,0.000060288192],"domain_scores_gemma":[0.9991578,0.0004160442,0.00005965156,0.00013657934,0.00019759902,0.00003233258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028510399,0.0011050465,0.0017255282,0.0032345625,0.00064118503,0.0029515703,0.0023439093,0.0011371472,0.00363866],"category_scores_gemma":[0.0030690024,0.0005772579,0.0025348593,0.0038123745,0.0008499204,0.001869493,0.0013785562,0.0019445411,0.0021540239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007887648,0.0001267701,0.00091511017,0.00082509517,0.00039377806,0.0004466991,0.00042593764,0.10681895,0.014204407,0.2450259,0.011482177,0.6192563],"study_design_scores_gemma":[0.000016764512,0.0000610878,0.00091328146,0.00019269844,0.0001003197,0.00034987542,0.000081722996,0.6805927,0.004226166,0.25229904,0.06110259,0.00006377949],"about_ca_topic_score_codex":0.0041229147,"about_ca_topic_score_gemma":0.0051071127,"teacher_disagreement_score":0.0041229147,"about_ca_system_score_codex":0.0010789597,"about_ca_system_score_gemma":0.001438325,"threshold_uncertainty_score":0.015077889},"labels":[],"label_agreement":null},{"id":"W75137543","doi":"","title":"THE UPHILL BATTLE OF ANT PROGRAMMING VS. GENETIC PROGRAMMING","year":2016,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Genetic programming; Symbolic regression; Ant colony optimization algorithms; Computer science; Swarm intelligence; Artificial intelligence; Ant colony; Machine learning; Particle swarm optimization","score_opus":0.010657418470338466,"score_gpt":0.23518321485049173,"score_spread":0.22452579638015327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75137543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15638825,0.032900013,0.67879945,0.026859704,0.0012843941,0.00011208694,0.000083484985,0.00046542077,0.10310713],"genre_scores_gemma":[0.8229312,0.007271735,0.16015206,0.0017853655,0.0005993969,0.00008993419,0.000045142722,0.00020282953,0.0069222897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672526,0.0019684697,0.00008931519,0.00026803592,0.00084549707,0.00010337588],"domain_scores_gemma":[0.99152243,0.0067848554,0.00033546973,0.0005307674,0.00062388077,0.00020269708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046353494,0.00055930804,0.0007802121,0.0008556829,0.0006413284,0.003329492,0.00091556535,0.0017024324,0.002712407],"category_scores_gemma":[0.009954147,0.00023690841,0.00045152535,0.0013413477,0.0033088762,0.0033818863,0.001527677,0.0039483462,0.00057404354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005467191,0.0001635303,0.002532429,0.00046332902,0.00022497035,0.00014695337,0.00041250285,0.13627774,0.0027953854,0.52407444,0.0047992826,0.32756272],"study_design_scores_gemma":[0.00013109126,0.00049685035,0.0012024157,0.00033436494,0.00008956186,0.00028615043,0.0003021305,0.5027503,0.0028527689,0.46662292,0.024877759,0.000053721815],"about_ca_topic_score_codex":0.0010574507,"about_ca_topic_score_gemma":0.0010402823,"teacher_disagreement_score":0.0046353494,"about_ca_system_score_codex":0.000941935,"about_ca_system_score_gemma":0.0005972585,"threshold_uncertainty_score":0.024514377},"labels":[],"label_agreement":null},{"id":"W76294416","doi":"","title":"Influence of clustering pre-processing on genetically generated fuzzy knowledge bases","year":2005,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cluster analysis; Computer science; Fuzzy clustering; Data mining; Outlier; CURE data clustering algorithm; Data stream clustering; Artificial intelligence; Correlation clustering; Canopy clustering algorithm; Noise (video); Fuzzy logic; Machine learning; Process (computing); Pattern recognition (psychology)","score_opus":0.01094977893640601,"score_gpt":0.24728039377079425,"score_spread":0.23633061483438825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76294416","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82349485,0.0007059658,0.16872841,0.00029903822,0.00012533237,0.00014664358,0.00005457911,0.00078846887,0.005656645],"genre_scores_gemma":[0.9582302,0.00017206164,0.040561154,0.000049932212,0.000012714033,0.00003245082,0.00007204364,0.00007918266,0.00079026015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919575,0.00023331863,0.000055487417,0.00011615636,0.00027981497,0.000119467215],"domain_scores_gemma":[0.99089444,0.0060770325,0.00044881678,0.0006072522,0.001788349,0.00018406137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019431176,0.00066087564,0.0005750081,0.00081482343,0.00074753945,0.0014208367,0.00067738205,0.0008501593,0.0011253844],"category_scores_gemma":[0.017700985,0.00031245552,0.00042725945,0.00053122,0.0006164124,0.0009767291,0.00045394085,0.00067475135,0.0002547345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011759726,0.00037142678,0.004588849,0.00021280197,0.00012551676,0.00045393247,0.00037336527,0.70928556,0.09561586,0.003349627,0.0006539206,0.18379323],"study_design_scores_gemma":[0.00005933327,0.00055213814,0.006135032,0.00004745381,0.000096374846,0.00028333275,0.00020812976,0.87412876,0.11552725,0.0017682394,0.0011533552,0.000040597133],"about_ca_topic_score_codex":0.0066852793,"about_ca_topic_score_gemma":0.005062236,"teacher_disagreement_score":0.0066852793,"about_ca_system_score_codex":0.0008273236,"about_ca_system_score_gemma":0.0009048837,"threshold_uncertainty_score":0.01329273},"labels":[],"label_agreement":null},{"id":"W86880533","doi":"10.1007/978-3-642-37192-9_44","title":"CodeMonkey; a GUI Driven Platform for Swift Synthesis of Evolutionary Algorithms in Java","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Java; Swift; Eclipse; Programming language; Plug-in; Evolutionary algorithm; Architecture; Software engineering; Code (set theory); Simple (philosophy); Operating system; Software; Source code; Artificial intelligence; Set (abstract data type)","score_opus":0.01862146126745619,"score_gpt":0.245575392731098,"score_spread":0.2269539314636418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86880533","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004359382,0.00017797323,0.8683615,0.000087329936,0.00012547348,0.00013543983,0.001001864,0.11813789,0.0076132584],"genre_scores_gemma":[0.1145522,0.0005571173,0.75614816,0.00051706855,0.00007344749,0.0009946902,0.0054744426,0.100328386,0.02135441],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999401,0.00010805892,0.00005413961,0.00012010115,0.00023890797,0.00007796356],"domain_scores_gemma":[0.9986927,0.00085933664,0.00006960604,0.0001609936,0.00015331134,0.00006402972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010800981,0.0012961173,0.0007663282,0.0009183178,0.000379999,0.0013828975,0.0024580972,0.0009972868,0.034853574],"category_scores_gemma":[0.0036548597,0.0010367177,0.0011332381,0.0005988757,0.0005266086,0.0012511482,0.0012057206,0.0016773369,0.008812596],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013517402,0.00048713447,0.0028826594,0.002249915,0.00037283025,0.0009763259,0.00066922064,0.06656691,0.10668725,0.048342198,0.16463733,0.6047765],"study_design_scores_gemma":[0.0009773833,0.00028174126,0.0021444152,0.00031000498,0.00017262538,0.0009842842,0.000112733316,0.5984357,0.12502867,0.04542853,0.22589426,0.00022963647],"about_ca_topic_score_codex":0.001381226,"about_ca_topic_score_gemma":0.0022802078,"teacher_disagreement_score":0.034853574,"about_ca_system_score_codex":0.0004473097,"about_ca_system_score_gemma":0.0009320723,"threshold_uncertainty_score":0.11659682},"labels":[],"label_agreement":null},{"id":"W93303570","doi":"10.1007/978-3-642-37207-0_10","title":"On the Evolvability of a Hybrid Ant Colony-Cartesian Genetic Programming Methodology","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Evolvability; Computer science; Representation (politics); Genetic programming; Rank (graph theory); Formicoidea; Ant colony; Pheromone; Ant colony optimization algorithms; Theoretical computer science; Artificial intelligence; Mathematics; Biology; Ecology; Evolutionary biology; Aculeata; Combinatorics","score_opus":0.03587807863154491,"score_gpt":0.2736483658721608,"score_spread":0.23777028724061589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93303570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030736208,0.00056462066,0.95502996,0.00018757621,0.000045473953,0.00003277869,0.0000070429924,0.00006325703,0.013332947],"genre_scores_gemma":[0.60673237,0.0010177306,0.3835493,0.00009790971,0.00005258372,0.00013063154,0.0000281206,0.00010458388,0.008286699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995241,0.00023992131,0.000016477845,0.00004779632,0.00014563889,0.000026166781],"domain_scores_gemma":[0.99893826,0.0007550238,0.000062061445,0.00009702329,0.00011928993,0.000028389912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011658486,0.0003991402,0.00033701013,0.0004234165,0.00043106917,0.0008519629,0.00095037185,0.0006011431,0.0014863025],"category_scores_gemma":[0.0041616256,0.00030797964,0.0006222652,0.00047591372,0.0015822162,0.0008760205,0.0014035185,0.0011688699,0.0001782922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070079455,0.000032355514,0.00078828796,0.0001424372,0.000044500248,0.00014746137,0.00037680654,0.47081226,0.004864393,0.44217393,0.0005172063,0.08003026],"study_design_scores_gemma":[0.000013806813,0.000069542664,0.00017469391,0.000034831788,0.000018704914,0.000106273976,0.000027925127,0.8915383,0.00089505484,0.1048424,0.002271264,0.0000071310296],"about_ca_topic_score_codex":0.001083978,"about_ca_topic_score_gemma":0.0008369692,"teacher_disagreement_score":0.0014863025,"about_ca_system_score_codex":0.00043621194,"about_ca_system_score_gemma":0.0004847902,"threshold_uncertainty_score":0.0061656833},"labels":[],"label_agreement":null},{"id":"W94609200","doi":"10.1007/978-0-387-87623-8_4","title":"Pareto Cooperative-Competitive Genetic Programming: A Classification Benchmarking Study","year":2008,"lang":"en","type":"book-chapter","venue":"Genetic and evolutionary computation","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Benchmarking; Genetic programming; Benchmark (surveying); Computer science; Decomposition; Mathematical optimization; Domain (mathematical analysis); Pareto principle; Coevolution; Genetic algorithm; Operator (biology); Artificial intelligence; Multi-objective optimization; Machine learning; Mathematics; Economics; Ecology; Chemistry; Biology","score_opus":0.025754256119045946,"score_gpt":0.24764441517735955,"score_spread":0.2218901590583136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94609200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49850187,0.0055175642,0.39208364,0.0013789465,0.0002503478,0.00028891777,0.00046938023,0.00048062284,0.1010287],"genre_scores_gemma":[0.9272451,0.00086205686,0.06247433,0.00012965062,0.00006231595,0.00008930486,0.0004623579,0.00011200548,0.008562901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978618,0.0008200975,0.000054964177,0.00023965962,0.00082876027,0.00019468475],"domain_scores_gemma":[0.9937774,0.0037739086,0.00024301877,0.00057737186,0.0014314589,0.00019697347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039955387,0.00069551106,0.0010266697,0.0020004078,0.0009422662,0.0026605746,0.0024727338,0.0015096924,0.002418208],"category_scores_gemma":[0.014113673,0.00015718877,0.00045021492,0.004168253,0.0010178457,0.0021220308,0.0010128403,0.0012234575,0.000426518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006618465,0.0007309775,0.008267939,0.00027872046,0.00013110768,0.00013863375,0.0003803366,0.4841617,0.0014694745,0.18234134,0.013558081,0.3078798],"study_design_scores_gemma":[0.00001640538,0.00011239444,0.0011823364,0.000019221601,0.000018023664,0.000046754554,0.000119993136,0.97368795,0.00082908774,0.022409217,0.0015497694,0.000008890212],"about_ca_topic_score_codex":0.006762089,"about_ca_topic_score_gemma":0.0047103795,"teacher_disagreement_score":0.006762089,"about_ca_system_score_codex":0.0017567422,"about_ca_system_score_gemma":0.0011967779,"threshold_uncertainty_score":0.021130681},"labels":[],"label_agreement":null},{"id":"W94828587","doi":"","title":"Swarms of robots based on evolutionary game theory","year":2007,"lang":"en","type":"article","venue":"International Conference on Control Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Evolutionary robotics; Computer science; Artificial intelligence; Reinforcement learning; Set (abstract data type); Process (computing); Personality; Swarm robotics; Machine learning; Human–computer interaction; Psychology; Social psychology","score_opus":0.018669401211987152,"score_gpt":0.2860211424759233,"score_spread":0.2673517412639361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94828587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010462104,0.0013990073,0.9634739,0.0007611819,0.0002061215,0.00018325589,0.000043668035,0.00019030606,0.023280513],"genre_scores_gemma":[0.59085804,0.0032329494,0.38284987,0.00038851515,0.00020293426,0.0008693908,0.00016132536,0.000107037085,0.021329876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995127,0.00021805953,0.000028910312,0.000043397944,0.0001549969,0.000041854335],"domain_scores_gemma":[0.9996495,0.00018994341,0.000036065332,0.000028043813,0.00004893377,0.000047441852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062853115,0.00070978305,0.0011179615,0.0006309274,0.0006925724,0.0016060676,0.0012444415,0.0011795656,0.0029584458],"category_scores_gemma":[0.0019235259,0.00037029144,0.00096551765,0.00051853026,0.0017303054,0.001421952,0.0011711317,0.001405134,0.00038094728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021487871,0.000029253342,0.00026510144,0.00011240935,0.000055383633,0.00018355843,0.00020872822,0.29036617,0.0019403284,0.69035006,0.0015018074,0.014965796],"study_design_scores_gemma":[0.00003481314,0.00004982108,0.00015447405,0.00003162731,0.000017888937,0.00010896037,0.00004915277,0.7286638,0.000310319,0.26287654,0.0076807,0.000021887632],"about_ca_topic_score_codex":0.0024830112,"about_ca_topic_score_gemma":0.0018624851,"teacher_disagreement_score":0.0029584458,"about_ca_system_score_codex":0.0008739812,"about_ca_system_score_gemma":0.0007617115,"threshold_uncertainty_score":0.009896994},"labels":[],"label_agreement":null},{"id":"W961119122","doi":"10.1007/978-3-642-33902-8_13","title":"Mechanisms for Complex Systems Engineering Through Artificial Development","year":2012,"lang":"en","type":"book-chapter","venue":"Understanding complex systems","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolvability; Computer science; Function (biology); Sensitivity (control systems); Artificial intelligence; Development (topology); Space (punctuation); Control engineering; Engineering; Mathematics","score_opus":0.20738270474169884,"score_gpt":0.2742188261621337,"score_spread":0.06683612142043488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W961119122","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046240143,0.040350683,0.2572467,0.0077528367,0.0010561354,0.00007840239,0.00009669969,0.0004320442,0.6883625],"genre_scores_gemma":[0.23020172,0.062053654,0.21979572,0.0021609387,0.0011578405,0.0004666081,0.00030245332,0.0004966911,0.4833643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998294,0.0000470511,0.0000072002877,0.000029386516,0.000073918076,0.000013014557],"domain_scores_gemma":[0.99966836,0.00020492717,0.000016916345,0.00005751324,0.000036619298,0.000015653673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512202,0.0006553293,0.00037156302,0.0006785396,0.0006448105,0.0022837536,0.0011269861,0.0011842274,0.012729082],"category_scores_gemma":[0.0010220264,0.00033701368,0.00034993197,0.0005622215,0.0036234597,0.0031266701,0.0011179886,0.0020964902,0.0029035485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011369413,0.0000062533804,0.000018344648,0.000060251914,0.000003014234,0.000014282876,0.000077462595,0.0010674858,0.00025141315,0.97503793,0.005873611,0.0175888],"study_design_scores_gemma":[0.0000038775015,0.0000061510486,0.000051818,0.00008593402,0.0000030314557,0.00006328103,0.000036623347,0.0020106973,0.0004261776,0.823485,0.17382143,0.0000058900405],"about_ca_topic_score_codex":0.00052040466,"about_ca_topic_score_gemma":0.000871646,"teacher_disagreement_score":0.012729082,"about_ca_system_score_codex":0.0011787264,"about_ca_system_score_gemma":0.0008359434,"threshold_uncertainty_score":0.04258299},"labels":[],"label_agreement":null}]}