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: "list decoding algorithm based on voting in grobner bases for general one point ag codes"
  Abstract: We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya C a b curves proposed by Lee et al. (2012) to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capability and half the minimum distance lower bound by Andersen and Geil (2008) that has not been done in the original proposal except for one-point Hermitian codes, remove the unnecessary computational steps so that it can run faster, and analyze its computational complexity in terms of multiplications and divisions in the finite field. As a unique decoding algorithm, the proposed one is empirically and theoretically as fast as the BMS algorithm for one-point Hermitian codes. As a list decoding algorithm, extensive experiments suggest that it can be much faster for many moderate size/usual inputs than the algorithm by Beelen and Brander (2010). It should be noted that as a list decoding algorithm the proposed method seems to have exponential worst-case computational complexity while the previous proposals (Beelen and Brander, 2010; Guruswami and Sudan, 1999) have polynomial ones, and that the proposed method is expected to be slower than the previous proposals for very large/special inputs.

Connected through hyperedge HE-1 (induced by source paper "unique decoding of general ag codes"):
  with members:
    - "unique decoding of plane ag codes via interpolation"
    - "distance bounds for algebraic geometric codes"
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-2 (induced by source paper "feng rao decoding of primary codes"):
  with members:
    - "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"
    - "distance bounds for algebraic geometric codes"
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-3 (induced by source paper "list decoding algorithms based on groebner bases for general one point ag codes"):
  with members:
    - "generalization of the lee o sullivan list decoding for 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)