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 "analyzing the impact of access point density on the performance of finite area networks"):
  Abstract: Assuming a network of infinite extent, several researchers have analyzed small-cell networks using a Poisson point process (PPP) location model, leading to simple analytic expressions. The general assumption has been that these results apply to finite-area networks as well. However, do the results of infinite-area networks apply to finite-area networks? In this paper, we answer this question by obtaining an accurate approximation for the achievable signal-to-interference-plus-noise ratio (SINR) and user capacity in the downlink of a  finite-area  network with  a fixed number of  access points (APs). The APs are uniformly distributed within the area of interest. Our analysis shows that, crucially, the results of infinite-area networks are very different from those for finite-area networks of low-to-medium AP density. Comprehensive simulations are used to illustrate the accuracy of our analysis. For practical values of signal transmit powers and AP densities, the analytic expressions capture the behavior of the system well. As an added benefit, the formulations developed here can be used in parametric studies for network design. Here, the analysis is used to obtain the required number of APs to guarantee a desired target capacity in a finite-area network.

Includes members:
  Member "joint rate and sinr coverage analysis for decoupled uplink downlink biased cell associations in hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a spatiotemporal framework for information freshness in iot uplink networks")
  Member "an analysis of the ds cdma cellular uplink for arbitrary and constrained topologies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "frequency hopping on a 5g millimeter wave uplink")
  Member "downlink mimo hetnets modeling ordering results and performance analysis":
    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 "equivalence and comparison of heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analyzing lora long range low power wide area networks using stochastic geometry")
  Member "analyzing the reduced required bs density due to comp in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analyzing the impact of inter cooperation region interference in coordinated multi point uplink networks")
  Member "average rate of downlink heterogeneous cellular networks over generalized fading channels a stochastic geometry approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "distance distributions in regular polygons":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")
  Member "downlink rate distribution in heterogeneous cellular networks under generalized cell selection":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "millimeter wave integrated access and backhaul in 5g performance analysis and design insights")

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)