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 the secrecy capacity of fading channels"
  Abstract: We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full Channel State Information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average SNR goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Remarkably, our results reveal the positive impact of fading on the secrecy capacity and establish the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels.

Connected through hyperedge HE-1 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit"):
  with members:
    - "achievable secrecy rates over mimome gaussian channels with gmm signals in low noise regime"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "capacity bounds for broadcast channels with confidential messages"
    - "secure communication over fading channels"

Connected through hyperedge HE-2 (induced by source paper "secure wireless information and power transfer in large scale mimo relaying systems with imperfect csi"):
  with members:
    - "on the secrecy outage capacity of physical layer security in large scale mimo relaying systems with imperfect csi"
    - "secrecy wireless information and power transfer with miso beamforming"
    - "energy efficient optimization for wireless information and power transfer in large scale mimo systems employing energy beamforming"
    - "simultaneous information and power transfer for broadband wireless systems"
    - "optimal relay selection for physical layer security in cooperative wireless networks"
    - "relay selection for simultaneous information transmission and wireless energy transfer a tradeoff perspective"
    - "wireless information and power transfer in two way amplify and forward relaying channels"
    - "robust beamforming for wireless information and power transmission"

Connected through hyperedge HE-3 (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"
    - "on ergodic secrecy capacity for gaussian miso wiretap channels"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "on secrecy capacity of fast fading mimome wiretap channels with statistical csit"):
  with members:
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "security in cognitive radio networks"):
  with members:
    - "on the relationship between the multi antenna secrecy communications and cognitive radio communications"
    - "effective capacity analysis of cognitive radio channels for quality of service provisioning"
    - "secrecy in cooperative relay broadcast channels"
    - "secure communication over fading channels"

Connected through hyperedge HE-6 (induced by source paper "practical provably secure multi node communication"):
  with members:
    - "opportunistic secrecy with a strict delay constraint"
    - "keys through arq theory and practice"
    - "arq security in wi fi and rfid networks"
    - "arq secrecy from theory to practice"

Connected through hyperedge HE-7 (induced by source paper "exploiting large scale mimo techniques for physical layer security with imperfect channel state information"):
  with members:
    - "performance analysis for physical layer security in multi antenna downlink networks with limited csi feedback"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "energy efficient optimization for physical layer security in multi antenna downlink networks with qos guarantee"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "optimal power allocation in block fading gaussian channels with causal csi and secrecy constraints"):
  with members:
    - "secrecy outage capacity of fading channels"
    - "secure communication over fading 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)