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 communications with finite battery and finite blocklength"):
  Abstract: We analyze a wireless communication system with finite block length and finite battery energy, under quasi-static Nakagami-m fading. Wireless energy transfer is carried out in the downlink while information transfer occurs in the uplink. Transmission strategies for scenarios with/without energy accumulation between transmission rounds are characterized in terms of error probability and energy consumption. A power control protocol for the energy accumulation scenario is proposed and results show the enormous impact on improving the system performance, in terms of error probability and energy consumption. The numerical results corroborate the existence and uniqueness of an optimum target error probability, while showing that a relatively small battery could be a limiting factor for some setups, specially when using the energy accumulation strategy.

Includes members:
  Member "ultra reliable short message relaying with wireless power transfer":
    also connected through other hyperedges:
      (none)
  Member "wireless networks with energy harvesting and power transfer joint power and time allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sequencing and scheduling for multi user machine type communication")
  Member "wireless powered two way relaying with power splitting based energy accumulation":
    also connected through other hyperedges:
      (none)
  Member "accumulate then forward an opportunistic relaying protocol for wireless powered cooperative communications":
    also connected through other hyperedges:
      (none)
  Member "wireless powered relaying with finite block length codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an energy efficient controller for wirelessly powered communication networks")
  Member "blocklength limited performance of relaying under quasi static rayleigh channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed federated learning for ultra reliable low latency vehicular communications")
  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 "towards massive ultra reliable and low latency wireless communication with short packets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning how to communicate in the internet of things finite resources and heterogeneity")

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)