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 "an overview of the transmission capacity of wireless networks"):
  Abstract: This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general end-to-end capacity results for multi-terminal or adhoc networks, the transmission capacity (TC) framework allows for quantification of achievable single-hop rates by focusing on a simplified physical/MAC-layer model. By using stochastic geometry to quantify the multi-user interference in the network, the relationship between the optimal spatial density and success probability of transmissions in the network can be determined, and expressed-often fairly simply-in terms of the key network parameters. The basic model and analytical tools are first discussed and applied to a simple network with path loss only and we present tight upper and lower bounds on transmission capacity (via lower and upper bounds on outage probability). We then introduce random channels (fading/shadowing) and give TC and outage approximations for an arbitrary channel distribution, as well as exact results for the special cases of Rayleigh and Nakagami fading. We then apply these results to show how TC can be used to better understand scheduling, power control, and the deployment of multiple antennas in a decentralized network. The paper closes by discussing shortcomings in the model as well as future research directions.

Includes members:
  Member "spatial multiplexing with mmse receivers single stream optimality in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance of pzf and mmse receivers in cellular networks with multi user spatial multiplexing")
  Member "random access transport capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal and suboptimal routing based on partial csi in random ad hoc networks")
  Member "performance of optimum combining in a poisson field of interferers and rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless powered asynchronous backscatter networks with sporadic short packets performance analysis and optimization")
  Member "transmission capacities for overlaid wireless ad hoc networks with outage constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatial throughput characterization in cognitive radio networks with threshold based opportunistic spectrum access")
  Member "transmission capacity of ad hoc networks with multiple antennas using transmit stream adaptation and interference cancelation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance analysis of outdoor mmwave ad hoc networks")
  Member "outage local throughput and capacity of random wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "modeling analysis and mitigation of dynamic botnet formation in wireless iot networks")
  Member "interference and outage in clustered wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "spatial interference cancellation for multi antenna mobile ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "generalized interference alignment part ii application to wireless secrecy")

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)