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: "delay analysis in full duplex heterogeneous cellular networks"
  Abstract: Heterogeneous networks (HetNets) as a combination of macro cells and small cells are used to increase the cellular network's capacity, and present a perfect solution for high-speed communications. Increasing area spectrum efficiency and capacity of HetNets largely depends on the high speed of backhaul links. One effective way which is currently utilized in HetNets is the use of full-duplex (FD) technology that potentially doubles the spectral efficiency without the need for additional spectrum. On the other hand, one of the most critical network design requirements is delay, which is a key representation of the quality of service (QoS) in modern cellular networks. In this paper, by utilizing tools from the stochastic geometry, we analyze the local delay for downlink (DL) channel, which is typically defined as the mean number of required time slots for a successful communication. Given imperfect self-interference (SI) cancellation in practical FD communications, we utilize duplex mode (half-duplex (HD) or FD) for each user based on the distance from its serving base station (BS). Further, we aim to investigate the energy efficiency (EE) for both duplexing modes, i.e., HD and FD, by considering local delay. We conduct extensive simulations to validate system performance in terms of local delay versus different system key parameters.

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)