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: "low complexity equalization for orthogonal time and frequency signaling otfs"
  Abstract: Recently, a new precoding technique called orthogonal time-frequency signaling (OTFS) has been proposed for time- and frequency-selective communication channels. OTFS precodes a data frame with a complete set of spreading sequences and transmits the results via orthogonal frequency division multiplexing (OFDM). OTFS uses two dimensional (2D) linear spreading sequences in time and frequency which are the basis functions of a symplectic Fourier transform. OTFS allows the utilization of time- and frequency-diversity but requires maximum likelihood decoding to achieve full diversity. In this paper we show performance results of a low-complexity equalizer using soft-symbol feedback for interference cancellation after an initial minimum-mean square error equalization step. Performance results for an implementation in the delay-Doppler domain and in the time-frequency domain are compared. With our equalizer, OTFS achieves a gain of 5dB compared to OFDM for a bit error rate of $10^{-4}$ and a velocity of $200\,\text{km/h}$.

Connected through hyperedge HE-1 (induced by source paper "orthogonal time frequency space modulation"):
  with members:
    - "on otfs modulation for high doppler fading channels"
    - "a simple two stage equalizer with simplified orthogonal time frequency space modulation over rapidly time varying channels"
    - "analysis of discrete time mimo ofdm based orthogonal time frequency space modulation"
    - "orthogonal precoding for ultra reliable wireless communication links"
    - "low complexity modem structure for ofdm based orthogonal time frequency space modulation"
    - "otfs orthogonal time frequency space"
    - "comparison of the achievable rates in ofdm and single carrier modulation with i i d inputs"
    - "what will 5g be"

Connected through hyperedge HE-2 (induced by source paper "embedded pilot aided channel estimation for otfs in delay doppler channels"):
  with members:
    - "orthogonal time frequency space modulation"
    - "otfs a new generation of modulation addressing the challenges of 5g"
    - "interference cancellation and iterative detection for orthogonal time frequency space modulation"
    - "analysis of discrete time mimo ofdm based orthogonal time frequency space modulation"
    - "orthogonal precoding for ultra reliable wireless communication links"
    - "low complexity modem structure for ofdm based orthogonal time frequency space modulation"

Connected through hyperedge HE-3 (induced by source paper "orthogonal precoding for ultra reliable wireless communication links"):
  with members:
    - "performance characterization of a real time massive mimo system with los mobile channels"
    - "analysis of discrete time mimo ofdm based orthogonal time frequency space modulation"
    - "low complexity modem structure for ofdm based orthogonal time frequency space modulation"
    - "otfs orthogonal time frequency space"
    - "time and frequency varying k factor of non stationary vehicular channels for safety relevant scenarios"
    - "delay and doppler spreads of nonstationary vehicular channels for safety relevant scenarios"
    - "diversity of mmse mimo receivers"

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)