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 regenerating codes"):
  Abstract: One of the design objectives in distributed storage system is the minimization of the data traffic during the repair of failed storage nodes. By repairing multiple failures simultaneously and cooperatively, further reduction of repair traffic is made possible. A closed-form expression of the optimal tradeoff between the repair traffic and the amount of storage in each node for cooperative repair is given. We show that the points on the tradeoff curve can be achieved by linear cooperative regenerating codes, with an explicit bound on the required finite field size. The proof relies on a max-flow-min-cut-type theorem for submodular flow from combinatorial optimization. Two families of explicit constructions are given.

Includes members:
  Member "optimal locally repairable codes via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff":
    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 "codes with local regeneration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "locally recoverable j affine variety codes")
  Member "exact scalar minimum storage coordinated regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scalar mscr codes via the product matrix construction")
  Member "optimal linear codes with a local error correction property":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practical functional regenerating codes for broadcast repair of multiple nodes")
  Member "cross mbcr exact minimum bandwith coordinated regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "security concerns in minimum storage cooperative regenerating codes")
  Member "minimum cost multicast with decentralized sources":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coded cooperative data exchange problem for general 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)