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 "nonlinear basis pursuit"):
  Abstract: In compressive sensing, the basis pursuit algorithm aims to find the sparsest solution to an underdetermined linear equation system. In this paper, we generalize basis pursuit to finding the sparsest solution to higher order nonlinear systems of equations, called nonlinear basis pursuit. In contrast to the existing nonlinear compressive sensing methods, the new algorithm that solves the nonlinear basis pursuit problem is convex and not greedy. The novel algorithm enables the compressive sensing approach to be used for a broader range of applications where there are nonlinear relationships between the measurements and the unknowns.

Includes members:
  Member "compressive phase retrieval via generalized approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "quadratic basis pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "recursive recovery of sparse signal sequences from compressive measurements a review")
  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 "sparsity constrained nonlinear optimization optimality conditions and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient relaxed gradient support pursuit for sparsity constrained non convex optimization")
  Member "recovery of sparse 1 d signals from the magnitudes of their fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "compressed sensing with nonlinear observations and related nonlinear optimisation problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recursive recovery of sparse signal sequences from compressive measurements a review")
  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")
  Member "phase retrieval via matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

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)