human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "phasemax convex phase retrieval via basis pursuit"):
  with members:
    - "phase retrieval via linear programming fundamental limits and algorithmic improvements"
    - "coordinate descent algorithms for phase retrieval"
    - "fundamental limits of phasemax for phase retrieval a replica analysis"
    - "phase transitions of spectral initialization for high dimensional nonconvex estimation"
    - "branchhull convex bilinear inversion from the entrywise product of signals with known signs"
    - "non convex phase retrieval from stft measurements"
    - "corruption robust phase retrieval via linear programming"
    - "compressed sensing from phaseless gaussian measurements via linear programming in the natural parameter space"

Question: Please tell me which class the center node 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)