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: "secret sharing over fast fading mimo wiretap channels"
  Abstract: Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are different from but correlated to those made by the destination. An interactive authenticated unrestricted public channel is also available for use by the source and destination in the secret sharing process. This falls under the "channel-type model with wiretapper" considered by Ahlswede and Csiszar. A minor extension of their result (to continuous channel alphabets) is employed to evaluate the key capacity of the fast-fading MIMO wiretap channel. The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and wiretapper are then investigated.

Connected through hyperedge HE-1 (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 secrecy capacity of fast fading mimome wiretap channels with statistical csit"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "key agreement over an interference channel with noiseless feedback achievable region distributed allocation"):
  with members:
    - "secret key agreement using correlated sources over the generalized multiple access channel"
    - "strongly secure communications over the two way wiretap channel"
    - "information theoretically secret key generation for fading wireless channels"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

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"
    - "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"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar coding for secure transmission and key agreement"
    - "non systematic codes for physical layer security"
    - "efficient reconciliation protocol for discrete variable quantum key distribution"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "secure nested codes for type ii wiretap channels"
    - "side information coding with turbo codes and its application to quantum key distribution"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "an error probability approach to mimo wiretap channels"):
  with members:
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "lattice codes for the gaussian wiretap channel"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "secrecy gain a wiretap lattice code design"
    - "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)