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: "secure transmission and self energy recycling with partial eavesdropper csi"
  Abstract: This paper focuses on the secure transmission of wireless-powered relay systems with the imperfect eavesdropper channel state information. For efficient energy transfer and information relaying, a novel two-phase protocol is proposed, in which the relay operates in a full-duplex (FD) mode to achieve the simultaneous wireless power and information transmission. Compared with those existing protocols, the proposed design possesses two main advantages: 1) it fully exploits the available hardware resource (antenna element) of relay and can offer a higher secrecy rate and 2) it enables the self-energy recycling (S-ER) at relay, in which the loopback interference generated by the FD operation is harvested and reused for information relaying. To maximize the worst-case secrecy rate (WCSR) through jointly designing the source and relay beamformers coupled with the power allocation ratio, an optimization problem is formulated. This formulated problem is proved to be non-convex and the challenge to solve it is how to concurrently solve out the beamformers and the power allocation ratio. To cope with this difficulty, an alternative approach is proposed by converting the original problem into three subproblems. By solving these subproblems iteratively, the closed-form solutions of robust beamformers and power allocation ratio for the original problem are achieved. Simulations are done and results reveal that the proposed S-ER -based secure transmission scheme outperforms the traditional time-switching based relaying scheme at a maximum WCSR gain of 80%. Results also demonstrate that the WCSR performance of the scheme reusing all antennas for information reception is much better than that of schemes exploiting only one antenna.

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)