human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "private information retrieval from non replicated databases"):
  Abstract: We consider the problem of private information retrieval (PIR) of a single message out of $K$ messages from $N$ non-colluding and non-replicated databases. Different from the majority of the existing literature, which considers the case of replicated databases where all databases store the same content in the form of all $K$ messages, here, we consider the case of non-replicated databases under a special non-replication structure where each database stores $M$ out of $K$ messages and each message is stored across $R$ different databases. This generates an $R$-regular graph structure for the storage system where the vertices of the graph are the messages and the edges are the databases. We derive a general upper bound for $M=2$ that depends on the graph structure. We then specialize the problem to storage systems described by two special types of graph structures: cyclic graphs and \emph{fully-connected graphs}. We prove that the PIR capacity for the case of cyclic graphs is $\frac{2}{K+1}$, and the PIR capacity for the case of fully-connected graphs is $\min\{\frac{2}{K},\frac{1}{2}\}$. To that end, we propose novel achievable schemes for both graph structures that are capacity-achieving. The central insight in both schemes is to introduce dependency in the queries submitted to databases that do not contain the desired message, such that the requests can be compressed. In both cases, the results show severe degradation in PIR capacity due to non-replication.

Includes members:
  Member "the capacity of private information retrieval from heterogeneous uncoded caching databases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "latent variable private information retrieval")
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "staircase pir universally robust private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "the capacity of private information retrieval from uncoded storage constrained databases":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "latent variable private information retrieval")
  Member "private information retrieval from a cellular network with caching at the edge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "latent variable private information retrieval")
  Member "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "capacity achieving private information retrieval codes with optimal message size and upload cost":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "latent variable private information retrieval")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)