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 "a fast noniterative algorithm for compressive sensing using binary measurement matrices"):
  Abstract: In this paper we present a new algorithm for compressive sensing that makes use of binary measurement matrices and achieves exact recovery of sparse vectors, in a single pass, without any iterations. Our algorithm is hundreds of times faster than $\ell_1$-norm minimization, and methods based on expander graphs (which require multiple iterations). Moreover, our method requires the fewest measurements amongst all methods that use binary measurement matrices. The algorithm can accommodate nearly sparse vectors, in which case it recovers the largest components, and can also #R##N#Numerical experiments with randomly generated sparse vectors indicate that the sufficient conditions for our algorithm to work are very close to being necessary. In contrast, the best known sufficient condition for $\ell_1$-norm minimization to recover a sparse vector, namely the Restricted Isometry Property (RIP), is about thirty times away from being necessary. Therefore it would be worthwhile to explore alternate and improved sufficient conditions for $\ell_1$-norm minimization to achieve the recovery of sparse vectors.

Includes members:
  Member "living on the edge phase transitions in convex programs with random data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the convex geometry of blind deconvolution and matrix completion")
  Member "sparse representation of a polytope and recovery of sparse signals and low rank matrices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the importance of phase in complex compressive sensing")
  Member "compressed sensing matrices from fourier matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sensing matrix design and sparse recovery on the sphere and the rotation group")
  Member "information theoretically optimal compressed sensing via spatial coupling and approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "optimal phase transitions in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal errors and phase transitions in high dimensional generalized linear models")
  Member "combining geometry and combinatorics a unified approach to sparse signal recovery":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sublinear time non adaptive group testing with o k log n tests via bit mixing coding")

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)