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 "sparse phase retrieval from short time fourier measurements"):
  Abstract: We consider the classical 1D phase retrieval problem. In order to overcome the difficulties associated with phase retrieval from measurements of the Fourier magnitude, we treat recovery from the magnitude of the short-time Fourier transform (STFT). We first show that the redundancy offered by the STFT enables unique recovery for arbitrary nonvanishing inputs, under mild conditions. An efficient algorithm for recovery of a sparse input from the STFT magnitude is then suggested, based on an adaptation of the recently proposed GESPAR algorithm. We demonstrate through simulations that using the STFT leads to improved performance over recovery from the oversampled Fourier magnitude with the same number of measurements.

Includes members:
  Member "phase retrieval with application to optical imaging":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "phase retrieval without small ball probability assumptions")
  Member "phase retrieval for sparse signals uniqueness conditions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "gespar efficient phase retrieval of sparse signals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "serial quantization for sparse time sequences")
  Member "on conditions for uniqueness in sparse phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "sparsity constrained nonlinear optimization optimality conditions and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient relaxed gradient support pursuit for sparsity constrained non convex optimization")
  Member "recovery of sparse 1 d signals from the magnitudes of their fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "phase retrieval via matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "sparsity based sub wavelength imaging with partially incoherent light via quadratic compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "phase retrieval from binary measurements")

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)