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 from monomials"
  Abstract: Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Perfect nonlinear monomials were employed to construct optimal ternary cyclic codes with parameters $[3^m-1, 3^m-1-2m, 4]$ by Carlet, Ding and Yuan in 2005. In this paper, almost perfect nonlinear monomials, and a number of other monomials over $\gf(3^m)$ are used to construct optimal ternary cyclic codes with the same parameters. Nine open problems on such codes are also presented.

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 with minimum distance four and five"

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 with minimum distance four and five"

Connected through hyperedge HE-3 (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 with minimum distance four and five"
    - "hamming weights in irreducible cyclic codes"
    - "a triple error correcting cyclic code from the gold and kasami welch apn power functions"

Connected through hyperedge HE-4 (induced by source paper "on the weight distributions of several classes of cyclic codes from apn monomials"):
  with members:
    - "a class of three weight cyclic codes"
    - "five families of three weight ternary cyclic codes and their duals"
    - "a triple error correcting cyclic code from the gold and kasami welch apn power functions"

Connected through hyperedge HE-5 (induced by source paper "optimal ternary cyclic codes with minimum distance four and five"):
  with members:
    - "hamming weights in irreducible cyclic codes"
    - "a triple error correcting cyclic code from the gold and kasami welch apn power functions"

Connected through hyperedge HE-6 (induced by source paper "five families of three weight ternary cyclic codes and their duals"):
  with members:
    - "the weight distributions of cyclic codes and elliptic 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)