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 "an algorithm for exact super resolution and phase retrieval"):
  Abstract: We explore a fundamental problem of super-resolving a signal of interest from a few measurements of its low-pass magnitudes. We propose a 2-stage tractable algorithm that, in the absence of noise, admits perfect super-resolution of an $r$-sparse signal from $2r^2-2r+2$ low-pass magnitude measurements. The spike locations of the signal can assume any value over a continuous disk, without increasing the required sample size. The proposed algorithm first employs a conventional super-resolution algorithm (e.g. the matrix pencil approach) to recover unlabeled sets of signal correlation coefficients, and then applies a simple sorting algorithm to disentangle and retrieve the true parameters in a deterministic manner. Our approach can be adapted to multi-dimensional spike models and random Fourier sampling by replacing its first step with other harmonic retrieval algorithms.

Includes members:
  Member "a partial derandomization of phaselift using spherical designs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complex phase retrieval from subgaussian measurements")
  Member "robust spectral compressed sensing via structured matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "recovery analysis of damped spectrally sparse signals and its relation to music")
  Member "exact and stable covariance estimation from quadratic sampling via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "phase retrieval for sparse signals uniqueness conditions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "gespar efficient phase retrieval of sparse signals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "serial quantization for sparse time sequences")
  Member "phase retrieval from coded diffraction patterns":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "phase retrieval of low rank matrices by anchored regression")
  Member "on conditions for uniqueness in sparse phase retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "toward a mathematical theory of the crystallographic phase retrieval problem")
  Member "sparse phase retrieval convex algorithms and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the capacity of waveform channels under square law detection of time limited signals")

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)