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 "multiple access channel with common message and secrecy constraint"):
  Abstract: In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel with Common message (MAWC-CM). For this setting, we derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a special case called the switch channel. As well, for a Gaussian version of MAWC-CM, we derive inner and outer bounds on the secrecy capacity region. Providing numerical results for the Gaussian case, we illustrate the comparison between the derived achievable rate region and the outer bound for the considered model and the capacity region of compound multiple access channel.

Includes members:
  Member "compound multiple access channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the capacity region of the arbitrarily varying mac with and without constraints")
  Member "compound multiple access channels with partial cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "multiple access channels with generalized feedback and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiple access wiretap channel with noiseless feedback")
  Member "the discrete memoryless multiple access channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compound multiple access channel with confidential messages")
  Member "the gaussian multiple access wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)