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 "greed is super a fast algorithm for super resolution"):
  Abstract: We present a fast two-phase algorithm for super-resolution with strong theoretical guarantees. Given the low-frequency part of the spectrum of a sequence of impulses, Phase I consists of a greedy algorithm that roughly estimates the impulse positions. These estimates are then refined by local optimization in Phase II. #R##N#In contrast to the convex relaxation proposed by Cand\`es et al., our approach has a low computational complexity but requires the impulses to be separated by an additional logarithmic factor to succeed. The backbone of our work is the fundamental work of Slepian et al. involving discrete prolate spheroidal wave functions and their unique properties.

Includes members:
  Member "phase retrieval via wirtinger flow theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "music for single snapshot spectral estimation stability and super resolution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the stable resolution limit of total variation regularization for spike deconvolution")
  Member "matched filtering from limited frequency samples":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressive parameter estimation via k median clustering")
  Member "spectral compressive sensing with polar interpolation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compressive parameter estimation via k median clustering")
  Member "near minimax line spectral estimation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate support recovery of atomic line spectral estimation a tale of resolution and precision")
  Member "super resolution via superset selection and pruning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressive spectral estimation with single snapshot esprit stability and resolution")
  Member "a tensor based method for missing traffic data completion":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pca based missing information imputation for real time crash likelihood prediction under imbalanced data")
  Member "support detection in super resolution":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximate support recovery of atomic line spectral estimation a tale of resolution and precision")

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)