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: "covert wireless communications with channel inversion power control in rayleigh fading"
  Abstract: Considering Rayleigh fading channels, in this work we adopt channel inversion power control to achieve covert communications, where a transmitter can possibly hide itself from a warden while transmitting information to a receiver. Specifically, we examine the performance of the achieved covert communications in two scenarios in terms of the effective covert rate (ECR), which quantifies the amount of information that the transmitter can reliably convey to the receiver subject to the warden's detection error probability being no less than some specific value. In the first scenario, the noise uncertainty at the warden serves as the enabler of covert communications and our examination shows that increasing the noise uncertainty at the warden and the receiver simultaneously may not continuously improve the ECR. In the second scenario, covert communications are aided by a full-duplex receiver, which always transmits artificial noise (AN) with a random power. Our analysis indicates that the achieved ECR approaches to an upper bound as the transmit power of AN approaches to infinity. This work provides useful guidelines and performance limits on achieving covert communications and potentially hiding a transmitter in practical Rayleigh fading channels.

Connected through hyperedge HE-1 (induced by source paper "pilot based channel estimation design in covert wireless communication"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "covert transmission with a self sustained relay"
    - "gaussian signalling for covert communications"
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "joint optimization of a uav s trajectory and transmit power for covert communications"
    - "covert communication achieved by a greedy relay in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "covert wireless communication in presence of a multi antenna adversary and delay constraints"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "gaussian signalling for covert communications"
    - "achieving covert wireless communications using a full duplex receiver"
    - "joint optimization of a uav s trajectory and transmit power for covert communications"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert communication in fading channels under channel uncertainty"

Connected through hyperedge HE-3 (induced by source paper "one way urllc with truncated channel inversion power control"):
  with members:
    - "physical layer security for ultra reliable and low latency communications"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "on stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control"

Connected through hyperedge HE-4 (induced by source paper "achieving covert wireless communications using a full duplex receiver"):
  with members:
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert wireless communication with a poisson field of interferers"
    - "physical layer security jamming theoretical limits and practical designs in wireless networks"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "covert communications with a full duplex receiver over wireless fading channels"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

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)