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: "two weight and three weight linear codes based on weil sums"
  Abstract: Abstract   Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their weight distributions are determined using Weil sums. Some of the linear codes obtained are optimal or almost optimal with respect to the Griesmer bound.

Connected through hyperedge HE-1 (induced by source paper "weight hierarchies and weight distributions of two families of p ary linear codes"):
  with members:
    - "a note on the generalized hamming weights of reed muller codes"
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "the weight hierarchy of some reducible cyclic codes"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "several classes of two weight and three weight linear codes"):
  with members:
    - "a construction of binary linear codes from boolean functions"
    - "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"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of three weight 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)