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 probability in cellular networks with poisson poisson cluster deployed base stations"):
  Abstract: Poisson-Poisson cluster processes (PPCPs) are a class of point processes exhibiting attractive point patterns. Recently, PPCPs are actively studied for modeling and analysis of heterogeneous cellular networks or device-to-device networks. However, surprisingly, to the best knowledge of the author, there is no exact derivation of downlink coverage probability in a numerically computable form for a cellular network with base stations (BSs) deployed according to a PPCP within the most fundamental setup such as single-tier, Rayleigh fading and nearest BS association. In this paper, we consider this fundamental model and derive a numerically computable form of coverage probability. To validate the analysis, we compare the results of numerical computations with those by Monte Carlo simulations and confirm the good agreement.

Includes members:
  Member "modeling and analysis of d2d millimeter wave networks with poisson cluster processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "clustered millimeter wave networks with non orthogonal multiple access")
  Member "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "poisson cluster process based analysis of hetnets with correlated user and base station locations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "interference functionals in poisson networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interference prediction in wireless networks stochastic geometry meets recursive filtering")
  Member "nearest neighbor and contact distance distributions for thomas cluster process":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the coverage performance of boolean poisson cluster models for wireless sensor networks")
  Member "modeling and performance analysis of clustered device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimizing joint probabilistic caching and channel access for clustered d2d networks")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna 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)