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 "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"):
  Abstract: We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers while ensuring mutual information-theoretic secrecy. That is, each receiver is kept in total ignorance with respect to the message intended for the other receiver. The secrecy level is measured by the equivocation rate at the eavesdropping receiver. In this paper, we present inner and outer bounds on secrecy capacity regions for these two communication systems. The derived outer bounds have an identical mutual information expression that applies to both channel models. The difference is in the input distributions over which the expression is optimized. The inner bound rate regions are achieved by random binning techniques. For the broadcast channel, a double-binning coding scheme allows for both joint encoding and preserving of confidentiality. Furthermore, we show that, for a special case of the interference channel, referred to as the switch channel, derived bounds meet. Finally, we describe several transmission schemes for Gaussian interference channels and derive their achievable rate regions while ensuring mutual information-theoretic secrecy. An encoding scheme in which transmitters dedicate some of their power to create artificial noise is proposed and shown to outperform both time-sharing and simple multiplexed transmission of the confidential messages.

Includes members:
  Member "secure communication over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")
  Member "secure nested codes for type ii wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy")
  Member "multiple antenna secure broadcast over wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diversity multiplexing tradeoff for the multiple antenna wire tap channel")
  Member "cognitive interference channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity of the semi deterministic cognitive interference channel with a common cognitive message and approximate capacity for the gaussian case")
  Member "the gaussian multiple access wire tap channel with collective secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the secrecy capacity of the broadcast wiretap channel with limited csi feedback")
  Member "the discrete memoryless multiple access channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multiple access channel with common message and secrecy constraint")
  Member "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the secure degrees of freedom of the k user mac and 2 user interference channels")
  Member "on the secrecy capacity of fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")

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)