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 rational interpolation based list decoding and list decoding binary goppa codes"
  Abstract: We derive the Wu list-decoding algorithm for generalized Reed-Solomon (GRS) codes by using Grobner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp-Massey algorithm. We present a novel method for constructing the interpolation polynomial fast. We give a new application of the Wu list decoder by decoding irreducible binary Goppa codes up to the binary Johnson radius. Finally, we point out a connection between the governing equations of the Wu algorithm and the Guruswami-Sudan algorithm, immediately leading to equality in the decoding range and a duality in the choice of parameters needed for decoding, both in the case of GRS codes and in the case of Goppa codes.

Connected through hyperedge HE-1 (induced by source paper "on decoding and applications of interleaved goppa codes"):
  with members:
    - "a public key cryptosystem from interleaved goppa codes"
    - "generalization of the ball collision algorithm"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "list decoding of binary goppa codes up to the binary johnson bound"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-2 (induced by source paper "algebraic soft decoding of reed solomon codes using module minimization"):
  with members:
    - "power decoding reed solomon codes up to the johnson radius"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "multi trial guruswami sudan decoding for generalised reed solomon codes"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"
    - "the re encoding transformation in algebraic list decoding of reed solomon codes"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "decoding generalized reed solomon codes and its application to rlce encryption schemes"):
  with members:
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "power decoding reed solomon codes up to the johnson radius"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"

Connected through hyperedge HE-4 (induced by source paper "local list recovery of high rate tensor codes and applications"):
  with members:
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"

Connected through hyperedge HE-5 (induced by source paper "power decoding reed solomon codes up to the johnson radius"):
  with members:
    - "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"
    - "algorithms for simultaneous pade approximations"
    - "sub quadratic decoding of one point hermitian codes"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "coding for combined block symbol error correction"
    - "power decoding of reed solomon codes revisited"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"

Connected through hyperedge HE-6 (induced by source paper "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"
    - "the re encoding transformation in algebraic list decoding of reed solomon codes"
    - "efficient interpolation in the guruswami sudan algorithm"
    - "new list decoding algorithms for reed solomon and bch codes"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-7 (induced by source paper "multi trial guruswami sudan decoding for generalised reed solomon codes"):
  with members:
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"
    - "the re encoding transformation in algebraic list decoding of reed solomon codes"

Connected through hyperedge HE-8 (induced by source paper "reduced list decoding of reed solomon codes using reliability information"):
  with members:
    - "new list decoding algorithms for reed solomon and bch 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)