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 "message passing algorithms for compressed sensing"):
  Abstract: Compressed sensing aims to undersample certain high-dimensional signals yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a known basis. Currently, the best known sparsity–undersampling tradeoff is achieved when reconstructing by convex optimization, which is expensive in important large-scale applications. Fast iterative thresholding algorithms have been intensively studied as alternatives to convex optimization for large-scale problems. Unfortunately known fast algorithms offer substantially worse sparsity–undersampling tradeoffs than convex optimization. We introduce a simple costless modification to iterative thresholding making the sparsity–undersampling tradeoff of the new algorithms equivalent to that of the corresponding convex optimization procedures. The new iterative-thresholding algorithms are inspired by belief propagation in graphical models. Our empirical measurements of the sparsity–undersampling tradeoff for the new algorithms agree with theoretical calculations. We show that a state evolution formalism correctly derives the true sparsity–undersampling tradeoff. There is a surprising agreement between earlier calculations based on random convex polytopes and this apparently very different theoretical formalism.

Includes members:
  Member "asymptotic analysis of map estimation via the replica method and applications to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "the dynamics of message passing on dense graphs with applications to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "a typical reconstruction limit of compressed sensing based on lp norm minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "understanding overfitting peaks in generalization error analytical risk curves for l 2 and l 1 penalized interpolation")
  Member "on the iterative decoding of high rate ldpc codes with applications in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ldpc codes for compressed sensing")
  Member "subspace pursuit for compressive sensing signal reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compressive sensing for cut improvement and local clustering")
  Member "efficient and robust compressed sensing using high quality expander graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "vanishingly sparse matrices and expander graphs with application to compressed sensing")
  Member "max product for maximum weight matching convergence correctness and lp duality":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "my fair bandit distributed learning of max min fairness with multi player bandits")
  Member "bayesian compressive sensing via belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "nonlinear function estimation with empirical bayes and approximate message passing")

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)