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 "repairing multiple failures for scalar mds codes"):
  Abstract: In distributed storage, erasure codes -- like Reed-Solomon Codes -- are often employed to provide reliability. In this setting, it is desirable to be able to repair one or more failed nodes while minimizing the repair bandwidth. In this work, motivated by Reed-Solomon codes, we study the problem of repairing multiple failed nodes in a scalar MDS code. We extend the framework of (Guruswami and Wootters, 2017) to give a framework for constructing repair schemes for multiple failures in general scalar MDS codes, in the centralized repair model. We then specialize our framework to Reed-Solomon codes, and extend and improve upon recent results of (Dau et al., 2017).

Includes members:
  Member "on the i o costs of some repair schemes for full length reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "optimal mds codes for cooperative repair":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "centralized multi node repair regenerating codes")
  Member "centralized multi node repair regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes")
  Member "optimal repair of reed solomon codes achieving the cut set bound":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an exponential lower bound on the sub packetization of msr codes")
  Member "repairing reed solomon codes universally achieving the cut set bound for any number of erasures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative repair constructions of optimal mds codes for all admissible parameters")
  Member "repairing reed solomon codes with two erasures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the i o costs of some repair schemes for full length reed solomon codes")
  Member "optimal repair schemes for some families of full length reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "repairing reed solomon codes with multiple erasures":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")

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)