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 "non orthogonal multiple access schemes in wireless powered communication networks"):
  Abstract: We characterize time and power allocations to optimize the sum-throughput of a Wireless Powered Communication Network (WPCN) with Non-Orthogonal Multiple Access (NOMA). In our setup, an Energy Rich (ER) source broadcasts wireless energy to several devices, which use it to simultaneously transmit data to an Access Point (AP) on the uplink. Differently from most prior works, in this paper we consider a generic scenario, in which the ER and AP do not coincide, i.e., two separate entities. We study two NOMA decoding schemes, namely Low Complexity Decoding (LCD) and Successive Interference Cancellation Decoding (SICD). For each scheme, we formulate a sum-throughput optimization problem over a finite horizon. Despite the complexity of the LCD optimization problem, attributed to its non-convexity, we recast it into a series of geometric programs. On the other hand, we establish the convexity of the SICD optimization problem and propose an algorithm to find its optimal solution. Our numerical results demonstrate the importance of using successive interference cancellation in WPCNs with NOMA, and show how the energy should be distributed as a function of the system parameters.

Includes members:
  Member "optimization of energy constrained wireless powered communication networks with heterogeneous nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "wireless powered communications with non orthogonal multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "battery powered devices in wpcns":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "on optimal policies in full duplex wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "optimal design of non orthogonal multiple access with wireless power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "energy harvesting networks with energy cooperation procrastinating policies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "real time transmission mechanism design for wireless iot sensors with energy harvesting under power saving mode")
  Member "joint transmission and energy transfer policies for energy harvesting devices with finite batteries":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an energy efficient controller for wirelessly powered communication networks")
  Member "user cooperation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")

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)