human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "adaptive full duplex jamming receiver for secure d2d links in random networks"):
  Abstract: Device-to-device (D2D) communication raises new transmission secrecy protection challenges, since conventional physical layer security approaches, such as multiple antennas and cooperation techniques, are invalid due to its resource/size constraints. The full-duplex (FD) jamming receiver, which radiates jamming signals to confuse eavesdroppers when receiving the desired signal simultaneously, is a promising candidate. Unlike existing endeavors that assume the FD jamming receiver always improves the secrecy performance compared with the half-duplex (HD) receiver, we show that this assumption highly depends on the instantaneous residual self-interference cancellation level and may be invalid. We propose an adaptive jamming receiver operating in a switched FD/HD mode for a D2D link in random networks. Subject to the secrecy outage probability constraint, we optimize the transceiver parameters, such as signal/jamming powers, secrecy rates and mode switch criteria, to maximize the secrecy throughput. Most of the optimization operations are taken off-line and only very limited on-line calculations are required to make the scheme with low complexity. Furthermore, some interesting insights are provided, such as the secrecy throughput is a quasi-concave function. Numerical results are demonstrated to verify our theoretical findings, and to show its superiority compared with the receiver operating in the FD or HD mode only.

Includes members:
  Member "exploiting full duplex receivers for achieving secret communications in multiuser miso networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vulnerabilities of massive mimo systems to pilot contamination attacks")
  Member "secrecy outage analysis for downlink transmissions in the presence of randomly located eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure transmit antenna selection protocol for mimo noma networks over nakagami m channels")
  Member "modeling and analysis of cellular networks using stochastic geometry a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "safeguarding decentralized wireless networks using full duplex jamming receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "physical layer security in heterogeneous networks with jammer selection and full duplex users":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy outage and diversity analysis of multiple cooperative source destination pairs")
  Member "physical layer security in heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "a survey on device to device communication in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "simultaneous energy harvesting and information transmission in a mimo full duplex system a machine learning based design")
  Member "passive self interference suppression for full duplex infrastructure nodes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi objective antenna selection in a full duplex base station")

Question: Please tell me which class the source paper 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)