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 "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.

Includes members:
  Member "mimo otfs in high doppler fading channels signal detection and channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "otfs based receiver scheme with multi antennas in high mobility v2x systems")
  Member "otfs a new generation of modulation addressing the challenges of 5g":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "otfs interleaved ofdm with block cp")
  Member "a simple two stage equalizer with simplified orthogonal time frequency space modulation over rapidly time varying channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "channel estimation for orthogonal time frequency space otfs massive mimo")
  Member "low complexity modem structure for ofdm based orthogonal time frequency space modulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "channel estimation for orthogonal time frequency space otfs massive mimo")
  Member "otfs orthogonal time frequency space":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non orthogonal multiple access with orthogonal time frequency space signal transmission")

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)