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 "preconditioned multiple orthogonal least squares and applications in ghost imaging via sparsity constraint"):
  Abstract: Ghost imaging via sparsity constraint (GISC) can recover objects from the intensity fluctuation of light fields even when the sampling rate is far below the Nyquist sampling rate. In this paper, we develop an efficient algorithm called the preconditioned multiple orthogonal least squares (PmOLS) for solving the GISC reconstruction problem. Our analysis shows that the PmOLS algorithm perfectly recovers any $n$-dimensional $K$-sparse signal from $m$ random linear samples of the signal with probability exceeding $1-3n^2 e^{-cm/K^2}$. Simulations and experiments demonstrate that the proposed algorithm has very competitive imaging quality compared to the state-ofthe-art methods.

Includes members:
  Member "nearly optimal bounds for orthogonal least squares":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an optimal condition of robust low rank matrices recovery")
  Member "perturbation analysis of orthogonal matching pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit")
  Member "generalized orthogonal matching pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access for massive machine type communications")
  Member "subspace pursuit for compressive sensing signal reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)