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: "new lower bounds on the generalized hamming weights of ag codes"
  Abstract: A sharp upper bound for the maximum integer not belonging to an ideal of a numerical semigroup is given and the ideals attaining this bound are characterized. Then the result is used, through the so-called Feng-Rao numbers, to bound the generalized Hamming weights of algebraic-geometry codes. This is further developed for Hermitian codes and the codes on one of the Garcia-Stichtenoth towers, as well as for some more general families.

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"
    - "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 "isometry dual flags of ag codes"):
  with members:
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-3 (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"
    - "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"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-4 (induced by source paper "a class of cyclotomic linear codes and their generalized hamming weights"):
  with members:
    - "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"
    - "generalized hamming weights of irreducible cyclic codes"

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"
    - "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"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-6 (induced by source paper "on asymptotically good ramp secret sharing schemes"):
  with members:
    - "squares of random linear codes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "new asymptotic metrics for relative generalized hamming weight"
    - "strongly secure ramp secret sharing schemes for general access structures"

Connected through hyperedge HE-7 (induced by source paper "a note on the inheritance of the isometry dual property under puncturing ag codes"):
  with members:
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-8 (induced by source paper "the second generalized hamming weight of some evaluation codes arising from a projective torus"):
  with members:
    - "generalized hamming weights for almost affine codes"
    - "generalized hamming weights of irreducible cyclic codes"
    - "on the second hamming weight of some reed muller type 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)