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 a poisson field of interferers"):
  Abstract: In this paper, we study covert communication in wireless networks consisting of a transmitter, Alice, an intended receiver, Bob, a warden, Willie, and a Poisson field of interferers. Bob and Willie are subject to uncertain shot noise due to the ambient signals from interferers in the network. With the aid of stochastic geometry, we analyze the throughput of the covert communication between Alice and Bob subject to given requirements on the covertness against Willie and the reliability of decoding at Bob. We consider non-fading and fading channels. We analytically obtain interesting findings on the impacts of the density and the transmit power of the concurrent interferers on the covert throughput. That is, the density and the transmit power of the interferers have no impact on the covert throughput as long as the network stays in the interference-limited regime, for both the non-fading and the fading cases. When the interference is sufficiently small and comparable with the receiver noise, the covert throughput increases as the density or the transmit power of the concurrent interferers increases.

Includes members:
  Member "modeling and analysis of cellular networks using stochastic geometry a tutorial":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "covert wireless communication with artificial noise generation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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 with finite blocklength in awgn channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covert transmission with a self sustained relay")
  Member "on covert communication with noise uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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 "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communication in the presence of an uninformed jammer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi antenna jamming in covert communication")
  Member "cooperative relaying under spatially and temporally correlated interference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "effect of spatial interference correlation on the performance of maximum ratio combining":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")

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)