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 multiple input wiretap channels with statistical csit"
  Abstract: We consider the secure transmission in ergodic fast Rayleigh fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels are the only available channel state information at the transmitter (CSIT). By introducing a new secrecy capacity upper bound, we prove that the secrecy capacity is achieved by the Gaussian input without prefixing. To attain this result, we form another MISOSE channel for upper-bounding by relaxing the equivocation constraint, and tighten the bound by carefully selecting correlations between the legitimate and eavesdropper channel gains. The resulting upper bound is tighter than the others in the literature which are based on modifying the correlation between the noises at the legitimate receiver and eavesdropper. Next, we fully characterize the secrecy capacity by showing that the optimal channel input covariance matrix is a scaled identity matrix. The key to solve such a stochastic optimization problem is by exploiting the completely monotone property of the secrecy capacity. Finally, we prove that with only statistical CSIT of both channels, the capacity will neither scale with signal-to-noise ratio (SNR) nor the number of antenna. Our numerical results also match these observations and further confirm that having the legitimate CSIT (realizations) is very beneficial to increase the secrecy capacity.

Connected through hyperedge HE-1 (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 mimome 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-2 (induced by source paper "on secrecy capacity of fast fading mimome wiretap channels with statistical csit"):
  with members:
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"
    - "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input"
    - "multiuser miso transmitter optimization for intercell interference mitigation"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "diversity multiplexing tradeoff for the multiple antenna wire tap channel"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-3 (induced by source paper "on the transmit beamforming for mimo wiretap channels large system analysis"):
  with members:
    - "on secrecy capacity of fast fading mimome 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"

Connected through hyperedge HE-4 (induced by source paper "secrecy transmission on block fading channels theoretical limits and performance of practical codes"):
  with members:
    - "a physical layer secured key distribution technique for ieee 802 11g wireless networks"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "increasing physical layer security through scrambled codes and arq"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "coding for cryptographic security enhancement using stopping sets"

Connected through hyperedge HE-5 (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:
    - "cognitive radio with partial channel state information at the transmitter"
    - "on ergodic secrecy capacity for gaussian miso wiretap channels"
    - "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-6 (induced by source paper "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels"):
  with members:
    - "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input"
    - "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"
    - "a note on the secrecy capacity of the multi antenna 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)