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: "complete weight enumerators of a family of three weight linear codes"
  Abstract: Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we present the explicit complete weight enumerator of a family of p-ary linear codes constructed with defining set. The weight enumerator is an immediate result of the complete weight enumerator, which shows that the codes proposed in this paper are three-weight linear codes. Additionally, all nonzero codewords are minimal and thus they are suitable for secret sharing.

Connected through hyperedge HE-1 (induced by source paper "minimal linear codes constructed from functions"):
  with members:
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "two new families of two weight codes"
    - "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 weakly regular bent functions"

Connected through hyperedge HE-2 (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"
    - "the weight hierarchy of some reducible cyclic codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-3 (induced by source paper "a construction of linear codes and their complete weight enumerators"):
  with members:
    - "a class of three weight linear codes and their complete weight enumerators"
    - "complete weight enumerators of some linear codes"
    - "complete weight enumerators of two classes of linear codes"
    - "linear codes from some 2 designs"
    - "a class of three weight and five weight linear codes"
    - "a class of linear codes with three weights"
    - "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 three weight linear codes and their complete weight enumerators"):
  with members:
    - "complete weight enumerators of two classes of 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"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-5 (induced by source paper "weight hierarchy of a class of linear codes relating to non degenerate quadratic forms"):
  with members:
    - "a class of cyclotomic linear codes and their generalized hamming weights"
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "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-6 (induced by source paper "linear code derived from the primage of quadratic function"):
  with members:
    - "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"
    - "linear codes with two or three weights from quadratic bent functions"
    - "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-7 (induced by source paper "complete weight enumerators of two classes of linear codes"):
  with members:
    - "a class of three weight linear codes and their complete weight enumerators"
    - "complete weight enumerators of some linear codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of linear codes with three weights"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of three weight cyclic codes"
    - "five families of three weight ternary cyclic codes and their duals"

Connected through hyperedge HE-8 (induced by source paper "a class of linear codes with three weights"):
  with members:
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "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"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "hamming weights in irreducible 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)