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: "the secrecy rate region of the broadcast channel"
  Abstract: In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where individual secure messages are broadcast over open media and can be received by any illegitimate receiver. The secrecy level is measured by equivocation rate at the eavesdropper. We first study the general (non-degraded) broadcast channel with confidential messages. We present an inner bound on the secrecy capacity region for this model. The inner bound coding scheme is based on a combination of random binning and the Gelfand-Pinsker bining. This scheme matches the Marton's inner bound on the broadcast channel without confidentiality constraint. We further study the situation where the channels are degraded. For the degraded broadcast channel with confidential messages, we present the secrecy capacity region. Our achievable coding scheme is based on Cover's superposition scheme and random binning. We refer to this scheme as Secret Superposition Scheme. In this scheme, we show that randomization in the first layer increases the secrecy rate of the second layer. This capacity region matches the capacity region of the degraded broadcast channel without security constraint. It also matches the secrecy capacity for the conventional wire-tap channel. Our converse proof is based on a combination of the converse proof of the conventional degraded broadcast channel and Csiszar lemma. Finally, we assume that the channels are Additive White Gaussian Noise (AWGN) and show that secret superposition scheme with Gaussian codebook is optimal. The converse proof is based on the generalized entropy power inequality.

Connected through hyperedge HE-1 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement"):
  with members:
    - "secure broadcasting using independent secret keys"
    - "finite state markov wiretap channel with delayed feedback"
    - "multiple access relay wiretap channel"
    - "wiretap channel with causal state information and secure rate limited feedback"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "source coding for a simple network with receiver side information"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-2 (induced by source paper "degraded broadcast channel secrecy outside of a bounded range"):
  with members:
    - "an information theoretic approach to secret sharing"
    - "performance analysis and design of two edge type ldpc codes for the bec wiretap channel"
    - "informational divergence approximations to product distributions"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy from channel resolvability"
    - "degraded compound multi receiver wiretap channels"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "multi receiver wiretap channel with public and confidential messages"):
  with members:
    - "capacity equivocation region of the gaussian mimo wiretap channel"
    - "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-4 (induced by source paper "a new secret key agreement scheme in a four terminal network"):
  with members:
    - "rate regions of secret key sharing in a new source model"
    - "group secret key generation algorithms"
    - "the secret key private key capacity region for three terminals"

Connected through hyperedge HE-5 (induced by source paper "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"):
  with members:
    - "information theoretic proofs of entropy power inequalities"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "the secrecy capacity of the mimo wiretap channel"
    - "multiple access channels with generalized feedback and confidential messages"

Connected through hyperedge HE-6 (induced by source paper "secured communication over frequency selective fading channels a practical vandermonde precoding"):
  with members:
    - "interference alignment for secrecy"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "on the 3 receiver broadcast channel with degraded message sets and confidential messages"
    - "the secrecy capacity region of the gaussian mimo broadcast channel"
    - "the k receiver broadcast channel with confidential messages"
    - "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-7 (induced by source paper "degraded compound multi receiver wiretap channels"):
  with members:
    - "3 receiver broadcast channels with common and confidential messages"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "a vector generalization of costa s entropy power inequality with applications"
    - "secrecy rate region of the broadcast channel with an eavesdropper"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"

Connected through hyperedge HE-8 (induced by source paper "3 receiver broadcast channels with common and confidential messages"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"

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)