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 "on partial maximally recoverable and maximally recoverable codes"):
  Abstract: An [n, k] linear code C that is subject to locality constraints imposed by a parity check matrix H0 is said to be a maximally recoverable (MR) code if it can recover from any erasure pattern that some k-dimensional subcode of the null space of H0 can recover from. The focus in this paper is on MR codes constrained to have all-symbol locality r. Given that it is challenging to construct MR codes having small field size, we present results in two directions. In the first, we relax the MR constraint and require only that apart from the requirement of being an optimum all-symbol locality code, the code must yield an MDS code when punctured in a single, specific pattern which ensures that each local code is punctured in precisely one coordinate and that no two local codes share the same punctured coordinate. We term these codes as partially maximally recoverable (PMR) codes. We provide a simple construction for high-rate PMR codes and then provide a general, promising approach that needs further investigation. In the second direction, we present three constructions of MR codes with improved parameters, primarily the size of the finite field employed in the construction

Includes members:
  Member "codes with locality for two erasures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a locality based approach for coded computation")
  Member "stair codes a general family of erasure codes for tolerating device and sector failures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "construction of partial mds pmds and sector disk sd codes with two global parity symbols":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized concatenated types of codes for erasure correction")
  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 "construction of pmds and sd codes extending raid 5":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "construction of two sd codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalized concatenated types of codes for erasure correction")
  Member "partial mds codes and their application to raid type of architectures":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on optimal locally repairable codes and generalized sector disk 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)