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: "generalization of the lee o sullivan list decoding for one point ag codes"
  Abstract: Abstract   We generalize the list decoding algorithm for Hermitian codes proposed by  Lee and OʼSullivan (2009)  based on Grobner bases to general one-point AG codes, under an assumption weaker than one used by  Beelen and Brander (2010) . Our generalization enables us to apply the fast algorithm to compute a Grobner basis of a module proposed by  Lee and OʼSullivan (2009) , which was not possible in another generalization by  Lax (2012) .

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"
    - "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"
    - "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 "list decoding algorithms based on groebner bases for general one point 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 revisited"
    - "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"

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)