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: "fundamental properties of full duplex radio for secure wireless communications"
  Abstract: Author(s): Hua, Y; Zhu, Q; Sohrabi, R | Abstract: This paper presents a number of fundamental properties of full-duplex radio for secure wireless communication under some simple and practical conditions. In particular, we consider the fields of secrecy capacity of a wireless channel between two single-antenna radios (Alice and Bob) against an unknown number of single-antenna eavesdroppers (Eves) from unknown locations, where Alice and Bob have zero knowledge (except a model) of the large-scale-fading channel-state-information of Eves. These properties show how the secrecy capacity is distributed in terms of the location of any Eve, how the optimal jamming power applied by the full-duplex radio varies with various parameters, and how bad or good the worst cases are. In particular, these properties show how the quality of self-interference cancelation/suppression affects various aspects of the fields of secrecy capacity. The cases of colluding Eves and non-colluding Eves are treated separately and yet coherently. For non-colluding Eves, asymptotically constant fields of secrecy capacity are revealed. For each of the two cases, we also treat subcases with or without small-scale fading.

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)