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 "non uniform wavelet sampling for rf analog to information conversion"):
  Abstract: Feature extraction, such as spectral occupancy, interferer energy and type, or direction-of-arrival, from wideband radio-frequency~(RF) signals finds use in a growing number of applications as it enhances RF transceivers with cognitive abilities and enables parameter tuning of traditional RF chains. In power and cost limited applications, e.g., for sensor nodes in the Internet of Things, wideband RF feature extraction with conventional, Nyquist-rate analog-to-digital converters is infeasible. However, the structure of many RF features (such as signal sparsity) enables the use of compressive sensing (CS) techniques that acquire such signals at sub-Nyquist rates. While such CS-based analog-to-information (A2I) converters have the potential to enable low-cost and energy-efficient wideband RF sensing, they suffer from a variety of real-world limitations, such as noise folding, low sensitivity, aliasing, and limited flexibility. #R##N#This paper proposes a novel CS-based A2I architecture called non-uniform wavelet sampling (NUWS). Our solution extracts a carefully-selected subset of wavelet coefficients directly in the RF domain, which mitigates the main issues of existing A2I converter architectures. For multi-band RF signals, we propose a specialized variant called non-uniform wavelet bandpass sampling (NUWBS), which further improves sensitivity and reduces hardware complexity by leveraging the multi-band signal structure. We use simulations to demonstrate that NUWBS approaches the theoretical performance limits of $\ell_1$-norm-based sparse signal recovery. We investigate hardware-design aspects and show ASIC measurement results for the wavelet generation stage, which highlight the efficacy of NUWBS for a broad range of RF feature extraction tasks in cost- and power-limited applications.

Includes members:
  Member "near optimal adaptive compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")
  Member "wideband spectrum sensing for cognitive radio networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "20 years of evolution from cognitive to intelligent communications")
  Member "the pros and cons of compressive sensing for wideband signal acquisition noise folding versus dynamic range":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressive spectrum sensing for cognitive radio networks")
  Member "stable and robust sampling strategies for compressive imaging":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")
  Member "structured compressed sensing from theory to applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "serial quantization for sparse time sequences")
  Member "noise folding in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an analysis of noise folding for low rank matrix recovery")
  Member "recovery of sparsely corrupted signals":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "metrics for evaluating the efficiency of compressing sensing techniques")
  Member "xampling signal acquisition and processing in union of subspaces":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fast compressed power spectrum estimation towards a practical solution for wideband spectrum sensing")

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)