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 "wireless powered two way relaying with power splitting based energy accumulation"):
  Abstract: This paper investigates a wireless-powered two-way relay network (WP-TWRN), in which two sources exchange information with the aid of one amplify-and-forward (AF) relay. Contrary to the conventional two-way relay networks, we consider the scenario that the AF relay has no embedded energy supply, and it is equipped with an energy harvesting unit and rechargeable battery. As such, it can accumulate the energy harvested from both sources' signals before helping forwarding their information. In this paper, we develop a power splitting-based energy accumulation (PS-EA) scheme for the considered WP-TWRN. To determine whether the relay has accumulated sufficient energy, we set a predefined energy threshold for the relay. When the accumulated energy reaches the threshold, relay splits the received signal power into two parts, one for energy harvesting and the other for information forwarding. If the stored energy at the relay is below the threshold, all the received signal power will be accumulated at the relay's battery. By modeling the finite-capacity battery of relay as a finite-state Markov Chain (MC), we derive a closed-form expression for the system throughput of the proposed PS-EA scheme over Nakagami-m fading channels. Numerical results validate our theoretical analysis and show that the proposed PS-EA scheme outperforms the conventional time switching-based energy accumulation (TS-EA) scheme and the existing power splitting schemes without energy accumulation.

Includes members:
  Member "relay selection in wireless powered cooperative networks with energy storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "common throughput maximization for uav enabled interference channel with wireless powered communications")
  Member "distributed power splitting for swipt in relay interference channels using game theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities")
  Member "wireless powered communications performance analysis and optimization":
    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 "a discrete time switching protocol for wireless powered communications with energy accumulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "accumulate then transmit multi user scheduling in full duplex wireless powered iot systems")
  Member "time switching based swipt for network coded two way relay transmission with data rate fairness":
    also connected through other hyperedges:
      (none)
  Member "relaying protocols for wireless energy harvesting and information processing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "wireless information and power transfer in two way amplify and forward relaying channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ultra reliable short message relaying with wireless power transfer")

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)