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 "performance analysis of approximate message passing for distributed compressed sensing"):
  Abstract: Bayesian approximate message passing (BAMP) is an efficient method in compressed sensing that is nearly optimal in the minimum mean squared error (MMSE) sense. Bayesian approximate message passing (BAMP) performs joint recovery of multiple vectors with identical support and accounts for correlations in the signal of interest and in the noise. In this paper, we show how to reduce the complexity of vector BAMP via a simple joint decorrelation diagonalization) transform of the signal and noise vectors, which also facilitates the subsequent performance analysis. We prove that BAMP and the corresponding state evolution (SE) are equivariant with respect to the joint decorrelation transform and preserve diagonality of the residual noise covariance for the Bernoulli-Gauss (BG) prior. We use these results to analyze the dynamics and the mean squared error (MSE) performance of BAMP via the replica method, and thereby understand the impact of signal correlation and number of jointly sparse signals.

Includes members:
  Member "analysis of approximate message passing with a class of non separable denoisers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of approximate message passing with non separable denoisers and markov random field priors")
  Member "approximate message passing decoder and capacity achieving sparse superposition codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "performance limits for noisy multimeasurement vector problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploiting prior information in block sparse signals")
  Member "hybrid approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "state evolution for approximate message passing with non separable functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")
  Member "the replica symmetric prediction for compressed sensing with gaussian matrices is exact":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "omp based joint sparsity pattern recovery under communication constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decentralized and collaborative subspace pursuit a communication efficient algorithm for joint sparsity pattern recovery with sensor networks")
  Member "efficient high dimensional inference in the multiple measurement vector problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "inference in multi layer networks with matrix valued unknowns")

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)