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: "interference alignment for the multi antenna compound wiretap channel"
  Abstract: We study a wiretap channel model where the sender has $M$ transmit antennas and there are two groups consisting of $J_1$ and $J_2$ receivers respectively. Each receiver has a single antenna. We consider two scenarios. First we consider the compound wiretap model -- group 1 constitutes the set of legitimate receivers, all interested in a common message, whereas group 2 is the set of eavesdroppers. We establish new lower and upper bounds on the secure degrees of freedom. Our lower bound is based on the recently proposed \emph{real interference alignment} scheme. The upper bound provides the first known example which illustrates that the \emph{pairwise upper bound} used in earlier works is not tight. #R##N#The second scenario we study is the compound private broadcast channel. Each group is interested in a message that must be protected from the other group. Upper and lower bounds on the degrees of freedom are developed by extending the results on the compound wiretap channel.

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"
    - "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"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"

Connected through hyperedge HE-2 (induced by source paper "on the secrecy degrees of freedom of multi antenna wiretap channels with delayed csit"):
  with members:
    - "the degrees of freedom region and interference alignment for the mimo interference channel with delayed csi"
    - "the degrees of freedom regions of two user and certain three user mimo broadcast channels with delayed csit"
    - "retrospective interference alignment"
    - "on the secrecy degress of freedom of the multi antenna block fading wiretap channels"
    - "on the compound mimo broadcast channels with confidential messages"

Connected through hyperedge HE-3 (induced by source paper "distributed storage codes meet multiple access wiretap channels"):
  with members:
    - "the gaussian many to one interference channel with confidential messages"
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "interference alignment as a rank constrained rank minimization"
    - "on the existence of optimal exact repair mds codes for distributed storage"
    - "on the secure degrees of freedom of the multiple access channel"
    - "on the secrecy degress of freedom of the multi antenna block fading wiretap channels"
    - "a survey on network codes for distributed storage"
    - "searching for minimum storage regenerating codes"

Connected through hyperedge HE-4 (induced by source paper "on the secrecy degress of freedom of the multi antenna block fading wiretap channels"):
  with members:
    - "on the secure dof of the single antenna mac"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"
    - "on the compound mimo broadcast channels with confidential messages"
    - "on the degrees of freedom of finite state compound wireless networks settling a conjecture by weingarten et al"
    - "on the secure degrees of freedom in the k user gaussian interference channel"

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)