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 "power control in full duplex networks area spectrum efficiency and energy efficency"):
  Abstract: Full-duplex (FD) allows the exchange of data between nodes on the same temporal and spectrum resources, however, it introduces self interference (SI) and additional network interference compared to half-duplex (HD). Power control in the FD networks, which is seldom studied in the literature, is promising to mitigate the interference and improve the performance of the overall network. In this work, we investigate the random and deterministic power control strategies in the FD networks, namely, constant power control, uniform power control, fractional power control and ALOHA-like random on-off power control scheme. Based on the obtained coverage probabilities and their robust approximations, we show that power control provides remarkable gain in area spectrum efficiency (ASE) and energy efficiency (EE), and improves the fairness among the uplink (UL) and downlink (DL) transmissions with respect to the FD networks. Moreover, we evaluate the minimum SI cancellation capability to guarantee the performance of the cell-edge users in FD networks. Generally, power control is helpful to improve the performance of the transmission for long distance in the FD networks and reduce the requirement of SI cancellation capability.

Includes members:
  Member "spatial spectrum and energy efficiency of random cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "throughput analysis for full duplex wireless networks with imperfect self interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance trade off between uplink and downlink in full duplex communications")
  Member "hybrid full half duplex system analysis in heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "edge computing enabled cell free massive mimo systems")
  Member "downlink capacity and base station density in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ran slicing for massive iot and bursty urllc service multiplexing analysis and optimization")
  Member "fractional power control for decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stability and metastability of traffic dynamics in uplink random access 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)