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 "downlink coverage analysis for a finite 3d wireless network of unmanned aerial vehicles"):
  Abstract: In this paper, we consider a finite network of unmanned aerial vehicles (UAVs) serving a given region. Modeling this network as a uniform binomial point process (BPP), we derive the downlink coverage probability of a reference receiver located at an arbitrary position on the ground assuming Nakagami-$m$ fading for all wireless links. The reference receiver is assumed to connect to its closest transmitting node as is usually the case in cellular systems. After deriving the distribution of distances from the reference receiver to the serving and interfering nodes, we derive an exact expression for downlink coverage probability in terms of the derivative of Laplace transform of interference power distribution. In the downlink of this system, it is not unusual to encounter scenarios in which the line-of-sight (LOS) component is significantly stronger than the reflected multipath components. To emulate such scenarios, we also derive the coverage probability in the absence of fading from the results of Nakagami-$m$ fading by taking the limit $m \to \infty$. Using asymptotic expansion of incomplete gamma function, we concretely show that this limit reduces to a redundant condition. Consequently, we derive an accurate coverage probability approximation for this case using dominant interferer-based approach in which the effect of dominant interferer is exactly captured and the residual interference from other interferers is carefully approximated. We then derive the bounds of the approximate coverage probability using Berry-Esseen theorem. Our analyses reveal several useful trends in coverage probability as a function of height of the transmitting nodes and the location of reference receiver on the ground.

Includes members:
  Member "efficient deployment of multiple unmanned aerial vehicles for optimal wireless coverage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of uav communications in cell free massive mimo systems")
  Member "unmanned aerial vehicle with underlaid device to device communications performance and tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of mobile cellular connected drones under practical antenna configurations")
  Member "analyzing the impact of access point density on the performance of finite area networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "temporal correlation of interference and outage in mobile networks over one dimensional finite regions")
  Member "performance analysis of micro unmanned airborne communication relays for cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "power efficient deployment of uavs as relays")
  Member "dual branch mrc receivers under spatial interference correlation and nakagami fading":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interference prediction in wireless networks stochastic geometry meets recursive filtering")
  Member "distance distributions in regular polygons":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")
  Member "distance distributions in finite uniformly random networks theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")

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.IT(Information Theory)