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 "closed form expressions for the probability density function of the interference power in ppp networks"):
  Abstract: In this paper, we provide closed form expressions for the probability density functions (PDF) of the interference power in a network whose transmitters are arranged according to the Poisson Point Process (PPP). These expressions apply for any integer path loss exponent \eta greater than 2. Using the stretched exponential or Kohlrausch function, we show that the PDF formulas can be obtained as long as the Laplace transform (LT) for the PDF follows a specific common (exponential) formulation. Moreover, we show that such closed form expressions can be useful in deriving performance metrics for the network for any fading type experienced by the signals. Finally, using Monte-Carlo simulations and numerical analysis, we validate the accuracy of the proposed analytical derivations.

Includes members:
  Member "modeling and analysis of cellular networks using stochastic geometry a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "modeling heterogeneous network interference using poisson point processes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards reliable uav swarm communication in d2d enhanced cellular network")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)