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 "randomized decoding of gabidulin codes beyond the unique decoding radius"):
  Abstract: We address the problem of decoding Gabidulin codes beyond their error-correcting radius. The complexity of this problem is of importance to assess the security of some rank-metric code-based cryptosystems. We propose an approach that introduces row or columns erasures to decrease the rank of the error in order to use any proper polynomial-time Gabidulin code error-erasure decoding algorithm. This approach improves on generic rank-metric decoders by an exponential factor.

Includes members:
  Member "on the list decodability of rank metric codes":
    also connected through other hyperedges:
      (none)
  Member "ramesses a rank metric encryption scheme with short keys":
    also connected through other hyperedges:
      (none)
  Member "an algebraic attack on rank metric code based cryptosystems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis")
  Member "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "some gabidulin codes cannot be list decoded efficiently at any radius":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "repairing the faure loidreau public key cryptosystem")
  Member "bounds on list decoding of rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "on the complexity of the rank syndrome decoding problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algebraic attacks for solving the rank decoding and minrank problems without gr obner basis")
  Member "a basis for all solutions of the key equation for gabidulin codes":
    also connected through other hyperedges:
      (none)

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)