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 "derandomized compressed sensing with nonuniform guarantees for 120001 1 recovery"):
  Abstract: We extend the techniques of Hugel, Rauhut and Strohmer (Found. Comput. Math., 2014) to show that for every $\delta\in(0,1]$, there exists an explicit random $m\times N$ partial Fourier matrix $A$ with $m=s\operatorname{polylog}(N/\epsilon)$ and entropy $s^\delta\operatorname{polylog}(N/\epsilon)$ such that for every $s$-sparse signal $x\in\mathbb{C}^N$, there exists an event of probability at least $1-\epsilon$ over which $x$ is the unique minimizer of $\|z\|_1$ subject to $Az=Ax$. The bulk of our analysis uses tools from decoupling to estimate the extreme singular values of the submatrix of $A$ whose columns correspond to the support of $x$.

Includes members:
  Member "kesten mckay law for random subensembles of paley equiangular tight frames":
    also connected through other hyperedges:
      (none)
  Member "random subsets of structured deterministic frames have manova spectra":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "kesten mckay law for random subensembles of paley equiangular tight frames")
  Member "average case hardness of rip certification":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximately certifying the restricted isometry property is hard")
  Member "the restricted isometry property of subsampled fourier matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "one shot neural architecture search via compressive sensing")
  Member "living on the edge phase transitions in convex programs with random data":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "compressed sensing with sparse binary matrices instance optimal error guarantees in near optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sparse graph codes for non adaptive quantitative group testing")
  Member "kirkman equiangular tight frames and codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coherence optimization and best complex antipodal spherical codes")
  Member "sharp rip bound for sparse signal and low rank matrix recovery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a deterministic convergence framework for exact non convex phase retrieval")

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)