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 "delay analysis of spatially coded mimo zfbf with retransmissions in random networks"):
  Abstract: For a low-mobile Poisson bipolar network and under line-of-sight/non-line-of-sight (LOS/NLOS) path-loss model, we study repetitive retransmissions (RR) and blocked incremental redundancy (B-IR). We consider spatially-coded multiple-input multiple-output (MIMO) zero-forcing beamforming (ZFBF) multiplexing system, whereby the packet success reception is determined based on the aggregate data rate across spatial dimensions of the MIMO system. Characterization of retransmission performance in this low-mobile configuration is practically important, but inherently complex due to a substantial rate correlation across retransmissions and intractability of evaluating the probability density function (pdf) of aggregate data rate. Adopting tools of stochastic geometry, we firstly characterize the rate correlation coefficient (RCC) for both schemes. Our results show that, compared to RR scheme, B-IR scheme has higher RCC while its coverage probability is substantially larger. We demonstrate that the spotted contention between coverage probability and RCC causes the mean transmission delay (MTD) of B-IR to become either smaller or larger than the MTD of RR scheme. Finally, we develop a numerical approximation of MTD, and evaluate the effective spatial throughput (EST), which is reciprocal to MTD, of RR and B-IR schemes. Our numerical results highlight fundamental tradeoffs between densification, multiplexing gain, block length, and activity factor of nodes. We further observe that for dense networks 1) LOS component is considerably instrumental to enhance EST; 2) EST of B-IR scheme can be much higher than that of RR scheme; 3) When Doppler spread exists, it can improve MTD of B-IR while it does not cast any meaningful effect on the MTD of RR.

Includes members:
  Member "capacity of cellular wireless network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cognitive lpwan towards intelligent wireless services in hybrid low power wide area networks")
  Member "impact of los nlos propagation and path loss in ultra dense cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spectral efficiency analysis in dense massive mimo networks")
  Member "heterogeneous cellular networks with spatio temporal traffic delay analysis and scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "managing interference correlation through random medium access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "diversity polynomials for the analysis of temporal correlations in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "diversity loss due to interference correlation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "open loop spatial multiplexing and diversity communications in ad hoc 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")
  Member "throughput delay reliability tradeoff with arq in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a new small world iot routing mechanism based on cayley graphs")

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)