{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:15Z","timestamp":1750306395511,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"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":[[2015,7,11]]},"DOI":"10.1145\/2739480.2754820","type":"proceedings-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T19:38:55Z","timestamp":1436297935000},"page":"1071-1078","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Evolution of High Entropy RNGs Using Single Node Genetic Programming"],"prefix":"10.1145","author":[{"given":"Philip","family":"Leonard","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"David","family":"Jackson","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/14640746608400019"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215025"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1609956.1609966"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bjps\/axi138"},{"key":"e_1_3_2_1_5_1","volume-title":"A statistical test suite for random and pseudorandom number generators for cryptographic applications","author":"Andrew Rukhin","year":"2001","unstructured":"Andrew Rukhin et al. A statistical test suite for random and pseudorandom number generators for cryptographic applications , 2001 . Andrew Rukhin et al. A statistical test suite for random and pseudorandom number generators for cryptographic applications, 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/90455"},{"key":"e_1_3_2_1_7_1","volume-title":"Random.org - true random number service. {online} random.org. Available at: http:\/\/www.random.org {Accessed 27th","author":"Haahr M","year":"2015","unstructured":"M Haahr . Random.org - true random number service. {online} random.org. Available at: http:\/\/www.random.org {Accessed 27th March 2015 }. M Haahr. Random.org - true random number service. {online} random.org. Available at: http:\/\/www.random.org {Accessed 27th March 2015}."},{"volume-title":"Available at: http:\/\/www.reteam.org\/papers\/e59.pdf {Accessed 27th","year":"2015","key":"e_1_3_2_1_8_1","unstructured":"Haldir{RET}. How to crack a linear congruential generator. Reverse Engineering Team , Available at: http:\/\/www.reteam.org\/papers\/e59.pdf {Accessed 27th March 2015 }, 2004. Haldir{RET}. How to crack a linear congruential generator. Reverse Engineering Team, Available at: http:\/\/www.reteam.org\/papers\/e59.pdf {Accessed 27th March 2015}, 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1331075"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29139-5_5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_33"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647933.740748"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"e_1_3_2_1_14_1","volume-title":"The art of computer programming: sorting and searching","author":"Knuth Donald Ervin","year":"1998","unstructured":"Donald Ervin Knuth . The art of computer programming: sorting and searching , volume 2 , Seminumerical Algorithms. Pearson Education , 1998 . Donald Ervin Knuth. The art of computer programming: sorting and searching, volume 2, Seminumerical Algorithms. Pearson Education, 1998."},{"key":"e_1_3_2_1_15_1","first-page":"37","volume-title":"ICGA","author":"Koza John R.","year":"1991","unstructured":"John R. Koza . Evolving a computer program to generate random numbers using the genetic programming paradigm . In ICGA , pages 37 -- 44 . 1991 . John R. Koza. Evolving a computer program to generate random numbers using the genetic programming paradigm. In ICGA, pages 37--44. 1991."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_86"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_3_2_1_18_1","volume-title":"A field guide to genetic programming. Published viatexttthttp:\/\/lulu.com and freely available attexttthttp:\/\/www.gp-field-guide.org.uk","author":"Poli Riccardo","year":"2008","unstructured":"Riccardo Poli , William B. Langdon , and Nicholas Freitag McPhee . A field guide to genetic programming. Published viatexttthttp:\/\/lulu.com and freely available attexttthttp:\/\/www.gp-field-guide.org.uk , 2008 . (With contributions by J. R. Koza) . Riccardo Poli, William B. Langdon, and Nicholas Freitag McPhee. A field guide to genetic programming. Published viatexttthttp:\/\/lulu.com and freely available attexttthttp:\/\/www.gp-field-guide.org.uk, 2008. (With contributions by J. R. Koza)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/0161-117791832760"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/584091.584093"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.3597793"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(86)90028-X"}],"event":{"name":"GECCO '15: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Madrid Spain","acronym":"GECCO '15"},"container-title":["Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2739480.2754820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:20Z","timestamp":1750223240000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739480.2754820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":22,"alternative-id":["10.1145\/2739480.2754820","10.1145\/2739480"],"URL":"https:\/\/doi.org\/10.1145\/2739480.2754820","relation":{},"subject":[],"published":{"date-parts":[[2015,7,11]]},"assertion":[{"value":"2015-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}