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: "power allocation in mimo wiretap channel with statistical csi and finite alphabet input"
  Abstract: In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secrecy rate of scalar wiretap channels subject to linear constraints on the transmit covariance matrix. We then consider the MIMO wiretap channel with finite-alphabet input. We show that the transmit covariance matrix obtained for the case of Gaussian input, when used in the MIMO wiretap channel with finite-alphabet input, can lead to zero secrecy rate at high transmit powers. We then propose a power allocation scheme with an additional power constraint which alleviates this secrecy rate loss problem, and gives non-zero secrecy rates at high transmit powers.

Connected through hyperedge HE-1 (induced by source paper "an overview of physical layer security with finite alphabet signaling"):
  with members:
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "physical layer cryptography through massive mimo"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "sum secrecy rate maximization for full duplex two way relay networks using alamouti based rank two beamforming"
    - "performance of lattice coset codes on universal software radio peripherals"
    - "secure m psk communication via directional modulation"
    - "finite blocklength bounds for wiretap channels"
    - "physical layer security in millimeter wave cellular networks"

Connected through hyperedge HE-2 (induced by source paper "secrecy rate of distributed cooperative mimo in the presence of multi antenna eavesdropper"):
  with members:
    - "cooperative secure transmission by exploiting social ties in random networks"
    - "on secrecy performance of antenna selection aided mimo systems against eavesdropping"
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "optimization of code rates in sisome wiretap channels"
    - "secure and green swipt in distributed antenna networks with limited backhaul capacity"
    - "on secrecy capacity of fast fading mimome wiretap channels with statistical csit"
    - "full rank solutions for the mimo gaussian wiretap channel with an average power constraint"
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"

Connected through hyperedge HE-3 (induced by source paper "mimo df relay beamforming for secrecy with artificial noise imperfect csi and finite alphabet"):
  with members:
    - "robust secure transmission in miso channels based on worst case optimization"
    - "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input"
    - "on cooperative relaying schemes for wireless physical layer security"
    - "collaborative relay beamforming for secrecy"
    - "secrecy capacity of the gaussian wire tap channel with finite complex constellation input"
    - "the secrecy capacity of the mimo wiretap channel"
    - "mutual information and minimum mean square error in gaussian 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)