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 "consistent basis pursuit for signal and matrix estimates in quantized compressed sensing"):
  Abstract: This letter focuses on the estimation of low-complexity signals when they are observed through   $M$   uniformly quantized compressive observations. Among such signals, we consider 1-D sparse vectors, low-rank matrices, or compressible signals that are well approximated by one of these two models. In this context, we prove the estimation efficiency of a variant of Basis Pursuit Denoise, called Consistent Basis Pursuit (CoBP), enforcing consistency between the observations and the re-observed estimate, while promoting its low-complexity nature. We show that the reconstruction error of CoBP decays like   ${M^{ - 1/4}}$   when all parameters but   $M$    are fixed. Our proof is connected to recent bounds on the proximity of vectors or matrices when (i) those belong to a set of small intrinsic “dimension”, as measured by the Gaussian mean width, and (ii) they share the same quantized (dithered) random projections. By solving CoBP with a proximal algorithm, we provide some extensive numerical observations that confirm the theoretical bound as   $M$   is increased, displaying even faster error decay than predicted. The same phenomenon is observed in the special, yet important case of 1-bit CS.

Includes members:
  Member "compressive classification and the rare eclipse problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the rare eclipse problem on tiles quantised embeddings of disjoint convex sets")
  Member "small width low distortions quasi isometric embeddings with quantized sub gaussian random projections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "instance optimal decoding and the restricted isometry property")
  Member "on the gap between rip properties and sparse recovery conditions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non bayesian activity detection large scale fading coefficient estimation and unsourced random access with a massive mimo receiver")
  Member "small width low distortions quantized random embeddings of low complexity sets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantized compressive sensing with rip matrices the benefit of dithering")
  Member "quantization and compressive sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "serial quantization for sparse time sequences")
  Member "unlocbox a matlab convex optimization toolbox using proximal splitting methods":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "stationary signal processing on graphs")
  Member "error decay of almost consistent signal estimations from quantized random gaussian projections":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "time for dithering fast and quantized random embeddings via the restricted isometry property")
  Member "error decay of almost consistent signal estimations from quantized gaussian random projections":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "quantized compressed sensing by rectified linear units")

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)