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: "simultaneous wireless information and power transfer with co channel interference"
  Abstract: Simultaneous wireless information and power transfer (SWIPT) is an appealing solution to balance the energy distribution in wireless networks and improve the energy-efficiency of the entire network. In this paper, we study the optimal policies for SWIPT over the flat-fading channel subject to the co-channel interference. The SWIPT receiver using dynamic power splitting (DPS) is expected to achieve the maximum information rate given an average harvested energy constraint. In the case that channel state information at the transmitter (CSIT) is not available, the optimal power splitting is derived. For the case with CSIT, the joint optimal policy of the transmit power and the power splitting are also provided. Through simulations, we show the optimal rate-energy (R-E) trade-offs of our proposed policies. The case with CSIT achieves better R-E trade-off than the case with no CSIT.

Connected through hyperedge HE-1 (induced by source paper "outage analysis in two way communication with rf energy harvesting relay and co channel interference"):
  with members:
    - "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities"
    - "wireless powered communication networks an overview"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "wireless information and power transfer in two way amplify and forward relaying channels"
    - "radio frequency energy harvesting and management for wireless sensor networks"
    - "wireless information and power transfer architecture design and rate energy tradeoff"

Connected through hyperedge HE-2 (induced by source paper "dynamic power splitting policies for af relay networks with wireless energy harvesting"):
  with members:
    - "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis"
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "wireless information and power transfer in multiuser ofdm 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"
    - "wireless information transfer with opportunistic energy harvesting"

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)