{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:35:41Z","timestamp":1774020941031,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834616","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2613-2618","source":"Crossref","is-referenced-by-count":4,"title":["Dual-Code Bounds on Multiple Concurrent (Local) Data Recovery"],"prefix":"10.1109","author":[{"given":"Gianira N.","family":"Alfarano","sequence":"first","affiliation":[{"name":"University of Zurich,Switzerland"}]},{"given":"Alberto","family":"Ravagnani","sequence":"additional","affiliation":[{"name":"Eindhoven UT,Netherlands"}]},{"given":"Emina","family":"Soljanin","sequence":"additional","affiliation":[{"name":"Rutgers University,USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3_16"},{"key":"ref11","article-title":"PIR with low storage overhead: Coding instead of replication","author":"fazeli","year":"2015","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref13","article-title":"Linear locally repairable codes with random matrices","author":"ernvall","year":"2014","journal-title":"CoRR"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/VITAE.2014.6934442"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834616"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174345"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457679"},{"key":"ref6","article-title":"Service capacity region of content access from erasure coded storage","author":"anderson","year":"2018","journal-title":"IEEE Information Theory Workshop (ITW)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174027"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262713"},{"key":"ref2","article-title":"Service rate region: A new aspect of coded distributed system design","author":"aktas","year":"2022","journal-title":"IEEE Trans Inf"},{"key":"ref1","article-title":"Modeling the edge: Peer-to-peer reincarnated","author":"yadgar","year":"2019","journal-title":"2nd USENIX Workshop on Hot Topics in Edge Computing HotEdge 2019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613518"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834616.pdf?arnumber=9834616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:20Z","timestamp":1773347780000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834616\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834616","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}