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 "maximally recoverable codes with hierarchical locality"):
  Abstract: Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with locality. The notion of locality has been extended to hierarchical locality, which allows for locality to gradually increase in levels with the increase in the number of erasures. We consider the locality constraints imposed by codes with two-level hierarchical locality and define maximally recoverable codes with data-local and local hierarchical locality. We derive certain properties related to their punctured codes and minimum distance. We give a procedure to construct hierarchical data-local MRCs from hierarchical local MRCs. We provide a construction of hierarchical local MRCs for all parameters. For the case of one global parity, we provide a different construction of hierarchical local MRC over a lower field size.

Includes members:
  Member "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "constructions of maximally recoverable local reconstruction codes via function fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes")
  Member "new constructions of sd and mr codes over small finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes")
  Member "codes with hierarchical locality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "explicit maximally recoverable codes with locality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "partial mds codes and their application to raid type of architectures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  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")

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)