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: "improving secrecy with nearly collinear main and wiretap channels via a cooperative jamming relay"
  Abstract: In physical layer security (PHY-security), the frequently observed high correlation between the main and wiretap channels can cause a significant loss of secrecy. This paper investigates a slow fading scenario, where a transmitter (Alice) sends a confidential message to a legitimate receiver (Bob) while a passive eavesdropper (Eve) attempts to decode the message from its received signal. It is assumed that Alice is equipped with multiple antennas while Bob and Eve each have a single antenna (i.e., a MISOSE system). In a MISOSE system, high correlation results in nearly collinear main and wiretap channel vectors, which help Eve to see and intercept confidential information. Unfortunately, the signal processing techniques at Alice, such as beamforming and artificial noise (AN), are helpless, especially in the extreme case of completely collinear main and wiretap channel vectors. On this background, we first investigate the achievable secrecy outage probability via beamforming and AN at Alice with the optimal power allocation between the information-bearing signal and AN. Then, an ingenious model, in which a cooperative jamming relay (Relay) is introduced, is proposed to effectively mitigate the adverse effects of high correlation. Based on the proposed model, the power allocation between the information-bearing signal at Alice and the AN at Relay is also studied to maximize secrecy. Finally, to validate our proposed schemes, numerical simulations are conducted, and the results show that a significant performance gain with respect to secrecy is achieved.

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)