{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T12:22:08Z","timestamp":1786105328583,"version":"3.56.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/0020-0190(87)90114-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"377-380","source":"Crossref","is-referenced-by-count":698,"title":["Occam's Razor"],"prefix":"10.1016","volume":"24","author":[{"given":"Anselm","family":"Blumer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Ehrenfeucht","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Haussler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(87)90114-1_BIB1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: Theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Comput. Surv."},{"key":"10.1016\/0020-0190(87)90114-1_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(87)90114-1_BIB3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/03081077808960690","article-title":"On the connection between the complexity and credibility of inferred models","volume":"4","author":"Pearl","year":"1978","journal-title":"Internat. J. General Systems"},{"key":"10.1016\/0020-0190(87)90114-1_BIB4","unstructured":"L. Pitt and L.G. Valiant, Computational Limits on Learning from Examples, Tech. Rept., Dept. of Computer Science, Harvard Univ., to appear."},{"issue":"11","key":"10.1016\/0020-0190(87)90114-1_BIB5","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:53:25Z","timestamp":1553579605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["0020019087901141"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90114-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}