{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T19:58:28Z","timestamp":1792699108887,"version":"4.5.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T00:00:00Z","timestamp":1691366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T00:00:00Z","timestamp":1691366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071206"],"award-info":[{"award-number":["12071206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12131011"],"award-info":[{"award-number":["12131011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12150710510"],"award-info":[{"award-number":["12150710510"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10623-023-01278-6","type":"journal-article","created":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T16:01:58Z","timestamp":1691424118000},"page":"3901-3913","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Construction of storage codes of rate approaching one on triangle-free graphs"],"prefix":"10.1007","volume":"91","author":[{"given":"Hexiang","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,7]]},"reference":[{"key":"1278_CR1","unstructured":"Barg, A., Schwartz, M., Yohananov, L.: Storage codes on triangle-free graphs with asymptotically unit rate. (2022) arXiv:2212.12117v1"},{"issue":"12","key":"1278_CR2","doi-asserted-by":"publisher","first-page":"7787","DOI":"10.1109\/TIT.2022.3191309","volume":"68","author":"A Barg","year":"2021","unstructured":"Barg A., Z\u00e9mor G.: High-rate storage codes on triangle-free graphs. IEEE Trans. Inf. Theory 68(12), 7787\u20137797 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1278_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01072842","volume":"3","author":"S Berman","year":"1967","unstructured":"Berman S.: On the theory of group codes. Cybernetics 3, 25\u201331 (1967).","journal-title":"Cybernetics"},{"issue":"1","key":"1278_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.37236\/5485","volume":"23","author":"PJ Cameron","year":"2016","unstructured":"Cameron P.J., Dang A.N., Riis S.: Guessing games on triangle-free graphs. Electron. J. Comb. 23(1), 15 (2016).","journal-title":"Electron. J. Comb."},{"key":"1278_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.37236\/679","volume":"18","author":"D Christofides","year":"2011","unstructured":"Christofides D., Markstr\u00f6m K.: The guessing number of undirected graphs. Electron. J. Comb. 18, 192 (2011).","journal-title":"Electron. J. Comb."},{"issue":"11","key":"1278_CR6","doi-asserted-by":"publisher","first-page":"5810","DOI":"10.1109\/TIT.2015.2472521","volume":"61","author":"A Mazumdar","year":"2015","unstructured":"Mazumdar A.: Storage capacity of repairable networks. IEEE Trans. Inform. Theory 61(11), 5810\u20135821 (2015).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"1278_CR7","doi-asserted-by":"publisher","first-page":"5580","DOI":"10.1109\/TIT.2019.2910026","volume":"65","author":"A Mazumdar","year":"2019","unstructured":"Mazumdar A., McGregor A., Vorotnikova S.: Storage capacity as an information theoretic vertex cover and the index coding rate. IEEE Trans. Inform. Theory 65(9), 5580\u20135591 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1278_CR8","doi-asserted-by":"crossref","unstructured":"Shanmugam, K., Dimakis, A. G.: Bounding multiple unicasts through index coding and Locally Repairable Codes. IEEE International Symposium on Information Theory: 296\u2013300. (2014)","DOI":"10.1109\/ISIT.2014.6874842"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01278-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01278-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01278-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T12:04:32Z","timestamp":1699099472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01278-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,7]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1278"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01278-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,7]]},"assertion":[{"value":"30 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}