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 "a general private information retrieval scheme for mds coded databases with colluding servers"):
  Abstract: The problem of private information retrieval gets renewed attentions in recent years due to its information-theoretic reformulation and applications in distributed storage systems. PIR capacity is the maximal number of bits privately retrieved per one bit of downloaded bit. The capacity has been fully solved for some degenerating cases. For a general case where the database is both coded and colluded, the exact capacity remains unknown. We build a general private information retrieval scheme for MDS coded databases with colluding servers. Our scheme achieves the rate $(1+R+R^2+\cdots+R^{M-1})$, where $R=1-\frac{{{N-T}\choose K}}{N\choose K}$. Compared to existing PIR schemes, our scheme performs better for a certain range of parameters and is suitable for any underlying MDS code used in the distributed storage system.

Includes members:
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "latent variable private information retrieval")
  Member "nearly optimal constructions of pir and batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "array codes for functional pir and batch codes")
  Member "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "latent variable private information retrieval")
  Member "private information retrieval schemes for coded data with arbitrary collusion patterns":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "noisy private information retrieval on separability of channel coding and information retrieval")
  Member "multi message private information retrieval capacity results and near optimal schemes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "binary shortened projective reed muller codes for coded private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locality and availability of array codes constructed from subspaces")
  Member "pir array codes with optimal virtual server rate":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "array codes for functional pir and batch codes")
  Member "multiround private information retrieval capacity and storage overhead":
    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)