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 relaying with finite block length codes"):
  Abstract: This paper studies the outage probability and the throughput of amplify-and-forward relay networks with wireless information and energy transfer. We use some recent results on finite block-length codes to analyze the system performance in the cases with short codewords. Specifically, the time switching relaying and the power splitting relaying protocols are considered for energy and information transfer. We derive tight approximations for the outage probability/throughput. Then, we analyze the outage probability in asymptotically high signal-to-noise ratios. Finally, we use numerical results to confirm the accuracy of our analysis and to evaluate the system performance in different scenarios. Our results indicate that, in delay-constrained scenarios, the codeword length affects the outage probability/throughput of the joint energy and information transfer systems considerably.

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 "wireless networks with rf energy harvesting a contemporary survey":
    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 "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  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 architecture design and rate energy tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")

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)