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 random linear rank metric codes"):
  Abstract: The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linear rank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R = (1-\rho)(1-\frac{n}{m}\rho)-\varepsilon$ is shown to be (with high probability) list-decodable up to fractional radius $\rho \in (0,1)$ with lists of size at most $\frac{C_{\rho,q}}{\varepsilon}$, where $C_{\rho,q}$ is a constant depending only on $\rho$ and $q$. This matches the bound for random rank-metric codes (up to constant factors). The proof adapts the approach of Guruswami, H\aa stad, Kopparty (STOC 2010), who established a similar result for the Hamming metric case, to the rank-metric setting.

Includes members:
  Member "average radius list recovery of random linear codes it really ties the room together":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved decoding of folded reed solomon and multiplicity codes")
  Member "some gabidulin codes cannot be list decoded efficiently at any radius":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "randomized decoding of gabidulin codes beyond the unique decoding radius")
  Member "every list decodable code for high noise has abundant near optimal rate puncturings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "on the list decodability of random linear codes with large error rates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized list decoding")
  Member "bounds on list decoding gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the list decodability of self orthogonal rank metric codes")
  Member "on identity testing of tensors low rank recovery and compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for matrix factorization")
  Member "restricted isometry of fourier matrices and list decodability of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "one shot neural architecture search via compressive sensing")
  Member "on the list decodability of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ldpc codes achieve list decoding capacity")

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.CC(Computational Complexity)