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: "multi receiver wiretap channel with public and confidential messages"
  Abstract: We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter sends a pair of public and confidential messages to each legitimate user. While there are no secrecy constraints on the public messages, confidential messages need to be transmitted in perfect secrecy. We study the discrete memoryless multi-receiver wiretap channel as well as its Gaussian multi-input multi-output (MIMO) instance. First, we consider the degraded discrete memoryless channel, and obtain an inner bound for the capacity region by using an achievable scheme that uses superposition coding and binning. Next, we obtain an outer bound, and show that this outer bound partially matches the inner bound, providing a partial characterization for the capacity region of the degraded channel model. Second, we obtain an inner bound for the general, not necessarily degraded, discrete memoryless channel by using Marton's inner bound, superposition coding, rate-splitting and binning. Third, we consider the degraded Gaussian MIMO channel, and show that, to evaluate both the inner and outer bounds, considering only jointly Gaussian auxiliary random variables and channel input is sufficient. Since the inner and outer bounds partially match, these sufficiency results provide a partial characterization of the capacity region of the degraded Gaussian MIMO channel. Finally, we provide an inner bound for the capacity region of the general, not necessarily degraded, Gaussian MIMO multi-receiver wiretap channel.

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"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "strong secrecy for multiple access channels"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"

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"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "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 "secrecy capacity memory tradeoff of erasure broadcast channels"):
  with members:
    - "secure broadcasting using independent secret keys"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "cache enabled physical layer security for video streaming in backhaul limited cellular networks"
    - "a secure approach for caching contents in wireless ad hoc networks"
    - "noisy broadcast networks with receiver caching"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "on edge caching with secrecy constraints"

Connected through hyperedge HE-4 (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"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"

Connected through hyperedge HE-5 (induced by source paper "mimo gaussian broadcast channels with common private and confidential messages"):
  with members:
    - "broadcast channels with privacy leakage constraints"
    - "the capacity region of the two receiver vector gaussian broadcast channel with private and common messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-6 (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"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "secrecy capacity region of some classes of wiretap broadcast channels"):
  with members:
    - "the capacity region of classes of product broadcast channels"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"

Connected through hyperedge HE-8 (induced by source paper "secrecy capacity scaling in large cooperative wireless networks"):
  with members:
    - "constrained colluding eavesdroppers an information theoretic model"
    - "scaling laws for secrecy capacity in cooperative wireless networks"
    - "secure diversity multiplexing tradeoff of zero forcing transmit scheme at finite snr"
    - "an overview of the transmission capacity of wireless networks"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "diversity multiplexing tradeoff for the multiple antenna wire tap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

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)