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 "ultra reliable short packet communications with wireless energy transfer"):
  Abstract: We analyze and optimize a wireless system with energy transfer in the downlink and information transfer in the uplink, under quasi-static Nakagami-m fading. We consider ultra-reliable communication scenarios representative of the fifth-generation of wireless systems, with strict error and latency requirements. The error probability and delay are investigated, and an approximation for the former is given and validated through simulations. The numerical results demonstrate that there are optimum numbers of channels uses for both energy and information transfer for a given message length.

Includes members:
  Member "wireless powered relaying with finite block length codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an energy efficient controller for wirelessly powered communication networks")
  Member "finite blocklength performance of multi terminal wireless industrial networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ultra reliable short message relaying with wireless power transfer")
  Member "analysis of wireless communications with finite blocklength and imperfect channel knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ultra reliable cooperative short packet communications with wireless energy transfer")
  Member "on wirelessly powered communications with short packets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ultra reliable cooperative short packet communications with wireless energy transfer")
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "finite block length analysis of the incremental redundancy harq":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")

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)