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: "energy efficient scheduling of delay constrained traffic over fading channels"
  Abstract: A delay-constrained scheduling problem for point-to-point communication is considered: a packet of $B$ bits must be transmitted by a hard deadline of $T$ slots over a time-varying channel. The transmitter/scheduler must determine how many bits to transmit, or equivalently how much energy to transmit with, during each time slot based on the current channel quality and the number of unserved bits, with the objective of minimizing expected total energy. In order to focus on the fundamental scheduling problem, it is assumed that no other packets are scheduled during this time period and no outage is allowed. Assuming transmission at capacity of the underlying Gaussian noise channel, a closed-form expression for the optimal scheduling policy is obtained for the case T=2 via dynamic programming; for $T>2$, the optimal policy can only be numerically determined. Thus, the focus of the work is on derivation of simple, near-optimal policies based on intuition from the T=2 solution and the structure of the general problem. The proposed bit-allocation policies consist of a linear combination of a delay-associated term and an opportunistic (channel-aware) term. In addition, a variation of the problem in which the entire packet must be transmitted in a single slot is studied, and a channel-threshold policy is shown to be optimal.

Connected through hyperedge HE-1 (induced by source paper "finite horizon throughput maximization for a wirelessly powered device over a time varying channel"):
  with members:
    - "finite horizon throughput maximization and sensing optimization in wireless powered devices over fading channels"
    - "non orthogonal multiple access schemes in wireless powered communication networks"
    - "battery powered devices in wpcns"
    - "energy efficient resource allocation for wireless powered communication networks"
    - "optimal resource allocation in full duplex wireless powered communication network"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "throughput maximization in wireless powered communication networks"

Connected through hyperedge HE-2 (induced by source paper "on optimizing power allocation for reliable communication over fading channels with uninformed transmitter"):
  with members:
    - "energy efficient scheduling for loss tolerant iot applications with uninformed transmitter"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "energy and bursty packet loss tradeoff over fading channels a system level model"
    - "downlink transmission of short packets framing and control information revisited"
    - "asymptotically optimal policies for hard deadline scheduling over fading channels"

Connected through hyperedge HE-3 (induced by source paper "joint routing scheduling and power control providing hard deadline in wireless multihop networks"):
  with members:
    - "decentralized throughput maximizing policies for deadline constrained wireless networks"
    - "scheduling for stable and reliable communication over multiaccess channels and degraded broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "live prefetching for mobile computation offloading"):
  with members:
    - "dynamic computation offloading for mobile edge computing with energy harvesting devices"
    - "ultra reliable cloud mobile computing with service composition and superposition coding"
    - "energy efficient resource allocation for mobile edge computation offloading"
    - "a cooperative scheduling scheme of local cloud and internet cloud for delay aware mobile cloud computing"
    - "joint optimization of radio and computational resources for multicell mobile edge computing"
    - "energy efficient mobile cloud computing powered by wireless energy transfer"
    - "efficient multi user computation offloading for mobile edge cloud computing"
    - "mobility induced service migration in mobile micro clouds"

Connected through hyperedge HE-5 (induced by source paper "bound based power optimization for multi hop heterogeneous wireless industrial networks under statistical delay constraints"):
  with members:
    - "statistical delay bound for wirelesshart networks"
    - "towards a system theoretic approach to wireless network capacity in finite time and space"
    - "non equilibrium information envelopes and the capacity delay error tradeoff of source coding"
    - "delay constrained throughput analysis of a correlated mimo wireless channel"
    - "an end to end probabilistic network calculus with moment generating functions"

Connected through hyperedge HE-6 (induced by source paper "optimal energy allocation for delay constrained traffic over fading multiple access channels"):
  with members:
    - "iterative dynamic water filling for fading multiple access channels with energy harvesting"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "power allocation for energy harvesting transmitter with causal information"
    - "on the capacity of multiple access and broadcast fading channels with full channel state information at low snr"

Connected through hyperedge HE-7 (induced by source paper "maximizing energy efficiency in multiple access channels by exploiting packet dropping and transmitter buffering"):
  with members:
    - "green cellular networks a survey some research issues and challenges"

Connected through hyperedge HE-8 (induced by source paper "opportunistic secrecy with a strict delay constraint"):
  with members:
    - "secret key agreement with channel state information at the transmitter"
    - "on the delay limited secrecy capacity of fading 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)