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 "precise error analysis of regularized m estimators in high dimensions"):
  Abstract: A popular approach for estimating an unknown signal from noisy, linear measurements is via solving a so called \emph{regularized M-estimator}, which minimizes a weighted combination of a convex loss function and of a convex (typically, non-smooth) regularizer. We accurately predict the squared error performance of such estimators in the high-dimensional proportional regime. The random measurement matrix is assumed to have entries iid Gaussian, only minimal and rather mild regularity conditions are imposed on the loss function, the regularizer, and on the noise and signal distributions. We show that the error converges in probability to a nontrivial limit that is given as the solution to a minimax convex-concave optimization problem on four scalar optimization variables. We identify a new summary parameter, termed the Expected Moreau envelope to play a central role in the error characterization. The \emph{precise} nature of the results permits an accurate performance comparison between different instances of regularized M-estimators and allows to optimally tune the involved parameters (e.g. regularizer parameter, number of measurements). The key ingredient of our proof is the \emph{Convex Gaussian Min-max Theorem} (CGMT) which is a tight and strengthened version of a classical Gaussian comparison inequality that was proved by Gordon in 1988.

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 "ber analysis of the box relaxation for bpsk signal recovery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal data detection in large mimo")
  Member "convex recovery of a structured signal from independent random linear measurements":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")
  Member "isotropically random orthogonal matrices performance of lasso and minimum conic singular values":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing")
  Member "the generalized lasso with non linear observations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")
  Member "corrupted sensing novel guarantees for separating structured signals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gradient descent with early stopping is provably robust to label noise for overparameterized neural networks")
  Member "statistical estimation from denoising to sparse regression and hidden cliques":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "contextual stochastic block models")
  Member "convexity in source separation models geometry and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "nonconvex regularization based sparse and low rank recovery in signal processing statistics and machine learning")

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)