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: "multiple antenna secure broadcast over wireless networks"
  Abstract: In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with perfect secrecy. That is, each user would like to obtain its own message reliably and confidentially. First, a computable Sato-type outer bound on the secrecy capacity region is provided for a multi-antenna broadcast channel with confidential messages. Next, a dirty-paper secure coding scheme and its simplified version are described. For each case, the corresponding achievable rate region is derived under the perfect secrecy requirement. Finally, two numerical examples demonstrate that the Sato-type outer bound is consistent with the boundary of the simplified dirty-paper coding secrecy rate region.

Connected through hyperedge HE-1 (induced by source paper "diversity multiplexing tradeoff for the multiple antenna wire tap channel"):
  with members:
    - "opportunistic secrecy with a strict delay constraint"
    - "interference alignment for secrecy"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "secured communication over frequency selective fading channels a practical vandermonde precoding"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "on the compound mimo broadcast channels with confidential messages"
    - "on the delay limited secrecy capacity of fading channels"

Connected through hyperedge HE-2 (induced by source paper "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the mimome channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "multiple access channels with generalized feedback and confidential messages"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"

Connected through hyperedge HE-3 (induced by source paper "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"):
  with members:
    - "secure communication over fading channels"
    - "secure nested codes for type ii wiretap channels"
    - "cognitive interference channels with confidential messages"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"
    - "on the secrecy capacity of fading channels"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "wireless secrecy in cellular systems with infrastructure aided cooperation"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "to decode the interference or to consider it as noise"
    - "the mimome channel"
    - "the general gaussian multiple access and two way wire tap channels achievable rates and cooperative jamming"
    - "the relay eavesdropper channel cooperation for secrecy"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-5 (induced by source paper "multi antenna gaussian broadcast channels with confidential messages"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-6 (induced by source paper "the secrecy capacity of the mimo wiretap channel"):
  with members:
    - "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"
    - "secure communication over fading channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the mimome channel"
    - "secrecy capacity region of a multi antenna gaussian broadcast channel with confidential messages"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-7 (induced by source paper "information theoretic security in wireless networks"):
  with members:
    - "authentication over noisy channels"
    - "secure communication over fading channels"
    - "secrecy capacity region of fading broadcast channels"
    - "secrecy capacity of the wiretap channel with noisy feedback"
    - "secure nested codes for type ii wiretap channels"
    - "cognitive interference channels with confidential messages"
    - "multiple access channels with generalized feedback and confidential messages"
    - "secrecy capacity region of binary and gaussian multiple access channels"

Connected through hyperedge HE-8 (induced by source paper "secrecy capacity region of a multi antenna gaussian broadcast channel with confidential messages"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"

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)