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: "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios"
  Abstract: In this paper, we study Full Duplex (FD) Multiple-Input Multiple-Output (MIMO) radios for simultaneous data communication and control information exchange. Capitalizing on a recently proposed FD MIMO architecture combining digital transmit and receive beamforming with reduced complexity multi-tap analog Self-Interference (SI) cancellation, we propose a novel transmission scheme exploiting channel reciprocity for joint downlink beamformed information data communication and uplink channel estimation through training data transmission. We adopt a general model for pilot-assisted channel estimation and present a unified optimization framework for all involved FD MIMO design parameters. Our representative Monte Carlo simulation results for an example algorithmic solution for the beamformers as well as for the analog and digital SI cancellation demonstrate that the proposed FD-based joint communication and control scheme provides 1.4x the downlink rate of its half duplex counterpart. This performance improvement is achieved with 50% reduction in the hardware complexity for the analog canceller than conventional FD MIMO architectures with fully connected analog cancellation.

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)