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 "adaptive dictionary sparse signal recovery using binary measurements"):
  Abstract: One-bit compressive sensing (CS) is an advanced version of sparse recovery in which the sparse signal of interest can be recovered from extremely quantized measurements. Namely, only the sign of each measurement is available to us. In many applications, the ground truth signal is not sparse itself, but they can be represented in a redundant dictionary. A strong line of research has addressed conventional CS in this signal model including its extension to one-bit measurements. However, one-bit CS suffers from the extremely large number of required measurements to achieve a predefined reconstruction error level. A common alternative to resolve this issue is exploiting adaptive schemes. Adaptive sampling acts on acquired samples to trace the signal in an efficient way. In this work, we utilize an adaptive sampling strategy to recover dictionary sparse signals from binary measurements. For this task, a multi-dimensional threshold is proposed to incorporate the previous signal estimates into the current sampling procedure. This strategy substantially reduces the required number of measurements for exact recovery. Our proof approach is based on the recent tools in high dimensional geometry like random hyperplane tessellation and Gaussian width. We show through rigorous and numerical analysis that the proposed algorithm considerably outperforms state of the art approaches. Further, our algorithm reaches an exponential error decay in terms of the number of quantized measurements.

Includes members:
  Member "massive mimo with 1 bit adc":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "exponential decay of reconstruction error from binary measurements of sparse signals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")
  Member "regime change bit depth versus measurement rate in compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantized compressed sensing by rectified linear units")
  Member "one bit compressed sensing by linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")
  Member "robust 1 bit compressive sensing via binary stable embeddings of sparse vectors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "serial quantization for sparse time sequences")

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)