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 "deterministic constructions of binary measurement matrices from finite geometry"):
  Abstract: Deterministic constructions of measurement matrices in compressed sensing (CS) are considered in this paper. The constructions are inspired by the recent discovery of Dimakis, Smarandache and Vontobel which says that parity-check matrices of good low-density parity-check (LDPC) codes can be used as {provably} good measurement matrices for compressed sensing under $\ell_1$-minimization. The performance of the proposed binary measurement matrices is mainly theoretically analyzed with the help of the analyzing methods and results from (finite geometry) LDPC codes. Particularly, several lower bounds of the spark (i.e., the smallest number of columns that are linearly dependent, which totally characterizes the recovery performance of $\ell_0$-minimization) of general binary matrices and finite geometry matrices are obtained and they improve the previously known results in most cases. Simulation results show that the proposed matrices perform comparably to, sometimes even better than, the corresponding Gaussian random matrices. Moreover, the proposed matrices are sparse, binary, and most of them have cyclic or quasi-cyclic structure, which will make the hardware realization convenient and easy.

Includes members:
  Member "reconstruction guarantee analysis of binary measurement matrices based on girth":
    also connected through other hyperedges:
      (none)
  Member "sparse representation of a polytope and recovery of sparse signals and low rank matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the importance of phase in complex compressive sensing")
  Member "ldpc codes for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unknown sparsity in compressed sensing denoising and inference")
  Member "structured compressed sensing from theory to applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "serial quantization for sparse time sequences")
  Member "construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "frame moments and welch bound with erasures")
  Member "deterministic construction of binary bipolar and ternary compressed sensing matrices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deterministic sparse fourier transform with an ell_infty guarantee")
  Member "subspace pursuit for compressive sensing signal reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressive sensing for cut improvement and local clustering")

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)