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: "physical layer security in heterogeneous networks with jammer selection and full duplex users"
  Abstract: In this paper, we enhance physical layer security for downlink heterogeneous networks (HetNets) by using friendly jammers and full-duplex users. The jammers are selected to transmit jamming signal if their interfering power on the scheduled users is below a threshold, meanwhile the scheduled users confound the eavesdroppers using artificial noise by full-duplexing. Using the tools of stochastic geometry, we derive the expressions of connection probability and secrecy probability. In particular, the locations of active jammers are modeled by a modified Poisson hole process (PHP). Determining the jammer selection threshold is further investigated for connection probability maximization subject to the security constraints. A greedy algorithm is proposed to efficiently solve this problem. The accuracy of the theoretical analysis and the efficiency of the proposed algorithm are evaluated by numerical simulations.

Connected through hyperedge HE-1 (induced by source paper "secrecy outage and diversity analysis of multiple cooperative source destination pairs"):
  with members:
    - "modulation and multiple access for 5g networks"
    - "physical layer security for spectrum sharing systems"
    - "on secrecy performance of antenna selection aided mimo systems against eavesdropping"
    - "artificial noise aided secure transmission in large scale spectrum sharing networks"
    - "location based beamforming for enhancing secrecy in rician wiretap channels"
    - "physical layer security in heterogeneous cellular networks"
    - "secrecy transmit beamforming for heterogeneous networks"
    - "proactive eavesdropping via cognitive jamming in fading channels"

Connected through hyperedge HE-2 (induced by source paper "on the secrecy capacity of a full duplex wirelessly powered communication system"):
  with members:
    - "exploiting interference for secrecy wireless information and power transfer"
    - "capacity of a full duplex wirelessly powered communication system with self interference and processing cost"
    - "power allocation for secure swipt systems with wireless powered cooperative jamming"
    - "mimo wiretap channel under receiver side power constraints with applications to wireless power transfer and cognitive radio"
    - "wireless powered communication networks an overview"
    - "accumulate and jam towards secure communication via a wireless powered full duplex jammer"
    - "artificial noise aided secrecy information and power transfer in ofdma systems"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"

Connected through hyperedge HE-3 (induced by source paper "adaptive full duplex jamming receiver for secure d2d links in random networks"):
  with members:
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "secrecy outage analysis for downlink transmissions in the presence of randomly located eavesdroppers"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "physical layer security in heterogeneous cellular networks"
    - "a survey on device to device communication in cellular networks"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "improving physical layer secrecy using full duplex jamming receivers"

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)