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 communication over mimo awgn channel"):
  Abstract: Fundamental limits of covert communication have been studied in literature for different models of scalar channels. It was shown that, over $n$ independent channel uses, $\mathcal{O}(\sqrt{n})$ bits can transmitted reliably over a public channel while achieving an arbitrarily low probability of detection (LPD) by other stations. This result is well known as square-root law and even to achieve this diminishing rate of covert communication, some form of shared secret is needed between the transmitter and the receiver. In this paper, we establish the limits of LPD communication over the MIMO AWGN channel. We define the notion of $\epsilon$-probability of detection ($\epsilon$-PD) and provide a formulation to evaluate the maximum achievable rate under the $\epsilon$-PD constraint. We first show that the capacity-achieving input distribution is the zero-mean Gaussian distribution. Then, assuming channel state information (CSI) on only the main channel at the transmitter, we derive the optimal input covariance matrix, hence, establishing the $\epsilon$-PD capacity. We evaluate $\epsilon$-PD rates in the limiting regimes for the number of channel uses (asymptotic block length) and the number of antennas (massive MIMO). We show that, in the asymptotic block-length regime, while the SRL still holds for the MIMO AWGN, the number of bits that can be transmitted covertly scales exponentially with the number of transmitting antennas. Further, we derive the $\epsilon$-PD capacity \textit{with no shared secret}. For that scenario, in the massive MIMO limit, higher covert rate up to the non LPD constrained capacity still can be achieved, yet, with much slower scaling compared to the scenario with shared secret. The practical implication of our result is that, MIMO has the potential to provide a substantial increase in the file sizes that can be covertly communicated subject to a reasonably low delay.

Includes members:
  Member "on the compound mimo wiretap channel with mean feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient power and bandwidth allocation in an integrated sub 6 ghz millimeter wave system")
  Member "fundamental limits of communication with low probability of detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "keyless covert communication via channel state information")
  Member "covert communication over noisy channels a resolvability perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "keyless covert communication via channel state information")
  Member "the secrecy capacity of compound gaussian mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  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")

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)