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 "joint power control in wiretap interference channels"):
  Abstract: Interference in wireless networks degrades the signal quality at the terminals. However, it can potentially enhance the secrecy rate. This paper investigates the secrecy rate in a two-user interference network where one of the users, namely user 1, needs to establish a confidential connection. User 1 wants to prevent an unintended user of the network from decoding its transmission. User 1 has to transmit such that its secrecy rate is maximized while the quality of service at the destination of the other user, user 2, is satisfied, and both user's power limits are taken into account. We consider two scenarios: 1) user 2 changes its power in favor of user 1, an altruistic scenario, and 2) user 2 is selfish and only aims to maintain the minimum quality of service at its destination, an egoistic scenario. It is shown that there is a threshold for user 2's transmission power that only below or above which, depending on the channel qualities, user 1 can achieve a positive secrecy rate. Closed-form solutions are obtained to perform joint optimal power control. Further, a new metric called secrecy energy efficiency is introduced. We show that in general, the secrecy energy efficiency of user 1 in an interference channel scenario is higher than that of an interference-free channel.

Includes members:
  Member "secure degrees of freedom of one hop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds")
  Member "outage constrained robust secure transmission for miso wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi antenna aided secrecy beamforming optimization for wirelessly powered hetnets")
  Member "spectrum leasing via cooperation for enhanced physical layer secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint secure beamforming for cognitive radio networks with untrusted secondary users")
  Member "interference assisted secret communication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "jammer assisted resource allocation in secure ofdma with untrusted users")
  Member "the gaussian many to one interference channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy")
  Member "cooperative secret communication with artificial noise in symmetric interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improving wireless physical layer security via exploiting co channel interference")
  Member "on the relationship between the multi antenna secrecy communications and cognitive radio communications":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust an aided beamforming and power splitting design for secure miso cognitive radio with swipt")

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)