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: "optimal binary locally repairable codes via anticodes"
  Abstract: This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It provides binary LRCs which attain the Cadambe-Mazumdar bound. Moreover, most of these codes are optimal with respect to the Griesmer bound.

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"
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "codes with locality for two erasures"

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 "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"
    - "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"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "pir array codes with optimal virtual server rate"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "on private information retrieval array codes"

Connected through hyperedge HE-5 (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"

Connected through hyperedge HE-6 (induced by source paper "optimal binary linear locally repairable codes with disjoint repair groups"):
  with members:
    - "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"
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "an integer programming based bound for locally repairable codes"

Connected through hyperedge HE-7 (induced by source paper "on the average locality of locally repairable codes"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "balanced locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"

Connected through hyperedge HE-8 (induced by source paper "bounds and constructions for linear locally repairable codes over binary fields"):
  with members:
    - "bounds and constructions of locally repairable codes parity check matrix approach"
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "bounds on the parameters of locally recoverable codes"
    - "codes with locality for two erasures"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"

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)