human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "how to dimension 5g network when users are distributed on roads modeled by poisson line process"):
  Abstract: -The fifth generation (5G) New Radio (NR) interface inherits many concepts and techniques from 4G systems such as the Orthogonal Frequency Division Multiplex (OFDM) based waveform and multiple access. Dimensioning 5G NR interface will likely follow the same principles as in 4G networks. It 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 dimension-ing 5G NR radio resource (number of Physical Resource Blocks) considering its congestion probability, qualified as a relevant metric for QoS evaluation. Moreover, 5G users are assumed to be distributed in roads modeled by Poisson Line Process (PLP) instead of the widely-used 2D-Poisson Point Process. We derive the analytical expression of the congestion probability for analyzing its behavior as a function of network parameters. Then, we set its value, 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.

Includes members:
  Member "an analytical framework for coverage in cellular networks leveraging vehicles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how to dimension radio resources when users are distributed on roads modeled by poisson line process")
  Member "coverage analysis of a vehicular network modeled as cox process driven by poisson line process":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "how to dimension radio resources when users are distributed on roads modeled by poisson line process")
  Member "analytical tractability of hexagonal network model with random user location":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic tdd interference analysis in macro cell and small cell deployments")
  Member "robust methods for lte and wimax dimensioning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how to dimension radio resources when users are distributed on roads modeled by poisson line process")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")

Question: Please tell me which class the source paper 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)