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 "strong secrecy for cooperative broadcast channels"):
  Abstract: A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided user. The secrecy level is measured in terms of strong secrecy, i.e., a vanishing information leakage. An inner bound on the capacity region is derived by using a channel-resolvability-based code that double-bins the codebook of the secret message, and by using a likelihood encoder to choose the transmitted codeword. The inner bound is shown to be tight for semi-deterministic and physically degraded BCs and the results are compared to those of the corresponding BCs without a secrecy constraint. Blackwell and Gaussian BC examples illustrate the impact of secrecy on the rate regions. Unlike the case without secrecy, where sharing information about both private messages via the cooperative link is optimal, our protocol conveys parts of the common and non-confidential messages only. This restriction reduces the transmission rates more than the usual rate loss due to secrecy requirements. An example that shows this loss can be strict is also provided.

Includes members:
  Member "broadcast channels with privacy leakage constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mimo gaussian broadcast channels with common private and confidential messages")
  Member "fourier motzkin elimination software for information theoretic inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "the likelihood encoder for lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "keyless covert communication via channel state information")
  Member "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "secrecy capacity region of some classes of wiretap broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "on state dependent broadcast channels with cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications")
  Member "the henchman problem measuring secrecy by the minimum distortion in a list":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "strategic communication with side information at the decoder")

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)