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 "low complexity modem structure for ofdm based orthogonal time frequency space modulation"):
  Abstract: Orthogonal time frequency space (OTFS) modulation is a two-dimensional signaling technique that has recently emerged in the literature to tackle the time-varying (TV) wireless channels. OTFS deploys the Doppler-delay plane to multiplex the transmit data where the time variations of the TV channel are integrated over time and hence the equivalent channel relating the input and output of the system boils down to a time-invariant one. This signaling technique can be implemented on the top of a given multicarrier waveform with the addition of precoding and post-processing units to the modulator and demodulator. In this paper, we present discrete-time formulation of an OFDM-based OTFS system. We argue against deployment of window functions at the OTFS transmitter in realistic scenarios and thus limit any sort of windowing to the receiver side. We study the channel impact in discrete-time providing deeper insights into OTFS systems. Moreover, our derivations lead to simplified modulator and demodulator structures that are far simpler than those in the literature.

Includes members:
  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-1 (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-2 (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)