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: "secrecy in mimo networks with no eavesdropper csit"
  Abstract: We consider two fundamental multi-user channel models: the multiple-input multiple-output (MIMO) wiretap channel with one helper (WTH) and the MIMO multiple access wiretap channel (MAC-WT). In each case, the eavesdropper has $K$ antennas while the remaining terminals have $N$ antennas each. We consider a fast fading channel where the channel state information (CSI) of the legitimate receiver is available at the transmitters but no channel state information at the transmitters (CSIT) is available for the eavesdropper's channel. We determine the optimal sum secure degrees of freedom (s.d.o.f.) for each channel model for the regime $K\leq N$, and show that in this regime, the MAC-WT channel reduces to the WTH in the absence of eavesdropper CSIT. For the regime $N\leq K\leq 2N$, we obtain the optimal linear s.d.o.f., and show that the MAC-WT channel and the WTH have the same optimal s.d.o.f. when restricted to linear encoding strategies. In the absence of any such restrictions, we provide an upper bound for the sum s.d.o.f. of the MAC-WT chanel in the regime $N\leq K\leq 2N$. Our results show that unlike in the single-input single-output (SISO) case, there is loss of s.d.o.f. for even the WTH due to lack of eavesdropper CSIT when $K\geq N$.

Connected through hyperedge HE-1 (induced by source paper "secure retrospective interference alignment"):
  with members:
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "ergodic interference alignment with delayed feedback"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "completely stale transmitter channel state information is still very useful"
    - "ergodic secret alignment"

Connected through hyperedge HE-2 (induced by source paper "on the secure degrees of freedom of the k user interference channel with delayed csit"):
  with members:
    - "secure retrospective interference alignment"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "ergodic interference alignment with delayed feedback"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "completely stale transmitter channel state information is still very useful"
    - "ergodic secret alignment"

Connected through hyperedge HE-3 (induced by source paper "improving anti eavesdropping ability without eavesdropper s csi a practical secure transmission design perspective"):
  with members:
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"

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)