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: "time division is optimal for covert communication over some broadcast channels"
  Abstract: We consider a covert communication scenario where a transmitter wishes to communicate simultaneously to two legitimate receivers while ensuring that the communication is not detected by an adversary, the warden. The legitimate receivers and the adversary observe the transmission from the transmitter via a three-user discrete or Gaussian memoryless broadcast channel. We focus on the case where the "no-input" symbol is not redundant, i.e., the output distribution at the warden induced by the no-input symbol is not a mixture of the output distributions induced by other input symbols, so that the covert communication is governed by the square root law, i.e., at most $\Theta(\sqrt{n})$ bits can be transmitted over $n$ channel uses. We show that for such a setting, a simple time-division strategy achieves the optimal throughputs for a non-trivial class of broadcast channels; this is not true for communicating over broadcast channels without the covert communication constraint. Our result implies that a code that uses two separate optimal point-to-point codes each designed for the constituent channels and each used for a fraction of the time is optimal in the sense that it achieves the best constants of the $\sqrt{n}$-scaling for the throughputs. Our proof strategy combines several elements in the network information theory literature, including concave envelope representations of the capacity regions of broadcast channels and El Gamal's outer bound for more capable broadcast channels.

Connected through hyperedge HE-1 (induced by source paper "undetectable radios covert communication under spectral mask constraints"):
  with members:
    - "covert communication over a compound channel"
    - "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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "optimal resolution of change point detection with empirically observed statistics and erasures"):
  with members:
    - "distributed detection with empirically observed statistics"
    - "second order asymptotically optimal statistical classification"
    - "selective review of offline change point detection methods"
    - "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"
    - "asymptotically optimal matching of multiple sequences to source distributions and training sequences"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-3 (induced by source paper "treating interference as noise is optimal for covert communication over interference channels"):
  with members:
    - "throughput scaling of covert communication over wireless adhoc networks"
    - "covert communication over a k user multiple access channel"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "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"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-4 (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"
    - "sufficiently myopic adversaries are blind"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-5 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks"):
  with members:
    - "covert capacity of non coherent rayleigh fading channels"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "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"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "cognitive networks achieve throughput scaling of a homogeneous network"
    - "on capacity scaling in arbitrary wireless networks"

Connected through hyperedge HE-6 (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"
    - "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"
    - "optimal throughput for covert communication over a classical quantum channel"
    - "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-7 (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-8 (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"
    - "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"
    - "lpd communication when the warden does not know when"

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)