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 "the capacity of private information retrieval from coded databases"):
  Abstract: We consider the problem of private information retrieval (PIR) over a distributed storage system. The storage system consists of $N$ non-colluding databases, each storing a coded version of $M$ messages. In the PIR problem, the user wishes to retrieve one of the available messages without revealing the message identity to any individual database. We derive the information-theoretic capacity of this problem, which is defined as the maximum number of bits of the desired message that can be privately retrieved per one bit of downloaded information. We show that the PIR capacity in this case is $C=\left(1+\frac{K}{N}+\frac{K^2}{N^2}+\cdots+\frac{K^{M-1}}{N^{M-1}}\right)^{-1}=(1+R_c+R_c^2+\cdots+R_c^{M-1})^{-1}=\frac{1-R_c}{1-R_c^M}$, where $R_c$ is the rate of the $(N,K)$ code used. The capacity is a function of the code rate and the number of messages only regardless of the explicit structure of the storage code. The result implies a fundamental tradeoff between the optimal retrieval cost and the storage cost. The result generalizes the achievability and converse results for the classical PIR with replicating databases to the case of coded databases.

Includes members:
  Member "blind interference alignment for private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "multiround private information retrieval capacity and storage overhead":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of robust private information retrieval with colluding databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "the capacity of symmetric private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "pir with low storage overhead coding instead of replication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "private information retrieval for coded storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the capacity of single server weakly private information retrieval")
  Member "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")

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)