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 "sparse recovery in wigner d basis expansion"):
  Abstract: We are concerned with the recovery of $s-$sparse Wigner-D expansions in terms of $N$ Wigner-D functions. Considered as a generalization of spherical harmonics, Wigner-D functions are eigenfunctions of Laplace-Beltrami operator and form an orthonormal system. However, since they are not uniformly bounded, the existing results on BOS do not apply. Using previously introduced preconditioning technique, a new orthonormal and bounded system is obtained for which RIP property can be established. We show that the number of sufficient samples for sparse recovery scales with ${N}^{1/6} \,s\, \log^3(s) \,\log(N)$. The phase transition diagram for this problem is also presented. We will also discuss the application of our results in the spherical near-field antenna measurement.

Includes members:
  Member "discrete uncertainty principles and sparse signal processing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic sparse fourier transform with an ell_infty guarantee")
  Member "restricted isometry of fourier matrices and list decodability of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "one shot neural architecture search via compressive sensing")
  Member "new constructions of rip matrices with fast multiplication and fewer rows":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "race sub linear memory sketches for approximate near neighbor search on streaming data")

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)