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 mbr all symbol locality codes"):
  Abstract: Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and have maximum capacity (i.e., maximum rate). Finally, the same pre-coding mechanism can be combined with a subclass of fractional-repetition codes to enable maximum resilience and repair-by-transfer simultaneously.

Includes members:
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk 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 "error resilience in distributed storage via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  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 "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a locality based approach for coded computation")
  Member "on the locality of codeword symbols":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a locality based approach for coded computation")
  Member "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction":
    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)