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 probabilistic approach towards exact repair regeneration codes"):
  Abstract: Regeneration codes with exact-repair property for distributed storage systems is studied in this paper. For exact- repair problem, the achievable points of ({\alpha},{\beta}) tradeoff match with the outer bound only for minimum storage regenerating (MSR), minimum bandwidth regenerating (MBR), and some specific values of n, k, and d. Such tradeoff is characterized in this work for general (n, k, k), (i.e., k = d) for some range of per-node storage ({\alpha}) and repair-bandwidth ({\beta}). Rather than explicit code construction, achievability of these tradeoff points is shown by proving existence of exact-repair regeneration codes for any (n,k,k). More precisely, it is shown that an (n, k, k) system can be extended by adding a new node, which is randomly picked from some ensemble, and it is proved that, with high probability, the existing nodes together with the newly added one maintain properties of exact-repair regeneration codes. The new achievable region improves upon the existing code constructions. In particular, this result provides a complete tradeoff characterization for an (n,3,3) distributed storage system for any value of n.

Includes members:
  Member "shortened regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cascade codes for distributed storage systems")
  Member "a note on the rate region of exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the achievability region of regenerating codes for multiple erasures")
  Member "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cascade codes for distributed storage systems")
  Member "layered exact repair regenerating codes via embedded error correction and block designs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cascade codes for distributed storage systems")
  Member "new codes and inner bounds for exact repair in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cascade codes for distributed storage systems")
  Member "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the achievability region of regenerating codes for multiple erasures")
  Member "zigzag codes mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "rate region of the 4 3 3 exact repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "increasing availability in distributed storage systems via clustering")

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)