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 "secure compute and forward transmission with artificial noise and full duplex devices"):
  Abstract: We consider a wiretap channel with an eavesdropper (Eve) and an honest but curious relay (Ray). Ray and the destination (Bob) are full-duplex (FD) devices. Since we aim at not revealing information on the secret message to the relay, we consider the scaled compute-and-forward (SCF) where scaled lattice coding is used in the transmission by both the source (Alice) and Bob in order to allow Ray to decode only a linear combination of the two messages. At the same time Ray transmits artificial noise (AN) to confuse Eve. When Ray relays the decoded linear combination, Alice and Bob are transmitting AN against Eve. This can be a 5G cellular communication scenario where a mobile terminal (MT) aims at transmitting a secret message to a FD base station (BS), with the assistance of a network FD relay. With respect to existing literature the innovations of this paper are: a) Bob and Ray are FD devices; b) Alice, Ray and Bob transmit also AN; and c) the channel to Eve is not known to Alice, Bob and Ray. For this scenario we derive bounds on both the secrecy outage probability under Rayleigh fading conditions of the channels to Eve, and the achievable secrecy-outage rates.

Includes members:
  Member "near optimal modulo and forward scheme for the untrusted relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secrecy optimized resource allocation for device to device communication underlaying heterogeneous networks")
  Member "multi antenna relay aided wireless physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy outage analysis of non orthogonal spectrum sharing for heterogeneous cellular networks")
  Member "secure transmission on the two hop relay channel with scaled compute and forward":
    also connected through other hyperedges:
      (none)
  Member "asymmetric compute and forward with csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized compute compress and forward")
  Member "improving physical layer secrecy using full duplex jamming receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "joint relay and jammer selection for secure two way relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure transmission and self energy recycling with partial eavesdropper csi")
  Member "cooperative jamming for secure communications in mimo relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi antenna jamming in covert communication")

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)