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 binary lrc codes and upper bounds on the distance of cyclic codes"
  Abstract: We consider linear cyclic codes with the locality property or locally recoverable codes LRC codes. A family of LRC codes that generalises the classical construction of Reed-Solomon codes was constructed in a recent paper by Tamo and Barg IEEE Transactions on Information Theory, No. 8, 2014. In this paper, we focus on distance-optimal cyclic codes that arise from this construction. We give a characterisation 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. The locality parameter of a cyclic code is related to the dual distance of this code, and we phrase our results in terms of upper bounds on the dual distance.

Connected through hyperedge HE-1 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions"):
  with members:
    - "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3"
    - "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "on optimal ternary locally repairable codes"
    - "liquid cloud storage"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with all symbol locality and availability"

Connected through hyperedge HE-2 (induced by source paper "combinatorial alphabet dependent bounds for locally recoverable codes"):
  with members:
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "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-3 (induced by source paper "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"):
  with members:
    - "how long can optimal locally repairable codes be"
    - "optimal lrc codes for all lenghts n q"
    - "construction of optimal locally recoverable codes and connection with hypergraph"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "optimal locally repairable codes via elliptic curves"
    - "locally recoverable codes on algebraic curves"

Connected through hyperedge HE-4 (induced by source paper "cyclic codes with locality and availability"):
  with members:
    - "constructions of optimal cyclic r delta locally repairable 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-5 (induced by source paper "rate optimal binary linear locally repairable codes with small availability"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "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"
    - "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-6 (induced by source paper "optimal binary linear locally repairable codes with disjoint repair groups"):
  with members:
    - "binary codes with locality for multiple erasures having short block length"
    - "optimal binary locally repairable codes via anticodes"
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "codes with locality for two erasures"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "an integer programming based bound for locally repairable codes"

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"
    - "constructions of optimal cyclic r delta locally repairable 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 "locally recoverable codes from algebraic curves and surfaces"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "bounds on the parameters of locally recoverable codes"
    - "locally recoverable codes on algebraic curves"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "on the locality of codeword symbols"

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)