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 the uniqueness of frog methods"):
  Abstract: The problem of recovering a signal from its power spectrum, called  phase retrieval , arises in many scientific fields. One of many examples is ultrashort laser pulse characterization, in which the electromagnetic field is oscillating with   $\sim{\text{10}}^{15}$   Hz and phase information cannot be measured directly due to limitations of the electronic sensors. Phase retrieval is ill-posed in most of the cases, as there are many different signals with the same Fourier transform magnitude. To overcome this fundamental ill-posedness, several measurement techniques are used in practice. One of the most popular methods for complete characterization of ultrashort laser pulses is the frequency-resolved optical gating (FROG). In FROG, the acquired data are the power spectrum of the product of the unknown pulse with its delayed replica. Therefore, the measured signal is a quartic function of the unknown pulse. A generalized version of FROG, where the delayed replica is replaced by a second unknown pulse, is called blind FROG. In this case, the measured signal is quadratic with respect to both pulses. In this letter, we introduce and formulate FROG-type techniques. We then show that almost all band-limited signals are determined uniquely, up to trivial ambiguities, by blind FROG measurements (and thus also by FROG), if in addition we have access to the signals power spectrum.

Includes members:
  Member "improved recovery guarantees for phase retrieval from coded diffraction patterns":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complex phase retrieval from subgaussian measurements")
  Member "non convex phase retrieval from stft measurements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "phase retrieval an overview of recent developments":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "sparse phase retrieval from short time fourier measurements":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "phase retrieval for sparse signals uniqueness conditions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "serial quantization for sparse time sequences")

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)