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 "capacity of the two hop relay channel with wireless energy transfer from relay to source and energy transmission cost"):
  Abstract: In this paper, we investigate a communication system comprised of an energy harvesting (EH) source which harvests radio frequency (RF) energy from an out-of-band full-duplex relay node and exploits this energy to transmit data to a destination node via the relay node. We assume two scenarios for the battery of the EH source. In the first scenario, we assume that the EH source is not equipped with a battery and thereby cannot store energy. As a result, the RF energy harvested during one symbol interval can only be used in the following symbol interval. In the second scenario, we assume that the EH source is equipped with a battery having unlimited storage capacity in which it can store the harvested RF energy. As a result, the RF energy harvested during one symbol interval can be used in any of the following symbol intervals. For both system models, we derive the channel capacity subject to an average power constraint at the relay and an additional energy transmission cost at the EH source. We compare the derived capacities to the achievable rates of several benchmark schemes. Our results show that using the optimal input distributions at both the EH source and the relay is essential for high performance. Moreover, we demonstrate that neglecting the energy transmission cost at the source can result in a severe overestimation of the achievable performance.

Includes members:
  Member "throughput analysis and optimization of wireless powered multiple antenna full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed multi user wireless charging power allocation")
  Member "a geometric analysis of the awgn channel with a sigma rho power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "intrinsic entropies of log concave distributions")
  Member "wireless powered communication opportunities and challenges":
    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 "rate maximization of decode and forward relaying systems with rf energy harvesting":
    also connected through other hyperedges:
      (none)
  Member "optimal cooperative power allocation for energy harvesting enabled relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint power splitting and relay selection in energy harvesting communications for iot networks")
  Member "wireless powered cooperative communications via a hybrid relay":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "multiple access fading channel with wireless power transfer and energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "jointly broadcasting data and power with quality of service guarantees")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")

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)