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 "phase retrieval for binary signals box relaxation and uniqueness"):
  Abstract: Recovering a signal from its Fourier magnitude is referred to as phase retrieval, which occurs in different fields of engineering and applied physics. This paper gives a new characterization of the phase retrieval problem. Particularly useful is the analysis revealing that the common gradient-based regularization does not contain more information other than the magnitude measurements for phase retrieval. Focusing on binary signals, we show that a box relaxation to the binary constraint is equivalent to the original problem. We further prove that binary signals can be recovered uniquely up to trivial ambiguities under certain conditions. Finally, we use the characterization theorem to develop an efficient denoising algorithm.

Includes members:
  Member "on signal reconstruction from frog measurements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  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 "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 for sparse signals uniqueness conditions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "on conditions for uniqueness in sparse phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "sparse phase retrieval convex algorithms and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the capacity of waveform channels under square law detection of time limited signals")
  Member "sparse signal recovery from quadratic measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "reconstruction of binary functions and shapes from incomplete frequency information":
    also connected through other hyperedges:
      (none)

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)