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 the secrecy of interference limited networks under composite fading channels"
  Abstract: This letter deals with the secrecy capacity of the radio channel in interference-limited regime. We assume that interferers are uniformly scattered over the network area according to a Point Poisson Process and the channel model consists of path-loss, log-normal shadowing and Nakagami-m fading. Both the probability of non-zero secrecy capacity and the secrecy outage probability are then derived in closed-form expressions using tools of stochastic geometry and higher-order statistics. Our numerical results show how the secrecy metrics are affected by the disposition of the desired receiver, the eavesdropper and the legitimate transmitter.

Connected through hyperedge HE-1 (induced by source paper "throughput maximization in multi hop wireless networks under secrecy constraint"):
  with members:
    - "maximizing the link throughput between smart meters and aggregators as secondary users under power and outage constraints"
    - "on the performance of secure full duplex relaying under composite fading channels"
    - "enhanced transmit antenna selection scheme for secure throughput maximization without csi at the transmitter and its applications on smart grids"
    - "improving physical layer security in wireless communications using diversity techniques"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "five disruptive technology directions for 5g"
    - "an overview of the transmission capacity of wireless networks"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"

Connected through hyperedge HE-2 (induced by source paper "effects of relay selection strategies on the spectral efficiency of wireless systems with half and full duplex nodes"):
  with members:
    - "m2m massive access in lte rach performance evaluation in a smart city scenario"
    - "contention based geographic forwarding strategies for wireless sensors networks"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"
    - "a simple cooperative diversity method based on network path selection"

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)