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 "broadcast channels with privacy leakage constraints"):
  Abstract: The broadcast channel (BC) with one common and two private messages with leakage constraints is studied, where leakage rate refers to the normalized mutual information between a message and a channel symbol string. Each private message is destined for a different user and the leakage rate to the other receiver must satisfy a constraint. This model captures several scenarios concerning secrecy, i.e., when both, either or neither of the private messages are secret. Inner and outer bounds on the leakage-capacity region are derived when the eavesdropper knows the codebook. The inner bound relies on a Marton-like code construction and the likelihood encoder. A uniform approximation lemma is established that states that the marginal distribution induced by the encoder on each of the bins in the Marton codebook is approximately uniform. Without leakage constraints the inner bound recovers Marton’s region and the outer bound reduces to the UVW-outer bound. The bounds match for semi-deterministic (SD) and physically degraded (PD) BCs, as well as for BCs with a degraded message set. The leakage-capacity regions of the SD-BC and the BC with a degraded message set recover past results for different secrecy scenarios. A Blackwell BC example illustrates the results and shows how its leakage-capacity region changes from the capacity region without secrecy to the secrecy-capacity regions for different secrecy scenarios.

Includes members:
  Member "fourier motzkin elimination software for information theoretic inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "keyless covert communication via channel state information")
  Member "wiretap channels with random states non causally available at the encoder":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "keyless covert communication via channel state information")
  Member "strong secrecy for cooperative broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "keyless covert communication via channel state information")
  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 "a technique for deriving one shot achievability results in network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "exponential strong converse for successive refinement with causal decoder side information")
  Member "effective secrecy reliability confusion and stealth":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")

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)