{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T12:28:52Z","timestamp":1661862532507},"reference-count":4,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995,1]]},"DOI":"10.1016\/0893-6080(95)00040-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:40:00Z","timestamp":1027608000000},"page":"901-904","source":"Crossref","is-referenced-by-count":2,"title":["Sinusoidal and monotonic transfer functions: Implications for VC dimension"],"prefix":"10.1016","volume":"8","author":[{"given":"R.J.","family":"Gaynier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Downs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0893-6080(95)00040-7_BIB1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1162\/neco.1990.2.4.405","article-title":"Guaranteed learning algorithm for networks with units having periodic threshold output functions","volume":"2","author":"Brady","year":"1990","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(95)00040-7_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","article-title":"A general lower bound on the number of examples needed for learning","volume":"82","author":"Ehrenfeucht","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/0893-6080(95)00040-7_BIB3","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\/0893-6080(95)00040-7_BIB4","article-title":"The MONK's problems, a performance comparison of different learning algorithms","author":"Thrun","year":"1991","journal-title":"Carnegie Mellon University CMU-CS-91-197"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608095000407?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608095000407?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T03:54:21Z","timestamp":1556423661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0893608095000407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":4,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0893608095000407"],"URL":"https:\/\/doi.org\/10.1016\/0893-6080(95)00040-7","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}