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: "throughput optimization in multichannel cognitive radios with hard deadline constraints"
  Abstract: In a cognitive radio scenario, we consider a single secondary user (SU) accessing a multichannel system. The SU senses the channels sequentially to detect if a primary user (PU) is occupying the channels and stops its search to access a channel if it offers a significantly high throughput. The optimal stopping rule and power control problem is considered. The problem is formulated as an SU's throughput-maximization problem under power, interference, and packet delay constraints. We first show the effect of the optimal stopping rule on packet delay and then solve this optimization problem for both the overlay system, where the SU transmits only at the spectrum holes, and the underlay system, where tolerable interference (or tolerable collision probability) is allowed. We provide closed-form expressions for the optimal stopping rule and show that the optimal power control strategy for this multichannel problem is a modified waterfilling approach. We extend the work to a multi-SU scenario and show that when the number of SUs is large, the complexity of the solution becomes smaller than that of the single-SU case. We discuss the application of this problem in typical networks where packets simultaneously arrive and have the same departure deadline. We further propose an online adaptation policy to the optimal stopping rule that meets the packets' hard-deadline constraint and, at the same time, gives higher throughput than the offline policy.

Connected through hyperedge HE-1 (induced by source paper "queue aware joint dynamic interference coordination and heterogeneous qos provisioning in ofdma networks"):
  with members:
    - "utility optimal dynamic rate allocation under average end to end delay requirements"
    - "decentralized throughput maximizing policies for deadline constrained wireless networks"
    - "partially distributed resource allocation in small cell networks"
    - "resource allocation optimization for delay sensitive traffic in fronthaul constrained cloud radio access networks"
    - "distributed interference management policies for heterogeneous small cell networks"

Connected through hyperedge HE-2 (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"
    - "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"
    - "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 "optimal power control and scheduling for real time and non real time data"):
  with members:
    - "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios"
    - "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-4 (induced by source paper "on the performance of delay aware shared access with priorities"):
  with members:
    - "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios"
    - "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-5 (induced by source paper "delay optimal joint scheduling and power control for cognitive radio uplinks"):
  with members:
    - "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios"
    - "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"
    - "dynamic scheduling for delay guarantees for heterogeneous cognitive radio users"

Connected through hyperedge HE-6 (induced by source paper "power control and scheduling under hard deadline constraints for on off fading channels"):
  with members:
    - "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios"
    - "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-7 (induced by source paper "scheduling and power allocation to optimize service and queue waiting times in cognitive radio uplinks"):
  with members:
    - "throughput maximization in multi channel cognitive radio systems with delay constraints"
    - "optimal power cost management using stored energy in data centers"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-8 (induced by source paper "joint scheduling and power control for delay guarantees in heterogeneous cognitive radios"):
  with members:
    - "scheduling and power allocation to optimize service and queue waiting times in cognitive radio uplinks"
    - "dynamic scheduling for delay guarantees for heterogeneous cognitive radio users"
    - "optimal power cost management using stored energy in data centers"

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)