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: "how to dimension radio resources when users are distributed on roads modeled by poisson line process"
  Abstract: Resources dimensioning aims at finding the number of radio resources required to carry a forecast data traffic at a target users Quality of Services (QoS). The present paper attempts to provide a new approach of radio resources dimensioning considering the congestion probability, qualified as a relevant metric for QoS evaluation. Users are assumed to be distributed according to a linear Poisson Point Process (PPP) in a random system of roads modeled by Poisson Line Process (PLP) instead of the widely-used spatial PPP. We derive the analytical expression of the congestion probability for analyzing its behavior as a function of network parameters. Finally we show how to dimension radio resources by setting a value of the congestion probability, often targeted by the operator, in order to find the relation between the necessary resources and the forecast data traffic expressed in terms of cell throughput. Different numerical results are presented to justify this dimensioning approach.

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)