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 "on spatial capacity of wireless ad hoc networks with threshold based scheduling"):
  Abstract: This paper studies spatial capacity in a stochastic wireless ad hoc network, where multi-stage probing and data transmission are sequentially performed. We propose a novel signal-to-interference-ratio (SIR) threshold based scheduling scheme, where by starting with the first probing, each transmitter iteratively decides to further probe or stay idle, depending on whether the estimated SIR in the proceeding probing is larger or smaller than a predefined threshold. Although one can assume that the transmitters are initially deployed according to a homogeneous Poisson point process (PPP), the SIR based scheduling makes the PPP no longer applicable to model the locations of retained transmitters in the subsequent probing and data transmission phases, due to the interference induced coupling in their decisions. We first focus on single-stage probing and find that when the SIR threshold is set sufficiently small to assure an acceptable interference level in the network, the proposed scheme can greatly outperform the non-scheduling reference scheme in terms of spatial capacity. We clearly characterize the spatial capacity and obtain exact/approximate closed-form expressions, by proposing a new approximate approach to deal with the correlated SIR distributions over non-Poisson point processes. Then we successfully extend to multi-stage probing by properly designing the multiple SIR thresholds to assure gradual improvement of the spatial capacity. Furthermore, we analyze the impact of multi-stage probing overhead and present a probing-capacity tradeoff in scheduling design. Finally, extensive numerical results are presented to demonstrate the performance of the proposed scheduling as compared to existing schemes.

Includes members:
  Member "spatial throughput characterization in cognitive radio networks with threshold based opportunistic spectrum access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "information exchange in randomly deployed dense wsns with wireless energy harvesting capabilities")
  Member "exploiting regional differences a spatially adaptive random access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random access with opportunity detection in wireless networks")
  Member "adaptive spatial aloha fairness and stochastic geometry":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptive csma under the sinr model efficient approximation algorithms for throughput and utility maximization")
  Member "analytical modeling of uplink cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamic tdd interference analysis in macro cell and small cell deployments")
  Member "a tractable approach to coverage and rate in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "on a game theoretic approach to capacity maximization in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "fractional power control for decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stability and metastability of traffic dynamics in uplink random access 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)