{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:12:00Z","timestamp":1777360320762,"version":"3.51.4"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1017817"],"award-info":[{"award-number":["1017817"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1129139"],"award-info":[{"award-number":["1129139"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1331283"],"award-info":[{"award-number":["1331283"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/tevc.2014.2362729","type":"journal-article","created":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T00:45:02Z","timestamp":1421714702000},"page":"630-643","source":"Crossref","is-referenced-by-count":156,"title":["Solving Uncompromising Problems With Lexicase Selection"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2330-6809","authenticated-orcid":false,"given":"Thomas","family":"Helmuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee","family":"Spector","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Matheson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001767"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598230"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11729976_15"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.903549"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15871-1_48"},{"key":"ref10","first-page":"493","article-title":"Pareto coevolution: Using performance against coevolved opponents in a game as dimensions for Pareto selection","author":"noble","year":"2001","journal-title":"Proc Genet Evol Comput Conf (GECCO)"},{"key":"ref11","first-page":"295","article-title":"Evolving data structures with genetic programming","author":"langdon","year":"1995","journal-title":"Proceedings of the 6th International Conference on Genetic Algorithms"},{"key":"ref12","first-page":"395","article-title":"Data structures and genetic programming","author":"langdon","year":"1996","journal-title":"Advances in Genetic Programming 2"},{"key":"ref13","article-title":"Multiobjective optimization using the niched Pareto genetic algorithm","author":"horn","year":"1993"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref15","article-title":"SPEA2: Improving the strength Pareto evolutionary algorithm","author":"zitzler","year":"2001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23254-0_17"},{"key":"ref17","first-page":"41","article-title":"Genetic algorithms with sharing for multimodal function optimization","author":"goldberg","year":"1987","journal-title":"Proc 2nd Int Conf Genetic Algorithms"},{"key":"ref18","author":"luke","year":"2009","journal-title":"Essentials of Metaheuristics"},{"key":"ref19","first-page":"153","article-title":"Population diversity in an immune system model: Implications for genetic search","author":"smith","year":"1992","journal-title":"Foundations of Genetic Algorithms 2"},{"key":"ref28","volume":"1","author":"mckenzie","year":"1987","journal-title":"Algebras Lattices and Varieties"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.104"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389343"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-012-9177-2"},{"key":"ref6","first-page":"820","article-title":"Is the perfect the enemy of the good?","author":"luke","year":"2002","journal-title":"Proc Genet Evol Comput Conf (GECCO)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330273"},{"key":"ref5","article-title":"Optimising existing software with genetic programming","author":"langdon","year":"0","journal-title":"IEEE Trans Evol Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3115\/991365.991400"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2330784.2330846"},{"key":"ref2","first-page":"435","article-title":"Fitness sharing in genetic programming","author":"mckay","year":"2000","journal-title":"Proc Genet Evol Comput Conf (GECCO)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2464576.2466814"},{"key":"ref1","author":"koza","year":"1992","journal-title":"Genetic Programming On the Programming of Computers by Means of Natural Selection"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37192-9_38"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15871-1_50"},{"key":"ref21","first-page":"61","article-title":"Genetic programming with historically assessed hardness","author":"klein","year":"2008","journal-title":"Genetic Programming Theory and Practice VI"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014538503543"},{"key":"ref23","first-page":"137","article-title":"Autoconstructive evolution: Push, pushGP, and pushpop","author":"spector","year":"2001","journal-title":"Proc Genet Evol Comput Conf (GECCO)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-0375-7_8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068292"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/4235\/7283685\/6920034-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/7283685\/06920034.pdf?arnumber=6920034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:50:19Z","timestamp":1649443819000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6920034\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":35,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2014.2362729","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}