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: "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios"
  Abstract: An uplink multisecondary user (SU) cognitive radio system having average delay constraints as well as an interference constraint to the primary user (PU) is considered. If the interference channels between the SUs and the PU are statistically heterogeneous due to the different physical locations of the different SUs, the SUs will experience different delay performances. This is because SUs located closer to the PU transmit with lower power levels. Two dynamic scheduling-and-power-allocation policies that can provide the required average delay guarantees to all SUs irrespective of their locations are proposed. The first policy solves the problem when the interference constraint is an instantaneous one, while the second is for problems with long-term average interference constraints. We show that although the average interference problem is an extension to the instantaneous interference one, the solution is totally different. The two policies, derived using the Lyapunov optimization technique, are shown to be asymptotically delay optimal while satisfying the delay and interference constraints. Our findings are supported by extensive system simulations and shown to outperform the existing policies as well as shown to be robust to channel estimation errors.

Connected through hyperedge HE-1 (induced by source paper "optimal power control and scheduling under hard deadline constraints for continuous fading channels"):
  with members:
    - "optimal power control and scheduling for real time and non real time data"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "optimal power control and scheduling for real time and non real time data"):
  with members:
    - "throughput optimization in multichannel cognitive radios with hard deadline constraints"
    - "optimal power cost management using stored energy in data centers"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-3 (induced by source paper "on the performance of delay aware shared access with priorities"):
  with members:
    - "throughput optimization in multichannel cognitive radios with hard deadline constraints"
    - "relay assisted multiple access with full duplex multi packet reception"
    - "throughput of a cognitive radio network under congestion constraints a network level study"
    - "what will 5g be"
    - "low rate machine type communication via wireless device to device d2d links"
    - "power control for d2d underlaid cellular networks modeling algorithms and analysis"
    - "stable throughput in a cognitive wireless network"
    - "optimal utilization of a cognitive shared channel with a rechargeable primary source node"

Connected through hyperedge HE-4 (induced by source paper "delay optimal joint scheduling and power control for cognitive radio uplinks"):
  with members:
    - "separation of signals consisting of amplitude and instantaneous frequency rrc pulses using snr uniform training"
    - "delay optimal scheduling and power control for instantaneous interference limited crs"
    - "throughput optimization in multichannel cognitive radios with hard deadline constraints"
    - "dynamic scheduling for delay guarantees for heterogeneous cognitive radio users"

Connected through hyperedge HE-5 (induced by source paper "power control and scheduling under hard deadline constraints for on off fading channels"):
  with members:
    - "throughput optimization in multichannel cognitive radios with hard deadline constraints"
    - "optimal power cost management using stored energy in data centers"
    - "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)