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 "decoding high order interleaved rank metric codes"):
  Abstract: This paper presents an algorithm for decoding homogeneous interleaved codes of high interleaving order in the rank metric. The new decoder is an adaption of the Hamming-metric decoder by Metzner and Kapturowski (1990) and guarantees to correct all rank errors of weight up to $d-2$ whose rank over the large base field of the code equals the number of errors, where $d$ is the minimum rank distance of the underlying code. In contrast to previously-known decoding algorithms, the new decoder works for any rank-metric code, not only Gabidulin codes. It is purely based on linear-algebraic computations, and has an explicit and easy-to-handle success condition. Furthermore, a lower bound on the decoding success probability for random errors of a given weight is derived. The relation of the new algorithm to existing interleaved decoders in the special case of Gabidulin codes is given.

Includes members:
  Member "on error decoding of locally repairable and partial mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "partial mds codes with local regeneration")
  Member "on decoding and applications of interleaved goppa codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "improved power decoding of interleaved one point hermitian codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "on a rank metric code based cryptosystem with small key size":
    also connected through other hyperedges:
      (none)
  Member "a public key cryptosystem from interleaved goppa codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "repairing the faure loidreau public key cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interleaving loidreau s rank metric cryptosystem")
  Member "fast multiplication for skew polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing the characteristic polynomial of a finite rank two drinfeld module")
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")

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)