{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:35Z","timestamp":1740114455716,"version":"3.37.3"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004281","name":"National Science Centre Poland","doi-asserted-by":"publisher","award":["2022\/47\/D\/ST6\/00416"],"award-info":[{"award-number":["2022\/47\/D\/ST6\/00416"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1016\/j.tcs.2024.114923","type":"journal-article","created":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:32:06Z","timestamp":1730269926000},"page":"114923","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["No six-cell neighborhood cellular automaton solves the parity problem"],"prefix":"10.1016","volume":"1021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2746-1061","authenticated-orcid":false,"given":"Anna","family":"Nenca","sequence":"first","affiliation":[]},{"given":"Barbara","family":"Wolnik","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"De Baets","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"17","key":"10.1016\/j.tcs.2024.114923_br0010","doi-asserted-by":"crossref","first-page":"2321","DOI":"10.1063\/1.118851","article-title":"A possible nanometer-scale computing device based on an adding cellular automaton","volume":"70","author":"Benjamin","year":"1997","journal-title":"Appl. Phys. Lett."},{"key":"10.1016\/j.tcs.2024.114923_br0020","first-page":"89","article-title":"Revisiting the edge of chaos: evolving cellular automata to perform computations","volume":"7","author":"Mitchell","year":"1993","journal-title":"Complex Syst."},{"key":"10.1016\/j.tcs.2024.114923_br0030","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/s11047-017-9650-1","article-title":"A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update","volume":"17","author":"Montalva-Medel","year":"2018","journal-title":"Nat. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2024.114923_br0040","doi-asserted-by":"crossref","first-page":"3589","DOI":"10.1103\/PhysRevE.57.3589","article-title":"Computing with cellular automata: three cases for nonuniformity","volume":"57","author":"Sipper","year":"1998","journal-title":"Phys. Rev. E"},{"issue":"3","key":"10.1016\/j.tcs.2024.114923_br0050","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s11047-013-9374-9","article-title":"Solving the parity problem in one-dimensional cellular automata","volume":"12","author":"Betel","year":"2013","journal-title":"Nat. Comput., Int. J."},{"key":"10.1016\/j.tcs.2024.114923_br0060","first-page":"289","article-title":"Very effective evolutionary techniques for searching cellular automata rule spaces","volume":"3","author":"Wolz","year":"2008","journal-title":"J. Cell. Autom."},{"key":"10.1016\/j.tcs.2024.114923_br0070","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","article-title":"Statistical mechanics of cellular automata","volume":"55","author":"Wolfram","year":"1983","journal-title":"Rev. Mod. Phys."},{"key":"10.1016\/j.tcs.2024.114923_br0080","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.64.026702","article-title":"Parity problem with a cellular automaton solution","volume":"64","author":"Lee","year":"2001","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.tcs.2024.114923_br0090","series-title":"15th International Workshop on Cellular Automata and Discrete Complex Systems","first-page":"103","article-title":"Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem","volume":"vol. 252","author":"Martins","year":"2009"},{"issue":"3\u20134","key":"10.1016\/j.tcs.2024.114923_br0100","first-page":"189","article-title":"Solving the parity problem with rule 60 in array size of the power of two","volume":"8","author":"Ninagawa","year":"2013","journal-title":"J. Cell. Autom."},{"key":"10.1016\/j.tcs.2024.114923_br0110","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ins.2019.04.045","article-title":"A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update","volume":"493","author":"Ruivo","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.tcs.2024.114923_br0120","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.ins.2022.10.045","article-title":"Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs","volume":"615","author":"Balbi","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.tcs.2024.114923_br0130","unstructured":"N.A. Fat\u00e8s, An asynchronous cellular system that solves the parity problem, Inria Nancy Grand-Est, hal-03894581, 2022."},{"year":"2014","series-title":"An Introduction to Combinatorial Analysis, Princeton Legacy Library","author":"Riordan","key":"10.1016\/j.tcs.2024.114923_br0140"},{"author":"Sloane","key":"10.1016\/j.tcs.2024.114923_br0150"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2024.114923_br0160","first-page":"1","article-title":"Number-conserving cellular automaton rules","volume":"52","author":"Boccara","year":"2002","journal-title":"Fundam. Inform."},{"issue":"1","key":"10.1016\/j.tcs.2024.114923_br0170","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/S0304-3975(02)00534-0","article-title":"Number-conserving cellular automata I: decidability","volume":"299","author":"Durand","year":"2003","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2024.114923_br0180","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0304-3975(03)00134-8","article-title":"Number conserving cellular automata II: dynamics","volume":"304","author":"Formenti","year":"2003","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2024.114923_br0190","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/S0304-3975(02)00065-8","article-title":"Universality and decidability of number-conserving cellular automata","volume":"292","author":"Moreira","year":"2003","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10.1016\/j.tcs.2024.114923_br0200","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1088\/0951-7715\/15\/6\/305","article-title":"Conservation laws in cellular automata","volume":"15","author":"Pivato","year":"2002","journal-title":"Nonlinearity"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397524005401?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397524005401?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T14:22:06Z","timestamp":1738419726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397524005401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":20,"alternative-id":["S0304397524005401"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2024.114923","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"No six-cell neighborhood cellular automaton solves the parity problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2024.114923","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"114923"}}