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: "an upper bound on the size of locally recoverable codes"
  Abstract: In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysis and depends on the size of the alphabet being used.

Connected through hyperedge HE-1 (induced by source paper "the complete hierarchical locality of the punctured simplex code"):
  with members:
    - "codes with hierarchical locality from covering maps of curves"
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "alphabet dependent bounds for linear locally repairable codes based on residual codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "codes with hierarchical locality"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "erasure coding for distributed storage an overview"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "bounds and constructions for linear locally repairable codes over binary fields"
    - "optimal binary linear locally repairable codes with disjoint repair groups"
    - "extended product and integrated interleaved codes"

Connected through hyperedge HE-3 (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-4 (induced by source paper "matroid theory and storage codes bounds and constructions"):
  with members:
    - "locally recoverable codes from algebraic curves and surfaces"
    - "improved singleton type bounds for locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "codes with hierarchical locality"
    - "optimal binary locally repairable codes via anticodes"
    - "pir with low storage overhead coding instead of replication"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"

Connected through hyperedge HE-5 (induced by source paper "constructions of locally recoverable codes which are optimal"):
  with members:
    - "locally recoverable codes on algebraic curves"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "optimal locally repairable codes via rank metric 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-6 (induced by source paper "how long can optimal locally repairable codes be"):
  with members:
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "optimal locally repairable codes via elliptic curves"
    - "a family of optimal locally recoverable codes"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols in non linear codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "locally repairable codes"

Connected through hyperedge HE-7 (induced by source paper "cyclic codes with locality and availability"):
  with members:
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "bounds on the parameters of locally recoverable codes"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "locally repairable codes with multiple repair alternatives"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-8 (induced by source paper "linear programming bounds for distributed storage codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"

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)