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 "multi antenna covert communications in random wireless networks"):
  Abstract: This paper studies multi-antenna-aided covert communications coexisting with randomly located wardens and interferers, considering both centralized and distributed antenna systems (CAS/DAS). The throughput performance of the covert communication is analyzed and optimized under a stochastic geometry framework, where the joint impact of the small-scale channel fading and the large-scale path loss is examined. To be specific, two probabilistic metrics, namely, the covert outage probability and the connectivity probability, are adopted to characterize the covertness and reliability of the transmission, respectively, and analytically tractable expressions for the two metrics are derived. The worst-case covert communication scenario is then investigated, {where the wardens invariably can maximize the covert outage probability by adjusting the detection thresholds for their detectors}. Afterwards, the optimal transmit power and transmission rate are jointly designed to maximize the covert throughput subject to a covertness constraint. Interestingly, it is found that the maximal covert throughput for both the CAS and DAS is invariant to the density of interferers and the interfering power, regardless of the number of transmit antennas. Numerical results demonstrate that the CAS outperforms the DAS in terms of the covert throughput for the random network of interest, and the throughput gap between the two systems increases dramatically when the number of transmit antennas becomes larger.

Includes members:
  Member "fundamental limits of covert communication over mimo awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi antenna jamming in covert communication")
  Member "covert wireless communication with a poisson field of interferers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "challenges in covert wireless communications with active warden on awgn channels")
  Member "covert communication in fading channels under channel uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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 wireless communication with artificial noise generation":
    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 "safeguarding decentralized wireless networks using full duplex jamming receivers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "covert communications with a full duplex receiver over wireless fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-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 "fundamental limits of communication with low probability of detection":
    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.IT(Information Theory)