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 "interference functionals in poisson networks"):
  Abstract: We propose and prove a theorem that allows the calculation of a class of functionals on Poisson point processes that have the form of expected values of sum–products of functions. In proving the theorem, we present a variant of the Campbell–Mecke theorem from stochastic geometry. We proceed to apply our result in the calculation of expected values involving interference in wireless Poisson networks. Based on this, we derive outage probabilities for transmissions in a Poisson network with Nakagami fading. Our results extend the stochastic geometry toolbox used for the mathematical analysis of interference-limited wireless networks.

Includes members:
  Member "cooperative relaying under spatially and temporally correlated interference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "managing interference correlation through random medium access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "effect of spatial interference correlation on the performance of maximum ratio combining":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "a stochastic geometry analysis of inter cell interference coordination and intra cell diversity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sir analysis via signal fractions")
  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 "diversity polynomials for the analysis of temporal correlations in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "equivalence and comparison of heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "analyzing lora long range low power wide area networks using stochastic geometry")
  Member "packet travel times in wireless relay chains under spatially and temporally dependent interference":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "temporal correlation of interference and outage in mobile networks over one dimensional finite regions")

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)