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 communications on poisson packet channels"):
  Abstract: Consider a channel where authorized transmitter Jack sends packets to authorized receiver Steve according to a Poisson process with rate λ packets per second for a time period T. Suppose that covert transmitter Alice wishes to communicate information to covert receiver Bob on the same channel without being detected by a watchful adversary Willie. We consider two scenarios. In the first scenario, we assume that warden Willie cannot look at packet contents but rather can only observe packet timings, and Alice must send information by inserting her own packets into the channel. We show that the number of packets that Alice can covertly transmit to Bob is on the order of the square root of the number of packets that Jack transmits to Steve; conversely, if Alice transmits more than that, she will be detected by Willie with high probability. In the second scenario, we assume that Willie can look at packet contents but that Alice can communicate across an M/M/1 queue to Bob by altering the timings of the packets going from Jack to Steve. First, Alice builds a codebook, with each codeword consisting of a sequence of packet timings to be employed for conveying the information associated with that codeword. However, to successfully employ this codebook, Alice must always have a packet to send at the appropriate time. Hence, leveraging our result from the first scenario, we propose a construction where Alice covertly slows down the packet stream so as to buffer packets to use during a succeeding codeword transmission phase. Using this approach, Alice can covertly and reliably transmit O(λT) covert bits to Bob in time period T over an M/M/1 queue with service rate μ > e · λ.

Includes members:
  Member "covert single hop communication in a wireless network with distributed artificial noise generation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "stealthy communication over adversarially jammed multipath networks")
  Member "lpd communication when the warden does not know when":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi antenna covert communications in random wireless networks")
  Member "quantum noise limited communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "covert communication gains from adversary s ignorance of transmission time")
  Member "reliable deniable communication hiding messages in noise":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "keyless covert communication via channel state information")
  Member "limits of reliable communication with low probability of detection on awgn channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "keyless covert communication via channel state information")
  Member "effective secrecy reliability confusion and stealth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")

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)