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 error locating pairs"):
  Abstract: We present a new decoding algorithm based on error locating pairs and correcting an amount of errors exceeding the half minimum distance. This algorithm applies to Reed--Solomon codes, algebraic geometry codes and any other code benefiting from an error correcting pair. When applied to Reed--Solomon or algebraic geometry codes, the algorithm's decoding radius turns out to be the same as Sudan's or power decoding algorithm. Similarly to power decoding it boils down to linear algebra, returns at most one solution and might fail in some rare cases. On the other hand it presents the advantage to have a smaller space and time complexity than power decoding.

Includes members:
  Member "sub quadratic decoding of one point hermitian codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants")
  Member "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squares of matrix product codes")
  Member "power decoding of reed solomon codes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decoding of interleaved reed solomon codes using improved power decoding")
  Member "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "collaborative decoding of interleaved reed solomon codes and concatenated code designs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for applications")
  Member "maximum likelihood decoding of reed solomon codes is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "randomized decoding of gabidulin codes beyond the unique decoding radius")

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)