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: "secure communication over fading channels with statistical qos constraints"
  Abstract: In this paper, the secure transmission of information over an ergodic fading channel is investigated in the presence of statistical quality of service (QoS) constraints. We employ effective capacity, which provides the maximum constant arrival rate that a given process can support while satisfying statistical delay constraints, to measure the secure throughput of the system, i.e., effective secure throughput. We assume that the channel side information (CSI) of the main channel is available at the transmitter side. Depending on the availability of the CSI of the eavesdropper channel, we obtain the corresponding optimal power control policies that maximize the effective secure throughput. In particular, when the CSI of the eavesdropper channel is available at the transmitter, the transmitter can no longer wait for transmission when the main channel is much better than the eavesdropper channel due to the introduction of QoS constraints. Moreover, the CSI of the eavesdropper channel becomes useless as QoS constraints become stringent.

Connected through hyperedge HE-1 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints"):
  with members:
    - "uplink achievable rate for massive mimo systems with low resolution adc"
    - "effective secrecy reliability confusion and stealth"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-2 (induced by source paper "secure wireless communication and optimal power control under statistical queueing constraints"):
  with members:
    - "secure broadcasting over fading channels with statistical qos constraints"
    - "on the delay limited secrecy capacity of fading channels"
    - "the impact of qos constraints on the energy efficiency of fixed rate wireless transmissions"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "analysis of energy efficiency in fading channels under qos constraints"

Connected through hyperedge HE-3 (induced by source paper "secure broadcasting over fading channels with statistical qos constraints"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "secure communication over fading channels"
    - "resource allocation for wireless fading relay channels max min solution"
    - "on the secrecy capacity of 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)