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: "constructions of optimal and almost optimal locally repairable codes"
  Abstract: Constructions of optimal locally repairable codes (LRCs) in the case of (r + 1) l n and over small finite fields were stated as open problems for LRCs in [I. Tamo et al., “Optimal locally repairable codes and connections to matroid theory”, 2013 IEEE ISIT]. In this paper, these problems are studied by constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which (r + 1) l n. More precisely, linear codes for given length, dimension, and all-symbol locality are constructed with almost optimal minimum distance. ‘Almost optimal’ refers to the fact that their minimum distance differs by at most one from the optimal value given by a known bound for LRCs. In addition to these linear LRCs, optimal LRCs which do not require a large field are constructed for certain classes of parameters.

Connected through hyperedge HE-1 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"):
  with members:
    - "on minimum distance of locally repairable codes"
    - "binary codes with locality for multiple erasures having short block length"
    - "binary codes with locality for four erasures"
    - "codes with hierarchical locality"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "an upper bound on the minimum distance of ldpc codes over gf q"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-2 (induced by source paper "constructions and properties of linear locally repairable codes"):
  with members:
    - "codes between mbr and msr points with exact repair property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "optimal locally repairable linear codes"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "binary linear locally repairable codes"):
  with members:
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "cyclic lrc codes and their subfield subcodes"
    - "repair locality with multiple erasure tolerance"
    - "repairable fountain codes"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-4 (induced by source paper "local codes with addition based repair"):
  with members:
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "cyclic lrc codes and their subfield subcodes"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "locally repairable codes"

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)