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: "a new bound on the minimum distance of cyclic codes using small minimum distance cyclic codes"
  Abstract: A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndromes and formulate a Key Equation that allows an efficient decoding up to our bound with the Extended Euclidean Algorithm. It turns out that lowest-code-rate cyclic codes with small minimum distances are useful for our approach. Therefore, we give a sufficient condition for binary cyclic codes of arbitrary length to have minimum distance two or three and lowest code-rate

Connected through hyperedge HE-1 (induced by source paper "optimal linear and cyclic locally repairable codes over small fields"):
  with members:
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "erasure codes with simplex locality"
    - "optimal locally repairable codes via rank metric codes"
    - "locally repairable codes with multiple repair alternatives"
    - "an upper bound on the size of locally recoverable codes"

Connected through hyperedge HE-2 (induced by source paper "spectral analysis of quasi cyclic product codes"):
  with members:
    - "construction of quasi cyclic product codes"
    - "decoding of quasi cyclic codes up to a new lower bound on the minimum distance"
    - "generalizing bounds on the minimum distance of cyclic codes using cyclic product codes"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "on the decoding of quasi bch codes"
    - "on quasi cyclic codes as a generalization of cyclic codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-3 (induced by source paper "decoding of repeated root cyclic codes up to new bounds on their minimum distance"):
  with members:
    - "generalizing bounds on the minimum distance of cyclic codes using cyclic product codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "list decoding tensor products and interleaved codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-4 (induced by source paper "generalizing bounds on the minimum distance of cyclic codes using cyclic product codes"):
  with members:
    - "decoding cyclic codes up to a new bound on the minimum distance"

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)