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: "generalized hamming weights of irreducible cyclic codes"
  Abstract: The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23] in 1991. In this paper two general formulas on $d_r(C)$ for irreducible cyclic codes are presented by using Gauss sums and the weight hierarchy $\{d_1(C), d_2(C), \ldots, d_k(C)\}$ $(k=\dim C)$ are completely determined for several cases.

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 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"

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 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"

Connected through hyperedge HE-3 (induced by source paper "generalized pair weights of linear codes and macwilliams extension theorem"):
  with members:
    - "constacyclic symbol pair codes lower bounds and optimal constructions"

Connected through hyperedge HE-4 (induced by source paper "two classes of linear codes and their generalized hamming weights"):
  with members:
    - "a note on the generalized hamming weights of reed muller codes"
    - "a class of cyclotomic linear codes and their generalized hamming weights"
    - "the weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes"
    - "on the weight hierarchy of locally repairable codes"
    - "the second generalized hamming weight of some evaluation codes arising from a projective torus"
    - "the weight hierarchy of some reducible cyclic codes"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-5 (induced by source paper "linear codes over signed graphs"):
  with members:
    - "generalized hamming weights for almost affine codes"

Connected through hyperedge HE-6 (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 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"

Connected through hyperedge HE-7 (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"
    - "linear codes with two or three weights from quadratic bent functions"

Connected through hyperedge HE-8 (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"
    - "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"
    - "a class of two weight and three weight codes and their applications in secret sharing"

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)