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: "on the weight hierarchy of locally repairable codes"
  Abstract: An $(n,k,r)$ \emph{locally repairable code} (LRC) is an $[n,k,d]$ linear code where every code symbol can be repaired from at most $r$ other code symbols. An LRC is said to be optimal if the minimum distance attains the Singleton-like bound $d \le n-k-\lceil k/r \rceil +2$. The \emph{generalized Hamming weights} (GHWs) of linear codes are fundamental parameters which have many useful applications. Generally it is difficult to determine the GHWs of linear codes. In this paper, we study the GHWs of LRCs. Firstly, we obtain a generalized Singleton-like bound on the $i$-th $(1\le i \le k)$ GHWs of general $(n,k,r)$ LRCs. Then, it is shown that for an optimal $(n,k,r)$ LRC with $r \mid k$, its weight hierarchy can be completely determined, and the $i$-th GHW of an optimal $(n,k,r)$ LRC with $r \mid k$ attains the proposed generalized Singleton-like bound for all $1\le i \le k$. For an optimal $(n,k,r)$ LRC with $r \nmid k$, we give lower bounds on the GHWs of the LRC and its dual code. Finally, two general bounds on linear codes in terms of the GHWs are presented. Moreover, it is also shown that some previous results on the bounds of minimum distances of linear codes can also be explained or refined in terms of the GHWs.

Connected through hyperedge HE-1 (induced by source paper "two classes of linear codes and their generalized hamming weights"):
  with members:
    - "a note on the generalized hamming weights of reed muller codes"
    - "a class of cyclotomic linear codes and their generalized hamming weights"
    - "the weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes"
    - "the second generalized hamming weight of some evaluation codes arising from a projective torus"
    - "the weight hierarchy of some reducible cyclic codes"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "locally repairable codes with multiple r_ i delta_ i localities"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "constructions and properties of linear locally repairable codes"
    - "repair locality from a combinatorial perspective"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric 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)