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: "asymptotically optimal policies for hard deadline scheduling over fading channels"
  Abstract: A hard-deadline, opportunistic scheduling problem in which $B$ bits must be transmitted within $T$ time-slots over a time-varying channel is studied: the transmitter must decide how many bits to serve in each slot based on knowledge of the current channel but without knowledge of the channel in future slots, with the objective of minimizing expected transmission energy. In order to focus on the effects of delay and fading, we assume that no other packets are scheduled simultaneously and no outage is considered. We also assume that the scheduler can transmit at capacity where the underlying noise channel is Gaussian such that the energy-bit relation is a Shannon-type exponential function. No closed form solution for the optimal policy is known for this problem, which is naturally formulated as a finite-horizon dynamic program, but three different policies are shown to be optimal in the limiting regimes where $T$ is fixed and $B$ is large, $T$ is fixed and $B$ is small, and where $B$ and $T$ are simultaneously taken to infinity. In addition, the advantage of optimal scheduling is quantified relative to a non-opportunistic (i.e., channel-blind) equal-bit policy.

Connected through hyperedge HE-1 (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"
    - "energy efficient scheduling of delay constrained traffic over fading channels"

Connected through hyperedge HE-2 (induced by source paper "online energy efficient packet scheduling for a common deadline with and without energy harvesting"):
  with members:
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems"
    - "delay aware bs discontinuous transmission control and user scheduling for energy harvesting downlink coordinated mimo systems"
    - "competitive ratio analysis of online algorithms to minimize data transmission time in energy harvesting communication system"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimal packet scheduling on an energy harvesting broadcast link"
    - "energy optimal transmission scheduling in wireless sensor networks"
    - "optimal packet scheduling in an energy harvesting communication system"

Connected through hyperedge HE-3 (induced by source paper "energy efficient relaying over multiple slots with causal csi"):
  with members:
    - "on the monotonicity log concavity and tight bounds of the generalized marcum and nuttall q functions"
    - "energy efficient scheduling of delay constrained traffic over fading channels"
    - "distributed power allocation strategies for parallel relay networks"

Connected through hyperedge HE-4 (induced by source paper "proactive resource allocation harnessing the diversity and multicast gains"):
  with members:
    - "high snr analysis of outage limited communications with bursty and delay limited information"

Connected through hyperedge HE-5 (induced by source paper "delay constrained scheduling over fading channels optimal policies for monomial energy cost functions"):
  with members:
    - "energy efficient scheduling of delay constrained traffic over 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)