{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:26Z","timestamp":1752192086073,"version":"3.41.2"},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1979,3,1]],"date-time":"1979-03-01T00:00:00Z","timestamp":289094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1979,3,1]],"date-time":"1979-03-01T00:00:00Z","timestamp":289094400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1979,3,1]],"date-time":"1979-03-01T00:00:00Z","timestamp":289094400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1979,3]]},"DOI":"10.1109\/tit.1979.1056031","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"193-202","source":"Crossref","is-referenced-by-count":7,"title":["Bounds on memory versus error trade-offs in question-answering systems"],"prefix":"10.1109","volume":"25","author":[{"given":"A.","family":"Crolotte","sequence":"first","affiliation":[]},{"given":"J.","family":"Pearl","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Rate Distortion Theory","year":"1971","author":"berger","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054363"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055982"},{"journal-title":"Bounds on memory versus error tradeoffs in question-answering systems","year":"1977","author":"crolotte","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683269"},{"key":"ref3","first-page":"652","article-title":"State complexity of imprecise causal models","author":"pearl","year":"1976","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(76)90025-X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1975.4309400"},{"journal-title":"Algebraic Coding Theory","year":"1968","author":"berlekamp","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674717"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055603"},{"journal-title":"The probabilistic analysis of some combinatorial search algorithms","year":"1976","author":"karp","key":"ref1"},{"journal-title":"Error-bounds for inferential question-answering systems with limited memory","year":"1974","author":"pearl","key":"ref9"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22707\/01056031.pdf?arnumber=1056031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:17:30Z","timestamp":1752103050000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,3]]},"references-count":13,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1979.1056031","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1979,3]]}}}