{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:43:24Z","timestamp":1749721404428},"reference-count":9,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":["Neurocomputing"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0925-2312(02)00610-0","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T21:02:29Z","timestamp":1034370149000},"page":"1053-1056","source":"Crossref","is-referenced-by-count":7,"title":["N-bit parity ordered neural networks"],"prefix":"10.1016","volume":"48","author":[{"given":"M.Z","family":"Arslanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.U","family":"Ashigaliev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.E","family":"Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-2312(02)00610-0_BIB1","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0893-6080(05)80101-7","article-title":"N-bit parity networks","volume":"6","author":"Brown","year":"1993","journal-title":"Neural Networks"},{"key":"10.1016\/S0925-2312(02)00610-0_BIB2","series-title":"Threshold Logic","author":"Dertouzos","year":"1969"},{"issue":"9","key":"10.1016\/S0925-2312(02)00610-0_BIB3","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1016\/S0893-6080(99)00069-6","article-title":"Solving the N-bit parity problem using neural networks","volume":"12","author":"Hohil","year":"1999","journal-title":"Neural Networks"},{"key":"10.1016\/S0925-2312(02)00610-0_BIB4","unstructured":"M.E. Hohil, D. Liu, S.H. Smith, N-bit parity neural networks: a simple solution, Proceedings of the 32nd Annual Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, 1998, pp. 695\u2013700."},{"issue":"6","key":"10.1016\/S0925-2312(02)00610-0_BIB5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/S0893-6080(00)00038-1","article-title":"On the exact solution of the parity-N problem using ordered neural networks","volume":"13","author":"Lavretsky","year":"2000","journal-title":"Neural Networks"},{"key":"10.1016\/S0925-2312(02)00610-0_BIB6","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/S0893-6080(05)80114-5","article-title":"Parity with two layer feedforward nets","volume":"6","author":"Minor","year":"1993","journal-title":"Neural Networks"},{"issue":"3","key":"10.1016\/S0925-2312(02)00610-0_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0925-2312(97)00030-1","article-title":"On the solution of the parity problem by a single hidden layer feedforward neural network","volume":"16","author":"Setiono","year":"1997","journal-title":"Neurocomputing"},{"key":"10.1016\/S0925-2312(02)00610-0_BIB8","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/S0893-6080(05)80103-0","article-title":"N-bit parity networks","volume":"6","author":"Stork","year":"1993","journal-title":"Neural Networks"},{"key":"10.1016\/S0925-2312(02)00610-0_BIB9","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1016\/S0893-6080(05)80088-7","article-title":"How to solve the N-bit parity problem with two hidden units","volume":"5","author":"Stork","year":"1992","journal-title":"Neural Networks"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231202006100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231202006100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T12:54:49Z","timestamp":1554987289000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231202006100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":9,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0925231202006100"],"URL":"https:\/\/doi.org\/10.1016\/s0925-2312(02)00610-0","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}