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 "approximate message passing with spatially coupled structured operators with applications to compressed sensing and sparse superposition codes"):
  Abstract: We study the behavior of approximate message-passing (AMP), a solver for linear sparse estimation problems such as compressed sensing, when the i.i.d matrices—for which it has been specifically designed—are replaced by structured operators, such as Fourier and Hadamard ones. We show empirically that after proper randomization, the structure of the operators does not significantly affect the performances of the solver. Furthermore, for some specially designed spatially coupled operators, this allows a computationally fast and memory efficient reconstruction in compressed sensing up to the information-theoretical limit. We also show how this approach can be applied to sparse superposition codes, allowing the AMP decoder to perform at large rates for moderate block length.

Includes members:
  Member "phase transitions and sample complexity in bayes optimal matrix factorization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ssfn self size estimating feed forward network with low complexity limited need for human intervention and consistent behaviour across trials")
  Member "compressive phase retrieval via generalized approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "properties of spatial coupling in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding")
  Member "replica analysis and approximate message passing decoder for superposition codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sparse regression codes")
  Member "a simple proof of threshold saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "subsampling at information theoretically optimal rates":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximate message passing decoder and capacity achieving sparse superposition codes")
  Member "compressed sensing of approximately sparse signals phase transitions and optimal reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximate message passing decoder and capacity achieving sparse superposition codes")

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)