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 the rate of linear locally repairable codes over small alphabets"
  Abstract: Locally repairable codes (LRC) have recently been a subject of intense research due to theoretical appeal and their application in distributed storage systems. In an LRC, any coordinate of a codeword can be recovered by accessing only few other coordinates. For LRCs over small alphabet (such as binary), the optimal rate-distance trade-off is unknown. In this paper we provide the tightest known upper bound on the rate of linear LRCs of a given relative distance, an improvement over any previous result, in particular \cite{cadambe2013upper}.

Connected through hyperedge HE-1 (induced by source paper "combinatorial alphabet dependent bounds for locally recoverable codes"):
  with members:
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"
    - "bounds on the parameters of locally recoverable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"

Connected through hyperedge HE-2 (induced by source paper "rate optimal binary linear locally repairable codes with small availability"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "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"
    - "optimal binary locally repairable codes via anticodes"

Connected through hyperedge HE-3 (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"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "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)