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: "lpd communication when the warden does not know when"
  Abstract: Unlike standard security methods (e.g. encryption), low probability of detection (LPD) communication does not merely protect the information contained in a transmission from unauthorized access, but prevents the detection of a transmission in the first place. In this work we study the impact of secretly pre-arranging the time of communication. We prove that if Alice has AWGN channels to Bob and the warden, and if she and Bob can choose a single $n$ symbol period slot out of $T(n)$ such slots, keeping the selection secret from the warden (and, thus, forcing him to monitor all $T(n)$ slots), then Alice can reliably transmit $\mathcal{O}(\min\{\sqrt{n\log T(n)},n\})$ bits to Bob while keeping the warden's detector ineffective. The result indicates that only an additional $\log T(n)$ secret bits need to be exchanged between Alice and Bob prior to communication to produce a multiplicative gain of $\sqrt{\log T(n)}$ in the amount of transmitted covert information.

Connected through hyperedge HE-1 (induced by source paper "multi antenna covert communications in random wireless networks"):
  with members:
    - "fundamental limits of covert communication over mimo awgn channel"
    - "covert wireless communication with a poisson field of interferers"
    - "covert communication in fading channels under channel uncertainty"
    - "covert wireless communication with artificial noise generation"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "covert communications with a full duplex receiver over wireless fading channels"
    - "on covert communication with noise uncertainty"
    - "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"
    - "quantum secure covert communication on bosonic channels"

Connected through hyperedge HE-3 (induced by source paper "lpd communication a sequential change point detection perspective"):
  with members:
    - "multi antenna covert communications in random wireless networks"
    - "low probability of detection communication opportunities and challenges"
    - "multi hop routing in covert wireless networks"
    - "covert wireless communication with a poisson field of interferers"
    - "on covert communication with noise uncertainty"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of covert bit insertion in packets"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "asymptotic loss in privacy due to dependency in gaussian traces"
    - "embedding covert information in broadcast communications"
    - "fundamental limits of invisible flow fingerprinting"
    - "privacy preserving mhealth data release with pattern consistency"
    - "privacy against statistical matching inter user correlation"
    - "towards provably invisible network flow fingerprints"
    - "matching anonymized and obfuscated time series to users profiles"

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"
    - "quantum secure covert communication on bosonic channels"
    - "a characterization of the capacity of online causal binary channels"

Connected through hyperedge HE-6 (induced by source paper "embedding covert information in broadcast communications"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "covert communication over a k user multiple access channel"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "time division is optimal for covert communication over some broadcast channels"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "covert bits through queues"
    - "covert communications on poisson packet channels"

Connected through hyperedge HE-7 (induced by source paper "covert wireless communication with artificial noise generation"):
  with members:
    - "privacy preserving mhealth data release with pattern consistency"
    - "towards provably invisible network flow fingerprints"
    - "covert communication in the presence of an uninformed jammer"
    - "covert communication over noisy channels a resolvability perspective"
    - "covert communications on renewal packet channels"
    - "covert communications on poisson packet channels"
    - "covert single hop communication in a wireless network with distributed artificial noise generation"
    - "reliable deniable and hidable communication over multipath networks"

Connected through hyperedge HE-8 (induced by source paper "covert communication in wireless relay networks"):
  with members:
    - "covert communication in fading channels under channel uncertainty"
    - "covert communication with finite blocklength in awgn channels"
    - "on covert communication with noise uncertainty"
    - "fundamental limits of communication with low probability of detection"
    - "artificial noise aided secure transmission with directional modulation based on random frequency diverse arrays"
    - "covert communication over noisy channels a resolvability perspective"
    - "artificial noise aided secure transmission in wiretap channels with transmitter side correlation"
    - "reliable deniable communication hiding messages in noise"

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)