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 "dual branch mrc receivers under spatial interference correlation and nakagami fading"):
  Abstract: Despite being ubiquitous in practice, the performance of maximal-ratio combining (MRC) in the presence of interference is not well understood. Because the interference received at each antenna originates from the same set of interferers but partially decorrelates over the fading channel, it possesses a complex correlation structure. This paper develops a realistic analytic model that accurately accounts for the interference correlation using stochastic geometry. Modeling interference by a Poisson shot noise process with independent Nakagami fading, we derive the link success probability for dual-branch  interference-aware  MRC. Using this result, we show that the common assumption that all receive antennas experience equal interference power underestimates the true performance, although this gap rapidly decays with increasing the Nakagami parameter    $m_{\rm I}$   of the interfering links. In contrast, ignoring interference correlation leads to a highly optimistic performance estimate for MRC, especially for large    $m_{\rm I}$  . In the low outage probability regime, our success probability expression can be considerably simplified. Observations based from the analysis include the following: 1) For small path loss exponents, MRC and minimum mean square error combining exhibit similar performance, and 2) the gains of MRC over selection combining are smaller in the interference-limited case than in the well-studied noise-limited case.

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 "a tractable model for noncoherent joint transmission base station cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "edge computing enabled cell free massive mimo systems")
  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 "cooperative relaying in a poisson field of interferers a diversity order analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "sinr based k coverage probability in cellular networks with arbitrary shadowing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sir meta distribution of k tier downlink heterogeneous cellular networks with cell range expansion")
  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 "downlink rate distribution in heterogeneous cellular networks under generalized cell selection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "millimeter wave integrated access and backhaul in 5g performance analysis and design insights")
  Member "diversity loss due to interference correlation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")

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)