human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal power control and scheduling for real time and non real time data"
  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 two sum-rate-maximizing algorithms that satisfy these constraints as well as achieving the system's capacity region. In both algorithms, the power allocation policy 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. The first algorithm is optimal for the on-off channel model with a polynomial-time scheduling complexity in the number of RT users. The second, on the other hand, works for any channel fading model which is shown, through simulations, to have an average complexity that is close-to-linear. We also show the superiority of the proposed algorithms over existing approaches using extensive simulations.

Connected through hyperedge HE-1 (induced by source paper "offloading deadline constrained cellular traffic"):
  with members:
    - "base station assisted device to device communications for high throughput wireless video networks"
    - "the throughput outage tradeoff of wireless one hop caching networks"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-2 (induced by source paper "optimal power control and scheduling under hard deadline constraints for continuous fading channels"):
  with members:
    - "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios"
    - "power control and scheduling under hard deadline constraints for on off fading channels"
    - "throughput optimization in multichannel cognitive radios with hard deadline constraints"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Question: Please tell me which class the center node 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)