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 "a note on the diagonalization of the discrete fourier transform"):
  Abstract: Abstract   Following the approach developed by S. Gurevich and R. Hadani, an analytical formula of the canonical basis of the DFT is given for the case    N  =  p    where p is a prime number and    p  ≡  1    (mod 4).

Includes members:
  Member "group representation design of digital signals and sequences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts")
  Member "on some deterministic dictionaries supporting sparsity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the construction of finite oscillator dictionary")
  Member "the finite harmonic oscillator and its applications to sequences communication and radar":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the incidence and cross methods for efficient radar detection")
  Member "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the incidence and cross methods for efficient radar detection")
  Member "on the diagonalization of the discrete fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the construction of finite oscillator dictionary")

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)