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: "energy harvesting based secure two way communication using an untrusted relay"
  Abstract: In this paper, we propose a two-way secure communication network where two sources exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and a friendly jammer (FJ). By adopting the time switching (TS) architecture at the relay, the data transmission is accomplished in three phases. In the first phase, both the relay and FJ are charged by non-information radio frequency signals from the sources. In the second phase, the two sources transmit information signals and concurrently, the FJ transmits artificial noise to confuse the curious relay. Finally, the third phase is dedicated to forward the scaled version of the received signal from the relay to the sources. For the proposed network, we derive a new closed-form lower-bound expression for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime. As a benchmark, we also examine the scenario of without friendly jamming (WoFJ) to highlight the performance advantages of the proposed with friendly jamming (WFJ) scenario. We further specify the high SNR slope and the high SNR power offset to determine the effect of friendly jamming on the ESSR. In the next step, novel compact closed-form expressions are derived for the intercept probability (IP) as a well-known security metric. Finally, numerical examples are provided to demonstrate the impacts of different system parameters such as energy harvesting time ratio, transmit SNR and the power allocation factor on the secrecy performance of both WFJ and WoFJ scenarios. The results illustrate that the proposed WFJ network outperforms the traditional one-way communication and the two-way WoFJ policy.

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.CR(Cryptography and Security)