{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":31,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":31,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"961f076980a0","filters":{"venue":"Genetic Programming and Evolvable Machines"}},"results":[{"id":"W2030792885","doi":"10.1007/s10710-010-9113-2","title":"Open issues in genetic programming","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Computer science; Genetic programming; Mainstream; Field (mathematics); Face (sociological concept); Range (aeronautics); Data science; Artificial intelligence; Management science; Operations research; Sociology; Mathematics; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01086872803388606,"gpt":0.2758444820490048,"spread":0.2649757540151187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378578,0.0002083319,0.0002172411,0.0001251724,0.0003287341,0.0008186177,0.001319013,0.00009019471,0.00001826801],"category_scores_gemma":[0.00003302238,0.0001895372,0.00003742859,0.0005684093,0.0001082332,0.0003217637,0.0008531375,0.0002644508,0.00002305787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001259294,"about_ca_system_score_gemma":0.00006850283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001641596,"about_ca_topic_score_gemma":0.0005668225,"domain_scores_codex":[0.9983384,0.00004173381,0.0003169158,0.0006281839,0.0001859339,0.0004888031],"domain_scores_gemma":[0.9990349,0.00004607919,0.00008098958,0.0006148011,0.00006624169,0.000157009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000231943,0.0001686256,0.04065345,0.00002428412,0.000008069536,0.00001150746,0.0003426344,0.0000970699,0.0004543746,0.004202815,0.0001774883,0.9538574],"study_design_scores_gemma":[0.001203743,0.0002910888,0.3173167,0.00007158389,0.00002284145,0.000291475,0.0001203006,0.316604,0.0002026308,0.02894479,0.3339917,0.0009390831],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7684237,0.008727514,0.2108178,0.006389713,0.000823268,0.002725802,0.000006145555,0.0006589267,0.001427073],"genre_scores_gemma":[0.2787963,0.00008685527,0.7200388,0.00006324468,0.0001259308,0.0003646496,0.000005010845,0.00001472179,0.0005044651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9529183,"threshold_uncertainty_score":0.7893949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052671997","doi":"10.1007/s10710-006-9003-9","title":"Using genetic algorithms for early schedulability analysis and stress testing in real-time systems","year":2006,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Task (project management); Worst-case execution time; Process (computing); Genetic algorithm; Execution time; Stress testing (software); Distributed computing; Embedded system; Machine learning; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02595016831673748,"gpt":0.2712235646308619,"spread":0.2452733963141245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000912618,0.0003346405,0.0006074962,0.0004281251,0.00030216,0.0009937151,0.0003773817,0.0001329273,8.305894e-7],"category_scores_gemma":[0.0001026287,0.0003158606,0.00008789074,0.001470854,0.0000965476,0.0002786838,0.0002226937,0.0001163503,0.000001354984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006697785,"about_ca_system_score_gemma":0.0000701125,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03139737,"about_ca_topic_score_gemma":0.000211025,"domain_scores_codex":[0.9971254,0.0001911366,0.000733164,0.0009573211,0.0002945148,0.000698389],"domain_scores_gemma":[0.9984996,0.0003111046,0.0002597995,0.0005823518,0.000197289,0.0001498217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006188417,0.00007350641,0.8574669,0.0003487201,0.00009176331,0.00001432934,0.0002046726,0.07323102,0.002495202,0.00006353463,0.000001226872,0.06600292],"study_design_scores_gemma":[0.0003254078,0.00007588173,0.2544478,0.00008751349,0.0001084118,0.00003375014,0.00002891907,0.7441797,0.00007658686,0.0003606635,0.000006964545,0.0002684814],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6848662,0.001836666,0.3123686,0.00001278569,0.0000861645,0.0006432186,0.000007334232,0.0001392011,0.00003979341],"genre_scores_gemma":[0.5112897,0.000006488916,0.4884763,0.000001487252,0.00009543842,0.00007430858,0.000005165313,0.00001693565,0.00003419056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6709486,"threshold_uncertainty_score":0.9999294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048338869","doi":"10.1007/s10710-008-9074-x","title":"Incorporating characteristics of human creativity into an evolutionary art algorithm","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; Simon Fraser University","funders":"","keywords":"Fitness function; Creativity; Evolutionary algorithm; Process (computing); Function (biology); Darwin (ADL); Computational creativity; Associative property","retraction":null,"screen_n_in":null,"score":{"opus":0.01544792161054853,"gpt":0.2488859365734192,"spread":0.2334380149628707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001940522,0.0001536386,0.0002618094,0.0000983298,0.0006962353,0.00003327739,0.0003086639,0.00008402819,0.000003393357],"category_scores_gemma":[0.00003754333,0.0001379221,0.00003443726,0.0002297623,0.0003745527,0.0001729392,0.0002761012,0.000127989,0.000002764568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001315939,"about_ca_system_score_gemma":0.00003758866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002250744,"about_ca_topic_score_gemma":0.000024263,"domain_scores_codex":[0.9989711,0.0000595844,0.0002718197,0.0003272216,0.0001529036,0.0002173524],"domain_scores_gemma":[0.9993019,0.0000376921,0.0001457706,0.0003538904,0.0000965685,0.00006422649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00000359645,0.0001976158,0.2720413,0.00005793416,0.00003675384,0.00002970782,0.002347565,0.000005206769,0.0004412071,0.002930212,0.000204819,0.7217041],"study_design_scores_gemma":[0.0006704211,0.001281037,0.8183719,0.00007831275,0.00003983734,0.0003271973,0.000201103,0.1289211,0.0002480054,0.04507666,0.00409767,0.0006866986],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8004076,0.0008678029,0.1978859,0.0001131959,0.0001152598,0.0001344258,0.000002801007,0.000229457,0.000243579],"genre_scores_gemma":[0.6418949,0.00003159103,0.3578399,0.00001913288,0.00004651387,0.00002036704,0.000007475139,0.000005024106,0.0001351378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7210174,"threshold_uncertainty_score":0.5624299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069303594","doi":"10.1007/s10710-010-9114-1","title":"Developments in Cartesian Genetic Programming: self-modifying CGP","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Genetic programming; Iterated function; Sequence (biology); Cartesian coordinate system; Theoretical computer science; Adder; Mathematical optimization; Graph; Algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007554399215886767,"gpt":0.2345407968960176,"spread":0.2269863976801308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002818109,0.0002639999,0.0002185439,0.0001878912,0.0004098576,0.0003557913,0.0006234394,0.0001183478,0.000004599976],"category_scores_gemma":[0.00002252028,0.0002511636,0.00004741302,0.000673224,0.00008015221,0.0001980031,0.0002896026,0.0003129878,0.000020795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003044891,"about_ca_system_score_gemma":0.0001303508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003185467,"about_ca_topic_score_gemma":0.0002274341,"domain_scores_codex":[0.997999,0.00003994295,0.0003834834,0.0006744727,0.0002605448,0.0006425231],"domain_scores_gemma":[0.9990605,0.00004644598,0.00009577592,0.0005049789,0.00007948659,0.0002128097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000001746539,0.0002288839,0.1209354,0.00005233981,0.00001760124,0.00001823755,0.0008629659,0.0001020668,0.000464698,0.002019586,0.00003548103,0.8752609],"study_design_scores_gemma":[0.001242134,0.0001825518,0.6193649,0.0000672879,0.00003307347,0.0003694579,0.0001111175,0.2489546,0.0001877385,0.004784314,0.1236455,0.001057404],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8574069,0.002550771,0.1356508,0.000857244,0.0006066837,0.001268604,0.000002881048,0.0008265301,0.0008296134],"genre_scores_gemma":[0.4668539,0.00003611616,0.5326836,0.00003415176,0.00007068235,0.0002252923,0.000004362403,0.00001310565,0.00007883038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8742036,"threshold_uncertainty_score":0.999994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076222444","doi":"10.1007/s10710-011-9151-4","title":"Symbiotic coevolutionary genetic programming: a benchmarking study under large attribute spaces","year":2011,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence; Machine learning; Classifier (UML); Benchmarking; Linear subspace; Subspace topology; Preprocessor; Data mining; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02263627719306998,"gpt":0.246843798503089,"spread":0.224207521310019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004431602,0.0003854418,0.0003277755,0.0001922402,0.0009535263,0.0003377041,0.0007630925,0.0001102902,0.00003353658],"category_scores_gemma":[0.00001883322,0.0003534871,0.00009911037,0.0008117052,0.000148398,0.0002792098,0.000615801,0.0002321068,0.00003145029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005224501,"about_ca_system_score_gemma":0.0001013156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000803592,"about_ca_topic_score_gemma":0.0001504691,"domain_scores_codex":[0.9971583,0.0001308663,0.0004762162,0.0009536206,0.0004083768,0.0008725675],"domain_scores_gemma":[0.9985586,0.00006888191,0.0001769307,0.0007593834,0.000160382,0.000275799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00001823814,0.003339799,0.6730189,0.000120316,0.000272231,0.00008405413,0.004308829,0.0003976205,0.00006829834,0.007197374,0.0004435551,0.3107308],"study_design_scores_gemma":[0.0014523,0.001417491,0.7797883,0.00007662844,0.0001911571,0.000323858,0.001311444,0.1989995,0.00002192647,0.007391755,0.007974736,0.001050914],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4336653,0.006953802,0.5564885,0.0003113511,0.0003660924,0.001459535,0.00001000815,0.0005714123,0.0001739127],"genre_scores_gemma":[0.67155,0.00005666574,0.3277174,0.00004722074,0.0001376834,0.00027128,0.00001208322,0.00002202035,0.0001856853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3096798,"threshold_uncertainty_score":0.9998917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0129217657187367,"gpt":0.2800358134837032,"spread":0.2671140477649665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000281845,0.0002061598,0.0003123591,0.0002725271,0.0002711551,0.00005595037,0.0004014053,0.00008140233,0.000002165986],"category_scores_gemma":[0.00007535067,0.000158547,0.00008805079,0.001367316,0.000219494,0.0001520584,0.0003193425,0.0001733036,0.000002647683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005206112,"about_ca_system_score_gemma":0.00003555058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005334552,"about_ca_topic_score_gemma":0.0004825792,"domain_scores_codex":[0.9984699,0.0001131387,0.0003824841,0.0003943592,0.0002341606,0.0004059677],"domain_scores_gemma":[0.9988981,0.0003179498,0.0001622391,0.0004153498,0.00009046581,0.0001158868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000007998309,0.0001733359,0.8539673,0.00004013787,0.0001241661,5.121746e-7,0.0007101918,0.003315035,0.00002125855,0.002032485,0.000005760056,0.1396018],"study_design_scores_gemma":[0.000152026,0.00005818732,0.5765215,0.00002428852,0.00008699469,0.00000312585,0.00008068069,0.4223975,0.000005032996,0.0003723321,0.0001797148,0.0001185499],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8178533,0.003107624,0.1781961,0.0001922801,0.0001018706,0.0004427801,0.00002645141,0.00004967017,0.00002988147],"genre_scores_gemma":[0.7515833,0.00004172809,0.2481705,0.00001672079,0.00004172221,0.0000825645,0.00001928168,0.00001005114,0.00003410915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4190825,"threshold_uncertainty_score":0.6465357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047198532","doi":"10.1007/s10710-013-9187-8","title":"Aesthetic 3D model evolution","year":2013,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Aesthetic Perception and Analysis","field":"Neuroscience","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Realm; Artificial intelligence; Entropy (arrow of time); Genetic programming; Evolutionary algorithm; Normality; Machine learning; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0157544133834918,"gpt":0.2385504960423509,"spread":0.2227960826588591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009611022,0.0001857486,0.0001734126,0.0001105586,0.000313606,0.0001858212,0.0001637275,0.00006588779,0.0002100242],"category_scores_gemma":[0.00004532214,0.0001512431,0.00006790087,0.0002523994,0.0001711554,0.0001329578,0.00007402694,0.0001119456,0.0002964755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002410624,"about_ca_system_score_gemma":0.00002405386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002986174,"about_ca_topic_score_gemma":0.000009451838,"domain_scores_codex":[0.9986758,0.00006446587,0.0002202227,0.000431888,0.0002230774,0.0003845276],"domain_scores_gemma":[0.9994687,0.000006958086,0.00006312722,0.000258415,0.00004241266,0.0001604222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006172547,0.0001236976,0.005105443,0.00002579143,0.000001591446,0.00000369044,0.0003610376,0.005719602,0.02487248,0.0005990272,0.0004734427,0.9627081],"study_design_scores_gemma":[0.0002630292,0.00007236392,0.002481504,0.0000151665,0.00003080878,0.0001123105,0.00006814913,0.9890103,0.0001117759,0.005711433,0.001861263,0.000261929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9523098,0.000540011,0.04419189,0.0008018492,0.00006158528,0.000293315,0.000002005697,0.0002395689,0.001559929],"genre_scores_gemma":[0.9735293,0.0001018237,0.02331533,0.0003266428,0.00003205885,0.00009949755,0.00000204065,0.00002074005,0.00257259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9832907,"threshold_uncertainty_score":0.6167516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972342439","doi":"10.1007/s10710-010-9105-2","title":"Variable population size and evolution acceleration: a case study with a parallel evolutionary algorithm","year":2010,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Evolutionary algorithm; Computer science; Variable (mathematics); Population size; Population; Evolutionary computation; Acceleration; Cultural algorithm; Parallel algorithm; Algorithm; Genetic algorithm; Population-based incremental learning; Artificial intelligence; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.004320053042347337,"gpt":0.2326669441186117,"spread":0.2283468910762644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002195759,0.0002435936,0.0001749261,0.00005680538,0.0004855975,0.0001184633,0.00008123516,0.0001520622,0.00001492358],"category_scores_gemma":[0.00005235887,0.0002127487,0.00002673148,0.0001687671,0.0001133258,0.00001482891,0.0001120134,0.0001640644,0.0000012352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001268971,"about_ca_system_score_gemma":0.00006787187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001724064,"about_ca_topic_score_gemma":0.001658614,"domain_scores_codex":[0.9986812,0.00006918987,0.0002460597,0.0005356033,0.0001649904,0.0003029039],"domain_scores_gemma":[0.9992902,0.00002019252,0.00008960234,0.0003142238,0.0001340101,0.0001517456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002426636,0.0007708361,0.8547272,0.00009466564,0.0002143698,0.0001608899,0.0003791586,0.00312044,0.009794848,0.0004040832,0.0001989711,0.1298919],"study_design_scores_gemma":[0.004343996,0.003384219,0.7536424,0.00002801218,0.0002838069,0.01328377,0.001716146,0.2161092,0.00002721161,0.00174615,0.004301975,0.001133079],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9468183,0.001075217,0.051159,0.00005863139,0.0001309986,0.0006288981,0.00001090832,0.00005019819,0.00006783481],"genre_scores_gemma":[0.7447008,0.00002389134,0.2545216,0.00003017282,0.0001791988,0.0001014832,0.00006104717,0.00002213018,0.0003596197],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2129887,"threshold_uncertainty_score":0.8675641,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01077993330042553,"gpt":0.2169474614803382,"spread":0.2061675281799127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005876799,0.0003622728,0.0002859708,0.0002194886,0.0008006559,0.0003710311,0.0005260019,0.00008297555,0.000005554783],"category_scores_gemma":[0.0000381255,0.0003075899,0.00005176182,0.0009454055,0.0002257333,0.000244368,0.0003390147,0.0002392097,0.00001285234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001203848,"about_ca_system_score_gemma":0.0001628407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002483344,"about_ca_topic_score_gemma":0.0000727607,"domain_scores_codex":[0.9972343,0.00004125173,0.0005036201,0.0009610446,0.0003879886,0.0008717272],"domain_scores_gemma":[0.9988581,0.00009587838,0.0001825147,0.0004230148,0.0001813987,0.0002590959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001927102,0.0001714032,0.01032105,0.000100629,0.00006552067,0.00004548539,0.001899956,0.0009997793,0.0005071326,0.002142067,0.00006444121,0.9836633],"study_design_scores_gemma":[0.002976011,0.00179096,0.3039095,0.0008781983,0.0001702025,0.004328077,0.00352281,0.5676698,0.0006119044,0.01130706,0.0993429,0.003492549],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1441935,0.001680384,0.8521841,0.0003692321,0.0001082514,0.0008627494,0.000001609185,0.000365225,0.0002349691],"genre_scores_gemma":[0.3014805,0.0000217223,0.6979585,0.00004333731,0.0001495669,0.0001687532,0.000006357757,0.00002233352,0.0001488933],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9801707,"threshold_uncertainty_score":0.9999376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Bidding; Classifier (UML); Genetic programming; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.01982953284110033,"gpt":0.2670076920093719,"spread":0.2471781591682716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000228732,0.0002253555,0.0002040447,0.0002234116,0.0006241216,0.0001127796,0.0003676496,0.0001017766,0.000002251569],"category_scores_gemma":[0.00001773158,0.0002248605,0.00007370311,0.0006308834,0.0001359454,0.000209018,0.0000836546,0.0001214025,0.00000667019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007718828,"about_ca_system_score_gemma":0.0001510429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001714476,"about_ca_topic_score_gemma":0.00003709311,"domain_scores_codex":[0.9981706,0.00005982665,0.0004292823,0.0006388526,0.0002232358,0.0004782598],"domain_scores_gemma":[0.999104,0.0001040778,0.0001381874,0.0003790285,0.0001457598,0.000128949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003549159,0.000924887,0.0966135,0.0002397288,0.00002738304,0.00001534841,0.0005226342,0.009602569,0.001413316,0.005008331,0.0006776244,0.8849192],"study_design_scores_gemma":[0.0008280945,0.0002349257,0.1959968,0.0000494299,0.00001421925,0.0001148978,0.00002674105,0.7882788,0.0000481247,0.005411346,0.008669637,0.0003269904],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1208374,0.002323573,0.8738951,0.001148143,0.00009211499,0.001357164,0.000007393906,0.0002723397,0.00006676851],"genre_scores_gemma":[0.4134088,0.00005939946,0.5852459,0.00004430456,0.00006381935,0.001065462,0.00004450113,0.00001374853,0.00005409262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8845922,"threshold_uncertainty_score":0.9169544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.003496496500966776,"gpt":0.2117898430544903,"spread":0.2082933465535235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001350452,0.0001494534,0.0001580543,0.00006563512,0.000194373,0.00007275307,0.000198641,0.000053219,0.000003619712],"category_scores_gemma":[0.000007643582,0.0001403288,0.00003183631,0.0001896607,0.0001578273,0.0001309503,0.0001611021,0.00006311375,0.000003185429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002101051,"about_ca_system_score_gemma":0.00001932697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003623369,"about_ca_topic_score_gemma":0.000007260882,"domain_scores_codex":[0.9988772,0.00003503541,0.0002873868,0.0003993035,0.0001758669,0.0002252071],"domain_scores_gemma":[0.999432,0.00004240824,0.0001012777,0.0003366215,0.0000211384,0.00006660986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.865852e-7,0.0001164457,0.006535518,0.0000340284,0.00000781259,0.000001059808,0.0000512984,0.005245726,0.000222974,0.0003981023,0.00001905356,0.987367],"study_design_scores_gemma":[0.000173028,0.00005977155,0.2360298,0.000009008869,0.00001278137,0.00002790194,0.000005946938,0.7506626,0.00005659159,0.0122409,0.0006056214,0.0001160224],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2005403,0.00311671,0.7958115,0.0001572497,0.00003954188,0.0002369856,0.000006117136,0.00005475247,0.00003682423],"genre_scores_gemma":[0.4306864,0.00006686903,0.5690642,0.000006305077,0.0000161574,0.00004342039,0.000008754015,0.000005640612,0.000102229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.987251,"threshold_uncertainty_score":0.5722443,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02830246072266629,"gpt":0.2700299575110928,"spread":0.2417274967884265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002458772,0.00011369,0.0001166037,0.00004907705,0.0003147578,0.0001004377,0.0003054832,0.00004693326,0.000004110903],"category_scores_gemma":[0.00001766891,0.00008400207,0.00004972942,0.0002607648,0.0000463364,0.0001689977,0.00008464749,0.00006941897,9.439374e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002397194,"about_ca_system_score_gemma":0.00006688156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002019017,"about_ca_topic_score_gemma":0.000009600127,"domain_scores_codex":[0.999073,0.00002539507,0.0002698748,0.0002784247,0.0001404912,0.0002128192],"domain_scores_gemma":[0.9994098,0.00005852851,0.0001172019,0.0002687856,0.00008303788,0.00006262761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004718699,0.0000667584,0.004434359,0.00003189354,0.00001337381,3.695274e-8,0.0001280731,0.7587156,0.00004153042,0.00832789,0.0001497522,0.228086],"study_design_scores_gemma":[0.0003017532,0.00006241395,0.007398708,0.000006462399,0.00002226903,0.00001505051,0.00006367284,0.9893141,0.00001346117,0.002153109,0.0005542297,0.00009475505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003263474,0.001235839,0.9940653,0.0007276764,0.00003821116,0.0004455739,0.000003626739,0.00007628919,0.000143973],"genre_scores_gemma":[0.2791806,0.00001277617,0.7201521,0.00002150815,0.0001417337,0.00009361751,0.000009968859,0.000006204248,0.0003814154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2759172,"threshold_uncertainty_score":0.3425505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.0292522184124415,"gpt":0.236904753554815,"spread":0.2076525351423735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001636321,0.00009605575,0.00008668502,0.00003818107,0.000295746,0.00003967679,0.0003289106,0.00004905024,0.000001524953],"category_scores_gemma":[0.000007861096,0.00006866347,0.0000372241,0.0002495296,0.000114073,0.0001481421,0.0001302461,0.00007278413,0.000003064295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002690418,"about_ca_system_score_gemma":0.00003647292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007105521,"about_ca_topic_score_gemma":0.00000879567,"domain_scores_codex":[0.9992044,0.00002507006,0.0001971172,0.0002370495,0.000137208,0.0001991391],"domain_scores_gemma":[0.9993914,0.00003699684,0.00008588245,0.0003406485,0.00008678642,0.00005828291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002085068,0.0002993383,0.003411813,0.00004639106,0.00005141657,0.000001295052,0.0007458896,0.0001553159,0.007327814,0.247809,0.0008711837,0.7392597],"study_design_scores_gemma":[0.0004234215,0.0002100207,0.1042911,0.00003569456,0.00003823412,0.00006007149,0.0001372983,0.5883047,0.001353772,0.2981015,0.006687276,0.0003569261],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07099562,0.007434458,0.9191833,0.0003644421,0.0002305548,0.0002622817,0.000003881167,0.0001492514,0.001376224],"genre_scores_gemma":[0.7594833,0.0000914781,0.2399952,0.000007163776,0.00004400502,0.0000577986,0.000001764557,0.000005016365,0.000314361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7389028,"threshold_uncertainty_score":0.2800015,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01499066644198162,"gpt":0.2570535366019504,"spread":0.2420628701599688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002045349,0.0002416931,0.0002508364,0.0001161565,0.0003201456,0.0001403575,0.0003343078,0.00009874698,0.000004842576],"category_scores_gemma":[0.00002395408,0.0002039265,0.00005495391,0.0002786198,0.0002133588,0.0001339294,0.0002422392,0.0002186988,0.000003711232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001285838,"about_ca_system_score_gemma":0.0000641105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000241835,"about_ca_topic_score_gemma":0.00003214538,"domain_scores_codex":[0.9984083,0.00001800208,0.000369647,0.0005295962,0.0002487926,0.0004257099],"domain_scores_gemma":[0.9990242,0.00007266907,0.000156759,0.0004685533,0.00008813623,0.0001896811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003435098,0.0004179252,0.02536806,0.0001414491,0.0000604604,0.00001197689,0.0006906282,0.003321062,0.003345305,0.00665169,0.0000310811,0.959926],"study_design_scores_gemma":[0.001667526,0.0005357158,0.02029567,0.00008595194,0.00005668037,0.0002788694,0.00006899942,0.9573402,0.000788201,0.008201698,0.01013869,0.0005417301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8105397,0.001475626,0.186857,0.0001823081,0.0001621778,0.0006094826,0.000003399959,0.0001299021,0.00004040359],"genre_scores_gemma":[0.4531089,0.00006886727,0.5465482,0.00003105123,0.00007739472,0.00008942855,0.000002856644,0.0000142631,0.00005900293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9593843,"threshold_uncertainty_score":0.8315879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3022915729","doi":"10.1007/s10710-020-09390-5","title":"Stock selection heuristics for performing frequent intraday trading with genetic programming","year":2020,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Mitacs","keywords":"Sharpe ratio; Computer science; Trading strategy; Portfolio; Stock (firearms); Algorithmic trading; Profitability index; Heuristics; Econometrics; Investment strategy; Genetic programming; Profit (economics); Financial economics; Business; Economics; Machine learning; Finance; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.02702185949264535,"gpt":0.2107142311430419,"spread":0.1836923716503966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002345042,0.0003062893,0.0004354092,0.0001082168,0.0004460894,0.0003424903,0.000153401,0.00009846413,0.00003112214],"category_scores_gemma":[0.00008799455,0.00029237,0.00007988203,0.0002980319,0.000100458,0.0001624795,0.00003753769,0.0001683286,0.000005741855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004928551,"about_ca_system_score_gemma":0.00004211147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002602864,"about_ca_topic_score_gemma":0.0000379954,"domain_scores_codex":[0.9981923,0.00001513458,0.0005411249,0.0006142764,0.00006639113,0.0005708179],"domain_scores_gemma":[0.9993261,0.00004285837,0.000255016,0.0001376216,0.00005112789,0.0001873226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002570533,0.0002125685,0.3698173,0.001390616,0.0002249432,0.00001342839,0.002430595,0.00116247,0.0001719658,0.02083495,0.0006783718,0.6028058],"study_design_scores_gemma":[0.003200723,0.005606886,0.07527035,0.000215909,0.0001947855,0.0001082152,0.0005758429,0.6722099,0.0002273646,0.0193245,0.2210864,0.001979128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8239658,0.01000349,0.161476,0.001024462,0.0003222929,0.001808867,0.000048121,0.0002700058,0.00108103],"genre_scores_gemma":[0.8083895,0.0001715002,0.1905158,0.0001739258,0.000337318,0.0002487778,0.00001807958,0.00005298208,0.00009214105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6710474,"threshold_uncertainty_score":0.9999529,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Genetic programming; Rendering (computer graphics); Computer graphics (images); Artificial intelligence; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.02525667951374614,"gpt":0.2260337717960986,"spread":0.2007770922823525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002395777,0.0002867604,0.0002433499,0.0001253772,0.0005706234,0.0003975171,0.0005002013,0.00004845969,0.000002995722],"category_scores_gemma":[0.00002382043,0.0002406841,0.00004813697,0.0005195409,0.0001085742,0.0003018036,0.0002369044,0.0001596995,0.00000977442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000286905,"about_ca_system_score_gemma":0.00004396229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005298051,"about_ca_topic_score_gemma":0.00004873244,"domain_scores_codex":[0.9980778,0.00004397992,0.0002976036,0.0006910171,0.0002920048,0.0005976597],"domain_scores_gemma":[0.9988708,0.00007549956,0.0001104759,0.0006253694,0.00009030715,0.0002275284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004958591,0.00007898926,0.007670644,0.00009431245,0.00002606267,0.000009485822,0.0004477796,0.001812971,0.0001618754,0.001475984,0.00002875413,0.9881882],"study_design_scores_gemma":[0.0008445355,0.0006276343,0.1048785,0.0001710434,0.00006522827,0.0003413475,0.0001262988,0.8527383,0.0001858934,0.002390951,0.03675673,0.0008735524],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1500857,0.000622686,0.8478895,0.0002299995,0.0001304217,0.0004045821,0.00000135953,0.0003640531,0.0002716587],"genre_scores_gemma":[0.4884965,0.00005750485,0.5107272,0.00003024986,0.0001452666,0.0004464968,0.000005110561,0.00002107938,0.00007054843],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9873146,"threshold_uncertainty_score":0.9814811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099304917","doi":"10.1007/s10710-008-9060-3","title":"An eigen analysis of the GP community","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Eigenvalues and eigenvectors; Genetic programming; Graph; Theoretical computer science; Connection (principal bundle); Artificial intelligence; Data mining; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01904674624203654,"gpt":0.2821854750771698,"spread":0.2631387288351333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004142258,0.0001448859,0.0002181307,0.00009973652,0.000422884,0.00002831468,0.0004582915,0.0001208529,0.00001355331],"category_scores_gemma":[0.0001227756,0.00009716272,0.0001359121,0.0004200224,0.000525571,0.000003698116,0.0002543609,0.0001599999,0.000001405824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005538915,"about_ca_system_score_gemma":0.00007154472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000711354,"about_ca_topic_score_gemma":0.0003811205,"domain_scores_codex":[0.9987828,0.0001780424,0.0002883491,0.0001800301,0.0002692739,0.0003015322],"domain_scores_gemma":[0.9989361,0.00002255649,0.00009287402,0.0006678727,0.0001291827,0.0001513923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00008384599,0.0004976338,0.723708,0.0001667878,0.0009200645,0.000002178896,0.001640298,0.0007349572,0.05920343,0.00001325415,0.0006161755,0.2124133],"study_design_scores_gemma":[0.0007186962,0.001200652,0.9377428,0.00002125118,0.0005070014,0.00004111456,0.0007269726,0.02270341,0.01911724,0.0001511492,0.01664287,0.0004268332],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9969976,0.001046087,0.001356735,0.00006292081,0.00006420464,0.0001720906,0.00002167483,0.00001150114,0.0002671753],"genre_scores_gemma":[0.9928935,0.0005159227,0.00601304,0.00009366866,0.00006461498,0.00001370985,0.00008995977,0.00001075274,0.0003048605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2140348,"threshold_uncertainty_score":0.3962181,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01290762284835548,"gpt":0.2340457356330952,"spread":0.2211381127847397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675392,0.0001420768,0.0001320471,0.00001143749,0.0004380648,0.0002825566,0.0004486234,0.00004992402,0.000001825007],"category_scores_gemma":[0.0001092095,0.0001013329,0.00003714751,0.0002694331,0.00009536616,0.0001318752,0.0001726783,0.0001197304,0.00000972696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003641598,"about_ca_system_score_gemma":0.00005465905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002677581,"about_ca_topic_score_gemma":0.00001606065,"domain_scores_codex":[0.9988794,0.00005597295,0.0002086536,0.0003318244,0.000211734,0.0003124033],"domain_scores_gemma":[0.999211,0.0001311714,0.00007594569,0.0002826551,0.0001550809,0.0001441345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004763442,0.000446327,0.02060124,0.00008112409,0.0001439432,0.0000107217,0.001232788,0.003834428,0.002133312,0.05893625,0.01309463,0.8994376],"study_design_scores_gemma":[0.0005418739,0.0001264992,0.005625546,0.00001386258,0.00002306101,0.00004195388,0.00004656204,0.9537446,0.00003414732,0.01648548,0.02308891,0.0002274965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04036548,0.005284145,0.9497331,0.003872525,0.000127507,0.0002981887,0.00002318665,0.0001926495,0.0001031912],"genre_scores_gemma":[0.870279,0.00008617067,0.129029,0.000153511,0.0001128174,0.0001086046,0.00003814904,0.00001037266,0.0001824595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9499102,"threshold_uncertainty_score":0.4132236,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0154498512321424,"gpt":0.2573528990363186,"spread":0.2419030478041762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005437939,0.000457799,0.0004684333,0.0003069311,0.0004982697,0.0007453943,0.0007580493,0.0002843508,0.00002067609],"category_scores_gemma":[0.0001169338,0.0004547401,0.0001423273,0.0004944846,0.0001081987,0.0002409504,0.002162695,0.001168692,0.000005884041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001140974,"about_ca_system_score_gemma":0.0002007282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001510093,"about_ca_topic_score_gemma":0.0001428732,"domain_scores_codex":[0.9968749,0.0001937178,0.0006911196,0.001206071,0.0004215207,0.0006126405],"domain_scores_gemma":[0.9985392,0.00009825144,0.0002296032,0.0007700265,0.0001594911,0.000203434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008461037,0.0003672976,0.04961298,0.0004970619,0.0000967442,0.00006236131,0.002748429,0.3072914,0.0003271035,0.0004086725,0.0001135833,0.6384659],"study_design_scores_gemma":[0.000481734,0.00007145394,0.04317596,0.0002574459,0.00002713079,0.00005683787,0.00009472567,0.9533973,0.0000150085,0.001094675,0.0009149443,0.000412721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08806127,0.01205783,0.8970006,0.0007345426,0.0006454467,0.000797232,0.000006442455,0.0004603449,0.0002362794],"genre_scores_gemma":[0.5288731,0.0006379309,0.4690252,0.00004988829,0.0001945811,0.0004773755,0.0001628272,0.00003020986,0.0005489209],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.646106,"threshold_uncertainty_score":0.9997904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2599286397","doi":"10.1007/s10710-017-9298-8","title":"A univariate marginal distribution algorithm based on extreme elitism and its application to the robotic inverse displacement problem","year":2017,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"British Columbia Knowledge Development Fund; Canada Foundation for Innovation","keywords":"Particle swarm optimization; Computer science; Algorithm; Univariate; Differential evolution; Heuristic; Displacement (psychology); Domain (mathematical analysis); Mathematical optimization; Mathematics; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01966617289943487,"gpt":0.2691151408858998,"spread":0.2494489679864649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799458,0.0001819443,0.0001545191,0.00007340563,0.0009758848,0.0008695577,0.000632382,0.00004586219,0.000006787003],"category_scores_gemma":[0.0001269325,0.0001347147,0.00002480348,0.0001842355,0.00006901926,0.0001510336,0.0003853548,0.0001291895,0.00001993682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004315067,"about_ca_system_score_gemma":0.00005869553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002156624,"about_ca_topic_score_gemma":0.00002413182,"domain_scores_codex":[0.9983812,0.0001180329,0.0002080978,0.0005247972,0.0003942132,0.0003736847],"domain_scores_gemma":[0.998743,0.00006463281,0.0001236941,0.0007221635,0.0001385479,0.000207949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001394007,0.0000764173,0.0007645769,0.00005557418,0.00001395904,0.000006266605,0.0001018245,0.01923524,0.00004045973,0.002379202,0.0001578387,0.9771547],"study_design_scores_gemma":[0.0004314918,0.0001562129,0.0103057,0.00003645206,0.00001590275,0.000008720885,0.000006320481,0.9818318,0.00002724976,0.0005218938,0.006500178,0.0001580259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009139125,0.0002035346,0.9928351,0.00479274,0.000105833,0.0009864095,0.00001424282,0.00006477863,0.00008345787],"genre_scores_gemma":[0.216667,0.0000942265,0.7816121,0.0001821317,0.0001208743,0.0004886928,0.00005096203,0.00002054,0.0007634477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9769967,"threshold_uncertainty_score":0.8385165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988192121","doi":"10.1007/s10710-007-9026-x","title":"Editorial introduction to the special issue on developmental systems","year":2007,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Cognitive Abilities and Testing","field":"Psychology","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cognitive science; Artificial intelligence; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01194502160433697,"gpt":0.2739327806905421,"spread":0.2619877590862051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007004903,0.0001480715,0.0001283125,0.00007005186,0.0003249374,0.0001183493,0.0001025366,0.00006516775,0.0002390604],"category_scores_gemma":[0.0001758106,0.0001062581,0.00002683273,0.0001857821,0.00005480814,0.00002129873,0.00005945441,0.000149674,0.00020615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004033323,"about_ca_system_score_gemma":0.00001540446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007798448,"about_ca_topic_score_gemma":0.0001350794,"domain_scores_codex":[0.9987821,0.00005519197,0.0002288697,0.0003467083,0.0001963849,0.000390732],"domain_scores_gemma":[0.9994624,0.0001687006,0.00004737515,0.0001496009,0.00008111429,0.00009084597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001282325,0.00005796759,0.006466615,0.00001493555,0.00002732349,0.000003774682,0.001971491,0.00003353265,0.0000288122,0.0001902709,0.2353669,0.7557101],"study_design_scores_gemma":[0.0002751244,0.00027746,0.0132785,0.00001583518,0.00001560995,0.00004582058,0.002730966,0.0000392033,0.00001763005,0.00006088452,0.9830945,0.0001484233],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"editorial","genre_scores_codex":[0.6664467,0.0009322205,0.001771509,0.002094641,0.30188,0.001533424,0.00001043544,0.0002290376,0.02510206],"genre_scores_gemma":[0.2358553,0.000003423487,0.002707891,0.0001170342,0.7579184,0.00009360402,0.00001014133,0.00002471254,0.003269498],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.7555617,"threshold_uncertainty_score":0.4333078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969653308","doi":"10.1007/s10710-008-9057-y","title":"Analysis of mass spectrometry data of cerebral stroke samples: an evolutionary computation approach to resolve and quantify peptide peaks","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Institute for Biological Sciences; National Research Council Canada","funders":"University of Waterloo","keywords":"Preprocessor; Computer science; Computation; Evolutionary computation; Evolutionary algorithm; Differential evolution; Genetic algorithm; Perspective (graphical); Algorithm; Artificial intelligence; Mass spectrometry; Series (stratigraphy); Data pre-processing; Machine learning; Chemistry; Biology; Chromatography","retraction":null,"screen_n_in":null,"score":{"opus":0.04323462917589405,"gpt":0.3023370453336234,"spread":0.2591024161577293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001401524,0.0001583796,0.0003458171,0.0002192774,0.0001561626,0.00001971403,0.0002652724,0.00007576111,0.00001034227],"category_scores_gemma":[0.00003313609,0.0001560164,0.00005023272,0.0005028215,0.0001565145,0.00008685584,0.0001892421,0.0001088614,1.851507e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001643343,"about_ca_system_score_gemma":0.00002679473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006187883,"about_ca_topic_score_gemma":0.00001776875,"domain_scores_codex":[0.9987366,0.00001937731,0.0003623559,0.0004950882,0.0001793183,0.0002072768],"domain_scores_gemma":[0.9989963,0.00005164593,0.000178758,0.0005808107,0.00008512872,0.000107332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001378267,0.0006455777,0.8323421,0.0006322602,0.0007219628,0.000002329388,0.0009656824,0.01310996,0.09997465,0.0006889787,0.0001193755,0.05065931],"study_design_scores_gemma":[0.0007564619,0.0002679522,0.1783006,0.00007165189,0.001048949,0.00006703608,0.001171433,0.8067414,0.007953269,0.002203727,0.000718922,0.0006985561],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5975825,0.0007322385,0.4009645,0.00001626728,0.000004081273,0.0001511991,0.0002823041,0.00005074744,0.000216245],"genre_scores_gemma":[0.4871689,0.00007654436,0.512241,0.000003065387,0.00001901602,0.00002377998,0.0004245017,0.00001003434,0.00003316187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7936314,"threshold_uncertainty_score":0.6362163,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02351088147582434,"gpt":0.2816448645220405,"spread":0.2581339830462162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003727403,0.0001762716,0.0001697257,0.0003058862,0.0003299161,0.0006305034,0.0002294503,0.0000590579,0.000001602879],"category_scores_gemma":[0.00002674164,0.0001708335,0.00002370274,0.001061764,0.00006270969,0.0004994241,0.0001498932,0.0001095444,0.00001749433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002703781,"about_ca_system_score_gemma":0.00007362265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003154586,"about_ca_topic_score_gemma":0.0001217001,"domain_scores_codex":[0.9984047,0.00007790051,0.0002900072,0.0005299625,0.0002447189,0.0004526646],"domain_scores_gemma":[0.9993702,0.00008620664,0.00004663682,0.0002570116,0.0000919066,0.0001480991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000817447,0.00007424298,0.01030846,0.00007421335,0.00001372939,0.00001388508,0.004394839,0.0519958,0.0006734477,0.002779304,0.00007513156,0.9295888],"study_design_scores_gemma":[0.000504131,0.0002021043,0.1069899,0.00004580748,0.0000102411,0.00002383593,0.00123487,0.8782941,0.00003377464,0.01100598,0.001386152,0.0002691179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2872111,0.0009021853,0.7089728,0.001893891,0.00006345218,0.0006532819,0.000001707952,0.0002790773,0.00002249921],"genre_scores_gemma":[0.6660724,0.0001275474,0.3331112,0.00004550729,0.00006035061,0.000482268,0.000008689607,0.00001429958,0.00007783341],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9293197,"threshold_uncertainty_score":0.6966389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3004497404","doi":"10.1007/s10710-019-09372-2","title":"Juan C. Burguillo: Self-organizing coalitions for managing complexity","year":2020,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Complex Systems and Decision Making","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence; Self-organization","retraction":null,"screen_n_in":null,"score":{"opus":0.1685588205066189,"gpt":0.3709816329083628,"spread":0.2024228124017439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001142316,0.0002619567,0.0005001206,0.0001672389,0.0008656023,0.001047962,0.0005811876,0.00006658523,0.0001262712],"category_scores_gemma":[0.001001121,0.0002070059,0.0001614555,0.0007910819,0.0001014099,0.0001580683,0.0003750386,0.0001271252,0.00006213352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002241663,"about_ca_system_score_gemma":0.00004501413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001750035,"about_ca_topic_score_gemma":0.00005648781,"domain_scores_codex":[0.9969642,0.0001302243,0.0008270259,0.0008314542,0.0007405875,0.0005065529],"domain_scores_gemma":[0.9978352,0.0007597017,0.000251635,0.0004722904,0.0003387397,0.0003425003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001418962,0.0002030341,0.07010961,0.0003597136,0.0001667752,0.00003617379,0.0071512,0.001713607,0.001155538,0.03100196,0.04302895,0.8449315],"study_design_scores_gemma":[0.00106465,0.0002842001,0.01014263,0.0000611176,0.00006804058,0.00005549678,0.001941839,0.3931799,0.00003886601,0.1800033,0.4125742,0.0005856944],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2017963,0.01142707,0.7675037,0.01095489,0.001119228,0.002169929,0.0001015261,0.001068353,0.003858978],"genre_scores_gemma":[0.8498144,0.00001218178,0.1487916,0.0004600433,0.0004005734,0.00005972755,0.000006479575,0.00003300622,0.000422031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8443459,"threshold_uncertainty_score":0.999989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407794873","doi":"10.1007/s10710-025-09507-8","title":"Editorial introduction for the special issue on highlights of genetic programming 2023 events","year":2025,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Biomedical and Engineering Education","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Genetic programming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.003858480527120507,"gpt":0.2188675859205046,"spread":0.2150091053933841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671133,0.0001722182,0.0001756581,0.00010821,0.0001375661,0.00004432493,0.0001418125,0.0001130213,0.00001934861],"category_scores_gemma":[0.00006317121,0.0001261993,0.0000555173,0.000286924,0.00005580728,0.00002864601,0.00002598679,0.0001251599,0.000005060417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003138096,"about_ca_system_score_gemma":0.00002144099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000610601,"about_ca_topic_score_gemma":0.00001286118,"domain_scores_codex":[0.9990552,0.0000129784,0.0002650227,0.0002174305,0.0001700419,0.0002792905],"domain_scores_gemma":[0.9995629,0.00008856021,0.00003416435,0.000198945,0.00006072314,0.00005475231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003709035,0.00006737567,0.0003063935,0.0007085031,0.00009511179,1.505698e-7,0.0001480568,0.005758578,0.0002709127,0.0001046419,0.1653099,0.8271933],"study_design_scores_gemma":[0.0003606262,0.0001317166,0.003434868,0.00007200593,0.00007730643,0.000001657123,0.00003661984,0.01935927,0.0003237578,0.0004309584,0.9756256,0.0001456558],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.1476441,0.01772697,0.1241584,0.01014362,0.6925644,0.005463682,0.00005813636,0.001336712,0.000903996],"genre_scores_gemma":[0.1912532,0.001284902,0.07005724,0.00005354603,0.7324157,0.001295517,0.0001012894,0.000120706,0.003417892],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.8270476,"threshold_uncertainty_score":0.5146257,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01327335965430916,"gpt":0.2288545776728534,"spread":0.2155812180185442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004619856,0.0003705168,0.0003184948,0.0001568171,0.001884423,0.0005734068,0.000848807,0.00006448429,0.00005732875],"category_scores_gemma":[0.00001433569,0.0003361623,0.00008759641,0.0008304466,0.0001279307,0.0002134216,0.0006337926,0.0004023066,0.00001069304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000090145,"about_ca_system_score_gemma":0.0001785192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009445468,"about_ca_topic_score_gemma":0.0001194456,"domain_scores_codex":[0.9969292,0.0001431412,0.0004298603,0.00098861,0.0006577041,0.0008514999],"domain_scores_gemma":[0.9985533,0.00009954916,0.0002069355,0.0007718738,0.0001068636,0.000261452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004835029,0.0005250722,0.01854971,0.00008175883,0.00005568456,0.00008989003,0.0006261377,0.0403939,0.0006941429,0.001216159,0.0003438878,0.9373753],"study_design_scores_gemma":[0.001521299,0.002350619,0.03743979,0.000147843,0.00009265461,0.0006914349,0.0002046331,0.8825511,0.0002130307,0.003211925,0.07045731,0.001118413],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.490301,0.005882849,0.4993023,0.001106118,0.000479225,0.001590454,0.00001326472,0.0006922923,0.0006325081],"genre_scores_gemma":[0.4779515,0.00004404868,0.5196529,0.000196627,0.0002238257,0.001019737,0.000017494,0.00003449019,0.0008594118],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9362569,"threshold_uncertainty_score":0.999909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403062981","doi":"10.1007/s10710-024-09495-1","title":"Leonardo Vanneschi and Sara Silva: lectures on intelligent systems","year":2024,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01046617819930406,"gpt":0.238799635162774,"spread":0.2283334569634699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004295426,0.0003241032,0.0003003811,0.0001931812,0.0002437679,0.001350811,0.0004206834,0.00009427086,0.000004844731],"category_scores_gemma":[0.00004925047,0.0002484457,0.00006905518,0.0004061762,0.0001142372,0.0001282386,0.0003995218,0.0002377913,0.00002146576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003973307,"about_ca_system_score_gemma":0.00004527395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003278368,"about_ca_topic_score_gemma":0.00002291097,"domain_scores_codex":[0.997898,0.0001110111,0.0003136375,0.0008918397,0.0003068249,0.000478681],"domain_scores_gemma":[0.9989881,0.0002430272,0.00004296588,0.0004839745,0.00005858345,0.0001833339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006615967,0.00006157471,0.001920748,0.0003374157,0.00004514679,0.00004969091,0.0007111489,0.003652856,0.00007124648,0.00386899,0.0002239494,0.9890506],"study_design_scores_gemma":[0.0001583117,0.0005518309,0.00339725,0.0001629391,0.00002943054,0.0002965808,0.00006769723,0.9568852,0.0001394612,0.007457917,0.03041136,0.0004420643],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2159128,0.108794,0.6679047,0.001637693,0.003054499,0.0009638996,0.000005438465,0.0012669,0.0004601117],"genre_scores_gemma":[0.9485453,0.0002514295,0.05047292,0.00007152222,0.0003055965,0.00007236469,0.000003127401,0.00002513277,0.0002526204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9886085,"threshold_uncertainty_score":0.9999968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242649666","doi":"10.1007/s10710-007-9054-6","title":"Editorial introduction","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Water Governance and Infrastructure","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007028228729694921,"gpt":0.2349904279994644,"spread":0.2279621992697695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001544426,0.00008672375,0.00009805921,0.00002828144,0.0007254547,0.00006914308,0.00009541708,0.0000837496,0.00006922859],"category_scores_gemma":[0.00007623864,0.00007439867,0.00002660276,0.0001353509,0.0002329053,0.0001332765,0.00002792219,0.00009833005,0.00001373182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002151928,"about_ca_system_score_gemma":0.00005985249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00270103,"about_ca_topic_score_gemma":0.0002256588,"domain_scores_codex":[0.9991279,0.00004282167,0.0001071465,0.0001947855,0.000256278,0.0002710675],"domain_scores_gemma":[0.9996981,0.0000115186,0.0000438118,0.0001010148,0.00006347472,0.00008208526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004002227,0.00004807604,0.09111986,0.00002513253,0.00002517399,0.000006263916,0.01463011,0.00006803207,0.0003172879,0.0009519529,0.6301162,0.2626519],"study_design_scores_gemma":[0.0001566637,0.00004464829,0.008578014,0.000003400177,0.000007647255,0.00000985673,0.0002455174,0.00004201231,0.0000343237,0.001083005,0.9896871,0.0001078013],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9300556,0.001571442,0.0004472053,0.002107932,0.06230418,0.0002943222,0.000003450202,0.000240254,0.002975671],"genre_scores_gemma":[0.7088979,0.0008867733,0.01261155,0.00007058741,0.2735059,0.00002771537,0.000008379842,0.00001670436,0.003974428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3595709,"threshold_uncertainty_score":0.5579684,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.004277830987765302,"gpt":0.2287249668038898,"spread":0.2244471358161245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004234477,0.0003108044,0.0002920798,0.0001445969,0.0007672864,0.0004209517,0.0008665505,0.0003079997,0.00005566591],"category_scores_gemma":[0.000144168,0.0003072333,0.00008532374,0.0004347262,0.00007604248,0.0001807169,0.0007480496,0.0007568605,0.00001810192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000859526,"about_ca_system_score_gemma":0.0002463889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003175805,"about_ca_topic_score_gemma":0.000008832857,"domain_scores_codex":[0.9974144,0.00008508674,0.0003276726,0.0009284832,0.0008342792,0.000410071],"domain_scores_gemma":[0.998597,0.0001688146,0.0001823894,0.0007318008,0.0001955244,0.0001244465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003748676,0.00006010629,0.00001227751,0.00003946019,0.0000215202,0.000001394471,0.00006106857,0.0001135512,0.000004962389,0.0003287022,0.899745,0.09960814],"study_design_scores_gemma":[0.0002258199,0.0001499828,0.00001950118,0.000007286742,0.00003054507,0.000009806626,0.00001114383,0.008597892,9.968006e-7,0.002395086,0.9882212,0.0003307046],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00001186971,0.00273508,0.03543487,0.0006458491,0.9604356,0.0002906541,0.00003284385,0.0003248065,0.00008845107],"genre_scores_gemma":[0.00001029654,0.00036513,0.09620491,0.000008715526,0.9012269,0.0004116014,0.0002895182,0.00002777622,0.001455104],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.09927743,"threshold_uncertainty_score":0.999938,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01232736480788241,"gpt":0.2472245707872502,"spread":0.2348972059793678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001483796,0.000101684,0.00009201916,0.00008004163,0.0002739303,0.0001426118,0.0002962606,0.00003619928,0.00001215143],"category_scores_gemma":[0.00001184412,0.00008857622,0.00002957578,0.0005316381,0.00003881956,0.00009230698,0.0002058105,0.00006499736,0.0002136809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007632238,"about_ca_system_score_gemma":0.00002067056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000106298,"about_ca_topic_score_gemma":0.000005654383,"domain_scores_codex":[0.9991421,0.00001894352,0.000125567,0.0002990314,0.0001317504,0.0002826286],"domain_scores_gemma":[0.9995125,0.00003803593,0.0000311726,0.0002989088,0.00003285,0.00008651829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.932155e-7,0.00004776617,0.009369572,0.00003681154,0.00001397212,0.00001159964,0.0003135629,0.0004001549,0.0002261294,0.009855318,0.005039908,0.9746843],"study_design_scores_gemma":[0.0003164014,0.0001004339,0.09665469,0.00002177874,0.00001169393,0.00005244874,0.00005913619,0.6866155,0.00006123783,0.02066734,0.1951029,0.0003365081],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3111448,0.005635933,0.6678851,0.007305944,0.0006719319,0.0007870208,0.00001228636,0.003348951,0.00320798],"genre_scores_gemma":[0.501178,0.0003872925,0.493763,0.00020465,0.0003211713,0.0002783752,0.00003084946,0.00002539253,0.003811245],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9743478,"threshold_uncertainty_score":0.3612033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386457064","doi":"10.1007/s10710-023-09459-x","title":"Evolutionary design and analysis of ribozyme-based logic gates","year":2023,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer science; Theoretical computer science; Synthetic biology; Ribozyme; Artificial intelligence; Bioinformatics","retraction":null,"screen_n_in":null,"score":{"opus":0.01566732066568915,"gpt":0.2480071903992837,"spread":0.2323398697335946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003284414,0.0001517061,0.0002244007,0.0001915878,0.0001210074,0.00002785297,0.00009813606,0.000104636,0.00001502504],"category_scores_gemma":[0.00007017127,0.0001303414,0.00008071466,0.000469215,0.0001055659,0.000002932449,0.0000763128,0.00003341445,0.000002303326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003087387,"about_ca_system_score_gemma":0.00003007273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005763877,"about_ca_topic_score_gemma":0.000006582203,"domain_scores_codex":[0.9990173,0.0001021056,0.0001914417,0.000334354,0.0001131375,0.0002416404],"domain_scores_gemma":[0.9995232,0.00005361248,0.00007577246,0.0002182336,0.00005466387,0.00007451761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002755544,0.0001385891,0.0950093,0.000258889,0.001170856,0.00001366323,0.0001160131,0.01795828,0.6458177,0.000294057,0.0004683748,0.2384787],"study_design_scores_gemma":[0.002172556,0.002959119,0.1869228,0.0001407994,0.002852194,0.00004357006,0.0002721875,0.5146257,0.2638337,0.01238933,0.01212336,0.001664703],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9029779,0.01093631,0.08522639,0.0002387679,0.00006595864,0.0004021224,0.00002368018,0.00006903271,0.00005987628],"genre_scores_gemma":[0.9187017,0.0004702358,0.08031755,0.00004873265,0.00003721388,0.00007885499,0.0001181083,0.00001681872,0.0002107569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4966674,"threshold_uncertainty_score":0.5315169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}