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: "bounds on locally recoverable codes with multiple recovering sets"
  Abstract: A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. Bounds on the rate and distance of such codes have been extensively studied in the literature. In this paper we derive upper bounds on the rate and distance of codes in which every symbol has $t\geq 1$ disjoint recovering sets.

Connected through hyperedge HE-1 (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-2 (induced by source paper "analyzing the download time of availability codes"):
  with members:
    - "straggler mitigation at scale"
    - "simplex queues for hot data download"
    - "on the service capacity region of accessing erasure coded content"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "provably delay efficient data retrieving in storage clouds"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-3 (induced by source paper "lifted multiplicity codes and the disjoint repair group property"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "nearly optimal constructions of pir and batch codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-4 (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"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-5 (induced by source paper "lifted multiplicity codes"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "some remarks on multiplicity codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"

Connected through hyperedge HE-6 (induced by source paper "batch and pir codes and their connections to locally repairable codes"):
  with members:
    - "on private information retrieval array codes"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "cooperative local repair in distributed storage"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"

Connected through hyperedge HE-7 (induced by source paper "constructions of locally recoverable codes which are optimal"):
  with members:
    - "locally recoverable codes on algebraic curves"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "optimal locally repairable codes via rank metric codes"
    - "an upper bound on the size of locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"

Connected through hyperedge HE-8 (induced by source paper "rate optimal binary linear locally repairable codes with small availability"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "bounds on codes with locality and availability"
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "binary codes with locality for multiple erasures having short block length"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "codes with hierarchical locality"

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)