{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:53:15Z","timestamp":1732031595510},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9116,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1988,8]]},"DOI":"10.1016\/0095-8956(88)90051-2","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"13-24","source":"Crossref","is-referenced-by-count":14,"title":["On the snake in the box problem"],"prefix":"10.1016","volume":"45","author":[{"given":"H.L","family":"Abbott","sequence":"first","affiliation":[]},{"given":"M","family":"Katchalski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(88)90051-2_BIB1","series-title":"Proceedings, 4th South-Eastern Conference on Combinatorics, Graph Theory and Computing","first-page":"111","article-title":"Long snakes and a characterization of maximal snakes in the d-cube","volume":"8","author":"Adelson","year":"1973"},{"key":"10.1016\/0095-8956(88)90051-2_BIB2","series-title":"Proceedings, 4th South-Eastern Conference on Combinatorics, Graph Theory and Computing","first-page":"135","article-title":"Computation of d-dimensional snakes","volume":"8","author":"Adelson","year":"1973"},{"key":"10.1016\/0095-8956(88)90051-2_BIB3","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0021-9800(67)80026-7","article-title":"Lengths of snakes in boxes","volume":"2","author":"Danzer","year":"1976","journal-title":"J. Combin. Theory"},{"issue":"2","key":"10.1016\/0095-8956(88)90051-2_BIB4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579373","article-title":"A new upper bound for the length of snakes","volume":"5","author":"Deimer","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(88)90051-2_BIB5","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/S0021-9800(69)80013-X","article-title":"Upper bounds on the lengths of circuits of even spread in the d-cube","volume":"7","author":"Douglas","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0095-8956(88)90051-2_BIB6","first-page":"309","article-title":"Maximal length of a circuit in a unitary n-dimensional cube","volume":"6","author":"Evdokimov","year":"1969","journal-title":"Mat. Zametki"},{"issue":"No. 3","key":"10.1016\/0095-8956(88)90051-2_BIB7","first-page":"900","article-title":"Circuit codes with arbitrary distance","volume":"17","author":"Evdokimov","year":"1976","journal-title":"Sov. Math. Dokl."},{"issue":"No. 17","key":"10.1016\/0095-8956(88)90051-2_BIB8","first-page":"9","author":"Glagolev","year":"1970","journal-title":"Diskret. Anal."},{"key":"10.1016\/0095-8956(88)90051-2_BIB9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/PGEC.1963.263388","article-title":"Snake in the box codes","volume":"EC-12","author":"Even","year":"1963","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/0095-8956(88)90051-2_BIB10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TEC.1958.5222529","article-title":"Unit distance error checking codes","volume":"EC-7","author":"Kautz","year":"1958","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/0095-8956(88)90051-2_BIB11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.2307\/2316860","article-title":"What is the maximum length of a d-dimensional snake?","volume":"77","author":"Klee","year":"1970","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0095-8956(88)90051-2_BIB12","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/321406.321414","article-title":"A method for constructing circuit codes","volume":"14","author":"Klee","year":"1968","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900512?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900512?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:54:05Z","timestamp":1548777245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895688900512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0095895688900512"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(88)90051-2","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1988,8]]}}}