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 "resource allocation in wireless powered iot networks"):
  Abstract: In this paper, the efficient resource allocation for the uplink transmission of wireless powered Internet of Things (IoT) networks is investigated. We adopt LoRa technology as an example in the IoT network, but this paper is still suitable for other communication technologies. Allocating limited resources, like spectrum and energy resources, among a massive number of users faces critical challenges. We consider grouping wireless powered IoT users into available channels first and then investigate power allocation for users grouped in the same channel to improve the network throughput. Specifically, the user grouping problem is formulated as a many to one matching game. It is achieved by considering IoT users and channels as selfish players which belong to two disjoint sets. Both selfish players focus on maximizing their own utilities. Then we propose an efficient channel allocation algorithm (ECAA) with low complexity for user grouping. Additionally, a Markov decision process is used to model unpredictable energy arrival and channel conditions uncertainty at each user, and a power allocation algorithm is proposed to maximize the accumulative network throughput over a finite-horizon of time slots. By doing so, we can distribute the channel access and dynamic power allocation local to IoT users. Numerical results demonstrate that our proposed ECAA algorithm achieves near-optimal performance and is superior to random channel assignment, but has much lower computational complexity. Moreover, simulations show that the distributed power allocation policy for each user is obtained with better performance than a centralized offline scheme.

Includes members:
  Member "low power wide area networks for sustainable iot":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance analysis of clustered lora networks")
  Member "low power wide area network analysis can lora scale":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of single cell adaptive data rate enabled lorawan")
  Member "low power wide area networks an overview":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random access based reliable uplink communication and power transfer using dynamic power splitting")
  Member "online learning schemes for power allocation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "wireless powered communication networks an overview":
    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 "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "multi antenna wireless powered communication with energy beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")

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)