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: "resource allocation in heterogenous full duplex ofdma networks design and analysis"
  Abstract: Recent studies indicate the feasibility of full-duplex (FD) bidirectional wireless communications. Due to its potential to increase the capacity, analyzing the performance of a cellular network that contains full-duplex devices is crucial. In this paper, we consider maximizing the weighted sum-rate of downlink and uplink of an FD heterogeneous OFDMA network where each cell consists of an imperfect FD base-station (BS) and a mixture of half-duplex and imperfect full-duplex mobile users. To this end, first, the joint problem of sub-channel assignment and power allocation for a single cell network is investigated. Then, the proposed algorithms are extended for solving the optimization problem for an FD heterogeneous network in which intra-cell and inter-cell interferences are taken into account. Simulation results demonstrate that in a single cell network, when all the users and the BSs are perfect FD nodes, the network throughput could be doubled. Otherwise, the performance improvement is limited by the inter-cell interference, inter-node interference, and self-interference. We also investigate the effect of the percentage of FD users on the network performance in both indoor and outdoor scenarios, and analyze the effect of the self-interference cancellation capability of the FD nodes on the network performance.

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.NI(Networking and Internet Architecture)