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: "on secure mixed rf fso systems with tas and imperfect csi"
  Abstract: In this work, we analyze the secrecy outage performance of a dual-hop relay system composed of multiple-input-multiple-output radio-frequency (RF) links and a free-space optical (FSO) link while a multiple-antenna eavesdropper wiretaps the confidential information by decoding the received signals from the resource node. The channel state information (CSI) of the RF and FSO links is considered to be outdated. We propose three transmit antenna selection (TAS) schemes to enhance the secrecy performance of the considered systems. The secrecy outage performance with different TAS schemes is analyzed and the effects of misalignment and detection technology on the secrecy outage performance of mixed systems are studied. We derive the closed-form expressions for probability density function (PDF) and cumulative distribution function (CDF) over M\'alaga channel with imperfect CSI. Then the closed-form expressions for the CDF and PDF of the equivalent signal-to-noise ratio (SNR) at the legitimate receiver over Nakagami-$m$ and M\'alaga channels are derived. Furthermore, the lower bound of the secrecy outage probability (SOP) with different TAS schemes are derived. Besides, the asymptotic results for SOP are investigated by exploiting the unfolding of Meijer's $G$-function when the electrical SNR of FSO link approaches infinity. Finally, Monte-Carlo simulation results are presented to testify the correctness of the proposed analysis. The results illustrate that the outdated CSI shows a strong effect on the secrecy outage performance. In addition, increasing the number of antennas at the source cannot significantly enhance the secrecy performance of the considered systems.

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)