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 codes with progressive engagement property for cloud storage systems"):
  Abstract: Author(s): Hajiaghayi, Mahdi; Jafarkhani, Hamid | Abstract: Fast and efficient failure recovery is a new challenge for cloud storage systems with a large number of storage nodes. A pivotal recovery metric upon the failure of a storage node is repair bandwidth cost which refers to the amount of data that must be downloaded for regenerating the lost data. Since all the surviving nodes are not always accessible, we intend to introduce a class of maximum distance separable (MDS) codes that can be re-used when the number of selected nodes varies yet yields close to optimal repair bandwidth. Such codes provide flexibility in engaging more surviving nodes in favor of reducing the repair bandwidth without redesigning the code structure and changing the content of the existing nodes. We call this property of MDS codes progressive engagement. This name comes from the fact that if a failure occurs, it is shown that the best strategy is to incrementally engage the surviving nodes according to their accessing cost (delay, number of hops, traffic load or availability in general) until the repair-bandwidth or accessing cost constraints are met. We argue that the existing MDS codes fail to satisfy the progressive engagement property. We subsequently present a search algorithm to find a new set of codes named rotation codes that has both progressive engagement and MDS properties. Furthermore, we illustrate how the existing permutation codes can provide progressive engagement by modifying the original recovery scheme. Simulation results are presented to compare the repair bandwidth performance of such codes when the number of participating nodes varies as well as their speed of single failure recovery.

Includes members:
  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-1 (induced by source paper "cascade codes for distributed storage systems")
  Member "zigzag codes mds array codes with optimal rebuilding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "increasing availability in distributed storage systems via clustering")
  Member "exact repair regenerating codes via layered erasure correction and block designs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on secure exact repair regenerating codes with a single pareto optimal point")
  Member "optimal repair of mds codes in distributed storage via subspace interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "speeding up distributed machine learning using codes")
  Member "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "exact regeneration codes for distributed storage repair using interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "rack aware regenerating codes for data centers")

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)