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: "linear codes with two or three weights from quadratic bent functions"
  Abstract: Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field $\gf_p$, where $p$ is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined.

Connected through hyperedge HE-1 (induced by source paper "several classes of two weight and three weight linear codes"):
  with members:
    - "two weight and three weight linear codes based on weil sums"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "two weight and three weight linear codes based on weil sums"):
  with members:
    - "linear codes from some 2 designs"
    - "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"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

Connected through hyperedge HE-3 (induced by source paper "the parameters of a family of linear codes"):
  with members:
    - "infinite families of 2 designs and 3 designs from linear codes"
    - "linear codes from some 2 designs"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "a class of cyclotomic linear codes and their generalized hamming weights"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "complete weight enumerators of a family of three weight linear codes"
    - "the weight hierarchy of some reducible cyclic codes"
    - "linear codes from some 2 designs"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-5 (induced by source paper "complete weight enumerators of a family of three weight linear codes"):
  with members:
    - "complete weight enumerators of some linear codes"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "five families of three weight ternary cyclic codes and their duals"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-6 (induced by source paper "constant composition codes as subcodes of linear codes"):
  with members:
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of p ary cyclic codes and their weight enumerators"
    - "a class of three weight cyclic codes"
    - "a triple error correcting cyclic code from the gold and kasami welch apn power functions"

Connected through hyperedge HE-7 (induced by source paper "linear code derived from the primage of quadratic function"):
  with members:
    - "complete weight enumerators of a family of three weight linear codes"
    - "linear codes with two or three weights from some functions with low walsh spectrum in odd characteristic"
    - "complete weight enumerators of some linear codes"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of three weight cyclic codes"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-8 (induced by source paper "linear codes with a few weights from inhomogeneous quadratic functions"):
  with members:
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "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 linear codes with a few weights"

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)