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 "subspace detection from structured union of subspaces via linear sampling"):
  Abstract: Lower dimensional signal representation schemes frequently assume that the signal of interest lies in a single vector space. In the context of the recently developed theory of compressive sensing (CS), it is often assumed that the signal of interest is sparse in an orthonormal basis. However, in many practical applications, this requirement may be too restrictive. A generalization of the standard sparsity assumption is that the signal lies in a union of subspaces. Recovery of such signals from a small number of samples has been studied recently in several works. Here, we consider the problem of subspace detection in which our goal is to identify the subspace (from the union) in which the signal lies from a small number of samples, in the presence of noise. More specifically, we derive performance bounds and conditions under which reliable subspace detection is guaranteed using maximum likelihood (ML) detection. We begin by treating general unions and then specify the results to the special case in which the subspaces have structure leading to block sparsity. In our analysis, we treat both general sampling operators and random sampling matrices. With general unions, we show that under certain conditions, the number of measurements required for reliable subspace detection in the presence of noise via ML is less than that implied using the restricted isometry property which guarantees signal recovery. In the special case of block sparse signals, we quantify the gain achievable over standard sparsity in subspace detection. Our results also strengthen existing results on sparsity pattern recovery in the presence of noise under the standard sparsity model.

Includes members:
  Member "performance bounds and design criteria for estimating finite rate of innovation signals":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint transmit and receive filter optimization for sub nyquist delay doppler estimation")
  Member "near oracle performance of greedy block sparse estimation techniques from noisy measurements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved support recovery guarantees for the group lasso with applications to structural health monitoring")
  Member "structured compressed sensing from theory to applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "serial quantization for sparse time sequences")
  Member "block sparse signals uncertainty relations and efficient recovery":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dr2 net deep residual reconstruction network for image compressive sensing")
  Member "wideband spectrum sensing at sub nyquist rates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analog to digital cognitive radio sampling detection and hardware")
  Member "model based compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressed sensing with invertible generative models and dependent noise")
  Member "distributed compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serial quantization for sparse time sequences")
  Member "performance analysis for sparse support recovery":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sample measurement tradeoff in support recovery under a subgaussian prior")

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)