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 characterization of two weight projective cyclic codes"
  Abstract: We give necessary conditions for a two-weight projective cyclic code to be the direct sum of two one-weight irreducible cyclic subcodes of the same dimension, following the work of Wolfmann and Vega. This confirms Vega's conjecture that all the two-weight cyclic codes of this type are the known ones in the projective case.

Connected through hyperedge HE-1 (induced by source paper "several classes of cyclic codes with either optimal three weights or a few weights"):
  with members:
    - "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"
    - "linear codes from some 2 designs"
    - "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"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"):
  with members:
    - "several classes of cyclic codes with either optimal three weights or a few weights"
    - "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"

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)