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 "optimal power control and scheduling under hard deadline constraints for continuous fading channels"):
  Abstract: We consider a joint scheduling-and-power-allocation problem of a downlink cellular system. The system consists of two groups of users: real-time (RT) and non-real-time (NRT) users. Given an average power constraint on the base station, the problem is to find an algorithm that satisfies the RT hard deadline constraint and NRT queue stability constraint. We propose a sum-rate-maximizing algorithm that satisfies these constraints. We also show, through simulations, that the proposed algorithm has an average complexity that is close-to-linear in the number of RT users. The power allocation policy in the proposed algorithm has a closed-form expression for the two groups of users. However, interestingly, the power policy of the RT users differ in structure from that of the NRT users. We also show the superiority of the proposed algorithms over existing approaches using extensive simulations.

Includes members:
  Member "optimal power control and scheduling for real time and non real time data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "offloading deadline constrained cellular traffic")
  Member "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal power control and scheduling for real time and non real time data")
  Member "power control and scheduling under hard deadline constraints for on off fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic power control for packets with deadlines")
  Member "throughput optimization in multichannel cognitive radios with hard deadline constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "queue aware joint dynamic interference coordination and heterogeneous qos provisioning in ofdma networks")
  Member "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks")
  Member "scheduling heterogeneous real time traffic over fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)