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 "fourier phase retrieval uniqueness and algorithms"):
  Abstract: The problem of recovering a signal from its phaseless Fourier transform measurements, called Fourier phase retrieval, arises in many applications in engineering and science. Fourier phase retrieval poses fundamental theoretical and algorithmic challenges. In general, there is no unique mapping between a one-dimensional signal and its Fourier magnitude, and therefore the problem is ill-posed. Additionally, while almost all multidimensional signals are uniquely mapped to their Fourier magnitude, the performance of existing algorithms is generally not well-understood. In this chapter we survey methods to guarantee uniqueness in Fourier phase retrieval. We then present different algorithmic approaches to retrieve the signal in practice. We conclude by outlining some of the main open questions in this field.

Includes members:
  Member "message passing algorithms for synchronization problems over compact groups":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi frequency phase synchronization")
  Member "bispectrum inversion with application to multireference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi target detection with application to cryo electron microscopy")
  Member "on fienup methods for sparse phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a note on douglas rachford subgradients and phase retrieval")
  Member "on signal reconstruction from frog measurements":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "on the 2d phase retrieval problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "almost everywhere injectivity conditions for the matrix recovery problem")
  Member "multiple illumination phaseless super resolution mips with applications to phaseless doa estimation and diffraction imaging":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a precise analysis of phasemax in phase retrieval")
  Member "on the uniqueness of frog methods":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "improved recovery guarantees for phase retrieval from coded diffraction patterns":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complex phase retrieval from subgaussian 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)