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: "distance bounds for algebraic geometric codes"
  Abstract: Various methods have been used to obtain improvements of the Goppa lower bound for the minimum distance of an algebraic geometric code. The main methods divide into two categories and all but a few of the known bounds are special cases of either the Lundell-McCullough floor bound or the Beelen order bound. The exceptions are recent improvements of the floor bound by Guneri-Stichtenoth-Taskin, and Duursma-Park, and of the order bound by Duursma-Park and Duursma-Kirov. In this paper we provide short proofs for all floor bounds and most order bounds in the setting of the van Lint and Wilson AB method. Moreover, we formulate unifying theorems for order bounds and formulate the DP and DK order bounds as natural but different generalizations of the Feng-Rao bound for one-point codes.

Connected through hyperedge HE-1 (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"
    - "on the order bounds for one point ag codes"
    - "list decoding of hermitian codes using groebner bases"

Connected through hyperedge HE-2 (induced by source paper "two point codes for the generalized gk curve"):
  with members:
    - "multi point codes from the ggs curves"

Connected through hyperedge HE-3 (induced by source paper "an introduction to algebraic geometry codes"):
  with members:
    - "feng rao decoding of primary codes"
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-4 (induced by source paper "matrix theory for minimal trellises"):
  with members:
    - "characteristic generators and dualization for tail biting trellises"
    - "linear tail biting trellises characteristic generators and the bcjr construction"

Connected through hyperedge HE-5 (induced by source paper "unique decoding of general ag codes"):
  with members:
    - "list decoding algorithm based on voting in grobner bases for general one point ag codes"
    - "unique decoding of plane ag codes via interpolation"
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-6 (induced by source paper "feng rao decoding of primary codes"):
  with members:
    - "list decoding algorithm based on voting in grobner bases for general one point ag codes"
    - "unique decoding of plane ag codes revisited"
    - "list decoding algorithms based on groebner bases for general one point ag codes"
    - "unique decoding of plane ag codes via interpolation"
    - "weighted reed muller codes revisited"
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-7 (induced by source paper "improved two point codes on hermitian curves"):
  with members:
    - "on semigroups generated by two consecutive integers and improved hermitian 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)