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: "the weight distributions of two classes of p ary cyclic codes with few weights"
  Abstract: Cyclic codes have attracted a lot of research interest for decades as they have efficient encoding and decoding algorithms. In this paper, for an odd prime p, we investigate two classes of p-ary cyclic codes for special cases and determine their weight distributions explicitly. The results show that both codes have at most five nonzero weights.

Connected through hyperedge HE-1 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes"):
  with members:
    - "a note on the generalized hamming weights of reed muller codes"
    - "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-2 (induced by source paper "weight hierarchies and weight distributions of two families of p ary linear codes"):
  with members:
    - "two weight and three weight linear codes based on weil sums"
    - "a note on the generalized hamming weights of reed muller 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-3 (induced by source paper "weight distributions of six families of 3 weight binary linear codes"):
  with members:
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-4 (induced by source paper "complete weight enumerators of a class of linear codes with two or three weights"):
  with members:
    - "a construction of linear codes and their complete weight enumerators"
    - "complete weight enumerators of two classes of linear codes"
    - "linear codes from some 2 designs"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "weight hierarchies of a family of linear codes associated with 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"
    - "weight hierarchy of a class of linear codes relating to non degenerate quadratic forms"
    - "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 "complete weight distribution and macwilliams identities for asymmetric quantum codes"):
  with members:
    - "linear programming bounds for entanglement assisted quantum error correcting codes by split weight enumerators"
    - "a construction of linear codes and their complete weight enumerators"
    - "complete weight enumerators of two classes of linear codes"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

Connected through hyperedge HE-7 (induced by source paper "further factorization of x n 1 over a finite field"):
  with members:
    - "a construction of linear codes and their complete weight enumerators"
    - "complete weight enumerators of two classes of linear codes"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

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)