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 mimome channel"
  Abstract: The MIMOME channel is a Gaussian wiretap channel in which the sender, receiver, and eavesdropper all have multiple antennas. We characterize the secrecy capacity as the saddle-value of a minimax problem. Among other implications, our result establishes that a Gaussian distribution maximizes the secrecy capacity characterization of Csisz{\'a}r and K{\"o}rner when applied to the MIMOME channel. We also determine a necessary and sufficient condition for the secrecy capacity to be zero. Large antenna array analysis of this condition reveals several useful insights into the conditions under which secure communication is possible.

Connected through hyperedge HE-1 (induced by source paper "strongly secure communications over the two way wiretap channel"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the wiretap channel with feedback encryption over the channel"
    - "secret communication with feedback"
    - "secrecy capacity region of fading broadcast channels"
    - "the secrecy capacity of the mimo wiretap channel"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-2 (induced by source paper "on cooperative relaying schemes for wireless physical layer security"):
  with members:
    - "optimal and robust transmit designs for miso channel secrecy by semidefinite programming"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the ergodic capacity of the mimo wire tap channel"
    - "secrecy capacity of a class of orthogonal relay eavesdropper channels"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"):
  with members:
    - "the secrecy capacity of the mimo wiretap channel"
    - "the general gaussian multiple access and two way wire tap channels achievable rates and cooperative jamming"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"
    - "on the secrecy capacity of fading channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "interference alignment for secrecy"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the wiretap channel with feedback encryption over the channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "on ergodic secrecy capacity for gaussian miso wiretap channels"):
  with members:
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "secure transmission with multiple antennas ii the mimome wiretap channel"):
  with members:
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-7 (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-8 (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"

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)