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: "on the order bounds for one point ag codes"
  Abstract: The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [H. Andersen and O. Geil, Evaluation codes from order domain theory, Finite Fields and their Applications 14 (2008), pp. 92-123]. Here we investigate in detail the application of that bound to one-point algebraic geometry codes, obtaining a bound $d^*$ for the minimum distance of these codes. We establish a connection between $d^*$ and the order bound and its generalizations. We also study the improved code constructions based on $d^*$. Finally we extend $d^*$ to all generalized Hamming weights.

Connected through hyperedge HE-1 (induced by source paper "vard o hus codes polar codes based on castle curves kernels"):
  with members:
    - "algebraic properties of polar codes from a new polynomial formalism"
    - "the exponent of a polarizing matrix constructed from the kronecker product"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "isometry dual flags of ag codes"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"

Connected through hyperedge HE-3 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag codes"):
  with members:
    - "unique decoding of general ag codes"
    - "feng rao decoding of primary codes"
    - "generalization of the lee o sullivan list decoding for one point ag codes"
    - "list decoding algorithms based on groebner bases for general one point ag codes"
    - "a parametric approach to list decoding of reed solomon codes using interpolation"
    - "unique decoding of plane ag codes via interpolation"
    - "distance bounds for algebraic geometric codes"
    - "list decoding of hermitian codes using groebner bases"

Connected through hyperedge HE-4 (induced by source paper "new lower bounds on the generalized hamming weights of ag codes"):
  with members:
    - "an extension of massey scheme for secret sharing"
    - "on some invariants in numerical semigroups and estimations of the order bound"
    - "list decoding tensor products and interleaved codes"
    - "on semigroups generated by two consecutive integers and improved hermitian codes"

Connected through hyperedge HE-5 (induced by source paper "a note on the inheritance of the isometry dual property under puncturing ag codes"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"

Connected through hyperedge HE-6 (induced by source paper "improved constructions of nested code pairs"):
  with members:
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "xing ling codes duals of their subcodes and good asymmetric quantum codes"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "new quantum codes from evaluation and matrix product codes"
    - "feng rao decoding of primary codes"
    - "css like constructions of asymmetric quantum codes"

Connected through hyperedge HE-7 (induced by source paper "quantum error correcting codes from algebraic geometry codes of castle type"):
  with members:
    - "an introduction to algebraic geometry codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "quantum stabilizer codes from maximal curves"
    - "euclidean and hermitian self orthogonal algebraic geometry codes and their application to quantum codes"

Connected through hyperedge HE-8 (induced by source paper "an introduction to algebraic geometry codes"):
  with members:
    - "feng rao decoding of primary codes"
    - "distance bounds for algebraic geometric 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)