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 communication with finite blocklength in awgn channels"
  Abstract: Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication in AWGN channels with finite blocklength, in which the number of channel uses is finite. Specifically, we analytically prove that the entire block (all available channel uses) should be utilized to maximize the effective throughput of the transmission subject to a predetermined covert requirement. This is a nontrivial result because more channel uses results in more observations at the warden for detecting the transmission. We also determine the maximum allowable transmit power per channel use, which is shown to decrease as the blocklength increases. Despite the decrease in the maximum allowable transmit power per channel use, the maximum allowable total power over the entire block is proved to increase with the blocklength, which leads to the fact that the effective throughput increases with the blocklength.

Connected through hyperedge HE-1 (induced by source paper "covert transmission with a self sustained relay"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "multi hop routing in covert wireless networks"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "wireless powered dense cellular networks how many small cells do we need"
    - "covert communication in fading channels under channel uncertainty"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "secrecy and covert communications against uav surveillance via multi hop networks"):
  with members:
    - "safeguarding wireless network with uavs a physical layer security perspective"
    - "coverage probability analysis of uav cellular networks in urban environments"
    - "secure routing with power optimization for ad hoc networks"
    - "securing uav communications via joint trajectory and power control"
    - "multi hop routing in covert wireless networks"
    - "robust trajectory and transmit power design for secure uav communications"
    - "securing uav communications via trajectory optimization"
    - "covert communication in fading channels under channel uncertainty"

Connected through hyperedge HE-3 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "the third order term in the normal approximation for the awgn channel"

Connected through hyperedge HE-4 (induced by source paper "covert wireless communications with channel inversion power control in rayleigh fading"):
  with members:
    - "gaussian signalling for covert communications"
    - "achieving covert wireless communications using a full duplex receiver"
    - "adaptive full duplex jamming receiver for secure d2d links in random networks"
    - "covert communication in wireless relay networks"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert wireless communication with a poisson field of interferers"
    - "covert communication in fading channels under channel uncertainty"
    - "covert communications with a full duplex receiver over wireless fading channels"

Connected through hyperedge HE-5 (induced by source paper "a finite block length achievability bound for low probability of detection communication"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "simple channel coding bounds"

Connected through hyperedge HE-6 (induced by source paper "covert communication achieved by a greedy relay in wireless networks"):
  with members:
    - "covert communication in wireless relay networks"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication in fading channels under channel uncertainty"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "artificial noise aided secure transmission in large scale spectrum sharing networks"
    - "artificial noise aided secure transmission with directional modulation based on random frequency diverse arrays"
    - "covert communication in the presence of an uninformed jammer"

Connected through hyperedge HE-7 (induced by source paper "covert wireless communication with a poisson field of interferers"):
  with members:
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "covert wireless communication with artificial noise generation"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication in the presence of an uninformed jammer"
    - "cooperative relaying under spatially and temporally correlated interference"
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "reliable deniable communication hiding messages in noise"

Connected through hyperedge HE-8 (induced by source paper "covert communications with a full duplex receiver over wireless fading channels"):
  with members:
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert communication in fading channels under channel uncertainty"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication in the presence of an uninformed jammer"
    - "covert communication over noisy channels a resolvability perspective"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "improving physical layer secrecy using full duplex jamming receivers"

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)