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: "blind mimome wiretap channel with delayed csit"
  Abstract: We study the Gaussian MIMOME wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers, while the eavesdroppers should not be able to decode the confidential message. Each node in the network is equipped with arbitrary number of antennas. Furthermore, channels are time varying, and there is no channel state information available at the transmitter (CSIT) with respect to eavesdroppers' channels; and transmitter only has access to delayed CSIT of the channel to the legitimate receiver. The secure degrees of freedom (SDoF) for such network has only been characterized for special cases, and is unknown in general. We completely characterize the SDoF of this network for all antenna configurations. In particular, we strictly improve the state-of-the-art achievable scheme for this network by proposing more efficient artificial noise alignment at the receivers. Furthermore, we develop a tight upper bound by utilizing 4 important inequalities that provide lower bounds on the received signal dimensions at receivers which supply delayed CSIT or no CSIT, or at a collection of receivers where some supply no CSIT. These inequalities together allow for analysis of signal dimensions in networks with asymmetric CSIT; and as a result, we present a converse proof that leads to characterization of SDoF for all possible antenna configurations.

Connected through hyperedge HE-1 (induced by source paper "on the dof of parallel miso bcs with partial csit total order and separability"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "optimal dof region of the k user miso bc with partial csit"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "miso networks with imperfect csit a topological rate splitting approach"
    - "miso broadcast channel with hybrid csit beyond two users"
    - "gdof of the miso bc bridging the gap between finite precision and perfect csit"

Connected through hyperedge HE-2 (induced by source paper "secrecy in mimo networks with no eavesdropper csit"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "secure degrees of freedom for the mimo wire tap channel with a multi antenna cooperative jammer"
    - "secure degrees of freedom of one hop wireless networks"
    - "feasibility of interference alignment for the mimo interference channel"
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "multiaccess channel with partially cooperating encoders and security 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)