human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast computation of approximant bases in canonical form")
  Member "algorithms for simultaneous pade approximations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for applications")
  Member "sub quadratic decoding of one point hermitian codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants")
  Member "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "change of basis for m primary ideals in one and two variables")
  Member "coding for combined block symbol error correction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "power decoding of reed solomon codes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "power error locating pairs")
  Member "generalised multi sequence shift register synthesis using module minimisation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "on rational interpolation based list decoding and list decoding binary goppa codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on decoding and applications of interleaved goppa codes")

Question: Please tell me which class the source paper 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)