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 and constructions of locally repairable codes parity check matrix approach"
  Abstract: A code symbol of a linear code is said to have locality r if this symbol could be recovered by at most r other code symbols. An (n,k,r) locally repairable code (LRC) with all symbol locality is a linear code with length n, dimension k, and locality r for all symbols. Recently, there are lots of studies on the bounds and constructions of LRCs, most of which are essentially based on the generator matrix of the linear code. Up to now, the most important bounds of minimum distance for LRCs might be the well-known Singleton-like bound and the Cadambe-Mazumdar bound concerning the field size. #R##N#In this paper, we study the bounds and constructions of LRCs from views of parity-check matrices. Firstly, we set up a new characterization of the parity-check matrix for an LRC. Then, the proposed parity-check matrix is employed to analyze the minimum distance. We give an alternative simple proof of the well-known Singleton-like bound for LRCs with all symbol locality, and then easily generalize it to a more general bound, which essentially coincides with the Cadambe-Mazumdar bound and includes the Singleton-like bound as a specific case. Based on the proposed characterization of parity-check matrices, necessary conditions of meeting the Singleton-like bound are obtained, which naturally lead to a construction framework of good LRCs. Finally, two classes of optimal LRCs based on linearized polynomial theories and Vandermonde matrices are obtained under the construction framework.

Connected through hyperedge HE-1 (induced by source paper "bounds and constructions for linear locally repairable codes over binary fields"):
  with members:
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "irregular recovery and unequal locality for locally recoverable codes with availability"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "achieving arbitrary locality and availability in binary codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-3 (induced by source paper "on the weight hierarchy of locally repairable codes"):
  with members:
    - "on optimal ternary locally repairable codes"
    - "cyclic lrc codes and their subfield subcodes"
    - "weight enumerators and higher support weights of maximally recoverable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality from a combinatorial perspective"
    - "codes with locality for two erasures"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable 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)