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 "optimum transmission policies for energy harvesting sensor networks powered by a mobile control center"):
  Abstract: Wireless energy transfer, namely, radio frequency (RF)-based energy harvesting, is a potential way to prolong the lifetime of energy-constrained devices, especially in wireless sensor networks. However, due to huge propagation attenuation, its energy efficiency is regarded as the biggest bottleneck to wide applications. It is critical to find appropriate transmission policies to improve the global energy efficiency in this kind of system. To this end, this paper focuses on the sensor networks scenario, where a mobile control center powers the sensors by RF signal and also collects information from them. Two related schemes, called harvest-and-use scheme and harvest-store-use scheme, are investigated. In the harvest-and-use scheme, as a benchmark, both constant and adaptive transmission modes from sensors are discussed. In the harvest-store-use scheme, we propose a new concept, the best opportunity for wireless energy transfer, and use it to derive an explicit closed-form expression of optimal transmission policy. It is shown by simulation that a considerable improvement in terms of energy efficiency can be obtained with the help of the transmission policies developed in this paper. Furthermore, the transmission policies are also discussed under the constraint of fixed information rate. The minimal required power, the performance loss from the new constraint, and the effect of fading are then presented.

Includes members:
  Member "wireless information and energy transfer for two hop non regenerative mimo ofdm relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "energy beamforming with one bit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "outage probability of energy harvesting relay aided cooperative networks over rayleigh fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint power splitting and relay selection in energy harvesting communications for iot networks")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "optimized training design for wireless energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  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 "simultaneous information and power transfer for broadband wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "wireless information and power transfer a dynamic power splitting approach":
    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)