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 via reweighted wirtinger flow"):
  Abstract: Phase retrieval (PR) is a kind of ill-condition inverse problem which can be found in various applications. Based on the Wirtinger flow (WF) method, a reweighted Wirtinger flow (RWF) method is proposed to deal with the PR problem. In a nutshell, RWF searches the global optimum by solving a series of sub-PR problems with changing weights. Theoretical analyses illustrate that the RWF has a geometric convergence from a deliberate initialization when the weights are bounded by 1 and 109. Numerical tests also show the RWF has a lower sampling complexity compared with the WF. As an essentially adaptive truncated Wirtinger flow (TWF) method, the RWF performs better than the TWF especially when the ratio between sampling number m and length of signal n is small.

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 "fourier ptychographic reconstruction using poisson maximum likelihood and truncated wirtinger gradient":
    also connected through other hyperedges:
      (none)
  Member "a geometric analysis of phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "phaseless rcovery using gauss newton method":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implicit regularization in nonconvex statistical estimation gradient descent converges linearly for phase retrieval matrix completion and blind deconvolution")
  Member "solving random quadratic systems of equations is nearly as easy as solving linear systems":
    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 via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "gespar efficient phase retrieval of sparse signals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "serial quantization for sparse time sequences")
  Member "phase retrieval from coded diffraction patterns":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "phase retrieval of low rank matrices by anchored regression")

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)