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: "an inter user interference suppression method in full duplex networks"
  Abstract: Considering a full-duplex network comprised of a full-duplex (FD) base station and two half-duplex (HD) users, one user transmits on the uplink channel and the other receives through the downlink channel on the same frequency. The uplink user will generate inter-user interference (IUI) on the downlink user through the interference channel. In this paper, we propose an IUI suppression approach when the base station knows the full channel station information. To evaluate the performance of the proposed approach, four cases are considered, i.e., the uplink, the downlink, and the interference channels are Gaussian; the downlink and the interference channels are Rayleigh fading and the uplink channel is Gaussian; the uplink, the downlink, and the interference channels are Rayleigh fading; the uplink, the downlink, and the interference channels are Rician fading. We derive the close-form expression of the achievable rate and the energy efficient for the former two cases and investigate the performance for the latter two cases through Monte Carlo simulations. Analytic and simulation results show that the achievable rate and the energy efficient of the proposed approach is significantly influenced by the signal-to-noise-ratio (SNR), the Rician factor, and the power ratio between the uplink and the interference channels.

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)