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: "unique decoding of general ag codes"
  Abstract: A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it retains the same advantages of fast speed, regular structure, and direct message recovery. Upon this generalization, we add a technique from the Guruswami-Sudan list decoding that boosts the decoding speed significantly. Compared with other known decoding algorithms for general AG codes, it has a similar decoding performance and allows streamlined practical implementation by its simple and regular structure.

Connected through hyperedge HE-1 (induced by source paper "improved power decoding of interleaved one point hermitian codes"):
  with members:
    - "improved power decoding of one point hermitian codes"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "sub quadratic decoding of one point hermitian codes"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"
    - "new list decoding algorithms for reed solomon and bch codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-2 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag codes"):
  with members:
    - "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"
    - "on the order bounds for one point ag codes"
    - "list decoding of hermitian codes using groebner bases"

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