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 "coverage and capacity scaling laws in downlink ultra dense cellular networks"):
  Abstract: Driven by new types of wireless devices and the proliferation of bandwidth-intensive applications, data traffic and the corresponding network load are increasing dramatically. Network densification has been recognized as a promising and efficient way to provide higher network capacity and enhanced coverage. Most prior work on performance analysis of ultra-dense networks (UDNs) has focused on random spatial deployment with idealized singular path loss models and Rayleigh fading. In this paper, we consider a more precise and general model, which incorporates multi-slope path loss and general fading distributions. We derive the tail behavior and scaling laws for the coverage probability and the capacity considering strongest base station association in a Poisson field network. Our analytical results identify the regimes in which the signal-to-interference-plus-noise ratio (SINR) either asymptotically grows, saturates, or decreases with increasing network density. We establish general results on when UDNs lead to worse or even zero SINR coverage and capacity, and we provide crisp insights on the fundamental limits of wireless network densification.

Includes members:
  Member "a unified fading model using infinitely divisible distributions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance limits of network densification")
  Member "towards 1 gbps ue in cellular systems understanding ultra dense small cell deployments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "28 ghz and 73 ghz millimeter wave indoor propagation measurements and path loss models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cache enabled hetnets with millimeter wave small cells")
  Member "downlink cellular network analysis with multi slope path loss models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "modeling and analysis of k tier downlink heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "best signal quality in cellular networks asymptotic properties and applications to mobility management in small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance limits of network densification")

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)