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 "cooperative transmissions in ultra dense networks under a bounded dual slope path loss model"):
  Abstract: In an Ultra-dense network (UDN) where there are more base stations (BSs) than active users, it is possible that many BSs are instantaneously left idle. Thus, how to utilize these dormant BSs by means of cooperative transmission is an interesting question. In this paper, we investigate the performance of a UDN with two types of cooperation schemes: non-coherent joint transmission (JT) without channel state information (CSI) and coherent JT with full CSI knowledge. We consider a bounded dual-slope path loss model to describe UDN environments where a user has several BSs in the near-field and the rest in the far-field. Numerical results show that non-coherent JT cannot improve the user spectral efficiency (SE) due to the simultaneous increment in signal and interference powers. For coherent JT, the achievable SE gain depends on the range of near-field, the relative densities of BSs and users, and the CSI accuracy. Finally, we assess the energy efficiency (EE) of cooperation in UDN. Despite costing extra energy consumption, cooperation can still improve EE under certain conditions.

Includes members:
  Member "tractable resource management with uplink decoupled millimeter wave overlay in ultra dense cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  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 "downlink cellular network analysis with multi slope path loss models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "asymptotic behavior of ultra dense cellular networks and its economic impact":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "self organized scheduling request for uplink 5g networks a d2d clustering approach")
  Member "will the area spectral efficiency monotonically grow as small cells go dense":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "modeling and performance analysis in cache enabled millimeter wave hetnets with access and backhaul integration")
  Member "how user throughput depends on the traffic demand in large cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "statistical learning of geometric characteristics of wireless networks")
  Member "downlink capacity and base station density in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ran slicing for massive iot and bursty urllc service multiplexing analysis and optimization")

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)