{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:38Z","timestamp":1773377918420,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["852953"],"award-info":[{"award-number":["852953"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1030\/15"],"award-info":[{"award-number":["1030\/15"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518086","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1913-1918","source":"Crossref","is-referenced-by-count":5,"title":["Bounds on the Capacity of PIR over Graphs"],"prefix":"10.1109","author":[{"given":"Bar","family":"Sadeh","sequence":"first","affiliation":[{"name":"Tel-Aviv University,Department of Electrical Engineering-Systems,Tel-Aviv,Israel,39040"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujie","family":"Gu","sequence":"additional","affiliation":[{"name":"Kyushu University,Faculty of Information Science and Electrical Engineering,Fukuoka,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Tel-Aviv University,Department of Electrical Engineering-Systems,Tel-Aviv,Israel,39040"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref11","first-page":"72","article-title":"A survey on private information retrieval","volume":"82","author":"gasarch","year":"2004","journal-title":"Bulletin of the EATCS"},{"key":"ref12","year":"0","journal-title":"Data Replication-HDFS Architecture guide"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3011053"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955053"},{"key":"ref16","author":"sadeh","year":"0","journal-title":"Bounds on the Capacity of PIR over Graphs"},{"key":"ref17","first-page":"39","article-title":"Uniform hypergraphs","author":"schrijver","year":"1978","journal-title":"Packing and covering in combinatorics (Study week “Stapelen en overdekken”"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2779454"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7842315"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref3","first-page":"91","article-title":"On the factorization of the complete uniform hypergraph","author":"baranyai","year":"1975","journal-title":"Infinite and finite sets (Proc Intern Coll Keszthely 1973)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849399"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref2","year":"0","journal-title":"Apache Cassandra 2 1 for DSE Data replication"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_196"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746546"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905981"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2848977"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2903206"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518086.pdf?arnumber=9518086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:34Z","timestamp":1773347734000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518086\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518086","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}