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 secrecy capacity of fast fading mimome wiretap channels with statistical csit"
  Abstract: In this paper, we consider secure transmissions in ergodic Rayleigh fast-faded multiple-input multiple-output multiple-antenna-eavesdropper (MIMOME) wiretap channels with only statistical channel state information at the transmitter (CSIT). When the antennas at the legitimate receiver are more than (or equal to) those at the eavesdropper, we prove the first MIMOME secrecy capacity with partial CSIT by establishing a new secrecy capacity upper-bound. The key step is to form an MIMOME degraded channel by dividing the legitimate receiver's channel matrix into two submatrices, and setting one of the submatrices to be the same as the eavesdropper's channel matrix. Next, under the total power constraint over all transmit antennas, we analytically solve the channel-input covariance matrix optimization problem to fully characterize the MIMOME secrecy capacity. Typically, the MIMOME optimization problems are non-concave. However, thanks to the proposed degraded channel, we can transform the stochastic MIMOME optimization problem to be a Schur-concave one and then find its solution. Besides total power constraint, we also investigate the secrecy capacity when the transmitter is subject to the practical per-antenna power constraint. The corresponding optimization problem is even more difficult since it is not Schur-concave. Under the two power constraints considered, the corresponding MIMOME secrecy capacities can both scale with the signal-to-noise ratios (SNR) when the difference between numbers of antennas at legitimate receiver and eavesdropper are large enough. However, when the legitimate receiver and eavesdropper have a single antenna each, such SNR scalings do not exist for both cases.

Connected through hyperedge HE-1 (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"
    - "power allocation in mimo wiretap channel with statistical csi and finite alphabet input"
    - "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-2 (induced by source paper "almost universal codes for fading wiretap channels"):
  with members:
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "an error probability approach to mimo wiretap channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-3 (induced by source paper "energy efficiency in secure multi antenna systems"):
  with members:
    - "energy efficient scheduling and power allocation in downlink ofdma networks with base station coordination"
    - "real and complex monotone communication games"
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"
    - "framework for link level energy efficiency optimization with informed transmitter"
    - "explicit solution of worst case secrecy rate for miso wiretap channels with spherical uncertainty"
    - "information theoretically secret key generation for fading wireless channels"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "on the transmit beamforming for mimo wiretap channels large system analysis"):
  with members:
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "a deterministic equivalent for the analysis of correlated mimo multiple access channels"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "secure communication in the low snr regime a characterization of the energy secrecy tradeoff"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "secret sharing over fast fading mimo wiretap channels"
    - "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)