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 "on list decodability of random rank metric codes"):
  Abstract: In the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary $0 0$ ($\epsilon$ and $R$ are independent), if $0 0$ and any $0<\rho<1$, with high probability a random $F_q$-linear rank metric codes with rate $R=(1-\rho)(1-b\rho)-\epsilon$ can be list decoded up to a fraction $\rho$ of rank errors with constant list size $L$ satisfying $L\leq O(\exp(1/\epsilon))$.

Includes members:
  Member "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometric decoding of subspace codes with explicit schubert calculus applied to spread codes")
  Member "explicit rank metric codes list decodable with optimal redundancy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "row reduction applied to decoding of rank metric and subspace codes")
  Member "bounds on list decoding gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the list decodability of self orthogonal rank metric codes")
  Member "list decoding subspace codes from insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analog subspace coding a new approach to coding for non coherent wireless networks")
  Member "list decoding of subspace codes and rank metric codes up to singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "on the list decodability of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ldpc codes achieve list decoding capacity")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "packing and covering properties of rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multiple rate channel codes in texttt gf p n 2")

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)