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 "near optimal modulo and forward scheme for the untrusted relay channel"):
  Abstract: This paper studies an untrusted relay channel, in which the destination sends artificial noise simultaneously with the source sending a message to the relay, in order to protect the source's confidential message. The traditional amplify-and-forward (AF) scheme shows poor performance in this situation because of the interference power dilemma: providing better security by using stronger artificial noise will decrease the confidential message power from the relay to the destination. To solve this problem, a modulo-and-forward (MF) operation at the relay with nested lattice encoding at the source is proposed. For this system with full channel state information at the transmitter (CSIT), theoretical analysis shows that the proposed MF scheme approaches the secrecy capacity within 1/2 bit for any channel realization, and hence achieves full generalized security degrees of freedom (G-SDoF). In contrast, the AF scheme can only achieve a small fraction of the G-SDoF. For this system without any CSIT, the total outage event, defined as either connection outage or secrecy outage, is introduced. Based on this total outage definition, analysis shows that the proposed MF scheme achieves the full generalized secure diversity gain (G-SDG) of order one. On the other hand, the AF scheme can only achieve a G-SDG of 1/2 at most.

Includes members:
  Member "secure communication via an untrusted non regenerative relay in fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing physical layer security in af relay assisted multicarrier wireless transmission enhancing physical layer security in af relay assisted multicarrier wireless transmission")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "nested polar codes for wiretap and relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sign bit shaping using polar codes")
  Member "channel coding and decoding in a relay system operated with physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep learning based constellation optimization for physical network coding in two way relay networks")
  Member "on the throughput of secure hybrid arq protocols for gaussian block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "providing secrecy with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "perfect secrecy in physical layer network coding systems from structured interference")
  Member "generalized degrees of freedom of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "implementation of uplink network coded modulation for two hop networks")

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)