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 "on sparse vector recovery performance in structurally orthogonal matrices via lasso"):
  Abstract: In this paper, we consider a compressed sensing problem of reconstructing a sparse signal from an undersampled set of noisy linear measurements. The regularized least squares or least absolute shrinkage and selection operator (LASSO) formulation is used for signal estimation. The measurement matrix is assumed to be constructed by concatenating several randomly orthogonal bases, referred to as structurally orthogonal matrices. Such measurement matrix is highly relevant to large-scale compressive sensing applications because it facilitates fast computation and also supports parallel processing. Using the replica method from statistical physics, we derive the mean-squared-error (MSE) formula of reconstruction over the structurally orthogonal matrix in the large-system regime. Extensive numerical experiments are provided to verify the analytical result. We then use the analytical result to study the MSE behaviors of LASSO over the structurally orthogonal matrix, with a particular focus on performance comparisons to matrices with independent and identically distributed (i.i.d.) Gaussian entries. We demonstrate that the structurally orthogonal matrices are at least as well performed as their i.i.d. Gaussian counterparts, and therefore the use of structurally orthogonal matrices is highly motivated in practical applications.

Includes members:
  Member "approximate message passing decoder and capacity achieving sparse superposition codes":
    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 "generalized turbo signal recovery for nonlinear measurements and orthogonal sensing matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spectral method for phase retrieval an expectation propagation perspective")
  Member "multi processor approximate message passing using lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "statistical physics and information theory perspectives on linear inverse problems")
  Member "turbo compressed sensing with partial dft sensing matrix":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "macroscopic analysis of vector approximate message passing in a model mismatch setting")
  Member "isotropically random orthogonal matrices performance of lasso and minimum conic singular values":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing")
  Member "approximate message passing with spatially coupled structured operators with applications to compressed sensing and sparse superposition codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "on the performance of turbo signal recovery with partial dft sensing matrices":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "structured turbo compressed sensing for downlink massive mimo ofdm channel estimation")

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)