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 cyclic r delta locally repairable codes"
  Abstract: A code is said to be a $r$-local locally repairable code (LRC) if each of its coordinates can be repaired by accessing at most $r$ other coordinates. When some of the $r$ coordinates are also erased, the $r$-local LRC can not accomplish the local repair, which leads to the concept of $(r,\delta)$-locality. A $q$-ary $[n, k]$ linear code $\cC$ is said to have $(r, \delta)$-locality ($\delta\ge 2$) if for each coordinate $i$, there exists a punctured subcode of $\cC$ with support containing $i$, whose length is at most $r + \delta - 1$, and whose minimum distance is at least $\delta$. The $(r, \delta)$-LRC can tolerate $\delta-1$ erasures in total, which degenerates to a $r$-local LRC when $\delta=2$. A $q$-ary $(r,\delta)$ LRC is called optimal if it meets the Singleton-like bound for $(r,\delta)$-LRCs. A class of optimal $q$-ary cyclic $r$-local LRCs with lengths $n\mid q-1$ were constructed by Tamo, Barg, Goparaju and Calderbank based on the $q$-ary Reed-Solomon codes. In this paper, we construct a class of optimal $q$-ary cyclic $(r,\delta)$-LRCs ($\delta\ge 2$) with length $n\mid q-1$, which generalizes the results of Tamo \emph{et al.} Moreover, we construct a new class of optimal $q$-ary cyclic $r$-local LRCs with lengths $n\mid q+1$ and a new class of optimal $q$-ary cyclic $(r,\delta)$-LRCs ($\delta\ge 2$) with lengths $n\mid q+1$. The constructed optimal LRCs with length $n=q+1$ have the best-known length $q+1$ for the given finite field with size $q$ when the minimum distance is larger than $4$.

Connected through hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes"):
  with members:
    - "array codes with local properties"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "on optimal locally repairable codes with super linear length"
    - "explicit optimal length locally repairable codes of distance 5"
    - "locality and availability of array codes constructed from subspaces"
    - "optimal locally repairable codes via elliptic curves"

Connected through hyperedge HE-2 (induced by source paper "locally recoverable j affine variety codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "how long can optimal locally repairable codes be"
    - "new binary and ternary lcd codes"
    - "classical and quantum evaluation codes at the trace roots"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "cooperative local repair in distributed storage"
    - "cyclic lrc codes and their subfield subcodes"

Connected through hyperedge HE-3 (induced by source paper "locally repairable codes with unequal local erasure correction"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "constructions and properties of linear locally repairable codes"
    - "bounds on the maximal minimum distance of linear locally repairable codes"
    - "cyclic lrc codes and their subfield subcodes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "optimal cyclic r delta locally repairable codes with unbounded length"):
  with members:
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-5 (induced by source paper "cyclic codes with locality and availability"):
  with members:
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "bounds on the parameters of locally recoverable codes"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "locally repairable codes with multiple repair alternatives"
    - "an upper bound on the size of locally recoverable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-6 (induced by source paper "codes with unequal disjoint local erasure correction constraints"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "constructions and properties of linear locally repairable codes"
    - "bounds on the maximal minimum distance of linear locally repairable codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "erasure codes with simplex locality"

Connected through hyperedge HE-7 (induced by source paper "a study on the impact of locality in the decoding of binary cyclic codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "codes with hierarchical locality"
    - "cyclic lrc codes and their subfield subcodes"
    - "bounds on the parameters of locally recoverable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-8 (induced by source paper "bounds and constructions of locally repairable codes parity check matrix approach"):
  with members:
    - "constructions and properties of linear locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "cyclic lrc codes and their subfield subcodes"
    - "achieving arbitrary locality and availability in binary codes"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"
    - "locally recoverable codes on algebraic curves"

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)