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: "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.

Connected through hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "stealthy secret key generation"
    - "wiretap channels with causal state information strong secrecy"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-2 (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"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "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-3 (induced by source paper "covert communication with channel state information at the transmitter"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "wiretap channels with random states non causally available at the encoder"
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "distributed channel synthesis"
    - "perfectly secure steganography capacity error exponents and code constructions"

Connected through hyperedge HE-4 (induced by source paper "arbitrarily varying wiretap channels with type constrained states"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "secrecy results for compound wiretap channels"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-5 (induced by source paper "wiretap channels with random states non causally available at the encoder"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "renyi divergence and kullback leibler divergence"
    - "distributed channel synthesis"
    - "secret key generation using correlated sources and channels"
    - "a cryptographic treatment of the wiretap channel"
    - "secrecy via sources and channels"

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"
    - "individual secrecy for the broadcast channel"
    - "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"
    - "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"
    - "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"
    - "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)