{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T17:28:25Z","timestamp":1782322105017,"version":"3.54.5"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2127742"],"award-info":[{"award-number":["2127742"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1109\/tit.2023.3298401","type":"journal-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T17:42:07Z","timestamp":1690220527000},"page":"6981-6988","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Locally Recoverable Codes With Hierarchy From Nested <i>F<\/i>-Adic Expansions"],"prefix":"10.1109","volume":"69","author":[{"given":"Austin","family":"Dukes","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of South Florida, Tampa, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5265-5207","authenticated-orcid":false,"given":"Giacomo","family":"Micheli","sequence":"additional","affiliation":[{"name":"Department of Mathematics and the Center for Cryptographic Research, University of South Florida, Tampa, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8725-5473","authenticated-orcid":false,"given":"Vincenzo","family":"Pallozzi Lavorante","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of South Florida, Tampa, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2919830"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63931-4_4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282656"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2995852"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713245"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref12","first-page":"45","article-title":"Locally repairable codes with availability and hierarchy: Matroid theory via examples","volume-title":"Proc. Int. Zurich Seminar Commun.","author":"Freij-Hollanti"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977636"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2939464"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10288603\/10192435-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10288603\/10192435.pdf?arnumber=10192435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T15:34:46Z","timestamp":1709307286000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10192435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":16,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3298401","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}