{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:53:37Z","timestamp":1762390417473,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T00:00:00Z","timestamp":1278460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,7]]},"DOI":"10.1145\/1830483.1830591","type":"proceedings-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:03:17Z","timestamp":1278885797000},"page":"579-586","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Self modifying cartesian genetic programming"],"prefix":"10.1145","author":[{"given":"Simon","family":"Harding","sequence":"first","affiliation":[{"name":"Memorial University, St John's, NF, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian F.","family":"Miller","sequence":"additional","affiliation":[{"name":"University of York, York, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Banzhaf","sequence":"additional","affiliation":[{"name":"Memorial University, St Johns, NF, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:GENP.0000017011.51324.d2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03025225"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277161"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569998"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01181-8_12"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1689599.1689637"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570000"},{"key":"e_1_3_2_1_8_1","volume-title":"e: The Story of a Number","author":"Maor E.","year":"1994","unstructured":"E. Maor . e: The Story of a Number . Princeton University Press , 1994 . E. Maor. e: The Story of a Number. Princeton University Press, 1994."},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Cartesian genetic programming","author":"Miller J. F.","year":"2000","unstructured":"J. F. Miller and P. Thomson . Cartesian genetic programming . In R. Poli, W. Banzhaf, et al., editors, Proc. of EuroGP 2000 , volume 1802 of LNCS , pages 121 -- 132 . Springer-Verlag , 2000. J. F. Miller and P. Thomson. Cartesian genetic programming. In R. Poli, W. Banzhaf, et al., editors, Proc. of EuroGP 2000, volume 1802 of LNCS, pages 121--132. Springer-Verlag, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1165893"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570292"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389343"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025176407779"}],"event":{"name":"GECCO '10: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Portland Oregon USA","acronym":"GECCO '10"},"container-title":["Proceedings of the 12th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830591","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830483.1830591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:39Z","timestamp":1750245759000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830591"}},"subtitle":["finding algorithms that calculate pi and e to arbitrary precision"],"short-title":[],"issued":{"date-parts":[[2010,7,7]]},"references-count":13,"alternative-id":["10.1145\/1830483.1830591","10.1145\/1830483"],"URL":"https:\/\/doi.org\/10.1145\/1830483.1830591","relation":{},"subject":[],"published":{"date-parts":[[2010,7,7]]},"assertion":[{"value":"2010-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}