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: "two way training for discriminatory channel estimation in wireless mimo systems"
  Abstract: This work examines the use of two-way training to efficiently discriminate the channel estimation performances at a legitimate receiver (LR) and an unauthorized receiver (UR) in a multiple-input multiple-output (MIMO) wireless system. This work improves upon the original discriminatory channel estimation (DCE) scheme proposed by Chang where multiple stages of feedback and retraining were used. While most studies on physical layer secrecy are under the information-theoretic framework and focus directly on the data transmission phase, studies on DCE focus on the training phase and aim to provide a practical signal processing technique to discriminate between the channel estimation performances (and, thus, the effective received signal qualities) at LR and UR. A key feature of DCE designs is the insertion of artificial noise (AN) in the training signal to degrade the channel estimation performance at UR. To do so, AN must be placed in a carefully chosen subspace, based on the transmitter's knowledge of LR's channel, in order to minimize its effect on LR. In this paper, we adopt the idea of two-way training that allows both the transmitter and LR to send training signals to facilitate channel estimation at both ends. Both reciprocal and nonreciprocal channels are considered and a two-way DCE scheme is proposed for each scenario. For mathematical tractability, we assume that all terminals employ the linear minimum mean square error criterion for channel estimation. Based on the mean square error (MSE) of the channel estimates at all terminals, we formulate and solve an optimization problem where the optimal power allocation between the training signal and AN is found by minimizing the MSE of LR's channel estimate subject to a constraint on the MSE achievable at UR. Numerical results show that the proposed DCE schemes can effectively discriminate between the channel estimation and, hence, the data detection performances at LR and UR.

Connected through hyperedge HE-1 (induced by source paper "on the role of artificial noise in training and data transmission for secret communications"):
  with members:
    - "power allocation and time domain artificial noise design for wiretap ofdm with discrete inputs"
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "multiuser mimo achievable rates with downlink training and channel state feedback"

Connected through hyperedge HE-2 (induced by source paper "a semiblind two way training method for discriminatory channel estimation in mimo systems"):
  with members:
    - "on the secrecy outage capacity of physical layer security in large scale mimo relaying systems with imperfect csi"
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"
    - "relay selection for two way relaying with amplify and forward protocols"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation"

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)