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 "cooperation with an untrusted relay a secrecy perspective"):
  Abstract: We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general untrusted relay channel, and proceed to investigate this question for two types of relay networks with orthogonal components. For the first model, there is an orthogonal link from the source to the relay. For the second model, there is an orthogonal link from the relay to the destination. For the first model, we find the equivocation capacity region and show that answer is negative. In contrast, for the second model, we find that the answer is positive. Specifically, we show, by means of the achievable secrecy rate based on compress-and-forward, that by asking the untrusted relay node to relay information, we can achieve a higher secrecy rate than just treating the relay as an eavesdropper. For a special class of the second model, where the relay is not interfering itself, we derive an upper bound for the secrecy rate using an argument whose net effect is to separate the eavesdropper from the relay. The merit of the new upper bound is demonstrated on two channels that belong to this special class. The Gaussian case of the second model mentioned above benefits from this approach in that the new upper bound improves the previously known bounds. For the Cover-Kim deterministic relay channel, the new upper bound finds the secrecy capacity when the source-destination link is not worse than the source-relay link, by matching with achievable rate we present.

Includes members:
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "providing secrecy with structured codes tools and applications to two user gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "the role of feedback in two way secure communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning an adversary s actions for secret communication")
  Member "providing secrecy with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "perfect secrecy in physical layer network coding systems from structured interference")
  Member "two hop secure communication using an untrusted relay":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "multi antenna gaussian broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "two hop secure communication using an untrusted relay")

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)