{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:41:34Z","timestamp":1725604894279},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513591","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"1383-1387","source":"Crossref","is-referenced-by-count":3,"title":["Prequential plug-in codes that achieve optimal redundancy rates even if the model is wrong"],"prefix":"10.1109","author":[{"given":"Peter","family":"Grunwald","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Kotlowski","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmp.2005.11.008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348511"},{"journal-title":"Information and Exponential Families in Statistical Theory","year":"1978","author":"barndorff-nielsen","key":"ref12"},{"key":"ref13","article-title":"Robustly minimax codes for universal data compression","author":"takeuchi","year":"1998","journal-title":"Proceedings of the Twenty-First Symposium on Information Theory and Its Applications (SITA '98)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350051"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205929"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/imamci\/3.2-3.211"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2981683"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.887882"},{"key":"ref5","article-title":"Order estimation of stationary gaussian ARMA processes using Rissanen's complexity","author":"gerensce'r","year":"1987","journal-title":"Tech Rep"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523439"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.720554"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056936"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","author":"gr\u00fcnwald","year":"2007","journal-title":"The Minimum Description Length Principle"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_44"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513591.pdf?arnumber=5513591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:39:29Z","timestamp":1559446769000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513591","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}