{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:15:51Z","timestamp":1772846151656,"version":"3.50.1"},"reference-count":11,"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(01)00612-9","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T12:53:47Z","timestamp":1034168027000},"page":"477-488","source":"Crossref","is-referenced-by-count":21,"title":["N-bit parity neural networks: new solutions based on linear programming"],"prefix":"10.1016","volume":"48","author":[{"given":"Derong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myron E.","family":"Hohil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley H.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-2312(01)00612-9_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(01)00612-9_BIB2","unstructured":"S.E. Fahlman, An Empirical Study of Learning Speed in Back-Propagation Networks, Technical Report CMU-CS-88-162, Department of Computer Science, Carnegie Mellon University, September 1988."},{"key":"10.1016\/S0925-2312(01)00612-9_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(01)00612-9_BIB4","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(01)00612-9_BIB5","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\/S0925-2312(01)00612-9_BIB6","series-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"10.1016\/S0925-2312(01)00612-9_BIB7","doi-asserted-by":"crossref","unstructured":"D.E. Rumelhart, G.E. Hinton, R.J. Williams, Learning internal representations by error propagation, in: D.E. Rumelhart, J.L. McClelland, the PDP Research Group (Eds.), Parallel Distributed Processing, Vol. 1, The MIT Press, Cambridge, MA, 1986 (Chapter 8).","DOI":"10.21236\/ADA164453"},{"key":"10.1016\/S0925-2312(01)00612-9_BIB8","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":"Neurocomput."},{"key":"10.1016\/S0925-2312(01)00612-9_BIB9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0022-0000(92)90039-L","article-title":"Feedforward nets for interpolation and classification","volume":"45","author":"Sontag","year":"1992","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0925-2312(01)00612-9_BIB10","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\/S0925-2312(01)00612-9_BIB11","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/S0893-6080(05)80103-0","article-title":"N-bit parity networks: a reply to Brown and Korn","volume":"6","author":"Stork","year":"1993","journal-title":"Neural Networks"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231201006129?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231201006129?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T03:50:58Z","timestamp":1583553058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231201006129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":11,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0925231201006129"],"URL":"https:\/\/doi.org\/10.1016\/s0925-2312(01)00612-9","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}