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: "the finite harmonic oscillator and its applications to sequences communication and radar"
  Abstract: A novel system, called the oscillator system, consisting of order of p3 functions (signals) on the finite field Fp, with p an odd prime, is described and studied. The new functions are proved to satisfy good autocorrelation, cross-correlation, and low peak-to- average power ratio properties. Moreover, the oscillator system is closed under the operation of discrete Fourier transform. Applications of the oscillator system for discrete radar and digital communication theory are explained. Finally, an explicit algorithm to construct the oscillator system is presented.

Connected through hyperedge HE-1 (induced by source paper "the incidence and cross methods for efficient radar detection"):
  with members:
    - "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"

Connected through hyperedge HE-2 (induced by source paper "delay doppler channel estimation with almost linear complexity"):
  with members:
    - "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"

Connected through hyperedge HE-3 (induced by source paper "bounds on and constructions of unit time phase signal sets"):
  with members:
    - "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"

Connected through hyperedge HE-4 (induced by source paper "computing the matched filter in linear time"):
  with members:
    - "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"

Connected through hyperedge HE-5 (induced by source paper "on the construction of finite oscillator dictionary"):
  with members:
    - "a note on the diagonalization of the discrete fourier transform"
    - "on some deterministic dictionaries supporting sparsity"
    - "the statistical restricted isometry property and the wigner semicircle distribution of incoherent dictionaries"
    - "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"
    - "on the diagonalization of the discrete fourier transform"

Connected through hyperedge HE-6 (induced by source paper "a note on the diagonalization of the discrete fourier transform"):
  with members:
    - "group representation design of digital signals and sequences"
    - "on some deterministic dictionaries supporting sparsity"
    - "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"
    - "on the diagonalization of the discrete fourier transform"

Connected through hyperedge HE-7 (induced by source paper "statistical rip and semi circle distribution of incoherent dictionaries"):
  with members:
    - "the finite harmonic oscillator and its associated sequences"
    - "deterministic designs with deterministic guarantees toeplitz compressed sensing matrices sequence designs and system identification"
    - "on some deterministic dictionaries supporting sparsity"
    - "efficient compressed sensing using lossless expander graphs with fast bilateral quantum recovery algorithm"
    - "on the diagonalization of the discrete fourier transform"

Connected through hyperedge HE-8 (induced by source paper "the statistical restricted isometry property and the wigner semicircle distribution of incoherent dictionaries"):
  with members:
    - "incoherent dictionaries and the statistical restricted isometry property"
    - "the finite harmonic oscillator and its associated sequences"
    - "deterministic designs with deterministic guarantees toeplitz compressed sensing matrices sequence designs and system identification"
    - "efficient and robust compressed sensing using high quality expander graphs"
    - "on some deterministic dictionaries supporting sparsity"
    - "efficient compressed sensing using lossless expander graphs with fast bilateral quantum recovery algorithm"
    - "on the diagonalization of the discrete fourier transform"

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)