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 input multiple output gaussian broadcast channels with confidential messages"
  Abstract: This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise and random binning.

Connected through hyperedge HE-1 (induced by source paper "mimo multiple access channel with an arbitrarily varying eavesdropper"):
  with members:
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "interference alignment for the multi antenna compound wiretap channel"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "on the secure degrees of freedom of the multiple access channel"
    - "distributed storage codes meet multiple access wiretap channels"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "on the compound mimo broadcast channels with confidential messages"

Connected through hyperedge HE-2 (induced by source paper "capacity region of gaussian mimo broadcast channels with common and confidential messages"):
  with members:
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "mimo gaussian broadcast channels with confidential and common messages"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "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"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "capacity bounds for broadcast channels with confidential messages"

Connected through hyperedge HE-3 (induced by source paper "mimo gaussian broadcast channels with confidential and common messages"):
  with members:
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "capacity bounds for broadcast channels with confidential messages"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "secrecy capacity region of a multi antenna gaussian broadcast channel with confidential messages"

Connected through hyperedge HE-4 (induced by source paper "secret key agreement from correlated gaussian sources by rate limited public communication"):
  with members:
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "secret key agreement by soft decision of signals in gaussian maurer s model"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "reconciliation of a quantum distributed gaussian key"

Connected through hyperedge HE-5 (induced by source paper "the secrecy capacity region of the degraded vector gaussian broadcast channel"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "the secrecy capacity region of the gaussian mimo broadcast channel"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

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)