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 "maximum a posteriori signal recovery with prior information applications to compressive sensing"):
  Abstract: This paper studies the asymptotic performance of maximum-a-posteriori estimation in the presence of prior information. The problem arises in several applications such as recovery of signals with non-uniform sparsity pattern from underdetermined measurements. With prior information, the maximum-a-posteriori estimator might have asymmetric penalty. We consider a generic form of this estimator and study its performance via the replica method. Our analyses demonstrate an asymmetric form of the decoupling property in the large-system limit. Employing our results, we further investigate the performance of weighted zero-norm minimization for recovery of a non-uniform sparse signal. Our investigations illustrate that for a given distortion, the minimum number of required measurements can be significantly reduced by choosing weighting coefficients optimally.

Includes members:
  Member "replica symmetry breaking in compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "statistical mechanics of map estimation general replica ansatz")
  Member "statistical mechanics of map estimation general replica ansatz":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rls based detection for massive spatial modulation mimo")
  Member "applications of large random matrices in communications engineering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure regularized zero forcing for multiuser mimome channels")
  Member "support driven reweighted ell_1 minimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rls recovery with asymmetric penalty fundamental limits and algorithmic approaches")

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)