human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "covert wireless communication with artificial noise generation"):
  Abstract: Covert communication conceals the transmission of the message from an attentive adversary. Recent work on the limits of covert communication in additive white Gaussian noise (AWGN) channels has demonstrated that a covert transmitter (Alice) can reliably transmit a maximum of $\mathcal{O}\left(\sqrt{n}\right)$ bits to a covert receiver (Bob) without being detected by an adversary (Warden Willie) in $n$ channel uses. This paper focuses on the scenario where other friendly nodes distributed according to a two-dimensional Poisson point process with density $m$ are present in the environment. We propose a strategy where the friendly node closest to the adversary, without close coordination with Alice, produces artificial noise. We show that this method allows Alice to reliably and covertly send $\mathcal{O}(\min\{{n,m^{\gamma/2}\sqrt{n}}\})$ bits to Bob in $n$ channel uses, where $\gamma$ is the path-loss exponent. Moreover, we also consider a setting where there are $N_{\mathrm{w}}$ collaborating adversaries uniformly and randomly located in the environment and show that in $n$ channel uses, Alice can reliably and covertly send $\mathcal{O}\left(\min\left\{n,\frac{m^{\gamma/2} \sqrt{n}}{N_{\mathrm{w}}^{\gamma}}\right\}\right)$ bits to Bob when $\gamma >2$, and $\mathcal{O}\left(\min\left\{n,\frac{m \sqrt{n}}{N_{\mathrm{w}}^{2}\log^2 {N_{\mathrm{w}}}}\right\}\right)$ when $\gamma = 2$. Conversely, under mild restrictions on the communication strategy, we demonstrate that no higher covert throughput is possible for $\gamma>2$.

Includes members:
  Member "privacy preserving mhealth data release with pattern consistency":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "chasing accuracy and privacy and catching both a literature survey on differentially private histogram publication")
  Member "towards provably invisible network flow fingerprints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of covert packet insertion")
  Member "covert communication in the presence of an uninformed jammer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi antenna jamming in covert communication")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communications on renewal packet channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "challenges in covert wireless communications with active warden on awgn channels")
  Member "covert communications on poisson packet channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of covert packet insertion")
  Member "covert single hop communication in a wireless network with distributed artificial noise generation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "challenges in covert wireless communications with active warden on awgn channels")
  Member "reliable deniable and hidable communication over multipath networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stealthy communication over adversarially jammed multipath networks")

Question: Please tell me which class the source paper 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)