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: "cyclic lrc codes and their subfield subcodes"
  Abstract: We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Transactions on Information Theory, no. 8, 2014; arXiv:1311.3284). In this paper we focus on the optimal cyclic codes that arise from the general construction. We give a characterization of these codes in terms of their zeros, and observe that there are many equivalent ways of constructing optimal cyclic LRC codes over a given field. We also study subfield subcodes of cyclic LRC codes (BCH-like LRC codes) and establish several results about their locality and minimum distance.

Connected through hyperedge HE-1 (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"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "cooperative local repair in distributed storage"

Connected through hyperedge HE-2 (induced by source paper "computing sharp recovery structures for locally recoverable codes"):
  with members:
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "locally recoverable codes on algebraic curves"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "on the ideal associated to a linear code"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

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 of optimal cyclic r delta locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "bounds on the maximal minimum distance of linear locally repairable codes"
    - "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 "on the weight hierarchy of locally repairable codes"):
  with members:
    - "on optimal ternary locally repairable codes"
    - "bounds and constructions of locally repairable codes parity check matrix approach"
    - "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"

Connected through hyperedge HE-5 (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"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "codes with hierarchical locality"
    - "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-6 (induced by source paper "on optimal ternary locally repairable codes"):
  with members:
    - "constructions and properties of linear locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "self repairing homomorphic codes for distributed storage systems"

Connected through hyperedge HE-7 (induced by source paper "bounds and constructions of locally repairable codes parity check matrix approach"):
  with members:
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "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"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "constructions of optimal cyclic r delta locally repairable codes"):
  with members:
    - "constructions and properties of linear locally repairable codes"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "optimal binary locally repairable codes via anticodes"
    - "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"
    - "optimal locally repairable and secure codes for distributed storage systems"

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)