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 achieved by a greedy relay in wireless networks"
  Abstract: Covert communication aims to hide the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, we examine the possibility and achievable performance of covert communication in one-way relay networks. Specifically, the relay is greedy and opportunistically transmits its own information to the destination covertly on top of forwarding the source's message, while the source tries to detect this covert transmission to discover the illegitimate usage of the resource (e.g., power, spectrum) allocated only for the purpose of forwarding source's information. We propose two strategies for the relay to transmit its covert information, namely fixed-rate and fixed-power transmission schemes, for which the source's detection limits are analysed in terms of the false alarm and miss detection rates and the achievable effective covert rates from the relay to destination are derived. Our examination determines the conditions under which the fixed-rate transmission scheme outperforms the fixed-power transmission scheme, and vice versa, which enables the relay to achieve the maximum effective covert rate. Our analysis indicates that the relay has to forward the source's message to shield its covert transmission and the effective covert rate increases with its forwarding ability (e.g., its maximum transmit power).

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"
    - "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"
    - "covert communication with finite blocklength in awgn 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 "covert millimeter wave communication via a dual beam transmitter"):
  with members:
    - "uplink non orthogonal multiple access over mixed rf fso systems"
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "covert communication over a k user multiple access channel"
    - "channel coding at low capacity"
    - "modeling and analyzing millimeter wave cellular systems"
    - "covert communication in fading channels under channel uncertainty"
    - "covert communications with a full duplex receiver over wireless fading channels"

Connected through hyperedge HE-3 (induced by source paper "challenges in covert wireless communications with active warden on awgn channels"):
  with members:
    - "multi hop routing in covert wireless networks"
    - "covert communication over a k user multiple access channel"
    - "covert wireless communication with a poisson field of interferers"
    - "covert wireless communication with artificial noise generation"
    - "covert communication with channel state information at the transmitter"
    - "the sound and the fury hiding communications in noisy wireless networks with interference uncertainty"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-4 (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 wireless communications with channel inversion power control in rayleigh fading"

Connected through hyperedge HE-5 (induced by source paper "gaussian signalling for covert communications"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "covert communication over a k user multiple access channel"
    - "multipath stealth communication with jammers"
    - "covert communication in wireless relay 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"

Connected through hyperedge HE-6 (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"
    - "covert wireless communications with channel inversion power control in rayleigh fading"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert communication in fading channels under channel uncertainty"

Connected through hyperedge HE-7 (induced by source paper "steganography protocols for quantum channels"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "covert wireless communication with artificial noise generation"
    - "covert communication in the presence of an uninformed jammer"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "effective secrecy reliability confusion and stealth"
    - "achievability proof via output statistics of random binning"
    - "perfectly secure steganography capacity error exponents and code constructions"

Connected through hyperedge HE-8 (induced by source paper "optimal detection of uav s transmission with beam sweeping in wireless networks"):
  with members:
    - "joint trajectory and communication design for multi uav enabled wireless networks"
    - "hierarchical codebook design for beamforming training in millimeter wave communication"
    - "wireless communications with unmanned aerial vehicles opportunities and challenges"

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)