Private Information Retrieval on Multigraph-Based Replicated Storage

We consider the private information retrieval (PIR) problem for a multigraph-based replication system, where each set of r files is stored on two of the servers according to an underlying r-multigraph. Our goal is to establish upper and lower bounds on the PIR capacity of the r-multigraph. Specifically, we first propose a construction for multigraph-based PIR systems that leverages the symmetry of the underlying graph-based PIR scheme, deriving a capacity lower bound for such multigraphs. Then, we establish a general upper bound using linear programming, expressed as a function of the underlying graph parameters. Our bounds are demonstrated to be tight for PIR systems on multipaths for even number of vertices.