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 conditions for uniqueness in sparse phase retrieval"):
  Abstract: The phase retrieval problem has a long history and is an important problem in many areas of optics. Theoretical understanding of phase retrieval is still limited and fundamental questions such as uniqueness and stability of the recovered solution are not yet fully understood. This paper provides several additions to the theoretical understanding of sparse phase retrieval. In particular we show that if the measurement ensemble can be chosen freely, as few as 4k-1 phaseless measurements suffice to guarantee uniqueness of a k-sparse M-dimensional real solution. We also prove that 2(k^2-k+1) Fourier magnitude measurements are sufficient under rather general conditions.

Includes members:
  Member "phase retrieval for sparse signals uniqueness conditions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "serial quantization for sparse time sequences")
  Member "sparse signal recovery from quadratic measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "phase retrieval stability and recovery guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "consensus based optimization on the sphere ii convergence to global minimizers and machine learning")
  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 "phaselift exact and stable signal recovery from magnitude measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")
  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)