{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:46Z","timestamp":1773376606485,"version":"3.50.1"},"reference-count":10,"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"}],"funder":[{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206575","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1342-1347","source":"Crossref","is-referenced-by-count":1,"title":["PIR array codes: the optimality of Blackburn-Etzion construction"],"prefix":"10.1109","author":[{"given":"Chen","family":"Wang","sequence":"first","affiliation":[{"name":"Shandong University,Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education, School of Cyber Science and Technology,Qingdao,China,266237"}]},{"given":"Yiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shandong University,Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education, School of Cyber Science and Technology,Qingdao,China,266237"}]}],"member":"263","reference":[{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849373"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006508"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3124925"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007011"},{"key":"ref3","article-title":"PIR with Low Storage Overhead: Coding instead of Replication","author":"fazeli","year":"2015","journal-title":"ArXiv e-prints"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920635"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920975"},{"key":"ref10","article-title":"On the factorization of the complete uniform hypergraphs","author":"baranyai","year":"1974","journal-title":"Infinite and Finite Sets"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"}],"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\/10206575.pdf?arnumber=10206575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:52Z","timestamp":1773347212000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206575\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206575","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}