{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:29Z","timestamp":1773376649249,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206619","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2039-2044","source":"Crossref","is-referenced-by-count":1,"title":["On Extremal Rates of Storage over Graphs"],"prefix":"10.1109","author":[{"given":"Zhou","family":"Li","sequence":"first","affiliation":[{"name":"University of North Texas,EE Department"}]},{"given":"Hua","family":"Sun","sequence":"additional","affiliation":[{"name":"University of North Texas,EE Department"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2418289"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2628797"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6"},{"key":"ref14","article-title":"On Extremal Rates of Storage over Graphs","author":"li","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2095490"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/INFCOM.1997.644525","article-title":"Secret sharing in graph-based prohibited structures","volume":"2","author":"sun","year":"1997","journal-title":"Proc INFOCOM"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006923"},{"key":"ref1","article-title":"On Extremal Rates of Secure Storage over Graphs","author":"li","year":"2022"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834819"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517867"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196772"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405315"},{"key":"ref3","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3168282"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276723"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206619.pdf?arnumber=10206619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:18Z","timestamp":1773347238000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206619\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206619","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}