Local PIR capacity on graphs shows multiplicative gains for disjoint unions of distinct graphs and exact values for cyclic graphs and odd-vertex paths, with improved lower bounds for edge-transitive and bipartite graphs over standard PIR.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Local Private Information Retrieval: A New Privacy Perspective for Graph-Based Replicated Systems
Local PIR capacity on graphs shows multiplicative gains for disjoint unions of distinct graphs and exact values for cyclic graphs and odd-vertex paths, with improved lower bounds for edge-transitive and bipartite graphs over standard PIR.