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 with private side information"):
  Abstract: The problem of private information retrieval with private side information (PIR-PSI) is recently introduced by Kadhe et al. In this problem, $N$ replicated databases each store $K$ messages, of which $M$ are known to the user as side-information. The identity of these $M$ messages is unknown to the databases. The user wishes to retrieve, as efficiently as possible, a new desired message without revealing any information about the joint indices of the desired and side-information messages. We show that the capacity of PIR-PSI is $\left(1+\frac{1}{N}+\frac{1}{N^2}+\cdots+\frac{1}{N^{K-M-1}}\right)^{-1}$. Thus, the capacity of PIR-PSI with $K$ messages, $N$ databases and side-information of $M$ messages is identical to the capacity of PIR with $K-M$ messages, $N$ databases and no side-information, which was found previously by Sun and Jafar. The achievability and converse proofs are essentially inherited from the original work of Sun and Jafar.

Includes members:
  Member "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "multi message private information retrieval with private side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "converse for multi server single message pir with side information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "on the capacity of single server multi message private information retrieval with side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private computation with individual and joint privacy")
  Member "capacity of single server single message private information retrieval with coded side information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private computation with individual and joint privacy")
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "latent variable private information retrieval")
  Member "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of cache aided private information retrieval":
    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)