{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:21:08Z","timestamp":1772137268329,"version":"3.50.1"},"reference-count":4,"publisher":"Steklov Mathematical Institute","issue":"5","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/iopscience.iop.org\/page\/copyright"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"crossref","award":["14.756.31.0001"],"award-info":[{"award-number":["14.756.31.0001"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["Russ. Math. Surv."],"published-print":{"date-parts":[[2020,10,1]]},"DOI":"10.1070\/rm9961","type":"journal-article","created":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T01:45:47Z","timestamp":1604367947000},"page":"974-977","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Online algorithm for aggregating experts\u2019 predictions with unbounded quadratic loss"],"prefix":"10.4213","volume":"75","author":[{"given":"A. A.","family":"Korotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. V.","family":"V\u2019yugin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. V.","family":"Burnaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2731","reference":[{"key":"RMS_75_5_974bib1","doi-asserted-by":"publisher","author":"Cesa-Bianchi","year":"2006","DOI":"10.1017\/CBO9780511546921"},{"key":"RMS_75_5_974bib2","first-page":"1281","volume":"15","author":"Rooij","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"RMS_75_5_974bib3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"Hazan","year":"2016","journal-title":"Found. Trends Optim."},{"key":"RMS_75_5_974bib4","author":"Korotin","year":"2020 (v1 \u2013 2019)"}],"container-title":["Russian Mathematical Surveys"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1070\/RM9961","content-type":"text\/html","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T11:55:10Z","timestamp":1747050910000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mathnet.ru\/eng\/rm9961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,1]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10,1]]}},"URL":"https:\/\/doi.org\/10.1070\/rm9961","relation":{"is-translation-of":[{"id-type":"doi","id":"10.4213\/rm9961","asserted-by":"subject"},{"id-type":"doi","id":"10.4213\/rm9961","asserted-by":"object"}]},"ISSN":["0036-0279","1468-4829"],"issn-type":[{"value":"0036-0279","type":"print"},{"value":"1468-4829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,1]]},"assertion":[{"value":"Online algorithm for aggregating experts\u2019 predictions with unbounded quadratic loss","name":"article_title","label":"Article Title"},{"value":"Russian Mathematical Surveys","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"\u00a9 Russian Academy of Sciences (DoM), London Mathematical Society, IOP Publishing Limited","name":"copyright_information","label":"Copyright Information"},{"value":"2020-07-10","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}