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 "map support detection for greedy sparse signal recovery algorithms in compressive sensing"):
  Abstract: A reliable support detection is essential for a greedy algorithm to reconstruct a sparse signal accurately from compressed and noisy measurements. This paper proposes a novel support detection method for greedy algorithms, which is referred to as maximum a posteriori (MAP) support detection. Unlike existing support detection methods that identify support indices with the largest correlation value in magnitude per iteration, the proposed method selects them with the largest likelihood ratios computed under the true and null support hypotheses by simultaneously exploiting the distributions of a sensing matrix, a sparse signal, and noise. Leveraging this technique, MAP-Matching Pursuit (MAP-MP) is first presented to show the advantages of exploiting the proposed support detection method, and a sufficient condition for perfect signal recovery is derived for the case when the sparse signal is binary. Subsequently, a set of iterative greedy algorithms, called MAP-generalized Orthogonal Matching Pursuit (MAP-gOMP), MAP-Compressive Sampling Matching Pursuit (MAP-CoSaMP), and MAP-Subspace Pursuit (MAP-SP) are presented to demonstrate the applicability of the proposed support detection method to existing greedy algorithms. From empirical results, it is shown that the proposed greedy algorithms with highly reliable support detection can be better, faster, and easier to implement than basis pursuit via linear programming.

Includes members:
  Member "bayesian pursuit algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "greedy sparse signal recovery algorithm based on bit wise map detection")
  Member "on finite alphabet compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coded compressive sensing a compute and recover approach")
  Member "generalized orthogonal matching pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access for massive machine type communications")
  Member "sparse recovery with orthogonal matching pursuit under rip":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")
  Member "sparse signal reconstruction via iterative support detection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "truncated sparse approximation property and truncated q norm minimization")
  Member "subspace pursuit for compressive sensing signal reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressive sensing for cut improvement and local clustering")
  Member "iterative hard thresholding for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")

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)