{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:26Z","timestamp":1773378086058,"version":"3.50.1"},"reference-count":16,"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.9834794","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2385-2390","source":"Crossref","is-referenced-by-count":3,"title":["Balanced and Swap-Robust Trades for Dynamical Distributed Storage"],"prefix":"10.1109","author":[{"given":"Chao","family":"Pan","sequence":"first","affiliation":[{"name":"University of Illinois,ECE Department"}]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[{"name":"University of California-San Diego,Calit2"}]},{"given":"Xujun","family":"Liu","sequence":"additional","affiliation":[{"name":"Xi&#x2019;an Jiaotong-Liverpool University,Foundational Mathematics Department"}]},{"given":"Charles","family":"Colbourn","sequence":"additional","affiliation":[{"name":"School of CAI Arizona State University"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[{"name":"University of Illinois,ECE Department"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(86)90131-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140518"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191135"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006285"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2442231"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-0007-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836125"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00786-z"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/17M1143964"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-021-00925-0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref2","article-title":"Kirkman systems that attain the upper bound on the minimum block sum, for access balancing in distributed storage","author":"brummond","year":"2019"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3054385"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6654-0_9"}],"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\/09834794.pdf?arnumber=9834794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:13Z","timestamp":1773347773000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834794\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834794","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}