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 "asymptotic mmse analysis under sparse representation modeling"):
  Abstract: Compressed sensing is a signal processing technique in which data is acquired directly in a compressed form. There are two modeling approaches that can be considered: the worst-case (Hamming) approach and a statistical mechanism, in which the signals are modeled as random processes rather than as individual sequences. In this paper, the second approach is studied. In particular, we consider a model of the form $\boldsymbol{Y} = \boldsymbol{H}\boldsymbol{X}+\boldsymbol{W}$, where each comportment of $\boldsymbol{X}$ is given by $X_i = S_iU_i$, where $\left\{U_i\right\}$ are i.i.d. Gaussian random variables, and $\left\{S_i\right\}$ are binary random variables independent of $\left\{U_i\right\}$, and not necessarily independent and identically distributed (i.i.d.), $\boldsymbol{H}\in\mathbb{R}^{k\times n}$ is a random matrix with i.i.d. entries, and $\boldsymbol{W}$ is white Gaussian noise. Using a direct relationship between optimum estimation and certain partition functions, and by invoking methods from statistical mechanics and from random matrix theory (RMT), we derive an asymptotic formula for the minimum mean-square error (MMSE) of estimating the input vector $\boldsymbol{X}$ given $\boldsymbol{Y}$ and $\boldsymbol{H}$, as $k,n\to\infty$, keeping the measurement rate, $R = k/n$, fixed. In contrast to previous derivations, which are based on the replica method, the analysis carried out in this paper is rigorous.

Includes members:
  Member "analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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 "signal recovery using expectation consistent approximation for linear observations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "macroscopic analysis of vector approximate message passing in a model mismatch setting")
  Member "analysis of mismatched estimation errors using gradients of partition functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gaussian intersymbol interference channels with mismatch")
  Member "performance regions in compressed sensing from noisy measurements":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance limits with additive error metrics in noisy multimeasurement vector problems")
  Member "support recovery with sparsely sampled free random matrices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "large system analysis of linear precoding in correlated miso broadcast channels under limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "covariance aided csi acquisition with non orthogonal pilots in massive mimo a large system performance analysis")
  Member "a deterministic equivalent for the analysis of non gaussian correlated mimo multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "data aided secure massive mimo transmission under the pilot contamination attack")
  Member "information theoretically optimal compressed sensing via spatial coupling and approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)