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 "wireless networks with asynchronous users"):
  Abstract: This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for interference is considered by assuming the starting point of an interferer's data is uniformly distributed along the codeword of any user. This model is not ergodic, however, we show that the noise plus interference process satisfies an Asymptotic Equipartition Property (AEP) under certain conditions. This enables us to define achievable rates in the conventional Shannon sense. The spectrum is divided to private and common bands. Each user occupies its assigned private band and the common band upon activation. In a scenario where all transmitters are unaware of the number of active users and the channel gains, the optimum spectrum assignment is obtained such that the so-called outage capacity per user is maximized. If $\Pr\{\mathbf{n}>2\}>0$, all users follow a locally Randomized On-Off signaling scheme on the common band where each transmitter quits transmitting its Gaussian signals independently from transmission to transmission. Achievable rates are developed using a conditional version of Entropy Power Inequality (EPI) and an upper bound on the differential entropy of a mixed Gaussian random variable. Thereafter, the activation probability on each transmission slot together with the spectrum assignment are designed resulting in the largest outage capacity.

Includes members:
  Member "randomized vs orthogonal spectrum allocation in decentralized networks outage analysis":
    also connected through other hyperedges:
      (none)
  Member "a model for randomized resource allocation in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "randomized vs orthogonal spectrum allocation in decentralized networks outage analysis")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "cognitive radio an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "capacity limits of cognitive radio with distributed and dynamic spectral activity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mcleish distribution performance of digital communications over additive white mcleish noise awmn channels")

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)