{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:34Z","timestamp":1750308034550,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"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":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144219","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"1409-1410","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The snake in the box problem"],"prefix":"10.1145","author":[{"given":"Pedro A.","family":"Diaz-Gomez","sequence":"first","affiliation":[{"name":"University of Oklahoma, OK"}]},{"given":"Dean F.","family":"Hougen","sequence":"additional","affiliation":[{"name":"University of Oklahoma, OK"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"264","volume-title":"Proceedings of Florida Artificial Intelligence Research Society Conference","author":"Casella D. A.","unstructured":"D. A. Casella and W. D. Potter . New lower bounds for the snake--in--the--box problem: Using evolutionary techniques to hunt for snakes . In Proceedings of Florida Artificial Intelligence Research Society Conference , pages 264 -- 269 . D. A. Casella and W. D. Potter. New lower bounds for the snake--in--the--box problem: Using evolutionary techniques to hunt for snakes. In Proceedings of Florida Artificial Intelligence Research Society Conference, pages 264--269."},{"key":"e_1_3_2_1_2_1","first-page":"421","volume-title":"Proceedings of the Industrial and Engineering Applications of Artificial Intelligence and Expert Systems","author":"Potter W. D.","year":"1994","unstructured":"W. D. Potter , R. W. Robinson , J. A. Miller , K. Kochut , and D. Z. Redys . Using the genetic algorithm to find snake-in-the-box codes . In Proceedings of the Industrial and Engineering Applications of Artificial Intelligence and Expert Systems , pages 421 -- 426 , 1994 . W. D. Potter, R. W. Robinson, J. A. Miller, K. Kochut, and D. Z. Redys. Using the genetic algorithm to find snake-in-the-box codes. In Proceedings of the Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, pages 421--426, 1994."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the Annual Australian Conference on Combinatorial Mathematics and Combinatorial Computing","author":"Rajan D.","year":"1999","unstructured":"D. Rajan and A. Shende . Maximal and reversible snakes in hypercubes . In Proceedings of the Annual Australian Conference on Combinatorial Mathematics and Combinatorial Computing , 1999 . D. Rajan and A. Shende. Maximal and reversible snakes in hypercubes. In Proceedings of the Annual Australian Conference on Combinatorial Mathematics and Combinatorial Computing, 1999."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90039-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"E. W. Weisstein. Snake. MathWorld--A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Snake.html accessed January 31 2006.  E. W. Weisstein. Snake. MathWorld--A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Snake.html accessed January 31 2006.","DOI":"10.3888\/tmj.10.3-3"}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144219","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:11Z","timestamp":1750259651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144219"}},"subtitle":["mathematical conjecture and a genetic algorithm approach"],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":5,"alternative-id":["10.1145\/1143997.1144219","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144219","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}