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: "several classes of cyclic codes with either optimal three weights or a few weights"
  Abstract: Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction of cyclic codes. As applications, we obtain a class of optimal three-weight codes achieving the Griesmer bound, which generalizes a Vega's result in \cite{V1}, and several classes of cyclic codes with only a few weights, which solve the open problem in \cite{V1}.

Connected through hyperedge HE-1 (induced by source paper "a class of functions with low valued walsh spectrum"):
  with members:
    - "binary sequences with three valued cross correlations of different lengths"
    - "the weight enumerator of three families of cyclic codes"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "some new results on the cross correlation of m sequences"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "optimal linear codes constant weight codes and constant composition codes over bbb f_ q"):
  with members:
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "evaluation of the hamming weights of a class of linear codes based on gauss sums"
    - "a class of three weight cyclic codes"
    - "a construction for constant composition codes"

Connected through hyperedge HE-3 (induced by source paper "an extended characterization of a class of optimal three weight cyclic codes over any finite field"):
  with members:
    - "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"

Connected through hyperedge HE-4 (induced by source paper "evaluation of the hamming weights of a class of linear codes based on gauss sums"):
  with members:
    - "a construction of linear codes over f_ 2 t from boolean functions"
    - "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of three weight and five weight linear codes"
    - "linear codes with two or three weights from weakly regular bent functions"

Connected through hyperedge HE-5 (induced by source paper "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"):
  with members:
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "on the weight distributions of several classes of cyclic codes from apn monomials"
    - "a characterization of two weight projective cyclic codes"

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)