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 "explicit construction of mbr codes for clustered distributed storage"):
  Abstract: Capacity of the distributed storage system (DSS) is often discussed in the context of tradeoff between storage overhead and repair bandwidth. This paper considers capacity-achieving coding for the clustered form of distributed storage that reflects practical storage networks. The suggested coding scheme is shown to exactly regenerate the arbitrary failed node with minimum required bandwidth, i.e., the proposed scheme is a minimum-bandwidth-regenerating (MBR) code of clustered DSSs with general parameter setting. The proposed code is a generalization of the existing MBR code designed for nonclustered DSSs. This code can be implemented in data centers with multiple racks (clusters), depending on the desired system parameters.

Includes members:
  Member "explicit constructions of msr codes for clustered distributed storage the rack aware storage model":
    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 "the storage versus repair bandwidth trade off for clustered storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "topology aware cooperative data protection in blockchain based decentralized storage networks")
  Member "a class of msr codes for clustered distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cascade codes for distributed storage systems")
  Member "secure clustered distributed storage against eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit constructions of mbr and msr codes for clustered distributed storage")
  Member "optimal repair layering for erasure coded data centers from theory to practice":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")
  Member "increasing availability in distributed storage systems via clustering":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model")
  Member "locality and availability of array codes constructed from subspaces":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "capacity of clustered distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cascade codes for distributed storage systems")

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)