{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:34:16Z","timestamp":1743129256369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_17","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"283-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Predictions and Algorithmic Statistics for\u00a0Infinite Sequences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4609-7851","authenticated-orcid":false,"given":"Alexey","family":"Milovanov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"6","key":"17_CR1","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 Tran. Inf. Theory 47(6), 2443\u20132463 (2001)","journal-title":"IEEE Tran. Inf. Theory"},{"issue":"11","key":"17_CR2","doi-asserted-by":"publisher","first-page":"3780","DOI":"10.1109\/TIT.2005.856956","volume":"51","author":"M Hutter","year":"2005","unstructured":"Hutter, M., Poland, J.: Asymptotics of discrete MDL for online prediction. IEEE Trans. Inf. Theory 51(11), 3780\u20133795 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR3","unstructured":"Hutter, M.: Discrete MDL predicts in total variation. Adv. Neural Inf. Process. Syst. 22 (NIPS-2009), 817\u2013825 (2009)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jcss.2005.07.001","volume":"72","author":"M Hutter","year":"2006","unstructured":"Hutter, M.: Sequential predictions based on algorithmic complexity. J. Comput. Syst. Sci. 72, 95\u2013117 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR5","series-title":"LNCS (LNAI)","first-page":"234","volume-title":"ALT 2004","author":"M Hutter","year":"2004","unstructured":"Hutter, M., Muchnik, A.: Universal convergence of semimeasures on individual random sequences. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol. 3244, pp. 234\u2013248. Springer, Heidelberg (2004)"},{"key":"17_CR6","unstructured":"Li M., Vit\u00e1nyi P., An Introduction to Kolmogorov complexity and its applications, 3rd ed., Springer, (1 ed., 1993; 2 ed., 1997), xxiii+790 (2008). ISBN 978-0-387-49820-1"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-38236-9_20","volume-title":"Theory and Applications of Models of Computation","author":"T Lattimore","year":"2013","unstructured":"Lattimore, T., Hutter, M.: On Martin-L\u00f6f convergence of Solomonoff\u2019s mixture. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 212\u2013223. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38236-9_20"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Shen, A., Uspensky, V., Vereshchagin, N.: Kolmogorov Complexity and Algorithmic Randomness. ACM (2017)","DOI":"10.1090\/surv\/220"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference: parts 1 and 2. Inf. Control 7, 1\u201322, 224\u2013254 (1964)","DOI":"10.1016\/S0019-9958(64)90131-7"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: Complexity-based induction systems: comparisons and convergence theorems. IEEE Trans. Inf. Theory, IT-24, 422\u2013432 (1978)","DOI":"10.1109\/TIT.1978.1055913"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-319-50062-1_41","volume-title":"Computability and Complexity","author":"N Vereshchagin","year":"2017","unstructured":"Vereshchagin, N., Shen, A.: Algorithmic statistics: forty years later. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 669\u2013737. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50062-1_41"},{"issue":"6","key":"17_CR12","first-page":"1298","volume":"294","author":"VG Vovk","year":"1987","unstructured":"Vovk, V.G.: On a criterion for randomness. Dokl. Akad. Nauk SSSR 294(6), 1298\u20131302 (1987)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:21:42Z","timestamp":1623972102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}