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 "sinr and throughput of dense cellular networks with stretched exponential path loss"):
  Abstract: Distance-based attenuation is a critical aspect of wireless communications. As opposed to the ubiquitous power-law path loss model, this paper proposes a stretched exponential path loss model that is suitable for short-range communication. In this model, the signal power attenuates over a distance $r$ as $e^{-\alpha r^{\beta}}$, where $\alpha,\beta$ are tunable parameters. Using experimental propagation measurements, we show that the proposed model is accurate for short to moderate distances in the range $r \in (5,300)$ meters and so is a suitable model for dense and ultradense networks. We integrate this path loss model into a downlink cellular network with base stations modeled by a Poisson point process, and derive expressions for the coverage probability, potential throughput, and area spectral efficiency. Although the most general result for coverage probability has a double integral, several special cases are given where the coverage probability has a compact or even closed form. We then show that the potential throughput is maximized for a particular BS density and then collapses to zero for high densities, assuming a fixed SINR threshold. We next prove that the area spectral efficiency, which assumes an adaptive SINR threshold, is non-decreasing with the BS density and converges to a constant for high densities.

Includes members:
  Member "effect of densification on cellular network performance with bounded pathloss model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hetnets coverage modeling and analysis over fox s mathcal h fading channels")
  Member "modeling and analysis of cellular networks using stochastic geometry a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "ergodic spectral efficiency in mimo cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "massive mimo forward link analysis for cellular networks")
  Member "a primer on cellular network analysis using stochastic geometry":
    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 "coverage and capacity scaling laws in downlink ultra dense cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "downlink cellular network analysis with los nlos propagation and elevated base stations")
  Member "study on the idle mode capability with los and nlos transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cellular connectivity for uavs network modeling performance analysis and design guidelines")
  Member "unified stochastic geometry modeling and analysis of cellular networks in los nlos and shadowed fading":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hetnets coverage modeling and analysis over fox s mathcal h fading channels")
  Member "modeling cellular networks in fading environments with dominant specular components":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a unified asymptotic analysis of area spectral efficiency in ultradense cellular 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.IT(Information Theory)