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: "time switching based swipt for network coded two way relay transmission with data rate fairness"
  Abstract: This paper investigates the simultaneous wireless power and information transfer (SWPIT) for network-coded two-way re- lay transmission from an information theoretical viewpoint, where two sources exchange information via an energy har- vesting relay. By considering the time switching (TS) relay receiver architecture, we present the TS-based two-way re- laying (TS-TWR) protocol. In order to explore the system throughput limit with data rate fairness, we formulate an op- timization problem under total power constraint. To solve the problem, we first derive some explicit results and then de- sign an efficient algorithm. Numerical results show that with the same total available power, TS-TWR has a certain per- formance loss compared with conventional non-EH two-way relaying due to the path loss effect on energy transfer, where in relatively low and relatively high SNR regimes, the perfor- mance losses are relatively small.

Connected through hyperedge HE-1 (induced by source paper "wireless powered two way relaying with power splitting based energy accumulation"):
  with members:
    - "relay selection in wireless powered cooperative networks with energy storage"
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "wireless powered communications performance analysis and optimization"
    - "a discrete time switching protocol for wireless powered communications with energy accumulation"
    - "relaying protocols for wireless energy harvesting and information processing"
    - "wireless information and power transfer in two way amplify and forward relaying channels"

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)