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 lmmse receiver for otfs"):
  Abstract: Orthogonal time frequency space modulation is a two dimensional (2D) delay-Doppler domain waveform. It uses inverse symplectic Fourier transform (ISFFT) to spread the signal in time-frequency domain. To extract diversity gain from 2D spreaded signal, advanced receivers are required. In this work, we investigate a low complexity linear minimum mean square error receiver which exploits sparsity and quasi-banded structure of matrices involved in the demodulation process which results in a log-linear order of complexity without any performance degradation of BER.

Includes members:
  Member "otfs a new generation of modulation addressing the challenges of 5g":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "otfs interleaved ofdm with block cp")
  Member "on otfs modulation for high doppler fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "otfs noma an efficient approach for exploiting heterogenous user mobility profiles")
  Member "interference cancellation and iterative detection for orthogonal time frequency space modulation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "otfs based receiver scheme with multi antennas in high mobility v2x systems")
  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")

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)