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 "efficient coded cooperative networks with energy harvesting and wireless power transfer"):
  Abstract: The optimum off-line energy management scheme for multi-user multi-relay networks employing energy harvesting and wireless energy transfer is studied. Specifically, the users are capable of harvesting and transferring energy to each other over consecutive transmissions, though they have no fixed energy supplies. Meanwhile, network coding for the users' messages is conducted at the relays to enable cooperative transmission with source nodes in independent but not necessarily identically distributed (i.n.i.d.) Nakagami-$m$ fading channels. Therefore, a simultaneous two level cooperation, i.e., information-level and energy-level cooperation is conducted. The problem of energy efficiency (EE) maximization under constraints of the energy causality and a predefined outage probability threshold is formulated and shown to be non-convex. By exploiting fractional and geometric programming, a convex form-based iterative algorithm is developed to solve the problem efficiently. Close-to-optimal power allocation and energy cooperation policies across consecutive transmissions are found. Moreover, the effects of relay locations and wireless energy transmission efficiency are investigated and the performance comparison with the current state of solutions demonstrates that the proposed policies can manage the harvested energy more efficiently.

Includes members:
  Member "resource allocation in wireless networks with rf energy harvesting and transfer":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "experiment modeling and analysis of wireless powered sensor network for energy neutral power management")
  Member "throughput maximization for two way relay channels with energy harvesting nodes the impact of relaying strategies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimization of a power splitting protocol for two way multiple energy harvesting relay system")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "trading wireless information and power transfer relay selection to minimize the outage probability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "time switching uplink network coded cooperative communication with downlink energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ultra reliable cooperative short packet communications with wireless energy transfer")
  Member "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")

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)