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 diversity of otfs modulation in doubly dispersive channels"
  Abstract: Orthogonal time frequency space (OTFS) is a 2-dimensional (2D) modulation technique designed in the delay-Doppler domain. A key premise behind OTFS is the transformation of a time varying multipath channel into an almost non-fading 2D channel in delay-Doppler domain such that all symbols in a transmission frame experience the same channel gain. It has been suggested in the recent literature that OTFS can extract full diversity in the delay-Doppler domain, where full diversity refers to the number of multipath components separable in either the delay or Doppler dimension, but without a formal analysis. In this paper, we present a formal analysis of the diversity achieved by OTFS modulation along with supporting simulations. Specifically, we prove that the asymptotic diversity order of OTFS (as SNR $\rightarrow \infty$) is one. However, in the finite SNR regime, potential for a higher order diversity is witnessed before the diversity one regime takes over. Also, the diversity one regime starts at lower BER values for increased frame sizes. We also propose a phase rotation scheme for OTFS using transcendental numbers. We show that OTFS with this proposed scheme extracts the full diversity in the delay-Doppler domain.

Connected through hyperedge HE-1 (induced by source paper "otfs noma an efficient approach for exploiting heterogenous user mobility profiles"):
  with members:
    - "on the diversity of uncoded otfs modulation in doubly dispersive channels"
    - "mimo otfs in high doppler fading channels signal detection and channel estimation"
    - "otfs a new generation of modulation addressing the challenges of 5g"
    - "on otfs modulation for high doppler fading channels"
    - "interference cancellation and iterative detection for orthogonal time frequency space modulation"
    - "impact of non orthogonal multiple access on the offloading of mobile edge computing"
    - "nr wide bandwidth operations"
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"

Connected through hyperedge HE-2 (induced by source paper "multiple access in the delay doppler domain using otfs modulation"):
  with members:
    - "mimo otfs in high doppler fading channels signal detection and channel estimation"
    - "orthogonal time frequency space modulation"
    - "otfs a new generation of modulation addressing the challenges of 5g"
    - "embedded pilot aided channel estimation for otfs in delay doppler channels"
    - "interference cancellation and iterative detection for orthogonal time frequency space modulation"
    - "a simple two stage equalizer with simplified orthogonal time frequency space modulation over rapidly time varying channels"
    - "low complexity modem structure for ofdm based orthogonal time frequency space modulation"

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)