{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:13:30Z","timestamp":1781259210982,"version":"3.54.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5768,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0304-3975(97)00019-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"159-175","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["Learning nested differences in the presence of malicious noise"],"prefix":"10.1016","volume":"185","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(97)00019-4_BIB1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1022821128753","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0166-218X(93)90126-9","article-title":"A result of Vapnik with applications","volume":"47","author":"Anthony","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00019-4_BIB3","series-title":"Proc. 8th Ann. Conf. on Comput. Learning Theory, ACM Press","first-page":"437","article-title":"Specification and simulation of statistical query algorithms for efficiency and noise tolerance","author":"Aslam","year":"1995"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB4","series-title":"Proc. 6th Ann. ACM Conf. on Computational Learning Theory, ACM Press","first-page":"253","article-title":"On-line learning of rectangles in noisy environments","author":"Auer","year":"1993"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB5","series-title":"Algorithmic Learnung Theory, AII'94, ALT'94","first-page":"229","article-title":"On-line learning with malicious noise and the closure algorithm","volume":"Vol. 872","author":"Auer","year":"1994"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB6","series-title":"Proc. 6th Ann. Workshop on Comput. Learning Theory, ACM Press","first-page":"262","article-title":"Statistical queries and faulty PAC oracles","author":"Decatur","year":"1993"},{"issue":"2","key":"10.1016\/S0304-3975(97)00019-4_BIB7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1006\/inco.1994.1097","article-title":"Predicting 0,1 functions on randomly drawn points","volume":"115","author":"Haussler","year":"1994","journal-title":"Inform. and Comput."},{"issue":"2","key":"10.1016\/S0304-3975(97)00019-4_BIB8_1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1022696716689","article-title":"Learning nested differences of intersection closed concept classes","volume":"5","author":"Helmbold","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB8_2","series-title":"2nd COLT Conf.","author":"Helmbold","year":"1989"},{"issue":"2","key":"10.1016\/S0304-3975(97)00019-4_BIB9","first-page":"240","article-title":"Learning integer lattices","volume":"21","author":"Helmbold","year":"1992","journal-title":"S1AM J. Comput."},{"key":"10.1016\/S0304-3975(97)00019-4_BIB10","series-title":"Proc. 25th Ann. ACM Symp. Theory Comput., ACM Press","first-page":"392","article-title":"Efficient noise-tolerant learning from statistical queries","author":"Kearns","year":"1993"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB11","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/0222052","article-title":"Learning in the presence of malicious errors","volume":"22","author":"Kearns","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00019-4_BIB12","series-title":"Introduction to Finite Fields and their Applications","author":"Lidl","year":"1994"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","article-title":"Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB14","series-title":"Machine Learning: A Theoretical Approach","author":"Natarajan","year":"1991"},{"issue":"11","key":"10.1016\/S0304-3975(97)00019-4_BIB15","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(97)00019-4_BIB16","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000194?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000194?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:18Z","timestamp":1759625478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0304397597000194"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00019-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Learning nested differences in the presence of malicious noise","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(97)00019-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}