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: "capacity bounds for broadcast channels with confidential messages"
  Abstract: This paper studies capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while each private message is only for its intended receiver. In addition, each private message is to be kept secret from the unintended receiver where secrecy is measured by equivocation. Both inner and outer bounds are proposed to the rate equivocation region for broadcast channels with confidential messages. The proposed inner bound generalizes Csiszar and Korner's rate equivocation region for broadcast channels with a single confidential message, Liu 's achievable rate region for broadcast channels with perfect secrecy, Marton's and Gel'fand-Pinsker's achievable rate region for general broadcast channels. The proposed outer bounds, together with the inner bound, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages, including the less noisy, deterministic, and semideterministic broadcast channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, the proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.

Connected through hyperedge HE-1 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "adding a helper can totally remove the secrecy constraints in interference channel"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the optimality of secure communication without using cooperative jamming"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "the wiretapped diamond relay channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-2 (induced by source paper "secure communication over interference channel to jam or not to jam"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-3 (induced by source paper "secure degrees of freedom regions of multiple access and interference channels the polytope structure"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"

Connected through hyperedge HE-4 (induced by source paper "finite state markov wiretap channel with delayed feedback"):
  with members:
    - "multiple access relay wiretap channel"
    - "relay broadcast channel with confidential messages"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "secret writing on dirty paper a deterministic view"
    - "interference assisted secret communication"
    - "on the capacity of memoryless finite state multiple access channels with asymmetric state information at the encoders"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-5 (induced by source paper "secure degrees of freedom of wireless x networks using artificial noise alignment"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "on x channels with feedback and delayed csi"
    - "secure communication over parallel relay channel"
    - "on achievable degrees of freedom for mimo x channels"
    - "interference alignment for secrecy"

Connected through hyperedge HE-6 (induced by source paper "multiple access relay wiretap channel"):
  with members:
    - "strong secrecy for multiple access channels"
    - "interference assisted secret communication"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-7 (induced by source paper "secure degrees of freedom of one hop wireless networks"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "interference alignment for secrecy"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "real interference alignment with real numbers"

Connected through hyperedge HE-8 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit"):
  with members:
    - "achievable secrecy rates over mimome gaussian channels with gmm signals in low noise regime"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "secure communication over fading channels"
    - "resource allocation for wireless fading relay channels max min solution"

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)