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 "sparse phase retrieval via group sparse optimization"):
  Abstract: This paper deals with sparse phase retrieval, i.e., the problem of estimating a vector from quadratic measurements under the assumption that few components are nonzero. In particular, we consider the problem of finding the sparsest vector consistent with the measurements and reformulate it as a group-sparse optimization problem with linear constraints. Then, we analyze the convex relaxation of the latter based on the minimization of a block l1-norm and show various exact recovery and stability results in the real and complex cases. Invariance to circular shifts and reflections are also discussed for real vectors measured via complex matrices.

Includes members:
  Member "quadratic basis pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "recursive recovery of sparse signal sequences from compressive measurements a review")
  Member "finding sparse solutions of systems of polynomial equations via group sparsity optimization":
    also connected through other hyperedges:
      (none)
  Member "phase retrieval for sparse signals uniqueness conditions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "serial quantization for sparse time sequences")
  Member "on conditions for uniqueness in sparse phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "nonlinear basis pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hp vpinns variational physics informed neural networks with domain decomposition")
  Member "recovery of sparse 1 d signals from the magnitudes of their fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "phaselift exact and stable signal recovery from magnitude measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")

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)