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 in the presence of an uninformed jammer"
  Abstract: Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to $\mathcal{O}(\sqrt{n})$ bits in $n$ channel uses. However, this assumes Willie has an accurate statistical characterization of the channel. When Willie has uncertainty about such and his receiver is limited to a threshold test on the received power, Alice can transmit covertly with a power that does not decrease with $n$, thus conveying $\mathcal{O}(n)$ bits covertly and reliably in $n$ uses of an AWGN channel. Here, we consider covert communication of $\mathcal{O}(n)$ bits in $n$ channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume an uninformed "jammer" is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with $n$ even when Willie employs an optimal detector.

Connected through hyperedge HE-1 (induced by source paper "multi antenna jamming in covert communication"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "solutions for the mimo gaussian wiretap channel with a cooperative jammer"

Connected through hyperedge HE-2 (induced by source paper "multi antenna covert communications in random wireless networks"):
  with members:
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert wireless communication with a poisson field of interferers"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "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-3 (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"
    - "covert communication with finite blocklength in awgn channels"
    - "on covert communication with noise uncertainty"

Connected through hyperedge HE-4 (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 achieved by a greedy relay in wireless networks"
    - "covert communication in fading channels under channel uncertainty"

Connected through hyperedge HE-5 (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 communication achieved by a greedy relay in wireless networks"
    - "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"

Connected through hyperedge HE-6 (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-7 (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 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"

Connected through hyperedge HE-8 (induced by source paper "covert secret key generation with an active warden"):
  with members:
    - "covert communication over adversarially jammed channels"
    - "stealthy secret key generation"
    - "covert communication in fading channels under channel uncertainty"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "the likelihood encoder for lossy compression"
    - "covert communication over noisy channels a resolvability perspective"
    - "principles of physical layer security in multiuser wireless networks a survey"

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)