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: "dynamic power splitting policies for af relay networks with wireless energy harvesting"
  Abstract: Wireless energy harvesting (WEH) provides an exciting way to supply energy for relay nodes to forward information for the source-destination pairs. In this paper, we investigate the problem on how the relay node dynamically adjusts the power splitting ratio of information transmission (IT) and energy harvesting (EH) in order to achieve the optimal outage performance. According to the knowledge of channel state information (CSI) at the relay, optimal dynamic power splitting policy with full CSI and partial CSI are both provided. Finally, through simulations, the proposed power splitting policies can improve the outage performances and the policy with full CSI achieves the best performance. It is also shown that the policy with partial CSI can approach the policy with full CSI closely and incurs far less system overhead.

Connected through hyperedge HE-1 (induced by source paper "interference alignment with power splitting relays in multi user multi relay networks"):
  with members:
    - "simultaneous information and energy transfer in large scale networks with without relaying"
    - "wireless information and power transfer energy efficiency optimization in ofdma systems"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "wireless information and power transfer a dynamic power splitting approach"
    - "wireless information and power transfer in two way amplify and forward relaying channels"
    - "mimo broadcasting for simultaneous wireless information and power transfer"
    - "approaching the capacity of wireless networks through distributed interference alignment"

Connected through hyperedge HE-2 (induced by source paper "amplify and forward full duplex relay with power splitting based swipt"):
  with members:
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "full duplex mimo relaying powered by wireless energy transfer"
    - "joint power splitting and antenna selection in energy harvesting relay channels"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "optimized training design for wireless energy transfer"
    - "wireless information and power transfer with full duplex relaying"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"

Connected through hyperedge HE-3 (induced by source paper "power splitting for full duplex relay with wireless information and power transfer"):
  with members:
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "joint power splitting and antenna selection in energy harvesting relay channels"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "wireless information and power transfer with full duplex relaying"
    - "energy efficient resource allocation in multiuser ofdm systems with wireless information and power transfer"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"
    - "relaying protocols for wireless energy harvesting and information processing"

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)