{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:47Z","timestamp":1773377447360,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849372","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1687-1691","source":"Crossref","is-referenced-by-count":6,"title":["Entropy Bounds for Grammar-Based Tree Compressors"],"prefix":"10.1109","author":[{"given":"Danny","family":"Hucke","sequence":"first","affiliation":[{"name":"Universität Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[{"name":"Universität Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louisa Seelbach","family":"Benkner","sequence":"additional","affiliation":[{"name":"Universität Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006830"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849372"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.09.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.841160"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21500-6_3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2008.79"},{"key":"ref16","article-title":"RePair and all irreducible grammars are upper bounded by high-order empirical entropy","author":"ochoa","year":"2018","journal-title":"IEEE Trans Inf Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2295392"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.04.008"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1613676.1613680"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3278158"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.12.007"},{"key":"ref8","article-title":"Using statistical encoding to achieve tree succinctness never seen before","volume":"abs 1807 6359","author":"ganczorz","year":"2018","journal-title":"CoRR"},{"key":"ref7","article-title":"Entropy bounds for grammar compression","volume":"abs 1804 8547","author":"ganczorz","year":"2018","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850116"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198516"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849372.pdf?arnumber=8849372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:42Z","timestamp":1773347622000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849372\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849372","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}