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: "optimization of energy constrained wireless powered communication networks with heterogeneous nodes"
  Abstract: In this paper, we generalize conventional time division multiple access (TDMA) wireless networks to a new type of wireless networks coined generalized wireless powered communication networks (g-WPCNs). Our prime objective is to optimize the design of g-WPCNs where nodes are equipped with radio frequency (RF) energy harvesting circuitries along with constant energy supplies. This constitutes an important step towards a generalized optimization framework for more realistic systems, beyond prior studies where nodes are solely powered by the inherently limited RF energy harvesting. Towards this objective, we formulate two optimization problems with different objective functions, namely, maximizing the sum throughput and maximizing the minimum throughput (maxmin) to address fairness. First, we study the sum throughput maximization problem, investigate its complexity and solve it efficiently using an algorithm based on alternating optimization approach. Afterwards, we shift our attention to the maxmin optimization problem to improve the fairness limitations associated with the sum throughput maximization problem. The proposed problem is generalized, compared to prior work, as it seemlessly lends itself to prior formulations in the literature as special cases representing extreme scenarios, namely, conventional TDMA wireless networks (no RF energy harvesting) and standard WPCNs, with only RF energy harvesting nodes. In addition, the generalized formulation encompasses a scenario of practical interest we introduce, namely, WPCNs with two types of nodes (with and without RF energy harvesting capability) where legacy nodes without RF energy harvesting can be utilized to enhance the system sum throughput, even beyond WPCNs with all RF energy harvesting nodes studied earlier in the literature. We establish the convexity of all formulated problems which opens room for efficient solution using standard techniques. Our numerical results show that conventional TDMA wireless networks and WPCNs with only RF energy harvesting nodes are considered as lower bounds on the performance of the generalized problem setting in terms of the maximum sum throughput and maxmin throughput. Moreover, the results reveal valuable insights and throughput-fairness trade-offs unique to our new problem setting.

Connected through hyperedge HE-1 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network"):
  with members:
    - "3gpp inspired hetnet model using poisson cluster process sum product functionals and downlink coverage"
    - "poisson cluster process bridging the gap between ppp and 3gpp hetnet models"
    - "joint uplink and downlink coverage analysis of cellular based rf powered iot network"
    - "non orthogonal multiple access schemes in wireless powered communication networks"
    - "enriched k tier hetnet model to enable the analysis of user centric small cell deployments"
    - "poisson cluster process based analysis of hetnets with correlated user and base station locations"
    - "on optimal policies in full duplex wireless powered communication networks"
    - "wirelessly powered backscatter communication networks modeling coverage and capacity"

Connected through hyperedge HE-2 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems"):
  with members:
    - "wireless power meets energy harvesting a joint energy allocation approach in ofdm based system"
    - "resource allocation and fairness in wireless powered cooperative cognitive radio networks"
    - "battery powered devices in wpcns"
    - "on optimal policies in full duplex wireless powered communication networks"
    - "an overview of sustainable green 5g networks"
    - "dynamic base station operation in large scale green cellular networks"
    - "optimal design of non orthogonal multiple access with wireless power transfer"
    - "energy efficient resource allocation for wireless powered communication networks"

Connected through hyperedge HE-3 (induced by source paper "stable throughput of cooperative cognitive networks with energy harvesting finite relay buffer and finite battery capacity"):
  with members:
    - "non orthogonal multiple access schemes in wireless powered communication networks"
    - "on stable throughput of cognitive radio networks with cooperating secondary users"
    - "on optimal policies in full duplex wireless powered communication networks"
    - "energy harvesting wireless communications a review of recent advances"
    - "effect of energy harvesting on stable throughput in cooperative relay systems"
    - "energy efficient resource allocation for wireless powered communication networks"
    - "cooperative access in cognitive radio networks stable throughput and delay tradeoffs"
    - "on the stable throughput of cooperative cognitive radio networks with finite relaying buffer"

Connected through hyperedge HE-4 (induced by source paper "non orthogonal multiple access schemes in wireless powered communication networks"):
  with members:
    - "wireless powered communications with non orthogonal multiple access"
    - "battery powered devices in wpcns"
    - "on optimal policies in full duplex wireless powered communication networks"
    - "optimal design of non orthogonal multiple access with wireless power transfer"
    - "energy harvesting networks with energy cooperation procrastinating policies"
    - "joint transmission and energy transfer policies for energy harvesting devices with finite batteries"
    - "user cooperation in wireless powered communication networks"
    - "throughput maximization in wireless powered communication networks"

Connected through hyperedge HE-5 (induced by source paper "robust resource allocation for mimo wireless powered communication networks based on a non linear eh model"):
  with members:
    - "robust beamforming for swipt systems with non linear energy harvesting model"
    - "robust an aided beamforming and power splitting design for secure miso cognitive radio with swipt"
    - "power allocation and scheduling for swipt systems with non linear energy harvesting model"
    - "wireless powered communication opportunities and challenges"
    - "practical non linear energy harvesting model and resource allocation for swipt systems"
    - "information and energy cooperation in ofdm relaying protocols and optimization"
    - "on the efficiency of far field wireless power transfer"
    - "energy efficient resource allocation for wireless powered communication networks"

Connected through hyperedge HE-6 (induced by source paper "on optimal policies in full duplex wireless powered communication networks"):
  with members:
    - "battery powered devices in wpcns"
    - "wireless powered communication opportunities and challenges"
    - "energy harvesting networks with energy cooperation procrastinating policies"
    - "throughput optimization for massive mimo systems powered by wireless energy transfer"
    - "joint transmission and energy transfer policies for energy harvesting devices with finite batteries"
    - "harvest then cooperate wireless powered cooperative communications"
    - "stability and performance issues of a relay assisted multiple access scheme with mpr capabilities"
    - "user cooperation in wireless powered communication networks"

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)