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: "power decoding reed solomon codes up to the johnson radius"
  Abstract: Power decoding, or "decoding using virtual interleaving" is a technique for decoding Reed-Solomon codes up to the Sudan radius. Since the method's inception, it has been a tantalising goal to incorporate multiplicities, the parameter allowing the Guruswami-Sudan algorithm to decode up to the Johnson radius. In this paper we show how this can be done, and describe how to efficiently solve the resulting key equations.

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

Connected through hyperedge HE-3 (induced by source paper "improved power decoding of one point hermitian codes"):
  with members:
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "algorithms for simultaneous pade approximations"
    - "sub quadratic decoding of one point hermitian codes"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"

Connected through hyperedge HE-4 (induced by source paper "row reduction applied to decoding of rank metric and subspace codes"):
  with members:
    - "low rank matrix recovery using gabidulin codes in characteristic zero"
    - "decoding interleaved gabidulin codes using alekhnovich s algorithm"
    - "an alternative decoding method for gabidulin codes in characteristic zero"
    - "sub quadratic decoding of one point hermitian codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "solving shift register problems over skew polynomial rings using module minimisation"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "generalised multi sequence shift register synthesis using module minimisation"

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)