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 "randomized vs orthogonal spectrum allocation in decentralized networks outage analysis"):
  Abstract: We address a decentralized wireless communication network with a fixed number $u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs. It is assumed that the number of users $N$ is a random variable with a given distribution and the channel gains are quasi-static Rayleigh fading. The transmitters are assumed to be unaware of the number of active users in the network as well as the channel gains and not capable of detecting the presence of other users in a given frequency sub-band. Moreover, the users are unaware of each other's codebooks and hence, no multiuser detection is possible. We consider a randomized Frequency Hopping (FH) scheme in which each transmitter randomly hops over a subset of the $u$ sub-bands from transmission to transmission. Developing a new upper bound on the differential entropy of a mixed Gaussian random vector and using entropy power inequality, we offer a series of lower bounds on the achievable rate of each user. Thereafter, we obtain lower bounds on the maximum transmission rate per user to ensure a specified outage probability at a given Signal-to-Noise Ratio (SNR) level. We demonstrate that the so-called outage capacity can be considerably higher in the FH scheme than in the Frequency Division (FD) scenario for reasonable distributions on the number of active users. This guarantees a higher spectral efficiency in FH compared to FD.

Includes members:
  Member "a model for randomized resource allocation in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless networks with asynchronous users")
  Member "bandwidth partitioning in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reliability and local delay in wireless networks does bandwidth partitioning help")
  Member "fractional power control for decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stability and metastability of traffic dynamics in uplink random access networks")
  Member "throughput scaling laws for wireless networks with fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hierarchical radio resource optimization for heterogeneous networks with enhanced inter cell interference coordination eicic")
  Member "rate constrained wireless networks with fading channels interference limited and noise limited regimes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "throughput of one hop wireless networks with noisy feedback channel")
  Member "the effect of fading channel inversion and threshold scheduling on ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hiding communications in awgn channels and thz band with interference uncertainty")
  Member "on the user selection for mimo broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an overview on resource allocation techniques for multi user mimo systems")
  Member "cognitive radio an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cognitive radio networks an information theoretic perspective")

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)