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: "quantum secure covert communication on bosonic channels"
  Abstract: Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth—that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary—for example, thermal noise from blackbody radiation—the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.

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 "fundamental limits of quantum secure covert communication over bosonic channels"):
  with members:
    - "framework for covert and secret key expansion over classical quantum channels"
    - "first and second order asymptotics in covert communication"
    - "polar codes for arbitrary classical quantum channels and arbitrary cq macs"
    - "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"
    - "computationally efficient deniable communication"
    - "covert communication gains from adversary s ignorance of transmission time"

Connected through hyperedge HE-3 (induced by source paper "framework for covert and secret key expansion over classical quantum channels"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "the likelihood encoder for lossy compression"
    - "covert communication over noisy channels a resolvability perspective"
    - "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 communication over adversarially jammed channels"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "quadratically constrained myopic adversarial channels"
    - "second order asymptotics in covert communication"
    - "sufficiently myopic adversaries are blind"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "a characterization of the capacity of online causal binary channels"
    - "lpd communication when the warden does not know when"

Connected through hyperedge HE-6 (induced by source paper "multi hop routing in covert wireless networks"):
  with members:
    - "covert communication achieved by a greedy relay in wireless networks"
    - "energy efficient secrecy in wireless networks based on random jamming"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "jamming based on an ephemeral key to obtain everlasting security in wireless environments"
    - "covert single hop communication in a wireless network with distributed artificial noise generation"
    - "reliable deniable communication hiding messages in noise"

Connected through hyperedge HE-7 (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"
    - "optimal throughput for covert communication over a classical quantum channel"
    - "covert communication gains from adversary s ignorance of transmission time"

Connected through hyperedge HE-8 (induced by source paper "asymptotic coupling and its applications in information theory"):
  with members:
    - "divergence scaling of fixed length binary output one to one distribution matching"
    - "measuring secrecy by the probability of a successful guess"
    - "fundamental limits of communication with low probability of detection"
    - "distributed simulation of continuous random variables"
    - "covert communication over noisy channels a resolvability perspective"
    - "generalized common information common information extraction and private sources synthesis"
    - "source channel secrecy for shannon cipher system"
    - "on the entropy of couplings"

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)