{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:53Z","timestamp":1740131693062,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"DFG Research","doi-asserted-by":"publisher","award":["LO 748\/10-1"],"award-info":[{"award-number":["LO 748\/10-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1109\/tit.2021.3112676","type":"journal-article","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T20:53:16Z","timestamp":1631652796000},"page":"7596-7615","source":"Crossref","is-referenced-by-count":1,"title":["Entropy Bounds for Grammar-Based Tree Compressors"],"prefix":"10.1109","volume":"67","author":[{"given":"Danny","family":"Hucke","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4680-7198","authenticated-orcid":false,"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3204-3801","authenticated-orcid":false,"given":"Louisa Seelbach","family":"Benkner","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2295392"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2871452"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1613\/jair.374"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2008.79"},{"key":"ref30","first-page":"18:1","article-title":"Compression of unordered XML trees","volume":"68","author":"lohrey","year":"2017","journal-title":"Proc 20th Int Conf Database Theory (ICDT)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2008.01.060"},{"key":"ref35","first-page":"175","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems Inf Transmiss"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.108250"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.04.008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.12.007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3278158"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2919829"},{"key":"ref15","article-title":"Entropy bounds for grammar compression","author":"ganczorz","year":"2018","journal-title":"arXiv 1804 08547"},{"key":"ref16","first-page":"22:1","article-title":"Using statistical encoding to achieve tree succinctness never seen before","volume":"154","author":"ganczorz","year":"2020","journal-title":"Proc 37th Int Symp Theor Aspects Comput Sci (STACS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-019-09942-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198516"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849372"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21500-6_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.01.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2012-0016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.12.012"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.06.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.69"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.995542"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826664"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1613676.1613680"},{"article-title":"On Shannon’s inequality, optimal coding, and characterizations of Shannon’s and Renyi’s entropies","year":"1973","author":"acz\u00e9l","key":"ref1"},{"key":"ref20","first-page":"232","article-title":"A comparison of empirical tree entropies","volume":"12303","author":"hucke","year":"2020","journal-title":"Proc 27th Int Symp String Process Inf Retr (SPIRE)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.841160"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.09.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.850665"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1999.755679"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9579483\/09537799.pdf?arnumber=9537799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:19Z","timestamp":1652194459000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9537799\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":39,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3112676","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,11]]}}}