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 "optimal energy allocation for delay constrained traffic over fading multiple access channels"):
  Abstract: In this paper, we consider a multiple-access fading channel where N users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over the transmission window. We derive the optimal energy allocation policy for each user that maximizes the total system throughput under two different assumptions on the channel state information. First, we consider the offline allocation problem where the channel states are known a priori before transmission. We solve a convex optimization problem to maximize the sum-throughput under energy and delay constraints. Next, we consider the online allocation problem, where the channels are causally known to the BS and obtain the optimal energy allocation via dynamic programming when the number of users is small. We also develop a suboptimal resource allocation algorithm whose performance is close to the optimal one. Numerical results are presented showing the superiority of the proposed algorithms over baseline algorithms in various scenarios.

Includes members:
  Member "iterative dynamic water filling for fading multiple access channels with energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "design of an miso swipt aided code index modulated multi carrier m dcsk system for e health iot")
  Member "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "throughput analysis of massive mimo uplink with low resolution adcs")
  Member "power allocation for energy harvesting transmitter with causal information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite horizon throughput maximization and sensing optimization in wireless powered devices over fading channels")
  Member "on the capacity of multiple access and broadcast fading channels with full channel state information at low snr":
    also connected through other hyperedges:
      (none)
  Member "energy efficient scheduling of delay constrained traffic over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)