{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:43:14Z","timestamp":1749721394137},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":["Neural Networks"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0893-6080(00)00038-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:12:37Z","timestamp":1027606357000},"page":"643-649","source":"Crossref","is-referenced-by-count":12,"title":["On the exact solution of the Parity-N problem using ordered neural networks"],"prefix":"10.1016","volume":"13","author":[{"given":"E.","family":"Lavretsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-6080(00)00038-1_BIB1","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/18.256500","article-title":"Universal approximation bounds for superpositions of a sigmoidal function","volume":"39","author":"Barron","year":"1993","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S0893-6080(00)00038-1_BIB2","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\/S0893-6080(00)00038-1_BIB3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02551274","article-title":"Approximation by superpositions of a sigmoidal function","volume":"2","author":"Cybenko","year":"1989","journal-title":"Mathematical Contributions, Signals and Systems"},{"key":"10.1016\/S0893-6080(00)00038-1_BIB4","unstructured":"Hecht-Nielsen, R. (1989). Kolmogorov's mapping neural network existence theorem. In: Proceedings of the International Joint Conference in Neural Networks, vol. 3 (pp. 11\u201314) Washington, DC: IEEE."},{"key":"10.1016\/S0893-6080(00)00038-1_BIB5","series-title":"Introduction to the theory of neural computation","author":"Hertz","year":"1991"},{"key":"10.1016\/S0893-6080(00)00038-1_BIB6","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\/S0893-6080(00)00038-1_BIB7","unstructured":"Lavretsky, E. (1999). Ordered neural networks: formulation, development, design and application. In: Proceedings of the 37th Aerospace Sciences Meeting & Exhibit, AIAA Paper 99-0106, January, Reno, NV."},{"key":"10.1016\/S0893-6080(00)00038-1_BIB8","unstructured":"Lavretsky, E. (2000). Neural networks for function approximation and control system design. PhD Thesis, Claremont Graduate University, Department of Mathematics. Claremont, CA."},{"key":"10.1016\/S0893-6080(00)00038-1_BIB9","first-page":"127","article-title":"A logical calculus of the ideas immanent in nervous activity","volume":"9","author":"McCulloch","year":"1943","journal-title":"Bulletin of Mathematical Biophysics"},{"key":"10.1016\/S0893-6080(00)00038-1_BIB10","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"},{"key":"10.1016\/S0893-6080(00)00038-1_BIB11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0893-6080(97)00097-X","article-title":"Universal approximation using feedforward neural networks: a survey of some existing methods and some new results","volume":"11","author":"Scarselli","year":"1998","journal-title":"Neural Networks"},{"key":"10.1016\/S0893-6080(00)00038-1_BIB12","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"},{"key":"10.1016\/S0893-6080(00)00038-1_BIB13","unstructured":"Werbos, P. J. (1974). Beyond regression: new tools for prediction and analysis in the behavior sciences. PhD Thesis, Harvard University, Committee on Applied Mathematics."}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608000000381?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608000000381?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:23:11Z","timestamp":1556464991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608000000381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0893608000000381"],"URL":"https:\/\/doi.org\/10.1016\/s0893-6080(00)00038-1","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}