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 "on signal reconstruction from frog measurements"):
  Abstract: Phase retrieval refers to recovering a signal from its Fourier magnitude. This problem arises naturally in many scientific applications, such as ultra-short laser pulse characterization and diffraction imaging. Unfortunately, phase retrieval is ill-posed for almost all one-dimensional signals. In order to characterize a laser pulse and overcome the ill-posedness, it is common to use a technique called Frequency-Resolved Optical Gating (FROG). In FROG, the measured data, referred to as FROG trace, is the Fourier magnitude of the product of the underlying signal with several translated versions of itself. The FROG trace results in a system of phaseless quartic Fourier measurements. In this paper, we prove that it suffices to consider only three translations of the signal to determine almost all bandlimited signals, up to trivial ambiguities. In practice, one usually also has access to the signal's Fourier magnitude. We show that in this case only two translations suffice. Our results significantly improve upon earlier work.

Includes members:
  Member "bispectrum inversion with application to multireference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi target detection with application to cryo electron microscopy")
  Member "fourier phase retrieval uniqueness and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "on the uniqueness of frog methods":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "benchmark problems for phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simultaneous phase retrieval and blind deconvolution via convex programming")
  Member "non convex phase retrieval from stft measurements":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "stft phase retrieval uniqueness guarantees and recovery algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "a geometric analysis of phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "solving random quadratic systems of equations is nearly as easy as solving linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

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)