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 only signal reconstruction by magnitudecut"):
  Abstract: In this paper, we present a new algorithm, called MagnitudeCut, for recovering a signal from the phase of its Fourier transform. We casted our recovering problem into a new convex optimization problem, and then solved it by the block coordinate descent algorithm and the interior point algorithm, in which the iteration process consists of matrix vector product and inner product. We used the new method for reconstruction of a set of signal/image. The simulation results reveal that the proposed MagnitudeCut method can reconstruct the original signal with fewer sampling number of the phase information than that of the Greedy algorithm and iterative method under the same reconstruction error. Moreover, our algorithm can also reconstruct the symmetric image from its Fourier phase.

Includes members:
  Member "invariant scattering convolution networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatially adaptive filter units for compact and efficient deep neural networks")
  Member "phaselift exact and stable signal recovery from magnitude measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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.NA(Numerical Analysis)