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 "underlay cognitive radios with capacity guarantees for primary users"):
  Abstract: To use the spectrum efficiently, cognitive radios leverage knowledge of the channel state information (CSI) to optimize the performance of the secondary users (SUs) while limiting the interference to the primary users (PUs). The algorithms in this paper are designed to maximize the weighted ergodic sum-capacity of SUs, which transmit orthogonally and adhere simultaneously to constraints limiting: i) the long-term (ergodic) capacity loss caused to each PU receiver; ii) the long-term interference power at each PU receiver; and iii) the long-term power at each SU transmitter. Formulations accounting for short-term counterparts of i) and ii) are also discussed. Although the long-term capacity constraints are non-convex, the resultant optimization problem exhibits zero-duality gap and can be efficiently solved in the dual domain. The optimal allocation schemes (power and rate loadings, frequency bands to be accessed, and SU links to be activated) are a function of the CSI of the primary and secondary networks as well as the Lagrange multipliers associated with the long-term constraints. The optimal resource allocation algorithms are first designed under the assumption that the CSI is perfect, then the modifications needed to accommodate different forms of imperfect CSI (quantized, noisy, and outdated) are analyzed.

Includes members:
  Member "cross layer designs in coded wireless fading networks with multicast":
    also connected through other hyperedges:
      (none)
  Member "power control with imperfect exchanges and applications to spectrum sharing":
    also connected through other hyperedges:
      (none)
  Member "optimal bandwidth and power allocation for sum ergodic capacity under fading channels in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spectral efficiency of ofdma cognitive radios under imperfect cross link knowledge")
  Member "dynamic resource allocation in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint power control and passive beamforming in irs assisted spectrum sharing")
  Member "optimizing orthogonal multiple access based on quantized channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "jointly optimal sensing and resource allocation for multiuser overlay cognitive radios")
  Member "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal power control for over the air computation in fading channels")
  Member "on peak versus average interference power constraints for protecting primary users in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transmit power policy and ergodic multicast rate analysis of cognitive radio networks in generalized fading")
  Member "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cost aware learning and optimization for opportunistic spectrum access")

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)