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 "compressed sensing performance analysis via replica method using bayesian framework"):
  Abstract: Compressive sensing (CS) is a new methodology to capture signals at lower rate than the Nyquist sampling rate when the signals are sparse or sparse in some domain. The performance of CS estimators is analyzed in this paper using tools from statistical mechanics, especially called replica method. This method has been used to analyze communication systems like Code Division Multiple Access (CDMA) and multiple input multi- ple output (MIMO) systems with large size. Replica analysis, now days rigorously proved, is an efficient tool to analyze large systems in general. Specifically, we analyze the performance of some of the estimators used in CS like LASSO (the Least Absolute Shrinkage and Selection Operator) estimator and Zero-Norm regularizing estimator as a special case of maximum a posteriori (MAP) estimator by using Bayesian framework to connect the CS estimators and replica method. We use both replica symmetric (RS) ansatz and one-step replica symmetry breaking (1RSB) ansatz, clamming the latter is efficient when the problem is not convex. This work is more analytical in its form. It is deferred for next step to focus on the numerical results.

Includes members:
  Member "applications of large random matrices in communications engineering":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure regularized zero forcing for multiuser mimome channels")
  Member "support recovery with sparsely sampled free random matrices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bilinear recovery using adaptive vector amp")
  Member "asymptotic analysis of map estimation via the replica method and applications to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "information theoretically optimal compressed sensing via spatial coupling and approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "asymptotic analysis of complex lasso via complex approximate message passing camp":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal errors and phase transitions in high dimensional generalized linear models")
  Member "vector precoding for gaussian mimo broadcast channels impact of replica symmetry breaking":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymptotic analysis of map estimation via the replica method and applications to compressed sensing")
  Member "estimation with random linear mixing belief propagation and compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "statistical physics and information theory perspectives on linear inverse problems")
  Member "statistical mechanical analysis of compressed sensing utilizing correlated compression matrix":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "analysis of sparse representations using bi orthogonal dictionaries")

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)