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 "low rank phase retrieval"):
  Abstract: We develop two iterative algorithms for solving the low-rank phase retrieval (LRPR) problem. LRPR refers to recovering a low-rank matrix   $\boldsymbol {X}$   from magnitude-only (phaseless) measurements of random linear projections of its columns. Both methods consist of a spectral initialization step followed by an iterative algorithm to maximize the observed data likelihood. We obtain sample complexity bounds for our proposed initialization approach to provide a good approximation of the true   $\boldsymbol {X}$  . When the rank is low enough, these bounds are significantly lower than what existing single vector phase retrieval algorithms need. Via extensive experiments, we show that the same is also true for the proposed complete algorithms.

Includes members:
  Member "scalable solvers of random quadratic equations via stochastic truncated amplitude flow":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compressive phase retrieval via reweighted amplitude flow")
  Member "correlated pca principal components analysis when data and noise are correlated":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "provable dynamic robust pca or robust subspace tracking")
  Member "solving random quadratic systems of equations is nearly as easy as solving linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  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 with application to optical imaging":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "phase retrieval without small ball probability assumptions")
  Member "fast matrix completion without the condition number":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey of optimization methods from a machine learning perspective")
  Member "gespar efficient phase retrieval of sparse signals":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serial quantization for sparse time sequences")
  Member "phase retrieval stability and recovery guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "consensus based optimization on the sphere ii convergence to global minimizers and machine learning")

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)