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: "compressive and noncompressive power spectral density estimation from periodic nonuniform samples"
  Abstract: This paper presents a novel power spectral density estimation technique for bandlimited, wide-sense stationary signals from sub-Nyquist sampled data. The technique employs multi-coset sampling and applies to spectrally sparse and nonsparse power spectra alike. For sparse density functions, we apply compressed sensing theory and the resulting compressive estimates exhibit better tradeoffs among the estimator’s resolution, system complexity, and average sampling rate compared to their noncompressive counterparts. Both compressive and noncompressive estimates, however, can be computed at arbitrarily low sampling rates. The estimator does not require signal reconstruction and can be directly obtained from solving either a least squares or a nonnegative least squares problem. The estimates are piecewise constant approximations whose resolutions (width of the piecewise constant segments) are controlled by the periodicity of the multi-coset sampling. The estimates are also statistically consistent. This method is widely applicable, but it is targeted to situations where one wants to sense a wideband spectrum at low sampling rates.

Connected through hyperedge HE-1 (induced by source paper "analog to digital cognitive radio sampling detection and hardware"):
  with members:
    - "sub nyquist cyclostationary detection for cognitive radio"
    - "cascade compressed carrier and doa estimation"
    - "sub nyquist sampling for power spectrum sensing in cognitive radios a unified approach"
    - "noise folding in compressed sensing"
    - "sub nyquist sampling bridging theory and practice"
    - "xampling signal acquisition and processing in union of subspaces"
    - "beyond nyquist efficient sampling of sparse bandlimited signals"
    - "wideband spectrum sensing at sub nyquist rates"

Connected through hyperedge HE-2 (induced by source paper "an active sequential xampling detector for spectrum sensing"):
  with members:
    - "utility maximizing sequential sensing over a finite horizon"
    - "converse bounds for noisy group testing with arbitrary measurement matrices"
    - "cross layer estimation and control for cognitive radio exploiting sparse network dynamics"
    - "info greedy sequential adaptive compressed sensing"
    - "sub nyquist sampling for power spectrum sensing in cognitive radios a unified approach"
    - "wideband spectrum sensing with sub nyquist sampling in cognitive radios"
    - "boolean compressed sensing and noisy group testing"
    - "on optimality of myopic policy for restless multi armed bandit problem an axiomatic approach"

Connected through hyperedge HE-3 (induced by source paper "sub nyquist sampling for power spectrum sensing in cognitive radios a unified approach"):
  with members:
    - "fourier domain beamforming the path to compressed ultrasound imaging"
    - "sub nyquist radar via doppler focusing"
    - "noise folding in compressed sensing"
    - "wideband spectrum sensing at sub nyquist rates"
    - "from theory to practice sub nyquist sampling of sparse wideband analog signals"
    - "eigenvalue based spectrum sensing algorithms for cognitive radio"
    - "spectrum sensing algorithms for cognitive radio based on statistical covariances"

Connected through hyperedge HE-4 (induced by source paper "finite length and asymptotic analysis of correlogram for undersampled data"):
  with members:
    - "compressed sensing off the grid"
    - "towards a mathematical theory of super resolution"

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)