human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "ultra reliable cooperative short packet communications with wireless energy transfer"):
  with members:
    - "ultra reliable short message cooperative relaying protocols under nakagami m fading"
    - "wireless powered relaying with finite block length codes"
    - "analysis of wireless communications with finite blocklength and imperfect channel knowledge"
    - "on wirelessly powered communications with short packets"
    - "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis"
    - "harvest then cooperate wireless powered cooperative communications"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "finite block length analysis of the incremental redundancy harq"

Question: Please tell me which class the center node 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)