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: "effective capacity of noma with finite blocklength for low latency communications"
  Abstract: In this paper, we investigate the link-layer rate of a two-users non-orthogonal multiple access (NOMA) network in finite blocklength (short packet communications) regime, where the two users are paired from a set of V users. The overall reliability consists of the transmission error probability and the queuing delay violation probability. The performance of the two-users NOMA network in finite blocklength is verified for achieving latency and reliability, using the effective capacity (EC) framework. Specifically, we derive closed-form expressions for the EC of the two-users NOMA network in finite blocklength regime, considering transmissions over Rayleigh fading channels. We also study a multiuser NOMA network and derive the total EC of two-users NOMA subsets, and show that the NOMA set with users having distinct channel conditions achieve maximum total EC. Focusing on a two-users NOMA network, we study the impact of the transmit signal-to-noise ratio, delay exponent, and transmission error probability, on the achievable EC of each user. The analysis shows that when the delay exponent is high, the delay violation probability does not improve below a certain value due to the dominant factor of the transmission error probability. The accuracy of the proposed closed-form expressions for the individual EC of a two-users NOMA is verified using the Monte-Carlo simulations.

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)