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 antenna gaussian broadcast channels with confidential messages"
  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 a Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with \emph{information-theoretic secrecy}. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, a numerical example demonstrates that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.

Connected through hyperedge HE-1 (induced by source paper "cooperation with an untrusted relay a secrecy perspective"):
  with members:
    - "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"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "the role of feedback in two way secure communications"
    - "providing secrecy with lattice codes"
    - "two hop secure communication using an untrusted relay"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "two hop secure communication using an untrusted relay"):
  with members:
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the role of feedback in two way secure communications"
    - "the wiretap channel with feedback encryption over the channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "on the relationship between the multi antenna secrecy communications and cognitive radio communications"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "weighted sum rate optimization for cognitive radio mimo broadcast channels"
    - "secrecy capacity region of fading broadcast channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "cognitive interference channels with confidential messages"

Connected through hyperedge HE-4 (induced by source paper "interference channels with strong secrecy"):
  with members:
    - "the gaussian many to one interference channel with confidential messages"
    - "secure degrees of freedom for gaussian channels with interference structured codes outperform gaussian signaling"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "providing secrecy with lattice codes"
    - "k user interference channels achievable secrecy rate and degrees of freedom"
    - "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)