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: "optimal ternary cyclic codes with minimum distance four and five"
  Abstract: Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first family of cyclic codes has parameters $[3^m-1, 3^m-1-2m, 4]$ and contains a class of conjectured cyclic codes and several new classes of optimal cyclic codes. The second family of cyclic codes has parameters $[3^m-1, 3^m-2-2m, 5]$ and contains a number of classes of cyclic codes that are obtained from perfect nonlinear functions over $\fthreem$, where $m>1$ and is a positive integer.

Connected through hyperedge HE-1 (induced by source paper "two classes of p ary linear codes and their duals"):
  with members:
    - "a class of optimal ternary cyclic codes and their duals"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "optimal ternary cyclic codes from monomials"

Connected through hyperedge HE-2 (induced by source paper "optimal p ary cyclic codes with two zeros"):
  with members:
    - "a class of optimal ternary cyclic codes and their duals"
    - "a class of three weight cyclic codes"
    - "optimal ternary cyclic codes from monomials"

Connected through hyperedge HE-3 (induced by source paper "some ternary cubic two weight codes"):
  with members:
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "five families of three weight ternary cyclic codes and their duals"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-4 (induced by source paper "a class of optimal ternary cyclic codes and their duals"):
  with members:
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "optimal ternary cyclic codes from monomials"
    - "hamming weights in irreducible cyclic codes"
    - "a triple error correcting cyclic code from the gold and kasami welch apn power functions"

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)