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 "fundamental limits of covert packet insertion"):
  Abstract: Covert communication conceals the existence of the transmission from a watchful adversary. We consider the fundamental limits for covert communications via packet insertion over packet channels whose packet timings are governed by a renewal process of rate $\lambda$. Authorized transmitter Jack sends packets to authorized receiver Steve, and covert transmitter Alice wishes to transmit packets to covert receiver Bob without being detected by watchful adversary Willie. Willie cannot authenticate the source of the packets. Hence, he looks for statistical anomalies in the packet stream from Jack to Steve to attempt detection of unauthorized packet insertion. First, we consider a special case where the packet timings are governed by a Poisson process and we show that Alice can covertly insert $\mathcal{O}(\sqrt{\lambda T})$ packets for Bob in a time interval of length $T$; conversely, if Alice inserts $\omega(\sqrt{\lambda T})$, she will be detected by Willie with high probability. Then, we extend our results to general renewal channels and show that in a stream of $N$ packets transmitted by Jack, Alice can covertly insert $\mathcal{O}(\sqrt{N})$ packets; if she inserts $\omega(\sqrt{N})$ packets, she will be detected by Willie with high probability.

Includes members:
  Member "covert communication over a k user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "undetectable radios covert communication under spectral mask constraints")
  Member "fundamental limits of invisible flow fingerprinting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotic limits of privacy in bayesian time series matching")
  Member "fundamental limits of covert bit insertion in packets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of invisible flow fingerprinting")
  Member "privacy preserving mhealth data release with pattern consistency":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "chasing accuracy and privacy and catching both a literature survey on differentially private histogram publication")
  Member "covert capacity of non coherent rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks")
  Member "towards provably invisible network flow fingerprints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymptotic limits of privacy in bayesian time series matching")
  Member "covert wireless communication with artificial noise generation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints ii a viewpoint of total variation distance")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "keyless covert communication via channel state information")

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.CR(Cryptography and Security)