{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:16:44Z","timestamp":1693869404277},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0097-8493(02)00094-8","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"519-524","source":"Crossref","is-referenced-by-count":4,"title":["A stochastic cellular automaton for three-coloring penrose tiles"],"prefix":"10.1016","volume":"26","author":[{"given":"Mark","family":"McClure","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0097-8493(02)00094-8_BIB1","series-title":"Penrose tiles to trapdoor ciphers","author":"Gardner","year":"1989"},{"key":"10.1016\/S0097-8493(02)00094-8_BIB2","series-title":"Tilings and patterns","author":"Gr\u00fcnbaum","year":"1987"},{"key":"10.1016\/S0097-8493(02)00094-8_BIB3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.2307\/2589317","article-title":"Rhombic Penrose tilings can be 3-colored","volume":"107","author":"Sibley","year":"2000","journal-title":"The American Mathematical Monthly"},{"key":"10.1016\/S0097-8493(02)00094-8_BIB4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0012-365X(00)00266-1","article-title":"3-colourability of Penrose kite-and-dart tilings","volume":"235","author":"Babilon","year":"2000","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0097-8493(02)00094-8_BIB5","series-title":"Mathematica in action","author":"Wagon","year":"1999"},{"key":"10.1016\/S0097-8493(02)00094-8_BIB6","unstructured":"McClure M. Digraph self-similar sets and aperiodic tilings. The Mathematical Intelligencer, submitted for publication."}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302000948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302000948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:25:41Z","timestamp":1554967541000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849302000948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0097849302000948"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(02)00094-8","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}