human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "secrecy capacity region of some classes of wiretap broadcast channels"
  Abstract: This paper investigates the secrecy capacity of the wiretap broadcast channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a broadcast channel (BC) while keeping them secret from the eavesdropper. We derive a nontrivial outer bound on the secrecy capacity region of this channel which, in absence of security constraints, reduces to the best known outer bound to the capacity of the standard BC. An inner bound is also derived, which follows the behavior of both the best known inner bound for the BC and the wiretap channel. These bounds are shown to be tight for the deterministic BC with a general eavesdropper, the semideterministic BC with a more noisy eavesdropper, and the wiretap BC where users exhibit a less noisiness order between them. Finally, by rewriting our outer bound to encompass the characteristics of parallel channels, we also derive the secrecy capacity region of the product of two inversely less noisy BCs with a more noisy eavesdropper. We illustrate our results by studying the impact of security constraints on the capacity of the WBC with binary erasure and binary symmetric components.

Connected through hyperedge HE-1 (induced by source paper "secrecy rates for a channel with two senders and two receivers"):
  with members:
    - "energy efficient multicell multigroup multicasting with joint beamforming and antenna selection"
    - "secure multi source multicast"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "semantic security capacity for wiretap channels of type ii"
    - "strong secrecy for multiple access channels"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "multi receiver wiretap channel with public and confidential messages"

Connected through hyperedge HE-2 (induced by source paper "polar coding for the wiretap broadcast channel with multiple messages"):
  with members:
    - "polar coding for common message only wiretap broadcast channel"
    - "multi receiver wiretap channel with public and confidential messages"
    - "polar codes are optimal for lossy source coding"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-3 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "capacity of the state dependent wiretap channel secure writing on dirty paper"
    - "analogy between gambling and measurement based work extraction"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "on state dependent broadcast channels with cooperation"
    - "converses for secret key agreement and secure computing"

Connected through hyperedge HE-4 (induced by source paper "broadcast channels with privacy leakage constraints"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "strong secrecy for cooperative broadcast channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "a technique for deriving one shot achievability results in network information theory"
    - "effective secrecy reliability confusion and stealth"
    - "the capacity region of the two receiver vector gaussian broadcast channel with private and common messages"

Connected through hyperedge HE-5 (induced by source paper "strong secrecy for cooperative broadcast channels"):
  with members:
    - "broadcast channels with privacy leakage constraints"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "on state dependent broadcast channels with cooperation"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "secure coordination with a two sided helper"

Connected through hyperedge HE-6 (induced by source paper "individual secrecy for broadcast channels with receiver side information"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "strong secrecy for cooperative broadcast channels"
    - "individual secrecy for the broadcast channel"
    - "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "effective secrecy reliability confusion and stealth"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "reliability and secrecy functions of the wiretap channel under cost constraint"

Connected through hyperedge HE-7 (induced by source paper "individual secrecy for the broadcast channel"):
  with members:
    - "broadcast channels with privacy leakage constraints"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "strong secrecy for cooperative broadcast channels"
    - "individual secrecy for broadcast channels with receiver side information"
    - "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "effective secrecy reliability confusion and stealth"
    - "reliability and secrecy functions of the wiretap channel under cost constraint"
    - "wireless network information flow a deterministic approach"

Question: Please tell me which class the center node 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)