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 "universal compressed sensing"):
  Abstract: In this paper, the problem of developing universal algorithms for compressed sensing of stochastic processes is studied. First, R\'enyi's notion of information dimension (ID) is generalized to analog stationary processes. This provides a measure of complexity for such processes and is connected to the number of measurements required for their accurate recovery. Then a minimum entropy pursuit (MEP) optimization approach is proposed, and it is proven that it can reliably recover any stationary process satisfying some mixing constraints from sufficient number of randomized linear measurements, without having any prior information about the distribution of the process. It is proved that a Lagrangian-type approximation of the MEP optimization problem, referred to as Lagrangian-MEP problem, is identical to a heuristic implementable algorithm proposed by Baron et al. It is shown that for the right choice of parameters the Lagrangian-MEP algorithm, in addition to having the same asymptotic performance as MEP optimization, is also robust to the measurement noise. For memoryless sources with a discrete-continuous mixture distribution, the fundamental limits of the minimum number of required measurements by a non-universal compressed sensing decoder is characterized by Wu et al. For such sources, it is proved that there is no loss in universal coding, and both the MEP and the Lagrangian-MEP asymptotically achieve the optimal performance.

Includes members:
  Member "minimum complexity pursuit for universal compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "solving inverse problems via auto encoders")
  Member "signal recovery on incoherent manifolds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algorithmic aspects of inverse problems using generative models")
  Member "recovery from linear measurements with complexity matching universal signal estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nonlinear function estimation with empirical bayes and approximate message passing")
  Member "stable image reconstruction using total variation minimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")
  Member "minimum complexity pursuit stability analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from compression to compressed sensing")
  Member "sampling and recovery of pulse streams":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "optimal phase transitions in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal errors and phase transitions in high dimensional generalized linear models")
  Member "minimum complexity pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "statistical physics and information theory perspectives on linear inverse problems")

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)