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 "scheduling and power allocation to optimize service and queue waiting times in cognitive radio uplinks"):
  Abstract: In this report, we study the packet delay as a QoS metric in CR systems. The packet delay includes the queue waiting time and the service time. In this work, we study the effect of both the scheduling and the power allocation algorithms on the delay performance of the SUs. #R##N#To study the delay due to the service time we study a multichannel system where the channels are sensed sequentially, we study the tradeoff between throughput and delay. The problem is formulated as an optimal stopping rule problem where there is a tradeoff between the service time and the throughput. This tradeoff results from skipping low-quality channels to seek the possibility of finding high-quality ones in the future at the expense of a higher probability of being blocked from transmission since these future channels might be busy. #R##N#On the other hand, the queue waiting time is studied by considering a multi-user single channel system. Specifically, we study the effect of scheduling and power allocation on the delay performance of all SUs in the system. We propose a delay optimal algorithm that protects the PUs from harmful interference and provides the required delay guarantees to users. Conventional scheduling algorithms do not provide such guarantees if the interference channels are heterogeneous. This is because they are developed for conventional non-CR wireless systems that neglect interference since channels are orthogonal. #R##N#Finally, we present two potential extensions to these studied problems.

Includes members:
  Member "throughput optimization in multichannel cognitive radios with hard deadline constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "queue aware joint dynamic interference coordination and heterogeneous qos provisioning in ofdma networks")
  Member "throughput maximization in multi channel cognitive radio systems with delay constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "supervised machine learning for signals having rrc shaped pulses")
  Member "optimal power cost management using stored energy in data centers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online inventory management with application to energy procurement in data centers")
  Member "scheduling heterogeneous real time traffic over fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless 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)