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: "new sequences design from weil representation with low two dimensional correlation in both time and phase shifts"
  Abstract: For a given prime $p$, a new construction of families of the complex valued sequences of period $p$ with efficient implementation is given by applying both multiplicative characters and additive characters of finite field $\mathbb{F}_p$. Such a signal set consists of $p^2(p-2)$ time-shift distinct sequences, the magnitude of the two-dimensional autocorrelation function (i.e., the ambiguity function) in both time and phase of each sequence is upper bounded by $2\sqrt{p}$ at any shift not equal to $(0, 0)$, and the magnitude of the ambiguity function of any pair of phase-shift distinct sequences is upper bounded by $4\sqrt{p}$. Furthermore, the magnitude of their Fourier transform spectrum is less than or equal to 2. A proof is given through finding a simple elementary construction for the sequences constructed from the Weil representation by Gurevich, Hadani and Sochen. An open problem for directly establishing these assertions without involving the Weil representation is addressed.

Connected through hyperedge HE-1 (induced by source paper "the incidence and cross methods for efficient radar detection"):
  with members:
    - "the finite harmonic oscillator and its applications to sequences communication and radar"

Connected through hyperedge HE-2 (induced by source paper "delay doppler channel estimation with almost linear complexity"):
  with members:
    - "the finite harmonic oscillator and its applications to sequences communication and radar"

Connected through hyperedge HE-3 (induced by source paper "bounds on and constructions of unit time phase signal sets"):
  with members:
    - "the finite harmonic oscillator and its applications to sequences communication and radar"

Connected through hyperedge HE-4 (induced by source paper "computing the matched filter in linear time"):
  with members:
    - "the finite harmonic oscillator and its applications to sequences communication and radar"

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 finite harmonic oscillator and its applications to sequences communication and radar"
    - "the statistical restricted isometry property and the wigner semicircle distribution of incoherent dictionaries"
    - "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"
    - "the finite harmonic oscillator and its applications to sequences communication and radar"
    - "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)