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 "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"):
  Abstract: We propose a private information retrieval (PIR) protocol for distributed storage systems with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the maximum distance separable (MDS) PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus MDS-PIR capacity-achieving.

Includes members:
  Member "achieving private information retrieval capacity in distributed storage using an arbitrary linear code":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases")
  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-2 (induced by source paper "latent variable private information retrieval")
  Member "t private information retrieval schemes using transitive codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "private information retrieval in distributed storage systems using an arbitrary linear code":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "the capacity of robust private information retrieval with colluding databases":
    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 "private information retrieval from coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of 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 "the capacity of private information retrieval from coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")

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)