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 "cooperative repair constructions of optimal mds codes for all admissible parameters"):
  Abstract: Two widely studied models of multiple-node repair in distributed storage systems are centralized repair and cooperative repair. The centralized model assumes that all the failed nodes are recreated in one location, while the cooperative one stipulates that the failed nodes may communicate but are distinct, and the amount of data exchanged between them is included in the repair bandwidth. We show that cooperative model is stronger than the centralized one, in the sense that MDS codes with optimal repair bandwidth under the former model have the same property under the latter one. #R##N#In this paper we present explicit constructions of MDS codes with optimal cooperative repair for all possible parameters. More precisely, given any $n,k,h,d$ such that $2\le h \le n-d\le n-k$ we construct explicit $(n,k)$ MDS codes over the field $F$ of size $|F|\ge (d+1-k)n$ that can optimally repair any $h$ erasures from any $d$ helper nodes. The repair scheme of our codes involves two rounds of communication. In the first round, each failed node downloads information from the helper nodes, and in the second one, each failed node downloads additional information from the other failed nodes. This shows that two rounds of communication in cooperative repair always suffice, and that the proposed codes achieve the optimal repair bandwidth using the smallest possible number of rounds.

Includes members:
  Member "on the achievability region of regenerating codes for multiple erasures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "the repair problem for reed solomon codes optimal repair of single and multiple erasures asymptotically optimal node size":
    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 "improved schemes for asymptotically optimal repair of mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  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 "on the sub packetization size and the repair bandwidth of reed solomon codes")
  Member "optimal repair schemes for some families of full length reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "repairing multiple failures for scalar mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an improved cooperative repair scheme for reed solomon codes")
  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)