{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:56Z","timestamp":1760202656612},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_50","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"424-433","source":"Crossref","is-referenced-by-count":4,"title":["On Algorithmic Strong Sufficient Statistics"],"prefix":"10.1007","author":[{"given":"Nikolay","family":"Vereshchagin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Bauwens, B., Makhlin, A., Vereshchagin, N., Zimand, M.: Short lists with short programs in short time. ECCC report TR13-007, \n                  \n                    http:\/\/eccc.hpi-web.de\/report\/2013\/007\/","DOI":"10.1109\/CCC.2013.19"},{"issue":"6","key":"50_CR2","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1109\/18.945257","volume":"47","author":"P. G\u00e1cs","year":"2001","unstructured":"G\u00e1cs, P., Tromp, J., Vit\u00e1nyi, P.M.B.: Algorithmic statistics. IEEE Trans. Inform. Th.\u00a047(6), 2443\u20132463 (2001)","journal-title":"IEEE Trans. Inform. Th."},{"key":"50_CR3","unstructured":"Kolmogorov, A.N.: Talk at the Information Theory Symposium in Tallinn, Estonia (1974)"},{"key":"50_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)","edition":"2"},{"issue":"4","key":"50_CR5","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1093\/comjnl\/42.4.340","volume":"42","author":"A. Kh","year":"1999","unstructured":"Kh, A.: Shen, Discussion on Kolmogorov complexity and statistical analysis. The Computer Journal\u00a042(4), 340\u2013342 (1999)","journal-title":"The Computer Journal"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-642-30870-3_66","volume-title":"How the World Computes","author":"A. Shen","year":"2012","unstructured":"Shen, A.: Game Arguments in Computability Theory and Algorithmic Information Theory. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol.\u00a07318, pp. 655\u2013666. Springer, Heidelberg (2012)"},{"issue":"12","key":"50_CR7","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2004.838346","volume":"50","author":"N.K. Vereshchagin","year":"2004","unstructured":"Vereshchagin, N.K., Vit\u00e1nyi, P.M.B.: Kolmogorov\u2019s structure functions and model selection. IEEE Trans. Information Theory\u00a050(12), 3265\u20133290 (2004)","journal-title":"IEEE Trans. Information Theory"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-03073-4_49","volume-title":"Mathematical Theory and Computational Practice","author":"N. Vereshchagin","year":"2009","unstructured":"Vereshchagin, N.: Algorithmic Minimal Sufficient Statistic Revisited. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol.\u00a05635, pp. 478\u2013487. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:47:47Z","timestamp":1557780467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}