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 information and energy transfer for two hop non regenerative mimo ofdm relay networks"):
  Abstract: This paper investigates the simultaneous wireless information and energy transfer for the non-regenerative multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) relaying system. By considering two practical receiver architectures, we present two protocols, time switching-based relaying (TSR) and power splitting-based relaying (PSR). To explore the system performance limits, we formulate two optimization problems to maximize the end-to-end achievable information rate with the full channel state information (CSI) assumption. Since both problems are non-convex and have no known solution method, we firstly derive some explicit results by theoretical analysis and then design effective algorithms for them. Numerical results show that the performances of both protocols are greatly affected by the relay position. Specifically, PSR and TSR show very different behaviors to the variation of relay position. The achievable information rate of PSR monotonically decreases when the relay moves from the source towards the destination, but for TSR, the performance is relatively worse when the relay is placed in the middle of the source and the destination. This is the first time such a phenomenon has been observed. In addition, it is also shown that PSR always outperforms TSR in such a MIMO-OFDM relaying system. Moreover, the effects of the number of antennas and the number of subcarriers are also discussed.

Includes members:
  Member "distributed power splitting for swipt in relay interference channels using game theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "joint transmit beamforming and receive power splitting for miso swipt systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access based reliable uplink communication and power transfer using dynamic power splitting")
  Member "interactive joint transfer of energy and information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "wireless information and power transfer in multiuser ofdm systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "wireless information and power transfer energy efficiency optimization in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the performance gain of noma over oma in uplink communication systems")
  Member "relaying protocols for wireless energy harvesting and information processing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)