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 the list decodability of self orthogonal rank metric codes"):
  Abstract: V. Guruswami and N. Resch prove that the list decodability of $\mathbb{F}_q$-linear rank metric codes is as good as that of random rank metric codes in~\cite{venkat2017}. Due to the potential applications of self-orthogonal rank metric codes, we focus on list decoding of them. In this paper, we prove that with high probability, an $\F_q$-linear self-orthogonal rank metric code over $\mathbb{F}_q^{n\times m}$ of rate $R=(1-\tau)(1-\frac{n}{m}\tau)-\epsilon$ is shown to be list decodable up to fractional radius $\tau\in(0,1)$ and small $\epsilon\in(0,1)$ with list size depending on $\tau$ and $q$ at most $O_{\tau, q}(\frac{1}{\epsilon})$. In addition, we show that an $\mathbb{F}_{q^m}$-linear self-orthogonal rank metric code of rate up to the Gilbert-Varshamov bound is $(\tau n, \exp(O_{\tau, q}(\frac{1}{\epsilon})))$-list decodable.

Includes members:
  Member "on the list decodability of random linear rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved list decodability of random linear binary codes")
  Member "on the list decodability of random self orthogonal codes":
    also connected through other hyperedges:
      (none)
  Member "on self dual mrd codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "partitions of matrix spaces with an application to q rook polynomials")
  Member "bounds on list decoding of rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "bounds on list decoding gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the list decodability of random linear rank metric codes")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)