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 "regime change bit depth versus measurement rate in compressive sensing"):
  Abstract: The recently introduced compressive sensing (CS) framework enables digital signal acquisition systems to take advantage of signal structures beyond bandlimitedness. Indeed, the number of CS measurements required for stable reconstruction is closer to the order of the signal complexity than the Nyquist rate. To date, the CS theory has focused on real-valued measurements, but in practice measurements are mapped to bits from a finite alphabet. Moreover, in many potential applications the total number of measurement bits is constrained, which suggests a tradeoff between the number of measurements and the number of bits per measurement. We study this situation in this paper and show that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement compression (MC) regime, a high SNR favors acquiring fewer measurements with more bits per measurement; in the quantization compression (QC) regime, a low SNR favors acquiring more measurements with fewer bits per measurement. A surprise from our analysis and experiments is that in many practical applications it is better to operate in the QC regime, even acquiring as few as 1 bit per measurement.

Includes members:
  Member "the pros and cons of compressive sensing for wideband signal acquisition noise folding versus dynamic range":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compressive spectrum sensing for cognitive radio networks")
  Member "one bit compressed sensing by linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")
  Member "frame permutation quantization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantized compressive sensing with rip matrices the benefit of dithering")
  Member "robust 1 bit compressive sensing via binary stable embeddings of sparse vectors":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "serial quantization for sparse time sequences")
  Member "how well can we estimate a sparse vector":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an introductory guide to fano s inequality with applications in statistical estimation")
  Member "beyond nyquist efficient sampling of sparse bandlimited signals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure and efficient compressed sensing based encryption with sparse matrices")
  Member "sobolev duals for random frames and sigma delta quantization of compressed sensing measurements":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on one stage recovery for sigma delta quantized compressed sensing")
  Member "model based compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "compressed sensing with invertible generative models and dependent 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)