human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on optimizing power allocation for reliable communication over fading channels with uninformed transmitter"):
  Abstract: We investigate energy efficient packet scheduling and power allocation problem for the services which require reliable communication to guarantee a certain quality of experience (QoE). We establish links between average transmit power and reliability of data transfer, which depends on both average amount of data transfer and short term rate guarantees. We consider a slow-fading point-to-point channel without channel state information at the transmitter side (CSIT). In the absence of CSIT, the slow fading channel has an outage probability associated with every transmit power. As a function of data loss tolerance parameters, and minimum rate and peak power constraints, we formulate an optimization problem that adapts rate and power to minimize the average transmit power for the user equipment (UE). Then, a relaxed optimization problem is formulated where transmission rate is assumed to be fixed for each packet transmission. We use Markov chain to model constraints of the optimization problem. The corresponding problem is not convex for both of the formulated problems, therefore a stochastic optimization technique, namely the simulated annealing algorithm, is used to solve them. The numerical results quantify the effect of various system parameters on average transmit power and show significant energy savings when the service has less stringent requirements on timely and reliable communication.

Includes members:
  Member "energy efficient scheduling for loss tolerant iot applications with uninformed transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal and low complexity dynamic spectrum access for rf powered ambient backscatter system with online reinforcement learning")
  Member "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed federated learning for ultra reliable low latency vehicular communications")
  Member "energy and bursty packet loss tradeoff over fading channels a system level model":
    also connected through other hyperedges:
      (none)
  Member "downlink transmission of short packets framing and control information revisited":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transmission energy minimization for heterogeneous low latency noma downlink")
  Member "asymptotically optimal policies for hard deadline scheduling over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online energy efficient packet scheduling for a common deadline with and without energy harvesting")
  Member "energy efficient scheduling of delay constrained traffic over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite horizon throughput maximization for a wirelessly powered device over a time varying channel")

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