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: "on ergodic secrecy capacity for gaussian miso wiretap channels"
  Abstract: A Gaussian multiple-input single-output (MISO) wiretap channel model is considered, where there exists a transmitter equipped with multiple antennas, a legitimate receiver and an eavesdropper each equipped with a single antenna. We study the problem of finding the optimal input covariance that achieves ergodic secrecy capacity subject to a power constraint where only statistical information about the eavesdropper channel is available at the transmitter. This is a non-convex optimization problem that is in general difficult to solve. Existing results address the case in which the eavesdropper or/and legitimate channels have independent and identically distributed Gaussian entries with zero-mean and unit-variance, i.e., the channels have trivial covariances. This paper addresses the general case where eavesdropper and legitimate channels have nontrivial covariances. A set of equations describing the optimal input covariance matrix are proposed along with an algorithm to obtain the solution. Based on this framework, we show that when full information on the legitimate channel is available to the transmitter, the optimal input covariance has always rank one. We also show that when only statistical information on the legitimate channel is available to the transmitter, the legitimate channel has some general non-trivial covariance, and the eavesdropper channel has trivial covariance, the optimal input covariance has the same eigenvectors as the legitimate channel covariance. Numerical results are presented to illustrate the algorithm.

Connected through hyperedge HE-1 (induced by source paper "transmitter optimization in miso broadcast channel with common and secret messages"):
  with members:
    - "spatially selective artificial noise aided transmit optimization for miso multi eves secrecy rate maximization"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "robust secure transmission in miso channels based on worst case optimization"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-2 (induced by source paper "power allocation in mimo wiretap channel with statistical csi and finite alphabet input"):
  with members:
    - "full rank solutions for the mimo gaussian wiretap channel with an average power constraint"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "secrecy capacity of the gaussian wire tap channel with finite complex constellation input"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "on the secrecy rate region of a fading multiple antenna gaussian broadcast channel with confidential messages and partial csit"):
  with members:
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "cognitive radio with partial channel state information at the transmitter"
    - "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"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure communication over fading channels"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "robust secure transmission in miso channels based on worst case optimization"):
  with members:
    - "on cooperative relaying schemes for wireless physical layer security"
    - "optimal and robust transmit designs for miso channel secrecy by semidefinite programming"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "a robust artificial noise aided transmit design for miso secrecy"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity of the mimo wiretap 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)