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 "user cooperation for enhanced throughput fairness in wireless powered communication networks"):
  Abstract: This paper studies a novel user cooperation method in a wireless powered communication network (WPCN), where a pair of distributed terminal users first harvest wireless energy broadcasted by one energy node (EN) and then use the harvested energy to transmit information cooperatively to a destination node (DN). In particular, the two cooperating users exchange their independent information with each other to form a virtual antenna array and transmit jointly to the DN. By allowing each user to allocate part of its harvested energy to transmit the other's information, the proposed cooperation can effectively mitigate the user unfairness problem in WPCNs, where a user may suffer from very low data rate due to the poor energy harvesting performance and high data transmission consumptions. We derive the maximum common throughput achieved by the cooperation scheme through optimizing the time allocation on wireless energy transfer, user message exchange, and joint information transmissions. Through comparing with some representative benchmark schemes, our results demonstrate the effectiveness of the proposed user cooperation in enhancing the throughput performance under different setups.

Includes members:
  Member "distributed charging control in broadband wireless power transfer networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reusing wireless power transfer for backscatter assisted relaying in wpcns")
  Member "wireless powered communication networks an overview":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "wireless powered communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "placement optimization of energy and information access points in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reusing wireless power transfer for backscatter assisted relaying in wpcns")
  Member "multiuser mimo wireless energy transfer with coexisting opportunistic communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "spatial throughput maximization of wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")

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)