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: "a low delay low complexity ekf design for joint channel and cfo estimation in multi user cognitive communications"
  Abstract: Parameter estimation in cognitive communications can be formulated as a multi-user estimation problem, which is solvable under maximum likelihood solution but involves high computational complexity. This paper presents a time-sharing and interference mitigation based EKF (Extended Kalman Filter) design for joint CFO (carrier frequency offset) and channel estimation at multiple cognitive users. The key objective is to realize low implementation complexity by decomposing highdimensional parameters into multiple separate low-dimensional estimation problems, which can be solved in a time-shared manner via pipelining operation. We first present a basic EKF design that estimates the parameters from one TX user to one RX antenna. Then such basic design is time-shared and reused to estimate parameters from multiple TX users to multiple RX antennas. Meanwhile, we use interference mitigation module to cancel the co-channel interference at each RX sample. In addition, we further propose adaptive noise variance tracking module to improve the estimation performance. The proposed design enjoys low delay and low buffer size (because of its online real-time processing), as well as low implementation complexity (because of time-sharing and pipeling design). Its estimation performance is verified to be close to Cramer-Rao bound.

Connected through hyperedge HE-1 (induced by source paper "timing and carrier synchronization in wireless communication systems a survey and classification of research in the last 5 years"):
  with members:
    - "performance analysis of arbitrarily shaped underlay cognitive networks effects of secondary user activity protocols"
    - "directional cell discovery in millimeter wave cellular networks"
    - "training based synchronization and channel estimation in af two way relaying networks"
    - "improving bandwidth efficiency in e band communication systems"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "what will 5g be"
    - "channel phase noise and frequency offset in ofdm systems joint estimation data detection and hybrid cramer rao lower bound"
    - "time and frequency synchronization for multicarrier transmission on hexagonal time frequency lattice"

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)