human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "explicit maximally recoverable codes with locality"
  Abstract: Consider a systematic linear code where some (local) parity symbols depend on few prescribed symbols, while other (heavy) parity symbols may depend on all data symbols. Local parities allow to quickly recover any single symbol when it is erased, while heavy parities provide tolerance to a large number of simultaneous erasures. A code as above is maximally-recoverable if it corrects all erasure patterns which are information theoretically recoverable given the code topology. In this paper we present explicit families of maximally-recoverable codes with locality. We also initiate the study of the trade-off between maximal recoverability and alphabet size.

Connected through hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes"):
  with members:
    - "array codes with local properties"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "on optimal locally repairable codes with super linear length"
    - "explicit optimal length locally repairable codes of distance 5"
    - "locality and availability of array codes constructed from subspaces"
    - "optimal locally repairable codes via elliptic curves"

Connected through hyperedge HE-2 (induced by source paper "partial mds codes with local regeneration"):
  with members:
    - "on error decoding of locally repairable and partial mds codes"
    - "locally repairable and locally regenerating codes obtained by parity splitting of hashtag codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal locally repairable codes and connections to matroid theory"
    - "partial mds codes and their application to raid type of architectures"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "on error decoding of locally repairable and partial mds codes"):
  with members:
    - "on decoding and applications of interleaved goppa codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "improved power decoding of interleaved one point hermitian codes"
    - "a public key cryptosystem from interleaved goppa codes"
    - "list decoding of locally repairable codes"
    - "fractional decoding error correction from partial information"
    - "a complete classification of partial mds maximally recoverable codes with one global parity"
    - "decoding of interleaved reed solomon codes using improved power decoding"

Connected through hyperedge HE-4 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies"):
  with members:
    - "on maximally recoverable codes for product topologies"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "maximally recoverable codes for grid like topologies"
    - "binary codes with locality for multiple erasures having short block length"
    - "optimal binary locally repairable codes via anticodes"
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"

Connected through hyperedge HE-5 (induced by source paper "private information retrieval from locally repairable databases with colluding servers"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "one shot pir refinement and lifting"
    - "private information retrieval over networks"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "a general private information retrieval scheme for mds coded databases with colluding servers"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "bounds and constructions of codes with multiple localities"

Connected through hyperedge HE-6 (induced by source paper "locally repairable convolutional codes with sliding window repair"):
  with members:
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "locally repairable codes with unequal local erasure correction"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "superregular matrices and applications to convolutional codes"
    - "convolutional codes in rank metric with application to random network coding"

Connected through hyperedge HE-7 (induced by source paper "uniform minors in maximally recoverable codes"):
  with members:
    - "matroid theory and storage codes bounds and constructions"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "weight enumerators and higher support weights of maximally recoverable codes"
    - "a family of optimal locally recoverable codes"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-8 (induced by source paper "array codes with local properties"):
  with members:
    - "a unified form of evenodd and rdp codes and their efficient decoding"
    - "maximally recoverable codes for grid like topologies"
    - "bounds and constructions of codes with multiple localities"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "on the locality of codeword symbols"

Question: Please tell me which class the center node 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)