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 "maximin analysis of message passing algorithms for recovering block sparse signals"):
  Abstract: We consider the problem of recovering a block (or group) sparse signal from an underdetermined set of random linear measurements, which appear in compressed sensing applications such as radar and imaging. Recent results of Donoho, Johnstone, and Montanari have shown that approximate message passing (AMP) in combination with Stein's shrinkage outperforms group LASSO for large block sizes. In this paper, we prove that, for a fixed block size and in the strong undersampling regime (i.e., having very few measurements compared to the ambient dimension), AMP cannot improve upon group LASSO, thereby complementing the results of Donoho et al.

Includes members:
  Member "approximate message passing with consistent parameter estimation and applications to sparse learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "living near the edge a lower bound on the phase transition of total variation minimization")
  Member "asymptotic analysis of complex lasso via complex approximate message passing camp":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal errors and phase transitions in high dimensional generalized linear models")
  Member "message passing algorithms for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "block length dependent thresholds in block sparse compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "precise error analysis of regularized m estimators in high dimensions")
  Member "consistency of the group lasso and multiple kernel learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint user selection and precoding in multiuser mimo systems via group lasso")

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)