human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal throughput for covert communication over a classical quantum channel"
  Abstract: This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the channel to communicate or not. Specifically, the relative entropy between the output quantum states at the eavesdropper when a codeword is transmitted and when no input is provided must be sufficiently small. Extending earlier works, this paper proves the "square-root law" for a broad class of classical-quantum channels: the maximum amount of information that can be reliably and covertly transmitted over $n$ uses of such a channel scales like $\sqrt{n}$. The scaling constant is also determined.

Connected through hyperedge HE-1 (induced by source paper "stealthy communication over adversarially jammed multipath networks"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "covert communication over adversarially jammed channels"
    - "covert communication over a k user multiple access channel"
    - "quadratically constrained myopic adversarial channels"
    - "time division is optimal for covert communication over some broadcast channels"
    - "sufficiently myopic adversaries are blind"
    - "fundamental limits of communication with low probability of detection"

Connected through hyperedge HE-2 (induced by source paper "first and second order asymptotics in covert communication"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "finite blocklength bounds for wiretap channels"
    - "a stronger soft covering lemma and applications"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-3 (induced by source paper "covert communication over a compound channel"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "covert communication over adversarially jammed channels"
    - "time division is optimal for covert communication over some broadcast channels"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-4 (induced by source paper "covert communication over a k user multiple access channel"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "cooperative resolvability and secrecy in the cribbing multiple access channel"
    - "multilevel coded pulse position modulation for covert communications over binary input discrete memoryless channels"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "time division transmission is optimal for covert communication over broadcast channels"
    - "covert wireless communication with artificial noise generation"
    - "mac resolvability first and second order results"

Connected through hyperedge HE-5 (induced by source paper "covert capacity of non coherent rayleigh fading channels"):
  with members:
    - "gaussian signalling for covert communications"
    - "first and second order asymptotics in covert communication"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication in the presence of an uninformed jammer"
    - "covert communication over noisy channels a resolvability perspective"
    - "quantum secure covert communication on bosonic channels"
    - "covert communication gains from adversary s ignorance of transmission time"

Connected through hyperedge HE-6 (induced by source paper "time division is optimal for covert communication over some broadcast channels"):
  with members:
    - "new strong converse for asymmetric broadcast channels"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "quantum secure covert communication on bosonic channels"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"

Question: Please tell me which class the center node 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)