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 "mitigating rate loss in fading multiple access wiretap channel to achieve shannon capacity region"):
  Abstract: Security constraint results in rate-loss in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy rates of both the users until we achieve the usual capacity region of a Multiple Access Channel (MAC) without the wiretapper (Shannon capacity region). With this scheme only the message that is being transmitted is proved to be secure with respect to all the information that the adversary (eavesdropper) possesses. In the second part of the paper we improve the security constraint such that not only the message being transmitted is secure but all the messages transmitted in the immediate past are secure w.r.t. all the information o f the eavesdropper. To achieve this goal we introduce secret key buffers at both the users, as well as at the legitimate receiver (Bob). Finally we consider a fading MAC-WT and show that with this coding/decoding scheme we can achieve the capacity region of a fading MAC (in ergodic sense).

Includes members:
  Member "achieving shannon capacity in a fading wiretap channel":
    also connected through other hyperedges:
      (none)
  Member "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing secrecy rate region for recent messages for a slotted multiple access wiretap channel to shannon capacity region")
  Member "strong secrecy for multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "previous messages provide the key to achieve shannon capacity in a wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enhancing secrecy rates in a wiretap channel")
  Member "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource allocation in a mac with and without security via game theoretic learning")
  Member "strong secrecy from channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "securing distributed function approximation via coding for continuous compound channels")
  Member "the wiretap channel with feedback encryption over the channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "the gaussian multiple access wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an achievable region for the multiple access wiretap channels with confidential and open messages")

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)