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 and fairness in wireless powered cooperative cognitive radio networks"):
  Abstract: We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum-throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and jointly performs the time and energy allocation for SUs. Specifically, by exploiting the structure of the optimal solution, we find the order in which SUs are prioritized to relay primary data. Since the STORA scheme focuses on the sum-throughput, it becomes inconsiderate towards individual SU throughput, resulting in low fairness. To enhance fairness, we investigate three resource allocation schemes, which are (i) equal time allocation, (ii) minimum throughput maximization, and (iii) proportional time allocation. Simulation results reveal the trade-off between sum-throughput and fairness. The minimum throughput maximization scheme is the fairest one as each SU gets the same throughput, but yields the least SU sum-throughput.

Includes members:
  Member "wireless powered communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "placement optimization of energy and information access points in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reusing wireless power transfer for backscatter assisted relaying in wpcns")
  Member "cognitive wireless powered network spectrum sharing models and throughput maximization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "on information and energy cooperation in energy harvesting cognitive radio":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal harvest or transmit strategy for energy harvesting underlay cognitive radio network")
  Member "optimum wirelessly powered relaying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  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 "user cooperation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "information and energy cooperation in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "energy sustainable paradigms and methods for future mobile networks a survey")

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)