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: "on the diagonalization of the discrete fourier transform"
  Abstract: The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the DFT. The transition matrix from the standard basis to the canonical basis defines a novel transform which we call the discrete oscillator transform (DOT for short). Finally, we describe a fast algorithm for computing the discrete oscillator transform in certain cases.

Connected through hyperedge HE-1 (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 finite harmonic oscillator and its applications to sequences communication and radar"
    - "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"

Connected through hyperedge HE-2 (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"
    - "the finite harmonic oscillator and its applications to sequences communication and radar"
    - "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 "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"
    - "the finite harmonic oscillator and its applications to sequences communication and radar"
    - "efficient compressed sensing using lossless expander graphs with fast bilateral quantum recovery algorithm"

Connected through hyperedge HE-4 (induced by source paper "application of the weil representation diagonalization of the discrete fourier transform"):
  with members:
    - "the finite harmonic oscillator and its associated sequences"
    - "on some deterministic dictionaries supporting sparsity"

Connected through hyperedge HE-5 (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"
    - "the finite harmonic oscillator and its applications to sequences communication and radar"
    - "efficient compressed sensing using lossless expander graphs with fast bilateral quantum recovery algorithm"

Connected through hyperedge HE-6 (induced by source paper "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"):
  with members:
    - "group representation design of digital signals and sequences"
    - "on some deterministic dictionaries supporting sparsity"
    - "the finite harmonic oscillator and its applications to sequences communication and radar"

Connected through hyperedge HE-7 (induced by source paper "the discrete fourier transform a canonical basis of eigenfunctions"):
  with members:
    - "the finite harmonic oscillator and its associated sequences"

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)