{"id":"https://openalex.org/W4416114280","doi":"https://doi.org/10.1109/tit.2025.3631441","title":"New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage","display_name":"New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage","publication_year":2025,"publication_date":"2025-11-11","ids":{"openalex":"https://openalex.org/W4416114280","doi":"https://doi.org/10.1109/tit.2025.3631441"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2025.3631441","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3631441","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053562125","display_name":"Xiangliang Kong","orcid":"https://orcid.org/0000-0002-7893-2276"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I4210141777","display_name":"Academic College of Tel Aviv-Yafo","ror":"https://ror.org/04cg6c004","country_code":"IL","type":"education","lineage":["https://openalex.org/I4210141777"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Xiangliang Kong","raw_affiliation_strings":["Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv-Yafo, Israel"],"raw_orcid":"https://orcid.org/0000-0002-7893-2276","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv-Yafo, Israel","institution_ids":["https://openalex.org/I4210141777","https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009917191","display_name":"Shreya Meel","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shreya Meel","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0009-0002-5592-5302","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056734483","display_name":"Thomas Jacob Maranzatto","orcid":"https://orcid.org/0000-0002-6105-2758"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Jacob Maranzatto","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0002-6105-2758","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085150941","display_name":"Itzhak Tamo","orcid":"https://orcid.org/0000-0002-8000-0419"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I4210141777","display_name":"Academic College of Tel Aviv-Yafo","ror":"https://ror.org/04cg6c004","country_code":"IL","type":"education","lineage":["https://openalex.org/I4210141777"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Itzhak Tamo","raw_affiliation_strings":["Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv-Yafo, Israel"],"raw_orcid":"https://orcid.org/0000-0002-8000-0419","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv-Yafo, Israel","institution_ids":["https://openalex.org/I4210141777","https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021132487","display_name":"\u015eennur Uluku\u015f","orcid":"https://orcid.org/0000-0002-8219-8190"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sennur Ulukus","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0002-8219-8190","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1081,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.84489578,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"72","issue":"1","first_page":"691","last_page":"709"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.33410000801086426,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.33410000801086426,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.29440000653266907,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.10050000250339508,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6786999702453613},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5932999849319458},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.489300012588501},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42010000348091125},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.38609999418258667},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3853999972343445},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.35690000653266907}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6786999702453613},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5932999849319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5072000026702881},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4925000071525574},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.489300012588501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4571000039577484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40959998965263367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4034999907016754},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.35690000653266907},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C2781007418","wikidata":"https://www.wikidata.org/wiki/Q1456934","display_name":"Capacity planning","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3190999925136566},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2824000120162964},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2025.3631441","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3631441","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2863868470","display_name":null,"funder_award_id":"852953","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1593123147","https://openalex.org/W1832668820","https://openalex.org/W1962818100","https://openalex.org/W1998698985","https://openalex.org/W2073346043","https://openalex.org/W2087207261","https://openalex.org/W2120770247","https://openalex.org/W2260085643","https://openalex.org/W2570927556","https://openalex.org/W2599749253","https://openalex.org/W2768218911","https://openalex.org/W2774968492","https://openalex.org/W2808769206","https://openalex.org/W2885836992","https://openalex.org/W2888580722","https://openalex.org/W2919422837","https://openalex.org/W2961382438","https://openalex.org/W2962692592","https://openalex.org/W2963190045","https://openalex.org/W2963246398","https://openalex.org/W2963413537","https://openalex.org/W2963898134","https://openalex.org/W2964259813","https://openalex.org/W2969007227","https://openalex.org/W2975436019","https://openalex.org/W2976078580","https://openalex.org/W2976108093","https://openalex.org/W2976957157","https://openalex.org/W2990789045","https://openalex.org/W3007542335","https://openalex.org/W3009989039","https://openalex.org/W3010011586","https://openalex.org/W3011894940","https://openalex.org/W3044113996","https://openalex.org/W3049183470","https://openalex.org/W3080270214","https://openalex.org/W3084711314","https://openalex.org/W3093360177","https://openalex.org/W3122246509","https://openalex.org/W3128892202","https://openalex.org/W3191104470","https://openalex.org/W3214610463","https://openalex.org/W4289655286","https://openalex.org/W4311080731","https://openalex.org/W4312229871","https://openalex.org/W4386066579"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,62,86,109],"study":[4],"the":[5,45,64,93,96,118],"problem":[6],"of":[7,31,95,121],"private":[8],"information":[9],"retrieval":[10],"(PIR)":[11],"in":[12,126],"both":[13],"graph-based":[14,60,98],"and":[15,28,51,71,80,114],"multigraph-based":[16,84],"replication":[17],"systems,":[18,61,85],"where":[19],"each":[20],"file":[21],"is":[22],"stored":[23],"on":[24,44,117],"exactly":[25],"two":[26],"servers,":[27],"any":[29],"pair":[30],"servers":[32],"shares":[33],"at":[34],"most":[35],"<italic":[36],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[37],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">r</i>":[38],"files.":[39],"We":[40],"derive":[41],"upper":[42,113],"bounds":[43,116],"PIR":[46,53,66,89,119],"capacity":[47,67,102,120],"for":[48,68,76,105],"such":[49,106],"systems":[50],"construct":[52],"schemes":[54],"that":[55,91],"approach":[56],"these":[57],"bounds.":[58],"For":[59,83],"determine":[63],"exact":[65],"path":[69],"graphs":[70,79],"improve":[72],"upon":[73],"existing":[74],"results":[75],"complete":[77,81],"bipartite":[78],"graphs.":[82],"propose":[87],"a":[88,101],"scheme":[90],"leverages":[92],"symmetry":[94],"underlying":[97],"construction,":[99],"yielding":[100],"lower":[103,115],"bound":[104],"multigraphs.":[107],"Furthermore,":[108],"establish":[110],"several":[111],"general":[112],"multigraphs,":[122],"which":[123],"are":[124],"tight":[125],"certain":[127],"cases.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-11T00:00:00"}