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 "mds array codes with optimal rebuilding"):
  Abstract: MDS array codes are widely used in storage systems to protect data against erasures. We address the \emph{rebuilding ratio} problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be accessed in order to rebuild \emph{exactly} the lost information? It is clear that when the number of erasures equals the maximum number of erasures that an MDS code can correct then the rebuilding ratio is 1 (access all the remaining information). However, the interesting (and more practical) case is when the number of erasures is smaller than the erasure correcting capability of the code. For example, consider an MDS code that can correct two erasures: What is the smallest amount of information that one needs to access in order to correct a single erasure? Previous work showed that the rebuilding ratio is bounded between 1/2 and 3/4, however, the exact value was left as an open problem. In this paper, we solve this open problem and prove that for the case of a single erasure with a 2-erasure correcting code, the rebuilding ratio is 1/2. In general, we construct a new family of $r$-erasure correcting MDS array codes that has optimal rebuilding ratio of $\frac{1}{r}$ in the case of a single erasure. Our array codes have efficient encoding and decoding algorithms (for the case $r=2$ they use a finite field of size 3) and an optimal update property.

Includes members:
  Member "enabling node repair in any erasure code for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cascade codes for distributed storage systems")
  Member "on the existence of optimal exact repair mds codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cascade codes for distributed storage systems")
  Member "rebuilding for array codes in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a new design of binary mds array codes with asymptotically weak optimal repair")
  Member "exact regeneration codes for distributed storage repair using interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improving the secrecy of distributed storage systems using interference alignment")
  Member "explicit codes minimizing repair bandwidth for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rack aware regenerating codes for data centers")
  Member "explicit construction of optimal exact regenerating codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal fraction repetition codes for access balancing in distributed storage")
  Member "network coding for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")

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)