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: "frequency selective vandermonde decomposition of toeplitz matrices with applications"
  Abstract: The classical result of Vandermonde decomposition of positive semidefinite Toeplitz matrices can date back to the early twentieth century. It forms the basis of modern subspace and recent atomic norm methods for frequency estimation. In this paper, we study the Vandermonde decomposition in which the frequencies are restricted to lie in a given interval, referred to as frequency-selective Vandermonde decomposition. The existence and uniqueness of the decomposition are studied under explicit conditions on the Toeplitz matrix. The new result is connected by duality to the positive real lemma for trigonometric polynomials nonnegative on the same frequency interval. Its applications in the theory of moments and line spectral estimation are illustrated. In particular, it provides a solution to the truncated trigonometric K-moment problem. It is used to derive a primal semidefinite program formulation of the frequency-selective atomic norm in which the frequencies are known a priori to lie in a certain frequency band. Numerical examples are also provided.

Connected through hyperedge HE-1 (induced by source paper "multi dimensional spectral super resolution with prior knowledge via frequency selective vandermonde decomposition and admm"):
  with members:
    - "multi target position and velocity estimation using ofdm communication signals"
    - "adaptive interference removal for uncoordinated radar communication coexistence"
    - "recovery of structured signals with prior information via maximizing correlation"
    - "near optimal sample complexity for convex tensor completion"
    - "millimeter wave beamformed full dimensional mimo channel estimation based on atomic norm minimization"
    - "super resolution delay doppler estimation for ofdm passive radar"
    - "rank determination for low rank data completion"
    - "characterization of deterministic and probabilistic sampling patterns for finite completability of low tensor train rank tensor"

Connected through hyperedge HE-2 (induced by source paper "compressive multidimensional harmonic retrieval with prior knowledge"):
  with members:
    - "multi target position and velocity estimation using ofdm communication signals"
    - "adaptive interference removal for uncoordinated radar communication coexistence"
    - "super resolution delay doppler estimation for ofdm passive radar"
    - "vandermonde decomposition of multilevel toeplitz matrices with application to multidimensional super resolution"
    - "spectral super resolution with prior knowledge"
    - "exact joint sparse frequency recovery via optimization methods"
    - "atomic norm denoising with applications to line spectral estimation"
    - "compressed sensing off the grid"

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)